SVN - Tsukurimashou Font Family and IDSgrep

--- trunk/txt/jnames.txt (revision 253)

+++ trunk/txt/jnames.txt (revision 254)

		@@ -1,6 +1,6 @@
1	1	%
2	2	% Japanese and Korean name translations for Tsukurimashou
3		-% Copyright (C) 2011 Matthew Skala
	3	+% Copyright (C) 2011, 2012 Matthew Skala
4	4	%
5	5	% This program is free software: you can redistribute it and/or modify
6	6	% it under the terms of the GNU General Public License as published by

		@@ -32,6 +32,7 @@
32	32	% points expressed in a form Hamlog can process.
33	33
34	34	tsukurimashou 作りましょう
	35	+tsuita ツイタ
35	36	blackletter_lolita ＢＬロリータ
36	37
37	38	kaku 角

		@@ -41,8 +42,11 @@
41	42	anbiruteki アンビル的
42	43	tenshinokami 天使の髪
43	44
44		-cosette ♥コゼット♥
	45	+soku 足
	46	+atama 頭
45	47
	48	+cosette ♥コセット♥
	49	+
46	50	extralight ？
47	51	light ？
48	52	normal l___da

--- trunk/doc/usermanual.tex (revision 253)

+++ trunk/doc/usermanual.tex (revision 254)

		@@ -49,18 +49,26 @@
49	49
50	50	%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
51	51
52		-\newfontfamily\kaku{TsukurimashouKakuPS}
53	52	\newfontface\maru{TsukurimashouMaruPS}
54	53	\newfontface\mincho{TsukurimashouMinchoPS}
55	54	\newfontface\anbiruteki{TsukurimashouAnbirutekiPS}
56	55	\newfontface\tenshinokami{TsukurimashouTenshinoKamiPS}
57	56	\newfontface\bokukko{TsukurimashouBokukkoPS}
	57	+
58	58	\expandafter\ifx\csname haveJieubsidaDodumPS\endcsname\relax\else
59	59	\newfontface\dodum[RawFeature={+ccmp,+ljmo,+vjmo,+liga}]{JieubsidaDodumPS}
60	60	\fi
61	61
62		-\kaku
63		-\setmainfont{TsukurimashouKakuPS}
	62	+\expandafter\ifx\csname haveTsuItaSokuPS\endcsname\relax
	63	+ \newfontfamily\kaku[ItalicFont={TsukurimashouAnbirutekiPS}]{TsukurimashouKakuPS}
	64	+ \kaku
	65	+ \setmainfont[ItalicFont={TsukurimashouAnbirutekiPS}]{TsukurimashouKakuPS}
	66	+\else
	67	+ \newfontfamily\kaku[ItalicFont={TsuItaSokuPS}]{TsukurimashouKakuPS}
	68	+ \kaku
	69	+ \setmainfont[ItalicFont={TsuItaSokuPS}]{TsukurimashouKakuPS}
	70	+\fi
	71	+
64	72	\setmonofont[WordSpace={1,0,0},PunctuationSpace=3]{TsukurimashouMincho}
65	73
66	74	\renewcommand{\labelitemi}{{\fontspec[RawFeature=+ornm]{TsukurimashouKaku}C}}

		@@ -189,7 +197,7 @@
189	197	a flash card. And as a highly proficient user of computer automation, I
190	198	have access to a number of efficiency-increasing techniques that most font
191	199	designers don't. So the deal is, I think if I study the language
192		-{\anbiruteki and also design a typeface family for it,} I might be able to
	200	+\emph{and also design a typeface family for it,} I might be able to
193	201	finish both big projects with less, or not much more, effort than just
194	202	completing the one big project of learning the language alone. And then I'd
195	203	also end up with a custom-made Japanese-language typeface family, which

		@@ -2068,7 +2076,7 @@
2068	2076	previous setting to disable characters necessary to implement the features.
2069	2077	For instance, you can't have OpenType contextual substitution support of
2070	2078	fractions or enclosed numerals if you have disabled the numeral
2071		-characters---though you {\anbiruteki can} build a font with enclosed and not
	2079	+characters---though you \emph{can} build a font with enclosed and not
