public double equivClasses(ATermAppl sup) { if( !equivClasses.containsKey( sup ) ) { compute( Collections.singleton( sup ), EMPTY_SET ); if( log.isLoggable( Level.FINE ) ) { log.fine( "Computing additionally " + sup ); } } return equivClasses.get( sup ); }
public double avg(ATermAppl pred) { if( !avgObjectsPP.containsKey( pred ) ) { compute( EMPTY_SET, Collections.singleton( pred ) ); } return avgObjectsPP.get( pred ); }
public double avg(ATermAppl pred) { if( !avgObjectsPP.containsKey( pred ) ) { compute( EMPTY_SET, Collections.singleton( pred ) ); } return avgObjectsPP.get( pred ); }
public double subProperties(ATermAppl sup, boolean direct) { final Map<ATermAppl, Integer> map = (direct ? directSubProperties : subProperties); if( !map.containsKey( sup ) ) { compute( EMPTY_SET, Collections.singleton( sup ) ); if( log.isLoggable( Level.FINE ) ) { log.fine( "Computing additionally " + sup ); } } return map.get( sup ); }
public double superProperties(ATermAppl sup, boolean direct) { final Map<ATermAppl, Integer> map = (direct ? directSuperProperties : superProperties); if( !map.containsKey( sup ) ) { compute( EMPTY_SET, Collections.singleton( sup ) ); if( log.isLoggable( Level.FINE ) ) { log.fine( "Computing additionally " + sup ); } } return map.get( sup ); }
public double disjoints(ATermAppl sup) { if( !disjoints.containsKey( sup ) ) { compute( Collections.singleton( sup ), EMPTY_SET ); if( log.isLoggable( Level.FINE ) ) { log.fine( "Computing additionally " + sup ); } } return disjoints.get( sup ); }
public double complements(ATermAppl sup) { if( !complements.containsKey( sup ) ) { compute( Collections.singleton( sup ), EMPTY_SET ); if( log.isLoggable( Level.FINE ) ) { log.fine( "Computing additionally " + sup ); } } return complements.get( sup ); }
public double subProperties(ATermAppl sup, boolean direct) { final Map<ATermAppl, Integer> map = (direct ? directSubProperties : subProperties); if( !map.containsKey( sup ) ) { compute( EMPTY_SET, Collections.singleton( sup ) ); if( log.isLoggable( Level.FINE ) ) { log.fine( "Computing additionally " + sup ); } } return map.get( sup ); }
public double equivProperties(ATermAppl sup) { if( !equivProperties.containsKey( sup ) ) { compute( EMPTY_SET, Collections.singleton( sup ) ); if( log.isLoggable( Level.FINE ) ) { log.fine( "Computing additionally " + sup ); } } return equivProperties.get( sup ); }
public double complements(ATermAppl sup) { if( !complements.containsKey( sup ) ) { compute( Collections.singleton( sup ), EMPTY_SET ); if( log.isLoggable( Level.FINE ) ) { log.fine( "Computing additionally " + sup ); } } return complements.get( sup ); }
public double superClasses(ATermAppl sup, boolean direct) { final Map<ATermAppl, Integer> map = (direct ? directSuperClasses : superClasses); if( !map.containsKey( sup ) ) { compute( Collections.singleton( sup ), EMPTY_SET ); if( log.isLoggable( Level.FINE ) ) { log.fine( "Computing additionally " + sup ); } } return map.get( sup ); }
public double superProperties(ATermAppl sup, boolean direct) { final Map<ATermAppl, Integer> map = (direct ? directSuperProperties : superProperties); if( !map.containsKey( sup ) ) { compute( EMPTY_SET, Collections.singleton( sup ) ); if( log.isLoggable( Level.FINE ) ) { log.fine( "Computing additionally " + sup ); } } return map.get( sup ); }
public double equivProperties(ATermAppl sup) { if( !equivProperties.containsKey( sup ) ) { compute( EMPTY_SET, Collections.singleton( sup ) ); if( log.isLoggable( Level.FINE ) ) { log.fine( "Computing additionally " + sup ); } } return equivProperties.get( sup ); }
public double superClasses(ATermAppl sup, boolean direct) { final Map<ATermAppl, Integer> map = (direct ? directSuperClasses : superClasses); if( !map.containsKey( sup ) ) { compute( Collections.singleton( sup ), EMPTY_SET ); if( log.isLoggable( Level.FINE ) ) { log.fine( "Computing additionally " + sup ); } } return map.get( sup ); }
public double inverses(ATermAppl sup) { if( !inverses.containsKey( sup ) ) { compute( EMPTY_SET, Collections.singleton( sup ) ); if( log.isLoggable( Level.FINE ) ) { log.fine( "Computing additionally " + sup ); } } return inverses.get( sup ); }
public double equivClasses(ATermAppl sup) { if( !equivClasses.containsKey( sup ) ) { compute( Collections.singleton( sup ), EMPTY_SET ); if( log.isLoggable( Level.FINE ) ) { log.fine( "Computing additionally " + sup ); } } return equivClasses.get( sup ); }
public double disjoints(ATermAppl sup) { if( !disjoints.containsKey( sup ) ) { compute( Collections.singleton( sup ), EMPTY_SET ); if( log.isLoggable( Level.FINE ) ) { log.fine( "Computing additionally " + sup ); } } return disjoints.get( sup ); }
public double inverses(ATermAppl sup) { if( !inverses.containsKey( sup ) ) { compute( EMPTY_SET, Collections.singleton( sup ) ); if( log.isLoggable( Level.FINE ) ) { log.fine( "Computing additionally " + sup ); } } return inverses.get( sup ); }
public double subClasses(ATermAppl sup, boolean direct) { final Map<ATermAppl, Integer> map = (direct ? directSubClasses : subClasses); if( !map.containsKey( sup ) ) { compute( Collections.singleton( sup ), EMPTY_SET ); if( log.isLoggable( Level.FINE ) ) { log.fine( "Computing additionally " + sup ); } } return map.get( sup ); // // throw new InternalReasonerException("Sub estimate for " + sup // + " is not found!"); }
public double subClasses(ATermAppl sup, boolean direct) { final Map<ATermAppl, Integer> map = (direct ? directSubClasses : subClasses); if( !map.containsKey( sup ) ) { compute( Collections.singleton( sup ), EMPTY_SET ); if( log.isLoggable( Level.FINE ) ) { log.fine( "Computing additionally " + sup ); } } return map.get( sup ); // // throw new InternalReasonerException("Sub estimate for " + sup // + " is not found!"); }