All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.apache.camel.component.seda.QueueReference Maven / Gradle / Ivy

There is a newer version: 4.8.1
Show newest version
/*
 * 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.camel.component.seda;

import java.util.LinkedList;
import java.util.List;
import java.util.concurrent.BlockingQueue;

import org.apache.camel.Exchange;

/**
 * Holder for queue references.
 * 

* This is used to keep track of the usages of the queues, so we know when a queue is no longer in use, and can safely * be discarded. */ public final class QueueReference { private final BlockingQueue queue; private Integer size; private Boolean multipleConsumers; private List endpoints = new LinkedList<>(); QueueReference(BlockingQueue queue, Integer size, Boolean multipleConsumers) { this.queue = queue; this.size = size; this.multipleConsumers = multipleConsumers; } synchronized void addReference(SedaEndpoint endpoint) { if (!endpoints.contains(endpoint)) { endpoints.add(endpoint); // update the multipleConsumers setting if need if (endpoint.isMultipleConsumers()) { multipleConsumers = true; } } } synchronized void removeReference(SedaEndpoint endpoint) { if (endpoints.contains(endpoint)) { endpoints.remove(endpoint); } } /** * Gets the reference counter */ public synchronized int getCount() { return endpoints.size(); } /** * Gets the queue size * * @return null if unbounded */ public Integer getSize() { return size; } public Boolean getMultipleConsumers() { return multipleConsumers; } /** * Gets the queue */ public BlockingQueue getQueue() { return queue; } public synchronized boolean hasConsumers() { for (SedaEndpoint endpoint : endpoints) { if (!endpoint.getConsumers().isEmpty()) { return true; } } return false; } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy