37   void Insert(const SymType& sym, const ValType& val) {  in Insert()  argument
38     auto aggr_it = GetLeqIterator(map_, val);  in Insert()
43         CHECK_LT(val, map_.begin()->first);  in Insert()
45           ExtendLeft(map_.begin(), val);  in Insert()
50       map_.emplace(val, AggregatedSymbol(sym, val));  in Insert()
58       maybe_match.offsets.insert(val);  in Insert()
63     if (*maybe_match.offsets.rbegin() < val) {  in Insert()
67         ExtendLeft(aggr_it, val);  in Insert()
72       map_.emplace(val, AggregatedSymbol(sym, val));  in Insert()
80     for (; *offset_it < val; ++offset_it) {  in Insert()
84     if (*offset_it == val) {  in Insert()
97     map_.emplace(val, AggregatedSymbol(sym, val));  in Insert()
115   void ExtendLeft(typename RangeMapType::iterator it, const ValType& val) {  in ExtendLeft()  argument
116     CHECK(val < *it->second.offsets.begin());  in ExtendLeft()
119     copy.offsets.insert(val);  in ExtendLeft()
120     map_.emplace(val, std::move(copy));  in ExtendLeft()