void clear() {
while (!first_empty()) {
erase(first_begin());
}
while (!second_empty()) {
erase(second_begin());
}
}
void clear(F f) {
while (!first_empty()) {
f(first_front());
erase(first_begin());
}
while (!second_empty()) {
f(second_front());
erase(second_begin());
}
}
Array<T>* setIntersect(const Array<T> &first,
const Array<T> &second,
const bool is_unique)
{
if ((std::is_same<T, double>::value || std::is_same<T, cdouble>::value) &&
!isDoubleSupported(getActiveDeviceId())) {
OPENCL_NOT_SUPPORTED();
}
Array<T> unique_first = first;
Array<T> unique_second = second;
if (!is_unique) {
unique_first = *setUnique(first, false);
unique_second = *setUnique(second, false);
}
size_t out_size = std::max(unique_first.dims()[0], unique_second.dims()[0]);
Array<T> *out = createEmptyArray<T>(dim4(out_size, 1, 1, 1));
compute::command_queue queue(getQueue()());
compute::buffer first_data((*unique_first.get())());
compute::buffer second_data((*unique_second.get())());
compute::buffer out_data((*out->get())());
compute::buffer_iterator<T> first_begin(first_data, 0);
compute::buffer_iterator<T> first_end(first_data, unique_first.dims()[0]);
compute::buffer_iterator<T> second_begin(second_data, 0);
compute::buffer_iterator<T> second_end(second_data, unique_second.dims()[0]);
compute::buffer_iterator<T> out_begin(out_data, 0);
compute::buffer_iterator<T> out_end = compute::set_intersection(
first_begin, first_end, second_begin, second_end, out_begin, queue
);
out->resetDims(dim4(std::distance(out_begin, out_end), 1, 1, 1));
return out;
}
size_t count(size_t max_count = std::numeric_limits<size_t>::max()) {
auto r1 = count(first_begin(), first_end(), max_count);
return r1 + count(second_begin(), second_end(), max_count - r1);
}
void pop_second_front() {
erase(second_begin());
}
value_type& second_front() {
return *second_begin();
}
pointer take_second_front() {
return take(second_begin());
}
bool second_empty() {
return second_begin() == second_end();
}