mirror of
https://github.com/RobTillaart/Arduino.git
synced 2024-09-20 00:55:58 -04:00
d9affe6108
+ substantial faster first/next/last/prev; interface + small changes in allTest.ino + added output files for version 0.1.06 and 0.1.07 (AVR 16MHZ)
67 lines
1.7 KiB
C++
67 lines
1.7 KiB
C++
//
|
|
// FILE: Set.h
|
|
// AUTHOR: Rob Tillaart
|
|
// VERSION: 0.1.07
|
|
// PURPOSE: SET library for Arduino
|
|
// URL:
|
|
//
|
|
// HISTORY:
|
|
// see Set.cpp file
|
|
//
|
|
|
|
#ifndef Set_h
|
|
#define Set_h
|
|
|
|
#if ARDUINO < 100
|
|
#include <WProgram.h>
|
|
#else
|
|
#include <Arduino.h>
|
|
#endif
|
|
|
|
#define SET_LIB_VERSION "0.1.07"
|
|
|
|
class Set
|
|
{
|
|
public:
|
|
Set(bool clear = true); // create empty Set
|
|
Set(const Set &t); // create copy Set
|
|
|
|
void clr(); // clear the Set
|
|
void invert(); // flip all elements in the Set
|
|
uint8_t count(); // return the #elements
|
|
|
|
void add(uint8_t); // add element to the Set
|
|
void sub(uint8_t); // remove element from Set
|
|
void invert(uint8_t); // flip element in Set
|
|
bool has(uint8_t); // element is in Set
|
|
|
|
Set operator + (Set &t); // union
|
|
Set operator - (Set &t); // diff
|
|
Set operator * (Set &t); // intersection
|
|
|
|
void operator += (Set &t); // union
|
|
void operator -= (Set &t); // diff
|
|
void operator *= (Set &t); // intersection
|
|
|
|
bool operator == (Set&); // equal
|
|
bool operator != (Set&); // not equal
|
|
bool operator <= (Set&); // is subSet
|
|
|
|
// iterating through the Set
|
|
// returns value or -1 if not exist
|
|
int first(); // find first element
|
|
int next(); // find next element
|
|
int prev(); // find previous element
|
|
int last(); // find last element
|
|
|
|
|
|
private:
|
|
uint8_t _mem[32]; // can hold 0..255
|
|
int _current;
|
|
int findNext(uint8_t, uint8_t); // helper for first, next
|
|
int findPrev(uint8_t, uint8_t); // helper for last, prev
|
|
};
|
|
#endif
|
|
//
|
|
// END OF FILE
|
|
//
|