datasketches-cpp
Loading...
Searching...
No Matches
theta_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#ifndef THETA_A_NOT_B_IMPL_HPP_
21#define THETA_A_NOT_B_IMPL_HPP_
22
23#include <algorithm>
24
25#include "conditional_back_inserter.hpp"
26
27namespace datasketches {
28
29template<typename A>
30theta_a_not_b_alloc<A>::theta_a_not_b_alloc(uint64_t seed, const A& allocator):
31state_(seed, allocator)
32{}
33
34template<typename A>
35template<typename FwdSketch, typename Sketch>
36auto theta_a_not_b_alloc<A>::compute(FwdSketch&& a, const Sketch& b, bool ordered) const -> CompactSketch {
37 return state_.compute(std::forward<FwdSketch>(a), b, ordered);
38}
39
40} /* namespace datasketches */
41
42# endif
CompactSketch compute(FwdSketch &&a, const Sketch &b, bool ordered=true) const
Computes the A-not-B set operation given two sketches.
theta_a_not_b_alloc(uint64_t seed=DEFAULT_SEED, const Allocator &allocator=Allocator())
Constructor.
Definition theta_a_not_b_impl.hpp:30
DataSketches namespace.
Definition binomial_bounds.hpp:38