Skip Navigation

The Computer Journal 1985 28(1):44-53; doi:10.1093/comjnl/28.1.44
© 1985 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Goller, N. E.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Hybrid Data Structures Defined by Indirection

N. E. Goller *

Faculty of the Built Environment, Polytechnic of the South Bank, Wandsworth Road, London, UK

In a typeless language such as BCPL, data structures may easily be defined by means of an indirection operator. This useful way of defining data structures is here extended so as to apply to a type-rich language.

Each structure is defined by its structure graph, which is built at compile-time according to certain rules that are explained. A structure built in this way is called a hybrid data structure. Examples are given to show how these structures may be used in programming.


* Operational Research Executive, NCB, Coal House, Lyon Road, Harrow, Middlesex, UK; now at Faculty of the Built Environment, Polytechnic of the South Bank, Wandsworth Road, London SW8


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.