datasketches-cpp
array_tuple_intersection_impl.hpp
1 /*
2  * Licensed to the Apache Software Foundation (ASF) under one
3  * or more contributor license agreements. See the NOTICE file
4  * distributed with this work for additional information
5  * regarding copyright ownership. The ASF licenses this file
6  * to you under the Apache License, Version 2.0 (the
7  * "License"); you may not use this file except in compliance
8  * with the License. You may obtain a copy of the License at
9  *
10  * http://www.apache.org/licenses/LICENSE-2.0
11  *
12  * Unless required by applicable law or agreed to in writing,
13  * software distributed under the License is distributed on an
14  * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
15  * KIND, either express or implied. See the License for the
16  * specific language governing permissions and limitations
17  * under the License.
18  */
19 
20 namespace datasketches {
21 
22 template<typename Array, typename Policy, typename Allocator>
23 array_tuple_intersection<Array, Policy, Allocator>::array_tuple_intersection(uint64_t seed, const Policy& policy, const Allocator& allocator):
24 Base(seed, policy, allocator) {}
25 
26 template<typename Array, typename Policy, typename Allocator>
28  return CompactSketch(this->state_.get_policy().get_external_policy().get_num_values(), Base::get_result(ordered));
29 }
30 
31 } /* namespace datasketches */
CompactSketch get_result(bool ordered=true) const
Produces a copy of the current state of the intersection.
Definition: array_tuple_intersection_impl.hpp:27
array_tuple_intersection(uint64_t seed=DEFAULT_SEED, const Policy &policy=Policy(), const Allocator &allocator=Allocator())
Constructor.
Definition: array_tuple_intersection_impl.hpp:23
Compact array tuple sketch.
Definition: array_tuple_sketch.hpp:163
Tuple intersection.
Definition: tuple_intersection.hpp:47
DataSketches namespace.
Definition: binomial_bounds.hpp:38