• 设为首页
  • 点击收藏
  • 手机版
    手机扫一扫访问
    迪恩网络手机版
  • 关注官方公众号
    微信扫一扫关注
    迪恩网络公众号

Java IColumnIteratorFactory类代码示例

原作者: [db:作者] 来自: [db:来源] 收藏 邀请

本文整理汇总了Java中org.apache.cassandra.db.columniterator.IColumnIteratorFactory的典型用法代码示例。如果您正苦于以下问题:Java IColumnIteratorFactory类的具体用法?Java IColumnIteratorFactory怎么用?Java IColumnIteratorFactory使用的例子?那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。



IColumnIteratorFactory类属于org.apache.cassandra.db.columniterator包,在下文中一共展示了IColumnIteratorFactory类的8个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于我们的系统推荐出更棒的Java代码示例。

示例1: next

import org.apache.cassandra.db.columniterator.IColumnIteratorFactory; //导入依赖的package包/类
public OnDiskAtomIterator next()
{
    final Map.Entry<DecoratedKey, ColumnFamily> entry = iter.next();
    return new LazyColumnIterator(entry.getKey(), new IColumnIteratorFactory()
    {
        public OnDiskAtomIterator create()
        {
            return range.columnFilter(entry.getKey().getKey()).getColumnIterator(entry.getKey(), entry.getValue());
        }
    });
}
 
开发者ID:vcostet,项目名称:cassandra-kmean,代码行数:12,代码来源:RowIteratorFactory.java


示例2: next

import org.apache.cassandra.db.columniterator.IColumnIteratorFactory; //导入依赖的package包/类
public OnDiskAtomIterator next()
{
    final Map.Entry<DecoratedKey, T> entry = iter.next();
    return new LazyColumnIterator(entry.getKey(), new IColumnIteratorFactory()
    {
        public OnDiskAtomIterator create()
        {
            return range.columnFilter(entry.getKey().key).getColumnFamilyIterator(entry.getKey(), entry.getValue());
        }
    });
}
 
开发者ID:pgaref,项目名称:ACaZoo,代码行数:12,代码来源:RowIteratorFactory.java


示例3: next

import org.apache.cassandra.db.columniterator.IColumnIteratorFactory; //导入依赖的package包/类
public OnDiskAtomIterator next()
{
    final Map.Entry<DecoratedKey, ColumnFamily> entry = iter.next();
    return new LazyColumnIterator(entry.getKey(), new IColumnIteratorFactory()
    {
        public OnDiskAtomIterator create()
        {
            return filter.getMemtableColumnIterator(entry.getValue(), entry.getKey());
        }
    });
}
 
开发者ID:dprguiuc,项目名称:Cassandra-Wasef,代码行数:12,代码来源:RowIteratorFactory.java


示例4: next

import org.apache.cassandra.db.columniterator.IColumnIteratorFactory; //导入依赖的package包/类
public OnDiskAtomIterator next()
{
    final Map.Entry<DecoratedKey, ColumnFamily> entry = iter.next();
    return new LazyColumnIterator(entry.getKey(), new IColumnIteratorFactory()
    {
        public OnDiskAtomIterator create()
        {
            return range.columnFilter(entry.getKey().key).getColumnFamilyIterator(entry.getKey(), entry.getValue());
        }
    });
}
 
开发者ID:rajath26,项目名称:cassandra-trunk,代码行数:12,代码来源:RowIteratorFactory.java


示例5: computeNext

import org.apache.cassandra.db.columniterator.IColumnIteratorFactory; //导入依赖的package包/类
protected OnDiskAtomIterator computeNext()
{
    try
    {
        if (nextEntry == null)
        {
            do
            {
                // we're starting the first range or we just passed the end of the previous range
                if (!rangeIterator.hasNext())
                    return endOfData();

                currentRange = rangeIterator.next();
                seekToCurrentRangeStart();

                if (ifile.isEOF())
                    return endOfData();

                currentKey = sstable.partitioner.decorateKey(ByteBufferUtil.readWithShortLength(ifile));
                currentEntry = sstable.metadata.comparator.rowIndexEntrySerializer().deserialize(ifile, sstable.descriptor.version);
            } while (!currentRange.contains(currentKey));
        }
        else
        {
            // we're in the middle of a range
            currentKey = nextKey;
            currentEntry = nextEntry;
        }

        long readEnd;
        if (ifile.isEOF())
        {
            nextEntry = null;
            nextKey = null;
            readEnd = dfile.length();
        }
        else
        {
            // we need the position of the start of the next key, regardless of whether it falls in the current range
            nextKey = sstable.partitioner.decorateKey(ByteBufferUtil.readWithShortLength(ifile));
            nextEntry = sstable.metadata.comparator.rowIndexEntrySerializer().deserialize(ifile, sstable.descriptor.version);
            readEnd = nextEntry.position;

            if (!currentRange.contains(nextKey))
            {
                nextKey = null;
                nextEntry = null;
            }
        }

        if (dataRange == null || dataRange.selectsFullRowFor(currentKey.getKey()))
        {
            dfile.seek(currentEntry.position);
            ByteBufferUtil.readWithShortLength(dfile); // key
            long dataSize = readEnd - dfile.getFilePointer();
            return new SSTableIdentityIterator(sstable, dfile, currentKey, dataSize);
        }

        return new LazyColumnIterator(currentKey, new IColumnIteratorFactory()
        {
            public OnDiskAtomIterator create()
            {
                return dataRange.columnFilter(currentKey.getKey()).getSSTableColumnIterator(sstable, dfile, currentKey, currentEntry);
            }
        });

    }
    catch (IOException e)
    {
        sstable.markSuspect();
        throw new CorruptSSTableException(e, sstable.getFilename());
    }
}
 
