summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorChristoph Feck <cfeck@kde.org>2016-11-03 18:19:53 (GMT)
committerChristoph Feck <cfeck@kde.org>2016-11-03 18:19:53 (GMT)
commit88a64d20c2cce50070fa11220eeed5def4b9378a (patch)
tree53eef967d2918882216a4c3ada4c52391e26b552
parentc25c21fa4415ff25db49b674ec3003bdcf4c565e (diff)
Remove kcharselect-generate-datafile.py
It was moved to kwidgetsaddons repository
-rw-r--r--COPYING.LIB510
-rwxr-xr-xkcharselect-generate-datafile.py879
2 files changed, 0 insertions, 1389 deletions
diff --git a/COPYING.LIB b/COPYING.LIB
deleted file mode 100644
index 2d2d780..0000000
--- a/COPYING.LIB
+++ /dev/null
@@ -1,510 +0,0 @@
-
- GNU LESSER GENERAL PUBLIC LICENSE
- Version 2.1, February 1999
-
- Copyright (C) 1991, 1999 Free Software Foundation, Inc.
- 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
-[This is the first released version of the Lesser GPL. It also counts
- as the successor of the GNU Library Public License, version 2, hence
- the version number 2.1.]
-
- Preamble
-
- The licenses for most software are designed to take away your
-freedom to share and change it. By contrast, the GNU General Public
-Licenses are intended to guarantee your freedom to share and change
-free software--to make sure the software is free for all its users.
-
- This license, the Lesser General Public License, applies to some
-specially designated software packages--typically libraries--of the
-Free Software Foundation and other authors who decide to use it. You
-can use it too, but we suggest you first think carefully about whether
-this license or the ordinary General Public License is the better
-strategy to use in any particular case, based on the explanations
-below.
-
- When we speak of free software, we are referring to freedom of use,
-not price. Our General Public Licenses are designed to make sure that
-you have the freedom to distribute copies of free software (and charge
-for this service if you wish); that you receive source code or can get
-it if you want it; that you can change the software and use pieces of
-it in new free programs; and that you are informed that you can do
-these things.
-
- To protect your rights, we need to make restrictions that forbid
-distributors to deny you these rights or to ask you to surrender these
-rights. These restrictions translate to certain responsibilities for
-you if you distribute copies of the library or if you modify it.
-
- For example, if you distribute copies of the library, whether gratis
-or for a fee, you must give the recipients all the rights that we gave
-you. You must make sure that they, too, receive or can get the source
-code. If you link other code with the library, you must provide
-complete object files to the recipients, so that they can relink them
-with the library after making changes to the library and recompiling
-it. And you must show them these terms so they know their rights.
-
- We protect your rights with a two-step method: (1) we copyright the
-library, and (2) we offer you this license, which gives you legal
-permission to copy, distribute and/or modify the library.
-
- To protect each distributor, we want to make it very clear that
-there is no warranty for the free library. Also, if the library is
-modified by someone else and passed on, the recipients should know
-that what they have is not the original version, so that the original
-author's reputation will not be affected by problems that might be
-introduced by others.
-
- Finally, software patents pose a constant threat to the existence of
-any free program. We wish to make sure that a company cannot
-effectively restrict the users of a free program by obtaining a
-restrictive license from a patent holder. Therefore, we insist that
-any patent license obtained for a version of the library must be
-consistent with the full freedom of use specified in this license.
-
- Most GNU software, including some libraries, is covered by the
-ordinary GNU General Public License. This license, the GNU Lesser
-General Public License, applies to certain designated libraries, and
-is quite different from the ordinary General Public License. We use
-this license for certain libraries in order to permit linking those
-libraries into non-free programs.
-
- When a program is linked with a library, whether statically or using
-a shared library, the combination of the two is legally speaking a
-combined work, a derivative of the original library. The ordinary
-General Public License therefore permits such linking only if the
-entire combination fits its criteria of freedom. The Lesser General
-Public License permits more lax criteria for linking other code with
-the library.
-
- We call this license the "Lesser" General Public License because it
-does Less to protect the user's freedom than the ordinary General
-Public License. It also provides other free software developers Less
-of an advantage over competing non-free programs. These disadvantages
-are the reason we use the ordinary General Public License for many
-libraries. However, the Lesser license provides advantages in certain
-special circumstances.
-
- For example, on rare occasions, there may be a special need to
-encourage the widest possible use of a certain library, so that it
-becomes a de-facto standard. To achieve this, non-free programs must
-be allowed to use the library. A more frequent case is that a free
-library does the same job as widely used non-free libraries. In this
-case, there is little to gain by limiting the free library to free
-software only, so we use the Lesser General Public License.
-
- In other cases, permission to use a particular library in non-free
-programs enables a greater number of people to use a large body of
-free software. For example, permission to use the GNU C Library in
-non-free programs enables many more people to use the whole GNU
-operating system, as well as its variant, the GNU/Linux operating
-system.
-
- Although the Lesser General Public License is Less protective of the
-users' freedom, it does ensure that the user of a program that is
-linked with the Library has the freedom and the wherewithal to run
-that program using a modified version of the Library.
-
- The precise terms and conditions for copying, distribution and
-modification follow. Pay close attention to the difference between a
-"work based on the library" and a "work that uses the library". The
-former contains code derived from the library, whereas the latter must
-be combined with the library in order to run.
-
- GNU LESSER GENERAL PUBLIC LICENSE
- TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
-
- 0. This License Agreement applies to any software library or other
-program which contains a notice placed by the copyright holder or
-other authorized party saying it may be distributed under the terms of
-this Lesser General Public License (also called "this License").
-Each licensee is addressed as "you".
-
- A "library" means a collection of software functions and/or data
-prepared so as to be conveniently linked with application programs
-(which use some of those functions and data) to form executables.
-
- The "Library", below, refers to any such software library or work
-which has been distributed under these terms. A "work based on the
-Library" means either the Library or any derivative work under
-copyright law: that is to say, a work containing the Library or a
-portion of it, either verbatim or with modifications and/or translated
-straightforwardly into another language. (Hereinafter, translation is
-included without limitation in the term "modification".)
-
- "Source code" for a work means the preferred form of the work for
-making modifications to it. For a library, complete source code means
-all the source code for all modules it contains, plus any associated
-interface definition files, plus the scripts used to control
-compilation and installation of the library.
-
- Activities other than copying, distribution and modification are not
-covered by this License; they are outside its scope. The act of
-running a program using the Library is not restricted, and output from
-such a program is covered only if its contents constitute a work based
-on the Library (independent of the use of the Library in a tool for
-writing it). Whether that is true depends on what the Library does
-and what the program that uses the Library does.
-
- 1. You may copy and distribute verbatim copies of the Library's
-complete source code as you receive it, in any medium, provided that
-you conspicuously and appropriately publish on each copy an
-appropriate copyright notice and disclaimer of warranty; keep intact
-all the notices that refer to this License and to the absence of any
-warranty; and distribute a copy of this License along with the
-Library.
-
- You may charge a fee for the physical act of transferring a copy,
-and you may at your option offer warranty protection in exchange for a
-fee.
-
- 2. You may modify your copy or copies of the Library or any portion
-of it, thus forming a work based on the Library, and copy and
-distribute such modifications or work under the terms of Section 1
-above, provided that you also meet all of these conditions:
-
- a) The modified work must itself be a software library.
-
- b) You must cause the files modified to carry prominent notices
- stating that you changed the files and the date of any change.
-
- c) You must cause the whole of the work to be licensed at no
- charge to all third parties under the terms of this License.
-
- d) If a facility in the modified Library refers to a function or a
- table of data to be supplied by an application program that uses
- the facility, other than as an argument passed when the facility
- is invoked, then you must make a good faith effort to ensure that,
- in the event an application does not supply such function or
- table, the facility still operates, and performs whatever part of
- its purpose remains meaningful.
-
- (For example, a function in a library to compute square roots has
- a purpose that is entirely well-defined independent of the
- application. Therefore, Subsection 2d requires that any
- application-supplied function or table used by this function must
- be optional: if the application does not supply it, the square
- root function must still compute square roots.)
-
-These requirements apply to the modified work as a whole. If
-identifiable sections of that work are not derived from the Library,
-and can be reasonably considered independent and separate works in
-themselves, then this License, and its terms, do not apply to those
-sections when you distribute them as separate works. But when you
-distribute the same sections as part of a whole which is a work based
-on the Library, the distribution of the whole must be on the terms of
-this License, whose permissions for other licensees extend to the
-entire whole, and thus to each and every part regardless of who wrote
-it.
-
-Thus, it is not the intent of this section to claim rights or contest
-your rights to work written entirely by you; rather, the intent is to
-exercise the right to control the distribution of derivative or
-collective works based on the Library.
-
-In addition, mere aggregation of another work not based on the Library
-with the Library (or with a work based on the Library) on a volume of
-a storage or distribution medium does not bring the other work under
-the scope of this License.
-
- 3. You may opt to apply the terms of the ordinary GNU General Public
-License instead of this License to a given copy of the Library. To do
-this, you must alter all the notices that refer to this License, so
-that they refer to the ordinary GNU General Public License, version 2,
-instead of to this License. (If a newer version than version 2 of the
-ordinary GNU General Public License has appeared, then you can specify
-that version instead if you wish.) Do not make any other change in
-these notices.
-
- Once this change is made in a given copy, it is irreversible for
-that copy, so the ordinary GNU General Public License applies to all
-subsequent copies and derivative works made from that copy.
-
- This option is useful when you wish to copy part of the code of
-the Library into a program that is not a library.
-
- 4. You may copy and distribute the Library (or a portion or
-derivative of it, under Section 2) in object code or executable form
-under the terms of Sections 1 and 2 above provided that you accompany
-it with the complete corresponding machine-readable source code, which
-must be distributed under the terms of Sections 1 and 2 above on a
-medium customarily used for software interchange.
-
- If distribution of object code is made by offering access to copy
-from a designated place, then offering equivalent access to copy the
-source code from the same place satisfies the requirement to
-distribute the source code, even though third parties are not
-compelled to copy the source along with the object code.
-
- 5. A program that contains no derivative of any portion of the
-Library, but is designed to work with the Library by being compiled or
-linked with it, is called a "work that uses the Library". Such a
-work, in isolation, is not a derivative work of the Library, and
-therefore falls outside the scope of this License.
-
- However, linking a "work that uses the Library" with the Library
-creates an executable that is a derivative of the Library (because it
-contains portions of the Library), rather than a "work that uses the
-library". The executable is therefore covered by this License.
-Section 6 states terms for distribution of such executables.
-
- When a "work that uses the Library" uses material from a header file
-that is part of the Library, the object code for the work may be a
-derivative work of the Library even though the source code is not.
-Whether this is true is especially significant if the work can be
-linked without the Library, or if the work is itself a library. The
-threshold for this to be true is not precisely defined by law.
-
- If such an object file uses only numerical parameters, data
-structure layouts and accessors, and small macros and small inline
-functions (ten lines or less in length), then the use of the object
-file is unrestricted, regardless of whether it is legally a derivative
-work. (Executables containing this object code plus portions of the
-Library will still fall under Section 6.)
-
- Otherwise, if the work is a derivative of the Library, you may
-distribute the object code for the work under the terms of Section 6.
-Any executables containing that work also fall under Section 6,
-whether or not they are linked directly with the Library itself.
-
- 6. As an exception to the Sections above, you may also combine or
-link a "work that uses the Library" with the Library to produce a
-work containing portions of the Library, and distribute that work
-under terms of your choice, provided that the terms permit
-modification of the work for the customer's own use and reverse
-engineering for debugging such modifications.
-
- You must give prominent notice with each copy of the work that the
-Library is used in it and that the Library and its use are covered by
-this License. You must supply a copy of this License. If the work
-during execution displays copyright notices, you must include the
-copyright notice for the Library among them, as well as a reference
-directing the user to the copy of this License. Also, you must do one
-of these things:
-
- a) Accompany the work with the complete corresponding
- machine-readable source code for the Library including whatever
- changes were used in the work (which must be distributed under
- Sections 1 and 2 above); and, if the work is an executable linked
- with the Library, with the complete machine-readable "work that
- uses the Library", as object code and/or source code, so that the
- user can modify the Library and then relink to produce a modified
- executable containing the modified Library. (It is understood
- that the user who changes the contents of definitions files in the
- Library will not necessarily be able to recompile the application
- to use the modified definitions.)
-
- b) Use a suitable shared library mechanism for linking with the
- Library. A suitable mechanism is one that (1) uses at run time a
- copy of the library already present on the user's computer system,
- rather than copying library functions into the executable, and (2)
- will operate properly with a modified version of the library, if
- the user installs one, as long as the modified version is
- interface-compatible with the version that the work was made with.
-
- c) Accompany the work with a written offer, valid for at least
- three years, to give the same user the materials specified in
- Subsection 6a, above, for a charge no more than the cost of
- performing this distribution.
-
- d) If distribution of the work is made by offering access to copy
- from a designated place, offer equivalent access to copy the above
- specified materials from the same place.
-
- e) Verify that the user has already received a copy of these
- materials or that you have already sent this user a copy.
-
- For an executable, the required form of the "work that uses the
-Library" must include any data and utility programs needed for
-reproducing the executable from it. However, as a special exception,
-the materials to be distributed need not include anything that is
-normally distributed (in either source or binary form) with the major
-components (compiler, kernel, and so on) of the operating system on
-which the executable runs, unless that component itself accompanies
-the executable.
-
- It may happen that this requirement contradicts the license
-restrictions of other proprietary libraries that do not normally
-accompany the operating system. Such a contradiction means you cannot
-use both them and the Library together in an executable that you
-distribute.
-
- 7. You may place library facilities that are a work based on the
-Library side-by-side in a single library together with other library
-facilities not covered by this License, and distribute such a combined
-library, provided that the separate distribution of the work based on
-the Library and of the other library facilities is otherwise
-permitted, and provided that you do these two things:
-
- a) Accompany the combined library with a copy of the same work
- based on the Library, uncombined with any other library
- facilities. This must be distributed under the terms of the
- Sections above.
-
- b) Give prominent notice with the combined library of the fact
- that part of it is a work based on the Library, and explaining
- where to find the accompanying uncombined form of the same work.
-
- 8. You may not copy, modify, sublicense, link with, or distribute
-the Library except as expressly provided under this License. Any
-attempt otherwise to copy, modify, sublicense, link with, or
-distribute the Library is void, and will automatically terminate your
-rights under this License. However, parties who have received copies,
-or rights, from you under this License will not have their licenses
-terminated so long as such parties remain in full compliance.
-
- 9. You are not required to accept this License, since you have not
-signed it. However, nothing else grants you permission to modify or
-distribute the Library or its derivative works. These actions are
-prohibited by law if you do not accept this License. Therefore, by
-modifying or distributing the Library (or any work based on the
-Library), you indicate your acceptance of this License to do so, and
-all its terms and conditions for copying, distributing or modifying
-the Library or works based on it.
-
- 10. Each time you redistribute the Library (or any work based on the
-Library), the recipient automatically receives a license from the
-original licensor to copy, distribute, link with or modify the Library
-subject to these terms and conditions. You may not impose any further
-restrictions on the recipients' exercise of the rights granted herein.
-You are not responsible for enforcing compliance by third parties with
-this License.
-
- 11. If, as a consequence of a court judgment or allegation of patent
-infringement or for any other reason (not limited to patent issues),
-conditions are imposed on you (whether by court order, agreement or
-otherwise) that contradict the conditions of this License, they do not
-excuse you from the conditions of this License. If you cannot
-distribute so as to satisfy simultaneously your obligations under this
-License and any other pertinent obligations, then as a consequence you
-may not distribute the Library at all. For example, if a patent
-license would not permit royalty-free redistribution of the Library by
-all those who receive copies directly or indirectly through you, then
-the only way you could satisfy both it and this License would be to
-refrain entirely from distribution of the Library.
-
-If any portion of this section is held invalid or unenforceable under
-any particular circumstance, the balance of the section is intended to
-apply, and the section as a whole is intended to apply in other
-circumstances.
-
-It is not the purpose of this section to induce you to infringe any
-patents or other property right claims or to contest validity of any
-such claims; this section has the sole purpose of protecting the
-integrity of the free software distribution system which is
-implemented by public license practices. Many people have made
-generous contributions to the wide range of software distributed
-through that system in reliance on consistent application of that
-system; it is up to the author/donor to decide if he or she is willing
-to distribute software through any other system and a licensee cannot
-impose that choice.
-
-This section is intended to make thoroughly clear what is believed to
-be a consequence of the rest of this License.
-
- 12. If the distribution and/or use of the Library is restricted in
-certain countries either by patents or by copyrighted interfaces, the
-original copyright holder who places the Library under this License
-may add an explicit geographical distribution limitation excluding those
-countries, so that distribution is permitted only in or among
-countries not thus excluded. In such case, this License incorporates
-the limitation as if written in the body of this License.
-
- 13. The Free Software Foundation may publish revised and/or new
-versions of the Lesser General Public License from time to time.
-Such new versions will be similar in spirit to the present version,
-but may differ in detail to address new problems or concerns.
-
-Each version is given a distinguishing version number. If the Library
-specifies a version number of this License which applies to it and
-"any later version", you have the option of following the terms and
-conditions either of that version or of any later version published by
-the Free Software Foundation. If the Library does not specify a
-license version number, you may choose any version ever published by
-the Free Software Foundation.
-
- 14. If you wish to incorporate parts of the Library into other free
-programs whose distribution conditions are incompatible with these,
-write to the author to ask for permission. For software which is
-copyrighted by the Free Software Foundation, write to the Free
-Software Foundation; we sometimes make exceptions for this. Our
-decision will be guided by the two goals of preserving the free status
-of all derivatives of our free software and of promoting the sharing
-and reuse of software generally.
-
- NO WARRANTY
-
- 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
-WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
-EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
-OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY
-KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE
-IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
-PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE
-LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
-THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
-
- 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
-WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
-AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU
-FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
-CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE
-LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING
-RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A
-FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
-SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
-DAMAGES.
-
- END OF TERMS AND CONDITIONS
-
- How to Apply These Terms to Your New Libraries
-
- If you develop a new library, and you want it to be of the greatest
-possible use to the public, we recommend making it free software that
-everyone can redistribute and change. You can do so by permitting
-redistribution under these terms (or, alternatively, under the terms
-of the ordinary General Public License).
-
- To apply these terms, attach the following notices to the library.
-It is safest to attach them to the start of each source file to most
-effectively convey the exclusion of warranty; and each file should
-have at least the "copyright" line and a pointer to where the full
-notice is found.
-
-
- <one line to give the library's name and a brief idea of what it does.>
- Copyright (C) <year> <name of author>
-
- 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 library; if not, write to the Free Software
- Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
-
-Also add information on how to contact you by electronic and paper mail.
-
-You should also get your employer (if you work as a programmer) or
-your school, if any, to sign a "copyright disclaimer" for the library,
-if necessary. Here is a sample; alter the names:
-
- Yoyodyne, Inc., hereby disclaims all copyright interest in the
- library `Frob' (a library for tweaking knobs) written by James
- Random Hacker.
-
- <signature of Ty Coon>, 1 April 1990
- Ty Coon, President of Vice
-
-That's all there is to it!
-
-
diff --git a/kcharselect-generate-datafile.py b/kcharselect-generate-datafile.py
deleted file mode 100755
index d074b74..0000000
--- a/kcharselect-generate-datafile.py
+++ /dev/null
@@ -1,879 +0,0 @@
-#!/usr/bin/python
-# -*- coding: utf-8 -*-
-#
-# This script generates a data file containing all Unicode information needed
-# by KCharSelect.
-#
-##############################################################################
-# Copyright (C) 2007 Daniel Laidig <d.laidig@gmx.de>
-# Copyright (C) 2016 John Zaitseff <J.Zaitseff@zap.org.au>
-#
-# This script is free software; you can redistribute it and/or modify it under
-# the terms of the GNU Library General Public License as published by the Free
-# Software Foundation; either version 2 of the License, or (at your option)
-# any later version.
-#
-# This script 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 Library General Public
-# License for more details.
-#
-# You should have received a copy of the GNU Library General Public License
-# along with this library; see the file COPYING.LIB. If not, write to the
-# Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
-# 02110-1301, USA.
-##############################################################################
-#
-# The current directory must contain the following files that can be found at
-# http://www.unicode.org/Public/UNIDATA/:
-# - UnicodeData.txt
-# - Unihan_Readings.txt (you need to uncompress it from Unihan.zip)
-# - NamesList.txt
-# - Blocks.txt
-#
-# The generated file is named "kcharselect-data" and has to be put in
-# kwidgetsaddons/src. Additionally a translation dummy named
-# "kcharselect-translation.cpp" is generated and has to be placed in the same
-# directory.
-#
-# FILE STRUCTURE
-#
-# The generated file is a binary file. The first 40 bytes are the header and
-# contain the position of each part of the file. Each entry is uint32.
-#
-# pos content
-# 0 names strings begin
-# 4 names offsets begin
-# 8 details strings begin
-# 12 details offsets begin
-# 16 block strings begin
-# 20 block offsets begin
-# 24 section strings begin
-# 28 section offsets begin
-# 32 unihan strings begin
-# 36 unihan offsets begin
-#
-# The string parts always contain all strings in a row, followed by a 0x00
-# byte. There is one exception: The data for seeAlso in details is only 2
-# bytes (as is always is _one_ unicode character) and _not_ followed by a 0x00
-# byte.
-#
-# The offset parts contain entries with a fixed length. Unicode characters
-# are always uint16 and offsets uint32. Offsets are positions in the data
-# file.
-#
-# names_offsets:
-# each entry 6 bytes
-# 16bit: unicode
-# 32bit: offset to name in names_strings
-#
-# names_strings:
-# the first byte is the category (same values as QChar::Category),
-# directly followed by the character name (terminated by 0x00)
-#
-# nameslist_offsets:
-# char, alias, alias_count, note, note_count, approxEquiv, approxEquiv_coutn, equiv, equiv_count, seeAlso, seeAlso_count
-# 16 32 8 32 8 32 8 32 8 32 8
-# => each entry 27 bytes
-#
-# blocks_offsets:
-# each entry 4 bytes
-# 16bit: start unicode
-# 16bit: end unicode
-# Note that there is no string offset.
-#
-# section_offsets:
-# each entry 4 bytes
-# 16bit: section offset
-# 16bit: block offset
-# Note that these offsets are _not_ positions in the data file but indexes.
-# For example 0x0403 means the fourth section includes the third block.
-#
-# unihan_offsets:
-# each entry 30 bytes
-# 16bit: unicode
-# 32bit: offset to unihan_strings for Definition
-# 32bit: offset to unihan_strings for Cantonese
-# 32bit: offset to unihan_strings for Mandarin
-# 32bit: offset to unihan_strings for Tang
-# 32bit: offset to unihan_strings for Korean
-# 32bit: offset to unihan_strings for JapaneseKun
-# 32bit: offset to unihan_strings for JapaneseOn
-
-from struct import *
-import sys
-import re
-import StringIO
-
-# Based on http://www.unicode.org/charts/, updated for Unicode 9.0
-sectiondata = '''
-SECTION European Scripts
-Basic Latin
-Latin-1 Supplement
-Latin Extended-A
-Latin Extended-B
-Latin Extended-C
-Latin Extended-D
-Latin Extended-E
-Latin Extended Additional
-Armenian
-Coptic
-Cyrillic
-Cyrillic Supplement
-Cyrillic Extended-A
-Cyrillic Extended-B
-Cyrillic Extended-C
-Georgian
-Georgian Supplement
-Glagolitic
-Greek and Coptic
-Greek Extended
-Ogham
-Runic
-
-SECTION African Scripts
-Bamum
-Ethiopic
-Ethiopic Supplement
-Ethiopic Extended
-Ethiopic Extended-A
-NKo
-Tifinagh
-Vai
-
-SECTION Middle Eastern Scripts
-Arabic
-Arabic Supplement
-Arabic Extended-A
-Arabic Presentation Forms-A
-Arabic Presentation Forms-B
-Hebrew
-Mandaic
-Samaritan
-Syriac
-
-SECTION Central Asian Scripts
-Mongolian
-Phags-pa
-Tibetan
-
-SECTION South Asian Scripts
-Bengali
-Common Indic Number Forms
-Devanagari
-Devanagari Extended
-Gujarati
-Gurmukhi
-Kannada
-Lepcha
-Limbu
-Malayalam
-Meetei Mayek
-Meetei Mayek Extensions
-Ol Chiki
-Oriya
-Saurashtra
-Sinhala
-Syloti Nagri
-Tamil
-Telugu
-Thaana
-Vedic Extensions
-
-SECTION Southeast Asian Scripts
-Cham
-Kayah Li
-Khmer
-Khmer Symbols
-Lao
-Myanmar
-Myanmar Extended-A
-Myanmar Extended-B
-New Tai Lue
-Tai Le
-Tai Tham
-Tai Viet
-Thai
-
-SECTION Indonesia and Oceania Scripts
-Balinese
-Batak
-Buginese
-Buhid
-Hanunoo
-Javanese
-Rejang
-Sundanese
-Sundanese Supplement
-Tagalog
-Tagbanwa
-
-SECTION East Asian Scripts
-Bopomofo
-Bopomofo Extended
-CJK Unified Ideographs
-CJK Unified Ideographs Extension A
-CJK Compatibility
-CJK Compatibility Ideographs
-CJK Compatibility Forms
-CJK Radicals Supplement
-CJK Strokes
-CJK Symbols and Punctuation
-Enclosed CJK Letters and Months
-Hangul Jamo
-Hangul Jamo Extended-A
-Hangul Jamo Extended-B
-Hangul Compatibility Jamo
-Hangul Syllables
-Hiragana
-Ideographic Description Characters
-Kanbun
-Kangxi Radicals
-Katakana
-Katakana Phonetic Extensions
-Lisu
-Yi Radicals
-Yi Syllables
-
-SECTION American Scripts
-Cherokee
-Cherokee Supplement
-Unified Canadian Aboriginal Syllabics
-Unified Canadian Aboriginal Syllabics Extended
-
-SECTION Symbols
-General Punctuation
-Alchemical Symbols
-Braille Patterns
-Control Pictures
-Currency Symbols
-Dingbats
-Domino Tiles
-Emoticons
-Enclosed Alphanumerics
-Enclosed Alphanumeric Supplement
-Enclosed Ideographic Supplement
-Mahjong Tiles
-Miscellaneous Symbols
-Miscellaneous Symbols and Pictographs
-Miscellaneous Technical
-Optical Character Recognition
-Ornamental Dingbats
-Playing Cards
-Small Form Variants
-Supplemental Punctuation
-Supplemental Symbols and Pictographs
-Transport and Map Symbols
-Vertical Forms
-Yijing Hexagram Symbols
-
-SECTION Mathematical Symbols
-Arrows
-Block Elements
-Box Drawing
-Geometric Shapes
-Geometric Shapes Extended
-Letterlike Symbols
-Mathematical Operators
-Miscellaneous Mathematical Symbols-A
-Miscellaneous Mathematical Symbols-B
-Miscellaneous Symbols and Arrows
-Number Forms
-Superscripts and Subscripts
-Supplemental Arrows-A
-Supplemental Arrows-B
-Supplemental Arrows-C
-Supplemental Mathematical Operators
-
-SECTION Phonetic Symbols
-IPA Extensions
-Modifier Tone Letters
-Phonetic Extensions
-Phonetic Extensions Supplement
-Spacing Modifier Letters
-
-SECTION Combining Diacritics
-Combining Diacritical Marks
-Combining Diacritical Marks Extended
-Combining Diacritical Marks Supplement
-Combining Diacritical Marks for Symbols
-Combining Half Marks
-
-SECTION Other
-Alphabetic Presentation Forms
-Halfwidth and Fullwidth Forms
-High Private Use Surrogates
-High Surrogates
-Low Surrogates
-Private Use Area
-Specials
-Variation Selectors
-'''
-
-categoryMap = { # same values as QChar::Category
- "Mn": 1,
- "Mc": 2,
- "Me": 3,
- "Nd": 4,
- "Nl": 5,
- "No": 6,
- "Zs": 7,
- "Zl": 8,
- "Zp": 9,
- "Cc": 10,
- "Cf": 11,
- "Cs": 12,
- "Co": 13,
- "Cn": 14,
- "Lu": 15,
- "Ll": 16,
- "Lt": 17,
- "Lm": 18,
- "Lo": 19,
- "Pc": 20,
- "Pd": 21,
- "Ps": 22,
- "Pe": 23,
- "Pi": 24,
- "Pf": 25,
- "Po": 26,
- "Sm": 27,
- "Sc": 28,
- "Sk": 29,
- "So": 30
-}
-
-
-# Temporary code point remapping
-#
-# Initial SMP support without needing a new data file format
-# - BMP U+Fxxx are remapped to U+Exxx
-# - SMP symbols U+1Fxxx are remapped to U+Fxxx
-# - Private Use Area is limited to U+F000 ... U+F8FF
-
-def remap(char):
- cp = int(char, 16)
- if cp >= 0xE000 and cp <= 0xFFFF:
- return "E"+char[1:]
- if cp >= 0x1F000 and cp <= 0x1FFFF:
- return char[1:]
- return char
-
-class Names:
- def __init__(self):
- self.names = []
- self.controlpos = -1
- def addName(self, uni, name, category):
- self.names.append([uni, name, category])
-
- def calculateStringSize(self):
- size = 0
- hadcontrol = False
- for entry in self.names:
- if entry[1] == "<control>":
- if not hadcontrol:
- size += len(entry[1]) + 2
- hadcontrol = True
- else:
- size += len(entry[1]) + 2
- return size
-
- def calculateOffsetSize(self):
- return len(self.names)*6
-
- def writeStrings(self, out, pos):
- hadcontrol = False
- for entry in self.names:
- if entry[1] == "<control>":
- if not hadcontrol:
- out.write(pack("=b", entry[2]))
- out.write(entry[1] + "\0")
- size = len(entry[1]) + 2
- entry[1] = pos
- self.controlpos = pos
- pos += size
- hadcontrol = True
- else:
- entry[1] = self.controlpos
- else:
- out.write(pack("=b", entry[2]))
- out.write(entry[1] + "\0")
- size = len(entry[1]) + 2
- entry[1] = pos
- pos += size
- return pos
-
- def writeOffsets(self, out, pos):
- for entry in self.names:
- out.write(pack("=HI", int(entry[0], 16), entry[1]))
- pos += 6
- return pos
-
-class Details:
- def __init__(self):
- self.details = {}
- def addEntry(self, char, category, text):
- if not self.details.has_key(char):
- self.details[char] = {}
- if not self.details[char].has_key(category):
- self.details[char][category] = []
- self.details[char][category].append(text)
-
- def calculateStringSize(self):
- size = 0
- for char in self.details.values():
- for cat in char.values():
- for s in cat:
- if type(s) is str:
- size += len(s) + 1
- else:
- size += 2
- return size
-
- def calculateOffsetSize(self):
- return len(self.details)*27
-
- def writeStrings(self, out, pos):
- for char in self.details.values():
- for cat in char.values():
- for i in range(0, len(cat)):
- s = cat[i]
- if type(s) is str:
- out.write(s + "\0")
- size = len(s) + 1
- else:
- out.write(pack("=H", s))
- size = 2
- cat[i] = pos
- pos += size
- return pos
-
- def writeOffsets(self, out, pos):
- for char in self.details.keys():
- alias = 0
- alias_count = 0
- note = 0
- note_count = 0
- approxEquiv = 0
- approxEquiv_count = 0
- equiv = 0
- equiv_count = 0
- seeAlso = 0
- seeAlso_count = 0
- if self.details[char].has_key("alias"):
- alias = self.details[char]["alias"][0]
- alias_count = len(self.details[char]["alias"])
-
- if self.details[char].has_key("note"):
- note = self.details[char]["note"][0]
- note_count = len(self.details[char]["note"])
-
- if self.details[char].has_key("approxEquiv"):
- approxEquiv = self.details[char]["approxEquiv"][0]
- approxEquiv_count = len(self.details[char]["approxEquiv"])
-
- if self.details[char].has_key("equiv"):
- equiv = self.details[char]["equiv"][0]
- equiv_count = len(self.details[char]["equiv"])
-
- if self.details[char].has_key("seeAlso"):
- seeAlso = self.details[char]["seeAlso"][0]
- seeAlso_count = len(self.details[char]["seeAlso"])
-
- out.write(pack("=HIbIbIbIbIb", char, alias, alias_count, note, note_count, approxEquiv, approxEquiv_count, equiv, equiv_count, seeAlso, seeAlso_count))
- pos += 27
-
- return pos
-
-class SectionsBlocks:
- def __init__(self):
- self.sections = []
- self.blocks = []
- self.blockList = []
- self.sectionList = []
-
- def addBlock(self, begin, end, name):
- self.blocks.append([begin, end, name])
- self.blockList.append(name)
-
- def addSection(self, section, block):
- self.sections.append([section, block])
- if not section in self.sectionList:
- self.sectionList.append(section)
-
- def calculateBlockStringSize(self):
- size = 0
- for block in self.blocks:
- size += len(block[2]) + 1
- return size
-
- def calculateBlockOffsetSize(self):
- return len(self.blocks) * 4
-
- def calculateSectionStringSize(self):
- size = 0
- lastsection = ""
- for section in self.sections:
- if section[0] != lastsection:
- size += len(section[0]) + 1
- lastsection = section[0]
- return size
-
- def calculateSectionOffsetSize(self):
- return len(self.sections) * 4
-
- def writeBlockStrings(self, out, pos):
- index = 0
- for block in self.blocks:
- out.write(block[2] + "\0")
- size = len(block[2]) + 1
- found = False
- for section in self.sections:
- if section[1] == block[2]:
- print "found", section
- section[1] = index
- found = True
- if not found:
- print "Error: Did not find any category for block \""+block[2]+"\""
- sys.exit(1)
- block[2] = index
- pos += size
- index += 1
- return pos
-
- def writeBlockOffsets(self, out, pos):
- for block in self.blocks:
- out.write(pack("=HH", int(block[0], 16), int(block[1], 16)))
- pos += 4
- return pos
-
- def writeSectionStrings(self, out, pos):
- lastsection = ""
- lastpos = 0
- index = -1
- for section in self.sections:
- if section[0] != lastsection:
- index += 1
- lastsection = section[0]
- out.write(section[0] + "\0")
- size = len(section[0]) + 1
- section[0] = index
- lastpos = pos
- pos += size
- else:
- section[0] = index
- return pos
-
- def writeSectionOffsets(self, out, pos):
- for section in self.sections:
- out.write(pack("=HH", section[0], section[1]))
- pos += 4
- return pos
-
- def getBlockList(self):
- return self.blockList
-
- def getSectionList(self):
- return self.sectionList
-
-class Unihan:
- def __init__(self):
- self.unihan = {}
-
- def addUnihan(self, uni, category, value):
- uni = int(uni, 16)
- if category != "kDefinition" and category != "kCantonese" and category != "kMandarin" and category != "kTang" and category != "kKorean" and category != "kJapaneseKun" and category != "kJapaneseOn":
- return
- if not self.unihan.has_key(uni):
- self.unihan[uni] = [None, None, None, None, None, None, None]
- if category == "kDefinition":
- self.unihan[uni][0] = value
- elif category == "kCantonese":
- self.unihan[uni][1] = value
- elif category == "kMandarin":
- self.unihan[uni][2] = value
- elif category == "kTang":
- self.unihan[uni][3] = value
- elif category == "kKorean":
- self.unihan[uni][4] = value
- elif category == "kJapaneseKun":
- self.unihan[uni][5] = value
- elif category == "kJapaneseOn":
- self.unihan[uni][6] = value
-
- def calculateStringSize(self):
- size = 0
- for char in self.unihan.keys():
- for entry in self.unihan[char]:
- if entry != None:
- size += len(entry) + 1
- return size
-
- def calculateOffsetSize(self):
- return len(self.unihan) * 30
-
- def writeStrings(self, out, pos):
- for char in self.unihan.keys():
- for i in range(0, 7):
- if self.unihan[char][i] != None:
- out.write(self.unihan[char][i] + "\0")
- size = len(self.unihan[char][i]) + 1
- self.unihan[char][i] = pos
- pos += size
- return pos
-
- def writeOffsets(self, out, pos):
- for char in self.unihan.keys():
- out.write(pack("=H", char))
- for i in range(0, 7):
- if self.unihan[char][i] != None:
- out.write(pack("=I", self.unihan[char][i]))
- else:
- out.write(pack("=I", 0))
- pos += 30
- return pos
-
-class Parser:
- def parseUnicodeData(self, inUnicodeData, names):
- regexp = re.compile(r'^([^;]+);([^;]+);([^;]+)')
- for line in inUnicodeData:
- line = line[:-1]
- m = regexp.match(line)
- if not m:
- continue
- uni = remap(m.group(1))
- name = m.group(2)
- category = m.group(3)
- if len(uni) > 4:
- continue
- names.addName(uni, name, categoryMap[category])
-
- def parseDetails(self, inNamesList, details):
- invalidRegexp = re.compile(r'^@')
- unicodeRegexp = re.compile(r'^([0-9A-F]+)')
-
- aliasRegexp = re.compile(r'^\s+=\s+(.+)$') #equal
- seeAlsoRegexp1 = re.compile(r'^\s+x\s+.*\s([0-9A-F]{4,6})\)$') #ex
- seeAlsoRegexp2 = re.compile(r'^\s+x\s+([0-9A-F]{4,6})$') #ex
- noteRegexp = re.compile(r'^\s+\*\s+(.+)$') #star
- approxEquivalentRegexp = re.compile(r'^\s+#\s+(.+)$') #pound
- equivalentRegexp = re.compile(r'^\s+:\s+(.+)$') #colon
-
- drop = 0
- currChar = 0
-
- for line in inNamesList:
- line = line[:-1]
- m1 = unicodeRegexp.match(line)
- m2 = aliasRegexp.match(line)
- m3 = noteRegexp.match(line)
- m4 = approxEquivalentRegexp.match(line)
- m5 = equivalentRegexp.match(line)
- m6 = seeAlsoRegexp1.match(line)
- m7 = seeAlsoRegexp2.match(line)
- if invalidRegexp.match(line):
- continue
- elif m1:
- mg1 = remap(m1.group(1))
- currChar = int(mg1, 16)
- if len(mg1) > 4:
- drop = 1
- continue
- elif drop == 1:
- continue
- elif m2:
- value = m2.group(1)
- details.addEntry(currChar, "alias", value)
- elif m3:
- value = m3.group(1)
- details.addEntry(currChar, "note", value)
- elif m4:
- value = m4.group(1)
- details.addEntry(currChar, "approxEquiv", value)
- elif m5:
- value = m5.group(1)
- details.addEntry(currChar, "equiv", value)
- elif m6:
- value = int(remap(m6.group(1)), 16)
- if value < 0x10000:
- details.addEntry(currChar, "seeAlso", value)
- elif m7:
- value = int(remap(m7.group(1)), 16)
- if value < 0x10000:
- details.addEntry(currChar, "seeAlso", value)
- def parseBlocks(self, inBlocks, sectionsBlocks):
- regexp = re.compile(r'^([0-9A-F]+)\.\.([0-9A-F]+); (.+)$')
- for line in inBlocks:
- line = line[:-1]
- m = regexp.match(line)
- if not m:
- continue
- m1 = remap(m.group(1))
- m2 = remap(m.group(2))
- if len(m1) > 4:
- continue
- sectionsBlocks.addBlock(m1, m2, m.group(3))
- def parseSections(self, inSections, sectionsBlocks):
- currSection = ""
- for line in inSections:
- line = line[:-1]
- if len(line) == 0:
- continue
- temp = line.split(" ")
- if temp[0] == "SECTION":
- currSection = line[8:]
- elif currSection != "":
- sectionsBlocks.addSection(currSection, line)
- else:
- print "error in data file"
- sys.exit(1)
- def parseUnihan(self, inUnihan, unihan):
- regexp = re.compile(r'^U\+([0-9A-F]+)\s+([^\s]+)\s+(.+)$')
- count = 0
- for line in inUnihan:
- if count % 100000 == 0:
- print "\b.",; sys.stdout.flush()
- count += 1
- line = line[:-1]
- m = regexp.match(line)
- if not m:
- continue
- if len(remap(m.group(1))) <= 4:
- unihan.addUnihan(remap(m.group(1)), m.group(2), m.group(3))
-
-def writeTranslationDummy(out, data):
- out.write("""/* This file is part of the KDE libraries
-
- Copyright (C) 2007 Daniel Laidig <d.laidig@gmx.de>
- Copyright (C) 2016 John Zaitseff <J.Zaitseff@zap.org.au>
-
- This library is free software; you can redistribute it and/or modify it
- under the terms of the GNU Library General Public License as published by
- the Free Software Foundation; either version 2 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 Library General Public
- License for more details.
-
- You should have received a copy of the GNU Library General Public License
- along with this library; see the file COPYING.LIB. If not, write to the
- Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
- MA 02110-1301, USA.
-
- This file is autogenerated by kcharselect/kcharselect-generate-datafile.py
-*/\n\n""")
- for group in data:
- for entry in group[1]:
- out.write("QT_TRANSLATE_NOOP3(\"KCharSelectData\", \""+entry+"\", \""+group[0]+"\");\n")
-
-out = open("kcharselect-data", "wb")
-outTranslationDummy = open("kcharselect-translation.cpp", "wb")
-
-inUnicodeData = open("UnicodeData.txt", "r")
-inNamesList = open("NamesList.txt", "r")
-inBlocks = open("Blocks.txt", "r")
-inSections = StringIO.StringIO(sectiondata)
-inUnihan = open("Unihan_Readings.txt", "r")
-
-if calcsize('=H') != 2 or calcsize('=I') != 4:
- print "Error: Sizes of ushort and uint are not 16 and 32 bit as expected"
- sys.exit(1)
-
-names = Names()
-details = Details()
-sectionsBlocks = SectionsBlocks()
-unihan = Unihan()
-
-parser = Parser()
-
-print "========== parsing files ==================="
-parser.parseUnicodeData(inUnicodeData, names)
-print ".",; sys.stdout.flush()
-parser.parseDetails(inNamesList, details)
-print "\b.",; sys.stdout.flush()
-parser.parseBlocks(inBlocks, sectionsBlocks)
-print "\b.",; sys.stdout.flush()
-parser.parseSections(inSections, sectionsBlocks)
-print "\b.",; sys.stdout.flush()
-parser.parseUnihan(inUnihan, unihan)
-print "\b.",; sys.stdout.flush()
-
-print "done."
-
-pos = 0
-
-#write header, size: 40 bytes
-print "========== writing header =================="
-out.write(pack("=I", 40))
-print "names strings begin", 40
-
-namesOffsetBegin = names.calculateStringSize() + 40
-out.write(pack("=I", namesOffsetBegin))
-print "names offsets begin", namesOffsetBegin
-
-detailsStringBegin = namesOffsetBegin + names.calculateOffsetSize()
-out.write(pack("=I", detailsStringBegin))
-print "details strings begin", detailsStringBegin
-
-detailsOffsetBegin = detailsStringBegin + details.calculateStringSize()
-out.write(pack("=I", detailsOffsetBegin))
-print "details offsets begin", detailsOffsetBegin
-
-blocksStringBegin = detailsOffsetBegin + details.calculateOffsetSize()
-out.write(pack("=I", blocksStringBegin))
-print "block strings begin", blocksStringBegin
-
-blocksOffsetBegin = blocksStringBegin + sectionsBlocks.calculateBlockStringSize()
-out.write(pack("=I", blocksOffsetBegin))
-print "block offsets begin", blocksOffsetBegin
-
-sectionStringBegin = blocksOffsetBegin + sectionsBlocks.calculateBlockOffsetSize()
-out.write(pack("=I", sectionStringBegin))
-print "section strings begin", sectionStringBegin
-
-sectionOffsetBegin = sectionStringBegin + sectionsBlocks.calculateSectionStringSize()
-out.write(pack("=I", sectionOffsetBegin))
-print "section offsets begin", sectionOffsetBegin
-
-unihanStringBegin = sectionOffsetBegin + sectionsBlocks.calculateSectionOffsetSize()
-out.write(pack("=I", unihanStringBegin))
-print "unihan strings begin", unihanStringBegin
-
-unihanOffsetBegin = unihanStringBegin + unihan.calculateStringSize()
-out.write(pack("=I", unihanOffsetBegin))
-print "unihan offsets begin", unihanOffsetBegin
-
-end = unihanOffsetBegin + unihan.calculateOffsetSize()
-print "end should be", end
-
-pos += 40
-
-print "========== writing data ===================="
-
-pos = names.writeStrings(out, pos)
-print "names strings written, position", pos
-pos = names.writeOffsets(out, pos)
-print "names offsets written, position", pos
-pos = details.writeStrings(out, pos)
-print "details strings written, position", pos
-pos = details.writeOffsets(out, pos)
-print "details offsets written, position", pos
-pos = sectionsBlocks.writeBlockStrings(out, pos)
-print "block strings written, position", pos
-pos = sectionsBlocks.writeBlockOffsets(out, pos)
-print "block offsets written, position", pos
-pos = sectionsBlocks.writeSectionStrings(out, pos)
-print "section strings written, position", pos
-pos = sectionsBlocks.writeSectionOffsets(out, pos)
-print "section offsets written, position", pos
-pos = unihan.writeStrings(out, pos)
-print "unihan strings written, position", pos
-pos = unihan.writeOffsets(out, pos)
-print "unihan offsets written, position", pos
-
-print "========== writing translation dummy ======"
-translationData = [["KCharSelect section name", sectionsBlocks.getSectionList()], ["KCharselect unicode block name",sectionsBlocks.getBlockList()]]
-writeTranslationDummy(outTranslationDummy, translationData)
-print "done. make sure to copy both kcharselect-data and kcharselect-translation.cpp."