GY-63_MS5611/libraries/DistanceTable/DistanceTable.h
2022-07-22 22:43:52 +02:00

71 lines
1.8 KiB
C++

#pragma once
//
// FILE: DistanceTable.h
// AUTHOR: Rob Tillaart
// VERSION: 0.3.1
// PURPOSE: Arduino library to store a symmetrical distance table in less memory
// URL: https://github.com/RobTillaart/DistanceTable
//
#include "Arduino.h"
#define DISTANCETABLE_LIB_VERSION (F("0.3.1"))
class DistanceTable
{
public:
explicit DistanceTable(uint8_t dimension, float value = 0);
~DistanceTable();
void clear() { setAll(0); };
void setAll(float value);
bool set(uint8_t x, uint8_t y, float value );
float get(uint8_t x, uint8_t y);
// the invert flag tells that get(x, y) == -get(y, x);
void setInvert(bool invert = false) { _invert = invert; };
bool getInvert() { return _invert; };
// minimum and maximum skip x == y pairs as these are 0.
float minimum(uint8_t &x, uint8_t &y);
float maximum(uint8_t &x, uint8_t &y);
float sum();
float average();
// epsilon allows 'almost equal' searches
// if (invert == false) count counts both (x,y) and (y,x) => always even nr.
// if (invert == true) count counts (x,y) and (y,x) separately.
// count skips x == y pairs so counting zero's is missing the diagonal.
uint16_t count(float value, float epsilon = 0.0);
uint16_t countAbove(float value);
uint16_t countBelow(float value);
// debug
// default dumps to Serial but other stream are possible
void dump(Print * stream = &Serial);
uint8_t dimension() { return _dimension; };
uint16_t elements() { return _elements; };
uint16_t memoryUsed() { return _elements * sizeof(float); };
// Obsolete in future
uint16_t size() { return memoryUsed(); };
protected:
uint8_t _dimension;
uint16_t _elements;
float * _distanceTable;
bool _invert;
};
// --- END OF FILE ---