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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights 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
DOI: https://doi.org/10.1007/978-1-4302-4159-1_16
Publisher Name: Apress
Print ISBN: 978-1-4302-4158-4
Online ISBN: 978-1-4302-4159-1
eBook Packages: Professional and Applied ComputingProfessional and Applied Computing (R0)Apress Access Books