If you think the Android project rfcx-guardian-android listed in this page is inappropriate, such as containing malicious code/tools or violating the copyright, please email info at java2s dot com, thanks.
Java Source Code
/*
* Copyright (C) 2010 Preston Lacey http://javaflacencoder.sourceforge.net/
* All Rights Reserved./*fromwww.java2s.com*/
*
* This library 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 2.1 of the License, or (at your option) any later version.
*
* This library 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 this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/package net.sourceforge.javaFlacEncoder;
import java.util.concurrent.LinkedBlockingQueue;
/**
* The purpose of this class is to provide a source for reusable int arrays.
* When using large numbers of arrays in succession, it is inefficient to
* constantly go in an allocate/free loop. This way, we may pass a single,
* thread-safe recycler to all objects. No matter where the arrays end their
* life, we can then add it to the same resource store.
*
* @author Preston Lacey
*/publicclass ArrayRecycler {
LinkedBlockingQueue<int[]> usedIntArrays = null;
ArrayRecycler() {
usedIntArrays = new LinkedBlockingQueue<int[]>();
}
publicvoid add(int[] array) {
usedIntArrays.add(array);
}
/**
*
* @param size
* @return
*/publicint[] getArray(int size) {
int[] result = usedIntArrays.poll();
if(result == null) {
result = newint[size];
}
elseif(result.length < size) {
usedIntArrays.offer(result);
result = newint[size];
}
return result;
}
}