Examples of org.mindswap.pellet.utils.Timer.stop()

org.mindswap.pellet.utils.Timer.stop()
Stop the timer, increment the count and update the total time spent. If timer has been started multiple times this function will only decrement the internal counter. Time information is updated only when all starts are evened out by stops. @return Return the total time spent after last start(), -1 if timer is still running, -Long.MAX_VALUE on error

                  search( topSearch, c, y, visited, result );
                }
      }
    }


    t.stop();
    
    return result;
  }


  private boolean subCheckWithCache(TaxonomyNode<ATermAppl> node, ATermAppl c, boolean topDown) {

View Full Code Here

        log.finer( "Type checking for [" + format( n ) + ", " + format( c ) + "]..." );
      }


      Timer t = kb.timers.startTimer( "classifyType" );
      isType = kb.isType( n, c );
      t.stop();
      marked.put( c, isType
        ? Boolean.TRUE
        : Boolean.FALSE );


      if( log.isLoggable( Level.FINER ) ) {

View Full Code Here

    else {
      setBranch( DependencySet.NO_BRANCH );
      branches = new ArrayList<Branch>();
    }


    timer.stop();


  }


  /**
   * Create a copy of this ABox with all the nodes and edges.

View Full Code Here

            else {
              copy.setNodeCount( copy.getNodeCount() + 1 );
            }
    }


    t.stop();


    sourceABox = null;
  }


  /**

View Full Code Here


    ATermAppl notC2 = ATermUtils.negate( c2 );
    ATermAppl c = ATermUtils.makeAnd( c1, notC2 );
    Timer t = kb.timers.startTimer( "subClassSat" );
    boolean sub = !isSatisfiable( c, false );
    t.stop();


    if( log.isLoggable( Level.FINE ) ) {
          log.fine( " Result: " + sub + " (" + t.getLast() + "ms)" );
        }

View Full Code Here


    stats.satisfiabilityCount++;


    Timer t = kb.timers.startTimer( "satisfiability" );
    boolean isSat = isConsistent( SetUtils.<ATermAppl>emptySet(), c, cacheModel );
    t.stop();


    return isSat;
  }


  public CandidateSet<ATermAppl> getObviousInstances(ATermAppl c) {

View Full Code Here


    ATermAppl notC = ATermUtils.negate( c );


    Timer t = kb.timers.startTimer( "isType" );
    boolean isType = !isConsistent( SetUtils.singleton( x ), notC, false );
    t.stop();


    if( log.isLoggable( Level.FINE ) ) {
          log.fine( "Type " + isType + " " + ATermUtils.toString( c ) + " for individual " + ATermUtils.toString( x ) );
        }

View Full Code Here

    completionTimer.start();
    try {
      strategy.complete( expr );
    }
    finally {
      completionTimer.stop();
    }


    boolean consistent = !abox.isClosed();


    if( x != null && c != null && cacheModel ) {

View Full Code Here

    completionTimer.start();
    try {
      incStrategy.complete(kb.getExpressivityChecker().getExpressivity());
    }
    finally {
      completionTimer.stop();
    }
    
    boolean consistent = !isClosed();


    if( log.isLoggable( Level.FINE ) ) {

View Full Code Here


    modules = new MultiValueMap<OWLEntity, OWLEntity>();


    extractModuleSignatures( allClasses );


    timer.stop();


    return modules;
  }


  /**

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

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.