Index
A
Abstract data structures
Actual object
Address
aligned_alloc() function
Alignment
alignof()
Allocation functions
Allocation pools
adding resizing
deallocation adding
struct node objects
tree nodes
Arbitrary types
Array
address
arguments
bounds
collections of objects
const pointers
declare
function arguments
function parameters
index swapping
integers
integers/pointers, adding/subtracting
length
local variable
memory layout
memory location
notations
parameters
pointers
range
reverse_pointers()
sizeof()
struct
terminal padding
value
while-loop solution
Array solution
compact0() function
implementation
non-zero element
procedure
Assignments
const and pointers
pointers to pointers
B
Big-endian/little-endian
Binary search trees
Bit pattern
Bucket sorts
algorithm
data structure
function
implementation ...

Get Pointers in C Programming: A Modern Approach to Memory Management, Recursive Data Structures, Strings, and Arrays now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.