package de.lmu.ifi.dbs.elki.utilities.datastructures.heap;
/*
This file is part of ELKI:
Environment for Developing KDD-Applications Supported by Index-Structures
Copyright (C) 2011
Ludwig-Maximilians-Universität München
Lehr- und Forschungseinheit für Datenbanksysteme
ELKI Development Team
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero 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 Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with this program. If not, see .
*/
import de.lmu.ifi.dbs.elki.utilities.pairs.PairInterface;
/**
* Object for a priority queue with integer priority. Can be used in the
* {@link de.lmu.ifi.dbs.elki.utilities.datastructures.heap.UpdatableHeap UpdatableHeap}, since hashcode and equality use the stored objects
* only, not the priority.
*
* @author Erich Schubert
*
* @param Stored object type.
*/
public class IntegerPriorityObject implements PairInterface, Comparable> {
/**
* Priority.
*/
int priority;
/**
* Stored object. Private; since changing this will break an
* {@link de.lmu.ifi.dbs.elki.utilities.datastructures.heap.UpdatableHeap UpdatableHeap}s Hash Map!
*/
private O object;
/**
* Constructor.
*
* @param priority Priority
* @param object Payload
*/
public IntegerPriorityObject(int priority, O object) {
super();
this.priority = priority;
this.object = object;
}
/**
* Get the priority.
*
* @return Priority
*/
public int getPriority() {
return priority;
}
/**
* Get the stored object payload
*
* @return object data
*/
public O getObject() {
return object;
}
@Override
public Integer getFirst() {
return priority;
}
@Override
public O getSecond() {
return object;
}
@Override
public int hashCode() {
return ((object == null) ? 0 : object.hashCode());
}
@Override
public boolean equals(Object obj) {
if(this == obj) {
return true;
}
if(obj == null) {
return false;
}
if(!(obj instanceof IntegerPriorityObject)) {
return false;
}
IntegerPriorityObject> other = (IntegerPriorityObject>) obj;
if(object == null) {
return (other.object == null);
}
else {
return object.equals(other.object);
}
}
@Override
public int compareTo(IntegerPriorityObject> o) {
return o.priority - this.priority;
}
}