From 2bd3c53a9586f37311e4f860685839b127cc9308 Mon Sep 17 00:00:00 2001 From: Giuseppe D'Angelo Date: Mon, 11 Oct 2021 14:45:50 +0200 Subject: QLalr: use QList iterators in algorithms There's no need to dereference+reference a QList's iterator only to pass the result to an algorithm, just pass the iterator. Change-Id: I7367010f6ab489d951715259bd51aeec790d3c84 Reviewed-by: Thiago Macieira --- src/tools/qlalr/compress.cpp | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'src/tools') diff --git a/src/tools/qlalr/compress.cpp b/src/tools/qlalr/compress.cpp index 18f9fb4b58..054766671f 100644 --- a/src/tools/qlalr/compress.cpp +++ b/src/tools/qlalr/compress.cpp @@ -186,7 +186,7 @@ void Compress::operator () (int *table, int row_count, int column_count) if (pos == info.begin ()) { // try to find a perfect match - QList::iterator pm = std::search(&*pos, &*info.end(), row.beginNonZeros(), + QList::iterator pm = std::search(pos, info.end(), row.beginNonZeros(), row.endNonZeros(), _PerfectMatch()); if (pm != info.end ()) @@ -196,7 +196,7 @@ void Compress::operator () (int *table, int row_count, int column_count) } } - pos = std::search (&*pos, &*info.end (), row.beginNonZeros (), row.endNonZeros (), _Fit ()); + pos = std::search (pos, info.end (), row.beginNonZeros (), row.endNonZeros (), _Fit ()); if (pos == info.end ()) break; -- cgit v1.2.3