Lines Matching refs:weights
103 * weights are stashed in an RB tree sorted by relative "priority".
189 * Individual characters have a sequence of weights as well.
217 static RB_HEAD(weights, weight) weights[COLL_WEIGHTS_MAX];
236 * We keep a running tally of weights.
242 * This array collects up the weights for each level.
362 RB_GENERATE_STATIC(weights, weight, entry, weight_compare);
469 RB_INIT(&weights[i]);
618 /* save off the weights were we can find them */
722 * different weights than the range members.
733 * pick all of the saved weights for the
859 fprintf(stderr,"too many weights (max %d)", NUM_WT);
1031 /* Substitution priorities are not weights */
1035 if (RB_FIND(weights, &weights[pass], &srch) != NULL)
1043 RB_INSERT(weights, &weights[pass], w);
1070 if ((w = RB_FIND(weights, &weights[pass], &srch)) == NULL) {
1124 * weights that we use for each sorting level.
1144 * Now we walk the entire set of weights, removing the gaps
1145 * in the weights. This gives us optimum usage. The walk
1150 RB_FOREACH(w, weights, &weights[i]) {