org.icefaces.ace.model.tree.NodeStateMap Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of icefaces-ace Show documentation
${icefaces.product.name} ACE Component Library
The newest version!
/*
 * Copyright 2004-2014 ICEsoft Technologies Canada Corp.
 *
 * 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 org.icefaces.ace.model.tree;

import org.icefaces.ace.util.CollectionUtils;
import org.icefaces.ace.util.collections.EntrySetToKeyListTransformer;
import org.icefaces.ace.util.collections.Predicate;

import javax.swing.tree.TreeNode;
import java.io.Serializable;
import java.util.*;

public class NodeStateMap implements Map, Serializable {
    Map map = new LinkedHashMap();
    KeySegmentConverter keyConverter;
    Predicate selectedPredicate = new SelectedPredicate();
    Predicate expandedPredicate = new ExpandedPredicate();
    NodeStateCreationCallback initCallback;

    public NodeStateMap() {
    }

    public NodeStateMap(NodeStateCreationCallback callback) {
        setInitCallback(callback);
    }

    public KeySegmentConverter getKeyConverter() {
        return keyConverter;
    }

    public void setKeyConverter(KeySegmentConverter keyConverter) {
        this.keyConverter = keyConverter;
    }

    public int size() {
        return map.size();
    }

    public boolean isEmpty() {
        return map.isEmpty();
    }

    public boolean containsKey(Object o) {
        return map.containsKey(o);
    }

    public boolean containsValue(Object o) {
        return map.containsValue(o);
    }

    public NodeState get(Object o) {
        NodeState state;

        state = map.get(o);
        if (state != null) return state;

        // If state is null, create a new state for the node.
        state = new NodeState();

        if (getInitCallback() != null)
            getInitCallback().initializeState(state, o);

        put(o, state);
        return state;
    }

    public NodeState put(Object o, NodeState nodeState) {
        if (keyConverter == null) return map.put(o, nodeState);
        else return map.put(keyConverter.getSegment(o), nodeState);
    }

    public NodeState remove(Object o) {
        if (keyConverter == null) return map.remove(o);
        else return map.remove(keyConverter.getSegment(o));
    }

    public void putAll(Map inputMap) {
        for (Object key : inputMap.keySet())
            put(key, inputMap.get(key));
    }

    public void clear() {
        map.clear();
    }

    public Set