Package org.apache.uima.jcas.cas

Examples of org.apache.uima.jcas.cas.EmptyFSList

558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
      Token tok1 = new Token(jcas);
      Token tok2 = new Token(jcas);

      NonEmptyFSList fsList1 = new NonEmptyFSList(jcas);
      fsList1.setHead(tok2);
      fsList1.setTail(new EmptyFSList(jcas));
      NonEmptyFSList fsList = new NonEmptyFSList(jcas);
      fsList.setHead(tok1);
      fsList.setTail(fsList1);
      EmptyFSList emptyFsList = new EmptyFSList(jcas);

      try {
        emptyFsList.getNthElement(0);
        assertTrue(false); // error if we get here
      } catch (CASRuntimeException e) {
        assertTrue(e.getMessageKey().equals(CASRuntimeException.JCAS_GET_NTH_ON_EMPTY_LIST));
        System.out.print("Expected Error: ");
        System.out.println(e.getMessage());
View Full Code Here
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
      Token tok1 = new Token(jcas);
      Token tok2 = new Token(jcas);

      NonEmptyFSList fsList1 = new NonEmptyFSList(jcas);
      fsList1.setHead(tok2);
      fsList1.setTail(new EmptyFSList(jcas));
      NonEmptyFSList fsList = new NonEmptyFSList(jcas);
      fsList.setHead(tok1);
      fsList.setTail(fsList1);
      EmptyFSList emptyFsList = new EmptyFSList(jcas);

      try {
        emptyFsList.getNthElement(0);
        assertTrue(false); // error if we get here
      } catch (CASRuntimeException e) {
        assertTrue(e.getMessageKey().equals(CASRuntimeException.JCAS_GET_NTH_ON_EMPTY_LIST));
        System.out.print("Expected Error: ");
        System.out.println(e.getMessage());
View Full Code Here
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
    return asList(data.toArray(new Float[data.size()]));
  }

  public static FSList createFSList(JCas aJCas, Collection<? extends TOP> aCollection) {
    if (aCollection.isEmpty()) {
      return new EmptyFSList(aJCas);
    }

    NonEmptyFSList head = new NonEmptyFSList(aJCas);
    NonEmptyFSList list = head;
    Iterator<? extends TOP> i = aCollection.iterator();
    while (i.hasNext()) {
      head.setHead(i.next());
      if (i.hasNext()) {
        head.setTail(new NonEmptyFSList(aJCas));
        head = (NonEmptyFSList) head.getTail();
      } else {
        head.setTail(new EmptyFSList(aJCas));
      }
    }

    return list;
  }
View Full Code Here
240
241
242
243
244
245
246
247
248
249
250
        int headId = i;
        if (!headIdToPredicate.containsKey(headId)) {
          // We have not encountered this predicate yet, so create it
          Predicate pred = this.createPredicate(jCas, parserNode.srlInfo.rolesetId, token);
          headIdToPredicate.put(headId, pred);
          pred.setRelations(new EmptyFSList(jCas));
        }
      } else {
        for (SRLHead head : parserNode.srlInfo.heads) {
          Predicate predicate;
View Full Code Here
207
208
209
210
211
212
213
214
215
216
217
    }

    // Extract equivalence classes and save them into CAS
    int[] ec = new int[ppt.getSize()]; // class number for each Markable
    int n = ppt.equivCls(ec); // n holds the number of classes
    EmptyFSList elist = new EmptyFSList(jcas); // shared tail for all chains
    FSList[] listhds = new FSList[n]; // keep track of the heads of all chains
    CollectionTextRelation[] chains = new CollectionTextRelation[n];

    // Initialize n chains
    for (int i = 0; i < n; ++i) {
View Full Code Here
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
      Token tok1 = new Token(jcas);
      Token tok2 = new Token(jcas);

      NonEmptyFSList fsList1 = new NonEmptyFSList(jcas);
      fsList1.setHead(tok2);
      fsList1.setTail(new EmptyFSList(jcas));
      NonEmptyFSList fsList = new NonEmptyFSList(jcas);
      fsList.setHead(tok1);
      fsList.setTail(fsList1);
      EmptyFSList emptyFsList = new EmptyFSList(jcas);

      try {
        emptyFsList.getNthElement(0);
        assertTrue(false); // error if we get here
      } catch (CASRuntimeException e) {
        assertTrue(e.getMessageKey().equals(CASRuntimeException.JCAS_GET_NTH_ON_EMPTY_LIST));
        System.out.print("Expected Error: ");
        System.out.println(e.getMessage());
View Full Code Here
358
359
360
361
362
363
364
365
366
367
368
      head.setHead(i.next());
      if (i.hasNext()) {
        head.setTail(new NonEmptyFSList(jCas));
        head = (NonEmptyFSList) head.getTail();
      } else {
        head.setTail(new EmptyFSList(jCas));
      }
    }

    // Print what is expected
    for (FeatureStructure fs : allFS) {
View Full Code Here
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
      Token tok1 = new Token(jcas);
      Token tok2 = new Token(jcas);

      NonEmptyFSList fsList1 = new NonEmptyFSList(jcas);
      fsList1.setHead(tok2);
      fsList1.setTail(new EmptyFSList(jcas));
      NonEmptyFSList fsList = new NonEmptyFSList(jcas);
      fsList.setHead(tok1);
      fsList.setTail(fsList1);
      EmptyFSList emptyFsList = new EmptyFSList(jcas);

      try {
        emptyFsList.getNthElement(0);
        assertTrue(false); // error if we get here
      } catch (CASRuntimeException e) {
        assertTrue(e.getMessageKey().equals(CASRuntimeException.JCAS_GET_NTH_ON_EMPTY_LIST));
        System.out.print("Expected Error: ");
        System.out.println(e.getMessage());
View Full Code Here
250
251
252
253
254
255
256
257
258
259
260
        {
          if (!headIdToPredicate.containsKey(parserNode)) {
            // We have not encountered this predicate yet, so create it
            Predicate pred = this.createPredicate(jCas, rolesetId, token);
            headIdToPredicate.put(parserNode, pred);
            pred.setRelations(new EmptyFSList(jCas));
          }
        }
    }
   
   
View Full Code Here
159
160
161
162
163
164
165
166
167
168
169
    String docName = DocumentIDAnnotationUtil.getDocumentID(jcas);
    logger.info("Classifying coreference in document: " + docName);
//    ArrayList<CollectionTextRelation> chains = new ArrayList<CollectionTextRelation>();
    int chainId = 0;
   
    EmptyFSList emptyList = new EmptyFSList(jcas);
    // Create a parent pointer tree to calculate equivalence classes
//    ppt = new ParentPtrTree(lm.size());

    // Make a data structure mapping markables to indexes so we don't lose the order if we re-arrange
    Map<Markable, Integer> m2q = new HashMap<Markable,Integer>();
View Full Code Here
TOP

Related Classes of org.apache.uima.jcas.cas.EmptyFSList

  • org.apache.ctakes.core.util.ListFactory
  • org.apache.ctakes.coreference.ae.MipacqMarkablePairGenerator
  • org.apache.ctakes.coreference.ae.MipacqSvmChainCreator
  • org.apache.ctakes.dependency.parser.ae.ClearNLPSemanticRoleLabelerAE
  • org.apache.ctakes.dependency.parser.ae.ClearParserSemanticRoleLabelerAE
  • org.apache.uima.fit.util.FSCollectionFactory
  • org.apache.uima.fit.util.JCasUtilTest
  • org.apache.uima.jcas.test.JCasTest
    • 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.