mirror of
https://github.com/dlang/phobos.git
synced 2025-04-26 13:10:35 +03:00
Make Unicode tables module headers consistent and add DO NOT EDIT to it
This commit is contained in:
parent
122df9272a
commit
a1f2e760e7
5 changed files with 46 additions and 13 deletions
|
@ -1,3 +1,12 @@
|
|||
//Written in the D programming language
|
||||
/**
|
||||
* License: $(HTTP boost.org/LICENSE_1_0.txt, Boost License 1.0).
|
||||
*
|
||||
* Authors: Dmitry Olshansky
|
||||
*
|
||||
*/
|
||||
//Automatically generated from Unicode Character Database files, DO NOT EDIT
|
||||
//dfmt off
|
||||
module std.internal.unicode_decomp;
|
||||
import std.internal.unicode_tables;
|
||||
|
||||
|
|
|
@ -1,3 +1,12 @@
|
|||
//Written in the D programming language
|
||||
/**
|
||||
* License: $(HTTP boost.org/LICENSE_1_0.txt, Boost License 1.0).
|
||||
*
|
||||
* Authors: Dmitry Olshansky
|
||||
*
|
||||
*/
|
||||
//Automatically generated from Unicode Character Database files, DO NOT EDIT
|
||||
//dfmt off
|
||||
module std.internal.unicode_grapheme;
|
||||
import std.internal.unicode_tables;
|
||||
|
||||
|
|
|
@ -1,3 +1,12 @@
|
|||
//Written in the D programming language
|
||||
/**
|
||||
* License: $(HTTP boost.org/LICENSE_1_0.txt, Boost License 1.0).
|
||||
*
|
||||
* Authors: Dmitry Olshansky
|
||||
*
|
||||
*/
|
||||
//Automatically generated from Unicode Character Database files, DO NOT EDIT
|
||||
//dfmt off
|
||||
module std.internal.unicode_norm;
|
||||
import std.internal.unicode_tables;
|
||||
|
||||
|
|
|
@ -5,10 +5,10 @@
|
|||
* Authors: Dmitry Olshansky
|
||||
*
|
||||
*/
|
||||
//Automatically generated from Unicode Character Database files
|
||||
|
||||
//Automatically generated from Unicode Character Database files, DO NOT EDIT
|
||||
//dfmt off
|
||||
module std.internal.unicode_tables;
|
||||
|
||||
@safe pure nothrow @nogc package(std):
|
||||
|
||||
|
||||
|
|
|
@ -158,6 +158,16 @@ enum {
|
|||
specialCasingSrc = UnicodeDatabaseDirectory ~ "SpecialCasing.txt"
|
||||
}
|
||||
|
||||
enum HeaderComment = `//Written in the D programming language
|
||||
/**
|
||||
* License: $(HTTP boost.org/LICENSE_1_0.txt, Boost License 1.0).
|
||||
*
|
||||
* Authors: Dmitry Olshansky
|
||||
*
|
||||
*/
|
||||
//Automatically generated from Unicode Character Database files, DO NOT EDIT
|
||||
//dfmt off`;
|
||||
|
||||
auto toPairs(K, V)(V[K] aa)
|
||||
{
|
||||
return aa.values.zip(aa.keys).array;
|
||||
|
@ -189,29 +199,25 @@ void main(string[] argv)
|
|||
auto graphSink = File(UnicodeTableDirectory ~ "unicode_grapheme.d", mode);
|
||||
if (!minimal)
|
||||
{
|
||||
baseSink.writeln("//Written in the D programming language
|
||||
/**
|
||||
* License: $(HTTP boost.org/LICENSE_1_0.txt, Boost License 1.0).
|
||||
*
|
||||
* Authors: Dmitry Olshansky
|
||||
*
|
||||
*/
|
||||
//Automatically generated from Unicode Character Database files\n
|
||||
//dfmt off
|
||||
module std.internal.unicode_tables;
|
||||
@safe pure nothrow @nogc package(std):\n");
|
||||
baseSink.writeln(HeaderComment);
|
||||
baseSink.writeln("module std.internal.unicode_tables;");
|
||||
baseSink.writeln("\n@safe pure nothrow @nogc package(std):\n");
|
||||
|
||||
compSink.writeln("module std.internal.unicode_comp;");
|
||||
compSink.writeln("import std.internal.unicode_tables;");
|
||||
compSink.writeln("\n@safe pure nothrow @nogc package(std):\n");
|
||||
|
||||
decompSink.writeln(HeaderComment);
|
||||
decompSink.writeln("module std.internal.unicode_decomp;");
|
||||
decompSink.writeln("import std.internal.unicode_tables;");
|
||||
decompSink.writeln("\n@safe pure nothrow @nogc package(std):\n");
|
||||
|
||||
normSink.writeln(HeaderComment);
|
||||
normSink.writeln("module std.internal.unicode_norm;");
|
||||
normSink.writeln("import std.internal.unicode_tables;");
|
||||
normSink.writeln("\npackage(std):\n");
|
||||
|
||||
graphSink.writeln(HeaderComment);
|
||||
graphSink.writeln("module std.internal.unicode_grapheme;");
|
||||
graphSink.writeln("import std.internal.unicode_tables;");
|
||||
graphSink.writeln("\npackage(std):\n");
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue