import org.apache.cassandra.db.RowPosition; //导入依赖的package包/类
public void serialize(AbstractBounds<?> range, DataOutputPlus out, int version) throws IOException
{
    /*
     * The first int tells us if it's a range or bounds (depending on the value) _and_ if it's tokens or keys (depending on the
     * sign). We use negative kind for keys so as to preserve the serialization of token from older version.
     */
    out.writeInt(kindInt(range));
    if (range.left instanceof Token)
    {
        Token.serializer.serialize((Token) range.left, out);
        Token.serializer.serialize((Token) range.right, out);
    }
    else
    {
        RowPosition.serializer.serialize((RowPosition) range.left, out);
        RowPosition.serializer.serialize((RowPosition) range.right, out);
    }
}
 

import org.apache.cassandra.db.RowPosition; //导入依赖的package包/类
public AbstractBounds<?> deserialize(DataInput in, int version) throws IOException
{
    int kind = in.readInt();
    boolean isToken = kind >= 0;
    if (!isToken)
        kind = -(kind+1);

    RingPosition<?> left, right;
    if (isToken)
    {
        left = Token.serializer.deserialize(in);
        right = Token.serializer.deserialize(in);
    }
    else
    {
        left = RowPosition.serializer.deserialize(in);
        right = RowPosition.serializer.deserialize(in);
    }

    if (kind == Type.RANGE.ordinal())
        return new Range(left, right);
    return new Bounds(left, right);
}
 

import org.apache.cassandra.db.RowPosition; //导入依赖的package包/类
LeveledManifest(ColumnFamilyStore cfs, int maxSSTableSizeInMB, SizeTieredCompactionStrategyOptions options)
{
    this.cfs = cfs;
    this.maxSSTableSizeInBytes = maxSSTableSizeInMB * 1024 * 1024;
    this.options = options;

    // allocate enough generations for a PB of data, with a 1-MB sstable size.  (Note that if maxSSTableSize is
    // updated, we will still have sstables of the older, potentially smaller size.  So don't make this
    // dependent on maxSSTableSize.)
    int n = (int) Math.log10(1000 * 1000 * 1000);
    generations = new List[n];
    lastCompactedKeys = new RowPosition[n];
    for (int i = 0; i < generations.length; i++)
    {
        generations[i] = new ArrayList<>();
        lastCompactedKeys[i] = cfs.partitioner.getMinimumToken().minKeyBound();
    }
    compactionCounter = new int[n];
}
 

import org.apache.cassandra.db.RowPosition; //导入依赖的package包/类
public int binarySearch(RowPosition key)
{
    int low = 0, mid = offsetCount, high = mid - 1, result = -1;
    while (low <= high)
    {
        mid = (low + high) >> 1;
        result = -DecoratedKey.compareTo(partitioner, ByteBuffer.wrap(getKey(mid)), key);
        if (result > 0)
        {
            low = mid + 1;
        }
        else if (result == 0)
        {
            return mid;
        }
        else
        {
            high = mid - 1;
        }
    }

    return -mid - (result < 0 ? 1 : 2);
}
 

import org.apache.cassandra.db.RowPosition; //导入依赖的package包/类
@Test
public void testNormalizeComplex()
{
    List<Range<RowPosition>> input, expected;

    input = asList(range("8", "2"), range("7", "9"), range("4", "5"));
    expected = asList(range("", "2"), range("4", "5"), range("7", ""));
    assertNormalize(input, expected);

    input = asList(range("5", "9"), range("2", "5"));
    expected = asList(range("2", "9"));
    assertNormalize(input, expected);

    input = asList(range ("", "1"), range("9", "2"), range("4", "5"), range("", ""));
    expected = asList(range("", ""));
    assertNormalize(input, expected);

    input = asList(range ("", "1"), range("1", "4"), range("4", "5"), range("5", ""));
    expected = asList(range("", ""));
    assertNormalize(input, expected);
}
 

