【Java】ThreadSafeQueue

import java.util.Collection;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Spliterator;
import java.util.concurrent.locks.ReadWriteLock;
import java.util.concurrent.locks.ReentrantReadWriteLock;
import java.util.function.Consumer;
import java.util.function.Predicate;
import java.util.stream.Stream;

import com.xkind.collections.util.ReadWriteLockExtend;

public class ThreadSafeQueue<E> implements Queue<E> {

    private final Queue<E> m_queue;
    
    private final ReadWriteLock m_signal = new ReentrantReadWriteLock();

    public ThreadSafeQueue() {
        m_queue = new LinkedList<E>();
    }
    
    public ThreadSafeQueue(Collection<E> c) {
        m_queue = new LinkedList<E>(c);
    }

    @Override
    public int size() {
        return ReadWriteLockExtend.performReadLock(m_signal, () -> m_queue.size());
    }

    @Override
    public boolean isEmpty() {
        return ReadWriteLockExtend.performReadLock(m_signal, () -> m_queue.isEmpty());
    }

    @Override
    public boolean contains(Object o) {
        return ReadWriteLockExtend.performReadLock(m_signal, () -> m_queue.contains(o));
    }

    @Override
    public Iterator<E> iterator() {
        return ReadWriteLockExtend.performReadLock(m_signal, () -> revert().iterator());
    }

    @Override
    public Object[] toArray() {
        return ReadWriteLockExtend.performReadLock(m_signal, () -> m_queue.toArray());
    }

    @Override
    public <T> T[] toArray(T[] a) {
        return ReadWriteLockExtend.performReadLock(m_signal, () -> m_queue.toArray(a));
    }

    @Override
    public boolean remove(Object o) {
        return ReadWriteLockExtend.performWriteLock(m_signal, () -> m_queue.remove(o));
    }

    @Override
    public boolean containsAll(Collection<?> c) {
        return ReadWriteLockExtend.performReadLock(m_signal, () -> m_queue.containsAll(c));
    }

    @Override
    public boolean addAll(Collection<? extends E> c) {
        return ReadWriteLockExtend.performWriteLock(m_signal, () -> m_queue.addAll(c));
    }

    @Override
    public boolean removeAll(Collection<?> c) {
        return ReadWriteLockExtend.performWriteLock(m_signal, () -> m_queue.removeAll(c));
    }

    @Override
    public boolean retainAll(Collection<?> c) {
        return ReadWriteLockExtend.performReadLock(m_signal, () -> m_queue.retainAll(c));
    }

    @Override
    public void clear() {
        ReadWriteLockExtend.performWriteLock(m_signal, () -> m_queue.clear());
    }

    @Override
    public boolean add(E e) {
        return ReadWriteLockExtend.performWriteLock(m_signal, () -> m_queue.add(e));
    }

    @Override
    public boolean offer(E e) {
        return ReadWriteLockExtend.performWriteLock(m_signal, () -> m_queue.offer(e));
    }

    @Override
    public E remove() {
        return ReadWriteLockExtend.performWriteLock(m_signal, () -> m_queue.remove());
    }

    @Override
    public E poll() {
        return ReadWriteLockExtend.performWriteLock(m_signal, () -> m_queue.poll());
    }

    @Override
    public E element() {
        return ReadWriteLockExtend.performReadLock(m_signal, () -> m_queue.element());
    }

    @Override
    public E peek() {
        return ReadWriteLockExtend.performReadLock(m_signal, () -> m_queue.peek());
    }

    @Override
    public boolean removeIf(Predicate<? super E> filter) {
        return ReadWriteLockExtend.performWriteLock(m_signal, () -> m_queue.removeIf(filter));
    }

    @Override
    public Spliterator<E> spliterator() {
        return ReadWriteLockExtend.performReadLock(m_signal, () -> m_queue.spliterator());
    }

    @Override
    public Stream<E> stream() {
        return ReadWriteLockExtend.performReadLock(m_signal, () -> m_queue.stream());
    }

    @Override
    public Stream<E> parallelStream() {
        return ReadWriteLockExtend.performReadLock(m_signal, () -> m_queue.parallelStream());
    }

    @Override
    public void forEach(Consumer<? super E> action) {
        ReadWriteLockExtend.performReadLock(m_signal, () -> m_queue.forEach(action));
    }

    // ----------------------------------------------------------------------------------

    private LinkedList<E> revert() {
        if (m_queue instanceof LinkedList) {
            return (LinkedList<E>) m_queue;
        } else {
            return new LinkedList<E>(m_queue);
        }
    }

}

ReadWriteLockExtend

package com.xkind.collections.util;

import java.util.concurrent.locks.ReadWriteLock;
import java.util.function.Supplier;

public class ReadWriteLockExtend {

    public static void performReadLock(final ReadWriteLock signal, final Runnable runnable) {
        signal.readLock().lock();
        try {
            runnable.run();
        } finally {
            signal.readLock().unlock();
        }
    }

    public static <T> T performReadLock(final ReadWriteLock signal, final Supplier<T> supplier) {
        signal.readLock().lock();
        try {
            return supplier.get();
        } finally {
            signal.readLock().unlock();
        }
    }

    public static void performWriteLock(final ReadWriteLock signal, final Runnable runnable) {
        signal.writeLock().lock();
        try {
            runnable.run();
        } finally {
            signal.writeLock().unlock();
        }
    }

    public static <T> T performWriteLock(final ReadWriteLock signal, final Supplier<T> supplier) {
        signal.writeLock().lock();
        try {
            return supplier.get();
        } finally {
            signal.writeLock().unlock();
        }
    }

}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值