gperf/src/search.cc

917    keywords.  The equivalence classes partition the keyword set.  (At the
918    beginning, the partition is the finest possible: each K is an equivalence
921    The partition before a step is always a refinement of the partition
923    We choose the steps in such a way that the partition really becomes
925    without changing the partition is better merged with the previous step,
953   /* The keyword set partition after this step.  */
979   EquivalenceClass *partition = NULL;
996       for (equclass = partition; equclass; equclass = equclass->_next)
1010           if (partition)
1013             partition = equclass;
1030   for (EquivalenceClass *cls = partition; cls; cls = cls->_next)
1033   return partition;
1037 delete_partition (EquivalenceClass *partition)
1039   while (partition != NULL)
1041       EquivalenceClass *equclass = partition;
1042       partition = equclass->_next;
1050    chosen, leading to the given partition.  */
1052 Search::count_possible_collisions (EquivalenceClass *partition, unsigned int c) const
1061   for (EquivalenceClass *cls = partition; cls; cls = cls->_next)
1087    partition.  */
1089 Search::unchanged_partition (EquivalenceClass *partition, unsigned int c) const
1091   for (EquivalenceClass *cls = partition; cls; cls = cls->_next)
1136         /* Compute the partition that needs to be refined.  */
1137         EquivalenceClass *partition = compute_partition (undetermined);
1154                   count_possible_collisions (partition, c);
1165               delete_partition (partition);
1178         step->_partition = partition;
1183         partition = compute_partition (undetermined);
1192               && unchanged_partition (partition, c))
1228         delete_partition (partition);