import org.apache.cassandra.db.RowPosition; //导入依赖的package包/类
public void serialize(AbstractBounds<?> range, DataOutput out, int version) throws IOException
{
    /*
     * The first int tells us if it's a range or bounds (depending on the value) _and_ if it's tokens or keys (depending on the
     * sign). We use negative kind for keys so as to preserve the serialization of token from older version.
     */
    out.writeInt(kindInt(range));
    if (range.left instanceof Token)
    {
        Token.serializer.serialize((Token) range.left, out);
        Token.serializer.serialize((Token) range.right, out);
    }
    else
    {
        RowPosition.serializer.serialize((RowPosition) range.left, out);
        RowPosition.serializer.serialize((RowPosition) range.right, out);
    }
}
 

import org.apache.cassandra.db.RowPosition; //导入依赖的package包/类
public AbstractBounds<?> deserialize(DataInput in, int version) throws IOException
{
    int kind = in.readInt();
    boolean isToken = kind >= 0;
    if (!isToken)
        kind = -(kind+1);

    RingPosition left, right;
    if (isToken)
    {
        left = Token.serializer.deserialize(in);
        right = Token.serializer.deserialize(in);
    }
    else
    {
        left = RowPosition.serializer.deserialize(in);
        right = RowPosition.serializer.deserialize(in);
    }

    if (kind == Type.RANGE.ordinal())
        return new Range(left, right);
    return new Bounds(left, right);
}
 

import org.apache.cassandra.db.RowPosition; //导入依赖的package包/类
private LeveledManifest(ColumnFamilyStore cfs, int maxSSTableSizeInMB, SizeTieredCompactionStrategyOptions options)
{
    this.cfs = cfs;
    this.maxSSTableSizeInBytes = maxSSTableSizeInMB * 1024 * 1024;
    this.options = options;

    // allocate enough generations for a PB of data, with a 1-MB sstable size.  (Note that if maxSSTableSize is
    // updated, we will still have sstables of the older, potentially smaller size.  So don't make this
    // dependent on maxSSTableSize.)
    int n = (int) Math.log10(1000 * 1000 * 1000);
    generations = new List[n];
    lastCompactedKeys = new RowPosition[n];
    for (int i = 0; i < generations.length; i++)
    {
        generations[i] = new ArrayList<SSTableReader>();
        lastCompactedKeys[i] = cfs.partitioner.getMinimumToken().minKeyBound();
    }
}
 

import org.apache.cassandra.db.RowPosition; //导入依赖的package包/类
public int binarySearch(RowPosition key)
{
    int low = 0, mid = summary_size, high = mid - 1, result = -1;
    while (low <= high)
    {
        mid = (low + high) >> 1;
        result = -DecoratedKey.compareTo(partitioner, ByteBuffer.wrap(getKey(mid)), key);
        if (result > 0)
        {
            low = mid + 1;
        }
        else if (result == 0)
        {
            return mid;
        }
        else
        {
            high = mid - 1;
        }
    }

    return -mid - (result < 0 ? 1 : 2);
}
 

import org.apache.cassandra.db.RowPosition; //导入依赖的package包/类
private LeveledManifest(ColumnFamilyStore cfs, int maxSSTableSizeInMB, SizeTieredCompactionStrategyOptions options)
{
    this.cfs = cfs;
    this.hasRepairedData = cfs.getRepairedSSTables().size() > 0;
    this.maxSSTableSizeInBytes = maxSSTableSizeInMB * 1024 * 1024;
    this.options = options;

    // allocate enough generations for a PB of data, with a 1-MB sstable size.  (Note that if maxSSTableSize is
    // updated, we will still have sstables of the older, potentially smaller size.  So don't make this
    // dependent on maxSSTableSize.)
    int n = (int) Math.log10(1000 * 1000 * 1000);
    generations = new List[n];
    lastCompactedKeys = new RowPosition[n];
    for (int i = 0; i < generations.length; i++)
    {
        generations[i] = new ArrayList<>();
        lastCompactedKeys[i] = cfs.partitioner.getMinimumToken().minKeyBound();
    }
    unrepairedL0 = new ArrayList<>();
}
 

