View Javadoc

    1   /***
    2    *
    3    * Copyright 2004 Protique Ltd
    4    *
    5    * Licensed under the Apache License, Version 2.0 (the "License");
    6    * you may not use this file except in compliance with the License.
    7    * You may obtain a copy of the License at
    8    *
    9    * http://www.apache.org/licenses/LICENSE-2.0
    10   *
    11   * Unless required by applicable law or agreed to in writing, software
    12   * distributed under the License is distributed on an "AS IS" BASIS,
    13   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
    14   * See the License for the specific language governing permissions and
    15   * limitations under the License.
    16   *
    17   **/
    18
    19  package org.codehaus.activemq.filter;
    20
    21  import org.codehaus.activemq.message.ActiveMQDestination;
    22
    23  import javax.jms.Destination;
    24  import javax.jms.JMSException;
    25  import javax.jms.Message;
    26
    27
    28  /***
    29   * Represents a filter which only operates on Destinations
    30   *
    31   * @version $Revision: 1.3 $
    32   */
    33  public abstract class DestinationFilter implements Filter {
    34      public static final String ANY_DESCENDENT = ">";
    35      public static final String ANY_CHILD = "*";
    36
    37      public boolean matches(Message message) throws JMSException {
    38          return matches(message.getJMSDestination());
    39      }
    40
    41      public abstract boolean matches(Destination destination);
    42
    43      public static DestinationFilter parseFilter(Destination destination) {
    44          if (destination instanceof ActiveMQDestination) {
    45              ActiveMQDestination activeDestination = (ActiveMQDestination) destination;
    46              if (activeDestination.isComposite()) {
    47                  return new CompositeDestinationFilter(activeDestination);
    48              }
    49          }
    50          String[] paths = DestinationPath.getDestinationPaths(destination);
    51          int idx = paths.length - 1;
    52          if (idx >= 0) {
    53              String lastPath = paths[idx];
    54              if (lastPath.equals(ANY_DESCENDENT)) {
    55                  return new PrefixDestinationFilter(paths);
    56              }
    57              else if (lastPath.equals(ANY_CHILD)) {
    58                  return new WildcardDestinationFilter(paths);
    59              }
    60          }
    61
    62          // if none of the paths contain a wildcard then use equality
    63          return new SimpleDestinationFilter(destination);
    64      }
    65  }