1234567891011121314151617181920212223242526272829303132333435363738394041424344454647 |
- /*
- * Tencent is pleased to support the open source community by making wwsearch
- * available.
- *
- * Copyright (C) 2018-present Tencent. All Rights Reserved.
- *
- * Licensed 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
- *
- * https://opensource.org/licenses/Apache-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 OF ANY KIND, either express or implied. See the License for the
- * specific language governing permissions and limitations under the License.
- */
- // 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.
- #pragma once
- #include "iterator_rocks.h"
- #include "rocksdb/comparator.h"
- namespace rocksdb {
- class Comparator;
- }
- namespace wwsearch {
- 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
- Iterator* NewMergingIterator(const rocksdb::Comparator* comparator,
- Iterator** children, int n);
- } // namespace wwsearch
|