开发者ID:vcostet,项目名称:cassandra-kmean,代码行数:74,代码来源:SSTableScanner.java


示例6: computeNext

import org.apache.cassandra.db.columniterator.IColumnIteratorFactory; //导入依赖的package包/类
protected OnDiskAtomIterator computeNext()
{
    try
    {
        if (nextEntry == null)
        {
            do
            {
                // we're starting the first range or we just passed the end of the previous range
                if (!rangeIterator.hasNext())
                    return endOfData();

                currentRange = rangeIterator.next();
                seekToCurrentRangeStart();

                if (ifile.isEOF())
                    return endOfData();

                currentKey = sstable.partitioner.decorateKey(ByteBufferUtil.readWithShortLength(ifile));
                currentEntry = RowIndexEntry.serializer.deserialize(ifile, sstable.descriptor.version);
            } while (!currentRange.contains(currentKey));
        }
        else
        {
            // we're in the middle of a range
            currentKey = nextKey;
            currentEntry = nextEntry;
        }

        long readEnd;
        if (ifile.isEOF())
        {
            nextEntry = null;
            nextKey = null;
            readEnd = dfile.length();
        }
        else
        {
            // we need the position of the start of the next key, regardless of whether it falls in the current range
            nextKey = sstable.partitioner.decorateKey(ByteBufferUtil.readWithShortLength(ifile));
            nextEntry = RowIndexEntry.serializer.deserialize(ifile, sstable.descriptor.version);
            readEnd = nextEntry.position;

            if (!currentRange.contains(nextKey))
            {
                nextKey = null;
                nextEntry = null;
            }
        }

        if (dataRange == null || dataRange.selectsFullRowFor(currentKey.key))
        {
            dfile.seek(currentEntry.position);
            ByteBufferUtil.readWithShortLength(dfile); // key
            if (sstable.descriptor.version.hasRowSizeAndColumnCount)
                dfile.readLong();
            long dataSize = readEnd - dfile.getFilePointer();
            return new SSTableIdentityIterator(sstable, dfile, currentKey, dataSize);
        }

        return new LazyColumnIterator(currentKey, new IColumnIteratorFactory()
        {
            public OnDiskAtomIterator create()
            {
                return dataRange.columnFilter(currentKey.key).getSSTableColumnIterator(sstable, dfile, currentKey, currentEntry);
            }
        });

    }
    catch (IOException e)
    {
        sstable.markSuspect();
        throw new CorruptSSTableException(e, sstable.getFilename());
    }
}
 
开发者ID:pgaref,项目名称:ACaZoo,代码行数:76,代码来源:SSTableScanner.java


示例7: computeNext

