Search Results

A new syntactic construct to define processing cycles for collections and series of values in the form of expressions is proposed as part of the development of new programming languages and improvement of existing ones. The proposed construct uses ...

Generators offer an elegant way to express iterators. However, their performance has always been their Achilles heel and has prevented widespread adoption. We present techniques to efficiently implement and optimize generators.

We have implemented our ...

Concurrent data structures are often used with large concurrent software. An iterator that traverses the data structure items is a highly desirable interface that often exists for sequential data structures but is missing from almost all concurrent data-...

A technique for synthesizing iterators from declarative abstraction functions written in a relational logic specification language is described. The logic includes a transitive closure operator that makes it convenient for expressing reachability ...

We present three cache-conscious implementations of STL standard compliant lists. Until now, one could either find simple doubly linked list implementations that easily cope with standard strict requirements, or theoretical approaches that do not take ...

We present a way to represent complex time-based data such as music using ordered timed sequences and coupled lists, emphasizing flexibility and extensibility. We present a number of strategies for traversing systems of aligned, dependent and parallel ...

This paper describes a flexible and easily extensible predicate abstraction-based approach to the verification of STLusage, and observes the advantages of verifying programsin terms of high-level data structures rather than low-level pointer ...

Java iterators are notoriously hard to specify. This paper applies a general typestate specification technique that supports several forms of aliasing to the iterator problem. The presented specification conservatively captures iterator protocols and ...

The ITERATOR pattern gives a clean interface for element-by-element access to a collection. Imperative iterations using the pattern have two simultaneous aspects: mapping and accumulating. Various existing functional iterations model one or other of ...

The benefits of object-oriented programming apply only to programs consisting of multiple objects. Inter-object design patterns make it, in theory, possible for beginning programmers to create well-understood forms of such programs. However, their ...

rdp is a parser generator which accepts Iterator Backus Naur Form productions decorated with attributes and ANSI-C actions and produces recursive descent parsers. It has special support for the generation of tree-based intermediate forms, built-in ...

This paper describes several design patterns found in garbage collectors. The patterns we present are divided into two groups. The first group are two new design patterns: Rootset and TriColour that have been used in the garbage collection domain for up ...

A new mechanism for writing iterators in the C++ programming language is proposed in this paper. It provides a handy notation for writing general iterators easily, and a simple semantics based-on semicoroutines. A set of useful programming idioms for ...

It is shown how loop algorithms can be encompassed in an iterator and then activated for any data type for which a generator can be defined. It takes the iterator-generator idea a step further than previous work in that it permits variations of the ...