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

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 javax.faces.FacesException;
import javax.swing.tree.TreeNode;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;

public abstract class LazyNodeDataModel extends NodeDataModel {
    private final KeySegmentConverter DEFAULT_CONVERTER = new NodeModelLazyListKeyConverter(this);
    private KeySegmentConverter converter;
    Map> childMap = new HashMap>();
    Map parentMap = new HashMap();

    public abstract List loadChildrenForNode(K node);

    public void unloadSubtree(K node) {
        List kids = childMap.get(node);

        // Kids may be null as we may be unloading
        // a parent subtree and this node may not
        // have checked for children yet.
        if (kids != null)
            for (K kid : kids)
                unloadSubtree(kid);

        parentMap.remove(node);
        childMap.remove(node);
    }

    public void unload() {
        childMap.clear();
        parentMap.clear();
    }

    @Override
    public K navToKey(NodeKey key) {
        if (key == null)
            throw new IllegalArgumentException("null");

        Object[] keys = key.getKeys();

        // If we are navigating to a key with null segments
        // this indicates the first root, and we will
        // navigate to and change state to indicate such
        if ((keys == null || keys.length == 0)) {
            this.key = key;
            this.data = null;
            return null;
        }

        int i;
        K c = null;
        for (i = 0; i < keys.length; i++)
            c = navToChild(keys[i]);

        return c;
    }

    @Override
    public K navToParent() {
        if (atNullRoot()) return null;
        else {
            data = parentMap.get(getData());
            key = getKey().getParent();
            return data;
        }
    }

	public K getParentData() {
		return parentMap.get(getData());
	}

    @Override
    public K navToChild(Object keySegment) {
        // Navigate straight to index if default integer index
        // based key is used
        if (getConverter() == DEFAULT_CONVERTER) {
            Integer index = (Integer) keySegment;

            // Index from root
            if (getKey() == NodeKey.ROOT_KEY) {
                key = new NodeKey(index);
                data = getChildList(null).get(index);
                return data;
            } else {
                data = getChildList(getData()).get(index);
                key = getKey().append(index);
                return data;
            }
        }
        // Otherwise search for matching key in children
        else {
            for (Iterator> children = children();
                 children.hasNext();) {
                Map.Entry childEntry = children.next();
                Object[] keys = childEntry.getKey().getKeys();

                if (keys[keys.length-1].equals(keySegment)) {
                    key = childEntry.getKey();
                    data = childEntry.getValue();
                    return data;
                }
            }
        }

        return null;
    }

    public List getChildList(K node) {
        List children = childMap.get(node);

        if (children == null) {
            children = loadChildrenForNode(getData());
            childMap.put(node, children);
            for (K child : children)
                parentMap.put(child, node);
        }

        return children;
    }

    @Override
    public Iterator> children() {
        List children = getChildList(getData());

        return new NodeListToNodeEntryIterator(
                getConverter(),
                getKey(),
                children);
    }

    @Override
    public KeySegmentConverter getConverter() {
        if (converter == null) return DEFAULT_CONVERTER;
        return converter;
    }

    @Override
    public void setConverter(KeySegmentConverter converter) {
        this.converter = converter;
    }

    @Override
    public boolean isNodeAvailable() {
        return getData() != null;
    }

    @Override
    public boolean isLeaf() {
        return getChildList(getData()).size() == 0;
    }

    @Override
    public boolean isMutable() {
        return false;
    }

    @Override
    public Object getWrappedData() {
        return null;
    }

    @Override
    public void setWrappedData(Object o) {}
}