lotobo/unicode-tools
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 2 Wiki Activity

Release Unicode Tools 0.1.0

Browse Source
This commit is contained in:
zemion
2026-09-01 02:38:25 +02:00
commit 8d8147d80e
75 changed files with 23916 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
.gitignore
+10
View File
@@ -0,0 +1,10 @@
node_modules/
.cache/
dist/
release/*.zip
release/*.zip.sha256
coverage/
playwright-report/
test-results/
*.tsbuildinfo
.DS_Store
.npmrc
+1
View File
@@ -0,0 +1 @@
@add-ideas:registry=https://git.add-ideas.de/api/packages/lotobo/npm/
.prettierignore
+1
View File
@@ -0,0 +1 @@
public/data/*.json
CHANGELOG.md
+13
View File
@@ -0,0 +1,13 @@
# Changelog
## 0.1.0 - 2026-09-01
- Added the initial local-first Unicode Tools workbench.
- Added a worker-backed Unicode 17.0 character, sequence and emoji catalog
generated from seven SHA-256-pinned Unicode Consortium inputs.
- Added character properties, optional Unihan details, collections, copy tools,
exact code-point/UTF-8/UTF-16 inspection and scalar-value decoding.
- Added normalization comparison and bounded UTS #39 confusable/mixed-script
analysis with explicit non-verdict language.
- Added auditable source identity, local-only operation, bounded input handling,
offline shell and deterministic release packaging.
CONTRIBUTING.md
+3
View File
@@ -0,0 +1,3 @@
# Contributing
Run `npm ci`, `npm run check`, and `npm run test:browser` before proposing a change. Keep processing local, preserve explicit limits, and include fixtures for every parser boundary.
LICENSE
+674
View File
@@ -0,0 +1,674 @@
GNU GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The GNU General Public License is a free, copyleft license for
software and other kinds of works.
The licenses for most software and other practical works are designed
to take away your freedom to share and change the works. By contrast,
the GNU General Public License is intended to guarantee your freedom to
share and change all versions of a program--to make sure it remains free
software for all its users. We, the Free Software Foundation, use the
GNU General Public License for most of our software; it applies also to
any other work released this way by its authors. You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, 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
them if you wish), that you receive source code or can get it if you
want it, that you can change the software or use pieces of it in new
free programs, and that you know you can do these things.
To protect your rights, we need to prevent others from denying you
these rights or asking you to surrender the rights. Therefore, you have
certain responsibilities if you distribute copies of the software, or if
you modify it: responsibilities to respect the freedom of others.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must pass on to the recipients the same
freedoms that you received. You must make sure that they, too, receive
or can get the source code. And you must show them these terms so they
know their rights.
Developers that use the GNU GPL protect your rights with two steps:
(1) assert copyright on the software, and (2) offer you this License
giving you legal permission to copy, distribute and/or modify it.
For the developers' and authors' protection, the GPL clearly explains
that there is no warranty for this free software. For both users' and
authors' sake, the GPL requires that modified versions be marked as
changed, so that their problems will not be attributed erroneously to
authors of previous versions.
Some devices are designed to deny users access to install or run
modified versions of the software inside them, although the manufacturer
can do so. This is fundamentally incompatible with the aim of
protecting users' freedom to change the software. The systematic
pattern of such abuse occurs in the area of products for individuals to
use, which is precisely where it is most unacceptable. Therefore, we
have designed this version of the GPL to prohibit the practice for those
products. If such problems arise substantially in other domains, we
stand ready to extend this provision to those domains in future versions
of the GPL, as needed to protect the freedom of users.
Finally, every program is threatened constantly by software patents.
States should not allow patents to restrict development and use of
software on general-purpose computers, but in those that do, we wish to
avoid the special danger that patents applied to a free program could
make it effectively proprietary. To prevent this, the GPL assures that
patents cannot be used to render the program non-free.
The precise terms and conditions for copying, distribution and
modification follow.
TERMS AND CONDITIONS
0. Definitions.
"This License" refers to version 3 of the GNU General Public License.
"Copyright" also means copyright-like laws that apply to other kinds of
works, such as semiconductor masks.
"The Program" refers to any copyrightable work licensed under this
License. Each licensee is addressed as "you". "Licensees" and
"recipients" may be individuals or organizations.
To "modify" a work means to copy from or adapt all or part of the work
in a fashion requiring copyright permission, other than the making of an
exact copy. The resulting work is called a "modified version" of the
earlier work or a work "based on" the earlier work.
A "covered work" means either the unmodified Program or a work based
on the Program.
To "propagate" a work means to do anything with it that, without
permission, would make you directly or secondarily liable for
infringement under applicable copyright law, except executing it on a
computer or modifying a private copy. Propagation includes copying,
distribution (with or without modification), making available to the
public, and in some countries other activities as well.
To "convey" a work means any kind of propagation that enables other
parties to make or receive copies. Mere interaction with a user through
a computer network, with no transfer of a copy, is not conveying.
An interactive user interface displays "Appropriate Legal Notices"
to the extent that it includes a convenient and prominently visible
feature that (1) displays an appropriate copyright notice, and (2)
tells the user that there is no warranty for the work (except to the
extent that warranties are provided), that licensees may convey the
work under this License, and how to view a copy of this License. If
the interface presents a list of user commands or options, such as a
menu, a prominent item in the list meets this criterion.
1. Source Code.
The "source code" for a work means the preferred form of the work
for making modifications to it. "Object code" means any non-source
form of a work.
A "Standard Interface" means an interface that either is an official
standard defined by a recognized standards body, or, in the case of
interfaces specified for a particular programming language, one that
is widely used among developers working in that language.
The "System Libraries" of an executable work include anything, other
than the work as a whole, that (a) is included in the normal form of
packaging a Major Component, but which is not part of that Major
Component, and (b) serves only to enable use of the work with that
Major Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form. A
"Major Component", in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system
(if any) on which the executable work runs, or a compiler used to
produce the work, or an object code interpreter used to run it.
The "Corresponding Source" for a work in object code form means all
the source code needed to generate, install, and (for an executable
work) run the object code and to modify the work, including scripts to
control those activities. However, it does not include the work's
System Libraries, or general-purpose tools or generally available free
programs which are used unmodified in performing those activities but
which are not part of the work. For example, Corresponding Source
includes interface definition files associated with source files for
the work, and the source code for shared libraries and dynamically
linked subprograms that the work is specifically designed to require,
such as by intimate data communication or control flow between those
subprograms and other parts of the work.
The Corresponding Source need not include anything that users
can regenerate automatically from other parts of the Corresponding
Source.
The Corresponding Source for a work in source code form is that
same work.
2. Basic Permissions.
All rights granted under this License are granted for the term of
copyright on the Program, and are irrevocable provided the stated
conditions are met. This License explicitly affirms your unlimited
permission to run the unmodified Program. The output from running a
covered work is covered by this License only if the output, given its
content, constitutes a covered work. This License acknowledges your
rights of fair use or other equivalent, as provided by copyright law.
You may make, run and propagate covered works that you do not
convey, without conditions so long as your license otherwise remains
in force. You may convey covered works to others for the sole purpose
of having them make modifications exclusively for you, or provide you
with facilities for running those works, provided that you comply with
the terms of this License in conveying all material for which you do
not control copyright. Those thus making or running the covered works
for you must do so exclusively on your behalf, under your direction
and control, on terms that prohibit them from making any copies of
your copyrighted material outside their relationship with you.
Conveying under any other circumstances is permitted solely under
the conditions stated below. Sublicensing is not allowed; section 10
makes it unnecessary.
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
No covered work shall be deemed part of an effective technological
measure under any applicable law fulfilling obligations under article
11 of the WIPO copyright treaty adopted on 20 December 1996, or
similar laws prohibiting or restricting circumvention of such
measures.
When you convey a covered work, you waive any legal power to forbid
circumvention of technological measures to the extent such circumvention
is effected by exercising rights under this License with respect to
the covered work, and you disclaim any intention to limit operation or
modification of the work as a means of enforcing, against the work's
users, your or third parties' legal rights to forbid circumvention of
technological measures.
4. Conveying Verbatim Copies.
You may convey verbatim copies of the Program's source code as you
receive it, in any medium, provided that you conspicuously and
appropriately publish on each copy an appropriate copyright notice;
keep intact all notices stating that this License and any
non-permissive terms added in accord with section 7 apply to the code;
keep intact all notices of the absence of any warranty; and give all
recipients a copy of this License along with the Program.
You may charge any price or no price for each copy that you convey,
and you may offer support or warranty protection for a fee.
5. Conveying Modified Source Versions.
You may convey a work based on the Program, or the modifications to
produce it from the Program, in the form of source code under the
terms of section 4, provided that you also meet all of these conditions:
a) The work must carry prominent notices stating that you modified
it, and giving a relevant date.
b) The work must carry prominent notices stating that it is
released under this License and any conditions added under section
7. This requirement modifies the requirement in section 4 to
"keep intact all notices".
c) You must license the entire work, as a whole, under this
License to anyone who comes into possession of a copy. This
License will therefore apply, along with any applicable section 7
additional terms, to the whole of the work, and all its parts,
regardless of how they are packaged. This License gives no
permission to license the work in any other way, but it does not
invalidate such permission if you have separately received it.
d) If the work has interactive user interfaces, each must display
Appropriate Legal Notices; however, if the Program has interactive
interfaces that do not display Appropriate Legal Notices, your
work need not make them do so.
A compilation of a covered work with other separate and independent
works, which are not by their nature extensions of the covered work,
and which are not combined with it such as to form a larger program,
in or on a volume of a storage or distribution medium, is called an
"aggregate" if the compilation and its resulting copyright are not
used to limit the access or legal rights of the compilation's users
beyond what the individual works permit. Inclusion of a covered work
in an aggregate does not cause this License to apply to the other
parts of the aggregate.
6. Conveying Non-Source Forms.
You may convey a covered work in object code form under the terms
of sections 4 and 5, provided that you also convey the
machine-readable Corresponding Source under the terms of this License,
in one of these ways:
a) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by the
Corresponding Source fixed on a durable physical medium
customarily used for software interchange.
b) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by a
written offer, valid for at least three years and valid for as
long as you offer spare parts or customer support for that product
model, to give anyone who possesses the object code either (1) a
copy of the Corresponding Source for all the software in the
product that is covered by this License, on a durable physical
medium customarily used for software interchange, for a price no
more than your reasonable cost of physically performing this
conveying of source, or (2) access to copy the
Corresponding Source from a network server at no charge.
c) Convey individual copies of the object code with a copy of the
written offer to provide the Corresponding Source. This
alternative is allowed only occasionally and noncommercially, and
only if you received the object code with such an offer, in accord
with subsection 6b.
d) Convey the object code by offering access from a designated
place (gratis or for a charge), and offer equivalent access to the
Corresponding Source in the same way through the same place at no
further charge. You need not require recipients to copy the
Corresponding Source along with the object code. If the place to
copy the object code is a network server, the Corresponding Source
may be on a different server (operated by you or a third party)
that supports equivalent copying facilities, provided you maintain
clear directions next to the object code saying where to find the
Corresponding Source. Regardless of what server hosts the
Corresponding Source, you remain obligated to ensure that it is
available for as long as needed to satisfy these requirements.
e) Convey the object code using peer-to-peer transmission, provided
you inform other peers where the object code and Corresponding
Source of the work are being offered to the general public at no
charge under subsection 6d.
A separable portion of the object code, whose source code is excluded
from the Corresponding Source as a System Library, need not be
included in conveying the object code work.
A "User Product" is either (1) a "consumer product", which means any
tangible personal property which is normally used for personal, family,
or household purposes, or (2) anything designed or sold for incorporation
into a dwelling. In determining whether a product is a consumer product,
doubtful cases shall be resolved in favor of coverage. For a particular
product received by a particular user, "normally used" refers to a
typical or common use of that class of product, regardless of the status
of the particular user or of the way in which the particular user
actually uses, or expects or is expected to use, the product. A product
is a consumer product regardless of whether the product has substantial
commercial, industrial or non-consumer uses, unless such uses represent
the only significant mode of use of the product.
"Installation Information" for a User Product means any methods,
procedures, authorization keys, or other information required to install
and execute modified versions of a covered work in that User Product from
a modified version of its Corresponding Source. The information must
suffice to ensure that the continued functioning of the modified object
code is in no case prevented or interfered with solely because
modification has been made.
If you convey an object code work under this section in, or with, or
specifically for use in, a User Product, and the conveying occurs as
part of a transaction in which the right of possession and use of the
User Product is transferred to the recipient in perpetuity or for a
fixed term (regardless of how the transaction is characterized), the
Corresponding Source conveyed under this section must be accompanied
by the Installation Information. But this requirement does not apply
if neither you nor any third party retains the ability to install
modified object code on the User Product (for example, the work has
been installed in ROM).
The requirement to provide Installation Information does not include a
requirement to continue to provide support service, warranty, or updates
for a work that has been modified or installed by the recipient, or for
the User Product in which it has been modified or installed. Access to a
network may be denied when the modification itself materially and
adversely affects the operation of the network or violates the rules and
protocols for communication across the network.
Corresponding Source conveyed, and Installation Information provided,
in accord with this section must be in a format that is publicly
documented (and with an implementation available to the public in
source code form), and must require no special password or key for
unpacking, reading or copying.
7. Additional Terms.
"Additional permissions" are terms that supplement the terms of this
License by making exceptions from one or more of its conditions.
Additional permissions that are applicable to the entire Program shall
be treated as though they were included in this License, to the extent
that they are valid under applicable law. If additional permissions
apply only to part of the Program, that part may be used separately
under those permissions, but the entire Program remains governed by
this License without regard to the additional permissions.
When you convey a copy of a covered work, you may at your option
remove any additional permissions from that copy, or from any part of
it. (Additional permissions may be written to require their own
removal in certain cases when you modify the work.) You may place
additional permissions on material, added by you to a covered work,
for which you have or can give appropriate copyright permission.
Notwithstanding any other provision of this License, for material you
add to a covered work, you may (if authorized by the copyright holders of
that material) supplement the terms of this License with terms:
a) Disclaiming warranty or limiting liability differently from the
terms of sections 15 and 16 of this License; or
b) Requiring preservation of specified reasonable legal notices or
author attributions in that material or in the Appropriate Legal
Notices displayed by works containing it; or
c) Prohibiting misrepresentation of the origin of that material, or
requiring that modified versions of such material be marked in
reasonable ways as different from the original version; or
d) Limiting the use for publicity purposes of names of licensors or
authors of the material; or
e) Declining to grant rights under trademark law for use of some
trade names, trademarks, or service marks; or
f) Requiring indemnification of licensors and authors of that
material by anyone who conveys the material (or modified versions of
it) with contractual assumptions of liability to the recipient, for
any liability that these contractual assumptions directly impose on
those licensors and authors.
All other non-permissive additional terms are considered "further
restrictions" within the meaning of section 10. If the Program as you
received it, or any part of it, contains a notice stating that it is
governed by this License along with a term that is a further
restriction, you may remove that term. If a license document contains
a further restriction but permits relicensing or conveying under this
License, you may add to a covered work material governed by the terms
of that license document, provided that the further restriction does
not survive such relicensing or conveying.
If you add terms to a covered work in accord with this section, you
must place, in the relevant source files, a statement of the
additional terms that apply to those files, or a notice indicating
where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the
form of a separately written license, or stated as exceptions;
the above requirements apply either way.
8. Termination.
You may not propagate or modify a covered work except as expressly
provided under this License. Any attempt otherwise to propagate or
modify it is void, and will automatically terminate your rights under
this License (including any patent licenses granted under the third
paragraph of section 11).
However, if you cease all violation of this License, then your
license from a particular copyright holder is reinstated (a)
provisionally, unless and until the copyright holder explicitly and
finally terminates your license, and (b) permanently, if the copyright
holder fails to notify you of the violation by some reasonable means
prior to 60 days after the cessation.
Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.
Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License. If your rights have been terminated and not permanently
reinstated, you do not qualify to receive new licenses for the same
material under section 10.
9. Acceptance Not Required for Having Copies.
You are not required to accept this License in order to receive or
run a copy of the Program. Ancillary propagation of a covered work
occurring solely as a consequence of using peer-to-peer transmission
to receive a copy likewise does not require acceptance. However,
nothing other than this License grants you permission to propagate or
modify any covered work. These actions infringe copyright if you do
not accept this License. Therefore, by modifying or propagating a
covered work, you indicate your acceptance of this License to do so.
10. Automatic Licensing of Downstream Recipients.
Each time you convey a covered work, the recipient automatically
receives a license from the original licensors, to run, modify and
propagate that work, subject to this License. You are not responsible
for enforcing compliance by third parties with this License.
An "entity transaction" is a transaction transferring control of an
organization, or substantially all assets of one, or subdividing an
organization, or merging organizations. If propagation of a covered
work results from an entity transaction, each party to that
transaction who receives a copy of the work also receives whatever
licenses to the work the party's predecessor in interest had or could
give under the previous paragraph, plus a right to possession of the
Corresponding Source of the work from the predecessor in interest, if
the predecessor has it or can get it with reasonable efforts.
You may not impose any further restrictions on the exercise of the
rights granted or affirmed under this License. For example, you may
not impose a license fee, royalty, or other charge for exercise of
rights granted under this License, and you may not initiate litigation
(including a cross-claim or counterclaim in a lawsuit) alleging that
any patent claim is infringed by making, using, selling, offering for
sale, or importing the Program or any portion of it.
11. Patents.
A "contributor" is a copyright holder who authorizes use under this
License of the Program or a work on which the Program is based. The
work thus licensed is called the contributor's "contributor version".
A contributor's "essential patent claims" are all patent claims
owned or controlled by the contributor, whether already acquired or
hereafter acquired, that would be infringed by some manner, permitted
by this License, of making, using, or selling its contributor version,
but do not include claims that would be infringed only as a
consequence of further modification of the contributor version. For
purposes of this definition, "control" includes the right to grant
patent sublicenses in a manner consistent with the requirements of
this License.
Each contributor grants you a non-exclusive, worldwide, royalty-free
patent license under the contributor's essential patent claims, to
make, use, sell, offer for sale, import and otherwise run, modify and
propagate the contents of its contributor version.
In the following three paragraphs, a "patent license" is any express
agreement or commitment, however denominated, not to enforce a patent
(such as an express permission to practice a patent or covenant not to
sue for patent infringement). To "grant" such a patent license to a
party means to make such an agreement or commitment not to enforce a
patent against the party.
If you convey a covered work, knowingly relying on a patent license,
and the Corresponding Source of the work is not available for anyone
to copy, free of charge and under the terms of this License, through a
publicly available network server or other readily accessible means,
then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the
patent license for this particular work, or (3) arrange, in a manner
consistent with the requirements of this License, to extend the patent
license to downstream recipients. "Knowingly relying" means you have
actual knowledge that, but for the patent license, your conveying the
covered work in a country, or your recipient's use of the covered work
in a country, would infringe one or more identifiable patents in that
country that you have reason to believe are valid.
If, pursuant to or in connection with a single transaction or
arrangement, you convey, or propagate by procuring conveyance of, a
covered work, and grant a patent license to some of the parties
receiving the covered work authorizing them to use, propagate, modify
or convey a specific copy of the covered work, then the patent license
you grant is automatically extended to all recipients of the covered
work and works based on it.
A patent license is "discriminatory" if it does not include within
the scope of its coverage, prohibits the exercise of, or is
conditioned on the non-exercise of one or more of the rights that are
specifically granted under this License. You may not convey a covered
work if you are a party to an arrangement with a third party that is
in the business of distributing software, under which you make payment
to the third party based on the extent of your activity of conveying
the work, and under which the third party grants, to any of the
parties who would receive the covered work from you, a discriminatory
patent license (a) in connection with copies of the covered work
conveyed by you (or copies made from those copies), or (b) primarily
for and in connection with specific products or compilations that
contain the covered work, unless you entered into that arrangement,
or that patent license was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting
any implied license or other defenses to infringement that may
otherwise be available to you under applicable patent law.
12. No Surrender of Others' Freedom.
If 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 convey a
covered work so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you may
not convey it at all. For example, if you agree to terms that obligate you
to collect a royalty for further conveying from those to whom you convey
the Program, the only way you could satisfy both those terms and this
License would be to refrain entirely from conveying the Program.
13. Use with the GNU Affero General Public License.
Notwithstanding any other provision of this License, you have
permission to link or combine any covered work with a work licensed
under version 3 of the GNU Affero General Public License into a single
combined work, and to convey the resulting work. The terms of this
License will continue to apply to the part which is the covered work,
but the special requirements of the GNU Affero General Public License,
section 13, concerning interaction through a network will apply to the
combination as such.
14. Revised Versions of this License.
The Free Software Foundation may publish revised and/or new versions of
the GNU 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
Program specifies that a certain numbered version of the GNU General
Public License "or any later version" applies to it, you have the
option of following the terms and conditions either of that numbered
version or of any later version published by the Free Software
Foundation. If the Program does not specify a version number of the
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.
If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.
Later license versions may give you additional or different
permissions. However, no additional obligations are imposed on any
author or copyright holder as a result of your choosing to follow a
later version.
15. Disclaimer of Warranty.
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "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 PROGRAM
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
16. Limitation of Liability.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
THE PROGRAM 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 PROGRAM (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 PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
SUCH DAMAGES.
17. Interpretation of Sections 15 and 16.
If the disclaimer of warranty and limitation of liability provided
above cannot be given local legal effect according to their terms,
reviewing courts shall apply local law that most closely approximates
an absolute waiver of all civil liability in connection with the
Program, unless a warranty or assumption of liability accompanies a
copy of the Program in return for a fee.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
state 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 program's name and a brief idea of what it does.>
Copyright (C) <year> <name of author>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
Also add information on how to contact you by electronic and paper mail.
If the program does terminal interaction, make it output a short
notice like this when it starts in an interactive mode:
<program> Copyright (C) <year> <name of author>
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, your program's commands
might be different; for a GUI interface, you would use an "about box".
You should also get your employer (if you work as a programmer) or school,
if any, to sign a "copyright disclaimer" for the program, if necessary.
For more information on this, and how to apply and follow the GNU GPL, see
<https://www.gnu.org/licenses/>.
The GNU General Public License does not permit incorporating your program
into proprietary programs. If your program is a subroutine library, you
may consider it more useful to permit linking proprietary applications with
the library. If this is what you want to do, use the GNU Lesser General
Public License instead of this License. But first, please read
<https://www.gnu.org/licenses/why-not-lgpl.html>.
LICENSES/README.md
+3
View File
@@ -0,0 +1,3 @@
# Licences
The application is GPL-3.0-or-later. Generated release artifacts include an exact runtime dependency licence inventory in `npm-runtime-licenses.txt`.
LICENSES/UNICODE-3.0.txt
+39
View File
@@ -0,0 +1,39 @@
UNICODE LICENSE V3
COPYRIGHT AND PERMISSION NOTICE
Copyright © 1991-2026 Unicode, Inc.
NOTICE TO USER: Carefully read the following legal agreement. BY
DOWNLOADING, INSTALLING, COPYING OR OTHERWISE USING DATA FILES, AND/OR
SOFTWARE, YOU UNEQUIVOCALLY ACCEPT, AND AGREE TO BE BOUND BY, ALL OF THE
TERMS AND CONDITIONS OF THIS AGREEMENT. IF YOU DO NOT AGREE, DO NOT
DOWNLOAD, INSTALL, COPY, DISTRIBUTE OR USE THE DATA FILES OR SOFTWARE.
Permission is hereby granted, free of charge, to any person obtaining a
copy of data files and any associated documentation (the "Data Files") or
software and any associated documentation (the "Software") to deal in the
Data Files or Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, and/or sell
copies of the Data Files or Software, and to permit persons to whom the
Data Files or Software are furnished to do so, provided that either (a)
this copyright and permission notice appear with all copies of the Data
Files or Software, or (b) this copyright and permission notice appear in
associated Documentation.
THE DATA FILES AND SOFTWARE ARE PROVIDED "AS IS", WITHOUT WARRANTY OF ANY
KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF
THIRD PARTY RIGHTS.
IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS INCLUDED IN THIS NOTICE
BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL DAMAGES,
OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THE DATA
FILES OR SOFTWARE.
Except as contained in this notice, the name of a copyright holder shall
not be used in advertising or otherwise to promote the sale, use or other
dealings in these Data Files or Software without prior written
authorization of the copyright holder.
README.md
+53
View File
@@ -0,0 +1,53 @@
# Unicode Tools
Explore Unicode characters, scripts, emoji and text locally.
Unicode Tools is a standalone local-first application in the [add·ideas Toolbox](https://git.add-ideas.de/lotobo/toolbox-portal). Inputs are processed in the browser and are not uploaded.
## Version 0.1.0 scope
- Search 159,866 assigned Unicode scalar records by official name, alias,
literal character, or code point, with script, block and category filters.
- Browse and copy 3,952 fully-qualified emoji and components, inspect named
sequences, and open practical symbol collections.
- Inspect text as Unicode scalar values, UTF-16 positions, UTF-8 bytes,
JavaScript and HTML escapes, and browser-segmented grapheme clusters.
- Decode lists of hexadecimal scalar values and compare NFC, NFD, NFKC and
NFKD normalization without losing sight of the original value.
- Compute a UTS #39 confusable skeleton, show applied mappings, and flag mixed
primary scripts as a review signal rather than a security verdict.
- Inspect character properties and optionally load selected Unihan readings,
definitions and radical/stroke fields for Han ideographs.
- Download an auditable source-identity report for every pinned data input.
The catalog is generated from checksum-pinned Unicode Consortium 17.0 data. It
does not scrape or redistribute descriptions, artwork, or annotations from
Symbl or another symbol website. Private-use code points and UTF-16 surrogates
remain visible as ranges, but are not presented as assigned characters.
The application treats every input as untrusted, applies explicit resource
limits, and never interprets text as active content. The checked-in catalog can
be regenerated only after each upstream file matches its recorded SHA-256.
See [docs/ARCHITECTURE.md](docs/ARCHITECTURE.md) and
[docs/PRIVACY-SECURITY.md](docs/PRIVACY-SECURITY.md).
## Development
Requires Node.js 22 and npm 11.
```sh
npm ci
npm run data:generate # optional, requires the pinned upstream files or network
npm run check
npm run test:browser
```
## Release
`npm run release:artifact` creates a deterministic `release/unicode-tools-0.1.0.zip` and checksum sidecar.
## Licence
Application code is GPL-3.0-or-later. Unicode data and documentation are used
under Unicode-3.0; runtime dependencies retain their own licences. See
[THIRD_PARTY_NOTICES.md](THIRD_PARTY_NOTICES.md) and `LICENSES/`.
SECURITY.md
+3
View File
@@ -0,0 +1,3 @@
# Security
Please report vulnerabilities privately to the repository owner. Do not attach sensitive source files to public issues. Imported inputs are untrusted; parsers must remain bounded and must not execute active content or fetch external resources.
SOURCE.md
+15
View File
@@ -0,0 +1,15 @@
# Corresponding source
The corresponding source for Unicode Tools 0.1.0 is available at:
https://git.add-ideas.de/lotobo/unicode-tools/src/tag/v0.1.0
Build with Node.js 22, npm 11, `npm ci`, and `npm run release:artifact`.
The preferred source includes the generated JSON catalog in `public/data/` so
the application build does not require a network request. To reproduce that
catalog, run `npm run data:generate`; the generator accepts only the seven
upstream files whose URLs and SHA-256 values are pinned in
`scripts/generate-unicode-data.mjs` and `public/data/SOURCES.json`.
The browser app never contacts those upstream URLs. Data downloads occur only
when a developer explicitly regenerates the source catalog.
THIRD_PARTY_NOTICES.md
+20
View File
@@ -0,0 +1,20 @@
# Third-party notices
## Unicode Consortium data
The checked-in catalog is generated from Unicode Character Database 17.0.0,
Unihan 17.0.0, Emoji 17.0, and Unicode Security Mechanisms data published by
the Unicode Consortium. These files and their derived data are distributed
under the Unicode License v3 (`Unicode-3.0`), reproduced in
`LICENSES/UNICODE-3.0.txt`. `public/data/SOURCES.json` records the exact source
URL and SHA-256 of every input. Unicode and the Unicode Logo are trademarks of
Unicode, Inc.; this project is not affiliated with or endorsed by Unicode,
Inc.
## Runtime code
Runtime dependency licences are reproduced in
`LICENSES/npm-runtime-licenses.txt` in release artifacts. Toolbox SDK packages
are Apache-2.0. The reusable Toolbox Helpers package is GPL-3.0-or-later.
React and React DOM are MIT. The build-only `fflate` dependency is MIT and is
used by the catalog generator, not shipped as runtime code.
docs/ACCESSIBILITY.md
+3
View File
@@ -0,0 +1,3 @@
# Accessibility
The workbench uses semantic landmarks, headings and labelled native controls, supports keyboard operation, visible focus, reduced-width layouts, and system/light/dark themes through the Toolbox shell. Results do not rely on colour alone.
docs/ARCHITECTURE.md
+25
View File
@@ -0,0 +1,25 @@
# Architecture
Unicode Tools is a relocatable static React application. Pure text operations
live in `src/unicode/model.ts`, while catalog loading, search, character detail,
Unihan lookup, and confusable analysis run through a dedicated module worker.
Reusable encoding, scalar, grapheme, normalization and download primitives come
from `@add-ideas/toolbox-helpers`.
The build contains compressed-by-HTTP JSON shards rather than a runtime
database. A small manifest and dictionaries load first. The first catalog query
loads assigned character shards, emoji and named sequences once in the worker;
the roughly 5 MiB Unihan selection is fetched only after an explicit request.
Results and displayed mapping lists are capped. The UI retains no database or
persistent search history.
`scripts/generate-unicode-data.mjs` converts checksum-pinned Unicode 17.0
archives and text files into deterministic checked-in source data. It derives
names, aliases, general categories, scripts, blocks, ages, bidi and case
properties, emoji, named sequences, selected Unihan fields, and UTS #39
confusable mappings. Private-use and surrogate ranges are not expanded into
synthetic catalog records.
Rendering, normalization and grapheme segmentation use the current browser and
operating-system Unicode implementation, which can differ from the pinned
catalog version. The interface discloses that boundary.
docs/PRIVACY-SECURITY.md
+21
View File
@@ -0,0 +1,21 @@
# Privacy and security
Inputs remain in browser memory. There is no account, telemetry, analytics,
storage, or runtime network dependency. The application fetches only its own
versioned static catalog files and never sends search terms or inspected text.
Input is rendered as React text, not executable HTML.
Text inspection is limited to 1,000,000 UTF-16 code units, scalar decoding to
10,000 values, catalog results to 180, emoji results to 240, and displayed
confusable mappings to 500. Large static datasets are held in a worker so the
UI can remain responsive. Unihan data loads only on demand.
UTS #39 skeleton equivalence and mixed-script detection are review signals.
They are not proof of spoofing, maliciousness, safety, or identifier validity;
applications still need a context-specific identifier profile and policy.
Character glyphs come from the user's fonts, so a missing or surprising glyph
does not alter the underlying code point.
Developers can regenerate the catalog, but every upstream byte sequence must
match a hard-coded SHA-256 before parsing. The public release performs no such
download. Data source identities are inspectable and exportable from the app.
eslint.config.mjs
+37
View File
@@ -0,0 +1,37 @@
import js from "@eslint/js";
import globals from "globals";
import reactHooks from "eslint-plugin-react-hooks";
import reactRefresh from "eslint-plugin-react-refresh";
import tseslint from "typescript-eslint";
export default tseslint.config(
{
ignores: [
"dist",
"release",
"coverage",
"test-results",
"playwright-report",
],
},
{
extends: [js.configs.recommended, ...tseslint.configs.recommended],
files: ["**/*.{ts,tsx}"],
languageOptions: {
ecmaVersion: 2023,
globals: { ...globals.browser, ...globals.worker },
},
plugins: { "react-hooks": reactHooks, "react-refresh": reactRefresh },
rules: {
...reactHooks.configs.recommended.rules,
"react-refresh/only-export-components": [
"warn",
{ allowConstantExport: true },
],
},
},
{
files: ["scripts/**/*.mjs", "playwright.config.ts"],
languageOptions: { globals: globals.node },
},
);
index.html
+19
View File
@@ -0,0 +1,19 @@
<!doctype html>
<html lang="en">
<head>
<meta charset="UTF-8" />
<meta name="viewport" content="width=device-width, initial-scale=1.0" />
<meta
name="description"
content="Explore Unicode characters, scripts, emoji and text locally."
/>
<link rel="icon" type="image/svg+xml" href="./favicon.svg" />
<link rel="manifest" href="./manifest.webmanifest" />
<meta name="theme-color" content="#29255f" />
<title>Unicode Tools</title>
</head>
<body>
<div id="root"></div>
<script type="module" src="./src/main.tsx"></script>
</body>
</html>
package-lock.json
Generated
+3506
View File
File diff suppressed because it is too large Load Diff
package.json
+73
View File
@@ -0,0 +1,73 @@
{
"name": "unicode-tools",
"version": "0.1.0",
"description": "Explore Unicode characters, scripts, emoji and text locally.",
"license": "GPL-3.0-or-later",
"author": "Albrecht Degering",
"repository": {
"type": "git",
"url": "git+https://git.add-ideas.de/lotobo/unicode-tools.git"
},
"homepage": "https://git.add-ideas.de/lotobo/unicode-tools",
"bugs": {
"url": "https://git.add-ideas.de/lotobo/unicode-tools/issues"
},
"private": true,
"type": "module",
"engines": {
"node": ">=22"
},
"scripts": {
"predev": "npm run manifest:generate",
"dev": "vite",
"prebuild": "npm run release:prepare && npm run manifest:generate",
"build": "tsc -b && vite build",
"preview": "vite preview",
"typecheck": "tsc -b --pretty false",
"lint": "eslint . --max-warnings=0",
"format": "prettier --write .",
"format:check": "prettier --check .",
"test": "vitest run",
"test:watch": "vitest",
"test:browser": "playwright test",
"data:generate": "node scripts/generate-unicode-data.mjs",
"manifest:generate": "node scripts/generate-toolbox-manifest.mjs",
"manifest:check": "node scripts/generate-toolbox-manifest.mjs --check",
"release:prepare": "node scripts/prepare-release-files.mjs",
"toolbox:check": "toolbox-check dist",
"package:release": "node scripts/package-release.mjs",
"check": "npm run manifest:check && npm run typecheck && npm run lint && npm run format:check && npm run test && npm run build && npm run toolbox:check",
"release:artifact": "npm run check && npm run test:browser && npm run package:release -- --force"
},
"dependencies": {
"@add-ideas/toolbox-contract": "0.2.3",
"@add-ideas/toolbox-helpers": "0.1.0",
"@add-ideas/toolbox-shell-react": "0.2.3",
"react": "19.2.8",
"react-dom": "19.2.8"
},
"devDependencies": {
"@add-ideas/toolbox-testkit": "0.2.3",
"@eslint/js": "10.0.1",
"@playwright/test": "1.62.1",
"@testing-library/jest-dom": "6.9.1",
"@testing-library/react": "16.3.2",
"@testing-library/user-event": "14.6.1",
"@types/node": "25.9.5",
"@types/react": "19.2.17",
"@types/react-dom": "19.2.5",
"@vitejs/plugin-react": "6.0.3",
"eslint": "10.7.0",
"eslint-plugin-react-hooks": "7.1.1",
"eslint-plugin-react-refresh": "0.5.2",
"fflate": "0.8.2",
"globals": "17.7.0",
"jsdom": "29.1.1",
"prettier": "3.9.5",
"typescript": "6.0.3",
"typescript-eslint": "8.64.0",
"vite": "8.2.2",
"vitest": "4.1.11"
},
"packageManager": "npm@11.17.0"
}
playwright.config.ts
+21
View File
@@ -0,0 +1,21 @@
import { defineConfig, devices } from "@playwright/test";
export default defineConfig({
testDir: "./tests/browser",
fullyParallel: false,
workers: 1,
timeout: 120_000,
expect: { timeout: 10_000 },
reporter: [["list"]],
use: { baseURL: "http://127.0.0.1:4173", trace: "retain-on-failure" },
webServer: {
command: "npm run build && node scripts/serve-test.mjs",
url: "http://127.0.0.1:4173",
reuseExistingServer: !process.env.CI,
timeout: 180_000,
},
projects: [
{ name: "chromium", use: { ...devices["Desktop Chrome"] } },
{ name: "firefox", use: { ...devices["Desktop Firefox"] } },
],
});
public/CHANGELOG.md
+13
View File
@@ -0,0 +1,13 @@
# Changelog
## 0.1.0 - 2026-09-01
- Added the initial local-first Unicode Tools workbench.
- Added a worker-backed Unicode 17.0 character, sequence and emoji catalog
generated from seven SHA-256-pinned Unicode Consortium inputs.
- Added character properties, optional Unihan details, collections, copy tools,
exact code-point/UTF-8/UTF-16 inspection and scalar-value decoding.
- Added normalization comparison and bounded UTS #39 confusable/mixed-script
analysis with explicit non-verdict language.
- Added auditable source identity, local-only operation, bounded input handling,
offline shell and deterministic release packaging.
public/CONTRIBUTING.md
+3
View File
@@ -0,0 +1,3 @@
# Contributing
Run `npm ci`, `npm run check`, and `npm run test:browser` before proposing a change. Keep processing local, preserve explicit limits, and include fixtures for every parser boundary.
public/LICENSE
+674
View File
@@ -0,0 +1,674 @@
GNU GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The GNU General Public License is a free, copyleft license for
software and other kinds of works.
The licenses for most software and other practical works are designed
to take away your freedom to share and change the works. By contrast,
the GNU General Public License is intended to guarantee your freedom to
share and change all versions of a program--to make sure it remains free
software for all its users. We, the Free Software Foundation, use the
GNU General Public License for most of our software; it applies also to
any other work released this way by its authors. You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, 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
them if you wish), that you receive source code or can get it if you
want it, that you can change the software or use pieces of it in new
free programs, and that you know you can do these things.
To protect your rights, we need to prevent others from denying you
these rights or asking you to surrender the rights. Therefore, you have
certain responsibilities if you distribute copies of the software, or if
you modify it: responsibilities to respect the freedom of others.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must pass on to the recipients the same
freedoms that you received. You must make sure that they, too, receive
or can get the source code. And you must show them these terms so they
know their rights.
Developers that use the GNU GPL protect your rights with two steps:
(1) assert copyright on the software, and (2) offer you this License
giving you legal permission to copy, distribute and/or modify it.
For the developers' and authors' protection, the GPL clearly explains
that there is no warranty for this free software. For both users' and
authors' sake, the GPL requires that modified versions be marked as
changed, so that their problems will not be attributed erroneously to
authors of previous versions.
Some devices are designed to deny users access to install or run
modified versions of the software inside them, although the manufacturer
can do so. This is fundamentally incompatible with the aim of
protecting users' freedom to change the software. The systematic
pattern of such abuse occurs in the area of products for individuals to
use, which is precisely where it is most unacceptable. Therefore, we
have designed this version of the GPL to prohibit the practice for those
products. If such problems arise substantially in other domains, we
stand ready to extend this provision to those domains in future versions
of the GPL, as needed to protect the freedom of users.
Finally, every program is threatened constantly by software patents.
States should not allow patents to restrict development and use of
software on general-purpose computers, but in those that do, we wish to
avoid the special danger that patents applied to a free program could
make it effectively proprietary. To prevent this, the GPL assures that
patents cannot be used to render the program non-free.
The precise terms and conditions for copying, distribution and
modification follow.
TERMS AND CONDITIONS
0. Definitions.
"This License" refers to version 3 of the GNU General Public License.
"Copyright" also means copyright-like laws that apply to other kinds of
works, such as semiconductor masks.
"The Program" refers to any copyrightable work licensed under this
License. Each licensee is addressed as "you". "Licensees" and
"recipients" may be individuals or organizations.
To "modify" a work means to copy from or adapt all or part of the work
in a fashion requiring copyright permission, other than the making of an
exact copy. The resulting work is called a "modified version" of the
earlier work or a work "based on" the earlier work.
A "covered work" means either the unmodified Program or a work based
on the Program.
To "propagate" a work means to do anything with it that, without
permission, would make you directly or secondarily liable for
infringement under applicable copyright law, except executing it on a
computer or modifying a private copy. Propagation includes copying,
distribution (with or without modification), making available to the
public, and in some countries other activities as well.
To "convey" a work means any kind of propagation that enables other
parties to make or receive copies. Mere interaction with a user through
a computer network, with no transfer of a copy, is not conveying.
An interactive user interface displays "Appropriate Legal Notices"
to the extent that it includes a convenient and prominently visible
feature that (1) displays an appropriate copyright notice, and (2)
tells the user that there is no warranty for the work (except to the
extent that warranties are provided), that licensees may convey the
work under this License, and how to view a copy of this License. If
the interface presents a list of user commands or options, such as a
menu, a prominent item in the list meets this criterion.
1. Source Code.
The "source code" for a work means the preferred form of the work
for making modifications to it. "Object code" means any non-source
form of a work.
A "Standard Interface" means an interface that either is an official
standard defined by a recognized standards body, or, in the case of
interfaces specified for a particular programming language, one that
is widely used among developers working in that language.
The "System Libraries" of an executable work include anything, other
than the work as a whole, that (a) is included in the normal form of
packaging a Major Component, but which is not part of that Major
Component, and (b) serves only to enable use of the work with that
Major Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form. A
"Major Component", in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system
(if any) on which the executable work runs, or a compiler used to
produce the work, or an object code interpreter used to run it.
The "Corresponding Source" for a work in object code form means all
the source code needed to generate, install, and (for an executable
work) run the object code and to modify the work, including scripts to
control those activities. However, it does not include the work's
System Libraries, or general-purpose tools or generally available free
programs which are used unmodified in performing those activities but
which are not part of the work. For example, Corresponding Source
includes interface definition files associated with source files for
the work, and the source code for shared libraries and dynamically
linked subprograms that the work is specifically designed to require,
such as by intimate data communication or control flow between those
subprograms and other parts of the work.
The Corresponding Source need not include anything that users
can regenerate automatically from other parts of the Corresponding
Source.
The Corresponding Source for a work in source code form is that
same work.
2. Basic Permissions.
All rights granted under this License are granted for the term of
copyright on the Program, and are irrevocable provided the stated
conditions are met. This License explicitly affirms your unlimited
permission to run the unmodified Program. The output from running a
covered work is covered by this License only if the output, given its
content, constitutes a covered work. This License acknowledges your
rights of fair use or other equivalent, as provided by copyright law.
You may make, run and propagate covered works that you do not
convey, without conditions so long as your license otherwise remains
in force. You may convey covered works to others for the sole purpose
of having them make modifications exclusively for you, or provide you
with facilities for running those works, provided that you comply with
the terms of this License in conveying all material for which you do
not control copyright. Those thus making or running the covered works
for you must do so exclusively on your behalf, under your direction
and control, on terms that prohibit them from making any copies of
your copyrighted material outside their relationship with you.
Conveying under any other circumstances is permitted solely under
the conditions stated below. Sublicensing is not allowed; section 10
makes it unnecessary.
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
No covered work shall be deemed part of an effective technological
measure under any applicable law fulfilling obligations under article
11 of the WIPO copyright treaty adopted on 20 December 1996, or
similar laws prohibiting or restricting circumvention of such
measures.
When you convey a covered work, you waive any legal power to forbid
circumvention of technological measures to the extent such circumvention
is effected by exercising rights under this License with respect to
the covered work, and you disclaim any intention to limit operation or
modification of the work as a means of enforcing, against the work's
users, your or third parties' legal rights to forbid circumvention of
technological measures.
4. Conveying Verbatim Copies.
You may convey verbatim copies of the Program's source code as you
receive it, in any medium, provided that you conspicuously and
appropriately publish on each copy an appropriate copyright notice;
keep intact all notices stating that this License and any
non-permissive terms added in accord with section 7 apply to the code;
keep intact all notices of the absence of any warranty; and give all
recipients a copy of this License along with the Program.
You may charge any price or no price for each copy that you convey,
and you may offer support or warranty protection for a fee.
5. Conveying Modified Source Versions.
You may convey a work based on the Program, or the modifications to
produce it from the Program, in the form of source code under the
terms of section 4, provided that you also meet all of these conditions:
a) The work must carry prominent notices stating that you modified
it, and giving a relevant date.
b) The work must carry prominent notices stating that it is
released under this License and any conditions added under section
7. This requirement modifies the requirement in section 4 to
"keep intact all notices".
c) You must license the entire work, as a whole, under this
License to anyone who comes into possession of a copy. This
License will therefore apply, along with any applicable section 7
additional terms, to the whole of the work, and all its parts,
regardless of how they are packaged. This License gives no
permission to license the work in any other way, but it does not
invalidate such permission if you have separately received it.
d) If the work has interactive user interfaces, each must display
Appropriate Legal Notices; however, if the Program has interactive
interfaces that do not display Appropriate Legal Notices, your
work need not make them do so.
A compilation of a covered work with other separate and independent
works, which are not by their nature extensions of the covered work,
and which are not combined with it such as to form a larger program,
in or on a volume of a storage or distribution medium, is called an
"aggregate" if the compilation and its resulting copyright are not
used to limit the access or legal rights of the compilation's users
beyond what the individual works permit. Inclusion of a covered work
in an aggregate does not cause this License to apply to the other
parts of the aggregate.
6. Conveying Non-Source Forms.
You may convey a covered work in object code form under the terms
of sections 4 and 5, provided that you also convey the
machine-readable Corresponding Source under the terms of this License,
in one of these ways:
a) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by the
Corresponding Source fixed on a durable physical medium
customarily used for software interchange.
b) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by a
written offer, valid for at least three years and valid for as
long as you offer spare parts or customer support for that product
model, to give anyone who possesses the object code either (1) a
copy of the Corresponding Source for all the software in the
product that is covered by this License, on a durable physical
medium customarily used for software interchange, for a price no
more than your reasonable cost of physically performing this
conveying of source, or (2) access to copy the
Corresponding Source from a network server at no charge.
c) Convey individual copies of the object code with a copy of the
written offer to provide the Corresponding Source. This
alternative is allowed only occasionally and noncommercially, and
only if you received the object code with such an offer, in accord
with subsection 6b.
d) Convey the object code by offering access from a designated
place (gratis or for a charge), and offer equivalent access to the
Corresponding Source in the same way through the same place at no
further charge. You need not require recipients to copy the
Corresponding Source along with the object code. If the place to
copy the object code is a network server, the Corresponding Source
may be on a different server (operated by you or a third party)
that supports equivalent copying facilities, provided you maintain
clear directions next to the object code saying where to find the
Corresponding Source. Regardless of what server hosts the
Corresponding Source, you remain obligated to ensure that it is
available for as long as needed to satisfy these requirements.
e) Convey the object code using peer-to-peer transmission, provided
you inform other peers where the object code and Corresponding
Source of the work are being offered to the general public at no
charge under subsection 6d.
A separable portion of the object code, whose source code is excluded
from the Corresponding Source as a System Library, need not be
included in conveying the object code work.
A "User Product" is either (1) a "consumer product", which means any
tangible personal property which is normally used for personal, family,
or household purposes, or (2) anything designed or sold for incorporation
into a dwelling. In determining whether a product is a consumer product,
doubtful cases shall be resolved in favor of coverage. For a particular
product received by a particular user, "normally used" refers to a
typical or common use of that class of product, regardless of the status
of the particular user or of the way in which the particular user
actually uses, or expects or is expected to use, the product. A product
is a consumer product regardless of whether the product has substantial
commercial, industrial or non-consumer uses, unless such uses represent
the only significant mode of use of the product.
"Installation Information" for a User Product means any methods,
procedures, authorization keys, or other information required to install
and execute modified versions of a covered work in that User Product from
a modified version of its Corresponding Source. The information must
suffice to ensure that the continued functioning of the modified object
code is in no case prevented or interfered with solely because
modification has been made.
If you convey an object code work under this section in, or with, or
specifically for use in, a User Product, and the conveying occurs as
part of a transaction in which the right of possession and use of the
User Product is transferred to the recipient in perpetuity or for a
fixed term (regardless of how the transaction is characterized), the
Corresponding Source conveyed under this section must be accompanied
by the Installation Information. But this requirement does not apply
if neither you nor any third party retains the ability to install
modified object code on the User Product (for example, the work has
been installed in ROM).
The requirement to provide Installation Information does not include a
requirement to continue to provide support service, warranty, or updates
for a work that has been modified or installed by the recipient, or for
the User Product in which it has been modified or installed. Access to a
network may be denied when the modification itself materially and
adversely affects the operation of the network or violates the rules and
protocols for communication across the network.
Corresponding Source conveyed, and Installation Information provided,
in accord with this section must be in a format that is publicly
documented (and with an implementation available to the public in
source code form), and must require no special password or key for
unpacking, reading or copying.
7. Additional Terms.
"Additional permissions" are terms that supplement the terms of this
License by making exceptions from one or more of its conditions.
Additional permissions that are applicable to the entire Program shall
be treated as though they were included in this License, to the extent
that they are valid under applicable law. If additional permissions
apply only to part of the Program, that part may be used separately
under those permissions, but the entire Program remains governed by
this License without regard to the additional permissions.
When you convey a copy of a covered work, you may at your option
remove any additional permissions from that copy, or from any part of
it. (Additional permissions may be written to require their own
removal in certain cases when you modify the work.) You may place
additional permissions on material, added by you to a covered work,
for which you have or can give appropriate copyright permission.
Notwithstanding any other provision of this License, for material you
add to a covered work, you may (if authorized by the copyright holders of
that material) supplement the terms of this License with terms:
a) Disclaiming warranty or limiting liability differently from the
terms of sections 15 and 16 of this License; or
b) Requiring preservation of specified reasonable legal notices or
author attributions in that material or in the Appropriate Legal
Notices displayed by works containing it; or
c) Prohibiting misrepresentation of the origin of that material, or
requiring that modified versions of such material be marked in
reasonable ways as different from the original version; or
d) Limiting the use for publicity purposes of names of licensors or
authors of the material; or
e) Declining to grant rights under trademark law for use of some
trade names, trademarks, or service marks; or
f) Requiring indemnification of licensors and authors of that
material by anyone who conveys the material (or modified versions of
it) with contractual assumptions of liability to the recipient, for
any liability that these contractual assumptions directly impose on
those licensors and authors.
All other non-permissive additional terms are considered "further
restrictions" within the meaning of section 10. If the Program as you
received it, or any part of it, contains a notice stating that it is
governed by this License along with a term that is a further
restriction, you may remove that term. If a license document contains
a further restriction but permits relicensing or conveying under this
License, you may add to a covered work material governed by the terms
of that license document, provided that the further restriction does
not survive such relicensing or conveying.
If you add terms to a covered work in accord with this section, you
must place, in the relevant source files, a statement of the
additional terms that apply to those files, or a notice indicating
where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the
form of a separately written license, or stated as exceptions;
the above requirements apply either way.
8. Termination.
You may not propagate or modify a covered work except as expressly
provided under this License. Any attempt otherwise to propagate or
modify it is void, and will automatically terminate your rights under
this License (including any patent licenses granted under the third
paragraph of section 11).
However, if you cease all violation of this License, then your
license from a particular copyright holder is reinstated (a)
provisionally, unless and until the copyright holder explicitly and
finally terminates your license, and (b) permanently, if the copyright
holder fails to notify you of the violation by some reasonable means
prior to 60 days after the cessation.
Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.
Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License. If your rights have been terminated and not permanently
reinstated, you do not qualify to receive new licenses for the same
material under section 10.
9. Acceptance Not Required for Having Copies.
You are not required to accept this License in order to receive or
run a copy of the Program. Ancillary propagation of a covered work
occurring solely as a consequence of using peer-to-peer transmission
to receive a copy likewise does not require acceptance. However,
nothing other than this License grants you permission to propagate or
modify any covered work. These actions infringe copyright if you do
not accept this License. Therefore, by modifying or propagating a
covered work, you indicate your acceptance of this License to do so.
10. Automatic Licensing of Downstream Recipients.
Each time you convey a covered work, the recipient automatically
receives a license from the original licensors, to run, modify and
propagate that work, subject to this License. You are not responsible
for enforcing compliance by third parties with this License.
An "entity transaction" is a transaction transferring control of an
organization, or substantially all assets of one, or subdividing an
organization, or merging organizations. If propagation of a covered
work results from an entity transaction, each party to that
transaction who receives a copy of the work also receives whatever
licenses to the work the party's predecessor in interest had or could
give under the previous paragraph, plus a right to possession of the
Corresponding Source of the work from the predecessor in interest, if
the predecessor has it or can get it with reasonable efforts.
You may not impose any further restrictions on the exercise of the
rights granted or affirmed under this License. For example, you may
not impose a license fee, royalty, or other charge for exercise of
rights granted under this License, and you may not initiate litigation
(including a cross-claim or counterclaim in a lawsuit) alleging that
any patent claim is infringed by making, using, selling, offering for
sale, or importing the Program or any portion of it.
11. Patents.
A "contributor" is a copyright holder who authorizes use under this
License of the Program or a work on which the Program is based. The
work thus licensed is called the contributor's "contributor version".
A contributor's "essential patent claims" are all patent claims
owned or controlled by the contributor, whether already acquired or
hereafter acquired, that would be infringed by some manner, permitted
by this License, of making, using, or selling its contributor version,
but do not include claims that would be infringed only as a
consequence of further modification of the contributor version. For
purposes of this definition, "control" includes the right to grant
patent sublicenses in a manner consistent with the requirements of
this License.
Each contributor grants you a non-exclusive, worldwide, royalty-free
patent license under the contributor's essential patent claims, to
make, use, sell, offer for sale, import and otherwise run, modify and
propagate the contents of its contributor version.
In the following three paragraphs, a "patent license" is any express
agreement or commitment, however denominated, not to enforce a patent
(such as an express permission to practice a patent or covenant not to
sue for patent infringement). To "grant" such a patent license to a
party means to make such an agreement or commitment not to enforce a
patent against the party.
If you convey a covered work, knowingly relying on a patent license,
and the Corresponding Source of the work is not available for anyone
to copy, free of charge and under the terms of this License, through a
publicly available network server or other readily accessible means,
then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the
patent license for this particular work, or (3) arrange, in a manner
consistent with the requirements of this License, to extend the patent
license to downstream recipients. "Knowingly relying" means you have
actual knowledge that, but for the patent license, your conveying the
covered work in a country, or your recipient's use of the covered work
in a country, would infringe one or more identifiable patents in that
country that you have reason to believe are valid.
If, pursuant to or in connection with a single transaction or
arrangement, you convey, or propagate by procuring conveyance of, a
covered work, and grant a patent license to some of the parties
receiving the covered work authorizing them to use, propagate, modify
or convey a specific copy of the covered work, then the patent license
you grant is automatically extended to all recipients of the covered
work and works based on it.
A patent license is "discriminatory" if it does not include within
the scope of its coverage, prohibits the exercise of, or is
conditioned on the non-exercise of one or more of the rights that are
specifically granted under this License. You may not convey a covered
work if you are a party to an arrangement with a third party that is
in the business of distributing software, under which you make payment
to the third party based on the extent of your activity of conveying
the work, and under which the third party grants, to any of the
parties who would receive the covered work from you, a discriminatory
patent license (a) in connection with copies of the covered work
conveyed by you (or copies made from those copies), or (b) primarily
for and in connection with specific products or compilations that
contain the covered work, unless you entered into that arrangement,
or that patent license was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting
any implied license or other defenses to infringement that may
otherwise be available to you under applicable patent law.
12. No Surrender of Others' Freedom.
If 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 convey a
covered work so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you may
not convey it at all. For example, if you agree to terms that obligate you
to collect a royalty for further conveying from those to whom you convey
the Program, the only way you could satisfy both those terms and this
License would be to refrain entirely from conveying the Program.
13. Use with the GNU Affero General Public License.
Notwithstanding any other provision of this License, you have
permission to link or combine any covered work with a work licensed
under version 3 of the GNU Affero General Public License into a single
combined work, and to convey the resulting work. The terms of this
License will continue to apply to the part which is the covered work,
but the special requirements of the GNU Affero General Public License,
section 13, concerning interaction through a network will apply to the
combination as such.
14. Revised Versions of this License.
The Free Software Foundation may publish revised and/or new versions of
the GNU 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
Program specifies that a certain numbered version of the GNU General
Public License "or any later version" applies to it, you have the
option of following the terms and conditions either of that numbered
version or of any later version published by the Free Software
Foundation. If the Program does not specify a version number of the
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.
If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.
Later license versions may give you additional or different
permissions. However, no additional obligations are imposed on any
author or copyright holder as a result of your choosing to follow a
later version.
15. Disclaimer of Warranty.
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "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 PROGRAM
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
16. Limitation of Liability.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
THE PROGRAM 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 PROGRAM (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 PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
SUCH DAMAGES.
17. Interpretation of Sections 15 and 16.
If the disclaimer of warranty and limitation of liability provided
above cannot be given local legal effect according to their terms,
reviewing courts shall apply local law that most closely approximates
an absolute waiver of all civil liability in connection with the
Program, unless a warranty or assumption of liability accompanies a
copy of the Program in return for a fee.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
state 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 program's name and a brief idea of what it does.>
Copyright (C) <year> <name of author>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
Also add information on how to contact you by electronic and paper mail.
If the program does terminal interaction, make it output a short
notice like this when it starts in an interactive mode:
<program> Copyright (C) <year> <name of author>
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, your program's commands
might be different; for a GUI interface, you would use an "about box".
You should also get your employer (if you work as a programmer) or school,
if any, to sign a "copyright disclaimer" for the program, if necessary.
For more information on this, and how to apply and follow the GNU GPL, see
<https://www.gnu.org/licenses/>.
The GNU General Public License does not permit incorporating your program
into proprietary programs. If your program is a subroutine library, you
may consider it more useful to permit linking proprietary applications with
the library. If this is what you want to do, use the GNU Lesser General
Public License instead of this License. But first, please read
<https://www.gnu.org/licenses/why-not-lgpl.html>.
public/LICENSES/README.md
+3
View File
@@ -0,0 +1,3 @@
# Licences
The application is GPL-3.0-or-later. Generated release artifacts include an exact runtime dependency licence inventory in `npm-runtime-licenses.txt`.
public/LICENSES/UNICODE-3.0.txt
+39
View File
@@ -0,0 +1,39 @@
UNICODE LICENSE V3
COPYRIGHT AND PERMISSION NOTICE
Copyright © 1991-2026 Unicode, Inc.
NOTICE TO USER: Carefully read the following legal agreement. BY
DOWNLOADING, INSTALLING, COPYING OR OTHERWISE USING DATA FILES, AND/OR
SOFTWARE, YOU UNEQUIVOCALLY ACCEPT, AND AGREE TO BE BOUND BY, ALL OF THE
TERMS AND CONDITIONS OF THIS AGREEMENT. IF YOU DO NOT AGREE, DO NOT
DOWNLOAD, INSTALL, COPY, DISTRIBUTE OR USE THE DATA FILES OR SOFTWARE.
Permission is hereby granted, free of charge, to any person obtaining a
copy of data files and any associated documentation (the "Data Files") or
software and any associated documentation (the "Software") to deal in the
Data Files or Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, and/or sell
copies of the Data Files or Software, and to permit persons to whom the
Data Files or Software are furnished to do so, provided that either (a)
this copyright and permission notice appear with all copies of the Data
Files or Software, or (b) this copyright and permission notice appear in
associated Documentation.
THE DATA FILES AND SOFTWARE ARE PROVIDED "AS IS", WITHOUT WARRANTY OF ANY
KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF
THIRD PARTY RIGHTS.
IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS INCLUDED IN THIS NOTICE
BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL DAMAGES,
OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THE DATA
FILES OR SOFTWARE.
Except as contained in this notice, the name of a copyright holder shall
not be used in advertising or otherwise to promote the sale, use or other
dealings in these Data Files or Software without prior written
authorization of the copyright holder.
public/LICENSES/npm-runtime-licenses.txt
+1161
View File
File diff suppressed because it is too large Load Diff
public/README.md
+53
View File
@@ -0,0 +1,53 @@
# Unicode Tools
Explore Unicode characters, scripts, emoji and text locally.
Unicode Tools is a standalone local-first application in the [add·ideas Toolbox](https://git.add-ideas.de/lotobo/toolbox-portal). Inputs are processed in the browser and are not uploaded.
## Version 0.1.0 scope
- Search 159,866 assigned Unicode scalar records by official name, alias,
literal character, or code point, with script, block and category filters.
- Browse and copy 3,952 fully-qualified emoji and components, inspect named
sequences, and open practical symbol collections.
- Inspect text as Unicode scalar values, UTF-16 positions, UTF-8 bytes,
JavaScript and HTML escapes, and browser-segmented grapheme clusters.
- Decode lists of hexadecimal scalar values and compare NFC, NFD, NFKC and
NFKD normalization without losing sight of the original value.
- Compute a UTS #39 confusable skeleton, show applied mappings, and flag mixed
primary scripts as a review signal rather than a security verdict.
- Inspect character properties and optionally load selected Unihan readings,
definitions and radical/stroke fields for Han ideographs.
- Download an auditable source-identity report for every pinned data input.
The catalog is generated from checksum-pinned Unicode Consortium 17.0 data. It
does not scrape or redistribute descriptions, artwork, or annotations from
Symbl or another symbol website. Private-use code points and UTF-16 surrogates
remain visible as ranges, but are not presented as assigned characters.
The application treats every input as untrusted, applies explicit resource
limits, and never interprets text as active content. The checked-in catalog can
be regenerated only after each upstream file matches its recorded SHA-256.
See [docs/ARCHITECTURE.md](docs/ARCHITECTURE.md) and
[docs/PRIVACY-SECURITY.md](docs/PRIVACY-SECURITY.md).
## Development
Requires Node.js 22 and npm 11.
```sh
npm ci
npm run data:generate # optional, requires the pinned upstream files or network
npm run check
npm run test:browser
```
## Release
`npm run release:artifact` creates a deterministic `release/unicode-tools-0.1.0.zip` and checksum sidecar.
## Licence
Application code is GPL-3.0-or-later. Unicode data and documentation are used
under Unicode-3.0; runtime dependencies retain their own licences. See
[THIRD_PARTY_NOTICES.md](THIRD_PARTY_NOTICES.md) and `LICENSES/`.
public/SECURITY.md
+3
View File
@@ -0,0 +1,3 @@
# Security
Please report vulnerabilities privately to the repository owner. Do not attach sensitive source files to public issues. Imported inputs are untrusted; parsers must remain bounded and must not execute active content or fetch external resources.
public/SOURCE.md
+15
View File
@@ -0,0 +1,15 @@
# Corresponding source
The corresponding source for Unicode Tools 0.1.0 is available at:
https://git.add-ideas.de/lotobo/unicode-tools/src/tag/v0.1.0
Build with Node.js 22, npm 11, `npm ci`, and `npm run release:artifact`.
The preferred source includes the generated JSON catalog in `public/data/` so
the application build does not require a network request. To reproduce that
catalog, run `npm run data:generate`; the generator accepts only the seven
upstream files whose URLs and SHA-256 values are pinned in
`scripts/generate-unicode-data.mjs` and `public/data/SOURCES.json`.
The browser app never contacts those upstream URLs. Data downloads occur only
when a developer explicitly regenerates the source catalog.
public/THIRD_PARTY_NOTICES.md
+20
View File
@@ -0,0 +1,20 @@
# Third-party notices
## Unicode Consortium data
The checked-in catalog is generated from Unicode Character Database 17.0.0,
Unihan 17.0.0, Emoji 17.0, and Unicode Security Mechanisms data published by
the Unicode Consortium. These files and their derived data are distributed
under the Unicode License v3 (`Unicode-3.0`), reproduced in
`LICENSES/UNICODE-3.0.txt`. `public/data/SOURCES.json` records the exact source
URL and SHA-256 of every input. Unicode and the Unicode Logo are trademarks of
Unicode, Inc.; this project is not affiliated with or endorsed by Unicode,
Inc.
## Runtime code
Runtime dependency licences are reproduced in
`LICENSES/npm-runtime-licenses.txt` in release artifacts. Toolbox SDK packages
are Apache-2.0. The reusable Toolbox Helpers package is GPL-3.0-or-later.
React and React DOM are MIT. The build-only `fflate` dependency is MIT and is
used by the catalog generator, not shipped as runtime code.
public/data/SOURCES.json
+48
View File
@@ -0,0 +1,48 @@
{
"schemaVersion": 1,
"unicodeVersion": "17.0.0",
"sources": [
{
"id": "ucd",
"filename": "UCD.zip",
"url": "https://www.unicode.org/Public/17.0.0/ucd/UCD.zip",
"sha256": "2066d1909b2ea93916ce092da1c0ee4808ea3ef8407c94b4f14f5b7eb263d28e"
},
{
"id": "unihan",
"filename": "Unihan.zip",
"url": "https://www.unicode.org/Public/17.0.0/ucd/Unihan.zip",
"sha256": "f7a48b2b545acfaa77b2d607ae28747404ce02baefee16396c5d2d7a8ef34b5e"
},
{
"id": "emoji-test",
"filename": "emoji-test.txt",
"url": "https://www.unicode.org/Public/17.0.0/emoji/emoji-test.txt",
"sha256": "1d8a944f88d7952f7ef7c5167fef3c67995bcae24543949710231b03a201acda"
},
{
"id": "emoji-sequences",
"filename": "emoji-sequences.txt",
"url": "https://www.unicode.org/Public/17.0.0/emoji/emoji-sequences.txt",
"sha256": "12cc8267dc33cbd11ed32bcf6fc5dc2ad9c7a77bae1bdfba2f41b1b9b3ead8dd"
},
{
"id": "emoji-zwj",
"filename": "emoji-zwj-sequences.txt",
"url": "https://www.unicode.org/Public/17.0.0/emoji/emoji-zwj-sequences.txt",
"sha256": "5b25441daed2322b068c5e70cda522946a4f0274df864445a1965a92e5fc5cad"
},
{
"id": "uts39",
"filename": "uts39-data-17.0.0.zip",
"url": "https://www.unicode.org/Public/security/latest/uts39-data-17.0.0.zip",
"sha256": "349b8d9bbb4718e6bb58a8e8ee774857762e8121742e762e1bfb7152bd4c4238"
},
{
"id": "license",
"filename": "UNICODE-LICENSE-3.txt",
"url": "https://www.unicode.org/license.txt",
"sha256": "e7a93b009565cfce55919a381437ac4db883e9da2126fa28b91d12732bc53d96"
}
]
}
public/data/characters-0.json
+1
View File
File diff suppressed because one or more lines are too long
public/data/characters-1.json
+1
View File
File diff suppressed because one or more lines are too long
public/data/characters-14.json
+1
View File
File diff suppressed because one or more lines are too long
public/data/characters-2.json
+1
View File
File diff suppressed because one or more lines are too long
public/data/characters-3.json
+1
View File
File diff suppressed because one or more lines are too long
public/data/confusables.json
+1
View File
File diff suppressed because one or more lines are too long
public/data/emoji.json
+1
View File
File diff suppressed because one or more lines are too long
public/data/manifest.json
+13854
View File
File diff suppressed because it is too large Load Diff
public/data/named-sequences.json
+1
View File
File diff suppressed because one or more lines are too long
public/data/unihan.json
+1
View File
File diff suppressed because one or more lines are too long
public/docs/ACCESSIBILITY.md
+3
View File
@@ -0,0 +1,3 @@
# Accessibility
The workbench uses semantic landmarks, headings and labelled native controls, supports keyboard operation, visible focus, reduced-width layouts, and system/light/dark themes through the Toolbox shell. Results do not rely on colour alone.
public/docs/ARCHITECTURE.md
+25
View File
@@ -0,0 +1,25 @@
# Architecture
Unicode Tools is a relocatable static React application. Pure text operations
live in `src/unicode/model.ts`, while catalog loading, search, character detail,
Unihan lookup, and confusable analysis run through a dedicated module worker.
Reusable encoding, scalar, grapheme, normalization and download primitives come
from `@add-ideas/toolbox-helpers`.
The build contains compressed-by-HTTP JSON shards rather than a runtime
database. A small manifest and dictionaries load first. The first catalog query
loads assigned character shards, emoji and named sequences once in the worker;
the roughly 5 MiB Unihan selection is fetched only after an explicit request.
Results and displayed mapping lists are capped. The UI retains no database or
persistent search history.
`scripts/generate-unicode-data.mjs` converts checksum-pinned Unicode 17.0
archives and text files into deterministic checked-in source data. It derives
names, aliases, general categories, scripts, blocks, ages, bidi and case
properties, emoji, named sequences, selected Unihan fields, and UTS #39
confusable mappings. Private-use and surrogate ranges are not expanded into
synthetic catalog records.
Rendering, normalization and grapheme segmentation use the current browser and
operating-system Unicode implementation, which can differ from the pinned
catalog version. The interface discloses that boundary.
public/docs/PRIVACY-SECURITY.md
+21
View File
@@ -0,0 +1,21 @@
# Privacy and security
Inputs remain in browser memory. There is no account, telemetry, analytics,
storage, or runtime network dependency. The application fetches only its own
versioned static catalog files and never sends search terms or inspected text.
Input is rendered as React text, not executable HTML.
Text inspection is limited to 1,000,000 UTF-16 code units, scalar decoding to
10,000 values, catalog results to 180, emoji results to 240, and displayed
confusable mappings to 500. Large static datasets are held in a worker so the
UI can remain responsive. Unihan data loads only on demand.
UTS #39 skeleton equivalence and mixed-script detection are review signals.
They are not proof of spoofing, maliciousness, safety, or identifier validity;
applications still need a context-specific identifier profile and policy.
Character glyphs come from the user's fonts, so a missing or surprising glyph
does not alter the underlying code point.
Developers can regenerate the catalog, but every upstream byte sequence must
match a hard-coded SHA-256 before parsing. The public release performs no such
download. Data source identities are inspectable and exportable from the app.
public/favicon.svg
+1
View File
@@ -0,0 +1 @@
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 64 64" role="img" aria-label="Unicode Tools"><path fill="#5b4ec4" d="M11 4h30l12 12v44H11z"/><path fill="#fff" opacity=".28" d="M41 4v14h12"/><text x="32" y="43" fill="#fff" font-family="system-ui,sans-serif" font-size="18" font-weight="800" text-anchor="middle">UN</text></svg>
Side by Side

After

Width:  |  Height:  |  Size: 332 B

public/manifest.webmanifest
+18
View File
@@ -0,0 +1,18 @@
{
"name": "Unicode Tools",
"short_name": "Unicode",
"description": "Explore Unicode characters, scripts, emoji and text locally.",
"start_url": "./",
"scope": "./",
"display": "standalone",
"background_color": "#f6f7fb",
"theme_color": "#29255f",
"icons": [
{
"src": "./favicon.svg",
"sizes": "any",
"type": "image/svg+xml",
"purpose": "any maskable"
}
]
}
public/sw.js
+54
View File
@@ -0,0 +1,54 @@
const CACHE_PREFIX = "unicode-tools-shell-";
const CACHE_NAME = CACHE_PREFIX + "0.1.0";
const CORE = ["./", "./manifest.webmanifest", "./favicon.svg"];
self.addEventListener("install", (event) => {
event.waitUntil(
caches.open(CACHE_NAME).then(async (cache) => {
await cache.addAll(CORE);
const html = await (await fetch("./")).text();
const assets = [...html.matchAll(/(?:src|href)="(\.\/assets\/[^"]+)"/g)]
.map((match) => match[1])
.filter(Boolean);
await cache.addAll(assets);
}),
);
self.skipWaiting();
});
self.addEventListener("activate", (event) => {
event.waitUntil(
caches
.keys()
.then((keys) =>
Promise.all(
keys
.filter((key) => key.startsWith(CACHE_PREFIX) && key !== CACHE_NAME)
.map((key) => caches.delete(key)),
),
)
.then(() => self.clients.claim()),
);
});
self.addEventListener("fetch", (event) => {
if (event.request.method !== "GET") return;
const url = new URL(event.request.url);
if (
url.origin !== self.location.origin ||
!url.pathname.startsWith(new URL(self.registration.scope).pathname)
)
return;
event.respondWith(
caches.match(event.request).then(
(cached) =>
cached ??
fetch(event.request).then((response) => {
if (response.ok) {
const copy = response.clone();
void caches
.open(CACHE_NAME)
.then((cache) => cache.put(event.request, copy));
}
return response;
}),
),
);
});
public/toolbox-app.json
+41
View File
@@ -0,0 +1,41 @@
{
"$schema": "https://git.add-ideas.de/lotobo/toolbox-sdk/raw/branch/main/schemas/toolbox-app.v1.schema.json",
"schemaVersion": 1,
"id": "de.add-ideas.unicode-tools",
"name": "Unicode Tools",
"version": "0.1.0",
"description": "Explore Unicode characters, scripts, emoji and text locally.",
"entry": "./",
"icon": "./favicon.svg",
"categories": ["unicode", "text", "developer"],
"tags": ["unicode", "emoji", "character", "codepoint", "script", "block"],
"integration": {
"contextVersion": 1,
"launchModes": ["navigate", "new-tab"],
"embedding": "unsupported"
},
"requirements": {
"secureContext": false,
"workers": true,
"indexedDb": false,
"crossOriginIsolated": false,
"topLevelContext": false
},
"privacy": {
"processing": "local",
"fileUploads": false,
"telemetry": false,
"label": "Inputs stay in this browser; nothing is uploaded."
},
"source": {
"repository": "https://git.add-ideas.de/lotobo/unicode-tools",
"license": "GPL-3.0-or-later"
},
"actions": [
{
"id": "source",
"label": "Source",
"url": "https://git.add-ideas.de/lotobo/unicode-tools"
}
]
}
scripts/generate-toolbox-manifest.mjs
+33
View File
@@ -0,0 +1,33 @@
import { readFile, writeFile } from "node:fs/promises";
import path from "node:path";
import { fileURLToPath } from "node:url";
import { format } from "prettier";
const root = path.resolve(path.dirname(fileURLToPath(import.meta.url)), "..");
const sourcePath = path.join(root, "src/toolbox/manifest.source.json");
const outputPath = path.join(root, "public/toolbox-app.json");
const source = JSON.parse(await readFile(sourcePath, "utf8"));
const pkg = JSON.parse(await readFile(path.join(root, "package.json"), "utf8"));
const versionSource = await readFile(path.join(root, "src/version.ts"), "utf8");
const appVersion = /^export const APP_VERSION = "([^"]+)";$/mu.exec(
versionSource,
)?.[1];
const repository = "https://git.add-ideas.de/lotobo/" + pkg.name;
if (source.version !== pkg.version || appVersion !== pkg.version)
throw new Error("Version identity drift");
if (
source.id !== "de.add-ideas." + pkg.name ||
source.source?.repository !== repository ||
source.source?.license !== "GPL-3.0-or-later"
)
throw new Error("Manifest source identity is invalid");
const serialized = await format(JSON.stringify(source), {
filepath: outputPath,
});
if (process.argv.includes("--check")) {
if ((await readFile(outputPath, "utf8").catch(() => "")) !== serialized)
throw new Error("public/toolbox-app.json is stale");
console.log("Toolbox manifest is synchronized");
} else {
await writeFile(outputPath, serialized);
console.log("Generated public/toolbox-app.json");
}
scripts/generate-unicode-data.mjs
+462
View File
@@ -0,0 +1,462 @@
import { createHash } from "node:crypto";
import { mkdir, readFile, rm, writeFile } from "node:fs/promises";
import { dirname, join } from "node:path";
import { fileURLToPath } from "node:url";
import { unzipSync } from "fflate";
const root = dirname(dirname(fileURLToPath(import.meta.url)));
const cacheDirectory = join(root, ".cache", "unicode-17.0.0");
const outputDirectory = join(root, "public", "data");
const decoder = new TextDecoder();
const sources = [
{
id: "ucd",
filename: "UCD.zip",
url: "https://www.unicode.org/Public/17.0.0/ucd/UCD.zip",
sha256: "2066d1909b2ea93916ce092da1c0ee4808ea3ef8407c94b4f14f5b7eb263d28e",
},
{
id: "unihan",
filename: "Unihan.zip",
url: "https://www.unicode.org/Public/17.0.0/ucd/Unihan.zip",
sha256: "f7a48b2b545acfaa77b2d607ae28747404ce02baefee16396c5d2d7a8ef34b5e",
},
{
id: "emoji-test",
filename: "emoji-test.txt",
url: "https://www.unicode.org/Public/17.0.0/emoji/emoji-test.txt",
sha256: "1d8a944f88d7952f7ef7c5167fef3c67995bcae24543949710231b03a201acda",
},
{
id: "emoji-sequences",
filename: "emoji-sequences.txt",
url: "https://www.unicode.org/Public/17.0.0/emoji/emoji-sequences.txt",
sha256: "12cc8267dc33cbd11ed32bcf6fc5dc2ad9c7a77bae1bdfba2f41b1b9b3ead8dd",
},
{
id: "emoji-zwj",
filename: "emoji-zwj-sequences.txt",
url: "https://www.unicode.org/Public/17.0.0/emoji/emoji-zwj-sequences.txt",
sha256: "5b25441daed2322b068c5e70cda522946a4f0274df864445a1965a92e5fc5cad",
},
{
id: "uts39",
filename: "uts39-data-17.0.0.zip",
url: "https://www.unicode.org/Public/security/latest/uts39-data-17.0.0.zip",
sha256: "349b8d9bbb4718e6bb58a8e8ee774857762e8121742e762e1bfb7152bd4c4238",
},
{
id: "license",
filename: "UNICODE-LICENSE-3.txt",
url: "https://www.unicode.org/license.txt",
sha256: "e7a93b009565cfce55919a381437ac4db883e9da2126fa28b91d12732bc53d96",
},
];
function hash(bytes) {
return createHash("sha256").update(bytes).digest("hex");
}
async function acquire(source) {
const target = join(cacheDirectory, source.filename);
try {
const cached = await readFile(target);
if (hash(cached) === source.sha256) return cached;
} catch {
/* Download below. */
}
const response = await fetch(source.url, { redirect: "follow" });
if (!response.ok)
throw new Error(
`Unable to download ${source.url}: HTTP ${response.status}`,
);
const bytes = Buffer.from(await response.arrayBuffer());
const actual = hash(bytes);
if (actual !== source.sha256)
throw new Error(
`SHA-256 mismatch for ${source.filename}: expected ${source.sha256}, got ${actual}`,
);
await writeFile(target, bytes);
return bytes;
}
function textFromArchive(archive, name) {
const value = archive[name];
if (!value) throw new Error(`Required Unicode data file is absent: ${name}`);
return decoder.decode(value);
}
function lines(text) {
return text.replaceAll("\r\n", "\n").split("\n");
}
function parseRange(token) {
const [start, end = start] = token.trim().split("..");
return [Number.parseInt(start, 16), Number.parseInt(end, 16)];
}
function parseRanges(text) {
const result = [];
for (const raw of lines(text)) {
const content = raw.split("#", 1)[0]?.trim();
if (!content) continue;
const [rangeToken, valueToken] = content
.split(";")
.map((value) => value.trim());
if (!rangeToken || !valueToken) continue;
const [start, end] = parseRange(rangeToken);
result.push({ start, end, value: valueToken });
}
return result.sort((left, right) => left.start - right.start);
}
function findRange(ranges, point, fallback) {
let low = 0;
let high = ranges.length - 1;
while (low <= high) {
const middle = (low + high) >>> 1;
const range = ranges[middle];
if (point < range.start) high = middle - 1;
else if (point > range.end) low = middle + 1;
else return range.value;
}
return fallback;
}
function parseDerivedNames(text) {
const values = new Map();
for (const raw of lines(text)) {
const content = raw.split("#", 1)[0]?.trim();
if (!content) continue;
const [rangeToken, nameToken] = content
.split(";")
.map((value) => value.trim());
if (!rangeToken || !nameToken) continue;
const [start, end] = parseRange(rangeToken);
for (let point = start; point <= end; point += 1) {
values.set(
point,
nameToken.includes("*")
? nameToken.replace(
"*",
point.toString(16).toUpperCase().padStart(4, "0"),
)
: nameToken,
);
}
}
return values;
}
function parseAliases(text) {
const values = new Map();
for (const raw of lines(text)) {
const content = raw.split("#", 1)[0]?.trim();
if (!content) continue;
const [pointToken, alias, type] = content
.split(";")
.map((value) => value.trim());
const point = Number.parseInt(pointToken, 16);
if (!Number.isFinite(point) || !alias) continue;
const list = values.get(point) ?? [];
list.push(type ? `${alias} (${type})` : alias);
values.set(point, list);
}
return values;
}
function parseEmojiFlags(text) {
const flags = new Map();
const bitByProperty = new Map([
["Emoji", 1],
["Emoji_Presentation", 2],
["Emoji_Modifier", 4],
["Emoji_Modifier_Base", 8],
["Extended_Pictographic", 16],
]);
for (const range of parseRanges(text)) {
const bit = bitByProperty.get(range.value);
if (!bit) continue;
for (let point = range.start; point <= range.end; point += 1)
flags.set(point, (flags.get(point) ?? 0) | bit);
}
return flags;
}
function parseEmoji(text) {
const result = [];
let group = "Other";
let subgroup = "Other";
for (const raw of lines(text)) {
if (raw.startsWith("# group:")) {
group = raw.slice(8).trim();
continue;
}
if (raw.startsWith("# subgroup:")) {
subgroup = raw.slice(11).trim();
continue;
}
const [definition, annotation] = raw.split("#");
if (!definition || !annotation) continue;
const [pointsToken, statusToken] = definition
.split(";")
.map((value) => value.trim());
const status = statusToken?.trim();
if (status !== "fully-qualified" && status !== "component") continue;
const match = /^\s*(\S+)\s+E([0-9.]+)\s+(.+)$/u.exec(annotation);
if (!match || !pointsToken) continue;
const points = pointsToken
.split(/\s+/u)
.map((value) => Number.parseInt(value, 16));
result.push([
points,
match[1],
match[3],
group,
subgroup,
status,
match[2],
]);
}
return result;
}
function parseNamedSequences(text) {
const result = [];
for (const raw of lines(text)) {
const content = raw.split("#", 1)[0]?.trim();
if (!content) continue;
const [name, pointsToken] = content.split(";").map((value) => value.trim());
if (!name || !pointsToken) continue;
const points = pointsToken
.split(/\s+/u)
.map((value) => Number.parseInt(value, 16));
result.push([name, points, String.fromCodePoint(...points)]);
}
return result;
}
function parseConfusables(text) {
const result = [];
for (const raw of lines(text)) {
const content = raw.split("#", 1)[0]?.trim();
if (!content) continue;
const [sourceToken, targetToken, type] = content
.split(";")
.map((value) => value.trim());
if (!sourceToken || !targetToken) continue;
const source = String.fromCodePoint(
...sourceToken.split(/\s+/u).map((value) => Number.parseInt(value, 16)),
);
const target = String.fromCodePoint(
...targetToken.split(/\s+/u).map((value) => Number.parseInt(value, 16)),
);
result.push([source, target, type]);
}
return result;
}
function parseUnihan(archive) {
const wanted = new Map([
["kDefinition", 1],
["kMandarin", 2],
["kCantonese", 3],
["kJapaneseOn", 4],
["kJapaneseKun", 5],
["kKorean", 6],
["kTotalStrokes", 7],
["kRSUnicode", 8],
]);
const records = new Map();
for (const [name, bytes] of Object.entries(archive)) {
if (!name.endsWith(".txt")) continue;
for (const raw of lines(decoder.decode(bytes))) {
if (!raw.startsWith("U+")) continue;
const [pointToken, field, value] = raw.split("\t");
const index = wanted.get(field);
if (!index || !value) continue;
const point = Number.parseInt(pointToken.slice(2), 16);
const record = records.get(point) ?? [
point,
"",
"",
"",
"",
"",
"",
"",
"",
];
record[index] = value;
records.set(point, record);
}
}
return [...records.values()].sort((left, right) => left[0] - right[0]);
}
function dictionaryIndex(dictionary, value) {
let index = dictionary.index.get(value);
if (index !== undefined) return index;
index = dictionary.values.length;
dictionary.values.push(value);
dictionary.index.set(value, index);
return index;
}
function scalarOrNull(value) {
return value ? Number.parseInt(value, 16) : null;
}
await mkdir(cacheDirectory, { recursive: true });
await rm(outputDirectory, { recursive: true, force: true });
await mkdir(outputDirectory, { recursive: true });
const acquired = new Map();
for (const source of sources) acquired.set(source.id, await acquire(source));
const ucd = unzipSync(new Uint8Array(acquired.get("ucd")));
const unihan = unzipSync(new Uint8Array(acquired.get("unihan")));
const security = unzipSync(new Uint8Array(acquired.get("uts39")));
const scripts = parseRanges(textFromArchive(ucd, "Scripts.txt"));
const blocks = parseRanges(textFromArchive(ucd, "Blocks.txt"));
const ages = parseRanges(textFromArchive(ucd, "DerivedAge.txt"));
const names = parseDerivedNames(
textFromArchive(ucd, "extracted/DerivedName.txt"),
);
const aliases = parseAliases(textFromArchive(ucd, "NameAliases.txt"));
const emojiFlags = parseEmojiFlags(
textFromArchive(ucd, "emoji/emoji-data.txt"),
);
const dictionaries = {
categories: { values: [], index: new Map() },
bidiClasses: { values: [], index: new Map() },
scripts: { values: [], index: new Map() },
blocks: { values: [], index: new Map() },
ages: { values: [], index: new Map() },
};
const planes = new Map();
let pendingRange;
function addRecord(point, fields) {
// Private-use code points and UTF-16 surrogates have no interoperable
// character identity. Their ranges remain visible through Blocks.txt, but
// emitting one synthetic search row per code point would add ~140,000
// misleading records and more than 10 MiB to every release.
if (fields[2] === "Co" || fields[2] === "Cs") return;
const plane = point >>> 16;
const list = planes.get(plane) ?? [];
list.push([
point,
names.get(point) ?? fields[1] ?? "",
dictionaryIndex(dictionaries.categories, fields[2] || "Cn"),
dictionaryIndex(dictionaries.scripts, findRange(scripts, point, "Unknown")),
dictionaryIndex(dictionaries.blocks, findRange(blocks, point, "No_Block")),
dictionaryIndex(dictionaries.ages, findRange(ages, point, "Unassigned")),
Number(fields[3] || 0),
dictionaryIndex(dictionaries.bidiClasses, fields[4] || "L"),
fields[5] || "",
fields[6] || "",
fields[8] || "",
fields[9] === "Y" ? 1 : 0,
scalarOrNull(fields[12]),
scalarOrNull(fields[13]),
scalarOrNull(fields[14]),
aliases.get(point) ?? null,
emojiFlags.get(point) ?? 0,
]);
planes.set(plane, list);
}
for (const raw of lines(textFromArchive(ucd, "UnicodeData.txt"))) {
if (!raw) continue;
const fields = raw.split(";");
const point = Number.parseInt(fields[0], 16);
if (fields[1]?.endsWith(", First>")) {
pendingRange = { point, fields };
continue;
}
if (fields[1]?.endsWith(", Last>")) {
if (!pendingRange)
throw new Error(`Range end without start at U+${fields[0]}`);
for (let current = pendingRange.point; current <= point; current += 1)
addRecord(current, pendingRange.fields);
pendingRange = undefined;
continue;
}
addRecord(point, fields);
}
if (pendingRange) throw new Error("Unclosed range in UnicodeData.txt");
const planeManifest = [];
let characterCount = 0;
for (const [plane, records] of [...planes].sort(
(left, right) => left[0] - right[0],
)) {
const filename = `characters-${plane}.json`;
await writeFile(join(outputDirectory, filename), JSON.stringify(records));
planeManifest.push({ plane, filename, count: records.length });
characterCount += records.length;
}
const emoji = parseEmoji(decoder.decode(acquired.get("emoji-test")));
const namedSequences = parseNamedSequences(
textFromArchive(ucd, "NamedSequences.txt"),
);
const confusables = parseConfusables(
textFromArchive(security, "confusables.txt"),
);
const unihanRecords = parseUnihan(unihan);
await writeFile(join(outputDirectory, "emoji.json"), JSON.stringify(emoji));
await writeFile(
join(outputDirectory, "named-sequences.json"),
JSON.stringify(namedSequences),
);
await writeFile(
join(outputDirectory, "confusables.json"),
JSON.stringify(confusables),
);
await writeFile(
join(outputDirectory, "unihan.json"),
JSON.stringify(unihanRecords),
);
const manifest = {
schemaVersion: 1,
unicodeVersion: "17.0.0",
emojiVersion: "17.0",
characterCount,
planes: planeManifest,
dictionaries: Object.fromEntries(
Object.entries(dictionaries).map(([key, value]) => [key, value.values]),
),
blockRanges: blocks,
scriptRanges: scripts,
emojiCount: emoji.length,
namedSequenceCount: namedSequences.length,
confusableMappingCount: confusables.length,
unihanCount: unihanRecords.length,
sourceIdentity: sources.map(({ id, filename, url, sha256 }) => ({
id,
filename,
url,
sha256,
})),
};
await writeFile(
join(outputDirectory, "manifest.json"),
`${JSON.stringify(manifest, null, 2)}\n`,
);
await writeFile(
join(outputDirectory, "SOURCES.json"),
`${JSON.stringify({ schemaVersion: 1, unicodeVersion: "17.0.0", sources: manifest.sourceIdentity }, null, 2)}\n`,
);
await mkdir(join(root, "LICENSES"), { recursive: true });
await writeFile(
join(root, "LICENSES", "UNICODE-3.0.txt"),
acquired.get("license"),
);
process.stdout.write(
`Generated ${characterCount.toLocaleString("en")} characters, ${emoji.length.toLocaleString("en")} emoji, ${unihanRecords.length.toLocaleString("en")} Unihan records, and ${confusables.length.toLocaleString("en")} confusable mappings.\n`,
);
scripts/package-release.mjs
+165
View File
@@ -0,0 +1,165 @@
#!/usr/bin/env node
import { createHash } from "node:crypto";
import { execFile } from "node:child_process";
import {
access,
chmod,
copyFile,
cp,
lstat,
mkdir,
mkdtemp,
readFile,
readdir,
rename,
rm,
utimes,
writeFile,
} from "node:fs/promises";
import os from "node:os";
import path from "node:path";
import { promisify } from "node:util";
import { fileURLToPath } from "node:url";
const execute = promisify(execFile);
const root = path.resolve(path.dirname(fileURLToPath(import.meta.url)), "..");
const pkg = JSON.parse(await readFile(path.join(root, "package.json"), "utf8"));
const argument = (name, fallback) => {
const index = process.argv.indexOf(name);
return index >= 0 ? process.argv[index + 1] : fallback;
};
const output = path.resolve(
root,
argument("--output", "release/" + pkg.name + "-" + pkg.version + ".zip"),
);
const checksumOutput = output + ".sha256";
const force = process.argv.includes("--force");
if (
path.extname(output).toLowerCase() !== ".zip" ||
output === root ||
output === path.parse(output).root
)
throw new Error("Unsafe release target");
const exists = (file) =>
access(file).then(
() => true,
() => false,
);
if (!force && ((await exists(output)) || (await exists(checksumOutput))))
throw new Error("Release output exists");
const input = path.join(root, "dist");
for (const name of [
"index.html",
"manifest.webmanifest",
"sw.js",
"toolbox-app.json",
"favicon.svg",
"README.md",
"CHANGELOG.md",
"CONTRIBUTING.md",
"LICENSE",
"SECURITY.md",
"SOURCE.md",
"THIRD_PARTY_NOTICES.md",
"LICENSES/README.md",
"LICENSES/npm-runtime-licenses.txt",
"docs/ACCESSIBILITY.md",
"docs/ARCHITECTURE.md",
"docs/PRIVACY-SECURITY.md",
]) {
const details = await lstat(path.join(input, name)).catch(() => null);
if (!details?.isFile() || details.isSymbolicLink())
throw new Error("Missing release file: " + name);
}
const manifest = JSON.parse(
await readFile(path.join(input, "toolbox-app.json"), "utf8"),
);
const repository = "https://git.add-ideas.de/lotobo/" + pkg.name;
if (
manifest.id !== "de.add-ideas." + pkg.name ||
manifest.version !== pkg.version ||
manifest.entry !== "./" ||
manifest.icon !== "./favicon.svg" ||
manifest.source?.repository !== repository
)
throw new Error("Packaged manifest identity is invalid");
if (
/\b(?:src|href)=["']\//iu.test(
await readFile(path.join(input, "index.html"), "utf8"),
)
)
throw new Error("Root-absolute asset reference");
async function collect(directory, prefix = "") {
const files = [];
for (const entry of (await readdir(directory, { withFileTypes: true })).sort(
(a, b) => a.name.localeCompare(b.name),
)) {
const absolute = path.join(directory, entry.name);
const relative = prefix ? prefix + "/" + entry.name : entry.name;
if (entry.isSymbolicLink())
throw new Error("Symlink in release: " + relative);
if (entry.isDirectory()) files.push(...(await collect(absolute, relative)));
else if (entry.isFile()) files.push({ absolute, relative });
else throw new Error("Unsupported release entry: " + relative);
}
return files;
}
const sourceFiles = await collect(input);
for (const file of sourceFiles)
if (
file.relative.endsWith(".map") ||
/(?:^|\/)(?:\.env(?:\.|$)|id_rsa|id_ed25519|.*\.pem$|.*\.key$)/iu.test(
file.relative,
) ||
file.relative.split("/").includes("..")
)
throw new Error("Forbidden release entry: " + file.relative);
await mkdir(path.dirname(output), { recursive: true });
const stagingRoot = await mkdtemp(
path.join(os.tmpdir(), pkg.name + "-release-"),
);
const publicationRoot = await mkdtemp(
path.join(path.dirname(output), "." + pkg.name + "-publish-"),
);
const stagedTree = path.join(stagingRoot, "tree");
const stagedArchive = path.join(stagingRoot, path.basename(output));
try {
await cp(input, stagedTree, { recursive: true });
const timestamp = new Date("1980-01-01T00:00:00.000Z");
for (const file of await collect(stagedTree)) {
await chmod(file.absolute, 0o644);
await utimes(file.absolute, timestamp, timestamp);
}
await execute(
"zip",
[
"-X",
"-q",
"-9",
stagedArchive,
...sourceFiles.map((file) => file.relative),
],
{
cwd: stagedTree,
env: { ...process.env, TZ: "UTC" },
maxBuffer: 1024 * 1024,
},
);
const archive = await readFile(stagedArchive);
const digest = createHash("sha256").update(archive).digest("hex");
const stagedChecksum = stagedArchive + ".sha256";
await writeFile(stagedChecksum, digest + " " + path.basename(output) + "\n");
const publicationArchive = path.join(publicationRoot, path.basename(output));
const publicationChecksum = publicationArchive + ".sha256";
await copyFile(stagedArchive, publicationArchive);
await copyFile(stagedChecksum, publicationChecksum);
if (force) {
await rm(output, { force: true });
await rm(checksumOutput, { force: true });
}
await rename(publicationArchive, output);
await rename(publicationChecksum, checksumOutput);
console.log("Created " + path.relative(root, output) + "\nSHA-256 " + digest);
} finally {
await rm(stagingRoot, { recursive: true, force: true });
await rm(publicationRoot, { recursive: true, force: true });
}
scripts/prepare-release-files.mjs
+70
View File
@@ -0,0 +1,70 @@
import { cp, mkdir, readFile, readdir, rm, writeFile } from "node:fs/promises";
import path from "node:path";
import { fileURLToPath } from "node:url";
const root = path.resolve(path.dirname(fileURLToPath(import.meta.url)), "..");
const destination = path.join(root, "public");
for (const name of [
"LICENSE",
"README.md",
"CHANGELOG.md",
"CONTRIBUTING.md",
"SECURITY.md",
"SOURCE.md",
"THIRD_PARTY_NOTICES.md",
]) {
await readFile(path.join(root, name));
await cp(path.join(root, name), path.join(destination, name));
}
for (const directory of ["LICENSES", "docs"]) {
const output = path.join(destination, directory);
await rm(output, { recursive: true, force: true });
await cp(path.join(root, directory), output, { recursive: true });
}
const lock = JSON.parse(
await readFile(path.join(root, "package-lock.json"), "utf8"),
);
const sections = [];
for (const [location, locked] of Object.entries(lock.packages ?? {}).sort(
([a], [b]) => a.localeCompare(b),
)) {
if (!location.includes("node_modules/") || locked.dev === true) continue;
const packageDirectory = path.join(root, location);
const details = JSON.parse(
await readFile(path.join(packageDirectory, "package.json"), "utf8"),
);
const candidates = (await readdir(packageDirectory))
.filter((name) => /^(?:licen[cs]e|copying|notice)(?:\.|$)/iu.test(name))
.sort();
const texts = [];
for (const candidate of candidates) {
try {
texts.push(
"--- " +
candidate +
" ---\n" +
(await readFile(path.join(packageDirectory, candidate), "utf8")),
);
} catch {
/* directory */
}
}
sections.push(
"=".repeat(78) +
"\n" +
details.name +
"@" +
details.version +
"\nDeclared licence: " +
(details.license ?? locked.license ?? "See upstream") +
"\n" +
"=".repeat(78) +
"\n" +
(texts.join("\n\n") || "See upstream package metadata."),
);
}
await mkdir(path.join(destination, "LICENSES"), { recursive: true });
await writeFile(
path.join(destination, "LICENSES/npm-runtime-licenses.txt"),
sections.join("\n\n").trimEnd() + "\n",
);
console.log("Prepared release documentation");
scripts/serve-test.mjs
+66
View File
@@ -0,0 +1,66 @@
import { createServer } from "node:http";
import { readFile, stat } from "node:fs/promises";
import path from "node:path";
import { fileURLToPath } from "node:url";
const root = path.resolve(
path.dirname(fileURLToPath(import.meta.url)),
"..",
"dist",
);
const prefix = "/deep/nested/unicode/";
const types = new Map([
[".css", "text/css; charset=utf-8"],
[".html", "text/html; charset=utf-8"],
[".js", "text/javascript; charset=utf-8"],
[".json", "application/json; charset=utf-8"],
[".webmanifest", "application/manifest+json; charset=utf-8"],
[".svg", "image/svg+xml"],
[".md", "text/markdown; charset=utf-8"],
[".txt", "text/plain; charset=utf-8"],
[".wasm", "application/wasm"],
[".png", "image/png"],
[".jpg", "image/jpeg"],
[".webp", "image/webp"],
]);
const headers = {
"Content-Security-Policy":
"default-src 'self'; base-uri 'self'; object-src 'none'; frame-ancestors 'none'; form-action 'self'; script-src 'self' 'wasm-unsafe-eval'; style-src 'self' 'unsafe-inline'; img-src 'self' data: blob:; media-src 'self' blob:; connect-src 'self'; worker-src 'self' blob:; manifest-src 'self'",
"Cross-Origin-Opener-Policy": "same-origin",
"Cross-Origin-Resource-Policy": "same-origin",
"Permissions-Policy":
"camera=(), microphone=(), geolocation=(), usb=(), payment=()",
"Referrer-Policy": "no-referrer",
"X-Content-Type-Options": "nosniff",
};
const server = createServer(async (request, response) => {
try {
const url = new URL(request.url ?? "/", "http://127.0.0.1");
const relative = decodeURIComponent(url.pathname).startsWith(prefix)
? decodeURIComponent(url.pathname).slice(prefix.length)
: decodeURIComponent(url.pathname).replace(/^\/+/, "");
const normalized = path.posix.normalize(relative || "index.html");
if (
normalized === ".." ||
normalized.startsWith("../") ||
path.isAbsolute(normalized)
) {
response.writeHead(400).end("Bad request");
return;
}
let file = path.join(root, normalized);
if ((await stat(file).catch(() => null))?.isDirectory())
file = path.join(file, "index.html");
const content = await readFile(file);
response.writeHead(200, {
"Content-Type":
types.get(path.extname(file)) ?? "application/octet-stream",
"Cache-Control": "no-cache",
...headers,
});
response.end(content);
} catch {
response.writeHead(404, { "Content-Type": "text/plain; charset=utf-8" });
response.end("Not found");
}
});
server.listen(4173, "127.0.0.1", () => console.log("Test server ready"));
src/App.tsx
+35
View File
@@ -0,0 +1,35 @@
import { lazy, Suspense, useState } from "react";
import { AppShell } from "@add-ideas/toolbox-shell-react";
import "@add-ideas/toolbox-shell-react/styles.css";
import "./styles.css";
import { ErrorBoundary } from "./components/ErrorBoundary";
import { HelpDialog } from "./components/HelpDialog";
import { manifest } from "./toolbox/manifest";
const Workbench = lazy(async () => ({
default: (await import("./components/Workbench")).Workbench,
}));
export function App() {
const [helpOpen, setHelpOpen] = useState(false);
return (
<ErrorBoundary>
<AppShell
app={manifest}
manifestUrl="./toolbox-app.json"
helpAction={{ onClick: () => setHelpOpen(true) }}
>
<Suspense
fallback={
<p className="loading" role="status">
Preparing Unicode Tools…
</p>
}
>
<Workbench />
</Suspense>
</AppShell>
<HelpDialog open={helpOpen} onClose={() => setHelpOpen(false)} />
</ErrorBoundary>
);
}
src/components/ErrorBoundary.tsx
+27
View File
@@ -0,0 +1,27 @@
import { Component, type ErrorInfo, type ReactNode } from "react";
export class ErrorBoundary extends Component<
{ children: ReactNode },
{ error?: Error }
> {
state: { error?: Error } = {};
static getDerivedStateFromError(error: Error) {
return { error };
}
componentDidCatch(error: Error, info: ErrorInfo) {
console.error("Application failure", error, info);
}
render() {
if (this.state.error)
return (
<main className="fatal">
<h1>Unicode Tools could not continue</h1>
<p>{this.state.error.message}</p>
<button type="button" onClick={() => location.reload()}>
Reload
</button>
</main>
);
return this.props.children;
}
}
src/components/HelpDialog.tsx
+41
View File
@@ -0,0 +1,41 @@
import { useEffect, useRef } from "react";
export function HelpDialog({
open,
onClose,
}: {
open: boolean;
onClose: () => void;
}) {
const dialog = useRef<HTMLDialogElement>(null);
useEffect(() => {
const node = dialog.current;
if (!node) return;
if (open && !node.open) node.showModal();
if (!open && node.open) node.close();
}, [open]);
return (
<dialog
ref={dialog}
className="help-dialog"
onClose={onClose}
onCancel={onClose}
aria-labelledby="help-title"
>
<div className="dialog-heading">
<div>
<p className="eyebrow">Local-first help</p>
<h2 id="help-title">About Unicode Tools</h2>
</div>
<button type="button" onClick={onClose} aria-label="Close help">
×
</button>
</div>
<p>Explore Unicode characters, scripts, emoji and text locally.</p>
<p>
All processing is performed in this browser. Imported data is treated as
untrusted and bounded before parsing.
</p>
</dialog>
);
}
src/components/Workbench.tsx
+1016
View File
File diff suppressed because it is too large Load Diff
src/main.tsx
+18
View File
@@ -0,0 +1,18 @@
import { StrictMode } from "react";
import { createRoot } from "react-dom/client";
import { App } from "./App";
createRoot(document.getElementById("root")!).render(
<StrictMode>
<App />
</StrictMode>,
);
if ("serviceWorker" in navigator && import.meta.env.PROD) {
window.addEventListener("load", () => {
const url = new URL("./sw.js", document.baseURI);
void navigator.serviceWorker
.register(url, { scope: new URL("./", document.baseURI).pathname })
.catch(() => undefined);
});
}
src/styles.css
+508
View File
@@ -0,0 +1,508 @@
:root {
--toolbox-background: #f6f7fb;
--toolbox-surface: #fff;
--toolbox-surface-soft: #eff1f7;
--toolbox-text: #202332;
--toolbox-muted: #656b7d;
--toolbox-border: #d9dce7;
--toolbox-accent: #5b4ec4;
--toolbox-accent-hover: #493caf;
--toolbox-accent-soft: #ece9ff;
--toolbox-accent-contrast: #fff;
--toolbox-focus: #137d75;
--toolbox-danger: #b42342;
}
* {
box-sizing: border-box;
}
html {
min-width: 20rem;
min-height: 100%;
background: var(--toolbox-background);
scrollbar-gutter: stable;
}
body {
min-width: 20rem;
min-height: 100vh;
margin: 0;
background: var(--toolbox-background);
color: var(--toolbox-text);
font-family: Inter, ui-sans-serif, system-ui, sans-serif;
}
button,
input,
select,
textarea {
font: inherit;
}
button,
.button {
min-height: 2.55rem;
display: inline-flex;
align-items: center;
justify-content: center;
gap: 0.4rem;
padding: 0.55rem 0.8rem;
border: 1px solid var(--toolbox-border);
border-radius: 0.65rem;
background: var(--toolbox-surface);
color: var(--toolbox-text);
font-weight: 720;
cursor: pointer;
text-decoration: none;
}
button:hover:not(:disabled),
.button:hover {
border-color: var(--toolbox-accent);
background: var(--toolbox-surface-soft);
}
:where(button, input, select, textarea, a):focus-visible {
outline: 3px solid color-mix(in srgb, var(--toolbox-focus) 42%, transparent);
outline-offset: 2px;
}
input,
select,
textarea {
width: 100%;
min-height: 2.55rem;
padding: 0.58rem 0.7rem;
border: 1px solid var(--toolbox-border);
border-radius: 0.62rem;
background: var(--toolbox-surface);
color: var(--toolbox-text);
}
textarea {
min-height: 8rem;
resize: vertical;
font-family: ui-monospace, SFMono-Regular, Consolas, monospace;
line-height: 1.48;
}
.toolbox-shell__main {
width: min(100%, 90rem);
padding: clamp(0.75rem, 1.8vw, 1.5rem);
}
.workbench {
display: grid;
gap: 1rem;
}
.hero,
.panel,
.empty {
border: 1px solid var(--toolbox-border);
border-radius: 0.9rem;
background: var(--toolbox-surface);
box-shadow: 0 8px 28px rgb(30 36 70 / 4%);
}
.hero {
display: flex;
justify-content: space-between;
gap: 1rem;
align-items: flex-start;
padding: clamp(1.1rem, 3vw, 2rem);
}
.hero h1,
.panel h2,
.detail h2,
.help-dialog h2,
.fatal h1 {
margin: 0;
letter-spacing: -0.025em;
}
.hero p:not(.eyebrow) {
max-width: 56rem;
margin: 0.55rem 0 0;
color: var(--toolbox-muted);
line-height: 1.55;
}
.eyebrow {
margin: 0 0 0.3rem;
color: var(--toolbox-accent);
font-size: 0.69rem;
font-weight: 820;
letter-spacing: 0.115em;
text-transform: uppercase;
}
.privacy-pill,
.count {
flex: 0 0 auto;
padding: 0.38rem 0.62rem;
border-radius: 999px;
background: var(--toolbox-accent-soft);
color: var(--toolbox-accent);
font-size: 0.75rem;
font-weight: 760;
}
.panel {
padding: 1rem;
}
.panel-heading {
display: flex;
justify-content: space-between;
gap: 1rem;
align-items: end;
margin-bottom: 0.9rem;
}
.workspace {
display: grid;
gap: 0.9rem;
min-width: 0;
}
.workspace-tabs {
display: flex;
gap: 0.4rem;
overflow-x: auto;
padding: 0.75rem;
}
.workspace-tabs button[aria-selected="true"] {
border-color: var(--toolbox-accent);
background: var(--toolbox-accent);
color: var(--toolbox-accent-contrast);
}
.field {
display: grid;
gap: 0.35rem;
min-width: 0;
}
.field > span {
font-size: 0.76rem;
font-weight: 750;
}
.form-grid {
display: grid;
grid-template-columns: repeat(auto-fit, minmax(min(100%, 13rem), 1fr));
gap: 0.65rem;
}
.search-row {
display: flex;
gap: 0.65rem;
align-items: end;
}
.grow {
flex: 1 1 auto;
}
.actions,
.chip-row {
display: flex;
gap: 0.5rem;
flex-wrap: wrap;
}
.primary {
border-color: var(--toolbox-accent);
background: var(--toolbox-accent);
color: var(--toolbox-accent-contrast);
}
.muted {
margin: 0;
color: var(--toolbox-muted);
line-height: 1.5;
}
.result-grid {
display: grid;
grid-template-columns: repeat(auto-fill, minmax(min(100%, 15rem), 1fr));
gap: 0.7rem;
}
.character-card {
min-height: 8rem;
justify-content: start;
padding: 0.8rem;
text-align: left;
overflow: hidden;
}
.glyph {
flex: 0 0 3.5rem;
display: grid;
place-items: center;
min-height: 3.5rem;
border-radius: 0.65rem;
background: var(--toolbox-surface-soft);
font-family: "Noto Sans", "Segoe UI Symbol", sans-serif;
font-size: 2rem;
}
.card-copy {
min-width: 0;
display: grid;
gap: 0.25rem;
}
.card-copy strong {
overflow: hidden;
text-overflow: ellipsis;
}
.card-copy small,
.code {
color: var(--toolbox-muted);
font-family: ui-monospace, SFMono-Regular, Consolas, monospace;
}
.detail {
display: grid;
grid-template-columns: minmax(8rem, 14rem) 1fr;
gap: 1.2rem;
align-items: start;
}
.detail-glyph {
min-height: 12rem;
display: grid;
place-items: center;
border-radius: 0.8rem;
background: var(--toolbox-surface-soft);
font-family: "Noto Sans", "Segoe UI Symbol", sans-serif;
font-size: clamp(4rem, 11vw, 9rem);
overflow: hidden;
}
.detail-copy {
display: grid;
gap: 0.8rem;
min-width: 0;
}
.property-grid {
display: grid;
grid-template-columns: repeat(auto-fit, minmax(min(100%, 14rem), 1fr));
gap: 0.6rem;
margin: 0;
}
.property-grid div {
min-width: 0;
padding: 0.65rem;
border-radius: 0.6rem;
background: var(--toolbox-surface-soft);
}
.property-grid dt {
color: var(--toolbox-muted);
font-size: 0.72rem;
font-weight: 760;
}
.property-grid dd {
margin: 0.3rem 0 0;
overflow-wrap: anywhere;
}
.emoji-grid {
display: grid;
grid-template-columns: repeat(auto-fill, minmax(min(100%, 12rem), 1fr));
gap: 0.7rem;
}
.emoji-card {
min-height: 10rem;
display: grid;
justify-items: center;
align-content: center;
gap: 0.35rem;
padding: 0.8rem;
text-align: center;
}
.emoji-card > span {
font-family: "Apple Color Emoji", "Segoe UI Emoji", sans-serif;
font-size: 2.7rem;
}
.emoji-card strong {
font-size: 0.84rem;
}
.emoji-card small,
.emoji-card code {
color: var(--toolbox-muted);
font-size: 0.7rem;
}
.stats {
display: flex;
gap: 0.6rem;
flex-wrap: wrap;
}
.stats span,
.changed,
.same {
padding: 0.35rem 0.55rem;
border-radius: 999px;
background: var(--toolbox-accent-soft);
color: var(--toolbox-accent);
font-size: 0.76rem;
font-weight: 750;
}
.graphemes {
display: flex;
gap: 0.4rem;
flex-wrap: wrap;
}
.graphemes > span {
display: grid;
justify-items: center;
gap: 0.2rem;
min-width: 3rem;
padding: 0.45rem;
border: 1px solid var(--toolbox-border);
border-radius: 0.55rem;
}
.graphemes strong {
font-size: 1.35rem;
}
.graphemes small {
color: var(--toolbox-muted);
font-size: 0.65rem;
}
.table-scroll {
max-height: 40rem;
overflow: auto;
border: 1px solid var(--toolbox-border);
border-radius: 0.7rem;
}
table {
width: 100%;
border-collapse: collapse;
font-size: 0.82rem;
}
th,
td {
padding: 0.55rem;
border-bottom: 1px solid var(--toolbox-border);
text-align: left;
vertical-align: top;
}
th {
position: sticky;
top: 0;
background: var(--toolbox-surface-soft);
z-index: 1;
}
.table-glyph {
font-size: 1.4rem;
}
.copy-output {
display: flex;
justify-content: space-between;
gap: 1rem;
align-items: center;
padding: 0.75rem;
border-radius: 0.65rem;
background: var(--toolbox-surface-soft);
}
.large-text {
margin: 0.4rem 0;
font-family: "Noto Sans", "Segoe UI Symbol", sans-serif;
font-size: 1.5rem;
overflow-wrap: anywhere;
}
.normalization-grid {
display: grid;
grid-template-columns: repeat(auto-fit, minmax(min(100%, 18rem), 1fr));
gap: 0.8rem;
}
.normalization-grid article {
display: grid;
gap: 0.7rem;
}
.same {
background: #eaf8ef;
color: #176137;
}
.mapping-list {
max-height: 24rem;
display: grid;
gap: 0.25rem;
padding: 0.7rem;
overflow: auto;
border-radius: 0.65rem;
background: var(--toolbox-surface-soft);
}
.collection-grid {
display: grid;
grid-template-columns: repeat(auto-fill, minmax(min(100%, 15rem), 1fr));
gap: 0.8rem;
}
.collection-card {
min-height: 9rem;
display: grid;
justify-items: start;
align-content: center;
gap: 0.45rem;
text-align: left;
}
.collection-card span,
.source-card p {
color: var(--toolbox-muted);
line-height: 1.45;
}
.collection-card small {
color: var(--toolbox-accent);
font-family: ui-monospace, monospace;
}
.source-card {
display: grid;
align-content: center;
}
.panel pre {
max-height: 38rem;
margin: 0;
padding: 0.8rem;
overflow: auto;
border-radius: 0.65rem;
background: var(--toolbox-surface-soft);
white-space: pre-wrap;
overflow-wrap: anywhere;
}
.empty {
min-height: 9rem;
display: grid;
place-items: center;
margin: 0;
padding: 2rem;
color: var(--toolbox-muted);
text-align: center;
}
.error,
.warning,
.notice {
margin: 0;
padding: 0.7rem;
border: 1px solid var(--toolbox-border);
border-radius: 0.65rem;
line-height: 1.5;
}
.error {
border-color: var(--toolbox-danger);
color: var(--toolbox-danger);
}
.warning {
border-color: #d9a72e;
background: #fff8df;
color: #725000;
}
.notice {
background: var(--toolbox-surface-soft);
}
.loading,
.fatal {
width: min(100% - 2rem, 60rem);
margin: 2rem auto;
padding: 1rem;
}
.help-dialog {
width: min(36rem, calc(100% - 2rem));
border: 1px solid var(--toolbox-border);
border-radius: 0.9rem;
background: var(--toolbox-surface);
color: var(--toolbox-text);
}
.help-dialog::backdrop {
background: rgb(20 24 45 / 55%);
}
.dialog-heading {
display: flex;
justify-content: space-between;
gap: 1rem;
align-items: start;
}
@media (max-width: 48rem) {
.hero,
.panel-heading,
.search-row {
flex-direction: column;
align-items: stretch;
}
.privacy-pill {
order: -1;
align-self: start;
}
.detail {
grid-template-columns: 1fr;
}
.detail-glyph {
min-height: 8rem;
}
}
src/test/setup.ts
+8
View File
@@ -0,0 +1,8 @@
import "@testing-library/jest-dom/vitest";
import { afterEach } from "vitest";
import { cleanup } from "@testing-library/react";
afterEach(() => {
cleanup();
localStorage.clear();
});
src/toolbox/manifest.source.json
+41
View File
@@ -0,0 +1,41 @@
{
"$schema": "https://git.add-ideas.de/lotobo/toolbox-sdk/raw/branch/main/schemas/toolbox-app.v1.schema.json",
"schemaVersion": 1,
"id": "de.add-ideas.unicode-tools",
"name": "Unicode Tools",
"version": "0.1.0",
"description": "Explore Unicode characters, scripts, emoji and text locally.",
"entry": "./",
"icon": "./favicon.svg",
"categories": ["unicode", "text", "developer"],
"tags": ["unicode", "emoji", "character", "codepoint", "script", "block"],
"integration": {
"contextVersion": 1,
"launchModes": ["navigate", "new-tab"],
"embedding": "unsupported"
},
"requirements": {
"secureContext": false,
"workers": true,
"indexedDb": false,
"crossOriginIsolated": false,
"topLevelContext": false
},
"privacy": {
"processing": "local",
"fileUploads": false,
"telemetry": false,
"label": "Inputs stay in this browser; nothing is uploaded."
},
"source": {
"repository": "https://git.add-ideas.de/lotobo/unicode-tools",
"license": "GPL-3.0-or-later"
},
"actions": [
{
"id": "source",
"label": "Source",
"url": "https://git.add-ideas.de/lotobo/unicode-tools"
}
]
}
src/toolbox/manifest.ts
+4
View File
@@ -0,0 +1,4 @@
import { defineToolboxApp, parseToolboxApp } from "@add-ideas/toolbox-contract";
import source from "./manifest.source.json";
export const manifest = defineToolboxApp(parseToolboxApp(source));
src/unicode/catalog.ts
+120
View File
@@ -0,0 +1,120 @@
import type {
CatalogResult,
CharacterDetail,
UnicodeManifest,
UnihanDetail,
} from "./types";
interface SearchOptions {
query: string;
script?: string;
category?: string;
block?: string;
limit?: number;
kinds?: Array<"character" | "emoji" | "sequence">;
}
let worker: Worker | undefined;
let nextId = 1;
const requests = new Map<
number,
{ resolve: (value: unknown) => void; reject: (reason: Error) => void }
>();
let ready: Promise<UnicodeManifest> | undefined;
function getWorker(): Worker {
if (worker) return worker;
worker = new Worker(
new URL("../workers/catalog.worker.ts", import.meta.url),
{ type: "module", name: "unicode-catalog" },
);
worker.addEventListener(
"message",
(
event: MessageEvent<{
id: number;
ok: boolean;
value?: unknown;
error?: string;
}>,
) => {
const request = requests.get(event.data.id);
if (!request) return;
requests.delete(event.data.id);
if (event.data.ok) request.resolve(event.data.value);
else
request.reject(new Error(event.data.error ?? "Unicode worker failed."));
},
);
worker.addEventListener("error", (event) => {
for (const request of requests.values())
request.reject(new Error(event.message || "Unicode worker stopped."));
requests.clear();
});
return worker;
}
function request<T>(
type: string,
payload: Record<string, unknown> = {},
): Promise<T> {
const id = nextId++;
return new Promise<T>((resolve, reject) => {
requests.set(id, { resolve: resolve as (value: unknown) => void, reject });
getWorker().postMessage({ id, type, payload });
});
}
export async function loadManifest(): Promise<UnicodeManifest> {
const response = await fetch(
new URL("./data/manifest.json", document.baseURI),
);
if (!response.ok)
throw new Error(
`Unable to load the Unicode data manifest: HTTP ${response.status}`,
);
return response.json() as Promise<UnicodeManifest>;
}
export function initializeCatalog(): Promise<UnicodeManifest> {
ready ??= request<UnicodeManifest>("init", {
base: new URL("./data/", document.baseURI).href,
});
return ready;
}
export async function searchCatalog(
options: SearchOptions,
): Promise<CatalogResult[]> {
await initializeCatalog();
return request<CatalogResult[]>(
"search",
options as unknown as Record<string, unknown>,
);
}
export async function characterDetail(
point: number,
): Promise<CharacterDetail | undefined> {
await initializeCatalog();
return request<CharacterDetail | undefined>("detail", { point });
}
export async function unihanDetail(
point: number,
): Promise<UnihanDetail | undefined> {
await initializeCatalog();
return request<UnihanDetail | undefined>("unihan", { point });
}
export async function analyzeConfusables(input: string): Promise<{
input: string;
normalized: string;
skeleton: string;
scripts: string[];
mixedScripts: boolean;
mappings: Array<{ source: string; target: string; point: string }>;
}> {
await initializeCatalog();
return request("confusables", { input });
}
src/unicode/model.ts
+89
View File
@@ -0,0 +1,89 @@
import {
fromCodePoints,
inspectCodePoints,
normalizeUnicode,
segmentGraphemes,
} from "@add-ideas/toolbox-helpers";
export function codePointLabel(point: number): string {
return `U+${point.toString(16).toUpperCase().padStart(4, "0")}`;
}
export function parseCodePointList(input: string): number[] {
const value = input.trim();
if (!value) return [];
const tokens = value.split(/[\s,;]+/u).filter(Boolean);
if (tokens.length > 10_000)
throw new RangeError("At most 10,000 code points can be decoded at once.");
return tokens.map((raw) => {
const token = raw
.replace(/^U\+/iu, "")
.replace(/^0x/iu, "")
.replace(/^\\u\{/iu, "")
.replace(/\}$/u, "")
.replace(/^&#x/iu, "")
.replace(/;$/u, "");
if (!/^[0-9a-f]{1,6}$/iu.test(token))
throw new SyntaxError(`Invalid hexadecimal code point: ${raw}`);
const point = Number.parseInt(token, 16);
if (point > 0x10ffff || (point >= 0xd800 && point <= 0xdfff))
throw new RangeError(`${raw} is not a Unicode scalar value.`);
return point;
});
}
export function decodeCodePointList(input: string): string {
return fromCodePoints(parseCodePointList(input));
}
export function inspectText(input: string) {
if (input.length > 1_000_000)
throw new RangeError(
"Text inspection is limited to 1,000,000 UTF-16 code units.",
);
const points = inspectCodePoints(input).map((item) => ({
...item,
decimal: item.codePoint.toString(10),
utf8: [...new TextEncoder().encode(item.character)]
.map((value) => value.toString(16).toUpperCase().padStart(2, "0"))
.join(" "),
javascript:
item.codePoint <= 0xffff
? `\\u${item.codePoint.toString(16).toUpperCase().padStart(4, "0")}`
: `\\u{${item.codePoint.toString(16).toUpperCase()}}`,
html: `&#x${item.codePoint.toString(16).toUpperCase()};`,
}));
return {
utf16Length: input.length,
codePointCount: points.length,
graphemes: segmentGraphemes(input),
points,
};
}
export function compareNormalization(input: string) {
const forms = (["NFC", "NFD", "NFKC", "NFKD"] as const).map((form) => {
const value = normalizeUnicode(input, form);
return {
form,
value,
changed: value !== input,
codePoints: inspectCodePoints(value).map((item) => item.hex),
};
});
return {
input,
inputCodePoints: inspectCodePoints(input).map((item) => item.hex),
forms,
};
}
export function printableGlyph(
character: string,
category: string,
name: string,
): string {
if (name === "SPACE") return "␠";
if (category.startsWith("C") || category.startsWith("Z")) return "◌";
return character;
}
src/unicode/types.ts
+110
View File
@@ -0,0 +1,110 @@
export type CharacterTuple = [
point: number,
name: string,
category: number,
script: number,
block: number,
age: number,
combiningClass: number,
bidiClass: number,
decomposition: string,
decimal: string,
numeric: string,
mirrored: number,
uppercase: number | null,
lowercase: number | null,
titlecase: number | null,
aliases: string[] | null,
emojiFlags: number,
];
export interface UnicodeRange {
start: number;
end: number;
value: string;
}
export interface UnicodeManifest {
schemaVersion: 1;
unicodeVersion: string;
emojiVersion: string;
characterCount: number;
planes: Array<{ plane: number; filename: string; count: number }>;
dictionaries: {
categories: string[];
bidiClasses: string[];
scripts: string[];
blocks: string[];
ages: string[];
};
blockRanges: UnicodeRange[];
scriptRanges: UnicodeRange[];
emojiCount: number;
namedSequenceCount: number;
confusableMappingCount: number;
unihanCount: number;
sourceIdentity: Array<{
id: string;
filename: string;
url: string;
sha256: string;
}>;
}
export interface CharacterSummary {
kind: "character";
point: number;
hex: string;
character: string;
name: string;
category: string;
script: string;
block: string;
age: string;
aliases: string[];
emojiFlags: number;
}
export interface CharacterDetail extends CharacterSummary {
combiningClass: number;
bidiClass: string;
decomposition: string;
decimal: string;
numeric: string;
mirrored: boolean;
uppercase?: string;
lowercase?: string;
titlecase?: string;
}
export interface EmojiSummary {
kind: "emoji";
points: number[];
character: string;
name: string;
group: string;
subgroup: string;
status: string;
version: string;
}
export interface NamedSequenceSummary {
kind: "sequence";
points: number[];
character: string;
name: string;
}
export type CatalogResult =
CharacterSummary | EmojiSummary | NamedSequenceSummary;
export interface UnihanDetail {
point: number;
definition: string;
mandarin: string;
cantonese: string;
japaneseOn: string;
japaneseKun: string;
korean: string;
totalStrokes: string;
radicalStroke: string;
}
src/version.ts
+1
View File
@@ -0,0 +1 @@
export const APP_VERSION = "0.1.0";
src/vite-env.d.ts
Vendored
+1
View File
@@ -0,0 +1 @@
/// <reference types="vite/client" />
src/workers/catalog.worker.ts
+316
View File
@@ -0,0 +1,316 @@
/// <reference lib="webworker" />
import type {
CatalogResult,
CharacterDetail,
CharacterSummary,
CharacterTuple,
EmojiSummary,
NamedSequenceSummary,
UnicodeManifest,
UnihanDetail,
} from "../unicode/types";
declare const self: DedicatedWorkerGlobalScope;
type EmojiTuple = [number[], string, string, string, string, string, string];
type SequenceTuple = [string, number[], string];
type UnihanTuple = [
number,
string,
string,
string,
string,
string,
string,
string,
string,
];
type ConfusableTuple = [string, string, string];
interface SearchOptions {
query: string;
script?: string;
category?: string;
block?: string;
limit?: number;
kinds?: Array<"character" | "emoji" | "sequence">;
}
let dataBase = "";
let manifest: UnicodeManifest | undefined;
let characters: CharacterTuple[] = [];
let emoji: EmojiTuple[] = [];
let sequences: SequenceTuple[] = [];
let byPoint = new Map<number, CharacterTuple>();
let unihan: Map<number, UnihanTuple> | undefined;
let confusables: Map<string, string> | undefined;
let initialization: Promise<UnicodeManifest> | undefined;
async function fetchJson<T>(filename: string): Promise<T> {
const response = await fetch(new URL(filename, dataBase));
if (!response.ok)
throw new Error(
`Unable to load Unicode data ${filename}: HTTP ${response.status}`,
);
return response.json() as Promise<T>;
}
async function initialize(base: string): Promise<UnicodeManifest> {
if (initialization && dataBase === base) return initialization;
dataBase = base;
initialization = (async () => {
manifest = await fetchJson<UnicodeManifest>("manifest.json");
const [planeRecords, emojiRecords, sequenceRecords] = await Promise.all([
Promise.all(
manifest.planes.map((plane) =>
fetchJson<CharacterTuple[]>(plane.filename),
),
),
fetchJson<EmojiTuple[]>("emoji.json"),
fetchJson<SequenceTuple[]>("named-sequences.json"),
]);
characters = planeRecords.flat();
byPoint = new Map(characters.map((record) => [record[0], record]));
emoji = emojiRecords;
sequences = sequenceRecords;
return manifest;
})();
return initialization;
}
function requireManifest(): UnicodeManifest {
if (!manifest) throw new Error("Unicode catalog is not initialized.");
return manifest;
}
function label(point: number): string {
return `U+${point.toString(16).toUpperCase().padStart(4, "0")}`;
}
function summarize(record: CharacterTuple): CharacterSummary {
const metadata = requireManifest().dictionaries;
return {
kind: "character",
point: record[0],
hex: label(record[0]),
character: String.fromCodePoint(record[0]),
name: record[1],
category: metadata.categories[record[2]] ?? "Cn",
script: metadata.scripts[record[3]] ?? "Unknown",
block: metadata.blocks[record[4]] ?? "No_Block",
age: metadata.ages[record[5]] ?? "Unassigned",
aliases: record[15] ?? [],
emojiFlags: record[16],
};
}
function detail(record: CharacterTuple): CharacterDetail {
const summary = summarize(record);
const metadata = requireManifest().dictionaries;
return {
...summary,
combiningClass: record[6],
bidiClass: metadata.bidiClasses[record[7]] ?? "L",
decomposition: record[8],
decimal: record[9],
numeric: record[10],
mirrored: record[11] === 1,
uppercase: record[12] === null ? undefined : label(record[12]),
lowercase: record[13] === null ? undefined : label(record[13]),
titlecase: record[14] === null ? undefined : label(record[14]),
};
}
function directPoint(query: string): number | undefined {
const value = query.trim();
const explicit = /^(?:U\+|0x|\\u\{)([0-9a-f]{1,6})\}?$/iu.exec(value);
if (explicit) return Number.parseInt(explicit[1] ?? "", 16);
const points = [...value];
if (points.length === 1) return points[0]?.codePointAt(0);
return undefined;
}
function search(options: SearchOptions): CatalogResult[] {
const metadata = requireManifest().dictionaries;
const query = options.query.trim();
const upper = query.toUpperCase();
const tokens = upper.split(/\s+/u).filter(Boolean);
const exactPoint = directPoint(query);
const limit = Math.max(1, Math.min(300, Math.trunc(options.limit ?? 120)));
const kinds = new Set(options.kinds ?? ["character", "emoji", "sequence"]);
const result: CatalogResult[] = [];
if (kinds.has("character")) {
for (const record of characters) {
if (exactPoint !== undefined && record[0] !== exactPoint) continue;
if (options.script && metadata.scripts[record[3]] !== options.script)
continue;
if (
options.category &&
metadata.categories[record[2]] !== options.category
)
continue;
if (options.block && metadata.blocks[record[4]] !== options.block)
continue;
const searchable =
`${label(record[0])} ${record[1]} ${(record[15] ?? []).join(" ")}`.toUpperCase();
if (
exactPoint === undefined &&
tokens.some((token) => !searchable.includes(token))
)
continue;
result.push(summarize(record));
if (result.length >= limit) return result;
}
}
if (
kinds.has("emoji") &&
!options.script &&
!options.category &&
!options.block
) {
for (const record of emoji) {
const searchable =
`${record[1]} ${record[2]} ${record[3]} ${record[4]} ${record[0].map(label).join(" ")}`.toUpperCase();
if (tokens.some((token) => !searchable.includes(token))) continue;
const item: EmojiSummary = {
kind: "emoji",
points: record[0],
character: record[1],
name: record[2],
group: record[3],
subgroup: record[4],
status: record[5],
version: record[6],
};
result.push(item);
if (result.length >= limit) return result;
}
}
if (
kinds.has("sequence") &&
!options.script &&
!options.category &&
!options.block
) {
for (const record of sequences) {
const searchable =
`${record[0]} ${record[1].map(label).join(" ")}`.toUpperCase();
if (tokens.some((token) => !searchable.includes(token))) continue;
const item: NamedSequenceSummary = {
kind: "sequence",
name: record[0],
points: record[1],
character: record[2],
};
result.push(item);
if (result.length >= limit) return result;
}
}
return result;
}
async function loadUnihan(): Promise<Map<number, UnihanTuple>> {
if (!unihan)
unihan = new Map(
(await fetchJson<UnihanTuple[]>("unihan.json")).map((record) => [
record[0],
record,
]),
);
return unihan;
}
async function getUnihan(point: number): Promise<UnihanDetail | undefined> {
const record = (await loadUnihan()).get(point);
if (!record) return undefined;
return {
point: record[0],
definition: record[1],
mandarin: record[2],
cantonese: record[3],
japaneseOn: record[4],
japaneseKun: record[5],
korean: record[6],
totalStrokes: record[7],
radicalStroke: record[8],
};
}
async function confusableAnalysis(input: string) {
if (input.length > 100_000)
throw new RangeError(
"Confusable analysis is limited to 100,000 UTF-16 code units.",
);
if (!confusables)
confusables = new Map(
(await fetchJson<ConfusableTuple[]>("confusables.json")).map(
([source, target]) => [source, target],
),
);
const normalized = input.normalize("NFD");
const mappings = [];
let skeleton = "";
const scripts = new Set<string>();
for (const character of normalized) {
const target = confusables.get(character) ?? character;
skeleton += target;
if (target !== character)
mappings.push({
source: character,
target,
point: label(character.codePointAt(0) ?? 0),
});
const record = byPoint.get(character.codePointAt(0) ?? -1);
if (record) {
const script =
requireManifest().dictionaries.scripts[record[3]] ?? "Unknown";
if (script !== "Common" && script !== "Inherited" && script !== "Unknown")
scripts.add(script);
}
}
return {
input,
normalized,
skeleton: skeleton.normalize("NFD"),
scripts: [...scripts].sort(),
mixedScripts: scripts.size > 1,
mappings,
};
}
self.addEventListener(
"message",
(
event: MessageEvent<{
id: number;
type: string;
payload?: Record<string, unknown>;
}>,
) => {
const { id, type, payload = {} } = event.data;
void (async () => {
try {
let value: unknown;
if (type === "init") value = await initialize(String(payload.base));
else if (type === "search")
value = search(payload as unknown as SearchOptions);
else if (type === "detail") {
const record = byPoint.get(Number(payload.point));
value = record ? detail(record) : undefined;
} else if (type === "unihan")
value = await getUnihan(Number(payload.point));
else if (type === "confusables")
value = await confusableAnalysis(String(payload.input ?? ""));
else throw new Error(`Unknown catalog operation: ${type}`);
self.postMessage({ id, ok: true, value });
} catch (reason) {
self.postMessage({
id,
ok: false,
error:
reason instanceof Error ? reason.message : "Unicode worker failed.",
});
}
})();
},
);
tests/browser/app.spec.ts
+61
View File
@@ -0,0 +1,61 @@
import { expect, test, type Page } from "@playwright/test";
const ORIGIN = "http://127.0.0.1:4173";
async function localOnly(page: Page) {
const external: string[] = [];
await page.route("**/*", async (route) => {
const url = new URL(route.request().url());
if (url.origin !== ORIGIN) {
external.push(url.href);
await route.abort();
} else await route.continue();
});
return external;
}
test("runs from a nested path without external requests", async ({ page }) => {
const errors: string[] = [];
page.on("pageerror", (error) => errors.push(error.message));
page.on("console", (message) => {
if (message.type() === "error") errors.push(message.text());
});
const external = await localOnly(page);
await page.goto("/deep/nested/unicode/");
await expect(
page.getByRole("heading", { name: "Unicode Tools" }),
).toBeVisible();
expect(external).toEqual([]);
expect(errors).toEqual([]);
});
test("serves the release identity and hardened headers", async ({
request,
}) => {
const index = await request.get("/deep/nested/unicode/");
expect(index.ok()).toBe(true);
expect(index.headers()["content-security-policy"]).toContain(
"default-src 'self'",
);
expect(await index.text()).not.toMatch(/\b(?:src|href)=["']\//u);
const manifest = await request.get("/deep/nested/unicode/toolbox-app.json");
await expect(manifest.json()).resolves.toMatchObject({
id: "de.add-ideas.unicode-tools",
version: "0.1.0",
entry: "./",
});
});
test("searches the pinned catalog in a worker and shows character properties", async ({
page,
}) => {
const external = await localOnly(page);
await page.goto("/deep/nested/unicode/");
await page.getByLabel("Name, alias, character, or U+ code").fill("U+1F600");
await page.getByRole("button", { name: "Search", exact: true }).click();
const result = page.getByRole("button", { name: /GRINNING FACE/u });
await expect(result).toBeVisible({ timeout: 60_000 });
await result.click();
await expect(page.getByText("Unicode 6.1")).toBeVisible();
await expect(page.getByText("Common / Emoticons")).toBeVisible();
expect(external).toEqual([]);
});
tests/components/app.test.tsx
+19
View File
@@ -0,0 +1,19 @@
import { render, screen } from "@testing-library/react";
import { describe, expect, it, vi } from "vitest";
import { App } from "../../src/App";
describe("Unicode Tools", () => {
it("renders the local workbench and standard shell", async () => {
vi.stubGlobal(
"fetch",
vi.fn(async () => new Response("Not found", { status: 404 })),
);
render(<App />);
expect(
await screen.findByRole("heading", { name: "Unicode Tools" }),
).toBeVisible();
expect(
await screen.findByText("Official data · local search"),
).toBeVisible();
});
});
tests/unicode/model.test.ts
+29
View File
@@ -0,0 +1,29 @@
import { describe, expect, it } from "vitest";
import {
codePointLabel,
compareNormalization,
decodeCodePointList,
inspectText,
parseCodePointList,
} from "../../src/unicode/model";
describe("Unicode helper integration", () => {
it("parses and decodes scalar values", () => {
expect(parseCodePointList("U+0041 1F600")).toEqual([0x41, 0x1f600]);
expect(decodeCodePointList("41, 1F600")).toBe("A😀");
expect(() => parseCodePointList("D800")).toThrow(/scalar value/u);
});
it("inspects code points separately from graphemes", () => {
const result = inspectText("e\u0301");
expect(result.codePointCount).toBe(2);
expect(result.graphemes).toHaveLength(1);
expect(result.points[1]?.javascript).toBe("\\u0301");
});
it("compares all normalization forms", () => {
const result = compareNormalization("e\u0301");
expect(result.forms.find((item) => item.form === "NFC")?.value).toBe("é");
expect(codePointLabel(0x1f600)).toBe("U+1F600");
});
});
tsconfig.app.json
+27
View File
@@ -0,0 +1,27 @@
{
"compilerOptions": {
"tsBuildInfoFile": "./node_modules/.tmp/tsconfig.app.tsbuildinfo",
"target": "ES2023",
"lib": ["ES2023", "DOM", "DOM.Iterable"],
"module": "ESNext",
"types": ["vite/client"],
"allowArbitraryExtensions": true,
"skipLibCheck": true,
"moduleResolution": "Bundler",
"allowImportingTsExtensions": true,
"verbatimModuleSyntax": true,
"moduleDetection": "force",
"noEmit": true,
"jsx": "react-jsx",
"noUnusedLocals": true,
"noUnusedParameters": true,
"erasableSyntaxOnly": true,
"noFallthroughCasesInSwitch": true,
"strict": true,
"noUncheckedIndexedAccess": true,
"useDefineForClassFields": true,
"resolveJsonModule": true,
"isolatedModules": true
},
"include": ["src", "tests"]
}
tsconfig.json
+11
View File
@@ -0,0 +1,11 @@
{
"files": [],
"references": [
{
"path": "./tsconfig.app.json"
},
{
"path": "./tsconfig.node.json"
}
]
}
tsconfig.node.json
+24
View File
@@ -0,0 +1,24 @@
{
"compilerOptions": {
"tsBuildInfoFile": "./node_modules/.tmp/tsconfig.node.tsbuildinfo",
"target": "ES2023",
"lib": ["ES2023"],
"module": "ESNext",
"types": ["node"],
"skipLibCheck": true,
"moduleResolution": "Bundler",
"allowImportingTsExtensions": true,
"verbatimModuleSyntax": true,
"moduleDetection": "force",
"noEmit": true,
"strict": true,
"noUnusedLocals": true,
"noUnusedParameters": true
},
"include": [
"vite.config.ts",
"playwright.config.ts",
"eslint.config.mjs",
"scripts/**/*.mjs"
]
}
vite.config.ts
+16
View File
@@ -0,0 +1,16 @@
/// <reference types="vitest/config" />
import { defineConfig } from "vite";
import react from "@vitejs/plugin-react";
export default defineConfig({
base: "./",
plugins: [react()],
test: {
environment: "jsdom",
setupFiles: "./src/test/setup.ts",
css: true,
maxWorkers: 2,
restoreMocks: true,
exclude: ["tests/browser/**", "node_modules/**", "dist/**"],
},
});