/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License, Version 1.0 only
* (the "License"). You may not use this file except in compliance
* with the License.
*
* You can obtain a copy of the license at
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at
* trunk/opends/resource/legal-notices/OpenDS.LICENSE. If applicable,
* add the following below this CDDL HEADER, with the fields enclosed
* by brackets "[]" replaced with your own identifying information:
* Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*
*
* Copyright 2008 Sun Microsystems, Inc.
*/
/**
* This class represents serializable entry cache index structures
* and supporting data types used for the entry cache persistence.
* Structurally it should be an inner class of FileSystemEntryCache
* however due to serialization constraints it has been separated.
*/
/**
* The file system entry cache instance this index belongs to.
*/
/**
*/
/**
* The mapping between backends and ID to DN maps.
*/
/**
* The mapping between DNs and IDs.
*/
/**
* Index constructor.
* @param fsEntryCacheInstance The File System Entry Cache instance
* this index is associated with.
* @param accessOrder The ordering mode for the index map
* {@code true} for access-order,
* {@code false} for insertion-order.
*/
protected FileSystemEntryCacheIndex(
dnMap =
}
/**
* This inner class exist solely to override <CODE>removeEldestEntry()</CODE>
* method of the LinkedHashMap.
*
* @see java.util.LinkedHashMap
*/
/**
* Linked Hash Map Rotator constructor.
* @param initialCapacity The initial capacity.
* @param loadFactor The load factor.
* @param accessOrder The ordering mode - {@code true} for
* access-order, {@code false} for
* insertion-order.
*/
float loadFactor,
boolean accessOrder) {
}
/**
* pair to the map. The eldest entry will be selected by the
* underlying LinkedHashMap implementation based on the access
* order configured and will follow either FIFO implementation
* by default or LRU implementation if configured so explicitly.
* @param eldest The least recently inserted entry in the map,
* or if this is an access-ordered map, the least
* recently accessed entry.
* @return boolean {@code true} if the eldest entry should be
* removed from the map; {@code false} if it
* should be retained.
*/
}
}
}