Lines Matching defs:alpha_unify
115 sum (asso_values[alpha_unify[keyword[i] + alpha_inc[i]]] : i in Pos)
118 where alpha_unify[c] is chosen so that an upper/lower case change in
119 keyword[i] doesn't change alpha_unify[keyword[i] + alpha_inc[i]].
202 unsigned int *alpha_unify = new unsigned int[alpha_size];
204 alpha_unify[c] = c;
206 alpha_unify[c] = c + ('a'-'A');
207 return alpha_unify;
216 Search::init_selchars_tuple (const Positions& positions, const unsigned int *alpha_unify) const
219 temp->first()->init_selchars_tuple(positions, alpha_unify);
235 Search::count_duplicates_tuple (const Positions& positions, const unsigned int *alpha_unify) const
240 init_selchars_tuple (positions, alpha_unify);
270 /* Compute preliminary alpha_unify table. */
271 unsigned int *alpha_unify = compute_alpha_unify ();
340 count_duplicates_tuple (current, alpha_unify);
352 count_duplicates_tuple (tryal, alpha_unify);
386 count_duplicates_tuple (tryal, alpha_unify);
426 count_duplicates_tuple (tryal, alpha_unify);
479 /* Free preliminary alpha_unify table. */
480 delete[] alpha_unify;
490 unsigned int *alpha_unify = compute_alpha_unify ();
491 unsigned int count = count_duplicates_tuple (_key_positions, alpha_unify);
492 delete[] alpha_unify;
526 at a multiple of 32. So in the end the alpha_unify vector has
531 unsigned int *alpha_unify = new unsigned int[alpha_size];
533 alpha_unify[c] = c;
558 unsigned int d = alpha_unify[c];
560 for (int a = b; a >= 0 && alpha_unify[a] == b; a -= ('a'-'A'))
561 alpha_unify[a] = d;
565 return alpha_unify;
574 Search::init_selchars_multiset (const Positions& positions, const unsigned int *alpha_unify, const unsigned int *alpha_inc) const
577 temp->first()->init_selchars_multiset(positions, alpha_unify, alpha_inc);
591 unsigned int *alpha_unify = compute_alpha_unify (_key_positions, alpha_inc);
592 init_selchars_multiset (_key_positions, alpha_unify, alpha_inc);
606 delete[] alpha_unify;