Introduction to algorithms
LEDA: a platform for combinatorial and geometric computing
Communications of the ACM
Reuse of algorithms: still a challenge to object-oriented programming
Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Teaching data structure design patterns
SIGCSE '98 Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education
Testers and visualizers for teaching data structures
SIGCSE '99 The proceedings of the thirtieth SIGCSE technical symposium on Computer science education
Data Structures and Algorithms in Java
Data Structures and Algorithms in Java
The C++ Programming Language, Third Edition
The C++ Programming Language, Third Edition
Algorithmic Patterns for Orthogonal Graph Drawing
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
The CGAL Kernel: A Basis for Geometric Computation
FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
| Hi-index | 0.00 |
Many applications require data structures that allow efficient access to their internal organization and to their elements. This feature has been implemented in some libraries with iterators or items. We present an alternative implementation, used in the Library of Data Structures for Java (JDSL). We refine the notion of an item and split it into two related concepts: position and locator. Positions are an abstraction of a pointer to a node or an index into an array; they provide direct access to the in-memory structure of the container. Locators add a level of indirection and allow the user to find a specific element even if the position holding the element changes.