2072	2080	regular numeric glyphs, because glyphs are mostly independent of each
2073	2081	other.\footnote{Mostly. In the case of white-on-black reversed glyphs and
2074	2082	some fractions precomposed by FontForge instead of by METATYPE1, you

		@@ -2382,20 +2390,20 @@
2382	2390	parenthesized sub-expressions are used to extract the body of that clause.
2383	2391
2384	2392	It is because of the use of regular expressions that Hamlog doesn't do
2385		-compound terms, and in turn is likely not Turing-complete (though I
2386		-haven't thought carefully through all the possibilities of using recursive
2387		-predicates to build data structures on the stack). As all the world
2388		-knows, it is impossible to write a regular expression to match balanced
	2393	+compound terms, and in turn is likely not Turing-complete (though I haven't
	2394	+thought carefully through all the possibilities of using recursive
	2395	+predicates to build data structures on the stack). As all the world knows,
	2396	+it is impossible to write a regular expression to match balanced
2389	2397	parentheses. Current versions of Perl actually bend the theory with
2390	2398	experimental extensions that do allow the matching of balanced parentheses,
2391		-so that in a certain important sense Perl regular expressions {\anbiruteki
2392		-are not regular expressions anymore at all}, but even I am not quite twisted
2393		-enough to actually deploy such code. Things in Hamlog that look like
2394		-compound terms (such as the sub-goals in a clause body) are handled as
2395		-special cases; but the point is that arguments to a functor that will be
2396		-used as a goal have to be either atoms or variables. This also means Hamlog
2397		-doesn't do Prolog syntactic sugar things that expand to compound terms, such
2398		-as square brackets for lists.
	2399	+so that in a certain important sense Perl regular expressions \emph{are not
	2400	+regular expressions anymore at all}, but even I am not quite twisted enough
	2401	+to actually deploy such code. Things in Hamlog that look like compound
	2402	+terms (such as the sub-goals in a clause body) are handled as special cases;
	2403	+but the point is that arguments to a functor that will be used as a goal
	2404	+have to be either atoms or variables. This also means Hamlog doesn't do
	2405	+Prolog syntactic sugar things that expand to compound terms, such as square
	2406	+brackets for lists.
2399	2407
2400	2408	Once there's a match, it does string substitution on the matching head, the
2401	2409	current partially-completed goal, and the body, to get a new modified body

		@@ -2517,7 +2525,7 @@
2517	2525	a valid Prolog compound term for compatibility with other interpreters, but
2518	2526	Hamlog actually treats it as a string. Then it backtracks through all
2519	2527	solutions to the query, attempting to instantiate all variables, and writes
2520		-(newline separated to standard out) all the {\anbiruteki distinct} values
	2528	+(newline separated to standard out) all the \emph{distinct} values
2521	2529	assumed by the template. This is basically the same operation as Prolog
2522	2530	findall/3 followed by sort/2, which is how the Prolog shell for Hamlog
2523	2531	implements it. Any remaining command-line arguments, and standard input if

		@@ -2573,7 +2581,7 @@
2573	2581	and right contours---basically, the x-coordinates of the leftmost and
2574	2582	rightmost black pixels on each row---for each glyph, as well as the margins,
2575	2583	which are defined as the x-coordinates of the leftmost and rightmost pixels
2576		-on {\anbiruteki any} row of the glyph.
	2584	+on \emph{any} row of the glyph.
2577	2585
2578	2586	There is some special processing applied to the contours to make them more
2579	2587	suitable. Consider what happens in a glyph like ``='': many horizontal rows,

		@@ -2595,7 +2603,7 @@
2595	2603	\item The right contour cannot be more than 10 font units (one pixel)
2596	2604	further left than its value in the next or the previous row.
2597	2605	\item If the right contour in the next or previous row is left of the
2598		- {\anbiruteki left} margin, then the right contour in this row cannot be
	2606	+ \emph{left} margin, then the right contour in this row cannot be
2599	2607	more than 3 font units further left than in the next or
2600	2608	previous row.
2601	2609	\item Subject to the above rules, the right contour is as far left

		@@ -2776,7 +2784,7 @@
2776	2784	point and just use the bearings, then in some sense these bearings would
2777	2785	give the best possible approximation of the discarded kerning table.
2778	2786
2779		-Then for each left-class (which is actually a class of {\anbiruteki right}
	2787	+Then for each left-class (which is actually a class of \emph{right}
2780	2788	contours: it is a class of glyphs that can appear on the left in a kerning
2781	2789	pair) the program finds the maximum, that is farthest apart, amount of
2782	2790	kerning between that left-class and any right-class. Two thirds of that

Tsukurimashou Font Family and IDSgrep

tsukurimashou

Commit MetaInfo

Log Message

Change Summary

Diff