Lines Matching defs:no
83 int no = firstAc;
85 while ( no >= 0 ) {
86 int nn = bords[no].other;
87 sum += ValAt(at, bords[nn].pos, bords[no].pos, bords[nn].val, bords[no].val);
88 no = bords[no].next;
958 void IntLigne::Enqueue(int no)
961 firstAc = lastAc = no;
962 bords[no].prev = bords[no].next = -1;
964 bords[no].next = -1;
965 bords[no].prev = lastAc;
966 bords[lastAc].next = no;
967 lastAc = no;
972 void IntLigne::Dequeue(int no)
974 if ( no == firstAc ) {
975 if ( no == lastAc ) {
978 firstAc = bords[no].next;
980 } else if ( no == lastAc ) {
981 lastAc = bords[no].prev;
984 if ( bords[no].prev >= 0 ) {
985 bords[bords[no].prev].next = bords[no].next;
987 if ( bords[no].next >= 0 ) {
988 bords[bords[no].next].prev = bords[no].prev;
991 bords[no].prev = bords[no].next = -1;