@@ -188,13 +188,14 @@ using propertyt = std::pair<irep_idt, property_infot>;
188188// / 3. numerical ordering of line number
189189// / 4. alphabetical ordering of goal ID
190190// / 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.
193193// / \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)
195196{
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 ;
198199 if (p1.get_file () != p2.get_file ())
199200 return id2string (p1.get_file ()) < id2string (p2.get_file ());
200201 if (p1.get_function () != p2.get_function ())
@@ -228,11 +229,11 @@ static bool is_property_less_than(const propertyt &pit1, const propertyt &pit2)
228229 return std::make_pair (property_name, 0 );
229230 };
230231
231- const auto left_split = split_property_id (pit1 .first );
232+ const auto left_split = split_property_id (property1 .first );
232233 const auto left_id_name = left_split.first ;
233234 const auto left_id_number = left_split.second ;
234235
235- const auto right_split = split_property_id (pit2 .first );
236+ const auto right_split = split_property_id (property2 .first );
236237 const auto right_id_name = left_split.first ;
237238 const auto right_id_number = left_split.second ;
238239
0 commit comments