org.apache.commons.configuration2.tree.NodeHandler Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of commons-configuration2 Show documentation
Tools to assist in the reading of configuration/preferences files in various formats
The newest version!
/*
 * Licensed to the Apache Software Foundation (ASF) under one or more
 * contributor license agreements.  See the NOTICE file distributed with
 * this work for additional information regarding copyright ownership.
 * The ASF licenses this file to You 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.apache.commons.configuration2.tree;

import java.util.List;
import java.util.Set;

/**
 * 
 * Definition of an interface for accessing the data of a configuration node.
 * 
 * 
 * Hierarchical configurations can deal with arbitrary node structures. In order to obtain information about a specific
 * node object, a so-called {@code NodeHandler} is used. The handler provides a number of methods for querying the
 * internal state of a node in a read-only way.
 * 
 *
 * @param  the type of the nodes this handler deals with
 */
public interface NodeHandler {
    /**
     * Gets an unmodifiable set with the names of all attributes of the specified node.
     *
     * @param node the node
     * @return a set with the names of all attributes of this node
     */
    Set getAttributes(T node);

    /**
     * Gets the value of the specified attribute from the given node. If a concrete {@code NodeHandler} supports
     * attributes with multiple values, result might be a collection.
     *
     * @param node the node
     * @param name the name of the attribute
     * @return the value of this attribute
     */
    Object getAttributeValue(T node, String name);

    /**
     * Gets the child with the given index of the specified node.
     *
     * @param node the node
     * @param index the index (0-based)
     * @return the child with the given index
     */
    T getChild(T node, int index);

    /**
     * Gets an unmodifiable list with all children of the specified node.
     *
     * @param node the node
     * @return a list with the child nodes of this node
     */
    List getChildren(T node);

    /**
     * Gets an unmodifiable list of all children of the specified node with the given name.
     *
     * @param node the node
     * @param name the name of the desired child nodes
     * @return a list with all children with the given name
     */
    List getChildren(T node, String name);

    /**
     * Gets the number of children of the specified node with the given name. This method exists for performance reasons:
     * for some node implementations it may be by far more efficient to count the children than to query a list of all
     * children and determine its size. A concrete implementation can choose the most efficient way to determine the number
     * of children. If a child name is passed in, only the children with this name are taken into account. If the name
     * null is passed, the total number of children must be returned.
     *
     * @param node the node
     * @param name the name of the children in question (can be null for all children)
     * @return the number of the selected children
     */
    int getChildrenCount(T node, String name);

    /**
     * Gets an unmodifiable list of all children of the specified node which are matched by the passed in
     * {@code NodeMatcher} against the provided criterion. This method allows for advanced queries on a node's children.
     *
     * @param node the node
     * @param matcher the {@code NodeMatcher} defining filter criteria
     * @param criterion the criterion to be matched against; this object is passed to the {@code NodeMatcher}
     * @param  the type of the criterion
     * @return a list with all children matched by the matcher
     */
     List getMatchingChildren(T node, NodeMatcher matcher, C criterion);

    /**
     * Gets the number of children of the specified node which are matched by the given {@code NodeMatcher}. This is a
     * more generic version of {@link #getChildrenCount(Object, String)}. It allows checking for arbitrary filter
     * conditions.
     *
     * @param node the node
     * @param matcher the {@code NodeMatcher}
     * @param criterion the criterion to be passed to the {@code NodeMatcher}
     * @param  the type of the criterion
     * @return the number of matched children
     */
     int getMatchingChildrenCount(T node, NodeMatcher matcher, C criterion);

    /**
     * Gets the parent of the specified node.
     *
     * @param node the node
     * @return the parent node
     */
    T getParent(T node);

    /**
     * Gets the root node of the underlying hierarchy.
     *
     * @return the current root node
     */
    T getRootNode();

    /**
     * Gets the value of the specified node.
     *
     * @param node the node
     * @return the value of this node
     */
    Object getValue(T node);

    /**
     * Returns a flag whether the passed in node has any attributes.
     *
     * @param node the node
     * @return a flag whether this node has any attributes
     */
    boolean hasAttributes(T node);

    /**
     * Returns the index of the given child node in the list of children of its parent. This method is the opposite
     * operation of {@link #getChild(Object, int)}. This method returns 0 if the given node is the first child node with
     * this name, 1 for the second child node and so on. If the node has no parent node or if it is an attribute, -1 is
     * returned.
     *
     * @param parent the parent node
     * @param child a child node whose index is to be retrieved
     * @return the index of this child node
     */
    int indexOfChild(T parent, T child);

    /**
     * Checks whether the specified node is defined. Nodes are "defined" if they contain any data, e.g. a value,
     * or attributes, or defined children.
     *
     * @param node the node to test
     * @return a flag whether the passed in node is defined
     */
    boolean isDefined(T node);

    /**
     * Returns the name of the specified node
     *
     * @param node the node
     * @return the name of this node
     */
    String nodeName(T node);
}