@@ -193,11 +193,10 @@ struct SegmentOrdering {
193193};
194194
195195static std::vector<Segment> PreGroupSegments (
196- const btree_map<SegmentSet, MergeStrategy>& merge_groups,
197- const std::vector<SegmentOrdering>& ordering,
198- const std::vector<SubsetDefinition>& subset_definitions,
199- std::vector<uint32_t >& segment_index_map
200- ) {
196+ const btree_map<SegmentSet, MergeStrategy>& merge_groups,
197+ const std::vector<SegmentOrdering>& ordering,
198+ const std::vector<SubsetDefinition>& subset_definitions,
199+ std::vector<uint32_t >& segment_index_map) {
201200 segment_index_map.resize (subset_definitions.size ());
202201 std::vector<Segment> segments;
203202
@@ -206,9 +205,10 @@ static std::vector<Segment> PreGroupSegments(
206205 auto merge_group_it = merge_groups.begin ();
207206 auto ordering_it = ordering.begin ();
208207
209- while (ordering_it != ordering.end ()) {
208+ while (ordering_it != ordering.end ()) {
210209 const auto & o = *ordering_it;
211- if (o.group_index != last_group_index && merge_group_it != merge_groups.end ()) {
210+ if (o.group_index != last_group_index &&
211+ merge_group_it != merge_groups.end ()) {
212212 merge_group_it++;
213213 }
214214
@@ -217,11 +217,11 @@ static std::vector<Segment> PreGroupSegments(
217217 strategy = &(merge_group_it->second );
218218 }
219219
220- Segment segment = Segment{subset_definitions[o.original_index ], o.probability };
220+ Segment segment =
221+ Segment{subset_definitions[o.original_index ], o.probability };
221222 ordering_it++;
222223
223- if (strategy == nullptr ||
224- strategy->PreClosureGroupSize () <= 1 ||
224+ if (strategy == nullptr || strategy->PreClosureGroupSize () <= 1 ||
225225 o.probability .Max () > strategy->PreClosureProbabilityThreshold ()) {
226226 segment_index_map[o.original_index ] = i;
227227 } else {
@@ -232,15 +232,18 @@ static std::vector<Segment> PreGroupSegments(
232232 break ;
233233 }
234234
235- segment.Definition ().Union (subset_definitions[ordering_it->original_index ]);
235+ segment.Definition ().Union (
236+ subset_definitions[ordering_it->original_index ]);
236237 segment_index_map[ordering_it->original_index ] = i;
237238
238239 ordering_it++;
239240 remaining--;
240241 }
241242
242243 if (strategy->UseCosts ()) {
243- segment.SetProbability (strategy->ProbabilityCalculator ()->ComputeProbability (segment.Definition ()));
244+ segment.SetProbability (
245+ strategy->ProbabilityCalculator ()->ComputeProbability (
246+ segment.Definition ()));
244247 }
245248 }
246249
@@ -328,7 +331,8 @@ static StatusOr<std::vector<Segment>> ToOrderedSegments(
328331
329332 // maps from index in subset_definitions to the new ordering.
330333 std::vector<uint32_t > segment_index_map;
331- std::vector<Segment> segments = PreGroupSegments (merge_groups, ordering, subset_definitions, segment_index_map);
334+ std::vector<Segment> segments = PreGroupSegments (
335+ merge_groups, ordering, subset_definitions, segment_index_map);
332336 VLOG (0 ) << segments.size () << " segments after pregrouping." ;
333337
334338 btree_map<SegmentSet, MergeStrategy> new_merge_groups;
@@ -344,8 +348,8 @@ static StatusOr<std::vector<Segment>> ToOrderedSegments(
344348 remapped_full.insert (s_prime);
345349 }
346350
347-
348- VLOG ( 0 ) << " Merge group " << group_index << " has " << remapped. size () << " segments." ;
351+ VLOG ( 0 ) << " Merge group " << group_index << " has " << remapped. size ()
352+ << " segments." ;
349353 group_index++;
350354
351355 if (!new_merge_groups.insert (std::make_pair (remapped, std::move (strategy)))
0 commit comments