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

    if( !interpreter.isDirty() )
      return;


    t = timers.startTimer( "rule-reteRun" );
    Set<Fact> inferred = interpreter.run();
    t.stop();


    t = timers.startTimer( "rule-reteFacts" );
    for( Fact fact : inferred ) {
      assert (fact.getDependencySet().getBranch() == abox.getBranch());
      assert (fact.getDependencySet().max() <= abox.getBranch());

View Full Code Here

    for( Fact fact : inferred ) {
      assert (fact.getDependencySet().getBranch() == abox.getBranch());
      assert (fact.getDependencySet().max() <= abox.getBranch());
      applyFact( fact );
      if( abox.isClosed() ) {
        t.stop();
        return;
      }
      if( fact.getElements().size() > 3
          && fact.getElements().get( Compiler.PRED ).equals(
              ContinuousReteTransformer.VARBINDING ) ) {

View Full Code Here

        if( !partialBindings.containsKey( fact ) ) {
          partialBindings.put( fact, abox.getBranch() );
        }
      }
    }
    t.stop();
  }


  public void applyRuleBindings() {


    int total = 0;

View Full Code Here

    if( log.isLoggable( Level.INFO ) )
      System.out.print("classifying...");
    
    kb.classify();
        
    t.stop();
    
    if(PRINT_TREE) kb.printClassTree();
    
    if( log.isLoggable( Level.INFO ) ) 
      System.out.print("verifying...");

View Full Code Here

        if( !FAST ) {
        System.out.print("classifying...");        
          kb.realize();
        }
        
    t.stop();
            
    
    System.out.print("verifying...");
    loader.verifyABox( file + ".query", kb );

View Full Code Here

    }


    if( !prepared ) {
      Timer t = kb.timers.startTimer( "taxBuilder.prepare" );
      prepare();
      t.stop();
    }


    if( log.isLoggable( Level.FINE ) ) {
      log.fine( "Starting classification..." );
    }

View Full Code Here

    // we don't need this any more so set it null and let GC claim it
    unionClasses = null;


    toldTaxonomy.assertValid();


    t.stop();
  }


  private void createDefinitionOrder() {
    definitionOrder = DefinitionOrderFactory.createDefinitionOrder( kb );
  }

View Full Code Here

          log.finer( "Satisfiable " );
        }


    Timer t = kb.timers.startTimer( "classifySat" );
    boolean isSatisfiable = kb.getABox().isSatisfiable( c, true );
    t.stop();


    if( log.isLoggable( Level.FINER ) ) {
          log.finer( (isSatisfiable
        ? "true"
        : "*****FALSE*****") + " (" + t.getLast() + "ms)" );

View Full Code Here

            }


      t = kb.timers.startTimer( "classifySatNot" );
      ATermAppl notC = ATermUtils.makeNot( c );
      isSatisfiable = kb.getABox().isSatisfiable( notC, true );
      t.stop();


      if( !isSatisfiable ) {
              taxonomy.addEquivalentNode( c, taxonomy.getTop() );
            }

View Full Code Here

         * already know everything about j
         */
        ATermAppl sup = supNode.getName();
        Timer t = kb.timers.startTimer( "eqCheck" );
        boolean isEq = subsumes( c, sup );
        t.stop();
        if( isEq ) {
          if( log.isLoggable( Level.FINER ) ) {
                      log.finer( format( c ) + " = " + format( sup ) );
                    }

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.