DecoratedTree.java

/**
 * Replication Benchmarker
 * https://github.com/score-team/replication-benchmarker/
 * Copyright (C) 2013 LORIA / Inria / SCORE Team
 *
 * 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/>.
 */
package collect;

/**
 *
 * @author urso
 */
public class DecoratedTree<T,V> extends HashTree<T> {

    @Override
    protected DecoratedNode<T,V> createNode(Node<T> father, T t) {
        return new DecoratedNode<T,V>((DecoratedNode<T,V>)father, t);
    }

    @Override
    protected DecoratedNode<T,V> createRoot() {
        return new DecoratedNode<T,V>();
    }
    
    public V getAttached(Node<T> n) {
        return ((DecoratedNode<T,V>) n).getAttached();
    }

    public void setAttached(Node<T> n, V value) {
        ((DecoratedNode<T,V>) n).setAttached(value);
    }
}