Package com.clarkparsia.pellint.model

Examples of com.clarkparsia.pellint.model.Severity

225
226
227
228
229
230
231
232
233
234
235
236
      }
    }

    ontologyLints.sort( new Comparator<Lint>() {
      public int compare(Lint lint0, Lint lint1) {
        Severity severity0 = lint0.getSeverity();
        Severity severity1 = lint1.getSeverity();
        if( severity0 != null && severity1 != null ) {
          return -severity0.compareTo( severity1 );
        }

        Set<OWLClass> classes0 = lint0.getParticipatingClasses();
View Full Code Here
86
87
88
89
90
91
92
93
94
    axiom.accept(m_Visitor);
    int disjunctionSize = m_Visitor.getDisjunctionSize();
    if (disjunctionSize > m_MaxAllowed) {
      Lint lint = makeLint();
      lint.addParticipatingAxiom(axiom);
      lint.setSeverity(new Severity(disjunctionSize));
      setLint(lint);
    }
  }
View Full Code Here
221
222
223
224
225
226
227
228
229
230
      }
     
      if (estimatedTreeSize > m_MaxTreeSize) {
        Lint lint = m_LintFactory.make();
        lint.addAllParticipatingClasses(connectedSet);
        lint.setSeverity(new Severity(estimatedTreeSize));
        m_AccumulatedLints.add(lint);
      }
    }
  }
View Full Code Here
259
260
261
262
263
264
265
266
267
268
      estimatedTreeSize *= totalInvolvedIndividuals;
     
      if (estimatedTreeSize > m_MaxTreeSize) {
        Lint lint = m_LintFactory.make();
        lint.addAllParticipatingClasses(connectedSet);
        lint.setSeverity(new Severity(estimatedTreeSize));
        m_AccumulatedLints.add(lint);
      }
    }
  }
View Full Code Here
332
333
334
335
336
337
338
339
340
    }

    if (estimatedTotalTreeSize > m_MaxTreeSize) {
      Lint lint = m_LintFactory.make();
      lint.addAllParticipatingClasses(participatingClasses);
      lint.setSeverity(new Severity(estimatedTotalTreeSize));
      m_AccumulatedLints.add(lint);
    }
  }
View Full Code Here
66
67
68
69
70
71
72
73
74
75
    }
   
    List<Lint> allLints = new ArrayList<Lint>();
    if (totalEstimatedMemory > estimateMemoryConcumption(m_MaxAllowed)) {
      Lint lint = new Lint(this, ontology);
      lint.setSeverity(new Severity(totalEstimatedMemory));
      allLints.add(lint); 
    }
    return allLints;
  }
View Full Code Here
89
90
91
92
93
94
95
96
97
    axiom.accept(m_Visitor);
    int cardinalitySize = m_Visitor.getCardinalitySize();
    if (cardinalitySize > m_MaxAllowed) {
      Lint lint = makeLint();
      lint.addParticipatingAxiom(axiom);
      lint.setSeverity(new Severity(cardinalitySize));
      setLint(lint);
    }
  }
View Full Code Here
225
226
227
228
229
230
231
232
233
234
235
236
      }
    }

    ontologyLints.sort( new Comparator<Lint>() {
      public int compare(Lint lint0, Lint lint1) {
        Severity severity0 = lint0.getSeverity();
        Severity severity1 = lint1.getSeverity();
        if( severity0 != null && severity1 != null ) {
          return -severity0.compareTo( severity1 );
        }

        Set<OWLClass> classes0 = lint0.getParticipatingClasses();
View Full Code Here
41
42
43
44
45
46
47
48
49
50
51
    if ((participatingClasses == null || participatingClasses.isEmpty())
        && (participatingAxioms == null || participatingAxioms.isEmpty())) {
      return "";
    }

    Severity severity = lint.getSeverity();
    StringBuilder strBuilder = new StringBuilder();
    strBuilder.append(" - ");
   
    if (severity != null) {
      strBuilder.append(severity).append(' ');
View Full Code Here
TOP

Related Classes of com.clarkparsia.pellint.model.Severity

  • com.clarkparsia.pellint.format.SimpleLintFormat
  • com.clarkparsia.pellint.lintpattern.axiom.LargeCardinalityPattern
  • com.clarkparsia.pellint.lintpattern.axiom.LargeDisjunctionPattern
  • com.clarkparsia.pellint.lintpattern.ontology.ExistentialExplosionPattern
  • com.clarkparsia.pellint.lintpattern.ontology.TooManyDifferentIndividualsPattern
  • pellet.Pellint
    • 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.