Lines Matching refs:buckets

5 [section:buckets The Data Structure]
7 The containers are made up of a number of 'buckets', each of which can contain
9 boost::unordered_set unordered_set] with 7 buckets containing 5 elements, `A`,
11 have more buckets).
13 [diagram buckets]
20 then the number of buckets, so the container applies another transformation to
27 evenly distributed amongst the buckets so only a small number of elements will
48        <entry>'''The number of buckets.'''</entry>
52         <entry>'''An upper bound on the number of buckets.'''</entry>
86 [h2 Controlling the number of buckets]
89 of elements in the buckets will increase causing performance to degrade.
95 number of buckets is chosen, but it does make some requirements based on the
103 * Specify the minimum number of buckets when constructing a container or
120         [Construct an empty container with at least `n` buckets (`X` is the container type).]
124         [Construct an empty container with at least `n` buckets and insert elements
141         [Changes the number of buckets so that there at least `n` buckets, and
153 change the number of buckets when this happens. While iterators can be
165 [blurb Note: `rehash`'s argument is the minimum number of buckets, not the