Lines Matching refs:previous
480 (*currLine)->previous = *prevLine;
533 Line *previous = *lines;
534 if(previous->isReset) {
536 escapeALine(previous, file);
537 } else if(!previous->isRemoved) {
538 printLine(previous, file);
541 while(i < size && previous->next) {
543 line = previous->next;
560 previous = line;
573 line->previous = prev;
592 toInsert->previous->next = toInsert->next;
593 toInsert->next->previous = toInsert->previous;
609 toInsert->previous = *(gLines+i-1);
611 toInsert->previous->next = toInsert;
612 toInsert->next->previous = toInsert;
674 toMove->next->strength = probeStrength(&(toMove->previous), &(toMove->next), comparer);
675 toMove->next->previous = toMove->previous;
677 if(toMove->previous) {
678 toMove->previous->next = toMove->next;
682 toMove->previous = current->previous;
685 if(current->previous) {
686 current->previous->next = toMove;
688 current->previous = toMove;
700 // such line would consist of previous (or next) concatenated with the expansion value
703 u_strcpy(fullString, toMove->previous->name);
706 toMove->previous->next = toMove->next;
707 toMove->next->previous = toMove->previous;
719 toMove->previous->next = toMove->next;
720 toMove->next->previous = toMove->previous;
820 // Could be the previous, but could also be the current.
824 // First, lets check whether the previous has jumped back
840 // add all the previous elements with smaller strength, since they also
905 // preserve index and previous
1156 Line *previous = NULL;
1164 if(current->previous && current->previous->isRemoved == true) {
1165 previous = current->previous;
1166 while(previous && (previous->strength > current->strength || previous->isExpansion || previous->isContraction) && previous->isRemoved) {
1167 if(previous->previous && previous->previous->isRemoved) {
1168 previous = previous->previous;
1173 if(previous) {
1174 previous->isReset = true;
1195 // Establish who is previous according to the sort order