Lines Matching full:dictionary

40     * Accumulating references in a dictionary of lists:
74 Tunable Dictionary Parameters
84 * Maximum dictionary load in PyDict_SetItem.  Currently set to 2/3.
98     depending on the size of the dictionary.  Setting to *4
101 * Maximum sparseness (minimum dictionary load).  What percentage
102     of entries can be unused before the dictionary shrinks to
121 While making a dictionary more sparse reduces collisions, it impairs
123 entry.  Doubling the size of dictionary results in twice as many
126 Also, every dictionary iterates at least twice, once for the memset()
129 Dictionary operations involving only a single key can be O(1) unless 
131 dictionary can grow (and may *require* resizing), other operations
133 are reduced. In particular, an algorithm that empties a dictionary
135 not be necessary at all because the dictionary is eventually
152 where the whole dictionary fits into a pair of cache lines.  It also
164 * If the dictionary is kept sparse (through the tunable parameters),
172 * If the use case for a dictionary is known to have a random key
209 particular search method.  Since some dictionary use cases have known
216    The builtin namespace is a prime example of a dictionary that can
219 2) Dictionary creation time can be shortened in cases where the ultimate
220    size of the dictionary is known in advance.  The dictionary can be
225    strategy arise whenever a dictionary is created from a key or item
238    for this strategy arise in symbol tables and in the builtin dictionary.
243 Some dictionary use cases pass through a build stage and then move to a
245 dictionary.
247 An idea that emerged on python-dev is to be able to convert a dictionary
251 The dictionary can be immediately rebuilt (eliminating dummy entries),
258 so that dictionary iteration can proceed in len(d) steps instead of