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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
|
/*
* Copyright (c) 1993-1994 Regents of the University of California.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and the Network Research Group at
* Lawrence Berkeley Laboratory.
* 4. Neither the name of the University nor of the Laboratory may be used
* to endorse or promote products derived from this software without
* specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* @(#) $Header: /cs/research/mice/starship/src/local/CVS_repository/vic/color.h,v 1.1.1.1 1998/02/18 18:03:15 ucacsva Exp $ (LBL)
*/
#ifndef vic_color_h
#define vic_color_h
#include "Tcl.h"
#include "iohandler.h"
extern "C" {
#include <tk.h>
}
#define GREY_LEVELS 32
#define YUVLIM(x) (((x) < 0) ? 0 : ((x) > 127) ? 127 : (x))
/*
* Classes for mapping YUV image data into a representation that
* can be rendered on the display. The ColorModel class represents
* a finite-element color cube, which might be uniformaly sampled,
* or biased; or, a map from YUV space to 24-bit true color.
* The Colorizer class represents the agents that do the work of
* mapping from YUV space to the ColorModel space. For example,
* they might do dithering or simple (non-uniform) quantization.
*/
class ColorModel : public TclObject {
public:
struct color {
short r;
short g;
short b;
short y;
short u;
short v;
};
virtual ~ColorModel();
inline const u_short* graylut() const { return (grey_lut_); }
int allocate();
virtual int alloc_colors();
virtual int alloc_grays();
const color* lookup(int pixel) const { return (&colors_[pixel]); }
virtual int command(int argc, const char*const* argv);
protected:
ColorModel();
void free_colors();
void rgb_to_yuv(color& c) const;
int yuv_to_rgb(color& c) const;
/*
* Return the n'th allocated color.
*/
inline const color& colors(int n) const { return (colors_[pixel_[n]]); }
int alloc_color(color&);
int alloc_color(int r, int g, int b);
public:
inline void setvisual(Visual* v, Colormap c, int d) {
visual_ = v;
colormap_ = c;
depth_ = d;
}
protected:
Display* dpy_;
Colormap colormap_;
Visual* visual_;
int depth_;
double gamma_;
int ncolor_;
color colors_[256];
u_long pixel_[256];
u_short grey_lut_[512];
};
inline int ColorModel::alloc_color(int r, int g, int b)
{
color c;
c.r = r;
c.g = g;
c.b = b;
return (alloc_color(c));
}
#endif
|
