org.semanticweb.HermiT.model.InterningManager Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of org.semanticweb.hermit Show documentation
Show all versions of org.semanticweb.hermit Show documentation
HermiT is reasoner for ontologies written using the Web Ontology Language (OWL). Given an OWL file, HermiT can determine whether or not the ontology is consistent, identify subsumption relationships between classes, and much more.
This is the maven build of HermiT and is designed for people who wish to use HermiT from within the OWL API. It is now versioned in the main HermiT version repository, although not officially supported by the HermiT developers.
The version number of this package is a composite of the HermiT version and a value representing the OWLAPI release it is compatible with. Note that the group id for the upstream HermiT is com.hermit-reasoner, while this fork is released under net.sourceforge.owlapi.
This fork exists to allow HermiT users to use newer OWLAPI versions than the ones supported by the original HermiT codebase.
This package includes the Jautomata library (http://jautomata.sourceforge.net/), and builds with it directly. This library appears to be no longer under active development, and so a "fork" seems appropriate. No development is intended or anticipated on this code base.
The newest version!
/* Copyright 2008, 2009, 2010 by the Oxford University Computing Laboratory
This file is part of HermiT.
HermiT is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
HermiT is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with HermiT. If not, see type
*/
public abstract class InterningManager {
protected static final double LOAD_FACTOR=0.75;
protected final ReferenceQueue m_referenceQueue=new ReferenceQueue<>();
protected Entry[] m_entries=createEntries(16);
protected int m_size=0;
protected int m_resizeThreshold=12;
/**
* @param object object
* @return interned object
*/
public synchronized E intern(E object) {
processQueue();
int hashCode=getHashCode(object);
int objectEntryIndex=getIndexFor(hashCode,m_entries.length);
Entry previousEntry=null;
Entry entry=m_entries[objectEntryIndex];
while (entry!=null) {
if (hashCode==entry.m_hashCode) {
E entryObject=entry.get();
if (entryObject==null) {
if (previousEntry==null)
m_entries[objectEntryIndex]=entry.m_next;
else
previousEntry.m_next=entry.m_next;
m_size--;
}
else if (equal(object,entryObject))
return entryObject;
}
previousEntry=entry;
entry=entry.m_next;
}
if (m_size>=m_resizeThreshold) {
int newEntriesLength=m_entries.length*2;
Entry[] newEntries=createEntries(newEntriesLength);
for (int entryIndex=0;entryIndex currentEntry=m_entries[entryIndex];
while (currentEntry!=null) {
Entry nextEntry=currentEntry.m_next;
if (currentEntry.get()==null)
m_size--;
else {
int newIndex=getIndexFor(currentEntry.m_hashCode,newEntriesLength);
currentEntry.m_next=newEntries[newIndex];
newEntries[newIndex]=currentEntry;
}
currentEntry=nextEntry;
}
}
m_entries=newEntries;
m_resizeThreshold=(int)(newEntriesLength*LOAD_FACTOR);
objectEntryIndex=getIndexFor(hashCode,m_entries.length);
}
Entry newEntry=new Entry<>(object,m_referenceQueue,hashCode,m_entries[objectEntryIndex]);
m_entries[objectEntryIndex]=newEntry;
m_size++;
return object;
}
protected static final int getIndexFor(int hashCode,int entriesLength) {
return hashCode & (entriesLength-1);
}
protected void removeEntry(Entry entry) {
int index=getIndexFor(entry.m_hashCode,m_entries.length);
Entry previousEntry=null;
for (Entry current=m_entries[index];current!=null;current=current.m_next) {
if (current==entry) {
m_size--;
if (previousEntry==null)
m_entries[index]=current.m_next;
else
previousEntry.m_next=current.m_next;
return;
}
previousEntry=current;
}
}
@SuppressWarnings("unchecked")
protected void processQueue() {
Entry entry=(Entry)m_referenceQueue.poll();
while (entry!=null) {
removeEntry(entry);
entry=(Entry)m_referenceQueue.poll();
}
}
@SuppressWarnings("unchecked")
protected final Entry[] createEntries(int size) {
return new Entry[size];
}
protected abstract int getHashCode(E object);
protected abstract boolean equal(E object1,E object2);
/**
* The entry for the hash map.
*/
protected static class Entry extends WeakReference {
public final int m_hashCode;
public Entry m_next;
public Entry(E object,ReferenceQueue referenceQueue,int hashCode,Entry next) {
super(object,referenceQueue);
m_hashCode=hashCode;
m_next=next;
}
}
}