ocrc.c#237        int largest;
#239        for(largest=0;largest<store->ntriples;largest++) {
#240            if(store->triples[largest].key[0] != '\0') break;
#242        OCASSERT(store->triples[largest].key[0] != '\0');
#245                int lexorder = strcmp(store->triples[i].host,store->triples[largest].host);
#247                int lenlarge = strlen(store->triples[largest].host);
#250                if(leni != 0 && lenlarge == 0) largest = i;
#251                else if(lexorder > 0) largest = i;
#255        OCASSERT(store->triples[largest].key[0] != 0);
#256        sorted[nsorted] = store->triples[largest];
#257        store->triples[largest].key[0] = '\0'; /* kill entry */


HyperKWIC - Version 7.20DA executed at 11:37 on 27 Oct 2017 | Polyhedron Solutions - INTERNAL USE | COMMERCIAL (Any O/S) SN 4AKIed