Searched refs:_asso_values (Results 1 - 5 of 5) sorted by relevance

/freebsd-10.1-release/contrib/gperf/src/
H A Doutput.h151 const int * const _asso_values; member in class:Output
H A Dsearch.h91 /* Finds some _asso_values[] that fit. */
94 /* Computes a keyword's hash value, relative to the current _asso_values[],
98 /* Finds good _asso_values[]. */
143 int * _asso_values; member in class:Search
150 /* Exclusive upper bound for every _asso_values[c]. A power of 2. */
H A Dsearch.cc829 _asso_values = new int[_alpha_size];
850 /* Given the bound for _asso_values[c], we have a bound for the possible
901 /* Finds some _asso_values[] that fit. */
903 /* The idea is to choose the _asso_values[] one by one, in a way that
906 one or more _asso_values[c]. The result of choosing one or more
907 _asso_values[c] is that the partitioning of the keyword set gets
909 Look at this partitioning: After every step, the _asso_values[] of a
913 for which the _asso_values[] are undetermined:
924 broader at each step. (A step that only chooses an _asso_values[c]
948 /* Exclusive upper bound for the _asso_values[
[all...]
H A Dmain.cc113 searcher._asso_values);
H A Doutput.cc75 - Accidental duplicates, i.e. keywords for which the _asso_values[] search
104 _asso_values (asso_values)
811 printf ("%*d", field_width, _asso_values[count]);

Completed in 47 milliseconds