Skip to main content
  • 11 Accesses

Abstract

In several exercises and examples in the preceding chapters we gave sequences of class incarnations, which were concatenated by reference variables. Such a concatenation of incarnation objects is called a ‘list’, or a ‘set’, and the individual incarnation an ‘element’ of the list. We used the following forms of lists.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer Fachmedien Wiesbaden

About this chapter

Cite this chapter

Lamprecht, G. (1981). List Processing. In: Introduction to SIMULA 67. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-663-14077-1_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-663-14077-1_13

  • Publisher Name: Vieweg+Teubner Verlag, Wiesbaden

  • Print ISBN: 978-3-528-03340-8

  • Online ISBN: 978-3-663-14077-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics