mirror of
https://github.com/Xahau/xahaud.git
synced 2025-12-06 17:27:52 +00:00
e8893e9678
git-subtree-dir: src/hyperleveldb git-subtree-split: ac2ae3029dd9c4ed6401c57eef7e1d84b2007bca
27 lines
892 B
C++
27 lines
892 B
C++
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
// found in the LICENSE file. See the AUTHORS file for names of contributors.
|
|
|
|
#ifndef STORAGE_HYPERLEVELDB_TABLE_MERGER_H_
|
|
#define STORAGE_HYPERLEVELDB_TABLE_MERGER_H_
|
|
|
|
namespace hyperleveldb {
|
|
|
|
class Comparator;
|
|
class Iterator;
|
|
|
|
// Return an iterator that provided the union of the data in
|
|
// children[0,n-1]. Takes ownership of the child iterators and
|
|
// will delete them when the result iterator is deleted.
|
|
//
|
|
// The result does no duplicate suppression. I.e., if a particular
|
|
// key is present in K child iterators, it will be yielded K times.
|
|
//
|
|
// REQUIRES: n >= 0
|
|
extern Iterator* NewMergingIterator(
|
|
const Comparator* comparator, Iterator** children, int n);
|
|
|
|
} // namespace hyperleveldb
|
|
|
|
#endif // STORAGE_HYPERLEVELDB_TABLE_MERGER_H_
|