Package org.apache.uima.internal.util.rb_trees

Examples of org.apache.uima.internal.util.rb_trees.IntRedBlackTree

114
115
116
117
118
119
120
121
122
123
124
125
    // ContentHandler.
    private XCASDocSerializer(ContentHandler ch, CASImpl cas) {
      super();
      this.ch = ch;
      this.cas = cas;
      this.queued = new IntRedBlackTree();
      this.duplicates = new IntRedBlackTree();
      this.numDuplicates = 0;
      this.dupVectors = new Vector();
      this.queue = new IntStack();
      this.indexedFSs = new IntVector();
      this.indexReps = new IntVector();
View Full Code Here
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
            XmiSerializationSharedData sharedData, MarkerImpl marker) {
      super();
      this.ch = ch;
      this.eh = eh;
      this.cas = cas;
      this.visited = new IntRedBlackTree();
      this.queue = new IntStack();
      this.indexedFSs = new IntVector();
      // this.sofaTypeCode = cas.getTypeSystemImpl().getTypeCode(CAS.TYPE_NAME_SOFA);
      // this.annotationTypeCode = cas.getTypeSystemImpl().getTypeCode(CAS.TYPE_NAME_ANNOTATION);
      this.listUtils = new ListUtils(cas, logger, eh);
      this.arrayAndListFSs = new IntRedBlackTree();
      this.sharedData = sharedData;
      this.isFiltering = filterTypeSystem != null && filterTypeSystem != cas.getTypeSystemImpl();
      if (marker != null ) {
        if (marker.isValid())
          this.marker = marker;
View Full Code Here
356
357
358
359
360
361
362
363
364
365
366
367
368
    this.types = new ArrayList<Type>();
    this.types.add(null);
    this.features = new ArrayList<Feature>();
    this.features.add(null);
    this.stringSets = new ArrayList<String[]>();
    this.stringSetMap = new IntRedBlackTree();
    this.componentToArrayTypeMap = new IntRedBlackTree();
    this.arrayToComponentTypeMap = new IntRedBlackTree();
    this.arrayCodeToTypeMap = new RedBlackTree<TypeImpl>();
    this.parents = new IntVector();
    this.parents.add(0);

    this.casMetadata = new CASMetadata(this);
View Full Code Here
115
116
117
118
119
120
121
122
123
124
125
126
    // ContentHandler.
    private XCASDocSerializer(ContentHandler ch, CASImpl cas) {
      super();
      this.ch = ch;
      this.cas = cas;
      this.queued = new IntRedBlackTree();
      this.duplicates = new IntRedBlackTree();
      this.numDuplicates = 0;
      this.dupVectors = new Vector<IntVector>();
      this.queue = new IntStack();
      this.indexedFSs = new IntVector();
      this.indexReps = new IntVector();
View Full Code Here
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
            XmiSerializationSharedData sharedData, MarkerImpl marker) {
      super();
      this.ch = ch;
      this.eh = eh;
      this.cas = cas;
      this.visited = new IntRedBlackTree();
      this.queue = new IntStack();
      this.indexedFSs = new IntVector();
      // this.sofaTypeCode = cas.getTypeSystemImpl().getTypeCode(CAS.TYPE_NAME_SOFA);
      // this.annotationTypeCode = cas.getTypeSystemImpl().getTypeCode(CAS.TYPE_NAME_ANNOTATION);
      this.listUtils = new ListUtils(cas, logger, eh);
      this.arrayAndListFSs = new IntRedBlackTree();
      this.sharedData = sharedData;
      this.isFiltering = filterTypeSystem != null && filterTypeSystem != cas.getTypeSystemImpl();
      if (marker != null ) {
        if (marker.isValid())
          this.marker = marker;
View Full Code Here
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
  public int updateFloatList(int addr, List<String> stringValues) throws SAXException  {
    int first = addr;
    int currLength = this.getLength(this.neFloatListType, addr);
    int curNode = addr;
    int prevNode = 0;
    IntRedBlackTree visited = new IntRedBlackTree();
    boolean foundCycle = false;
    int i =0;
   
    //if (currLength != stringValues.size() ) { 
  //   first = createFloatList(stringValues);
  if (currLength < stringValues.size()) {
    while (cas.getHeapValue(curNode) == neFloatListType) {
      if (!visited.put(curNode, curNode)) {
                 foundCycle = true;
                 break;
      }
      float value = Float.parseFloat(stringValues.get(i++));
      cas.setFeatureValue(curNode,floatHeadFeat, value);
      prevNode = curNode;
      curNode = cas.getHeapValue(curNode + cas.getFeatureOffset(floatTailFeat));
    }
    //add nodes for remaining values
    if (i < stringValues.size()) {
      int emptyListFs = curNode;
      //check that first is efloatlisttype
      while (i < stringValues.size()) {
        int newNode = cas.ll_createFS(neFloatListType);
        float value = Float.parseFloat((String) stringValues.get(i++));
        cas.setFeatureValue(newNode,floatHeadFeat, value);
        cas.setFeatureValue(newNode, floatTailFeat, emptyListFs);
        cas.setFeatureValue(prevNode, floatTailFeat, newNode);
        prevNode = newNode;
      }
    }
  } else if (currLength > stringValues.size()) {
    while (cas.getHeapValue(curNode) == neFloatListType && i < stringValues.size()) {
      if (!visited.put(curNode, curNode)) {
                   foundCycle = true;
                   break;
      }
      float value = Float.parseFloat((String) stringValues.get(i++));
      cas.setFeatureValue(curNode,floatHeadFeat, value);
      curNode = cas.getHeapValue(curNode + cas.getFeatureOffset(floatTailFeat));
    } 
    int finalNode = curNode;
        //loop till we get a FS that is of type eStringListType
        while (cas.getHeapValue(curNode) == neFloatListType) {
          if (!visited.put(curNode, curNode)) {
            foundCycle = true;
            break;
          //TODO throw exc
          }
          curNode = cas.getHeapValue(curNode + cas.getFeatureOffset(floatTailFeat));
        }
        //set the tail feature to eStringListType fs
        cas.setFeatureValue(finalNode, floatTailFeat, curNode);
    } else {
      while (cas.getHeapValue(curNode) == neFloatListType) {
        if (!visited.put(curNode, curNode)) {
           foundCycle = true;
           break;
        }
        float value = Float.parseFloat((String) stringValues.get(i++));
        cas.setFeatureValue(curNode,floatHeadFeat,  CASImpl.float2int(value));
View Full Code Here
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
 
  public int updateFsList(int addr, List<String> stringValues, IntVector fsAddresses) throws SAXException  {
    int first = addr;
    int currLength = this.getLength(this.neFsListType, addr);
    boolean foundCycle = false;
    IntRedBlackTree visited = new IntRedBlackTree();
    int curNode = addr;
    int prevNode = 0;
   
    //if (currLength != stringValues.size() ) { 
  //   first = createFsList(stringValues, fsAddresses);
    int i=0;
    if (currLength < stringValues.size() ) {   
      while (cas.getHeapValue(curNode) == neFsListType) {
        if (!visited.put(curNode, curNode)) {
               foundCycle = true;
               break;
        }
        int value = Integer.parseInt(stringValues.get(i++));
        cas.setFeatureValue(curNode,fsHeadFeat, value);
        fsAddresses.add(curNode);
        prevNode = curNode;
        curNode = cas.getHeapValue(curNode + cas.getFeatureOffset(fsTailFeat));
      }
      //add nodes for remaining values
      if (i < stringValues.size()) {
        int emptyListFs = curNode;
        //check that first is estringlisttype
        while (i < stringValues.size()) {
          int newNode = cas.ll_createFS(neFsListType);
          int value = Integer.parseInt((String) stringValues.get(i++));
          cas.setFeatureValue(newNode,fsHeadFeat, value);
          fsAddresses.add(newNode);
          cas.setFeatureValue(newNode, fsTailFeat, emptyListFs);
          cas.setFeatureValue(prevNode, fsTailFeat, newNode);
          prevNode = newNode;
        }
      }
    } else if (currLength > stringValues.size()) { 
        while (cas.getHeapValue(curNode) == neFsListType && i < stringValues.size()) {
           if (!visited.put(curNode, curNode)) {
           foundCycle = true;
           break;
         }
           int value = Integer.parseInt((String) stringValues.get(i++));
        fsAddresses.add(curNode);
          cas.setFeatureValue(curNode,fsHeadFeat, value);
         curNode = cas.getHeapValue(curNode + cas.getFeatureOffset(fsTailFeat));
        }
        int finalNode = curNode;
        //loop till we get a FS that is of type eStringListType
        while (cas.getHeapValue(curNode) == neFsListType) {
          if (!visited.put(curNode, curNode)) {
            foundCycle = true;
            break;
          //TODO throw exc
          }
          curNode = cas.getHeapValue(curNode + cas.getFeatureOffset(fsTailFeat));
        }
        //set the tail feature to eStringListType fs
        cas.setFeatureValue(finalNode, fsTailFeat, curNode);
    } else {
      while (cas.getHeapValue(curNode) == neFsListType) {
        if (!visited.put(curNode, curNode)) {
           foundCycle = true;
           break;
        }
        int value = Integer.parseInt((String) stringValues.get(i++));
        cas.setFeatureValue(curNode,fsHeadFeat, value);
View Full Code Here
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
  } 
 
  public int updateStringList(int addr, List<String> stringValues) throws SAXException   {
    int first = addr;
    boolean foundCycle = false;
    IntRedBlackTree visited = new IntRedBlackTree();
    int curNode = addr;
    int prevNode = 0;
    int currLength = this.getLength(this.neStringListType, addr);
   
    if (currLength < stringValues.size() ) {   
      int i =0;
    while (cas.getHeapValue(curNode) == neStringListType) {
      if (!visited.put(curNode, curNode)) {
             foundCycle = true;
             break;
      }
      String curValue = cas.getStringForCode(cas.getHeapValue(curNode
                + cas.getFeatureOffset(stringHeadFeat)));
      String newValue = stringValues.get(i++);
        if (!curValue.equals(newValue)) {     
          cas.setFeatureValue(curNode, stringHeadFeat, cas.addString(newValue));
        }
        prevNode = curNode;
      curNode = cas.getHeapValue(curNode + cas.getFeatureOffset(stringTailFeat));
   }
   //extend the list
   if (i < stringValues.size()) {
     int emptyListFs = curNode;
     while (i < stringValues.size()) {
       int newNode = cas.ll_createFS(neStringListType);
       String value = (String) stringValues.get(i++);
       cas.setFeatureValue(newNode, stringHeadFeat, cas.addString(value));
       cas.setFeatureValue(newNode, stringTailFeat, emptyListFs);
       cas.setFeatureValue(prevNode,stringTailFeat, newNode);
       prevNode = newNode;
     }
   }
    } else if (currLength > stringValues.size()) {
      int i=0; 
      while (cas.getHeapValue(curNode) == neStringListType && i < stringValues.size()) {
       if (!visited.put(curNode, curNode)) {
                foundCycle = true;
                break;
     }
     String curValue = cas.getStringForCode(cas.getHeapValue(curNode
                   + cas.getFeatureOffset(stringHeadFeat)));
     String newValue = (String)stringValues.get(i++);
        if (!curValue.equals(newValue)) {     
           cas.setFeatureValue(curNode, stringHeadFeat, cas.addString(newValue));
        }
     curNode = cas.getHeapValue(curNode + cas.getFeatureOffset(stringTailFeat));
      }
      int finalNode = curNode;
      while (cas.getHeapValue(curNode) == neStringListType) {
      if (!visited.put(curNode, curNode)) {
        foundCycle = true;
        break;
        //TODO throw exc
      }
      curNode = cas.getHeapValue(curNode + cas.getFeatureOffset(stringTailFeat));
      }
      cas.setFeatureValue(finalNode, stringTailFeat, curNode);
    } else {
      int i =0;
      while (cas.getHeapValue(curNode) == neStringListType) {
        if (!visited.put(curNode, curNode)) {
           foundCycle = true;
           break;
        }
        String curValue = cas.getStringForCode(cas.getHeapValue(curNode
                + cas.getFeatureOffset(stringHeadFeat)));
View Full Code Here
330
331
332
333
334
335
336
337
338
339
340
341
342
    this.types = new ArrayList<Type>();
    this.types.add(null);
    this.features = new ArrayList<Feature>();
    this.features.add(null);
    this.stringSets = new ArrayList<String[]>();
    this.stringSetMap = new IntRedBlackTree();
    this.componentToArrayTypeMap = new IntRedBlackTree();
    this.arrayToComponentTypeMap = new IntRedBlackTree();
    this.arrayCodeToTypeMap = new RedBlackTree<TypeImpl>();
    this.parents = new IntVector();
    this.parents.add(0);

    this.casMetadata = new CASMetadata(this);
View Full Code Here
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
            XmiSerializationSharedData sharedData, MarkerImpl marker) {
      super();
      this.ch = ch;
      this.eh = eh;
      this.cas = cas;
      this.visited = new IntRedBlackTree();
      this.queue = new IntStack();
      this.indexedFSs = new IntVector();
      // this.sofaTypeCode = cas.getTypeSystemImpl().getTypeCode(CAS.TYPE_NAME_SOFA);
      // this.annotationTypeCode = cas.getTypeSystemImpl().getTypeCode(CAS.TYPE_NAME_ANNOTATION);
      this.listUtils = new ListUtils(cas, logger, eh);
      this.arrayAndListFSs = new IntRedBlackTree();
      this.sharedData = sharedData;
      this.isFiltering = filterTypeSystem != null && filterTypeSystem != cas.getTypeSystemImpl();
      if (marker != null ) {
        if (marker.isValid())
          this.marker = marker;
View Full Code Here
TOP

Related Classes of org.apache.uima.internal.util.rb_trees.IntRedBlackTree

  • org.apache.uima.cas.impl.ListUtils
  • org.apache.uima.cas.impl.TypeSystemImpl
  • org.apache.uima.cas.impl.XCASSerializer$XCASDocSerializer
  • org.apache.uima.cas.impl.XmiCasDeserializer$XmiCasDeserializerHandler
  • org.apache.uima.cas.impl.XmiCasSerializer$XmiCasDocSerializer
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.