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( log.isLoggable( Level.FINE ) )
      abox.printTree();


     timer.stop();
  }


  protected boolean backtrack() {
    boolean branchFound = false;

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

                  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

    // We classify the ontology and use a specific timer to keep track of
    // the time required for the classification
    Timer t = timers.createTimer( "First classification" );
    t.start();
    classifier.classify();
    t.stop();
        
    System.out.println( "\nClassification time: " + t.getTotal() + "ms"); 
    System.out.println( "Subclasses of " + pain + ": " + classifier.getSubClasses( pain, true ).getFlattened() + "\n");
    
    // Now create a new OWL axiom, subClassOf(Headache, Pain)

View Full Code Here

    // Now we create a second timer to keep track of the performance of the
    // second classification
    t = timers.createTimer( "Second classification" );
    t.start();
    classifier.classify();
    t.stop();
    
    System.out.println( "\nClassification time: " + t.getTotal() + "ms");
    System.out.println( "Subclasses of " + pain + ": " + classifier.getSubClasses( pain, true ).getFlattened() + "\n");


    // Remove the axiom from the ontology, which creates a change event

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.