Lines Matching full:hash
58 * Hash Nodes:: All identifiers are entered into a hash table.
90 File: cppinternals.info, Node: Lexer, Next: Hash Nodes, Prev: Conventions, Up: Top
364 File: cppinternals.info, Node: Hash Nodes, Next: Macro Expansion, Prev: Lexer, Up: Top
366 Hash Nodes
369 When cpplib encounters an "identifier", it generates a hash code for it
370 and stores it in the hash table. By "identifier" we mean tokens with
376 Each node in the hash table contain various information about the
384 entered in the hash table during initialization. The hash node
395 entering it in the hash table. An assertion's node points to a
409 and pasting macro operators `#' and `##'. Named operator hash
413 The same identifiers share the same hash node. Since each identifier
414 token, after lexing, contains a pointer to its hash node, this is used
417 hash node with the index of that argument. This makes duplicated
422 stored in its hash node, so that directive lookup is also O(1).
425 File: cppinternals.info, Node: Macro Expansion, Next: Token Spacing, Prev: Hash Nodes, Up: Top
450 its parameters, in the form of an ordered list of pointers to the hash
997 * assertions: Hash Nodes. (line 6)
1002 * hash table: Hash Nodes. (line 6)
1004 * identifiers: Hash Nodes. (line 6)
1010 * macros: Hash Nodes. (line 6)
1012 * named operators: Hash Nodes. (line 6)
1027 Node: Hash Nodes18244
