NodeConversor.java

/*
 * Created on 02-nov-2006
 *


 */
package se.cambio.openehr.view.util;

import se.cambio.openehr.view.trees.SelectableNode;

import java.text.Normalizer;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Enumeration;


/**
 * @author icorram
 *
 */
public class NodeConversor {

    public static enum SearchType{
        SEARCH_ONLY_LEAVES, SEARCH_ONLY_PARENT, SEARCH_ALL
    }

    public static void  setAllVisible(SelectableNode<?> rootNode){
        rootNode.setVisible(true);
        Enumeration<?> e = rootNode.getAllchildren();
        while (e.hasMoreElements()){
            NodeConversor.setAllVisible((SelectableNode<?>)e.nextElement());
        }
    }

    public static void filterByText(SelectableNode<?> rootNode, String filtro){
        boolean visible = false;
        if (rootNode.getName()!=null){
            if (filtro.trim().length()>0){
                String desc1 = Normalizer.normalize(rootNode.getName(), Normalizer.Form.NFD);
                desc1 = FormatConverter.textWithoutPunctuation(desc1);
                String desc2 = Normalizer.normalize(filtro, Normalizer.Form.NFD);
                desc2 = FormatConverter.textWithoutPunctuation(desc2);
                visible = desc1.contains(desc2);
            }else{
                visible = true;
            }
        }
        if (rootNode.isSingleSelectionMode()){
            rootNode.setSelected(false);
        }
        rootNode.setVisible(visible);
        if (visible){
            filtro = new String();
        }
        if (!rootNode.isLeaf()){
            Enumeration<?> e = rootNode.getAllchildren();
            while (e.hasMoreElements()){
                NodeConversor.filterByText(
                        (SelectableNode<?>)e.nextElement(),
                        filtro);
            }
            if (rootNode.getChildCount()!=0) {
                rootNode.setVisible(true);
            }
        }
    }

    /*
     * @deprecated use {@link #getSelectedElement()} instead
     */
    @Deprecated
    public static Object getSelectedObject(SelectableNode<?> rootNode){
        SelectableNode<?> selectedNode = getSelectedNode(rootNode, false);
        return selectedNode!=null?selectedNode.getObject():null;
    }

    public static <E> E getSelectedElement(SelectableNode<E> rootNode){
        SelectableNode<E> selectedNode = getSelectedNode(rootNode, false);
        return selectedNode!=null?selectedNode.getObject():null;
    }
    
    public static Object getSelectedObject(SelectableNode<?> rootNode, boolean allowParent){
        SelectableNode<?> selectedNode = getSelectedNode(rootNode, allowParent);
        return selectedNode!=null?selectedNode.getObject():null;
    }

    public static <K>SelectableNode<K> getSelectedNode(SelectableNode<K> rootNode, boolean allowParent){
        Enumeration<?> e = rootNode.getAllchildren();
        while (e.hasMoreElements()){
            SelectableNode<K> node = (SelectableNode<K>)e.nextElement();
            if (node.isSelected() && (allowParent || node.isLeaf() || node.isMultipleSelectionMode())){
                return node;
            }else {
                if (!node.isLeaf() && node.hasChildrenSelected()){
                    return getSelectedNode(node, allowParent);
                }
            }
        }
        return null;
    }

    public static <K>Collection<K> getSelectedObjects(SelectableNode<K> rootNode){
        return getSelectedObjects(rootNode, SearchType.SEARCH_ALL);
    }

    public static <K>Collection<K> getSelectedObjects(SelectableNode<K> rootNode, SearchType searchType){
        Collection<SelectableNode<K>> selectedNodes = new ArrayList<SelectableNode<K>>();
        addSelectedNodes(rootNode, selectedNodes, searchType);
        Collection<K> selectedObjects = new ArrayList<K>();
        for (SelectableNode<K> node : selectedNodes) {
            if (node.getObject() != null) {
                selectedObjects.add(node.getObject());
            }
        }
        return selectedObjects;
    }

    public static <K>void addSelectedNodes(SelectableNode<K> rootNode, Collection<SelectableNode<K>> selectedNodes, SearchType searchType){
        Enumeration<?> e = rootNode.getAllchildren();
        while (e.hasMoreElements()){
            SelectableNode<K> node = (SelectableNode<K>)e.nextElement();
            if (node.isSelected()){
                if (searchType!=SearchType.SEARCH_ONLY_LEAVES || node.isLeaf()){
                    selectedNodes.add(node);
                }
                if (searchType!=SearchType.SEARCH_ONLY_PARENT){
                    addSelectedNodes(node, selectedNodes, searchType);
                }
            }else if (node.hasChildrenSelected()){
                if (searchType!=SearchType.SEARCH_ONLY_PARENT || !node.isLeaf()){
                    addSelectedNodes(node, selectedNodes, searchType);
                }
            }
        }
    }


    public static boolean selectObject(SelectableNode<?> rootNode, Object obj){
        Enumeration<?> e = rootNode.getAllchildren();
        while (e.hasMoreElements()){
            SelectableNode<?> node = (SelectableNode<?>)e.nextElement();
            if (obj.equals(node.getObject())){
                node.setSelected(true);
                node.stateChange(node);
                return true;
            }else{
                boolean found = selectObject(node, obj);
                if (found){
                    return true;
                }
            }
        }
        return false;
    }
}
/*
 *  ***** BEGIN LICENSE BLOCK *****
 *  Version: MPL 2.0/GPL 2.0/LGPL 2.1
 *
 *  The contents of this file are subject to the Mozilla Public 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.mozilla.org/MPL/
 *
 *  Software distributed under the License is distributed on an 'AS IS' basis,
 *  WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
 *  for the specific language governing rights and limitations under the
 *  License.
 *
 *
 *  The Initial Developers of the Original Code are Iago Corbal and Rong Chen.
 *  Portions created by the Initial Developer are Copyright (C) 2012-2013
 *  the Initial Developer. All Rights Reserved.
 *
 *  Contributor(s):
 *
 * Software distributed under the License is distributed on an 'AS IS' basis,
 * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
 * for the specific language governing rights and limitations under the
 * License.
 *
 *  ***** END LICENSE BLOCK *****
 */