001    /**
002     * Licensed to the Apache Software Foundation (ASF) under one or more
003     * contributor license agreements.  See the NOTICE file distributed with
004     * this work for additional information regarding copyright ownership.
005     * The ASF licenses this file to You under the Apache License, Version 2.0
006     * (the "License"); you may not use this file except in compliance with
007     * the License.  You may obtain a copy of the License at
008     *
009     *      http://www.apache.org/licenses/LICENSE-2.0
010     *
011     * Unless required by applicable law or agreed to in writing, software
012     * distributed under the License is distributed on an "AS IS" BASIS,
013     * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
014     * See the License for the specific language governing permissions and
015     * limitations under the License.
016     */
017    package org.apache.activemq.broker.region.policy;
018    
019    import java.util.List;
020    import org.apache.activemq.broker.region.MessageReference;
021    import org.apache.activemq.broker.region.Subscription;
022    import org.apache.activemq.filter.MessageEvaluationContext;
023    
024    /**
025     * Simple dispatch policy that sends a message to every subscription that
026     * matches the message.
027     * 
028     * @org.apache.xbean.XBean
029     * 
030     */
031    public class SimpleDispatchPolicy implements DispatchPolicy {
032    
033        public boolean dispatch(MessageReference node, MessageEvaluationContext msgContext, List<Subscription> consumers)
034                throws Exception {
035    
036            int count = 0;
037            for (Subscription sub : consumers) {
038                // Don't deliver to browsers
039                if (sub.getConsumerInfo().isBrowser()) {
040                    continue;
041                }
042                // Only dispatch to interested subscriptions
043                if (!sub.matches(node, msgContext)) {
044                    sub.unmatched(node);
045                    continue;
046                }
047    
048                sub.add(node);
049                count++;
050            }
051    
052            return count > 0;
053        }
054    
055    }