Repository navigation
Expand file tree
/
Copy pathFontGenerator6PixelFuture.java
More file actions
149 lines (131 loc) · 8.25 KB
/
Copy pathFontGenerator6PixelFuture.java
File metadata and controls
149 lines (131 loc) · 8.25 KB
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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
/**
* FontGenerator6PixelFuture
* Copyright 2025 by Michael Christen
* First released 23.09.2025 at https://yacy.net
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program in the file lgpl21.txt
* If not, see <http://www.gnu.org/licenses/>.
*/
package net.yacy.visualization;
/**
* A 6x7 pixel font with angled, circuit-inspired strokes that lean into
* futuristic HUD motifs while keeping the same ASCII coverage as the other
* generator variants.
*/
public class FontGenerator6PixelFuture {
/**
* font: a character matrix of 96 characters:
*
* 0x20: !"#$%&'
* 0x28:()*+,-./
* 0x30:01234567
* 0x38:89:;<=>?
* 0x40:@ABCDEFG
* 0x48:HIJKLMNO
* 0x50:PQRSTUVW
* 0x58:XYZ[\]^_
* 0x60:`abcdefg
* 0x68:hijklmno
* 0x70:pqrstuvw
* 0x78:xyz{|}~
*/
public static final String[] font_light = {
"......", "..X...", ".X..X.", ".X..X.", "...X...", "XX...X", "..X...", "...X..",
"......", "..X...", ".X..X.", "XXXXXX", "XXXXXXX", "XX..X.", ".X.X..", "..X...",
"......", "..X...", "......", ".X..X.", "X..X...", "...X..", "..X...", "......",
"......", "..X...", "......", ".X..X.", "XXXXXXX", "..X...", ".X.X.X", "......",
"......", "......", "......", "XXXXXX", "...X..X", ".X..XX", "X...X.", "......",
"......", "..X...", "......", ".X..X.", "XXXXXXX", "X...XX", ".XXX.X", "......",
"......", "......", "......", "......", "...X...", "......", "......", "......",
"...X..", "..X...", "......", "......", "......", "......", "......", "......",
"..X...", "...X..", "..X.X.", "...X..", "......", "......", "......", "....X.",
"..X...", "...X..", "...X..", "...X..", "......", "......", "......", "...X..",
"..X...", "...X..", ".XXXXX", ".XXXXX", "......", ".XXXXX", "......", "..X...",
"..X...", "...X..", "...X..", "...X..", "..X...", "......", "..XX..", ".X....",
"...X..", "..X...", "..X.X.", "...X..", "..X...", "......", "..XX..", "X.....",
"......", "......", "......", "......", ".X....", "......", "......", "......",
".XXXX.", "..XX..", ".XXXX.", ".XXXX.", "...X..", "XXXXXX", ".XXXX.", "XXXXXX",
"X...XX", ".X.X..", "X....X", "X....X", "..XX..", "X.....", "X.....", ".....X",
"X..X.X", "...X..", ".....X", "...XX.", ".X.X..", "XXXXX.", "XXXXX.", "....X.",
"X.X..X", "...X..", ".XXXX.", ".....X", "X..X..", ".....X", "X....X", "...X..",
"XX...X", "...X..", "X.....", "X....X", "XXXXXX", "X....X", "X....X", "..X...",
".XXXX.", ".XXXXX", "XXXXXX", ".XXXX.", "...X..", ".XXXX.", ".XXXX.", "..X...",
"......", "......", "......", "......", "......", "......", "......", "......",
".XXXX.", ".XXXX.", "......", "......", "......", "......", "......", ".XXXX.",
"X....X", "X....X", "......", "..X...", "...X..", "......", "..X...", "X....X",
".XXXX.", "X....X", "..X...", "......", "..X...", ".XXXXX", "...X..", "....X.",
"X....X", ".XXXXX", "......", "......", ".X....", "......", "....X.", "...X..",
"X....X", ".....X", "......", "..X...", "..X...", ".XXXXX", "...X..", "......",
".XXXX.", ".XXXX.", "..X...", "..X...", "...X..", "......", "..X...", "...X..",
"......", "......", "......", ".X....", "......", "......", "......", "......",
"...XXXX", "...XXXX", "XXXXXX.", "..XXXXX", "XXXXX..", "XXXXXXX", "XXXXXXX", "..XXXXX",
"..X.X.X", "..X...X", "X.....X", ".X.....", "X....X.", "X......", "X......", ".X.....",
".X.X..X", ".X....X", "X....X.", "X......", "X.....X", "X......", "X......", "X......",
"X..X..X", "XXXXX.X", "X.XXX..", "X......", "X.....X", "X.XXXX.", "X.XXXX.", "X..XXXX",
"X..XXXX", "X.....X", "X....X.", "X......", "X.....X", "X......", "X......", "X.....X",
"X......", "X.....X", "X.....X", ".X.....", "X....X.", ".X.....", "X......", ".X....X",
".XXXXX.", "X.....X", "XXXXXX.", "..XXXXX", "XXXXX..", "..XXXXX", "X......", "..XXXXX",
"X.....X", "...X...", "......X", "X.....X", "X......", "X.....X", "X.....X", "..XXX..",
"X.....X", "...X...", "......X", "X....X.", "X......", "X.....X", "XX....X", ".X...X.",
"X.....X", "...X...", "......X", "X...X..", "X......", "XX...XX", "X.X...X", "X.....X",
"XXXXXXX", "...X...", "......X", "X.XX...", "X......", "X.X.X.X", "X..X..X", "X.....X",
"X.....X", "...X...", ".....X.", "X...X..", ".X.....", "X..X..X", "X...X.X", "X.....X",
"X.....X", "...X...", "....X..", "X....X.", "..X....", "X.....X", "X....XX", ".X...X.",
"X.....X", "...X...", "XXXX...", "X.....X", "...XXXX", "X.....X", "X.....X", "..XXX..",
"XXXXX.", ".XXXX.", "XXXXX.", ".XXXX.", ".XXXXX", "X....X", "X....X", "X....X",
"X....X", "X....X", "X....X", "X.....", "...X..", "X....X", "X....X", "X....X",
"X....X", "X....X", "X....X", ".XXXX.", "...X..", "X....X", "X....X", "X....X",
"XXXXX.", "X.X..X", "XXXXX.", ".....X", "...X..", "X....X", "X....X", "X....X",
"X.....", "X..X.X", "X...X.", "X....X", "...X..", "X....X", ".X..X.", "X.XX.X",
"X.....", ".XXXX.", "X....X", ".XXXX.", "...X..", ".XXXX.", "..XX..", ".X..X.",
"......", "......", "......", "......", "......", "......", "......", "......",
"X....X", ".X...X", "XXXXXX", "...XXX", "......", "XXX...", "..X...", "......",
".X..X.", ".X...X", "....X.", "...X..", "X.....", "..X...", ".X.X..", "......",
"..XX..", "..X.X.", "...X..", "...X..", ".X....", "..X...", "X...X.", "......",
"..XX..", "...X..", "..X...", "...X..", "..X...", "..X...", "......", "......",
".X..X.", "...X..", ".X....", "...X..", "...X..", "..X...", "......", "......",
"X....X", "...X..", "XXXXXX", "...XXX", "....X.", "XXX...", "......", "......",
"......", "......", "......", "......", "......", "......", "......", "XXXXXX",
};
public static void fontConverter(final String[] font) {
final int matrix_width = 8;
final int matrix_height = 8;
final int font_width = 7;
final int font_height = 7;
for (int matrix_y = 0; matrix_y < matrix_height; matrix_y++) {
for (int matrix_x = 0; matrix_x < matrix_width; matrix_x++) {
int start = (matrix_y * matrix_width * font_height) + matrix_x;
long b = 0;
for (int row = 0; row < font_height; row++) {
b = b << font_width;
long v = 1 << (font_width - 1);
for (int col = 0; col < font_width; col++) {
int i = start + matrix_width * row;
if (font[i].charAt(col) == 'X') b += v;
else if (font[i].charAt(col) != '.') throw new RuntimeException("wrong char: " + font[i].charAt(col));
v = v >> 1;
}
}
String s = Long.toHexString(b).toUpperCase();
while (s.length() < 12) s = "0" + s;
System.out.print("0x" + s + "L,");
}
System.out.println();
}
}
public static void main(final String[] args) {
fontConverter(font_light);
System.out.println();
}
}