org.apache.cassandra.db.lifecycle.SSTableIntervalTree Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of cassandra-all Show documentation
The Apache Cassandra Project develops a highly scalable second-generation distributed database, bringing together Dynamo's fully distributed design and Bigtable's ColumnFamily-based data model.
The newest version!
/*
 *
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you under the Apache License, Version 2.0 (the
 * "License"); you may not use this file except in compliance
 * with the License.  You may obtain a copy of the License at
 *
 *   http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing,
 * software distributed under the License is distributed on an
 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
 * KIND, either express or implied.  See the License for the
 * specific language governing permissions and limitations
 * under the License.
 *
 */
package org.apache.cassandra.db.lifecycle;

import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.List;

import org.apache.cassandra.config.DatabaseDescriptor;
import org.apache.cassandra.db.PartitionPosition;
import org.apache.cassandra.io.sstable.format.SSTableReader;
import org.apache.cassandra.utils.Interval;
import org.apache.cassandra.utils.IntervalTree;

import static com.google.common.base.Preconditions.checkState;

public class SSTableIntervalTree extends IntervalTree>
{
    private static final SSTableIntervalTree EMPTY = new SSTableIntervalTree(null);

    SSTableIntervalTree(Collection> intervals)
    {
        super(intervals);
    }

    private SSTableIntervalTree(Interval[] minOrder, Interval[] maxOrder)
    {
        super(minOrder, maxOrder);
    }

    @Override
    protected SSTableIntervalTree create(Interval[] minOrder, Interval[] maxOrder)
    {
        return new SSTableIntervalTree(minOrder, maxOrder);
    }

    public static SSTableIntervalTree empty()
    {
        return EMPTY;
    }

    public static SSTableIntervalTree buildSSTableIntervalTree(Collection sstables)
    {
        if (sstables.isEmpty())
            return EMPTY;
        return new SSTableIntervalTree(buildIntervals(sstables));
    }

    public static List> buildIntervals(Collection sstables)
    {
        if (sstables == null || sstables.isEmpty())
            return Collections.emptyList();
        return Arrays.asList(buildIntervalsArray(sstables));
    }

    public static Interval[] buildIntervalsArray(Collection sstables)
    {
        if (sstables == null || sstables.isEmpty())
            return IntervalTree.EMPTY_ARRAY;
        Interval[] intervals = new Interval[sstables.size()];
        int i = 0;
        int missingIntervals = 0;
        for (SSTableReader sstable : sstables)
        {
            Interval interval = sstable.getInterval();
            if (interval == null)
            {
                missingIntervals++;
                continue;
            }
            intervals[i++] = interval;
        }

        // Offline (scrub) tools create SSTableReader without a first and last key and the old interval tree
        // built a corrupt tree that couldn't be searched so continue to do that rather than complicate Tracker/View
        if (missingIntervals > 0)
        {
            checkState(DatabaseDescriptor.isToolInitialized(), "Can only safely build an interval tree on sstables with missing first and last for offline tools");
            Interval[] replacementIntervals = new Interval[intervals.length - missingIntervals];
            System.arraycopy(intervals, 0, replacementIntervals, 0, replacementIntervals.length);
            return replacementIntervals;
        }

        return intervals;
    }

    public static SSTableIntervalTree update(SSTableIntervalTree tree, Collection removals, Collection additions)
    {
        return (SSTableIntervalTree) tree.update(buildIntervalsArray(removals), buildIntervalsArray(additions));
    }
}