NeMo/Colors.java at master · learnwithrt/NeMo · GitHub

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
/*
 * @(#)Colors.java  1.0  2011-03-13
 *
 * Copyright (c) 2011 Werner Randelshofer, Immensee, Switzerland.
 * All rights reserved.
 *
 * You may not use, copy or modify this file, except in compliance with the
 * license agreement you entered into with Werner Randelshofer.
 * For details see accompanying license terms.
 */

import java.awt.image.IndexColorModel;

/**
 * {@code Colors}.
 *
 * @author Werner Randelshofer
 * @version 1.0 2011-03-13 Created.
 */
public class Colors {

    /** Prevent instance creation. */
    private Colors() {
    }

    /**
     * The macintosh palette is arranged as follows: there are 256 colours to
     * allocate, an even distribution of colors through the color cube might be
     * desirable but 256 is not the cube of an integer. 6x6x6 is 216 and so the
     * first 216 colors are an equal 6x6x6 sampling of the color cube.
     * This leaves 40 colours to allocate, this has been done by choosing a ramp of
     * 10 shades each for red, green, blue and grey.
     *
     * <p>
     * References:<br>
     * <a href="http://paulbourke.net/texture_colour/colourramp/">http://paulbourke.net/texture_colour/colourramp/</a>
     *
     * @return The Macintosh color palette.
     */
    public static IndexColorModel createMacColors() {
        byte[] r = new byte[256];
        byte[] g = new byte[256];
        byte[] b = new byte[256];

        // Generate color cube with 216 colors
        int index=0;
        for (int i = 0; i < 6; i++) {
            for (int j = 0; j < 6; j++) {
                for (int k = 0; k < 6; k++) {
                    r[index]=(byte)(255-51*i);
                    g[index]=(byte)(255-51*j);
                    b[index]=(byte)(255-51*k);
                    index++;
                }
            }
        }

        index--; // overwrite last color (black) with color ramp

        // Generate red ramp
        byte[] ramp={(byte)238,(byte)221,(byte)187,(byte)170,(byte)136,(byte)119,85,68,34,17};
        for (int i=0;i<10;i++) {
                    r[index]=ramp[i];
                    g[index]=(byte)(0);
                    b[index]=(byte)(0);
                    index++;
        }
        // Generate green ramp
        for (int j=0;j<10;j++) {
                    r[index]=(byte)(0);
                    g[index]=ramp[j];
                    b[index]=(byte)(0);
                    index++;
        }
        // Generate blue ramp
        for (int k=0;k<10;k++) {
                    r[index]=(byte)(0);
                    g[index]=(byte)(0);
                    b[index]=ramp[k];
                    index++;
        }
        // Generate gray ramp
        for (int ijk=0;ijk<10;ijk++) {
                    r[index]=ramp[ijk];
                    g[index]=ramp[ijk];
                    b[index]=ramp[ijk];
                    index++;
        }
        // last color is black (nothing to do)

        /*
        for (int i=0;i<256;i++) {
            if (i%6==0) System.out.println(); else System.out.print("  ");
            System.out.print(Integer.toHexString(r[i]&0xff)+","+Integer.toHexString(g[i]&0xff)+","+Integer.toHexString(b[i]&0xff));
        }*/

        IndexColorModel icm = new IndexColorModel(8, 256, r, g, b);
        return icm;
    }
}