Sha256: 0ed19b8150fcd0f30c3a73b57e07d27c0c50c30b3fd87e4319cc463a2da6794a
Contents?: true
Size: 1.67 KB
Versions: 19
Compression:
Stored size: 1.67 KB
Contents
/*
* 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.
*/
#ifndef THETA_INTERSECTION_BASE_HPP_
#define THETA_INTERSECTION_BASE_HPP_
namespace datasketches {
template<
typename Entry,
typename ExtractKey,
typename Policy,
typename Sketch,
typename CompactSketch,
typename Allocator
>
class theta_intersection_base {
public:
using hash_table = theta_update_sketch_base<Entry, ExtractKey, Allocator>;
using resize_factor = typename hash_table::resize_factor;
using comparator = compare_by_key<ExtractKey>;
theta_intersection_base(uint64_t seed, const Policy& policy, const Allocator& allocator);
template<typename FwdSketch>
void update(FwdSketch&& sketch);
CompactSketch get_result(bool ordered = true) const;
bool has_result() const;
const Policy& get_policy() const;
private:
Policy policy_;
bool is_valid_;
hash_table table_;
};
} /* namespace datasketches */
#include "theta_intersection_base_impl.hpp"
#endif
Version data entries
19 entries across 19 versions & 1 rubygems