We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent baf8068 commit b83a267Copy full SHA for b83a267
1 file changed
examples/QueueDuplicates/QueueDuplicates.ino
@@ -6,6 +6,7 @@
6
This example code is in the public domain.
7
8
created 3 November 2019
9
+ modified 6 November 2019
10
by SMFSW
11
*/
12
@@ -61,7 +62,7 @@ void loop() {
61
62
if (memcmp(&rec, &chk, sizeof(Rec))) { q.push(&rec); }
63
#else // Check the whole queue
64
bool duplicate = false;
- for (int j = max(0, (int) (q.getCount() - 1)) ; j > 0 ; j--)
65
+ for (int j = (int) q_getCount(&q) - 1 ; j >= 0 ; j--)
66
{
67
Rec chk = {0xffff,0xffff};
68
q.peekIdx(&chk, j);
0 commit comments