Lines Matching refs:previous
157 logger->log("Cannot deduce distance from empty using previous element. Something is very wrong! Line:");
318 (*(sortingArray+i+1))->previous = curr;
693 // check whether the previous is contraction and if not, add the current
721 if(left->right && left->right->previous && left->right->next) {
722 test.setToConcat(left->left, left->right->previous);
736 if(right->previous && right->next) {
737 trial1.setToConcat(left, right->previous);
748 if(left->previous && left->next) {
749 trial1.setToConcat(left->previous, 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
764 test.setToConcat(right->left->previous, right->right);
810 SortedLines::getExpansionLine(const Line &expansion, const Line &previous, const Line &exp, Line &expansionLine)
849 // have been detected in the previous iteration.
854 trial = previous;
876 trial = previous;
1033 Line *previous, trial, expansionLine;
1088 previous = toSort[j];
1089 if(previous->strengthFromEmpty >= UCOL_IDENTICAL ||
1090 (previous->strengthFromEmpty == UCOL_SECONDARY
1092 && previous->lastCC > UB[strength]->firstCC)) {
1096 //trial.setToConcat(previous, UB[strength]);
1097 trial.setToConcat(previous, UB[probe.getStrength(*toSort[j], *toSort[i])]);
1136 // have been detected in the previous iteration.
1141 trial = *previous;
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;
1267 if(toSort[i]->previous) {
1268 toSort[i]->previous->next = toSort[i]->next;
1273 toSort[i]->next->previous = toSort[i]->previous;
1278 toSort[i]->previous = toSort[j];
1281 toSort[i]->next->previous = toSort[i];
1315 toAdd->previous = last;
1326 toAdd->previous = current->previous;
1327 if(current->previous) {
1328 current->previous->next = toAdd;
1332 current->previous = toAdd;
1351 current=current->previous;
1375 Line *previous = sortedLines[0];
1379 if(previous->isReset) {
1381 result.append(previous->name, previous->len);
1384 result.append(previous->stringToName(previous->name, previous->len));
1387 } else if(!previous->isRemoved) {
1388 result.append(previous->toString(pretty));
1394 while((i < linesSize && !useLinks) || (previous->next && useLinks)) {
1396 line = previous->next;
1420 previous = line;
1469 lines[i].previous = &lines[i-1];
1486 Line *previous = toSort[0];
1489 previous->write(buff, 256, status);
1492 while(previous->next) {
1494 line = previous->next;
1501 previous = line;
1515 Line *previous = toSort[0];
1516 if(previous->isReset) {
1521 result.append(previous->name, previous->len);
1522 } else if(!previous->isRemoved) {
1523 result.append(previous->toString(pretty));
1529 while(i < size || previous->next) {
1531 line = previous->next;
1552 previous = line;
1831 transferCumulativeStrength(myLine->previous, myLine);
1842 transferCumulativeStrength(refLine->previous, refLine);
1856 transferCumulativeStrength(refLine->previous, refLine);
1861 transferCumulativeStrength(myLine->previous, myLine);
1882 transferCumulativeStrength(refLine->previous, refLine);
1897 if(myLine && refLine && myLine->previous->strength < myLine->strength) {
1971 SortedLines::transferCumulativeStrength(Line *previous, Line *that) {
1972 if(that->strength > previous->cumulativeStrength) {
1973 that->cumulativeStrength = previous->cumulativeStrength;