Skip to main content

Reference Type and Operation

  • Chapter
packetC Programming

Abstract

After reaching the halfway point in this book, have you finally hit the wall on still trying to figure out how the language gets away without pointers? Array slices, databases that can insert and delete entries provide some clever ways to avoid them, but at some point some of the data structures will need to have a pointer to another structure. But how would that work with the strict typing? Some complex data types have a real need for selecting between multiple other complex data types, such as building a relational database or even trying to determine which table of strings to scan based upon a match protocol field in header analysis. Welcome to the need for references.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2011 CloudShield Technologies, Inc. An SAIC Company

About this chapter

Cite this chapter

Jungck, P., Duncan, R., Mulcahy, D. (2011). Reference Type and Operation. In: packetC Programming. Apress. https://doi.org/10.1007/978-1-4302-4159-1_16

Download citation

Publish with us

Policies and ethics