Related:

• walk: n.,vt. Traversal of a data structure, especially an array or linked-list data structure in {core}.
  See also {codewalker}, {silly walk}, {clobber}. -- The AI Hackers Dictionary...
• mash the stack: [C programming] n. To corrupt the execution stack by writing past the end of a local array or other data structure.
  Code that smashes the stack can cause a return from the routine to jump to a random address, resulting in some of the most insidious data-dependent bugs known to mankind....
• mash the stack n. [C programming] To corrupt the execution stack by writing past the end of a local array or other data structure.
  Code that smashes the stack can cause a return from the routine to jump to a random address, resulting in some of the most insidious data-dependent bugs known to mankind....
• walk off the end of vt. To run past the end of an array, list, or medium after stepping through it -- a good way to land in trouble.
  Often the result of an off-by-one error. Compare clobber, roach, smash the stack...
• What is a free list? A data structure on a North American computer.
• chase pointers 1. vi. To go through multiple levels of indirection, as in traversing a linked list or graph structure.
  Used esp. by programmers in C, where explicit pointers are a very common data type....
• chase pointers: 1. vi. To go through multiple levels of indirection, as in traversing a linked list or graph structure.
  Used esp. by programmers in C, where explicit pointers are a very common data type....
• wizzle v. To convert external names, array indice
  or references within a data structure into address pointers when the data structure is brought into main memory from external storage (also called `pointer swizzling')...
• wizzle: v. To convert external names, array indice
  or references within a data structure into address pointers when the data structure is brought into main memory from external storage (also called `pointer swizzling')...