detectors/slsDetectorPackage
25
0
Fork 0
mirror of https://github.com/slsdetectorgroup/slsDetectorPackage.git synced 2025-06-12 04:47:14 +02:00
Code Issues Actions Packages Releases Activity

format receiver

Browse Source
This commit is contained in:
Erik Frojdh
2020-05-05 10:04:52 +02:00
parent 3618f6e5d3
commit e599bb7c24
35 changed files with 4642 additions and 4530 deletions
Download Patch File Download Diff File Expand all files Collapse all files

49
slsReceiverSoftware/tests/test-CircularFifo.cpp
View File

@ -1,52 +1,49 @@
#include "catch.hpp"
#include "CircularFifo.h"
#include "catch.hpp"
#include <vector>
TEST_CASE("Empty buffer"){
TEST_CASE("Empty buffer") {
CircularFifo<char> fifo(0);
//Since the fifo can hold zero elements
//its both empty and full
CHECK(fifo.isEmpty()== true);
CHECK(fifo.isFull()== true);
// Since the fifo can hold zero elements
// its both empty and full
CHECK(fifo.isEmpty() == true);
CHECK(fifo.isFull() == true);
//push fails
char* c = new char;
// push fails
char *c = new char;
*c = 'h';
CHECK(fifo.push(c, true) == false);
//pop fails
// pop fails
CHECK(fifo.pop(c, true) == false);
delete c;
}
TEST_CASE("Push pop"){
TEST_CASE("Push pop") {
CircularFifo<int> fifo(5);
std::vector<int> vec{3,7,12,3,4};
int* p = &vec[0];
std::vector<int> vec{3, 7, 12, 3, 4};
int *p = &vec[0];
for(size_t i =0; i!=vec.size(); ++i){
for (size_t i = 0; i != vec.size(); ++i) {
fifo.push(p);
++p;
CHECK(fifo.getDataValue() == i+1);
CHECK(fifo.getFreeValue() == 4-i);
CHECK(fifo.getDataValue() == i + 1);
CHECK(fifo.getFreeValue() == 4 - i);
}
CHECK(fifo.isEmpty()== false);
CHECK(fifo.isFull()== true);
for(size_t i = 0; i!= vec.size(); ++i){
CHECK(fifo.isEmpty() == false);
CHECK(fifo.isFull() == true);
for (size_t i = 0; i != vec.size(); ++i) {
fifo.pop(p);
CHECK(*p == vec[i]);
CHECK(fifo.getDataValue() == 4-i);
CHECK(fifo.getFreeValue() == i+1);
CHECK(fifo.getDataValue() == 4 - i);
CHECK(fifo.getFreeValue() == i + 1);
}
CHECK(fifo.isEmpty()== true);
CHECK(fifo.isFull()== false);
CHECK(fifo.isEmpty() == true);
CHECK(fifo.isFull() == false);
}