import org.apache.cassandra.db.RowPosition; //导入依赖的package包/类
private LeveledManifest(ColumnFamilyStore cfs, int maxSSTableSizeInMB)
{
    this.cfs = cfs;
    this.maxSSTableSizeInBytes = maxSSTableSizeInMB * 1024 * 1024;

    // allocate enough generations for a PB of data, with a 1-MB sstable size.  (Note that if maxSSTableSize is
    // updated, we will still have sstables of the older, potentially smaller size.  So don't make this
    // dependent on maxSSTableSize.)
    int n = (int) Math.log10(1000 * 1000 * 1000);
    generations = new List[n];
    lastCompactedKeys = new RowPosition[n];
    for (int i = 0; i < generations.length; i++)
    {
        generations[i] = new ArrayList<SSTableReader>();
        lastCompactedKeys[i] = cfs.partitioner.getMinimumToken().minKeyBound();
    }
    sstableGenerations = new HashMap<SSTableReader, Integer>();
}
 

import org.apache.cassandra.db.RowPosition; //导入依赖的package包/类
public int binarySearch(RowPosition key)
{
    int low = 0, mid = keys.length, high = mid - 1, result = -1;

    while (low <= high)
    {
        mid = (low + high) >> 1;
        result = -partitioner.decorateKey(ByteBuffer.wrap(keys[mid])).compareTo(key);

        if (result > 0)
        {
            low = mid + 1;
        }
        else if (result == 0)
        {
            return mid;
        }
        else
        {
            high = mid - 1;
        }
    }

    return -mid - (result < 0 ? 1 : 2);
}
 

import org.apache.cassandra.db.RowPosition; //导入依赖的package包/类
public int binarySearch(RowPosition key)
{
    int low = 0, mid = summarySize, high = mid - 1, result = -1;
    while (low <= high)
    {
        mid = (low + high) >> 1;
        result = -DecoratedKey.compareTo(partitioner, ByteBuffer.wrap(getKey(mid)), key);
        if (result > 0)
        {
            low = mid + 1;
        }
        else if (result == 0)
        {
            return mid;
        }
        else
        {
            high = mid - 1;
        }
    }

    return -mid - (result < 0 ? 1 : 2);
}
 

import org.apache.cassandra.db.RowPosition; //导入依赖的package包/类
public long serializedSize(AbstractBounds<?> ab, int version)
{
    int size = TypeSizes.NATIVE.sizeof(kindInt(ab));
    if (ab.left instanceof Token)
    {
        size += Token.serializer.serializedSize((Token) ab.left, TypeSizes.NATIVE);
        size += Token.serializer.serializedSize((Token) ab.right, TypeSizes.NATIVE);
    }
    else
    {
        size += RowPosition.serializer.serializedSize((RowPosition) ab.left, TypeSizes.NATIVE);
        size += RowPosition.serializer.serializedSize((RowPosition) ab.right, TypeSizes.NATIVE);
    }
    return size;
}
 

import org.apache.cassandra.db.RowPosition; //导入依赖的package包/类
public int compareTo(RowPosition pos)
{
    if (this == pos)
        return 0;

    int cmp = getToken().compareTo(pos.getToken());
    if (cmp != 0)
        return cmp;

    if (isMinimumBound)
        return ((pos instanceof KeyBound) && ((KeyBound)pos).isMinimumBound) ? 0 : -1;
    else
        return ((pos instanceof KeyBound) && !((KeyBound)pos).isMinimumBound) ? 0 : 1;
}
 

import org.apache.cassandra.db.RowPosition; //导入依赖的package包/类
private List<SSTableStreamingSections> getSSTableSectionsForRanges(Collection<Range<Token>> ranges, Collection<ColumnFamilyStore> stores, long overriddenRepairedAt, boolean isIncremental)
{
    Refs<SSTableReader> refs = new Refs<>();
    try
    {
        for (ColumnFamilyStore cfStore : stores)
        {
            List<AbstractBounds<RowPosition>> rowBoundsList = new ArrayList<>(ranges.size());
            for (Range<Token> range : ranges)
                rowBoundsList.add(range.toRowBounds());
            refs.addAll(cfStore.selectAndReference(cfStore.viewFilter(rowBoundsList, !isIncremental)).refs);
        }

        List<SSTableStreamingSections> sections = new ArrayList<>(refs.size());
        for (SSTableReader sstable : refs)
        {
            long repairedAt = overriddenRepairedAt;
            if (overriddenRepairedAt == ActiveRepairService.UNREPAIRED_SSTABLE)
                repairedAt = sstable.getSSTableMetadata().repairedAt;
            sections.add(new SSTableStreamingSections(sstable, refs.get(sstable),
                                                      sstable.getPositionsForRanges(ranges),
                                                      sstable.estimatedKeysForRanges(ranges),
                                                      repairedAt));
        }
        return sections;
    }
    catch (Throwable t)
    {
        refs.release();
        throw t;
    }
}
 

