【Java】ThreadSafeStack

import java.util.Collection;
import java.util.LinkedList;
import java.util.List;
import java.util.Stack;
import java.util.concurrent.locks.ReadWriteLock;
import java.util.concurrent.locks.ReentrantReadWriteLock;
import java.util.stream.Stream;

import com.xkind.collections.util.ReadWriteLockExtend;

@SuppressWarnings("serial")
public class ThreadSafeStack<E> extends Stack<E> {

    private final List<E> m_stack;
    
    private final ReadWriteLock m_signal = new ReentrantReadWriteLock();

    public ThreadSafeStack() {
        m_stack = new LinkedList<E>();
    }

    public ThreadSafeStack(Collection<E> c) {
        m_stack = new LinkedList<E>(c);
    }

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

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

    @Override
    public E push(E item) {
        return ReadWriteLockExtend.performWriteLock(m_signal, () -> { revert().addFirst(item); return item; });
    }

    @Override
    public E pop() {
        return ReadWriteLockExtend.performWriteLock(m_signal, () -> revert().pollFirst());
    }

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

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

    @Override
    public int search(Object o) {
        return ReadWriteLockExtend.performReadLock(m_signal, () -> m_stack.indexOf(o));
    }

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

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

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

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

}

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();
        }
    }

}
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值