1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
|
/* Copyright (C) 2002-2005 RealVNC Ltd. All Rights Reserved.
* Copyright 2011 Pierre Ossman <ossman@cendio.se> for Cendio AB
*
* This is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This software is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this software; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
* USA.
*/
#ifndef __RFB_COLOURMAP_H__
#define __RFB_COLOURMAP_H__
namespace rfb {
struct Colour {
Colour() : r(0), g(0), b(0) {}
Colour(int r_, int g_, int b_) : r(r_), g(g_), b(b_) {}
int r, g, b;
bool operator==(const Colour& c) const {return c.r == r && c.g == g && c.b == b;}
bool operator!=(const Colour& c) const {return !(c == *this);}
};
class ColourMap {
public:
virtual void lookup(int index, int* r, int* g, int* b)=0;
virtual ~ColourMap() {}
};
class SimpleColourMap : public ColourMap {
public:
SimpleColourMap(int size = 256) { table = new Colour[size]; };
virtual ~SimpleColourMap() { delete [] table; };
void lookup(int index, int* r, int* g, int* b)
{ *r = table[index].r; *g = table[index].g; *b = table[index].b; };
void set(int index, int r, int g, int b)
{ table[index].r = r; table[index].g = g; table[index].b = b; };
protected:
Colour *table;
};
}
#endif
|
