datasketches-cpp
tuple_a_not_b_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 S, typename A>
23 tuple_a_not_b<S, A>::tuple_a_not_b(uint64_t seed, const A& allocator):
24 state_(seed, allocator)
25 {}
26 
27 template<typename S, typename A>
28 template<typename FwdSketch, typename Sketch>
29 auto tuple_a_not_b<S, A>::compute(FwdSketch&& a, const Sketch& b, bool ordered) const -> CompactSketch {
30  return state_.compute(std::forward<FwdSketch>(a), b, ordered);
31 }
32 
33 } /* namespace datasketches */
CompactSketch compute(FwdSketch &&a, const Sketch &b, bool ordered=true) const
Computes the A-not-B set operation given two sketches.
tuple_a_not_b(uint64_t seed=DEFAULT_SEED, const Allocator &allocator=Allocator())
Constructor.
Definition: tuple_a_not_b_impl.hpp:23
DataSketches namespace.
Definition: binomial_bounds.hpp:38