Lines Matching defs:for
16 GNU General Public License for more details.
36 /* Assume ISO C++ 'for' scoping rule. */
37 #define for if (0) ; else for
106 This was the theory for !_hash_includes_len; if _hash_includes_len, slight
134 for (KeywordExt_List *temp = _head; temp; temp = temp->rest())
140 for (KeywordExt_List *temp = _head; temp; temp = temp->rest())
151 expressions don't work correctly for looking up an empty string. */
155 "To recognize an empty input keyword, your code should check for\n"
163 for (KeywordExt_List *temp = _head; temp; temp = temp->rest())
168 for (int i = keyword->_allchars_length; i > 0; k++, i--)
203 for (unsigned int c = 0; c < alpha_size; c++)
205 for (unsigned int c = 'A'; c <= 'Z'; c++)
218 for (KeywordExt_List *temp = _head; temp; temp = temp->rest())
226 for (KeywordExt_List *temp = _head; temp; temp = temp->rest())
245 for (KeywordExt_List *temp = _head; temp; temp = temp->rest())
278 for (KeywordExt_List *l1 = _head; l1 && l1->rest(); l1 = l1->rest())
281 for (KeywordExt_List *l2 = l1->rest(); l2; l2 = l2->rest())
292 for (i = 0; i < n - 1; i++)
309 for (j = i + 1; j < n; j++)
341 for (;;)
346 for (int i = imax; i >= -1; i--)
375 for (;;)
380 for (int i = imax; i >= -1; i--)
409 for (;;)
414 for (int i1 = imax; i1 >= -1; i1--)
416 for (int i2 = imax; i2 >= -1; i2--)
418 for (int i3 = imax; i3 >= 0; i3--)
458 for (int i; (i = iter.next ()) != PositionReverseIterator::EOS; )
503 for (int i = 0; i < _max_key_len; i++)
532 for (unsigned int c = 0; c < alpha_size; c++)
535 for (KeywordExt_List *temp = _head; temp; temp = temp->rest())
542 for (int i; (i = iter.next ()) != PositionIterator::EOS; )
560 for (int a = b; a >= 0 && alpha_unify[a] == b; a -= ('a'-'A'))
576 for (KeywordExt_List *temp = _head; temp; temp = temp->rest())
597 for (KeywordExt_List *temp = _head; temp; temp = temp->rest())
623 for (int i = 0; i < _max_key_len; i++)
634 for (;;)
648 for (;;)
660 /* Perform several rounds of searching for a good alpha increment.
669 for (unsigned int inc = 1; ; inc++)
673 for (unsigned int j = 0; j < nindices; j++)
707 for (unsigned int j = nindices; j-- > 0; )
741 /* Check for duplicates, i.e. keywords with the same _selchars array
752 /* Make hash table for efficiency. */
756 for (temp = _head; temp; )
779 for (int j = 0; j < keyword->_selchars_length; j++)
821 for (temp = _head; temp; temp = temp->rest())
825 for (int count = keyword->_selchars_length; count > 0; ptr++, count--)
840 through different values for _asso_value[c]. */
851 /* Given the bound for _asso_values[c], we have a bound for the possible
855 /* Allocate a sparse bit vector for detection of collisions of hash
869 for (KeywordExt_List *temp = _head; temp; temp = temp->rest())
880 for (KeywordExt_List *temp = _head; temp; temp = temp->rest())
886 for (int j = 0; j < keyword->_selchars_length; j++)
914 for which the _asso_values[] are undetermined:
936 /* The undetermined selected characters for the keywords in this
949 /* Exclusive upper bound for the _asso_values[c] of this step.
982 for (KeywordExt_List *temp = _head; temp; temp = temp->rest())
986 /* Compute the undetermined characters for this keyword. */
991 for (int i = 0; i < keyword->_selchars_length; i++)
997 for (equclass = partition; equclass; equclass = equclass->_next)
1031 for (EquivalenceClass *cls = partition; cls; cls = cls->_next)
1062 for (EquivalenceClass *cls = partition; cls; cls = cls->_next)
1064 for (unsigned int i = 0; i <= m; i++)
1067 for (KeywordExt_List *temp = cls->_keywords; temp; temp = temp->rest())
1072 for (int i = 0; i < keyword->_selchars_length; i++)
1080 for (unsigned int i = 0; i <= m; i++)
1092 for (EquivalenceClass *cls = partition; cls; cls = cls->_next)
1096 for (KeywordExt_List *temp = cls->_keywords; temp; temp = temp->rest())
1101 for (int i = 0; i < keyword->_selchars_length; i++)
1128 for (unsigned int c = 0; c < _alpha_size; c++)
1132 for (unsigned int c = 0; c < _alpha_size; c++)
1135 for (;;)
1151 for (unsigned int c = 0; c < _alpha_size; c++)
1188 this point. It is the set of all c which, for all equivalence
1191 for (unsigned int c = 0; c < _alpha_size; c++)
1207 for (unsigned int c = 0; c < _alpha_size; c++)
1213 for (unsigned int c = 0; c < _alpha_size; c++)
1242 for (Step *step = steps; step; step = step->_next)
1246 for (unsigned int i = 0; i < step->_changing_count; i++)
1255 for (EquivalenceClass *cls = step->_partition; cls; cls = cls->_next)
1258 for (KeywordExt_List *temp = cls->_keywords; temp; temp = temp->rest())
1270 for those c which occur in all keywords with equal multiplicity.) */
1271 for (unsigned int c = 0; c < _alpha_size; c++)
1275 for (Step *step = steps; step; step = step->_next)
1281 for (unsigned int i = 0; i < k; i++)
1291 for (unsigned int i = 0; i < k; i++)
1295 for (;;)
1300 for (EquivalenceClass *cls = step->_partition; cls; cls = cls->_next)
1305 for (KeywordExt_List *ptr = cls->_keywords; ptr; ptr = ptr->rest())
1309 /* Compute the new hash code for the keyword, leaving apart
1316 for (; i > 0; p++, i--)
1344 /* The way we try various values for
1347 for (bound = 0,1,...)
1348 for (ii = 0,...,k-1)
1448 for (unsigned int i = 0; i < step->_changing_count; i++)
1480 for (; i > 0; p++, i--)
1493 /* Search for good _asso_values[]. */
1517 for (;;)
1527 for (KeywordExt_List *ptr = _head; ptr; ptr = ptr->rest())
1550 /* Prepare for next iteration. */
1569 /* Comparison function for sorting by increasing _hash_value. */
1601 for (KeywordExt_List *curr_ptr = _head; curr_ptr; curr_ptr = curr_ptr->rest())
1629 for (temp = _head; temp->rest(); temp = temp->rest())
1633 for (unsigned int c = 0; c < _alpha_size; c++)
1639 for (unsigned int c = 0; c < _alpha_size; c++)
1653 for (unsigned int i = 0; i < _alpha_size; i++)
1667 for (KeywordExt_List *ptr = _head; ptr; ptr = ptr->rest())
1673 for (int j = 0; j < ptr->first()->_selchars_length; j++)