0N/A/*
2362N/A * Copyright (c) 2003, 2006, Oracle and/or its affiliates. All rights reserved.
0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
0N/A *
0N/A * This code is free software; you can redistribute it and/or modify it
0N/A * under the terms of the GNU General Public License version 2 only, as
2362N/A * published by the Free Software Foundation. Oracle designates this
0N/A * particular file as subject to the "Classpath" exception as provided
2362N/A * by Oracle in the LICENSE file that accompanied this code.
0N/A *
0N/A * This code is distributed in the hope that it will be useful, but WITHOUT
0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
0N/A * version 2 for more details (a copy is included in the LICENSE file that
0N/A * accompanied this code).
0N/A *
0N/A * You should have received a copy of the GNU General Public License version
0N/A * 2 along with this work; if not, write to the Free Software Foundation,
0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
0N/A *
2362N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
2362N/A * or visit www.oracle.com if you need additional information or have any
2362N/A * questions.
0N/A */
0N/Apackage sun.management.snmp.util;
0N/A
0N/Aimport com.sun.jmx.snmp.SnmpOid;
0N/A
0N/Aimport java.io.Serializable;
0N/A
0N/Aimport java.util.Comparator;
0N/Aimport java.util.Arrays;
0N/Aimport java.util.TreeMap;
0N/Aimport java.util.List;
0N/Aimport java.util.Iterator;
0N/A
0N/Aimport java.lang.ref.WeakReference;
0N/A
0N/A/**
0N/A * This class is used to cache table data.
0N/A **/
0N/Apublic class SnmpCachedData implements SnmpTableHandler {
0N/A
0N/A /**
0N/A * Compares two SnmpOid.
0N/A **/
0N/A public static final Comparator<SnmpOid> oidComparator =
0N/A new Comparator<SnmpOid>() {
0N/A public int compare(SnmpOid o1, SnmpOid o2) {
0N/A return o1.compareTo(o2);
0N/A }
0N/A public boolean equals(Object o1, Object o2) {
0N/A if (o1 == o2) return true;
0N/A else return o1.equals(o2);
0N/A }
0N/A };
0N/A
0N/A /**
0N/A * Constructs a new instance of SnmpCachedData. Instances are
0N/A * immutable.
0N/A * @param lastUpdated Time stamp as returned by
0N/A * {@link System#currentTimeMillis System.currentTimeMillis()}
0N/A * @param indexes The table entry indexes, sorted in ascending order.
0N/A * @param datas The table datas, sorted according to the
0N/A * order in <code>indexes</code>: <code>datas[i]</code>
0N/A * is the data that corresponds to
0N/A * <code>indexes[i]</code>
0N/A **/
0N/A public SnmpCachedData(long lastUpdated, SnmpOid indexes[],
0N/A Object datas[]) {
0N/A this.lastUpdated = lastUpdated;
0N/A this.indexes = indexes;
0N/A this.datas = datas;
0N/A }
0N/A
0N/A /**
0N/A * Constructs a new instance of SnmpCachedData. Instances are
0N/A * immutable.
0N/A * @param lastUpdated Time stamp as returned by
0N/A * {@link System#currentTimeMillis System.currentTimeMillis()}
0N/A * @param indexMap The table indexed table data, sorted in ascending
0N/A * order by {@link #oidComparator}. The keys must be
0N/A * instances of {@link SnmpOid}.
0N/A **/
0N/A public SnmpCachedData(long lastUpdated, TreeMap<SnmpOid, Object> indexMap) {
0N/A this(lastUpdated, indexMap, true);
0N/A }
0N/A /**
0N/A * Constructs a new instance of SnmpCachedData. Instances are
0N/A * immutable.
0N/A * @param lastUpdated Time stamp as returned by
0N/A * {@link System#currentTimeMillis System.currentTimeMillis()}
0N/A * @param indexMap The table indexed table data, sorted in ascending
0N/A * order by {@link #oidComparator}. The keys must be
0N/A * instances of {@link SnmpOid}.
0N/A **/
0N/A public SnmpCachedData(long lastUpdated, TreeMap<SnmpOid, Object> indexMap,
0N/A boolean b) {
0N/A
0N/A final int size = indexMap.size();
0N/A this.lastUpdated = lastUpdated;
0N/A this.indexes = new SnmpOid[size];
0N/A this.datas = new Object[size];
0N/A
0N/A if(b) {
0N/A indexMap.keySet().toArray(this.indexes);
0N/A indexMap.values().toArray(this.datas);
0N/A } else
0N/A indexMap.values().toArray(this.datas);
0N/A }
0N/A
0N/A /**
0N/A * Time stamp as returned by
0N/A * {@link System#currentTimeMillis System.currentTimeMillis()}
0N/A **/
0N/A public final long lastUpdated;
0N/A
0N/A /**
0N/A * The table entry indexes, sorted in ascending order.
0N/A **/
0N/A public final SnmpOid indexes[];
0N/A
0N/A /**
0N/A * The table datas, sorted according to the
0N/A * order in <code>indexes</code>: <code>datas[i]</code>
0N/A * is the data that corresponds to <code>indexes[i]</code>
0N/A **/
0N/A public final Object datas[];
0N/A
0N/A /**
0N/A * The position of the given <var>index</var>, as returned by
0N/A * <code>java.util.Arrays.binarySearch()</code>
0N/A **/
0N/A public final int find(SnmpOid index) {
0N/A return Arrays.binarySearch(indexes,index,oidComparator);
0N/A }
0N/A
0N/A // SnmpTableHandler.getData()
0N/A public Object getData(SnmpOid index) {
0N/A final int pos = find(index);
0N/A if ((pos < 0)||(pos >= datas.length)) return null;
0N/A return datas[pos];
0N/A }
0N/A
0N/A // SnmpTableHandler.getNext()
0N/A public SnmpOid getNext(SnmpOid index) {
0N/A if (index == null) {
0N/A if (indexes.length>0) return indexes[0];
0N/A else return null;
0N/A }
0N/A final int pos = find(index);
0N/A if (pos > -1) {
0N/A if (pos < (indexes.length -1) ) return indexes[pos+1];
0N/A else return null;
0N/A }
0N/A final int insertion = -pos -1;
0N/A if ((insertion > -1) && (insertion < indexes.length))
0N/A return indexes[insertion];
0N/A else return null;
0N/A }
0N/A
0N/A // SnmpTableHandler.contains()
0N/A public boolean contains(SnmpOid index) {
0N/A final int pos = find(index);
0N/A return ((pos > -1)&&(pos < indexes.length));
0N/A }
0N/A
0N/A}