mirror of
https://github.com/Alfresco/SearchServices.git
synced 2025-09-17 14:21:20 +00:00
eb21a3c286
125788 rmunteanu: Merged 5.1.N (5.1.2) to 5.2.N (5.2.1)
125606 rmunteanu: Merged 5.1.1 (5.1.1) to 5.1.N (5.1.2)
125515 slanglois: MNT-16155 Update source headers - add new Copyrights for Java and JSP source files + automatic check in the build
git-svn-id: https://svn.alfresco.com/repos/alfresco-enterprise/alfresco/HEAD/root@127810 c4b6b30b-aa2e-2d43-bbcb-ca4b014f7261
86 lines
2.1 KiB
Java
86 lines
2.1 KiB
Java
/*
|
|
* #%L
|
|
* Alfresco Solr Client
|
|
* %%
|
|
* Copyright (C) 2005 - 2016 Alfresco Software Limited
|
|
* %%
|
|
* This file is part of the Alfresco software.
|
|
* If the software was purchased under a paid Alfresco license, the terms of
|
|
* the paid license agreement will prevail. Otherwise, the software is
|
|
* provided under the following open source license terms:
|
|
*
|
|
* Alfresco is free software: you can redistribute it and/or modify
|
|
* it under the terms of the GNU Lesser General Public License as published by
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* Alfresco is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public License
|
|
* along with Alfresco. If not, see <http://www.gnu.org/licenses/>.
|
|
* #L%
|
|
*/
|
|
|
|
package org.alfresco.solr;
|
|
|
|
import java.util.Iterator;
|
|
import java.util.concurrent.LinkedBlockingDeque;
|
|
|
|
public class BoundedDeque<T> implements Iterable<T>
|
|
{
|
|
private LinkedBlockingDeque<T> deque;
|
|
|
|
private int max = 10;
|
|
|
|
public BoundedDeque(int max)
|
|
{
|
|
this.max = max;
|
|
setDeque(new LinkedBlockingDeque<T>());
|
|
}
|
|
|
|
/**
|
|
* @return int
|
|
*/
|
|
public int size()
|
|
{
|
|
return getDeque().size();
|
|
}
|
|
|
|
public void add(T add)
|
|
{
|
|
while (getDeque().size() > (max - 1))
|
|
{
|
|
getDeque().removeLast();
|
|
}
|
|
getDeque().addFirst(add);
|
|
}
|
|
|
|
public T getLast()
|
|
{
|
|
return getDeque().getFirst();
|
|
}
|
|
|
|
/*
|
|
* (non-Javadoc)
|
|
* @see java.lang.Iterable#iterator()
|
|
*/
|
|
@Override
|
|
public Iterator<T> iterator()
|
|
{
|
|
return getDeque().iterator();
|
|
}
|
|
|
|
public LinkedBlockingDeque<T> getDeque()
|
|
{
|
|
return deque;
|
|
}
|
|
|
|
public void setDeque(LinkedBlockingDeque<T> deque)
|
|
{
|
|
this.deque = deque;
|
|
}
|
|
|
|
} |