Apache
/
activemq
mirror of https://github.com/apache/activemq.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Adding missing files that did not get commited in last patch applicaiton. 

git-svn-id: https://svn.apache.org/repos/asf/activemq/branches/activemq-4.1@572972 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Hiram R. Chirino 2007-09-05 15:39:36 +00:00
parent 960f4a7706
commit 197845c046
2 changed files with 186 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

140
activemq-core/src/main/java/org/apache/activemq/filter/AnyChildDestinationNode.java Normal file
View File

@ -0,0 +1,140 @@
/**
*
* 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).
*
* @version $Revision: 478324 $
*/
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();
}
}

46
activemq-core/src/main/java/org/apache/activemq/filter/DestinationNode.java Normal file
View File

@ -0,0 +1,46 @@
/**
*
* 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.Collection;
import java.util.Set;
/**
* Represents a node in the {@link DestinationMap} tree
*
* @version $Revision: 478324 $
*/
public interface DestinationNode {
void appendMatchingValues(Set answer, String[] paths, int startIndex);
void appendMatchingWildcards(Set answer, String[] paths, int startIndex);
void appendDescendantValues(Set answer);
Collection getDesendentValues();
DestinationNode getChild(String path);
Collection getValues();
Collection getChildren();
Collection removeDesendentValues();
Collection removeValues();
}