import org.apache.cassandra.db.columniterator.IColumnIteratorFactory; //导入依赖的package包/类
protected OnDiskAtomIterator computeNext()
{
    try
    {
        if (nextEntry == null)
        {
            do
            {
                // we're starting the first range or we just passed the end of the previous range
                if (!rangeIterator.hasNext())
                    return endOfData();

                currentRange = rangeIterator.next();
                seekToCurrentRangeStart();

                if (ifile.isEOF())
                    return endOfData();

                currentKey = sstable.partitioner.decorateKey(ByteBufferUtil.readWithShortLength(ifile));
                currentEntry = sstable.metadata.comparator.rowIndexEntrySerializer().deserialize(ifile, sstable.descriptor.version);
            } while (!currentRange.contains(currentKey));
        }
        else
        {
            // we're in the middle of a range
            currentKey = nextKey;
            currentEntry = nextEntry;
        }

        long readEnd;
        if (ifile.isEOF())
        {
            nextEntry = null;
            nextKey = null;
            readEnd = dfile.length();
        }
        else
        {
            // we need the position of the start of the next key, regardless of whether it falls in the current range
            nextKey = sstable.partitioner.decorateKey(ByteBufferUtil.readWithShortLength(ifile));
            nextEntry = sstable.metadata.comparator.rowIndexEntrySerializer().deserialize(ifile, sstable.descriptor.version);
            readEnd = nextEntry.position;

            if (!currentRange.contains(nextKey))
            {
                nextKey = null;
                nextEntry = null;
            }
        }

        if (dataRange == null || dataRange.selectsFullRowFor(currentKey.key))
        {
            dfile.seek(currentEntry.position);
            ByteBufferUtil.readWithShortLength(dfile); // key
            if (sstable.descriptor.version.hasRowSizeAndColumnCount)
                dfile.readLong();
            long dataSize = readEnd - dfile.getFilePointer();
            return new SSTableIdentityIterator(sstable, dfile, currentKey, dataSize);
        }

        return new LazyColumnIterator(currentKey, new IColumnIteratorFactory()
        {
            public OnDiskAtomIterator create()
            {
                return dataRange.columnFilter(currentKey.key).getSSTableColumnIterator(sstable, dfile, currentKey, currentEntry);
            }
        });

    }
    catch (IOException e)
    {
        sstable.markSuspect();
        throw new CorruptSSTableException(e, sstable.getFilename());
    }
}
 
开发者ID:mafernandez-stratio,项目名称:cassandra-cqlMod,代码行数:76,代码来源:SSTableScanner.java


示例8: computeNext

import org.apache.cassandra.db.columniterator.IColumnIteratorFactory; //导入依赖的package包/类
protected OnDiskAtomIterator computeNext()
{
    try
    {
        if (nextEntry == null)
        {
            do
            {
                // we're starting the first range or we just passed the end of the previous range
                if (!rangeIterator.hasNext())
                    return endOfData();

                currentRange = rangeIterator.next();
                seekToCurrentRangeStart();

                if (ifile.isEOF())
                    return endOfData();

                currentKey = sstable.partitioner.decorateKey(ByteBufferUtil.readWithShortLength(ifile));
                currentEntry = sstable.metadata.comparator.rowIndexEntrySerializer().deserialize(ifile, sstable.descriptor.version);
            } while (!currentRange.contains(currentKey));
        }
        else
        {
            // we're in the middle of a range
            currentKey = nextKey;
            currentEntry = nextEntry;
        }

        long readEnd;
        if (ifile.isEOF())
        {
            nextEntry = null;
            nextKey = null;
            readEnd = dfile.length();
        }
        else
        {
            // we need the position of the start of the next key, regardless of whether it falls in the current range
            nextKey = sstable.partitioner.decorateKey(ByteBufferUtil.readWithShortLength(ifile));
            nextEntry = sstable.metadata.comparator.rowIndexEntrySerializer().deserialize(ifile, sstable.descriptor.version);
            readEnd = nextEntry.position;

            if (!currentRange.contains(nextKey))
            {
                nextKey = null;
                nextEntry = null;
            }
        }

        if (dataRange == null || dataRange.selectsFullRowFor(currentKey.key))
        {
            dfile.seek(currentEntry.position);
            ByteBufferUtil.readWithShortLength(dfile); // key
            long dataSize = readEnd - dfile.getFilePointer();
            return new SSTableIdentityIterator(sstable, dfile, currentKey, dataSize);
        }

        return new LazyColumnIterator(currentKey, new IColumnIteratorFactory()
        {
            public OnDiskAtomIterator create()
            {
                return dataRange.columnFilter(currentKey.key).getSSTableColumnIterator(sstable, dfile, currentKey, currentEntry);
            }
        });

    }
    catch (IOException e)
    {
        sstable.markSuspect();
        throw new CorruptSSTableException(e, sstable.getFilename());
    }
}
 
开发者ID:rajath26,项目名称:cassandra-trunk,代码行数:74,代码来源:SSTableScanner.java



注:本文中的org.apache.cassandra.db.columniterator.IColumnIteratorFactory类示例整理自Github/MSDocs等源码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。


鲜花

握手

雷人

路过

鸡蛋
该文章已有0人参与评论

请发表评论

全部评论

专题导读
上一篇:
Java OAuthClientResponseFactory类代码示例发布时间:2022-05-22
下一篇:
Java ThingStatusDetail类代码示例发布时间:2022-05-22
热门推荐
阅读排行榜

扫描微信二维码

查看手机版网站

随时了解更新最新资讯

139-2527-9053

在线客服(服务时间 9:00~18:00)

在线QQ客服
地址:深圳市南山区西丽大学城创智工业园
电邮:jeky_zhao#qq.com
移动电话:139-2527-9053

Powered by 互联科技 X3.4© 2001-2213 极客世界.|Sitemap