blob: e2eb3b934c9af00caa6a32b4973abeddabb3fd3d (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
|
// Copyright (C) by Josh Blum. See LICENSE.txt for licensing information.
#ifndef INCLUDED_LIBGRAS_TAG_HANDLERS_HPP
#define INCLUDED_LIBGRAS_TAG_HANDLERS_HPP
#include <gras_impl/block_actor.hpp>
#include <algorithm>
namespace gras
{
GRAS_FORCE_INLINE void BlockActor::sort_tags(const size_t i)
{
if GRAS_LIKELY(not this->input_tags_changed[i]) return;
std::vector<Tag> &tags_i = this->input_tags[i];
std::sort(tags_i.begin(), tags_i.end());
this->input_tags_changed[i] = false;
}
GRAS_FORCE_INLINE void BlockActor::trim_tags(const size_t i)
{
//------------------------------------------------------------------
//-- trim the input tags that are past the consumption zone
//-- and post trimmed tags to the downstream based on policy
//------------------------------------------------------------------
std::vector<Tag> &tags_i = this->input_tags[i];
const size_t items_consumed_i = this->items_consumed[i];
size_t last = 0;
while (last < tags_i.size() and tags_i[last].offset < items_consumed_i)
{
last++;
}
if GRAS_LIKELY(last == 0) return;
//call the overloaded propagate_tags to do the dirty work
this->block_ptr->propagate_tags(i, TagIter(tags_i.begin(), tags_i.begin()+last));
//now its safe to perform the erasure
tags_i.erase(tags_i.begin(), tags_i.begin()+last);
}
} //namespace gras
#endif /*INCLUDED_LIBGRAS_TAG_HANDLERS_HPP*/
|
