Lines Matching full:hash
59 * Hash Nodes:: All identifiers are entered into a hash table.
91 File: cppinternals.info, Node: Lexer, Next: Hash Nodes, Prev: Conventions, Up: Top
365 File: cppinternals.info, Node: Hash Nodes, Next: Macro Expansion, Prev: Lexer, Up: Top
367 Hash Nodes
370 When cpplib encounters an "identifier", it generates a hash code for it
371 and stores it in the hash table. By "identifier" we mean tokens with
377 Each node in the hash table contain various information about the
385 entered in the hash table during initialization. The hash node
396 entering it in the hash table. An assertion's node points to a
410 and pasting macro operators `#' and `##'. Named operator hash
414 The same identifiers share the same hash node. Since each identifier
415 token, after lexing, contains a pointer to its hash node, this is used
418 hash node with the index of that argument. This makes duplicated
423 stored in its hash node, so that directive lookup is also O(1).
426 File: cppinternals.info, Node: Macro Expansion, Next: Token Spacing, Prev: Hash Nodes, Up: Top
451 its parameters, in the form of an ordered list of pointers to the hash
998 * assertions: Hash Nodes. (line 6)
1003 * hash table: Hash Nodes. (line 6)
1005 * identifiers: Hash Nodes. (line 6)
1011 * macros: Hash Nodes. (line 6)
1013 * named operators: Hash Nodes. (line 6)
1028 Node: Hash Nodes18271
