public void initAdditions() { this.addedContextInitRules_ = null; this.addedContextRuleHeadByClassExpressions_ = new ArrayHashMap<ModifiableIndexedClassExpression, ChainableSubsumerRule>( 32); this.addedDefinitions_ = new ArrayHashMap<ModifiableIndexedClass, ModifiableIndexedClassExpression>( 32); this.addedDefinitionReasons_ = new ArrayHashMap<ModifiableIndexedClass, ElkAxiom>( 32); }
AbstractObjectIntersectionFromConjunctRule(ChainableSubsumerRule tail) { super(tail); this.conjunctionsByConjunct_ = new ArrayHashMap<IndexedClassExpression, IndexedObjectIntersectionOf>( 4); }
AbstractObjectIntersectionFromConjunctRule(ChainableSubsumerRule tail) { super(tail); this.conjunctionsByConjunct_ = new ArrayHashMap<IndexedClassExpression, IndexedObjectIntersectionOf>( 4); }
public void initAdditions() { this.addedContextInitRules_ = null; this.addedContextRuleHeadByClassExpressions_ = new ArrayHashMap<ModifiableIndexedClassExpression, ChainableSubsumerRule>( 32); this.addedDefinitions_ = new ArrayHashMap<ModifiableIndexedClass, ModifiableIndexedClassExpression>( 32); this.addedDefinitionReasons_ = new ArrayHashMap<ModifiableIndexedClass, ElkAxiom>( 32); }
public TransitiveReductionOutputEquivalentDirect(R root, List<ElkClass> equivalent) { super(root, equivalent); this.directSubsumers = new ArrayHashMap<IndexedClass, List<ElkClass>>(); }
public TransitiveReductionOutputEquivalentDirect(R root, List<ElkClass> equivalent) { super(root, equivalent); this.directSubsumers = new ArrayHashMap<IndexedClass, List<ElkClass>>(); }
public TransitiveReductionOutputEquivalentDirect(R root, List<ElkClass> equivalent) { super(root, equivalent); this.directSubsumers = new ArrayHashMap<IndexedClass, List<ElkClass>>(); }
AbstractObjectIntersectionFromConjunctRule(ChainableSubsumerRule tail) { super(tail); this.conjunctionsByConjunct_ = new ArrayHashMap<IndexedClassExpression, IndexedObjectIntersectionOf>( 4); }
public void initAdditions() { this.addedContextInitRules_ = null; this.addedContextRuleHeadByClassExpressions_ = new ArrayHashMap<ModifiableIndexedClassExpression, ChainableSubsumerRule>( 32); this.addedDefinitions_ = new ArrayHashMap<ModifiableIndexedClass, ModifiableIndexedClassExpression>( 32); this.addedDefinitionReasons_ = new ArrayHashMap<ModifiableIndexedClass, ElkAxiom>( 32); }
public void initDeletions() { this.removedContextInitRules_ = null; this.todoDeletions_ = new ArrayHashSet<CachedIndexedObject<?>>(1024); this.removedContextRuleHeadByClassExpressions_ = new ArrayHashMap<ModifiableIndexedClassExpression, ChainableSubsumerRule>( 32); this.removedDefinitions_ = new ArrayHashMap<ModifiableIndexedClass, ModifiableIndexedClassExpression>( 32); this.removedDefinitionReasons_ = new ArrayHashMap<ModifiableIndexedClass, ElkAxiom>( 32); }
public void initDeletions() { this.removedContextInitRules_ = null; this.todoDeletions_ = new ArrayHashSet<CachedIndexedObject<?>>(1024); this.removedContextRuleHeadByClassExpressions_ = new ArrayHashMap<ModifiableIndexedClassExpression, ChainableSubsumerRule>( 32); this.removedDefinitions_ = new ArrayHashMap<ModifiableIndexedClass, ModifiableIndexedClassExpression>( 32); this.removedDefinitionReasons_ = new ArrayHashMap<ModifiableIndexedClass, ElkAxiom>( 32); }
public void initDeletions() { this.removedContextInitRules_ = null; this.todoDeletions_ = new ArrayHashSet<CachedIndexedObject<?>>(1024); this.removedContextRuleHeadByClassExpressions_ = new ArrayHashMap<ModifiableIndexedClassExpression, ChainableSubsumerRule>( 32); this.removedDefinitions_ = new ArrayHashMap<ModifiableIndexedClass, ModifiableIndexedClassExpression>( 32); this.removedDefinitionReasons_ = new ArrayHashMap<ModifiableIndexedClass, ElkAxiom>( 32); }
SubContext getCreateSubContext(IndexedObjectProperty subRoot) { if (subContextsByObjectProperty_ == null) subContextsByObjectProperty_ = new ArrayHashMap<IndexedObjectProperty, SubContext>( 3); SubContext result = subContextsByObjectProperty_.get(subRoot); if (result == null) { result = new SubContextImpl(); subContextsByObjectProperty_.put(subRoot, result); } return result; }
public OrphanNode(final Iterable<? extends T> members, final int size, final T canonical, ComparatorKeyProvider<? super T> keyProvider) { this.members = new ArrayHashMap<Object, T>(size); for (T member : members) { this.members.put(keyProvider.getKey(member), member); } this.canonical = canonical; }
public OrphanNode(final Iterable<? extends T> members, final int size, final T canonical, ComparatorKeyProvider<? super T> keyProvider) { this.members = new ArrayHashMap<Object, T>(size); for (T member : members) { this.members.put(keyProvider.getKey(member), member); } this.canonical = canonical; }
SubContext getCreateSubContext(IndexedObjectProperty subRoot) { if (subContextsByObjectProperty_ == null) subContextsByObjectProperty_ = new ArrayHashMap<IndexedObjectProperty, SubContext>( 3); SubContext result = subContextsByObjectProperty_.get(subRoot); if (result == null) { result = new SubContextImpl(); subContextsByObjectProperty_.put(subRoot, result); } return result; }
public OrphanNode(final Iterable<? extends T> members, final int size, final T canonical, ComparatorKeyProvider<? super T> keyProvider) { this.members = new ArrayHashMap<Object, T>(size); for (T member : members) { this.members.put(keyProvider.getKey(member), member); } this.canonical = canonical; }
SubContext getCreateSubContext(IndexedObjectProperty subRoot) { if (subContextsByObjectProperty_ == null) subContextsByObjectProperty_ = new ArrayHashMap<IndexedObjectProperty, SubContext>( 3); SubContext result = subContextsByObjectProperty_.get(subRoot); if (result == null) { result = new SubContextImpl(); subContextsByObjectProperty_.put(subRoot, result); } return result; }
/** * Creates the node store with the provided initial capacity. * * @param capacity * The initial capacity. * @param keyProvider * The key provider for members of the nodes in this node store. */ public SynchronizedNodeStore(final int capacity, final ComparatorKeyProvider<? super T> keyProvider) { keyProvider_ = keyProvider; nodeLookup_ = new ArrayHashMap<Object, N>(capacity); allNodes_ = new ArrayHashSet<N>(capacity); }
/** * Creates the node store with the provided initial capacity. * * @param capacity * The initial capacity. * @param keyProvider * The key provider for members of the nodes in this node store. */ public SynchronizedNodeStore(final int capacity, final ComparatorKeyProvider<? super T> keyProvider) { keyProvider_ = keyProvider; nodeLookup_ = new ArrayHashMap<Object, N>(capacity); allNodes_ = new ArrayHashSet<N>(capacity); }