HomeSort by relevance Sort by last modified time
    Searched refs:backwardList (Results 1 - 7 of 7) sorted by null

  /external/srec/tools/grxmlcompile/
sub_supp.cpp 237 if (backwardList)
238 delete [] backwardList;
239 backwardList= sortList;
297 if (backwardList)
298 delete [] backwardList;
299 backwardList= sortList;
317 direction= element - arc[backwardList[rix]]->GetToId();
323 assert (arc[backwardList[rix]]->GetToId() == element);
324 while (rix > 0 && arc[backwardList[rix-1]]->GetToId() == element)
326 assert (arc[backwardList[rix]]->GetToId() == element)
    [all...]
sub_grph.cpp 551 while (rix < sortRevNum && arc[backwardList[rix]]->GetToId() == currId) {
552 if (arc[backwardList[rix]]->GetInput() == procLabel) {
553 PullUpEnds (arc[backwardList[rix]]->GetFromId(), baseId,
556 else if (arc[backwardList[rix]]->GetInput() != DISCARD_LABEL)
557 InheritReverseArc (arc[backwardList[rix]], baseId);
574 while (rix < sortRevNum && arc[backwardList[rix]]->GetToId() == currId) {
575 if (arc[backwardList[rix]]->GetInput() == procLabel) {
576 PullUpEnds (arc[backwardList[rix]]->GetFromId(), currId,
579 nextId= arc[backwardList[rix]]->GetFromId();
788 while (rix < sortRevNum && arc[backwardList[rix]]->GetToId() == currId)
    [all...]
sub_phon.cpp 121 leftC= arc[backwardList[rix]]->GetCentre();
231 && arc[backwardList[fix]]->GetToId() == arc[ii]->GetFromId()) {
234 left= arc[backwardList[fix]]->GetLeft();
247 currId= arc[backwardList[fix]]->GetFromId();
251 arc[backwardList[fix]]->GetOutput(), currId, newId);
342 while (rix < sortRevNum && arc[backwardList[rix]]->GetToId() == currId) {
343 if (arc[backwardList[rix]]->GetOutput() != DISCARD_LABEL // not resolved yet
344 && arc[backwardList[rix]]->GetInput() >= 0) { // excludes word boundary
345 if (arc[backwardList[rix]]->GetOutput() == NONE_LABEL)
346 arc[backwardList[rix]]->AssignOutput (outId)
    [all...]
sub_base.cpp 43 backwardList= 0;
186 while (rix < numArc && arc[backwardList[rix]]->GetToId() == startId) {
187 nextId= arc[backwardList[rix]]->GetFromId();
188 nextInp= arc[backwardList[rix]]->GetInput();
sub_grph.h 120 backwardList= 0;
138 if (backwardList)
139 delete [] backwardList;
219 int *backwardList;
  /external/icu4c/test/intltest/
ssearch.cpp 638 OrderList backwardList;
652 backwardList.add(CollationElementIterator::NULLORDER, iter->getOffset(), iter->getOffset());
663 backwardList.add(order, low, high);
666 backwardList.reverse();
668 if (forwardList.compare(backwardList)) {
671 // logln("Backward offsets: [%s]", printOffsets(buffer, backwardList));
674 // logln("Backward CEs: [%s]", printOrders(buffer, backwardList));
680 infoln("Backward offsets: [%s]", printOffsets(buffer, backwardList));
683 infoln("Backward CEs: [%s]", printOrders(buffer, backwardList));
    [all...]
  /external/chromium_org/third_party/icu/source/test/intltest/
ssearch.cpp 990 OrderList backwardList;
1004 backwardList.add(CollationElementIterator::NULLORDER, iter->getOffset(), iter->getOffset());
1015 backwardList.add(order, low, high);
1018 backwardList.reverse();
1020 if (forwardList.compare(backwardList)) {
1023 // logln("Backward offsets: [%s]", printOffsets(buffer, backwardList));
1026 // logln("Backward CEs: [%s]", printOrders(buffer, backwardList));
1032 infoln("Backward offsets: [%s]", printOffsets(buffer, backwardList));
1035 infoln("Backward CEs: [%s]", printOrders(buffer, backwardList));
    [all...]

Completed in 480 milliseconds