Set::range_iterator Set::rangeLowerBound(IdentifierType id) const {
SetType::iterator it = ranges.lower_bound(make_pair(id, 0));
if (it != ranges.end() && it->first == id) {
return range_iterator(it);
}
if (it != ranges.begin()) {
--it;
}
return range_iterator(it);
}
WeightedSet::range_iterator WeightedSet::lastRange() {
if (siz > 0) {
return range_iterator(--ranges.end(), *this);
} else {
throw ErrorException(ErrorException::ERROR_INTERNAL, "set is empty");
}
}
std::ostream& operator<<(std::ostream& out, const gl_sarray& other) {
auto t = other.head(10);
auto dtype = other.dtype();
out << "dtype: " << flex_type_enum_to_name(dtype) << "\n";
out << "Rows: " << other.size() << "\n";
out << "[";
bool first = true;
for(auto i : t.range_iterator()) {
if (!first) out << ",";
if (dtype == flex_type_enum::STRING) out << "\"";
if (i.get_type() == flex_type_enum::UNDEFINED) out << "None";
else out << i;
if (dtype == flex_type_enum::STRING) out << "\"";
first = false;
}
out << "]" << "\n";
return out;
}
sge::sprite::intrusive::ordered::iterator<
Choices,
Order,
IsConst
>::iterator(
ordered_map_iterator const _current_outer_iterator,
ordered_map_iterator const _outer_iterator_end
)
:
outer_iterator_(
sge::sprite::intrusive::ordered::detail::iterator_empty(),
_current_outer_iterator,
_outer_iterator_end
),
inner_iterator_(
this->is_end()
?
range_iterator()
:
outer_iterator_.base()->second->range().begin()
)
{
}
value __iter__$range(value self) {
assert(self.type == value::RANGE);
return make$range_iterator(self.rangeval);
}
