Replacing an inefficient use of std::find(...) to use std::set's find() instead.

diff --git a/src/theory/uf/symmetry_breaker.cpp b/src/theory/uf/symmetry_breaker.cpp
index bd85b735d31427d28a6898137c0e2013136bcebf..d5e18ed14227f1921b156d5351103a495605da4d 100644 (file)
--- a/src/theory/uf/symmetry_breaker.cpp
+++ b/src/theory/uf/symmetry_breaker.cpp
@@ -743,7 +743,7 @@ SymmetryBreaker::selectMostPromisingTerm(Terms& terms) {
 void SymmetryBreaker::insertUsedIn(Term term, const Permutation& p, set<Node>& cts) {
   // insert terms from p used in term into cts
   //Debug("ufsymm") << "UFSYMM usedIn(): " << term << " , " << p << endl;
-  if(find(p.begin(), p.end(), term) != p.end()) {
+  if (p.find(term) != p.end()) {
     cts.insert(term);
   } else {
     for(TNode::iterator i = term.begin(); i != term.end(); ++i) {