Filip Leonarski
e2b240356c
All checks were successful
Build Packages / build:rpm (rocky8_nocuda) (push) Successful in 9m28s
Build Packages / build:rpm (ubuntu2404_nocuda) (push) Successful in 8m25s
Build Packages / build:rpm (ubuntu2204_nocuda) (push) Successful in 9m4s
Build Packages / build:rpm (rocky9_nocuda) (push) Successful in 10m27s
Build Packages / build:rpm (rocky8_sls9) (push) Successful in 9m36s
Build Packages / Generate python client (push) Successful in 32s
Build Packages / Build documentation (push) Successful in 45s
Build Packages / Create release (push) Has been skipped
Build Packages / build:rpm (rocky8) (push) Successful in 8m45s
Build Packages / build:rpm (ubuntu2404) (push) Successful in 7m51s
Build Packages / build:rpm (ubuntu2204) (push) Successful in 8m57s
Build Packages / build:rpm (rocky9) (push) Successful in 9m35s
Build Packages / Unit tests (push) Successful in 1h13m45s
This is an UNSTABLE release. * jfjoch_broker: Report changes in the image buffer, so viewer doesn't reload constantly * jfjoch_viewer: Improve performance of loading images * jfjoch_viewer: Auto-throttle image loading in HTTP-sync / movie modes * jfjoch_viewer: Auto-foreground calculated with histogram * jfjoch_viewer: Fix rare segmentation fault Reviewed-on: #28 Co-authored-by: Filip Leonarski <filip.leonarski@psi.ch> Co-committed-by: Filip Leonarski <filip.leonarski@psi.ch>
29 lines
635 B
C++
29 lines
635 B
C++
// SPDX-FileCopyrightText: 2025 Filip Leonarski, Paul Scherrer Institute <filip.leonarski@psi.ch>
|
|
// SPDX-License-Identifier: GPL-3.0-only
|
|
|
|
#include <catch2/catch_all.hpp>
|
|
#include "../common/TopPixels.h"
|
|
|
|
TEST_CASE("TopPixels") {
|
|
TopPixels tp(5);
|
|
|
|
REQUIRE(tp.Empty());
|
|
REQUIRE(tp.Size() == 0);
|
|
|
|
for (int i = 50; i > 0; i--)
|
|
tp.Add(i*2, i);
|
|
|
|
tp.Add(500,245);
|
|
tp.Add(0,1221);
|
|
|
|
REQUIRE(tp.Size() == 5);
|
|
|
|
CHECK(tp[0].index == 245);
|
|
CHECK(tp[0].value == 500);
|
|
for (int i = 1; i < 4; i++) {
|
|
CHECK(tp[i].index == (50 - i + 1));
|
|
CHECK(tp[i].value == (50 - i + 1) * 2);
|
|
}
|
|
}
|
|
|