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

com.sumologic.logback.queue.BufferWithFifoEviction Maven / Gradle / Ivy

The newest version!
/**
 *    _____ _____ _____ _____    __    _____ _____ _____ _____
 *   |   __|  |  |     |     |  |  |  |     |   __|     |     |
 *   |__   |  |  | | | |  |  |  |  |__|  |  |  |  |-   -|   --|
 *   |_____|_____|_|_|_|_____|  |_____|_____|_____|_____|_____|
 *
 *                UNICORNS AT WARP SPEED SINCE 2010
 *
 * 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 com.sumologic.logback.queue;


import java.util.Collection;

import lombok.extern.slf4j.Slf4j;

import static com.sumologic.logback.queue.CostBoundedConcurrentQueue.CostAssigner;

/**
 * Buffer for one concurrent producer and one concurrent consumer which takes members of
 * the queue in batches.
 * 

* Author: Jose Muniz ([email protected]) * Date: 4/6/13 * Time: 3:29 PM */ @Slf4j public class BufferWithFifoEviction extends BufferWithEviction { private CostBoundedConcurrentQueue queue; private CostAssigner costAssigner; public BufferWithFifoEviction(long capacity, CostAssigner costAssigner) { super(capacity); if (costAssigner == null) { throw new IllegalArgumentException("CostAssigner cannot be null"); } if (capacity <= 0) { throw new IllegalArgumentException("Capacity must be at least 1"); } this.queue = new CostBoundedConcurrentQueue(capacity, costAssigner); this.costAssigner = costAssigner; } @Override protected T evict() { return queue.poll(); } /** * Make room for inserting an element with cost cost * * @param cost the desired cost to evict * @return true if eviction was successful, false otherwise. */ protected boolean evict(long cost) { int numEvicted = 0; if (cost > getCapacity()) return false; long targetCost = getCapacity() - cost; do { numEvicted++; evict(); } while (queue.cost() > targetCost); if (numEvicted > 0) { log.warn("Evicted " + numEvicted + " messages from buffer"); } return true; } @Override public int size() { return queue.size(); } @Override public int drainTo(Collection collection) { return queue.drainTo(collection); } @Override synchronized public boolean add(T element) { boolean wasSuccessful = queue.offer(element); if (!wasSuccessful) { evict(costAssigner.cost(element)); return queue.offer(element); } return true; } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy