org.javimmutable.collections.array.trie32.FullBranchTrieNode Maven / Gradle / Ivy
///###////////////////////////////////////////////////////////////////////////
//
// Burton Computer Corporation
// http://www.burton-computer.com
//
// Copyright (c) 2014, Burton Computer Corporation
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in
// the documentation and/or other materials provided with the
// distribution.
//
// Neither the name of the Burton Computer Corporation nor the names
// of its contributors may be used to endorse or promote products
// derived from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
package org.javimmutable.collections.array.trie32;
import org.javimmutable.collections.Cursor;
import org.javimmutable.collections.Func1;
import org.javimmutable.collections.Holder;
import org.javimmutable.collections.Indexed;
import org.javimmutable.collections.JImmutableMap;
import org.javimmutable.collections.common.MutableDelta;
import org.javimmutable.collections.cursors.MultiTransformCursor;
import org.javimmutable.collections.cursors.StandardCursor;
import javax.annotation.concurrent.Immutable;
@Immutable
public class FullBranchTrieNode
extends TrieNode
{
private final int shift;
private final TrieNode[] entries;
FullBranchTrieNode(int shift,
TrieNode[] entries)
{
this.shift = shift;
this.entries = entries;
}
static FullBranchTrieNode fromSource(int index,
Indexed source,
int offset)
{
assert (source.size() - offset) >= 32;
TrieNode[] entries = MultiBranchTrieNode.allocate(32);
for (int i = 0; i < 32; ++i) {
entries[i] = LeafTrieNode.of(index++, source.get(offset++));
}
return new FullBranchTrieNode(0, entries);
}
@Override
public boolean isEmpty()
{
return false;
}
@Override
public T getValueOr(int shift,
int index,
T defaultValue)
{
assert this.shift == shift;
final int childIndex = (index >>> shift) & 0x1f;
return entries[childIndex].getValueOr(shift - 5, index, defaultValue);
}
@Override
public V getValueOr(int shift,
int index,
K key,
Transforms transforms,
V defaultValue)
{
assert this.shift == shift;
final int childIndex = (index >>> shift) & 0x1f;
return entries[childIndex].getValueOr(shift - 5, index, key, transforms, defaultValue);
}
@Override
public Holder find(int shift,
int index)
{
assert this.shift == shift;
final int childIndex = (index >>> shift) & 0x1f;
return entries[childIndex].find(shift - 5, index);
}
@Override
public Holder find(int shift,
int index,
K key,
Transforms transforms)
{
assert this.shift == shift;
final int childIndex = (index >>> shift) & 0x1f;
return entries[childIndex].find(shift - 5, index, key, transforms);
}
@Override
public TrieNode assign(int shift,
int index,
T value,
MutableDelta sizeDelta)
{
assert this.shift == shift;
final int childIndex = (index >>> shift) & 0x1f;
final TrieNode child = entries[childIndex];
final TrieNode newChild = child.assign(shift - 5, index, value, sizeDelta);
if (newChild == child) {
return this;
} else {
return createUpdatedEntries(shift, childIndex, newChild);
}
}
@Override
public TrieNode assign(int shift,
int index,
K key,
V value,
Transforms transforms,
MutableDelta sizeDelta)
{
assert this.shift == shift;
final int childIndex = (index >>> shift) & 0x1f;
final TrieNode child = entries[childIndex];
final TrieNode newChild = child.assign(shift - 5, index, key, value, transforms, sizeDelta);
if (newChild == child) {
return this;
} else {
return createUpdatedEntries(shift, childIndex, newChild);
}
}
@Override
public TrieNode delete(int shift,
int index,
MutableDelta sizeDelta)
{
assert this.shift == shift;
final int childIndex = (index >>> shift) & 0x1f;
final TrieNode child = entries[childIndex];
final TrieNode newChild = child.delete(shift - 5, index, sizeDelta);
if (newChild == child) {
return this;
} else if (newChild.isEmpty()) {
return MultiBranchTrieNode.fullWithout(shift, entries, childIndex);
} else {
return createUpdatedEntries(shift, childIndex, newChild);
}
}
@Override
public TrieNode delete(int shift,
int index,
K key,
Transforms transforms,
MutableDelta sizeDelta)
{
assert this.shift == shift;
final int childIndex = (index >>> shift) & 0x1f;
final TrieNode child = entries[childIndex];
final TrieNode newChild = child.delete(shift - 5, index, key, transforms, sizeDelta);
if (newChild == child) {
return this;
} else if (newChild.isEmpty()) {
return MultiBranchTrieNode.fullWithout(shift, entries, childIndex);
} else {
return createUpdatedEntries(shift, childIndex, newChild);
}
}
@Override
public int getShift()
{
return shift;
}
@Override
public boolean isLeaf()
{
return false;
}
@Override
public Cursor> anyOrderEntryCursor()
{
return MultiTransformCursor.of(StandardCursor.of(new CursorSource()), new Func1, Cursor>>()
{
@Override
public Cursor> apply(TrieNode node)
{
return node.anyOrderEntryCursor();
}
});
}
@Override
public Cursor anyOrderValueCursor()
{
return MultiTransformCursor.of(StandardCursor.of(new CursorSource()), new Func1, Cursor>()
{
@Override
public Cursor apply(TrieNode node)
{
return node.anyOrderValueCursor();
}
});
}
@Override
public Cursor> anyOrderEntryCursor(final Transforms transforms)
{
return MultiTransformCursor.of(StandardCursor.of(new CursorSource()), new Func1, Cursor>>()
{
@Override
public Cursor> apply(TrieNode node)
{
return node.anyOrderEntryCursor(transforms);
}
});
}
private TrieNode createUpdatedEntries(int shift,
int childIndex,
TrieNode newChild)
{
assert newChild.isLeaf() || (newChild.getShift() == (shift - 5));
TrieNode[] newEntries = entries.clone();
newEntries[childIndex] = newChild;
return new FullBranchTrieNode(shift, newEntries);
}
private class CursorSource
implements StandardCursor.Source>
{
private final int index;
private CursorSource()
{
this(0);
}
private CursorSource(int index)
{
this.index = index;
}
@Override
public boolean atEnd()
{
return index >= entries.length;
}
@Override
public TrieNode currentValue()
{
return entries[index];
}
@Override
public StandardCursor.Source> advance()
{
return atEnd() ? this : new CursorSource(index + 1);
}
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy