Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/* This file is part of the OWL API.
* The contents of this file are subject to the LGPL License, Version 3.0.
* Copyright 2014, The University of Manchester
*
* This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
* This program 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 General Public License for more details.
* You should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/.
*
* Alternatively, the contents of this file may be used under the terms of the Apache License, Version 2.0 in which case, the provisions of the Apache License Version 2.0 are applicable instead of those above.
* Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at
* http://www.apache.org/licenses/LICENSE-2.0
* Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. */
package uk.ac.manchester.cs.owl.owlapi;
import static org.semanticweb.owlapi.util.OWLAPIPreconditions.checkNotNull;
import gnu.trove.map.hash.THashMap;
import gnu.trove.set.hash.THashSet;
import java.lang.ref.SoftReference;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.Map;
import java.util.Set;
import java.util.concurrent.atomic.AtomicLong;
import javax.annotation.Nonnull;
import javax.annotation.Nullable;
import org.semanticweb.owlapi.model.AxiomType;
import org.semanticweb.owlapi.model.IRI;
import org.semanticweb.owlapi.model.OWLAxiom;
import org.semanticweb.owlapi.model.OWLAxiomVisitorEx;
import org.semanticweb.owlapi.model.OWLEntity;
import org.semanticweb.owlapi.util.CollectionFactory;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
import uk.ac.manchester.cs.owl.owlapi.InitVisitorFactory.InitCollectionVisitor;
import uk.ac.manchester.cs.owl.owlapi.InitVisitorFactory.InitVisitor;
import uk.ac.manchester.cs.owl.owlapi.util.collections.SmallSet;
import com.google.common.collect.Iterables;
/**
* * Objects that identify contained maps - so that getting the keys of a
* specific map does not require a specific method for each map nor does it
* require the map to be copied and returned.
*
* @author ignazio
* @param
* key
* @param
* value
*/
public class MapPointer {
private static final float DEFAULT_LOAD_FACTOR = 0.75F;
private static final int DEFAULT_INITIAL_CAPACITY = 2;
private static Logger logger = LoggerFactory.getLogger(MapPointer.class);
@Nullable
private final AxiomType type;
@Nullable
private final OWLAxiomVisitorEx visitor;
private boolean initialized;
@Nonnull
protected final Internals i;
private SoftReference> iris;
private int size = 0;
private final THashMap> map = new THashMap<>(17, 0.75F);
/**
* @param t
* type of axioms contained
* @param v
* visitor
* @param initialized
* true if initialized
* @param i
* internals containing this pointer
*/
public MapPointer(@Nullable AxiomType t,
@Nullable OWLAxiomVisitorEx v, boolean initialized,
@Nonnull Internals i) {
type = t;
visitor = v;
this.initialized = initialized;
this.i = checkNotNull(i, "i cannot be null");
}
/**
* @param e
* entity
* @return true if an entity with the same iri as the input exists in the
* collection
*/
public synchronized boolean containsReference(OWLEntity e) {
return map.containsKey(e);
}
/**
* @param e
* IRI
* @return true if an entity with the same iri as the input exists in the
* collection
*/
public synchronized boolean containsReference(IRI e) {
Set set = null;
if (iris != null) {
set = iris.get();
}
if (set == null) {
set = initSet();
}
return set.contains(e);
}
private Set initSet() {
Set set = CollectionFactory.createSet();
for (K k : map.keySet()) {
if (k instanceof OWLEntity) {
set.add(((OWLEntity) k).getIRI());
} else if (k instanceof IRI) {
set.add((IRI) k);
}
}
iris = new SoftReference<>(set);
return set;
}
/** @return true if initialized */
public synchronized boolean isInitialized() {
return initialized;
}
/**
* init the map pointer
*
* @return the map pointer
*/
@SuppressWarnings({ "unchecked", "null" })
public synchronized MapPointer init() {
if (initialized) {
return this;
}
initialized = true;
if (visitor == null) {
return this;
}
if (visitor instanceof InitVisitor) {
for (V ax : (Collection) i.getAxiomsByType().getValues(type)) {
K key = ax.accept((InitVisitor) visitor);
// this can only be null because the visitor return nulls in
// methods that do not declare it
if (key != null) {
putInternal(key, ax);
}
}
} else {
for (V ax : (Collection) i.getAxiomsByType().getValues(type)) {
Collection keys = ax
.accept((InitCollectionVisitor) visitor);
for (K key : keys) {
putInternal(key, ax);
}
}
}
return this;
}
@Nonnull
@Override
public synchronized String toString() {
return initialized + map.toString();
}
/** @return keyset */
@Nonnull
public synchronized Iterable keySet() {
init();
Set keySet = map.keySet();
assert keySet != null;
return keySet;
}
/**
* @param key
* key to look up
* @return value
*/
@Nonnull
public synchronized Iterable getValues(K key) {
init();
return get(key);
}
/**
* @param key
* key to look up
* @return true if there are values for key
*/
public synchronized boolean hasValues(K key) {
init();
return map.containsKey(key);
}
/**
* @param key
* key to add
* @param value
* value to add
* @return true if addition happens
*/
public synchronized boolean put(K key, V value) {
// lazy init: no elements added until a recall is made
if (!initialized) {
return false;
}
iris = null;
return putInternal(key, value);
}
/**
* @param key
* key to look up
* @param value
* value to remove
* @return true if removal happens
*/
public synchronized boolean remove(K key, V value) {
if (!initialized) {
return false;
}
iris = null;
return removeInternal(key, value);
}
/**
* @param key
* key to look up
* @return true if there are values for key
*/
@SuppressWarnings("null")
@Nonnull
public synchronized Boolean containsKey(K key) {
init();
return map.containsKey(key);
}
/**
* @param key
* key to look up
* @param value
* value to look up
* @return true if key and value are contained
*/
public synchronized boolean contains(K key, V value) {
init();
return containsEntry(key, value);
}
/** @return all values contained */
@Nonnull
public synchronized Iterable getAllValues() {
init();
return values();
}
/** @return number of mapping contained */
public synchronized int size() {
init();
return size;
}
/** @return true if empty */
public synchronized boolean isEmpty() {
init();
return size == 0;
}
private boolean putInternal(K k, V v) {
Set set = map.get(k);
if (set == null) {
set = Collections.singleton(v);
map.put(k, set);
size++;
return true;
}
if (set.size() == 1) {
if (set.contains(v)) {
return false;
} else {
set = new SmallSet<>(set);
map.put(k, set);
}
} else if (set.size() == 3) {
if (set.contains(v)) {
return false;
} else {
set = makeSet(set);
map.put(k, set);
}
}
boolean added = set.add(v);
if (added) {
size++;
}
return added;
}
private boolean containsEntry(K k, V v) {
Set t = map.get(k);
if (t == null) {
return false;
}
return t.contains(v);
}
private boolean removeInternal(K k, V v) {
Set t = map.get(k);
if (t == null) {
return false;
}
if (t.size() == 1) {
if (t.contains(v)) {
map.remove(k);
size--;
return true;
} else {
return false;
}
}
boolean removed = t.remove(v);
if (removed) {
size--;
}
if (t.isEmpty()) {
map.remove(k);
}
return removed;
}
private Set makeSet() {
return makeSet(DEFAULT_INITIAL_CAPACITY);
}
private Set makeSet(int initialCapacity) {
return makeSet(initialCapacity, DEFAULT_LOAD_FACTOR);
}
private THashSet makeSet(int initialCapacity, float loadFactor) {
return new THashSet<>(initialCapacity, loadFactor);
}
private Set makeSet(Collection collection) {
Set result = makeSet();
result.addAll(collection);
return result;
}
@SuppressWarnings("null")
@Nonnull
private Iterable values() {
return Iterables.concat(map.values());
}
@Nonnull
private Iterable get(K k) {
Set t = map.get(k);
if (t == null) {
return CollectionFactory.emptySet();
}
return new ArrayList<>(t);
}
/**
* Trims the capacity of the map entries . An application can use this
* operation to minimize the storage of the map pointer instance.
*/
private static AtomicLong totalInUse = new AtomicLong(0);
private static AtomicLong totalAllocated = new AtomicLong(0);
/**
* Trim internal map to size.
*/
public void trimToSize() {
if (initialized) {
map.trimToSize();
for (Map.Entry> entry : map.entrySet()) {
Set set = entry.getValue();
if (set instanceof THashSet) {
THashSet vs = (THashSet) set;
vs.trimToSize();
totalInUse.addAndGet(set.size());
totalAllocated.addAndGet(vs.capacity());
} else if (set instanceof SmallSet) {
totalInUse.addAndGet(set.size());
totalAllocated.addAndGet(3);
} else {
totalInUse.addAndGet(1);
totalAllocated.addAndGet(1);
}
}
}
}
static void resetCounts() {
totalAllocated.set(0);
totalInUse.set(0);
}
static long getTotalInUse() {
return totalInUse.get();
}
static long getTotalAllocated() {
return totalAllocated.get();
}
}
