20#ifndef _INTARRAYPAIRITERATOR_INTERNAL_HPP_
21#define _INTARRAYPAIRITERATOR_INTERNAL_HPP_
28coupon_iterator<A>::coupon_iterator(
const uint32_t* array,
size_t array_size,
size_t index,
bool all):
29array_(array), array_size_(array_size), index_(index), all_(all) {
30 while (index_ < array_size_) {
31 if (all_ || array_[index_] != hll_constants::EMPTY)
break;
37coupon_iterator<A>& coupon_iterator<A>::operator++() {
38 while (++index_ < array_size_) {
39 if (all_ || array_[index_] != hll_constants::EMPTY)
break;
45bool coupon_iterator<A>::operator!=(
const coupon_iterator& other)
const {
46 return index_ != other.index_;
50auto coupon_iterator<A>::operator*() const -> reference {
51 return array_[index_];
DataSketches namespace.
Definition binomial_bounds.hpp:38