Lines Matching refs:next
170 logger->log("Cannot deduce distance from empty using next element. Something is very wrong! Line:");
246 while(exemplarUSetIter.next()) {
317 curr->next = *(sortingArray+i+1);
349 while(it1.next()) {
721 if(left->right && left->right->previous && left->right->next) {
725 test.setToConcat(left->left, left->right->next);
736 if(right->previous && right->next) {
738 trial2.setToConcat(left, right->next);
748 if(left->previous && left->next) {
750 trial2.setToConcat(left->next, right);
763 if(right->right && right->right->strengthFromEmpty > UCOL_PRIMARY && right->left->previous && right->left->next) { // maybe we already had a contraction with an accent
766 test.setToConcat(right->left->next, right->right);
1213 if(toSort[i]->next && toSort[i]->previous) {
1214 toSort[i]->previous->next = toSort[i]->next;
1216 if(toSort[i]->previous && toSort[i]->next) {
1217 toSort[i]->next->previous = toSort[i]->previous;
1268 toSort[i]->previous->next = toSort[i]->next;
1272 if(toSort[i]->next) {
1273 toSort[i]->next->previous = toSort[i]->previous;
1277 toSort[i]->next = toSort[j]->next;
1279 toSort[j]->next = toSort[i];
1280 if(toSort[i]->next) {
1281 toSort[i]->next->previous = toSort[i];
1312 current = current->next;
1316 toAdd->next = NULL;
1318 last->next = toAdd;
1325 toAdd->next = current;
1328 current->previous->next = toAdd;
1342 current=current->next;
1363 c = c->next;
1394 while((i < linesSize && !useLinks) || (previous->next && useLinks)) {
1396 line = previous->next;
1470 lines[i-1].next = &lines[i];
1492 while(previous->next) {
1494 line = previous->next;
1529 while(i < size || previous->next) {
1531 line = previous->next;
1626 while((i < size && !useLinks) || (line->next && useLinks)) {
1632 line = line->next;
1687 while((i < size && !useLinks) || (line->next && useLinks)) {
1693 line = line->next;
1750 while((i < size && !useLinks) || (line->next && useLinks)) {
1756 line = line->next;
1798 refLine = refLine->next;
1802 myLine = myLine->next;
1808 myLine = myLine->next;
1810 refLine = refLine->next;
1829 myLine = myLine->next;
1840 refLine = refLine->next;
1854 refLine = refLine->next;
1859 myLine = myLine->next;
1876 // we will try substitution next
1878 myLine = myLatestEqual->next;
1880 refLine = refLine->next;
1890 myLine = myLine->next;
1891 refLine = refLine->next;
1898 myLine = myLine->next;
1899 refLine = refLine->next;
1907 if(myLatestEqual->next != myLine || refLine == NULL) {
1916 myStart = myStart->next;
1945 refStart = refStart->next;
1947 myStart = myStart->next;
1982 start = start->next;
1989 start = start->next;
2011 while(repertoireIter.next()) {