|
Java example source code file (CacheMapTest.java)
The CacheMapTest.java Java example source code/* * Copyright (c) 2003, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. * * This code 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 * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. */ /* * @test * @bug 7654321 * @summary Tests the CacheMap class. * @author Eamonn McManus * @run clean CacheMapTest * @run build CacheMapTest * @run main CacheMapTest */ import java.util.Iterator; import java.util.Map; import com.sun.jmx.remote.util.CacheMap; public class CacheMapTest { public static void main(String[] args) { try { boolean ok = test(5) && test(100); if (ok) { System.out.println("Test completed"); return; } else { System.out.println("Test failed!"); System.exit(1); } } catch (Exception e) { System.err.println("Unexpected exception: " + e); e.printStackTrace(); System.exit(1); } } private static boolean test(int cacheSize) throws Exception { System.out.println("CacheMap test with cache size " + cacheSize); CacheMap map = new CacheMap(cacheSize); int size = 0; int maxIterations = cacheSize * 10; while (map.size() == size && size < maxIterations) { Integer key = new Integer(size); Object x = map.put(key, "x"); if (x != null) { System.out.println("Map already had entry " + key + "!"); return false; } x = map.get(key); if (!"x".equals(x)) { System.out.println("Got back surprising value: " + x); return false; } size++; } System.out.println("Map size is " + map.size() + " after inserting " + size + " elements"); do { System.gc(); Thread.sleep(1); System.out.println("Map size is " + map.size() + " after GC"); } while (map.size() > cacheSize); if (map.size() < cacheSize) { System.out.println("Map shrank to less than cache size: " + map.size() + " (surprising but not wrong)"); } else System.out.println("Map shrank to cache size as expected"); int lowest = size - cacheSize; // lowest value that can still be in cache if LRU is respected for (Iterator it = map.entrySet().iterator(); it.hasNext(); ) { Map.Entry entry = (Map.Entry) it.next(); Integer x = (Integer) entry.getKey(); int xx = x.intValue(); if (xx < lowest || xx >= size) { System.out.println("Old value remained (" + x + "), " + "expected none earlier than " + lowest); return false; } Object xxx = entry.getValue(); if (!"x".equals(xxx)) { System.out.println("Got back surprising value: " + xxx); return false; } } if (map.size() > 0) System.out.println("Remaining elements are the most recent ones"); System.out.println("Test passed"); return true; } } Other Java examples (source code examples)Here is a short list of links related to this Java CacheMapTest.java source code file: |
... this post is sponsored by my books ... | |
#1 New Release! |
FP Best Seller |
Copyright 1998-2024 Alvin Alexander, alvinalexander.com
All Rights Reserved.
A percentage of advertising revenue from
pages under the /java/jwarehouse
URI on this website is
paid back to open source projects.