Question

在java,如果加上一个项目将使其超出“公平”规模,那么LFO的数据结构类别使我能够具体说明一个自动放弃旧项目的高米项目规模。

Answer 1

您可以下级<代码>Stack,以获得理想行为。您仅需要超越<代码>push(),以检查大小是否大于N,并抛弃旧项目:

@Override
public void push(E elt) {
    super.push(elt);
    while (this.size() > this.maxSize) {
        this.removeElementAt(this.size() - 1);
    }
}

或许会接近你们想要的东西。

Answer 2

Java没有这样的结构。我希望这一习俗的实施符合你们的需要:

    BlockingDeque<Object> deque = new LinkedBlockingDeque<Object>(32) {
        public void push(Object e) {
            final java.util.concurrent.locks.ReentrantLock lock;
            try {
                Field lockField = LinkedBlockingDeque.class.getDeclaredField("lock");
                lockField.setAccessible(true);
                lock = (ReentrantLock) lockField.get(this);
            } catch (NoSuchFieldException e1) {
                throw new RuntimeException(e1);
            } catch (SecurityException e1) {
                throw new RuntimeException(e1);
            } catch (IllegalArgumentException e1) {
                throw new RuntimeException(e1);
            } catch (IllegalAccessException e1) {
                throw new RuntimeException(e1);
            }
            lock.lock();
            try {
                if (!offerFirst(e)) {
                    pollLast();
                    offerFirst(e);
                }
            } finally {
                lock.unlock();
            }
        }
    };

然后,你将它当作一个圣克(取代旧的圣克阶级):

    deque.push(new Object());
    Object o = deque.pop();

Sorry for all the lock stuff, but it was needed to avoid inconsistencies.

友情链接