IndexBuffer.java revision 23cb1d1297a0807fe827a38a17c54bfe1fd05e2d
/*
* 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 legal-notices/CDDLv1_0.txt
* 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 legal-notices/CDDLv1_0.txt.
* 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 2006-2008 Sun Microsystems, Inc.
* Portions Copyright 2014-2015 ForgeRock AS
*/
/**
* A buffered index is used to buffer multiple reads or writes to the
* same index key into a single read or write.
* It can only be used to buffer multiple reads and writes under
* the same transaction. The transaction may be null if it is known
* that there are no other concurrent updates to the index.
*/
class IndexBuffer
{
private final EntryContainer entryContainer;
/**
* The buffered records stored as a map from the record key to the
* buffered value for that key for each index.
*/
/** The buffered records stored as a set of buffered VLV values for each index. */
/**
* A simple class representing a pair of added and deleted indexed IDs. Initially both addedIDs
* and deletedIDs are {@code null} indicating that that the whole record should be deleted.
*/
private static class BufferedIndexValues
{
private EntryIDSet addedEntryIDs;
private EntryIDSet deletedEntryIDs;
{
{
if (this.addedEntryIDs == null)
{
this.addedEntryIDs = newDefinedSet();
}
}
}
{
{
if (this.deletedEntryIDs == null)
{
this.deletedEntryIDs = newDefinedSet();
}
}
}
{
}
}
/** A simple class representing a pair of added and deleted VLV values. */
private static class BufferedVLVIndexValues
{
{
{
if (addedSortKeys == null)
{
}
}
}
{
{
if (deletedSortKeys == null)
{
}
}
}
{
}
}
/**
* Construct a new empty index buffer object.
*
* @param entryContainer The entryContainer using this index buffer.
*/
{
this.entryContainer = entryContainer;
}
{
if (bufferedValues == null)
{
bufferedValues = new BufferedVLVIndexValues();
}
return bufferedValues;
}
{
if (bufferedOperations == null)
{
}
else
{
}
{
values = new BufferedIndexValues();
}
return values;
}
/**
* Flush the buffered index changes to storage.
*
* @param txn a non null transaction
* @throws StorageRuntimeException If an error occurs in the storage.
* @throws DirectoryException If a Directory Server error occurs.
*/
{
/*
* FIXME: this seems like a surprising way to update the indexes. Why not
* store the buffered changes in a TreeMap in order to have a predictable
* iteration order?
*/
{
{
}
}
{
if (bufferedVLVValues != null)
{
}
}
}
{
}
{
}
{
}
{
}
{
if (bufferedValues != null)
{
final Iterator<Map.Entry<ByteString, BufferedIndexValues>> it = bufferedValues.entrySet().iterator();
{
}
}
}
}