com.sun.btrace.BTraceMap Maven / Gradle / Ivy

Go to download
/*
 * Copyright 2008-2010 Sun Microsystems, Inc.  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.  Sun designates this
 * particular file as subject to the "Classpath" exception as provided
 * by Sun in the LICENSE file that accompanied this code.
 *
 * 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
 * CA 95054 USA or visit www.sun.com if you need additional information or
 * have any questions.
 */

package com.sun.btrace;

import java.util.Collection;
import java.util.HashMap;
import java.util.Map;
import java.util.Set;
import java.util.WeakHashMap;

/** 
 * Instances of this class are used to store  aggregate 
 * tracing data in BTrace. 
 *
 * @author A. Sundararajan
 */
final class BTraceMap implements Map, Cloneable {
    //private int numItems;
    private final Map m;
    private boolean isWeak;
    BTraceMap(Map m) {
        if (m == null) {
            throw new NullPointerException();
        }
        this.m = m;
        isWeak = (m instanceof WeakHashMap);
    }

    public synchronized int size() {
        return m.size();
    }

    public synchronized boolean isEmpty(){
        return m.isEmpty();
    }

    public synchronized boolean containsKey(Object key) {
        return m.containsKey(key);
    }

    public synchronized boolean containsValue(Object value){
        return m.containsValue(value);
    }

    public synchronized V get(Object key) {
        return m.get(key);
    }

    public synchronized V put(K key, V value) {
        return m.put(key, value);
    }

    public synchronized V remove(Object key) {
        return m.remove(key);
    }

    public synchronized void putAll(Map map) {
        m.putAll(map);
    }

    public synchronized void clear() {
        m.clear();
    }

    private transient Set keySet = null;
    private transient Set> entrySet = null;
    private transient Collection values = null;

    public synchronized Set keySet() {
        if (keySet == null) {
            keySet = m.keySet();
        }
        return keySet;
    }
 
    public synchronized Set> entrySet() {
        if (entrySet == null) {
            entrySet = m.entrySet();
        }
        return entrySet;
    }

    public synchronized Collection values() {
        if (values == null) {
            values = m.values();
        }
        return values;
    }

    public synchronized boolean equals(Object o) {
        return m.equals(o);
    }

    public synchronized int hashCode() {
        return m.hashCode();
    }

    public synchronized String toString() {
        return m.toString();
    }

    @Override
    protected Object clone() throws CloneNotSupportedException {
        return new BTraceMap(isWeak ? new WeakHashMap() : new HashMap());
    }


}