Mercurial > libunicode
diff generator/make-unicode/src/mkunicode.c @ 3:d9d3406c1250
New style
author | David Demelier <markand@malikania.fr> |
---|---|
date | Mon, 12 Jun 2017 09:47:46 +0200 |
parents | 84765c6f4872 |
children | d9309daa0d7b |
line wrap: on
line diff
--- a/generator/make-unicode/src/mkunicode.c Thu Feb 02 18:07:27 2017 +0100 +++ b/generator/make-unicode/src/mkunicode.c Mon Jun 12 09:47:46 2017 +0200 @@ -391,27 +391,24 @@ if(isr) fprintf(out, " p = rbsearch(c, is%sr, nelem (is%sr) / 2, 2);\n\n" - " if (p && c >= p[0] && c <= p[1]) {\n" - " return true;\n" - " }\n", + " if (p && c >= p[0] && c <= p[1])\n" + " return true;\n", label, label); if(isp) fprintf(out, "\n" " p = rbsearch(c, is%sp, nelem (is%sp) / 2, 2);\n\n" - " if (p && c >= p[0] && c <= p[1] && !((c - p[0]) & 1)) {\n" - " return true;\n" - " }\n", + " if (p && c >= p[0] && c <= p[1] && !((c - p[0]) & 1))\n" + " return true;\n", label, label); if(iss) fprintf(out, "\n" " p = rbsearch(c, is%ss, nelem (is%ss), 1);\n\n" - " if (p && c == p[0]) {\n" - " return true;\n" - " }\n", + " if (p && c == p[0])\n" + " return true;\n", label, label); @@ -570,27 +567,24 @@ if(tor) fprintf(out, " p = rbsearch(c, to%sr, nelem (to%sr) / 3, 3);\n\n" - " if (p && c >= p[0] && c <= p[1]) {\n" - " return c + p[2] - %d;\n" - " }\n", + " if (p && c >= p[0] && c <= p[1])\n" + " return c + p[2] - %d;\n", label, label, TO_OFFSET); if(top) fprintf(out, "\n" " p = rbsearch(c, to%sp, nelem (to%sp) / 3, 3);\n\n" - " if (p && c >= p[0] && c <= p[1] && !((c - p[0]) & 1)) {\n" - " return c + p[2] - %d;\n" - " }\n", + " if (p && c >= p[0] && c <= p[1] && !((c - p[0]) & 1))\n" + " return c + p[2] - %d;\n", label, label, TO_OFFSET); if(tos) fprintf(out, "\n" " p = rbsearch(c, to%ss, nelem (to%ss) / 2, 2);\n\n" - " if (p && c == p[0]) {\n" - " return c + p[1] - %d;\n" - " }\n\n", + " if (p && c == p[0])\n" + " return c + p[1] - %d;\n\n", label, label, TO_OFFSET); fprintf(out, @@ -611,9 +605,8 @@ " const char32_t* p;\n" "\n" " p = rbsearch(c, is%sr, nelem (is%sr) / 2, 2);\n\n" - " if (p && c >= p[0] && c <= p[1]) {\n" - " return true;\n" - " }\n\n" + " if (p && c >= p[0] && c <= p[1])\n" + " return true;\n\n" " return false;\n" "}\n" "\n", @@ -645,13 +638,11 @@ " if (c >= p[0]) {\n" " t = p;\n" " n = n - m;\n" - " } else {\n" + " } else\n" " n = m;\n" - " }\n" " }\n\n" - " if (n && c >= t[0]) {\n" - " return t;\n" - " }\n\n" + " if (n && c >= t[0])\n" + " return t;\n\n" " return nullptr;\n" "}\n\n" "} // !namespace\n\n"