import org.apache.cassandra.db.RowPosition; //导入依赖的package包/类
/**
 * Gets the position in the index file to start scanning to find the given key (at most indexInterval keys away,
 * modulo downsampling of the index summary). Always returns a value >= 0
 */
public long getIndexScanPosition(RowPosition key)
{
    if (openReason == OpenReason.MOVED_START && key.compareTo(first) < 0)
        key = first;

    return getIndexScanPositionFromBinarySearchResult(indexSummary.binarySearch(key), indexSummary);
}
 

import org.apache.cassandra.db.RowPosition; //导入依赖的package包/类
/**
 * Finds and returns the first key beyond a given token in this SSTable or null if no such key exists.
 */
public DecoratedKey firstKeyBeyond(RowPosition token)
{
    if (token.compareTo(first) < 0)
        return first;

    long sampledPosition = getIndexScanPosition(token);

    Iterator<FileDataInput> segments = ifile.iterator(sampledPosition);
    while (segments.hasNext())
    {
        FileDataInput in = segments.next();
        try
        {
            while (!in.isEOF())
            {
                ByteBuffer indexKey = ByteBufferUtil.readWithShortLength(in);
                DecoratedKey indexDecoratedKey = partitioner.decorateKey(indexKey);
                if (indexDecoratedKey.compareTo(token) > 0)
                    return indexDecoratedKey;

                RowIndexEntry.Serializer.skip(in);
            }
        }
        catch (IOException e)
        {
            markSuspect();
            throw new CorruptSSTableException(e, in.getPath());
        }
        finally
        {
            FileUtils.closeQuietly(in);
        }
    }

    return null;
}
 

import org.apache.cassandra.db.RowPosition; //导入依赖的package包/类
private void addRange(AbstractBounds<RowPosition> requested, List<AbstractBounds<RowPosition>> boundsList)
{
    if (requested instanceof Range && ((Range)requested).isWrapAround())
    {
        if (requested.right.compareTo(sstable.first) >= 0)
        {
            // since we wrap, we must contain the whole sstable prior to stopKey()
            Boundary<RowPosition> left = new Boundary<RowPosition>(sstable.first, true);
            Boundary<RowPosition> right;
            right = requested.rightBoundary();
            right = minRight(right, sstable.last, true);
            if (!isEmpty(left, right))
                boundsList.add(AbstractBounds.bounds(left, right));
        }
        if (requested.left.compareTo(sstable.last) <= 0)
        {
            // since we wrap, we must contain the whole sstable after dataRange.startKey()
            Boundary<RowPosition> right = new Boundary<RowPosition>(sstable.last, true);
            Boundary<RowPosition> left;
            left = requested.leftBoundary();
            left = maxLeft(left, sstable.first, true);
            if (!isEmpty(left, right))
                boundsList.add(AbstractBounds.bounds(left, right));
        }
    }
    else
    {
        assert requested.left.compareTo(requested.right) <= 0 || requested.right.isMinimum();
        Boundary<RowPosition> left, right;
        left = requested.leftBoundary();
        right = requested.rightBoundary();
        left = maxLeft(left, sstable.first, true);
        // apparently isWrapAround() doesn't count Bounds that extend to the limit (min) as wrapping
        right = requested.right.isMinimum() ? new Boundary<RowPosition>(sstable.last, true)
                                                : minRight(right, sstable.last, true);
        if (!isEmpty(left, right))
            boundsList.add(AbstractBounds.bounds(left, right));
    }
}
 

import org.apache.cassandra.db.RowPosition; //导入依赖的package包/类
@Test
public void testNormalizeNoop()
{
    List<Range<RowPosition>> l;

    l = asList(range("1", "3"), range("4", "5"));
    assertNormalize(l, l);
}