alvinalexander.com | career | drupal | java | mac | mysql | perl | scala | uml | unix  

ActiveMQ example source code file (AnyChildDestinationNode.java)

This example ActiveMQ source code file (AnyChildDestinationNode.java) is included in the DevDaily.com "Java Source Code Warehouse" project. The intent of this project is to help you "Learn Java by Example" TM.

Java - ActiveMQ tags/keywords

anychilddestinationnode, arraylist, arraylist, collection, collection, destinationnode, destinationnode, iterator, iterator, string, util

The ActiveMQ AnyChildDestinationNode.java source code

/**
 * 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.activemq.filter;

import java.util.ArrayList;
import java.util.Collection;
import java.util.Iterator;
import java.util.Set;

/**
 * An implementation of {@link DestinationNode} which navigates all the children of the given node
 * ignoring the name of the current path (so for navigating using * in a wildcard).
 *
 * 
 */
public class AnyChildDestinationNode implements DestinationNode {
    private DestinationNode node;

    public AnyChildDestinationNode(DestinationNode node) {
        this.node = node;
    }

    public void appendMatchingValues(Set answer, String[] paths, int startIndex) {
        Iterator iter = getChildNodes().iterator();
        while (iter.hasNext()) {
            DestinationNode child = (DestinationNode) iter.next();
            child.appendMatchingValues(answer, paths, startIndex);
        }
    }


    public void appendMatchingWildcards(Set answer, String[] paths, int startIndex) {
        Iterator iter = getChildNodes().iterator();
        while (iter.hasNext()) {
            DestinationNode child = (DestinationNode) iter.next();
            child.appendMatchingWildcards(answer, paths, startIndex);
        }
    }


    public void appendDescendantValues(Set answer) {
        Iterator iter = getChildNodes().iterator();
        while (iter.hasNext()) {
            DestinationNode child = (DestinationNode) iter.next();
            child.appendDescendantValues(answer);
        }
    }

    public DestinationNode getChild(String path) {
        final Collection list = new ArrayList();
        Iterator iter = getChildNodes().iterator();
        while (iter.hasNext()) {
            DestinationNode child = (DestinationNode) iter.next();
            DestinationNode answer = child.getChild(path);
            if (answer != null) {
                list.add(answer);
            }
        }
        if (!list.isEmpty()) {
            return new AnyChildDestinationNode(this) {
                protected Collection getChildNodes() {
                    return list;
                }
            };
        }
        return null;
    }

    public Collection getDesendentValues() {
        Collection answer = new ArrayList();
        Iterator iter = getChildNodes().iterator();
        while (iter.hasNext()) {
            DestinationNode child = (DestinationNode) iter.next();
            answer.addAll(child.getDesendentValues());
        }
        return answer;
    }

    public Collection getValues() {
        Collection answer = new ArrayList();
        Iterator iter = getChildNodes().iterator();
        while (iter.hasNext()) {
            DestinationNode child = (DestinationNode) iter.next();
            answer.addAll(child.getValues());
        }
        return answer;
    }


    public Collection getChildren() {
        Collection answer = new ArrayList();
        Iterator iter = getChildNodes().iterator();
        while (iter.hasNext()) {
            DestinationNode child = (DestinationNode) iter.next();
            answer.addAll(child.getChildren());
        }
        return answer;
    }

    public Collection removeDesendentValues() {
        Collection answer = new ArrayList();
        Iterator iter = getChildNodes().iterator();
        while (iter.hasNext()) {
            DestinationNode child = (DestinationNode) iter.next();
            answer.addAll(child.removeDesendentValues());
        }
        return answer;
    }

    public Collection removeValues() {
        Collection answer = new ArrayList();
        Iterator iter = getChildNodes().iterator();
        while (iter.hasNext()) {
            DestinationNode child = (DestinationNode) iter.next();
            answer.addAll(child.removeValues());
        }
        return answer;
    }

    protected Collection getChildNodes() {
        return node.getChildren();
    }
}


Other ActiveMQ examples (source code examples)

Here is a short list of links related to this ActiveMQ AnyChildDestinationNode.java source code file:

... this post is sponsored by my books ...

#1 New Release!

FP Best Seller

 

new blog posts

 

Copyright 1998-2021 Alvin Alexander, alvinalexander.com
All Rights Reserved.

A percentage of advertising revenue from
pages under the /java/jwarehouse URI on this website is
paid back to open source projects.