Back to project page android-pdfview.
The source code is released under:
GNU General Public License
If you think the Android project android-pdfview listed in this page is inappropriate, such as containing malicious code/tools or violating the copyright, please email info at java2s dot com, thanks.
/** * Copyright 2014 Joan Zapata/*ww w .ja va 2 s. com*/ * * This file is part of Android-pdfview. * * Android-pdfview is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * Android-pdfview 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 General Public License for more details. * * You should have received a copy of the GNU General Public License * along with Android-pdfview. If not, see <http://www.gnu.org/licenses/>. */ package com.joanzapata.pdfview; import android.graphics.RectF; import com.joanzapata.pdfview.model.PagePart; import java.util.Comparator; import java.util.PriorityQueue; import java.util.Vector; import static com.joanzapata.pdfview.util.Constants.Cache.*; class CacheManager { private PriorityQueue<PagePart> passiveCache; private PriorityQueue<PagePart> activeCache; private Vector<PagePart> thumbnails; public CacheManager() { activeCache = new PriorityQueue<PagePart>(CACHE_SIZE, new PagePartComparator()); passiveCache = new PriorityQueue<PagePart>(CACHE_SIZE, new PagePartComparator()); thumbnails = new Vector<PagePart>(); } public void cachePart(PagePart part) { // If cache too big, remove and recycle makeAFreeSpace(); // Then add part activeCache.offer(part); } public void makeANewSet() { passiveCache.addAll(activeCache); activeCache.clear(); } private void makeAFreeSpace() { while ((activeCache.size() + passiveCache.size()) >= CACHE_SIZE && !passiveCache.isEmpty()) { passiveCache.poll().getRenderedBitmap().recycle(); } while ((activeCache.size() + passiveCache.size()) >= CACHE_SIZE && !activeCache.isEmpty()) { activeCache.poll().getRenderedBitmap().recycle(); } } public void cacheThumbnail(PagePart part) { // If cache too big, remove and recycle if (thumbnails.size() >= THUMBNAILS_CACHE_SIZE) { thumbnails.remove(0).getRenderedBitmap().recycle(); } // Then add thumbnail thumbnails.add(part); } public boolean upPartIfContained(int userPage, int page, float width, float height, RectF pageRelativeBounds, int toOrder) { PagePart fakePart = new PagePart(userPage, page, null, width, height, pageRelativeBounds, false, 0); PagePart found; if ((found = find(passiveCache, fakePart)) != null) { passiveCache.remove(found); found.setCacheOrder(toOrder); activeCache.offer(found); return true; } return find(activeCache, fakePart) != null; } /** Return true if already contains the described PagePart */ public boolean containsThumbnail(int userPage, int page, float width, float height, RectF pageRelativeBounds) { PagePart fakePart = new PagePart(userPage, page, null, width, height, pageRelativeBounds, true, 0); for (PagePart part : thumbnails) { if (part.equals(fakePart)) { return true; } } return false; } private PagePart find(PriorityQueue<PagePart> vector, PagePart fakePart) { for (PagePart part : vector) { if (part.equals(fakePart)) { return part; } } return null; } public Vector<PagePart> getPageParts() { Vector<PagePart> parts = new Vector<PagePart>(passiveCache); parts.addAll(activeCache); return parts; } public Vector<PagePart> getThumbnails() { return thumbnails; } public void recycle() { for (PagePart part : activeCache) { part.getRenderedBitmap().recycle(); } for (PagePart part : activeCache) { part.getRenderedBitmap().recycle(); } for (PagePart part : thumbnails) { part.getRenderedBitmap().recycle(); } passiveCache.clear(); activeCache.clear(); thumbnails.clear(); } class PagePartComparator implements Comparator<PagePart> { @Override public int compare(PagePart part1, PagePart part2) { if (part1.getCacheOrder() == part2.getCacheOrder()) { return 0; } return part1.getCacheOrder() > part2.getCacheOrder() ? 1 : -1; } } }