@@ -188,13 +188,14 @@ using propertyt = std::pair<irep_idt, property_infot>;
188
188
// / 3. numerical ordering of line number
189
189
// / 4. alphabetical ordering of goal ID
190
190
// / 5. number ordering of the goal ID number
191
- // / \param pit1 : The first property.
192
- // / \param pit2 : The second propery.
191
+ // / \param property1 : The first property.
192
+ // / \param property2 : The second propery.
193
193
// / \return True if the first property is less than the second property
194
- static bool is_property_less_than (const propertyt &pit1, const propertyt &pit2)
194
+ static bool
195
+ is_property_less_than (const propertyt &property1, const propertyt &property2)
195
196
{
196
- const auto &p1 = pit1 .second .pc ->source_location ;
197
- const auto &p2 = pit2 .second .pc ->source_location ;
197
+ const auto &p1 = property1 .second .pc ->source_location ;
198
+ const auto &p2 = property2 .second .pc ->source_location ;
198
199
if (p1.get_file () != p2.get_file ())
199
200
return id2string (p1.get_file ()) < id2string (p2.get_file ());
200
201
if (p1.get_function () != p2.get_function ())
@@ -228,11 +229,11 @@ static bool is_property_less_than(const propertyt &pit1, const propertyt &pit2)
228
229
return std::make_pair (property_name, 0 );
229
230
};
230
231
231
- const auto left_split = split_property_id (pit1 .first );
232
+ const auto left_split = split_property_id (property1 .first );
232
233
const auto left_id_name = left_split.first ;
233
234
const auto left_id_number = left_split.second ;
234
235
235
- const auto right_split = split_property_id (pit2 .first );
236
+ const auto right_split = split_property_id (property2 .first );
236
237
const auto right_id_name = left_split.first ;
237
238
const auto right_id_number = left_split.second ;
238
239
0 commit comments