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.camel.component.seda;
018    
019    import java.util.Comparator;
020    
021    import java.util.concurrent.PriorityBlockingQueue;
022    
023    /**
024     * Implementation of {@link BlockingQueueFactory} producing {@link java.util.concurrent.PriorityBlockingQueue}
025     */
026    public class PriorityBlockingQueueFactory<E> implements BlockingQueueFactory<E> {
027        /**
028         * Comparator used to sort exchanges
029         */
030        private Comparator<E> comparator;
031    
032        public Comparator<E> getComparator() {
033            return comparator;
034        }
035    
036        public void setComparator(Comparator<E> comparator) {
037            this.comparator = comparator;
038        }
039    
040        @Override
041        public PriorityBlockingQueue<E> create() {
042            return comparator == null 
043                ? new PriorityBlockingQueue<E>()
044                // PriorityQueue as a default capacity of 11
045                : new PriorityBlockingQueue<E>(11, comparator);
046        }
047    
048        @Override
049        public PriorityBlockingQueue<E> create(int capacity) {
050            return comparator == null
051                ? new PriorityBlockingQueue<E>(capacity)
052                : new PriorityBlockingQueue<E>(capacity, comparator);
053        }
054    }