epi/EpiWebview
1
0
Fork 0
Code Issues 3 Pull Requests Actions Packages Projects Releases 6 Wiki Activity

Feature: Labelprint für Kistenetiketten hinzugefügt

Browse Source
This commit is contained in:
Leopold Strobl
2025-10-27 12:14:44 +01:00
parent 43bc416554
commit 14bae6c9ef
1068 changed files with 229014 additions and 1807 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
vendor/tecnickcom/tc-lib-unicode/.editorconfig vendored Normal file
View File

@@ -0,0 +1,20 @@
# Ref: https://EditorConfig.org
# top-most EditorConfig file
root = true
# Unix-style end of lines and a blank line at the end of the file
[*]
indent_style = tab
end_of_line = lf
charset = utf-8
trim_trailing_whitespace = true
insert_final_newline = true
[*.php]
indent_style = space
indent_size = 4
[*.{js,json,scss,css,yml,vue}]
indent_style = space
indent_size = 2

1
vendor/tecnickcom/tc-lib-unicode/.github/FUNDING.yml vendored Normal file
View File

@@ -0,0 +1 @@
custom: ['https://www.paypal.com/donate/?hosted_button_id=NZUEC5XS8MFBJ']

29
vendor/tecnickcom/tc-lib-unicode/.github/ISSUE_TEMPLATE/bug_report.md vendored Normal file
View File

@@ -0,0 +1,29 @@
---
name: Bug report
about: Create a report to help us improve
title: ''
labels: ''
assignees: ''
---
**Describe the bug**
A clear and concise description of what the bug is.
**To Reproduce**
Steps to reproduce the behavior:
1. ...
**Expected behavior**
A clear and concise description of what you expected to happen.
**Logs**
If applicable, copy the relevant logs to help explain your problem.
**Environment:**
- OS:
- PHP version:
- Version:
**Additional context**
Add any other context about the problem here.

20
vendor/tecnickcom/tc-lib-unicode/.github/ISSUE_TEMPLATE/feature_request.md vendored Normal file
View File

@@ -0,0 +1,20 @@
---
name: Feature request
about: Suggest an idea for this project
title: ''
labels: ''
assignees: ''
---
**Is your feature request related to a problem? Please describe.**
A clear and concise description of what the problem is. Ex. I'm always frustrated when [...]
**Describe the solution you'd like**
A clear and concise description of what you want to happen.
**Describe alternatives you've considered**
A clear and concise description of any alternative solutions or features you've considered.
**Additional context**
Add any other context or screenshots about the feature request here.

25
vendor/tecnickcom/tc-lib-unicode/.github/pull_request_template.md vendored Normal file
View File

@@ -0,0 +1,25 @@
# Description
Please include a summary of the change and include relevant motivation and context.
...
## Checklist:
- [ ] The `make buildall` command has been run successfully without any error or warning.
- [ ] Any new code line is covered by unit tests and the coverage has not dropped.
- [ ] Any new code follows the style guidelines of this project.
- [ ] The code changes have been self-reviewed.
- [ ] Corresponding changes to the documentation have been made.
- [ ] The version has been updated in the VERSION file.
## Type of change:
- [ ] Bug fix (non-breaking change which fixes an issue) → The patch number in the VERSION file has been increased.
- [ ] New feature (non-breaking change which adds functionality) → The minor number in the VERSION file has been increased.
- [ ] Breaking change (fix or feature that would cause existing functionality to not work as expected) → The major number in the VERSION file has been increased.
- [ ] Automation.
- [ ] Documentation.
- [ ] Example.
- [ ] Testing.

56
vendor/tecnickcom/tc-lib-unicode/.github/workflows/check.yml vendored Normal file
View File

@@ -0,0 +1,56 @@
name: check
env:
XDEBUG_MODE: coverage
permissions:
contents: read
on:
push:
branches:
- 'main'
pull_request:
types: [opened, synchronize, reopened]
branches:
- main
jobs:
test-php:
name: Test on php ${{ matrix.php-version }} and ${{ matrix.os }}
runs-on: ${{ matrix.os }}
continue-on-error: ${{ matrix.experimental }}
strategy:
fail-fast: false
matrix:
php-version: ["8.1", "8.2", "8.3", "8.4"]
experimental: [false]
os: [ubuntu-latest]
coverage-extension: [pcov]
steps:
- uses: actions/checkout@v4
- name: Use php ${{ matrix.php-version }}
uses: shivammathur/setup-php@v2
with:
php-version: ${{ matrix.php-version }}
coverage: ${{ matrix.coverage-extension }}
extensions: bcmath, curl, date, gd, hash, imagick, json, mbstring, openssl, pcre, zlib
ini-values: display_errors=on, error_reporting=-1, zend.assertions=1
- name: List php modules
run: php -m
- name: List php modules using "no php ini" mode
run: php -m -n
- name: Cache module
uses: actions/cache@v4
with:
path: ~/.composer/cache/
key: composer-cache
- name: Install dependencies
run: make deps
- name: Run all tests
run: make qa
- name: Send coverage
uses: codecov/codecov-action@v5
with:
flags: php-${{ matrix.php-version }}-${{ matrix.os }}
name: php-${{ matrix.php-version }}-${{ matrix.os }}

20
vendor/tecnickcom/tc-lib-unicode/.gitignore vendored Normal file
View File

@@ -0,0 +1,20 @@
**/*.bak
**/*.tmp
**/.#*
**/.DS_Store
**/._*
**/.idea
**/.vagrant
**/auth.json
**/nbproject
**/temp.php
**/test.php
.phpdoc
.phpunit.cache
.phpunit.result.cache
composer.lock
ecs.php
phpunit.xml
rector.php
target
vendor

1
vendor/tecnickcom/tc-lib-unicode/CODEOWNERS vendored Normal file
View File

@@ -0,0 +1 @@
* @nicolaasuni

128
vendor/tecnickcom/tc-lib-unicode/CODE_OF_CONDUCT.md vendored Normal file
View File

@@ -0,0 +1,128 @@
# Contributor Covenant Code of Conduct
## Our Pledge
We as members, contributors, and leaders pledge to make participation in our
community a harassment-free experience for everyone, regardless of age, body
size, visible or invisible disability, ethnicity, sex characteristics, gender
identity and expression, level of experience, education, socio-economic status,
nationality, personal appearance, race, religion, or sexual identity
and orientation.
We pledge to act and interact in ways that contribute to an open, welcoming,
diverse, inclusive, and healthy community.
## Our Standards
Examples of behavior that contributes to a positive environment for our
community include:
* Demonstrating empathy and kindness toward other people
* Being respectful of differing opinions, viewpoints, and experiences
* Giving and gracefully accepting constructive feedback
* Accepting responsibility and apologizing to those affected by our mistakes,
and learning from the experience
* Focusing on what is best not just for us as individuals, but for the
overall community
Examples of unacceptable behavior include:
* The use of sexualized language or imagery, and sexual attention or
advances of any kind
* Trolling, insulting or derogatory comments, and personal or political attacks
* Public or private harassment
* Publishing others' private information, such as a physical or email
address, without their explicit permission
* Other conduct which could reasonably be considered inappropriate in a
professional setting
## Enforcement Responsibilities
Community leaders are responsible for clarifying and enforcing our standards of
acceptable behavior and will take appropriate and fair corrective action in
response to any behavior that they deem inappropriate, threatening, offensive,
or harmful.
Community leaders have the right and responsibility to remove, edit, or reject
comments, commits, code, wiki edits, issues, and other contributions that are
not aligned to this Code of Conduct, and will communicate reasons for moderation
decisions when appropriate.
## Scope
This Code of Conduct applies within all community spaces, and also applies when
an individual is officially representing the community in public spaces.
Examples of representing our community include using an official e-mail address,
posting via an official social media account, or acting as an appointed
representative at an online or offline event.
## Enforcement
Instances of abusive, harassing, or otherwise unacceptable behavior may be
reported to the community leaders responsible for enforcement at
.
All complaints will be reviewed and investigated promptly and fairly.
All community leaders are obligated to respect the privacy and security of the
reporter of any incident.
## Enforcement Guidelines
Community leaders will follow these Community Impact Guidelines in determining
the consequences for any action they deem in violation of this Code of Conduct:
### 1. Correction
**Community Impact**: Use of inappropriate language or other behavior deemed
unprofessional or unwelcome in the community.
**Consequence**: A private, written warning from community leaders, providing
clarity around the nature of the violation and an explanation of why the
behavior was inappropriate. A public apology may be requested.
### 2. Warning
**Community Impact**: A violation through a single incident or series
of actions.
**Consequence**: A warning with consequences for continued behavior. No
interaction with the people involved, including unsolicited interaction with
those enforcing the Code of Conduct, for a specified period of time. This
includes avoiding interactions in community spaces as well as external channels
like social media. Violating these terms may lead to a temporary or
permanent ban.
### 3. Temporary Ban
**Community Impact**: A serious violation of community standards, including
sustained inappropriate behavior.
**Consequence**: A temporary ban from any sort of interaction or public
communication with the community for a specified period of time. No public or
private interaction with the people involved, including unsolicited interaction
with those enforcing the Code of Conduct, is allowed during this period.
Violating these terms may lead to a permanent ban.
### 4. Permanent Ban
**Community Impact**: Demonstrating a pattern of violation of community
standards, including sustained inappropriate behavior, harassment of an
individual, or aggression toward or disparagement of classes of individuals.
**Consequence**: A permanent ban from any sort of public interaction within
the community.
## Attribution
This Code of Conduct is adapted from the [Contributor Covenant][homepage],
version 2.0, available at
https://www.contributor-covenant.org/version/2/0/code_of_conduct.html.
Community Impact Guidelines were inspired by [Mozilla's code of conduct
enforcement ladder](https://github.com/mozilla/diversity).
[homepage]: https://www.contributor-covenant.org
For answers to common questions about this code of conduct, see the FAQ at
https://www.contributor-covenant.org/faq. Translations are available at
https://www.contributor-covenant.org/translations.

26
vendor/tecnickcom/tc-lib-unicode/CONTRIBUTING.md vendored Normal file
View File

@@ -0,0 +1,26 @@
# How to Contribute
## Reporting a bug
* **Do not open up a GitHub issue if the bug is a security vulnerability**, and instead to refer to our [Security policy](SECURITY.md).
* Ensure the bug was not already reported by searching on GitHub Issues.
* If you're unable to find an open issue addressing the problem, open a new one. Be sure to include a **title and clear description**, as much relevant information as possible, and a **code sample** or an **executable test case** demonstrating the expected behavior that is not occurring.
## Submitting a bug fix
* Open a new GitHub pull request with the patch.
* Ensure the PR description clearly describes the problem and solution. Include the relevant issue number if applicable.
* Ensure the new code is following the existing conventions and the unit test coverage is 100%.
* Before submitting, please run the following command locally to ensure the code is passing the automatic checks: `make buildall`.
## Add a new feature or change an existing one
* Before writing any code please suggest the change by opening a new Feature Request on Issues.

862
vendor/tecnickcom/tc-lib-unicode/LICENSE vendored Normal file
View File

@@ -0,0 +1,862 @@
**********************************************************************
* LICENSE
*
* SOFTWARE : tc-lib-unicode
* AUTHOR : Nicola Asuni <info@tecnick.com>
* COPYRIGHT : 2011-2025 Nicola Asuni - Tecnick.com LTD
**********************************************************************
This is free software: you can redistribute it and/or modify it
under the terms of the GNU Lesser General Public License as
published by the Free Software Foundation, either version 3 of the
License, or (at your option) any later version.
**********************************************************************
**********************************************************************
GNU LESSER GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
This version of the GNU Lesser General Public License incorporates
the terms and conditions of version 3 of the GNU General Public
License, supplemented by the additional permissions listed below.
0. Additional Definitions.
As used herein, "this License" refers to version 3 of the GNU Lesser
General Public License, and the "GNU GPL" refers to version 3 of the GNU
General Public License.
"The Library" refers to a covered work governed by this License,
other than an Application or a Combined Work as defined below.
An "Application" is any work that makes use of an interface provided
by the Library, but which is not otherwise based on the Library.
Defining a subclass of a class defined by the Library is deemed a mode
of using an interface provided by the Library.
A "Combined Work" is a work produced by combining or linking an
Application with the Library. The particular version of the Library
with which the Combined Work was made is also called the "Linked
Version".
The "Minimal Corresponding Source" for a Combined Work means the
Corresponding Source for the Combined Work, excluding any source code
for portions of the Combined Work that, considered in isolation, are
based on the Application, and not on the Linked Version.
The "Corresponding Application Code" for a Combined Work means the
object code and/or source code for the Application, including any data
and utility programs needed for reproducing the Combined Work from the
Application, but excluding the System Libraries of the Combined Work.
1. Exception to Section 3 of the GNU GPL.
You may convey a covered work under sections 3 and 4 of this License
without being bound by section 3 of the GNU GPL.
2. Conveying Modified Versions.
If you modify a copy of the Library, and, in your modifications, a
facility refers to a function or data to be supplied by an Application
that uses the facility (other than as an argument passed when the
facility is invoked), then you may convey a copy of the modified
version:
a) under this License, provided that you make a good faith effort to
ensure that, in the event an Application does not supply the
function or data, the facility still operates, and performs
whatever part of its purpose remains meaningful, or
b) under the GNU GPL, with none of the additional permissions of
this License applicable to that copy.
3. Object Code Incorporating Material from Library Header Files.
The object code form of an Application may incorporate material from
a header file that is part of the Library. You may convey such object
code under terms of your choice, provided that, if the incorporated
material is not limited to numerical parameters, data structure
layouts and accessors, or small macros, inline functions and templates
(ten or fewer lines in length), you do both of the following:
a) Give prominent notice with each copy of the object code that the
Library is used in it and that the Library and its use are
covered by this License.
b) Accompany the object code with a copy of the GNU GPL and this license
document.
4. Combined Works.
You may convey a Combined Work under terms of your choice that,
taken together, effectively do not restrict modification of the
portions of the Library contained in the Combined Work and reverse
engineering for debugging such modifications, if you also do each of
the following:
a) Give prominent notice with each copy of the Combined Work that
the Library is used in it and that the Library and its use are
covered by this License.
b) Accompany the Combined Work with a copy of the GNU GPL and this license
document.
c) For a Combined Work that displays copyright notices during
execution, include the copyright notice for the Library among
these notices, as well as a reference directing the user to the
copies of the GNU GPL and this license document.
d) Do one of the following:
0) Convey the Minimal Corresponding Source under the terms of this
License, and the Corresponding Application Code in a form
suitable for, and under terms that permit, the user to
recombine or relink the Application with a modified version of
the Linked Version to produce a modified Combined Work, in the
manner specified by section 6 of the GNU GPL for conveying
Corresponding Source.
1) Use a suitable shared library mechanism for linking with the
Library. A suitable mechanism is one that (a) uses at run time
a copy of the Library already present on the user's computer
system, and (b) will operate properly with a modified version
of the Library that is interface-compatible with the Linked
Version.
e) Provide Installation Information, but only if you would otherwise
be required to provide such information under section 6 of the
GNU GPL, and only to the extent that such information is
necessary to install and execute a modified version of the
Combined Work produced by recombining or relinking the
Application with a modified version of the Linked Version. (If
you use option 4d0, the Installation Information must accompany
the Minimal Corresponding Source and Corresponding Application
Code. If you use option 4d1, you must provide the Installation
Information in the manner specified by section 6 of the GNU GPL
for conveying Corresponding Source.)
5. Combined Libraries.
You may place library facilities that are a work based on the
Library side by side in a single library together with other library
facilities that are not Applications and are not covered by this
License, and convey such a combined library under terms of your
choice, if you do both of the following:
a) Accompany the combined library with a copy of the same work based
on the Library, uncombined with any other library facilities,
conveyed under the terms of this License.
b) Give prominent notice with the combined library that part of it
is a work based on the Library, and explaining where to find the
accompanying uncombined form of the same work.
6. Revised Versions of the GNU Lesser General Public License.
The Free Software Foundation may publish revised and/or new versions
of the GNU Lesser General Public License from time to time. Such new
versions will be similar in spirit to the present version, but may
differ in detail to address new problems or concerns.
Each version is given a distinguishing version number. If the
Library as you received it specifies that a certain numbered version
of the GNU Lesser General Public License "or any later version"
applies to it, you have the option of following the terms and
conditions either of that published version or of any later version
published by the Free Software Foundation. If the Library as you
received it does not specify a version number of the GNU Lesser
General Public License, you may choose any version of the GNU Lesser
General Public License ever published by the Free Software Foundation.
If the Library as you received it specifies that a proxy can decide
whether future versions of the GNU Lesser General Public License shall
apply, that proxy's public statement of acceptance of any version is
permanent authorization for you to choose that version for the
Library.
**********************************************************************
**********************************************************************
GNU GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc. <http://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 <http://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
<http://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
<http://www.gnu.org/philosophy/why-not-lgpl.html>.
**********************************************************************
**********************************************************************

277
vendor/tecnickcom/tc-lib-unicode/Makefile vendored Normal file
View File

@@ -0,0 +1,277 @@
# makefile
#
# @since 2015-07-13
# @category Library
# @package Unicode
# @author Nicola Asuni <info@tecnick.com>
# @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
# @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE)
# @link https://github.com/tecnickcom/tc-lib-unicode
#
# This file is part of tc-lib-unicode software library.
# ----------------------------------------------------------------------------------------------------------------------
SHELL=/bin/bash
.SHELLFLAGS=-o pipefail -c
# Project owner
OWNER=tecnickcom
# Project vendor
VENDOR=${OWNER}
# Project name
PROJECT=tc-lib-unicode
# Project version
VERSION=$(shell cat VERSION)
# Project release number (packaging build number)
RELEASE=$(shell cat RELEASE)
# Name of RPM or DEB package
PKGNAME=php-${OWNER}-${PROJECT}
# Data dir
DATADIR=usr/share
# PHP home folder
PHPHOME=${DATADIR}/php/Com/Tecnick
# Default installation path for code
LIBPATH=${PHPHOME}/Unicode/
# Path for configuration files (etc/$(PKGNAME)/)
CONFIGPATH=
# Default installation path for documentation
DOCPATH=${DATADIR}/doc/$(PKGNAME)/
# Installation path for the code
PATHINSTBIN=$(DESTDIR)/$(LIBPATH)
# Installation path for the configuration files
PATHINSTCFG=$(DESTDIR)/$(CONFIGPATH)
# Installation path for documentation
PATHINSTDOC=$(DESTDIR)/$(DOCPATH)
# Current directory
CURRENTDIR=$(dir $(realpath $(firstword $(MAKEFILE_LIST))))
# Target directory
TARGETDIR=$(CURRENTDIR)target
# RPM Packaging path (where RPMs will be stored)
PATHRPMPKG=$(TARGETDIR)/RPM
# DEB Packaging path (where DEBs will be stored)
PATHDEBPKG=$(TARGETDIR)/DEB
# BZ2 Packaging path (where BZ2s will be stored)
PATHBZ2PKG=$(TARGETDIR)/BZ2
# Default port number for the example server
PORT?=8000
# PHP binary
PHP=$(shell which php)
# Composer executable (disable APC to as a work-around of a bug)
COMPOSER=$(PHP) -d "apc.enable_cli=0" $(shell which composer)
# phpDocumentor executable file
PHPDOC=$(shell which phpDocumentor)
# --- MAKE TARGETS ---
# Display general help about this command
.PHONY: help
help:
@echo ""
@echo "$(PROJECT) Makefile."
@echo "The following commands are available:"
@echo ""
@echo " make buildall : Build and test everything from scratch"
@echo " make bz2 : Package the library in a compressed bz2 archive"
@echo " make clean : Delete the vendor and target directories"
@echo " make codefix : Fix code style violations"
@echo " make deb : Build a DEB package for Debian-like Linux distributions"
@echo " make deps : Download all dependencies"
@echo " make doc : Generate source code documentation"
@echo " make lint : Test source code for coding standard violations"
@echo " make qa : Run all tests and reports"
@echo " make report : Generate various reports"
@echo " make rpm : Build an RPM package for RedHat-like Linux distributions"
@echo " make server : Start the development server"
@echo " make test : Run unit tests"
@echo " make versionup: Increase the version patch number"
@echo ""
@echo "To test and build everything from scratch:"
@echo "make buildall"
@echo ""
# alias for help target
.PHONY: all
all: help
# Full build and test sequence
.PHONY: x
x: buildall
# Full build and test sequence
.PHONY: buildall
buildall: deps codefix qa bz2 rpm deb
# Package the library in a compressed bz2 archive
.PHONY: bz2
bz2:
rm -rf $(PATHBZ2PKG)
make install DESTDIR=$(PATHBZ2PKG)
tar -jcvf $(PATHBZ2PKG)/$(PKGNAME)-$(VERSION)-$(RELEASE).tbz2 -C $(PATHBZ2PKG) $(DATADIR)
# Delete the vendor and target directories
.PHONY: clean
clean:
rm -rf ./vendor $(TARGETDIR)
# Fix code style violations
.PHONY: codefix
codefix:
./vendor/bin/phpcbf --ignore="./vendor/" --standard=psr12 src test
# Build a DEB package for Debian-like Linux distributions
.PHONY: deb
deb:
rm -rf $(PATHDEBPKG)
make install DESTDIR=$(PATHDEBPKG)/$(PKGNAME)-$(VERSION)
rm -f $(PATHDEBPKG)/$(PKGNAME)-$(VERSION)/$(DOCPATH)LICENSE
tar -zcvf $(PATHDEBPKG)/$(PKGNAME)_$(VERSION).orig.tar.gz -C $(PATHDEBPKG)/ $(PKGNAME)-$(VERSION)
cp -rf ./resources/debian $(PATHDEBPKG)/$(PKGNAME)-$(VERSION)/debian
find $(PATHDEBPKG)/$(PKGNAME)-$(VERSION)/debian/ -type f -exec sed -i "s/~#DATE#~/`date -R`/" {} \;
find $(PATHDEBPKG)/$(PKGNAME)-$(VERSION)/debian/ -type f -exec sed -i "s/~#VENDOR#~/$(VENDOR)/" {} \;
find $(PATHDEBPKG)/$(PKGNAME)-$(VERSION)/debian/ -type f -exec sed -i "s/~#PROJECT#~/$(PROJECT)/" {} \;
find $(PATHDEBPKG)/$(PKGNAME)-$(VERSION)/debian/ -type f -exec sed -i "s/~#PKGNAME#~/$(PKGNAME)/" {} \;
find $(PATHDEBPKG)/$(PKGNAME)-$(VERSION)/debian/ -type f -exec sed -i "s/~#VERSION#~/$(VERSION)/" {} \;
find $(PATHDEBPKG)/$(PKGNAME)-$(VERSION)/debian/ -type f -exec sed -i "s/~#RELEASE#~/$(RELEASE)/" {} \;
echo $(LIBPATH) > $(PATHDEBPKG)/$(PKGNAME)-$(VERSION)/debian/$(PKGNAME).dirs
echo "$(LIBPATH)* $(LIBPATH)" > $(PATHDEBPKG)/$(PKGNAME)-$(VERSION)/debian/install
echo $(DOCPATH) >> $(PATHDEBPKG)/$(PKGNAME)-$(VERSION)/debian/$(PKGNAME).dirs
echo "$(DOCPATH)* $(DOCPATH)" >> $(PATHDEBPKG)/$(PKGNAME)-$(VERSION)/debian/install
ifneq ($(strip $(CONFIGPATH)),)
echo $(CONFIGPATH) >> $(PATHDEBPKG)/$(PKGNAME)-$(VERSION)/debian/$(PKGNAME).dirs
echo "$(CONFIGPATH)* $(CONFIGPATH)" >> $(PATHDEBPKG)/$(PKGNAME)-$(VERSION)/debian/install
endif
echo "new-package-should-close-itp-bug" > $(PATHDEBPKG)/$(PKGNAME)-$(VERSION)/debian/$(PKGNAME).lintian-overrides
cd $(PATHDEBPKG)/$(PKGNAME)-$(VERSION) && debuild -us -uc
# Clean all artifacts and download all dependencies
.PHONY: deps
deps: ensuretarget
rm -rf ./vendor/*
($(COMPOSER) install -vvv --no-interaction)
curl --silent --show-error --fail --location --output ./vendor/phpstan.phar https://github.com/phpstan/phpstan/releases/download/2.1.2/phpstan.phar \
&& chmod +x ./vendor/phpstan.phar
# Generate source code documentation
.PHONY: doc
doc: ensuretarget
rm -rf $(TARGETDIR)/doc
$(PHPDOC) -d ./src -t $(TARGETDIR)/doc/
# Create missing target directories for test and build artifacts
.PHONY: ensuretarget
ensuretarget:
mkdir -p $(TARGETDIR)/test
mkdir -p $(TARGETDIR)/report
mkdir -p $(TARGETDIR)/doc
# Install this application
.PHONY: install
install: uninstall
mkdir -p $(PATHINSTBIN)
cp -rf ./src/* $(PATHINSTBIN)
cp -f ./resources/autoload.php $(PATHINSTBIN)
find $(PATHINSTBIN) -type d -exec chmod 755 {} \;
find $(PATHINSTBIN) -type f -exec chmod 644 {} \;
mkdir -p $(PATHINSTDOC)
cp -f ./LICENSE $(PATHINSTDOC)
cp -f ./README.md $(PATHINSTDOC)
cp -f ./VERSION $(PATHINSTDOC)
cp -f ./RELEASE $(PATHINSTDOC)
chmod -R 644 $(PATHINSTDOC)*
ifneq ($(strip $(CONFIGPATH)),)
mkdir -p $(PATHINSTCFG)
touch -c $(PATHINSTCFG)*
cp -ru ./resources/${CONFIGPATH}* $(PATHINSTCFG)
find $(PATHINSTCFG) -type d -exec chmod 755 {} \;
find $(PATHINSTCFG) -type f -exec chmod 644 {} \;
endif
# Test source code for coding standard violations
.PHONY: lint
lint:
./vendor/bin/phpcs --ignore="./vendor/" --standard=phpcs.xml src test
./vendor/bin/phpmd src text codesize,unusedcode,naming,design --exclude */vendor/*
./vendor/bin/phpmd test text unusedcode,naming,design --exclude */vendor/*
php -r 'exit((int)version_compare(PHP_MAJOR_VERSION, "7", ">"));' || ./vendor/phpstan.phar analyse
# Run all tests and reports
.PHONY: qa
qa: ensuretarget lint test report
# Generate various reports
.PHONY: report
report: ensuretarget
./vendor/bin/pdepend --jdepend-xml=$(TARGETDIR)/report/dependencies.xml --summary-xml=$(TARGETDIR)/report/metrics.xml --jdepend-chart=$(TARGETDIR)/report/dependecies.svg --overview-pyramid=$(TARGETDIR)/report/overview-pyramid.svg --ignore=vendor ./src
#./vendor/bartlett/php-compatinfo/bin/phpcompatinfo --no-ansi analyser:run src/ > $(TARGETDIR)/report/phpcompatinfo.txt
# Build the RPM package for RedHat-like Linux distributions
.PHONY: rpm
rpm:
rm -rf $(PATHRPMPKG)
rpmbuild \
--define "_topdir $(PATHRPMPKG)" \
--define "_vendor $(VENDOR)" \
--define "_owner $(OWNER)" \
--define "_project $(PROJECT)" \
--define "_package $(PKGNAME)" \
--define "_version $(VERSION)" \
--define "_release $(RELEASE)" \
--define "_current_directory $(CURRENTDIR)" \
--define "_libpath /$(LIBPATH)" \
--define "_docpath /$(DOCPATH)" \
--define "_configpath /$(CONFIGPATH)" \
-bb resources/rpm/rpm.spec
# Start the development server
.PHONY: server
server:
$(PHP) -t example -S localhost:$(PORT)
# Tag this GIT version
.PHONY: tag
tag:
git checkout main && \
git tag -a ${VERSION} -m "Release ${VERSION}" && \
git push origin --tags && \
git pull
# Run unit tests
.PHONY: test
test:
cp phpunit.xml.dist phpunit.xml
#./vendor/bin/phpunit --migrate-configuration || true
XDEBUG_MODE=coverage ./vendor/bin/phpunit --stderr test
# Remove all installed files
.PHONY: uninstall
uninstall:
rm -rf $(PATHINSTBIN)
rm -rf $(PATHINSTDOC)
# Increase the version patch number
.PHONY: versionup
versionup:
echo ${VERSION} | gawk -F. '{printf("%d.%d.%d\n",$$1,$$2,(($$3+1)));}' > VERSION

109
vendor/tecnickcom/tc-lib-unicode/README.md vendored Normal file
View File

@@ -0,0 +1,109 @@
# tc-lib-unicode
*PHP library containing Unicode and UTF-8 methods, including the Unicode Bidirectional Algorithm*
[![Latest Stable Version](https://poser.pugx.org/tecnickcom/tc-lib-unicode/version)](https://packagist.org/packages/tecnickcom/tc-lib-unicode)
![Build](https://github.com/tecnickcom/tc-lib-unicode/actions/workflows/check.yml/badge.svg)
[![Coverage](https://codecov.io/gh/tecnickcom/tc-lib-unicode/graph/badge.svg?token=XLM0QWY9BE)](https://codecov.io/gh/tecnickcom/tc-lib-unicode)
[![License](https://poser.pugx.org/tecnickcom/tc-lib-unicode/license)](https://packagist.org/packages/tecnickcom/tc-lib-unicode)
[![Downloads](https://poser.pugx.org/tecnickcom/tc-lib-unicode/downloads)](https://packagist.org/packages/tecnickcom/tc-lib-unicode)
[![Donate via PayPal](https://img.shields.io/badge/donate-paypal-87ceeb.svg)](https://www.paypal.com/donate/?hosted_button_id=NZUEC5XS8MFBJ)
*Please consider supporting this project by making a donation via [PayPal](https://www.paypal.com/donate/?hosted_button_id=NZUEC5XS8MFBJ)*
* **category** Library
* **package** \Com\Tecnick\Unicode
* **author** Nicola Asuni <info@tecnick.com>
* **copyright** 2011-2025 Nicola Asuni - Tecnick.com LTD
* **license** http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* **link** https://github.com/tecnickcom/tc-lib-unicode
* **SRC DOC** https://tcpdf.org/docs/srcdoc/tc-lib-unicode
## Description
PHP library containing Unicode and UTF-8 methods, including the Unicode Bidirectional Algorithm.
The initial source code has been derived from [TCPDF](<http://www.tcpdf.org>).
## Getting started
First, you need to install all development dependencies using [Composer](https://getcomposer.org/):
```bash
$ curl -sS https://getcomposer.org/installer | php
$ mv composer.phar /usr/local/bin/composer
```
This project include a Makefile that allows you to test and build the project with simple commands.
To see all available options:
```bash
make help
```
To install all the development dependencies:
```bash
make deps
```
## Running all tests
Before committing the code, please check if it passes all tests using
```bash
make qa
```
All artifacts are generated in the target directory.
## Example
Examples are located in the `example` directory.
Start a development server (requires PHP 8.0+) using the command:
```
make server
```
and point your browser to <http://localhost:8000/index.php>
## Installation
Create a composer.json in your projects root-directory:
```json
{
"require": {
"tecnickcom/tc-lib-unicode": "^2.0"
}
}
```
Or add to an existing project with:
```bash
composer require tecnickcom/tc-lib-unicode ^2.0
```
## Packaging
This library is mainly intended to be used and included in other PHP projects using Composer.
However, since some production environments dictates the installation of any application as RPM or DEB packages,
this library includes make targets for building these packages (`make rpm` and `make deb`).
The packages are generated under the `target` directory.
When this library is installed using an RPM or DEB package, you can use it your code by including the autoloader:
```
require_once ('/usr/share/php/Com/Tecnick/Unicode/autoload.php');
```
## Developer(s) Contact
* Nicola Asuni <info@tecnick.com>

1
vendor/tecnickcom/tc-lib-unicode/RELEASE vendored Normal file
View File

@@ -0,0 +1 @@
0

5
vendor/tecnickcom/tc-lib-unicode/SECURITY.md vendored Normal file
View File

@@ -0,0 +1,5 @@
# Security Policy
## Reporting a Vulnerability
Please report (suspected) security vulnerabilities to info@tecnick.com.

1
vendor/tecnickcom/tc-lib-unicode/VERSION vendored Normal file
View File

@@ -0,0 +1 @@
2.0.25

41
vendor/tecnickcom/tc-lib-unicode/composer.json vendored Normal file
View File

@@ -0,0 +1,41 @@
{
"name": "tecnickcom/tc-lib-unicode",
"description": "PHP library containing Unicode methods",
"type": "library",
"homepage": "http://www.tecnick.com",
"license": "LGPL-3.0-or-later",
"keywords": [
"tc-lib-unicode",
"PDF",
"font",
"UTF-8",
"Unicode"
],
"authors": [
{
"name": "Nicola Asuni",
"email": "info@tecnick.com",
"role": "lead"
}
],
"require": {
"php": ">=8.1",
"ext-mbstring": "*",
"ext-pcre": "*",
"tecnickcom/tc-lib-unicode-data": "^2.0"
},
"require-dev": {
"pdepend/pdepend": "2.16.2",
"phpmd/phpmd": "2.15.0",
"phpunit/phpunit": "12.2.0 || 11.5.7 || 10.5.40",
"squizlabs/php_codesniffer": "3.13.0"
},
"autoload": {
"psr-4": {
"Com\\Tecnick\\Unicode\\": "src"
}
},
"autoload-dev": {
"psr-4": { "Test\\": "test" }
}
}

23
vendor/tecnickcom/tc-lib-unicode/examples/index.php vendored Normal file
View File

@@ -0,0 +1,23 @@
<?php
/**
* index.php
*
* @since 2011-05-23
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*
* This file is part of tc-lib-unicode software library.
*/
// NOTE: run make deps fonts in the project root to generate the dependencies and example fonts.
// autoloader when using Composer
require ('../vendor/autoload.php');
use \Com\Tecnick\Unicode\Bidi as Bidi;
echo (new Bidi('hello ', null, null, 'R', false))->getString()."\n";

15
vendor/tecnickcom/tc-lib-unicode/phpcompatinfo.json vendored Normal file
View File

@@ -0,0 +1,15 @@
{
"source-providers": [
{
"in": "src as source",
"exclude": "vendor",
"name": "/\\.(php)$/"
}
],
"plugins": [
],
"analysers": [
],
"services": [
]
}

7
vendor/tecnickcom/tc-lib-unicode/phpcs.xml vendored Normal file
View File

@@ -0,0 +1,7 @@
<?xml version="1.0"?>
<ruleset name="backward-compatibility">
<description>PSR-12 for PHP less than 7.1</description>
<rule ref="PSR12">
<exclude name="PSR12.Properties.ConstantVisibility"/>
</rule>
</ruleset>

10
vendor/tecnickcom/tc-lib-unicode/phpstan.neon vendored Normal file
View File

@@ -0,0 +1,10 @@
parameters:
level: max
paths:
- src
- test
excludePaths:
- vendor
ignoreErrors:
reportUnmatchedIgnoredErrors: false
treatPhpDocTypesAsCertain: false

31
vendor/tecnickcom/tc-lib-unicode/phpunit.xml.dist vendored Normal file
View File

@@ -0,0 +1,31 @@
<?xml version="1.0" encoding="UTF-8"?>
<phpunit backupGlobals="false"
bootstrap="vendor/autoload.php"
colors="true"
displayDetailsOnTestsThatTriggerDeprecations="true"
displayDetailsOnTestsThatTriggerErrors="true"
displayDetailsOnTestsThatTriggerNotices="true"
displayDetailsOnTestsThatTriggerWarnings="true"
displayDetailsOnPhpunitDeprecations="true"
processIsolation="false"
stopOnFailure="false">
<testsuites>
<testsuite name="tc-lib-unicode Test Suite">
<directory>./test</directory>
</testsuite>
</testsuites>
<source>
<include>
<directory suffix=".php">src</directory>
</include>
</source>
<coverage>
<report>
<clover outputFile="target/coverage/coverage.xml"/>
<html outputDirectory="target/coverage" lowUpperBound="50" highLowerBound="90"/>
</report>
</coverage>
<logging>
<junit outputFile="target/logs/junit.xml"/>
</logging>
</phpunit>

30
vendor/tecnickcom/tc-lib-unicode/resources/autoload.php vendored Normal file
View File

@@ -0,0 +1,30 @@
<?php
/**
* autoload.php
*
* Autoloader for Tecnick.com libraries
*
* @since 2015-03-04
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2015-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*
* This file is part of tc-lib-unicode software library.
*/
spl_autoload_register(
function ($class) {
$prefix = 'Com\\Tecnick\\';
$len = strlen($prefix);
if (strncmp($prefix, $class, $len) !== 0) {
return;
}
$relative_class = substr($class, $len);
$file = dirname(__DIR__).'/'.str_replace('\\', '/', $relative_class).'.php';
if (file_exists($file)) {
require $file;
}
}
);

7
vendor/tecnickcom/tc-lib-unicode/resources/debian/changelog vendored Normal file
View File

@@ -0,0 +1,7 @@
~#PKGNAME#~ (~#VERSION#~-~#RELEASE#~) UNRELEASED; urgency=low
* Please check the
https://github.com/~#VENDOR#~/~#PROJECT#~
commit history
-- Nicola Asuni <info@tecnick.com> ~#DATE#~

1
vendor/tecnickcom/tc-lib-unicode/resources/debian/compat vendored Normal file
View File

@@ -0,0 +1 @@
10

15
vendor/tecnickcom/tc-lib-unicode/resources/debian/control vendored Normal file
View File

@@ -0,0 +1,15 @@
Source: ~#PKGNAME#~
Maintainer: Nicola Asuni <info@tecnick.com>
Section: php
Priority: optional
Build-Depends: debhelper (>= 9)
Standards-Version: 3.9.7
Homepage: https://github.com/~#VENDOR#~/~#PROJECT#~
Vcs-Git: https://github.com/~#VENDOR#~/~#PROJECT#~.git
Package: ~#PKGNAME#~
Provides: php-~#PROJECT#~
Architecture: all
Depends: php (>= 8.1.0), php-mbstring, php-tecnickcom-tc-lib-unicode-data (<< 3.0.0), php-tecnickcom-tc-lib-unicode-data (>= 2.0.24), ${misc:Depends}
Description: PHP Unicode methods.
PHP library containing Unicode methods.

20
vendor/tecnickcom/tc-lib-unicode/resources/debian/copyright vendored Normal file
View File

@@ -0,0 +1,20 @@
Format: http://www.debian.org/doc/packaging-manuals/copyright-format/1.0/
Upstream-Name: ~#PROJECT#~
Source: https://github.com/~#VENDOR#~/~#PROJECT#~
Files: *
Copyright: Copyright 2001-2024 Nicola Asuni <info@tecnick.com>
License: LGPL-3
License: LGPL-3
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as
published by the Free Software Foundation, either version 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 <http://www.gnu.org/licenses/> or
/usr/share/common-licenses/LGPL-3

3
vendor/tecnickcom/tc-lib-unicode/resources/debian/rules vendored Normal file
View File

@@ -0,0 +1,3 @@
#!/usr/bin/make -f
%:
dh $@

1
vendor/tecnickcom/tc-lib-unicode/resources/debian/source/format vendored Normal file
View File

@@ -0,0 +1 @@
3.0 (quilt)

50
vendor/tecnickcom/tc-lib-unicode/resources/rpm/rpm.spec vendored Normal file
View File

@@ -0,0 +1,50 @@
# SPEC file
%global c_vendor %{_vendor}
%global gh_owner %{_owner}
%global gh_project %{_project}
Name: %{_package}
Version: %{_version}
Release: %{_release}%{?dist}
Summary: PHP library containing Unicode methods
Group: Development/Libraries
License: LGPLv3+
URL: https://github.com/%{gh_owner}/%{gh_project}
BuildRoot: %{_tmppath}/%{name}-%{version}-%{release}-%(%{__id_u} -n)
BuildArch: noarch
Requires: php(language) >= 8.1.0
Requires: php-composer(%{c_vendor}/tc-lib-unicode-data) < 3.0.0
Requires: php-composer(%{c_vendor}/tc-lib-unicode-data) >= 2.0.24
Requires: php-pcre
Requires: php-mbstring
Provides: php-composer(%{c_vendor}/%{gh_project}) = %{version}
Provides: php-%{gh_project} = %{version}
%description
PHP library containing Unicode methods
%build
#(cd %{_current_directory} && make build)
%install
rm -rf $RPM_BUILD_ROOT
(cd %{_current_directory} && make install DESTDIR=$RPM_BUILD_ROOT)
%clean
rm -rf $RPM_BUILD_ROOT
#(cd %{_current_directory} && make clean)
%files
%attr(-,root,root) %{_libpath}
%attr(-,root,root) %{_docpath}
%docdir %{_docpath}
#%config(noreplace) %{_configpath}*
%changelog
* Tue Jul 21 2024 Nicola Asuni <info@tecnick.com> 1.0.0-1
- Initial Commit

362
vendor/tecnickcom/tc-lib-unicode/src/Bidi.php vendored Normal file
View File

@@ -0,0 +1,362 @@
<?php
/**
* Bidi.php
*
* @since 2011-05-23
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*
* This file is part of tc-lib-unicode software library.
*/
namespace Com\Tecnick\Unicode;
use Com\Tecnick\Unicode\Bidi\Shaping;
use Com\Tecnick\Unicode\Bidi\StepI;
use Com\Tecnick\Unicode\Bidi\StepL;
use Com\Tecnick\Unicode\Bidi\StepN;
use Com\Tecnick\Unicode\Bidi\StepP;
use Com\Tecnick\Unicode\Bidi\StepW;
use Com\Tecnick\Unicode\Bidi\StepX;
use Com\Tecnick\Unicode\Bidi\StepXten;
use Com\Tecnick\Unicode\Data\Pattern as UniPattern;
use Com\Tecnick\Unicode\Data\Type as UniType;
use Com\Tecnick\Unicode\Exception as UnicodeException;
/**
* Com\Tecnick\Unicode\Bidi
*
* @since 2015-07-13
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*/
class Bidi
{
/**
* String to process
*/
protected string $str = '';
/**
* Array of UTF-8 chars
*
* @var array<string>
*/
protected array $chrarr = [];
/**
* Array of UTF-8 codepoints
*
* @var array<int>
*/
protected array $ordarr = [];
/**
* Processed string
*/
protected string $bidistr = '';
/**
* Array of processed UTF-8 chars
*
* @var array<string>
*/
protected array $bidichrarr = [];
/**
* Array of processed UTF-8 codepoints
*
* @var array<int>
*/
protected array $bidiordarr = [];
/**
* If 'R' forces RTL, if 'L' forces LTR
*/
protected string $forcedir = '';
/**
* If true enable shaping
*/
protected bool $shaping = true;
/**
* True if the string contains arabic characters
*/
protected bool $arabic = false;
/**
* Array of character data
*
* @var array<int, array{
* 'char': int,
* 'i': int,
* 'level': int,
* 'otype': string,
* 'pdimatch': int,
* 'pos': int,
* 'type': string,
* 'x': int,
* }>
*/
protected array $chardata = [];
/**
* Convert object
*/
protected Convert $conv;
/**
* Reverse the RLT substrings using the Bidirectional Algorithm
* http://unicode.org/reports/tr9/
*
* @param ?string $str String to convert (if null it will be generated from $chrarr or $ordarr)
* @param ?array<string> $chrarr Array of UTF-8 chars (if empty it will be generated from $str or $ordarr)
* @param ?array<int> $ordarr Array of UTF-8 codepoints (if empty it will be generated from $str or $chrarr)
* @param string $forcedir If 'R' forces RTL, if 'L' forces LTR
* @param bool $shaping If true enable the shaping algorithm
*/
public function __construct(
?string $str = null,
?array $chrarr = null,
?array $ordarr = null,
string $forcedir = '',
bool $shaping = true
) {
if (($str === null) && ($chrarr === null || $chrarr === []) && ($ordarr === null || $ordarr === [])) {
throw new UnicodeException('empty input');
}
$this->conv = new Convert();
$this->setInput($str, $chrarr, $ordarr, $forcedir);
if (! $this->isRtlMode()) {
$this->bidistr = $this->str;
$this->bidichrarr = $this->chrarr;
$this->bidiordarr = $this->ordarr;
return;
}
$this->shaping = ($shaping && $this->arabic);
$this->process();
}
/**
* Set Input data
*
* @param ?string $str String to convert (if null it will be generated from $chrarr or $ordarr)
* @param ?array<string> $chrarr Array of UTF-8 chars (if empty it will be generated from $str or $ordarr)
* @param ?array<int> $ordarr Array of UTF-8 codepoints (if empty it will be generated from $str or $chrarr)
* @param string $forcedir If 'R' forces RTL, if 'L' forces LTR
*
* @SuppressWarnings("PHPMD.CyclomaticComplexity")
*/
protected function setInput(
?string $str = null,
?array $chrarr = null,
?array $ordarr = null,
string $forcedir = ''
): void {
if ($str === null) {
if (($chrarr === null || $chrarr === []) && ($ordarr !== null && $ordarr !== [])) {
$chrarr = $this->conv->ordArrToChrArr($ordarr);
}
$str = implode('', $chrarr);
}
if ($chrarr === null || $chrarr === []) {
$chrarr = $this->conv->strToChrArr($str);
}
if ($ordarr === null || $ordarr === []) {
$ordarr = $this->conv->chrArrToOrdArr($chrarr);
}
$this->str = $str;
$this->chrarr = $chrarr;
$this->ordarr = $ordarr;
$this->forcedir = '';
if ($forcedir !== '') {
$this->forcedir = strtoupper($forcedir[0]);
}
}
/**
* Returns the processed array of UTF-8 codepoints
*
* @return array<int>
*/
public function getOrdArray(): array
{
return $this->bidiordarr;
}
/**
* Returns the processed array of UTF-8 chars
*
* @return array<string>
*/
public function getChrArray(): array
{
if ($this->bidichrarr === []) {
$this->bidichrarr = $this->conv->ordArrToChrArr($this->bidiordarr);
}
return $this->bidichrarr;
}
/**
* Returns the number of characters in the processed string
*/
public function getNumChars(): int
{
return count($this->getChrArray());
}
/**
* Returns the processed string
*/
public function getString(): string
{
if ($this->bidistr === '') {
$this->bidistr = implode('', $this->getChrArray());
}
return $this->bidistr;
}
/**
* Returns an array with processed chars as keys
*
* @return array<int, true>
*/
public function getCharKeys(): array
{
return array_fill_keys(array_values($this->bidiordarr), true);
}
/**
* P1. Split the text into separate paragraphs.
* A paragraph separator is kept with the previous paragraph.
*
* @return array<int, array<int>>
*/
protected function getParagraphs(): array
{
$paragraph = [
0 => [],
];
$pdx = 0; // paragraphs index
foreach ($this->ordarr as $ord) {
$paragraph[$pdx][] = $ord;
if (isset(UniType::UNI[$ord]) && (UniType::UNI[$ord] == 'B')) {
++$pdx;
$paragraph[$pdx] = [];
}
}
return $paragraph;
}
/**
* Process the string
*
* @SuppressWarnings("PHPMD.CyclomaticComplexity")
*/
protected function process(): void
{
// split the text into separate paragraphs.
$paragraph = $this->getParagraphs();
// Within each paragraph, apply all the other rules of this algorithm.
foreach ($paragraph as $par) {
$pel = $this->getPel($par);
$stepx = new StepX($par, $pel);
$stepx10 = new StepXten($stepx->getChrData(), $pel);
$ilrs = $stepx10->getIsolatedLevelRunSequences();
$chardata = [];
$maxlevel = 0;
foreach ($ilrs as $ilr) {
$stepw = new StepW($ilr);
$stepn = new StepN($stepw->getSequence());
$stepi = new StepI($stepn->getSequence());
$ilr = $stepi->getSequence();
if ($this->shaping) {
$shaping = new Shaping($ilr);
$ilr = $shaping->getSequence();
}
$chardata = array_merge($chardata, $ilr['item']);
if ($ilr['maxlevel'] > $maxlevel) {
$maxlevel = $ilr['maxlevel'];
}
}
$stepl = new StepL($chardata, $pel, $maxlevel);
$chardata = $stepl->getChrData();
foreach ($chardata as $chardatum) {
$this->bidiordarr[] = $chardatum['char'];
}
// add back the paragraph separators
$lastchar = end($par);
if ($lastchar === false) {
continue;
}
if ($lastchar < 0) {
continue;
}
if (! isset(UniType::UNI[$lastchar])) {
continue;
}
if (UniType::UNI[$lastchar] != 'B') {
continue;
}
$this->bidiordarr[] = $lastchar;
}
}
/**
* Get the paragraph embedding level
*
* @param array<int> $par Paragraph
*/
protected function getPel($par): int
{
if ($this->forcedir === 'R') {
return 1;
}
if ($this->forcedir === 'L') {
return 0;
}
$stepp = new StepP($par);
return $stepp->getPel();
}
/**
* Check if the input string contains RTL characters to process
*/
protected function isRtlMode(): bool
{
$this->arabic = (bool) preg_match(UniPattern::ARABIC, $this->str);
return (($this->forcedir === 'R') || $this->arabic || preg_match(UniPattern::RTL, $this->str));
}
}

140
vendor/tecnickcom/tc-lib-unicode/src/Bidi/Shaping.php vendored Normal file
View File

@@ -0,0 +1,140 @@
<?php
/**
* Shaping.php
*
* @since 2011-05-23
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*
* This file is part of tc-lib-unicode software library.
*/
namespace Com\Tecnick\Unicode\Bidi;
use Com\Tecnick\Unicode\Data\Arabic as UniArabic;
use Com\Tecnick\Unicode\Data\Constant as UniConstant;
/**
* Com\Tecnick\Unicode\Bidi\Shaping
*
* @since 2015-07-13
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*
* @phpstan-import-type SeqData from \Com\Tecnick\Unicode\Bidi\Shaping\Arabic
*/
class Shaping extends \Com\Tecnick\Unicode\Bidi\Shaping\Arabic
{
/**
* Shaping
* Cursively connected scripts, such as Arabic or Syriac,
* require the selection of positional character shapes that depend on adjacent characters.
* Shaping is logically applied after the Bidirectional Algorithm is used and is limited to
* characters within the same directional run.
*
* @param SeqData $seq isolated Sequence array
*/
public function __construct(array $seq)
{
$this->seq = $seq;
$this->newchardata = $seq['item'];
$this->process();
}
/**
* Returns the processed sequence
*
* @return SeqData
*/
public function getSequence(): array
{
return $this->seq;
}
/**
* Process
*/
protected function process(): void
{
$this->setAlChars();
for ($idx = 0; $idx < $this->seq['length']; ++$idx) {
if ($this->seq['item'][$idx]['otype'] == 'AL') {
$thischar = $this->seq['item'][$idx];
$pos = $thischar['x'];
$prevchar = (($pos > 0) ? $this->alchars[($pos - 1)] : null);
$nextchar = ((($pos + 1) < $this->numalchars) ? $this->alchars[($pos + 1)] : null);
$this->processAlChar($idx, $pos, $prevchar, $thischar, $nextchar);
}
}
$this->combineShadda();
$this->removeDeletedChars();
$this->seq['item'] = array_values($this->newchardata);
unset($this->newchardata);
}
/**
* Set AL chars array
*/
protected function setAlChars(): void
{
$this->numalchars = 0;
for ($idx = 0; $idx < $this->seq['length']; ++$idx) {
if (
($this->seq['item'][$idx]['otype'] == 'AL')
|| ($this->seq['item'][$idx]['char'] == UniConstant::SPACE)
|| ($this->seq['item'][$idx]['char'] == UniConstant::ZERO_WIDTH_NON_JOINER)
) {
$this->alchars[$this->numalchars]['i'] = $idx;
$this->alchars[$this->numalchars] = array_merge(
$this->alchars[$this->numalchars],
$this->seq['item'][$idx]
);
$this->seq['item'][$idx]['x'] = $this->numalchars;
++$this->numalchars;
}
}
}
/**
* Combine characters that can occur with Arabic Shadda (0651 HEX, 1617 DEC).
* Putting the combining mark and shadda in the same glyph allows
* to avoid the two marks overlapping each other in an illegible manner.
*/
protected function combineShadda(): void
{
$last = ($this->seq['length'] - 1);
for ($idx = 0; $idx < $last; ++$idx) {
$cur = $this->newchardata[$idx]['char'];
$nxt = $this->newchardata[($idx + 1)]['char'];
if (
($cur == UniArabic::SHADDA)
&& ($nxt >= 0) && (isset(UniArabic::DIACRITIC[$nxt]))
) {
$this->newchardata[$idx]['char'] = -1;
$this->newchardata[($idx + 1)]['char'] = UniArabic::DIACRITIC[$nxt];
}
}
}
/**
* Remove marked characters
*/
protected function removeDeletedChars(): void
{
foreach ($this->newchardata as $key => $value) {
if ($value['char'] < 0) {
unset($this->newchardata[$key]);
}
}
}
}

266
vendor/tecnickcom/tc-lib-unicode/src/Bidi/Shaping/Arabic.php vendored Normal file
View File

@@ -0,0 +1,266 @@
<?php
/**
* Arabic.php
*
* @since 2011-05-23
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*
* This file is part of tc-lib-unicode software library.
*/
namespace Com\Tecnick\Unicode\Bidi\Shaping;
use Com\Tecnick\Unicode\Data\Arabic as UniArabic;
/**
* Com\Tecnick\Unicode\Bidi\Shaping\Arabic
*
* @since 2015-07-13
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*
* @phpstan-type CharData array{
* 'char': int,
* 'i': int,
* 'level': int,
* 'otype': string,
* 'pdimatch': int,
* 'pos': int,
* 'type': string,
* 'x': int,
* }
*
* @phpstan-type SeqData array{
* 'e': int,
* 'edir': string,
* 'end': int,
* 'eos': string,
* 'length': int,
* 'maxlevel': int,
* 'sos': string,
* 'start': int,
* 'item': array<int, CharData>,
* }
*/
abstract class Arabic
{
/**
* Sequence to process and return
*
* @var SeqData
*/
protected array $seq = [
'e' => 0,
'edir' => '',
'end' => 0,
'eos' => '',
'length' => 0,
'maxlevel' => 0,
'sos' => '',
'start' => 0,
'item' => [],
];
/**
* Array of processed chars
*
* @var array<int, CharData>
*/
protected array $newchardata = [];
/**
* Array of AL characters
*
* @var array<int, CharData>
*/
protected array $alchars = [];
/**
* Number of AL characters
*/
protected int $numalchars = 0;
/**
* Check if it is a LAA LETTER
*
* @param ?CharData $prevchar Previous char
* @param CharData $thischar Current char
*/
protected function isLaaLetter(?array $prevchar, array $thischar): bool
{
return ($prevchar !== null)
&& ($prevchar['char'] == UniArabic::LAM)
&& (isset(UniArabic::LAA[$thischar['char']]));
}
/**
* Check next char
*
* @param CharData $thischar Current char
* @param ?CharData $nextchar Next char
*/
protected function hasNextChar(array $thischar, ?array $nextchar): bool
{
return (($nextchar !== null)
&& (($nextchar['otype'] == 'AL') || ($nextchar['otype'] == 'NSM'))
&& ($nextchar['type'] == $thischar['type'])
&& ($nextchar['char'] != UniArabic::QUESTION_MARK)
);
}
/**
* Check previous char
*
* @param ?CharData $prevchar Previous char
* @param CharData $thischar Current char
*/
protected function hasPrevChar(?array $prevchar, array $thischar): bool
{
return ((($prevchar !== null)
&& (($prevchar['otype'] == 'AL') || ($prevchar['otype'] == 'NSM'))
&& ($prevchar['type'] == $thischar['type']))
);
}
/**
* Check if it is a middle character
*
* @param ?CharData $prevchar Previous char
* @param CharData $thischar Current char
* @param ?CharData $nextchar Next char
*/
protected function isMiddleChar(?array $prevchar, array $thischar, ?array $nextchar): bool
{
return ($this->hasPrevChar($prevchar, $thischar) && $this->hasNextChar($thischar, $nextchar));
}
/**
* Check if it is a final character
*
* @param ?CharData $prevchar Previous char
* @param CharData $thischar Current char
* @param ?CharData $nextchar Next char
*/
protected function isFinalChar(?array $prevchar, array $thischar, ?array $nextchar): bool
{
if ($this->hasPrevChar($prevchar, $thischar)) {
return true;
}
return (($nextchar !== null) && ($nextchar['char'] == UniArabic::QUESTION_MARK));
}
/**
* Set initial or middle char
*
* @param int $idx Current index
* @param ?CharData $prevchar Previous char
* @param CharData $thischar Current char
* @param array<int, array<int>> $arabicarr Substitution array
*/
protected function setMiddleChar(int $idx, ?array $prevchar, array $thischar, array $arabicarr): void
{
if (($prevchar != null) && in_array($prevchar['char'], UniArabic::END)) {
if (isset($arabicarr[$thischar['char']][2])) {
// initial
$this->newchardata[$idx]['char'] = $arabicarr[$thischar['char']][2];
}
} elseif (isset($arabicarr[$thischar['char']][3])) {
// medial
$this->newchardata[$idx]['char'] = $arabicarr[$thischar['char']][3];
}
}
/**
* Set initial char
*
* @param int $idx Current index
* @param CharData $thischar Current char
* @param array<int, array<int>> $arabicarr Substitution array
*/
protected function setInitialChar(int $idx, array $thischar, array $arabicarr): void
{
if (isset($arabicarr[$this->seq['item'][$idx]['char']][2])) {
$this->newchardata[$idx]['char'] = $arabicarr[$thischar['char']][2];
}
}
/**
* Set final char
*
* @param int $idx Current index
* @param ?CharData $prevchar Previous char
* @param CharData $thischar Current char
* @param array<int, array<int>> $arabicarr Substitution array
*/
protected function setFinalChar(int $idx, ?array $prevchar, array $thischar, array $arabicarr): void
{
if (
($idx > 1)
&& ($thischar['char'] == UniArabic::HEH)
&& ($this->seq['item'][($idx - 1)]['char'] == UniArabic::LAM)
&& ($this->seq['item'][($idx - 2)]['char'] == UniArabic::LAM)
) {
// Allah Word
$this->newchardata[($idx - 2)]['char'] = -1;
$this->newchardata[($idx - 1)]['char'] = -1;
$this->newchardata[$idx]['char'] = UniArabic::LIGATURE_ALLAH_ISOLATED_FORM;
} elseif (($prevchar !== null) && in_array($prevchar['char'], UniArabic::END)) {
if (isset($arabicarr[$thischar['char']][0])) {
// isolated
$this->newchardata[$idx]['char'] = $arabicarr[$thischar['char']][0];
}
} elseif (isset($arabicarr[$thischar['char']][1])) {
// final
$this->newchardata[$idx]['char'] = $arabicarr[$thischar['char']][1];
}
}
/**
* Process AL character
*
* @param int $idx Current index
* @param int $pos Current char position
* @param ?CharData $prevchar Previous char
* @param CharData $thischar Current char
* @param ?CharData $nextchar Next char
*/
protected function processAlChar(int $idx, int $pos, ?array $prevchar, array $thischar, ?array $nextchar): void
{
$laaletter = $this->isLaaLetter($prevchar, $thischar);
if ($laaletter) {
$arabicarr = UniArabic::LAA;
$prevchar = (($pos > 1) ? $this->alchars[($pos - 2)] : null);
} else {
$arabicarr = UniArabic::SUBSTITUTE;
}
if ($this->isMiddleChar($prevchar, $thischar, $nextchar)) {
$this->setMiddleChar($idx, $prevchar, $thischar, $arabicarr);
} elseif ($this->hasNextChar($thischar, $nextchar)) {
$this->setInitialChar($idx, $thischar, $arabicarr);
} elseif ($this->isFinalChar($prevchar, $thischar, $nextchar)) {
// final
$this->setFinalChar($idx, $prevchar, $thischar, $arabicarr);
} elseif (isset($arabicarr[$thischar['char']][0])) {
// isolated
$this->newchardata[$idx]['char'] = $arabicarr[$thischar['char']][0];
}
// if laa letter
if ($laaletter) {
// mark characters to delete
$this->newchardata[($this->alchars[($pos - 1)]['i'])]['char'] = -1;
}
}
}

78
vendor/tecnickcom/tc-lib-unicode/src/Bidi/StepBase.php vendored Normal file
View File

@@ -0,0 +1,78 @@
<?php
/**
* StepBase.php
*
* @since 2011-05-23
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*
* This file is part of tc-lib-unicode software library.
*/
namespace Com\Tecnick\Unicode\Bidi;
/**
* Com\Tecnick\Unicode\Bidi\StepBase
*
* @since 2015-07-13
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*
* @phpstan-import-type SeqData from \Com\Tecnick\Unicode\Bidi\Shaping\Arabic
*/
abstract class StepBase
{
/**
* Initialize Sequence to process
*
* @param SeqData $seq Isolated Sequence array
* @param bool $process If false disable automatic processing (this is a testing flag)
*/
public function __construct(
/**
* Sequence to process and return
*/
protected array $seq,
$process = true
) {
if ($process) {
$this->process();
}
}
/**
* Returns the processed array
*
* @return SeqData
*/
public function getSequence(): array
{
return $this->seq;
}
/**
* Process the current step
*/
abstract protected function process(): void;
/**
* Generic step
*
* @param string $method Processing methos
*/
public function processStep($method): void
{
for ($idx = 0; $idx < $this->seq['length']; ++$idx) {
$this->$method($idx);
}
}
}

71
vendor/tecnickcom/tc-lib-unicode/src/Bidi/StepI.php vendored Normal file
View File

@@ -0,0 +1,71 @@
<?php
/**
* StepI.php
*
* @since 2011-05-23
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*
* This file is part of tc-lib-unicode software library.
*/
namespace Com\Tecnick\Unicode\Bidi;
/**
* Com\Tecnick\Unicode\Bidi\StepI
*
* @since 2015-07-13
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*/
class StepI extends \Com\Tecnick\Unicode\Bidi\StepBase
{
/**
* Process I steps
*/
protected function process(): void
{
$this->seq['maxlevel'] = 0;
$this->processStep('processI');
}
/**
* I1. For all characters with an even (left-to-right) embedding level, those of type R go up one level and those
* of type AN or EN go up two levels.
* I2. For all characters with an odd (right-to-left) embedding level, those of type L, EN or AN go up one level.
*
* @param int $idx Current character position
*/
protected function processI(int $idx): void
{
$odd = ($this->seq['item'][$idx]['level'] % 2);
if ($odd !== 0) {
if (
($this->seq['item'][$idx]['type'] == 'L')
|| ($this->seq['item'][$idx]['type'] == 'EN')
|| ($this->seq['item'][$idx]['type'] == 'AN')
) {
++$this->seq['item'][$idx]['level'];
}
} elseif ($this->seq['item'][$idx]['type'] == 'R') {
++$this->seq['item'][$idx]['level'];
} elseif (
($this->seq['item'][$idx]['type'] == 'AN')
|| ($this->seq['item'][$idx]['type'] == 'EN')
) {
$this->seq['item'][$idx]['level'] += 2;
}
// update the maximum level
$this->seq['maxlevel'] = max($this->seq['maxlevel'], $this->seq['item'][$idx]['level']);
}
}

173
vendor/tecnickcom/tc-lib-unicode/src/Bidi/StepL.php vendored Normal file
View File

@@ -0,0 +1,173 @@
<?php
/**
* StepL.php
*
* @since 2011-05-23
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*
* This file is part of tc-lib-unicode software library.
*/
namespace Com\Tecnick\Unicode\Bidi;
use Com\Tecnick\Unicode\Data\Constant as UniConstant;
use Com\Tecnick\Unicode\Data\Mirror as UniMirror;
/**
* Com\Tecnick\Unicode\Bidi\StepL
*
* @since 2015-07-13
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*
* @phpstan-import-type CharData from \Com\Tecnick\Unicode\Bidi\Shaping\Arabic
*/
class StepL
{
/**
* Array of characters data to return
*
* @var array<int, CharData>
*/
protected array $chardata = [];
/**
* Number of characters in $this->chardata
*/
protected int $numchars;
/**
* L steps
*
* @param array<int, CharData> $chardata Array of characters data
* @param int $pel Paragraph embedding level
* @param int $maxlevel Maximum level
*/
public function __construct(
array $chardata,
/**
* Paragraph embedding level
*/
protected int $pel,
/**
* Maximum level
*/
protected int $maxlevel
) {
// reorder chars by their original position
usort(
$chardata,
static fn ($apos, $bpos): int => ($apos['pos'] - $bpos['pos'])
);
$this->chardata = $chardata;
$this->numchars = count($this->chardata);
$this->processL1();
$this->processL2();
}
/**
* Returns the processed array
*
* @return array<int, CharData>
*/
public function getChrData(): array
{
return $this->chardata;
}
/**
* L1. On each line, reset the embedding level of the following characters to the paragraph embedding level:
* 1. Segment separators,
* 2. Paragraph separators,
* 3. Any sequence of whitespace characters and/or isolate formatting characters (FSI, LRI, RLI, and PDI)
* preceding a segment separator or paragraph separator, and
* 4. Any sequence of whitespace characters and/or isolate formatting characters (FSI, LRI, RLI, and PDI)
* at the end of the line.
*/
protected function processL1(): void
{
for ($idx = 0; $idx < $this->numchars; ++$idx) {
$this->processL1b($idx, $idx);
}
}
/**
* Internal L1 step
*
* @param int $idx Main character index
* @param int $jdx Current index
*/
protected function processL1b(int $idx, int $jdx): void
{
if ($jdx >= ($this->numchars - 1)) {
return;
}
if (
(($this->chardata[$jdx]['otype'] == 'S') || ($this->chardata[$jdx]['otype'] == 'B'))
|| (($jdx === $this->numchars - 1) && ($this->chardata[$jdx]['otype'] == 'WS'))
) {
$this->chardata[$idx]['level'] = $this->pel;
return;
}
if ($this->chardata[$jdx]['otype'] == 'WS') {
return;
}
if ($this->chardata[$idx]['char'] >= UniConstant::LRI && $this->chardata[$idx]['char'] <= UniConstant::PDI) {
return;
}
$this->processL1b($idx, ($jdx + 1));
}
/**
* L2. From the highest level found in the text to the lowest odd level on each line,
* including intermediate levels not actually present in the text,
* reverse any contiguous sequence of characters that are at that level or higher.
* This rule reverses a progressively larger series of substrings.
*/
protected function processL2(): void
{
for ($level = $this->maxlevel; $level > 0; --$level) {
$ordered = [];
$reversed = [];
foreach ($this->chardata as $chardatum) {
if ($chardatum['level'] >= $level) {
if (($chardatum['type'] == 'R') && (isset(UniMirror::UNI[$chardatum['char']]))) {
// L4. A character is depicted by a mirrored glyph if and only if
// (a) the resolved directionality of that character is R, and
// (b) the Bidi_Mirrored property value of that character is true.
$chardatum['char'] = UniMirror::UNI[$chardatum['char']];
}
$reversed[] = $chardatum;
} else {
if ($reversed !== []) {
$ordered = array_merge($ordered, array_reverse($reversed));
$reversed = [];
}
$ordered[] = $chardatum;
}
}
if ($reversed !== []) {
$ordered = array_merge($ordered, array_reverse($reversed));
}
$this->chardata = $ordered;
}
}
}

312
vendor/tecnickcom/tc-lib-unicode/src/Bidi/StepN.php vendored Normal file
View File

@@ -0,0 +1,312 @@
<?php
/**
* StepN.php
*
* @since 2011-05-23
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*
* This file is part of tc-lib-unicode software library.
*/
namespace Com\Tecnick\Unicode\Bidi;
use Com\Tecnick\Unicode\Data\Bracket as UniBracket;
/**
* Com\Tecnick\Unicode\Bidi\StepN
*
* @since 2015-07-13
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*/
class StepN extends \Com\Tecnick\Unicode\Bidi\StepBase
{
/**
* List or bracket pairs positions
*
* @var array<int, int>
*/
protected array $brackets = [];
/**
* Stack used to store bracket positions
*
* @var array<int, array{int, int}>
*/
protected array $bstack = [];
/**
* Process N steps
* Resolving Neutral and Isolate Formatting Types
*
* Neutral and isolate formatting (i.e. NI) characters are resolved one isolating run sequence at a time.
* Its results are that all NIs become either R or L. Generally, NIs take on the direction of the surrounding text.
* In case of a conflict, they take on the embedding direction.
* At isolating run sequence boundaries where the type of the character on the other side of the boundary
* is required, the type assigned to sos or eos is used.
*
* Bracket pairs within an isolating run sequence are processed as units so that both the opening and the closing
* paired bracket in a pair resolve to the same direction. Note that this rule is applied based on the current
* bidirectional character type of each paired bracket and not the original type, as this could have changed under
* X6. The current bidirectional character type may also have changed under a previous iteration of the for loop in
* N0 in the case of nested bracket pairs.
*/
protected function process(): void
{
$this->processStep('getBracketPairs');
$this->processN0();
$this->processStep('processN1');
$this->processStep('processN2');
}
/**
* BD16. Find all bracket pairs
*/
protected function getBracketPairs(int $idx): void
{
$char = $this->seq['item'][$idx]['char'];
if (isset(UniBracket::OPEN[$char])) {
// process open bracket
if ($char == 0x3008) {
$char = 0x2329;
}
$this->bstack[] = [$idx, $char];
} elseif (isset(UniBracket::CLOSE[$char])) {
// process closign bracket
if ($char == 0x3009) {
$char = 0x232A;
}
// find matching opening bracket
$tmpstack = $this->bstack;
while ($tmpstack !== []) {
$item = array_pop($tmpstack);
if ($char == UniBracket::OPEN[$item[1]]) {
$this->brackets[$item[0]] = $idx;
$this->bstack = $tmpstack;
}
}
}
// Sort the list of pairs of text positions in ascending order
// based on the text position of the opening paired bracket.
ksort($this->brackets);
}
/**
* Return the normalized chat type for the N0 step
* Within this scope, bidirectional types EN and AN are treated as R.
*
* @param string $type Char type
*/
protected function getN0Type(string $type): string
{
return ((($type == 'AN') || ($type == 'EN')) ? 'R' : $type);
}
/**
* N0. Process bracket pairs in an isolating run sequence sequentially in the logical order of the text positions
* of the opening paired brackets.
*/
protected function processN0(): void
{
$odir = (($this->seq['edir'] == 'L') ? 'R' : 'L');
// For each bracket-pair element in the list of pairs of text positions
foreach ($this->brackets as $open => $close) {
if ($this->processInsideBrackets($open, $close, $odir)) {
for ($jdx = ($open - 1); $jdx >= 0; --$jdx) {
$btype = $this->getN0Type($this->seq['item'][$jdx]['type']);
if ($btype == $odir) {
// 1. If the preceding strong type is also opposite the embedding direction,
// context is established, so set the type for both brackets in the pair to that direction.
$this->setBracketsType($open, $close, $odir);
break;
} elseif ($btype == $this->seq['edir']) {
// 2. Otherwise set the type for both brackets in the pair to the embedding direction.
$this->setBracketsType($open, $close, $this->seq['edir']);
break;
}
}
if ($jdx < 0) {
$this->setBracketsType($open, $close, $this->seq['sos']);
}
}
// d. Otherwise, there are no strong types within the bracket pair. Therefore, do not set the type for that
// bracket pair. Note that if the enclosed text contains no strong types the bracket pairs will both
// resolve to the same level when resolved individually using rules N1 and N2.
}
}
/**
* Inspect the bidirectional types of the characters enclosed within the bracket pair.
*
* @param int $open Open bracket entry
* @param int $close Close bracket entry
* @param string $odir Opposite direction (L or R)
*
* @return bool True if type has not been found
*/
protected function processInsideBrackets(int $open, int $close, string $odir): bool
{
$opposite = false;
// a. Inspect the bidirectional types of the characters enclosed within the bracket pair.
for ($jdx = ($open + 1); $jdx < $close; ++$jdx) {
$btype = $this->getN0Type($this->seq['item'][$jdx]['type']);
// b. If any strong type (either L or R) matching the embedding direction is found,
// set the type for both brackets in the pair to match the embedding direction.
if ($btype == $this->seq['edir']) {
$this->setBracketsType($open, $close, $this->seq['edir']);
break;
} elseif ($btype === $odir) {
// c. Otherwise, if there is a strong type it must be opposite the embedding direction.
$opposite = true;
}
}
// Therefore, test for an established context with a preceding strong type by checking backwards before
// the opening paired bracket until the first strong type (L, R, or sos) is found.
return (($jdx === $close) && $opposite);
}
/**
* Set the brackets type
*
* @param int $open Open bracket entry
* @param int $close Close bracket entry
* @param string $type Type
*/
protected function setBracketsType(int $open, int $close, string $type): void
{
$this->seq['item'][$open]['type'] = $type;
$this->seq['item'][$close]['type'] = $type;
// Any number of characters that had original bidirectional character type NSM
// prior to the application of W1 that immediately follow a paired bracket which
// changed to L or R under N0 should change to match the type of their preceding bracket.
$next = ($close + 1);
while (isset($this->seq['item'][$next]['otype']) && ($this->seq['item'][$next]['otype'] == 'NSM')) {
$this->seq['item'][$next]['type'] = $type;
++$next;
}
}
/**
* N1. A sequence of NIs takes the direction of the surrounding strong text if the text on both sides has the same
* direction. European and Arabic numbers act as if they were R in terms of their influence on NIs.
* The start-of-sequence (sos) and end-of-sequence (eos) types are used at isolating run sequence boundaries.
*
* @param int $idx Current character position
*/
protected function processN1(int $idx): void
{
if ($this->seq['item'][$idx]['type'] == 'NI') {
$bdx = ($idx - 1);
$prev = $this->processN1prev($bdx);
if ($prev === '') {
return;
}
$jdx = $this->getNextN1Char($idx);
$next = $this->processN1next($jdx);
if ($next === '') {
return;
}
if ($next === $prev) {
for ($bdx = $idx; (($bdx < $jdx) && ($bdx < $this->seq['length'])); ++$bdx) {
$this->seq['item'][$bdx]['type'] = $next;
}
}
}
}
/**
* Get the next direction
*
* @param int $bdx Position of the preceding character
*
* @return string Previous position
*/
protected function processN1prev(int &$bdx): string
{
if ($bdx < 0) {
$bdx = 0;
return $this->seq['sos'];
}
if (in_array($this->seq['item'][$bdx]['type'], ['R', 'AN', 'EN'])) {
return 'R';
}
if ($this->seq['item'][$bdx]['type'] == 'L') {
return 'L';
}
return '';
}
/**
* Get the next direction
*
* @param int $jdx Position of the next character
*
* @return string Previous position
*/
protected function processN1next(int &$jdx): string
{
if ($jdx >= $this->seq['length']) {
$jdx = $this->seq['length'];
return $this->seq['eos'];
}
if (in_array($this->seq['item'][$jdx]['type'], ['R', 'AN', 'EN'])) {
return 'R';
}
if ($this->seq['item'][$jdx]['type'] == 'L') {
return 'L';
}
return '';
}
/**
* Return the index of the next valid char for N1
*
* @param int $idx Start index
*/
protected function getNextN1Char(int $idx): int
{
$jdx = ($idx + 1);
while (($jdx < $this->seq['length']) && ($this->seq['item'][$jdx]['type'] == 'NI')) {
++$jdx;
}
return $jdx;
}
/**
* N2. Any remaining NIs take the embedding direction.
*
* @param int $idx Current character position
*/
protected function processN2($idx): void
{
if ($this->seq['item'][$idx]['type'] == 'NI') {
$this->seq['item'][$idx]['type'] = $this->seq['edir'];
}
}
}

89
vendor/tecnickcom/tc-lib-unicode/src/Bidi/StepP.php vendored Normal file
View File

@@ -0,0 +1,89 @@
<?php
/**
* StepP.php
*
* @since 2011-05-23
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*
* This file is part of tc-lib-unicode software library.
*/
namespace Com\Tecnick\Unicode\Bidi;
use Com\Tecnick\Unicode\Data\Constant as UniConstant;
use Com\Tecnick\Unicode\Data\Type as UniType;
/**
* Com\Tecnick\Unicode\Bidi\StepP
*
* @since 2015-07-13
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*/
class StepP
{
/**
* P Steps for Bidirectional algorithm
*
* @param array<int> $ordarr Array of UTF-8 codepoints
*/
public function __construct(
/**
* Array of UTF-8 codepoints
*/
protected array $ordarr
) {
}
/**
* Get the Paragraph Embedding Level
*/
public function getPel(): int
{
// P2. In each paragraph, find the first character of type L, AL, or R
// while skipping over any characters between an isolate initiator and its matching PDI or,
// if it has no matching PDI, the end of the paragraph.
// P3. If a character is found in P2 and it is of type AL or R,
// then set the paragraph embedding level to one; otherwise, set it to zero.
$isolate = 0;
foreach ($this->ordarr as $ord) {
$isolate = $this->getIsolateLevel($ord, $isolate);
if (($isolate == 0) && isset(UniType::UNI[$ord])) {
$type = UniType::UNI[$ord];
if ($type === 'L') {
return 0;
}
if (($type === 'R') || ($type === 'AL')) {
return 1;
}
}
}
return 0;
}
/**
* Update the level of explicit directional isolates
*/
protected function getIsolateLevel(int $ord, int $isolate): int
{
if (($ord == UniConstant::LRI) || ($ord == UniConstant::RLI) || ($ord == UniConstant::FSI)) {
++$isolate;
} elseif ($ord == UniConstant::PDI) {
--$isolate;
}
return max(0, $isolate);
}
}

215
vendor/tecnickcom/tc-lib-unicode/src/Bidi/StepW.php vendored Normal file
View File

@@ -0,0 +1,215 @@
<?php
/**
* StepW.php
*
* @since 2011-05-23
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*
* This file is part of tc-lib-unicode software library.
*/
namespace Com\Tecnick\Unicode\Bidi;
use Com\Tecnick\Unicode\Data\Constant as UniConstant;
/**
* Com\Tecnick\Unicode\Bidi\StepW
*
* @since 2015-07-13
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*/
class StepW extends \Com\Tecnick\Unicode\Bidi\StepBase
{
/**
* Process W steps
* Resolving Weak Types
*/
protected function process(): void
{
$this->processStep('processW1');
$this->processStep('processW2');
$this->processStep('processW3');
$this->processStep('processW4');
$this->processStep('processW5');
$this->processStep('processW6');
$this->processStep('processW7');
}
/**
* W1. Examine each nonspacing mark (NSM) in the isolating run sequence, and
* change the type of the NSM to Other Neutral if the previous character is an isolate initiator or PDI, and
* to the type of the previous character otherwise.
* If the NSM is at the start of the isolating run sequence, it will get the type of sos.
* (Note that in an isolating run sequence, an isolate initiator followed by an NSM or any type
* other than PDI must be an overflow isolate initiator.)
*
* @param int $idx Current character position
*/
protected function processW1(int $idx): void
{
if ($this->seq['item'][$idx]['type'] == 'NSM') {
$jdx = ($idx - 1);
if ($jdx < 0) {
$this->seq['item'][$idx]['type'] = $this->seq['sos'];
} elseif (
($this->seq['item'][$jdx]['char'] >= UniConstant::LRI)
&& ($this->seq['item'][$jdx]['char'] <= UniConstant::PDI)
) {
$this->seq['item'][$idx]['type'] = 'ON';
} else {
$this->seq['item'][$idx]['type'] = $this->seq['item'][$jdx]['type'];
}
}
}
/**
* W2. Search backward from each instance of a European number until the first strong type (R, L, AL, or sos)
* is found. If an AL is found, change the type of the European number to Arabic number.
*
* @param int $idx Current character position
*/
protected function processW2(int $idx): void
{
if ($this->seq['item'][$idx]['type'] == 'EN') {
$jdx = ($idx - 1);
while ($jdx >= 0) {
if ($this->seq['item'][$jdx]['type'] == 'AL') {
$this->seq['item'][$idx]['type'] = 'AN';
break;
} elseif (in_array($this->seq['item'][$jdx]['type'], ['R', 'L'])) {
break;
}
--$jdx;
}
}
}
/**
* W3. Change all ALs to R.
*
* @param int $idx Current character position
*/
protected function processW3(int $idx): void
{
if ($this->seq['item'][$idx]['type'] == 'AL') {
$this->seq['item'][$idx]['type'] = 'R';
}
}
/**
* W4. A single European separator between two European numbers changes to a European number.
* A single common separator between two numbers of the same type changes to that type.
*
* @param int $idx Current character position
*/
protected function processW4(int $idx): void
{
if (in_array($this->seq['item'][$idx]['type'], ['ES', 'CS'])) {
$bdx = ($idx - 1);
$fdx = ($idx + 1);
if (
($bdx >= 0)
&& ($fdx < $this->seq['length'])
&& $this->seq['item'][$bdx]['type'] == $this->seq['item'][$fdx]['type']
&& in_array($this->seq['item'][$bdx]['type'], ['EN', 'AN'])
) {
$this->seq['item'][$idx]['type'] = $this->seq['item'][$bdx]['type'];
}
}
}
/**
* W5. A sequence of European terminators adjacent to European numbers changes to all European numbers.
*
* @param int $idx Current character position
*/
protected function processW5(int $idx): void
{
if ($this->seq['item'][$idx]['type'] == 'ET') {
$this->processW5a($idx);
$this->processW5b($idx);
}
}
/**
* W5a
*
* @param int $idx Current character position
*/
protected function processW5a(int $idx): void
{
for ($jdx = ($idx - 1); $jdx >= 0; --$jdx) {
if ($this->seq['item'][$jdx]['type'] == 'EN') {
$this->seq['item'][$idx]['type'] = 'EN';
} else {
break;
}
}
}
/**
* W5b
*
* @param int $idx Current character position
*/
protected function processW5b(int $idx): void
{
if ($this->seq['item'][$idx]['type'] == 'ET') {
for ($jdx = ($idx + 1); $jdx < $this->seq['length']; ++$jdx) {
if ($this->seq['item'][$jdx]['type'] == 'EN') {
$this->seq['item'][$idx]['type'] = 'EN';
} elseif ($this->seq['item'][$jdx]['type'] != 'ET') {
break;
}
}
}
}
/**
* W6. Otherwise, separators and terminators change to Other Neutral.
*
* @param int $idx Current character position
*/
protected function processW6(int $idx): void
{
if (in_array($this->seq['item'][$idx]['type'], ['ET', 'ES', 'CS', 'ON'])) {
$this->seq['item'][$idx]['type'] = 'ON';
}
}
/**
* W7. Search backward from each instance of a European number until the first strong type (R, L, or sos) is found.
* If an L is found, then change the type of the European number to L.
*
* @param int $idx Current character position
*/
protected function processW7(int $idx): void
{
if ($this->seq['item'][$idx]['type'] == 'EN') {
for ($jdx = ($idx - 1); $jdx >= 0; --$jdx) {
if ($this->seq['item'][$jdx]['type'] == 'L') {
$this->seq['item'][$idx]['type'] = 'L';
break;
} elseif ($this->seq['item'][$jdx]['type'] == 'R') {
break;
}
}
if (($this->seq['sos'] == 'L') && ($jdx < 0)) {
$this->seq['item'][$idx]['type'] = 'L';
}
}
}
}

424
vendor/tecnickcom/tc-lib-unicode/src/Bidi/StepX.php vendored Normal file
View File

@@ -0,0 +1,424 @@
<?php
/**
* StepX.php
*
* @since 2011-05-23
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*
* This file is part of tc-lib-unicode software library.
*/
namespace Com\Tecnick\Unicode\Bidi;
use Com\Tecnick\Unicode\Data\Constant as UniConstant;
use Com\Tecnick\Unicode\Data\Type as UniType;
/**
* Com\Tecnick\Unicode\Bidi\StepX
*
* @since 2015-07-13
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*
* @phpstan-import-type SeqData from \Com\Tecnick\Unicode\Bidi\Shaping\Arabic
* @phpstan-import-type CharData from \Com\Tecnick\Unicode\Bidi\Shaping\Arabic
*
* @phpstan-type DssData array{
* 'ord': int,
* 'cel': int,
* 'dos': string,
* 'dis': bool,
* }
*/
class StepX
{
/**
* Maximum embedding level
*/
public const MAX_DEPTH = 125;
/**
* Directional Status Stack
*
* @var array<int, DssData>
*/
protected array $dss = [];
/**
* Overflow Isolate Count
*/
protected int $oic = 0;
/**
* Overflow Embedding Count
*/
protected int $oec = 0;
/**
* Valid Isolate Count
*/
protected int $vic = 0;
/**
* Array of characters data to return
*
* @var array<int, CharData>
*/
protected array $chardata = [];
/**
* X Steps for Bidirectional algorithm
* Explicit Levels and Directions
*
* @param array<int> $ordarr Array of UTF-8 codepoints
* @param int $pel Paragraph embedding level
*/
public function __construct(
/**
* Array of UTF-8 codepoints
*/
protected array $ordarr,
int $pel
) {
// - Push onto the stack an entry consisting of the paragraph embedding level,
// a neutral directional override status, and a false directional isolate status.
$this->dss[] = [
'ord' => -1, // dummy value, not used
'cel' => $pel,
'dos' => 'NI',
'dis' => false,
];
// - Process each character iteratively, applying rules X2 through X8.
// Only embedding levels from 0 through max_depth are valid in this phase.
// (Note that in the resolution of levels in rules I1 and I2,
// the maximum embedding level of max_depth+1 can be reached.)
$this->processX();
}
/**
* Returns the processed array
*
* @return array<int, CharData>
*/
public function getChrData(): array
{
return $this->chardata;
}
/**
* Calculate the Least Even
*
* @param int $num Number to process
*/
protected function getLEven(int $num): int
{
return (2 + $num - ($num % 2));
}
/**
* Calculate the Least Odd
*
* @param int $num Number to process
*/
protected function getLOdd(int $num): int
{
return (1 + $num + ($num % 2));
}
/**
* Process X1
*/
protected function processX(): void
{
foreach ($this->ordarr as $key => $ord) {
$this->processXcase($key, $ord);
}
}
/**
* Process X1 case
*
* @param int $pos Original character position in the input string
* @param int $ord Char code
*
* @SuppressWarnings("PHPMD.CyclomaticComplexity")
*/
protected function processXcase(int $pos, int $ord): void
{
$edss = end($this->dss);
if ($edss === false) {
return;
}
switch ($ord) {
case UniConstant::RLE:
// X2
$this->setDss($this->getLOdd($edss['cel']), UniConstant::RLE, 'NI');
break;
case UniConstant::LRE:
// X3
$this->setDss($this->getLEven($edss['cel']), UniConstant::LRE, 'NI');
break;
case UniConstant::RLO:
// X4
$this->setDss($this->getLOdd($edss['cel']), UniConstant::RLO, 'R');
break;
case UniConstant::LRO:
// X5
$this->setDss($this->getLEven($edss['cel']), UniConstant::LRO, 'L');
break;
case UniConstant::RLI:
// X5a
$this->processChar($pos, $ord, $edss);
$this->setDss($this->getLOdd($edss['cel']), UniConstant::RLI, 'NI', true, true, 1);
break;
case UniConstant::LRI:
// X5b
$this->processChar($pos, $ord, $edss);
$this->setDss($this->getLEven($edss['cel']), UniConstant::LRI, 'NI', true, true, 1);
break;
case UniConstant::FSI:
// X5c
$this->processChar($pos, $ord, $edss);
$this->processFsiCase($pos, $edss);
break;
case UniConstant::PDI:
// X6a
$this->processPdiCase($pos, $ord, $edss);
break;
case UniConstant::PDF:
// X7
$this->processPdfCase($edss);
break;
default:
// X6
$this->processChar($pos, $ord, $edss);
break;
}
}
/**
* Set temporary data (X2 to X5)
*
* @param int $cel Embedding Level
* @param int $ord Char code
* @param string $dos Directional override status
* @param bool $dis Directional isolate status
* @param bool $isolate True if Isolate initiator
* @param int $ivic increment for the valid isolate count
*/
protected function setDss(
int $cel,
int $ord,
string $dos,
bool $dis = false,
bool $isolate = false,
int $ivic = 0
): void {
// X2 to X5
// - Compute the least odd|even embedding level greater than the embedding level of the last entry
// on the directional status stack.
// - If this new level would be valid, and the overflow isolate count and overflow embedding
// count are both zero, then this RLE is valid. Push an entry consisting of the new embedding
// level, neutral|left|right directional override status, and false directional isolate status onto the
// directional status stack.
// - Otherwise, this is an overflow RLE. If the overflow isolate count is zero, increment the
// overflow embedding|isolate count by one. Leave all other variables unchanged.
if (($cel >= self::MAX_DEPTH) || ($this->oic != 0) || ($this->oec != 0)) {
if ($isolate) {
++$this->oic;
} elseif ($this->oic == 0) {
++$this->oec;
}
return;
}
$this->vic += $ivic;
$this->dss[] = [
'ord' => $ord,
'cel' => $cel,
'dos' => $dos,
'dis' => $dis,
];
}
/**
* Push a char on the stack
*
* @param int $pos Original character position in the input string
* @param int $ord Char code
* @param DssData $edss Last entry in the Directional Status Stack
*/
protected function pushChar(int $pos, int $ord, array $edss): void
{
$unitype = (UniType::UNI[$ord] ?? $edss['dos']);
$this->chardata[] = [
'char' => $ord,
'i' => -1,
'level' => $edss['cel'],
'otype' => $unitype,
'pdimatch' => -1,
'pos' => $pos,
'type' => (($edss['dos'] !== 'NI') ? $edss['dos'] : $unitype),
'x' => -1,
];
}
/**
* Process normal char (X6)
*
* @param int $pos Original character position in the input string
* @param int $ord Char code
* @param DssData $edss Last entry in the Directional Status Stack
*/
protected function processChar(int $pos, int $ord, array $edss): void
{
// X6. For all types besides B, BN, RLE, LRE, RLO, LRO, PDF, RLI, LRI, FSI, and PDI:
// - Set the current character’s embedding level to the embedding level
// of the last entry on the directional status stack.
// - Whenever the directional override status of the last entry on the directional status stack
// is not neutral, reset the current character type according to the directional override
// status of the last entry on the directional status stack.
if (isset(UniType::UNI[$ord]) && ((UniType::UNI[$ord] == 'B') || (UniType::UNI[$ord] == 'BN'))) {
return;
}
$this->pushChar($pos, $ord, $edss);
}
/**
* Process the PDF type character
*
* @param DssData $edss Last entry in the Directional Status Stack
*/
protected function processPdfCase(array $edss): void
{
// X7. With each PDF, perform the following steps:
// - If the overflow isolate count is greater than zero, do nothing. (This PDF is within the
// scope of an overflow isolate initiator. It either matches and terminates the scope of an
// overflow embedding initiator within that overflow isolate, or does not match any
// embedding initiator.)
if ($this->oic > 0) {
return;
}
// - Otherwise, if the overflow embedding count is greater than zero, decrement it by one.
// (This PDF matches and terminates the scope of an overflow embedding initiator that is not
// within the scope of an overflow isolate initiator.)
if ($this->oec > 0) {
--$this->oec;
return;
}
// - Otherwise, if the directional isolate status of the last entry on the directional status
// stack is false, and the directional status stack contains at least two entries, pop the
// last entry from the directional status stack. (This PDF matches and terminates the scope
// of a valid embedding initiator. Since the stack has at least two entries, this pop does
// not leave the stack empty.)
if (($edss['dis'] === false) && (count($this->dss) > 1)) {
array_pop($this->dss);
}
// - Otherwise, do nothing. (This PDF does not match any embedding initiator.)
}
/**
* Process the PDI type character
*
* @param int $pos Original character position in the input string
* @param int $ord Char code
* @param DssData $edss Last entry in the Directional Status Stack
*/
protected function processPdiCase(int $pos, int $ord, array $edss): void
{
// X6a. With each PDI, perform the following steps:
// - If the overflow isolate count is greater than zero, this PDI matches an overflow isolate
// initiator. Decrement the overflow isolate count by one.
if ($this->oic > 0) {
--$this->oic;
return;
}
// - Otherwise, if the valid isolate count is zero, this PDI does not match any isolate
// initiator, valid or overflow. Do nothing.
if ($this->vic == 0) {
return;
}
// - Otherwise, this PDI matches a valid isolate initiator. Perform the following steps:
// - Reset the overflow embedding count to zero. (This terminates the scope of those overflow
// embedding initiators within the scope of the matched isolate initiator whose scopes have
// not been terminated by a matching PDF, and which thus lack a matching PDF.)
$this->oec = 0;
// - While the directional isolate status of the last entry on the stack is false, pop the
// last entry from the directional status stack. (This terminates the scope of those valid
// embedding initiators within the scope of the matched isolate initiator whose scopes have
// not been terminated by a matching PDF, and which thus lack a matching PDF. Given that the
// valid isolate count is non-zero, the directional status stack before this step is
// executed must contain an entry with directional isolate status true, and thus after this
// step is executed the last entry on the stack will indeed have a true directional isolate
// status, i.e. represent the scope of the matched isolate initiator. This cannot be the
// stack's first entry, which always belongs to the paragraph level and has a false
// directional status, so there is at least one more entry below it on the stack.)
$count_dss = count($this->dss);
while (($edss['dis'] === false) && ($count_dss > 1)) {
array_pop($this->dss);
--$count_dss;
$edss = end($this->dss);
if ($edss === false) {
break;
}
}
// - Pop the last entry from the directional status stack and decrement the valid isolate
// count by one. (This terminates the scope of the matched isolate initiator. Since the
// preceding step left the stack with at least two entries, this pop does not leave the
// stack empty.)
array_pop($this->dss);
--$this->vic;
$edss = end($this->dss);
if ($edss === false) {
return;
}
// - In all cases, look up the last entry on the directional status stack left after the
// steps above and:
// - Set the PDI’s level to the entry's embedding level.
// - If the entry's directional override status is not neutral, reset the current character type
// from PDI to L if the override status is left-to-right, and to R if the override status is
// right-to-left.
$this->pushChar($pos, $ord, $edss);
}
/**
* Process the PDF type character
*
* @param int $pos Original character position in the input string
* @param DssData $edss Last entry in the Directional Status Stack
*/
protected function processFsiCase(int $pos, array $edss): void
{
// X5c. With each FSI, apply rules P2 and P3 to the sequence of characters between the FSI and its
// matching PDI, or if there is no matching PDI, the end of the paragraph, as if this sequence
// of characters were a paragraph. If these rules decide on paragraph embedding level 1, treat
// the FSI as an RLI in rule X5a. Otherwise, treat it as an LRI in rule X5b.
$stepp = new StepP(array_slice($this->ordarr, $pos));
if ($stepp->getPel() == 0) {
$this->setDss($this->getLEven($edss['cel']), UniConstant::LRI, 'NI', true, true, 1);
} else {
$this->setDss($this->getLOdd($edss['cel']), UniConstant::RLI, 'NI', true, true, 1);
}
}
}

236
vendor/tecnickcom/tc-lib-unicode/src/Bidi/StepXten.php vendored Normal file
View File

@@ -0,0 +1,236 @@
<?php
/**
* StepXten.php
*
* @since 2011-05-23
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*
* This file is part of tc-lib-unicode software library.
*/
namespace Com\Tecnick\Unicode\Bidi;
use Com\Tecnick\Unicode\Data\Constant as UniConstant;
/**
* Com\Tecnick\Unicode\Bidi\StepXten
*
* @since 2015-07-13
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*
* @phpstan-import-type SeqData from \Com\Tecnick\Unicode\Bidi\Shaping\Arabic
* @phpstan-import-type CharData from \Com\Tecnick\Unicode\Bidi\Shaping\Arabic
*/
class StepXten
{
/**
* Number of characters
*/
protected int $numchars;
/**
* Array of Level Run sequences
*
* @var array<int, array{'start': int, 'end': int, 'e': int}>
*/
protected array $runseq = [];
/**
* Number of Level Run sequences
*/
protected int $numrunseq = 0;
/**
* Array of Isolated Level Run sequences
*
* @var array<int, SeqData>
*/
protected array $ilrs = [];
/**
* X Steps for Bidirectional algorithm
*
* @param array<int, CharData> $chardata Array of UTF-8 codepoints
* @param int $pel Paragraph Embedding Level
*/
public function __construct(
/**
* Array of characters data to return
*/
protected array $chardata,
/**
* Paragraph Embedding Level
*/
protected int $pel
) {
$this->numchars = count($chardata);
$this->setIsolatedLevelRunSequences();
}
/**
* Get the Isolated Run Sequences
*
* @return array<int, SeqData>
*/
public function getIsolatedLevelRunSequences(): array
{
return $this->ilrs;
}
/**
* Get the embedded direction (L or R)
*/
protected function getEmbeddedDirection(int $level): string
{
return ((($level % 2) == 0) ? 'L' : 'R');
}
protected function setLevelRunSequences(): void
{
$start = 0;
while ($start < $this->numchars) {
$end = ($start + 1);
while (($end < $this->numchars) && ($this->chardata[$end]['level'] == $this->chardata[$start]['level'])) {
++$end;
}
--$end;
$this->runseq[] = [
'start' => $start,
'end' => $end,
'e' => $this->chardata[$start]['level'],
];
++$this->numrunseq;
$start = ($end + 1);
}
}
/**
* returns true if the input char is an Isolate Initiator
*/
protected function isIsolateInitiator(int $ord): bool
{
return (($ord == UniConstant::RLI) || ($ord == UniConstant::LRI) || ($ord == UniConstant::FSI));
}
/**
* Set level Isolated Level Run Sequences
*/
protected function setIsolatedLevelRunSequences(): void
{
$this->setLevelRunSequences();
$numiso = 0;
foreach ($this->runseq as $idx => $seq) {
// Create a new level run sequence, and initialize it to contain just that level run
$isorun = [
'e' => $seq['e'],
'edir' => $this->getEmbeddedDirection($seq['e']), // embedded direction
'start' => $seq['start'], // position of the first char
'end' => $seq['end'], // position of the last char
'length' => ($seq['end'] - $seq['start'] + 1),
'sos' => '', // start-of-sequence
'eos' => '', // end-of-sequence
'maxlevel' => 0,
'item' => [],
];
for ($jdx = 0; $jdx < $isorun['length']; ++$jdx) {
$isorun['item'][$jdx] = $this->chardata[($seq['start'] + $jdx)];
}
$endchar = $isorun['item'][($jdx - 1)]['char'];
// While the level run currently last in the sequence ends with an isolate initiator that has a
// matching PDI, append the level run containing the matching PDI to the sequence.
// (Note that this matching PDI must be the first character of its level run.)
$pdimatch = -1;
if ($this->isIsolateInitiator($endchar)) {
// find the next sequence with the same level that starts with a PDI
for ($kdx = ($idx + 1); $kdx < $this->numrunseq; ++$kdx) {
if (
($this->runseq[$kdx]['e'] == $isorun['e'])
&& ($this->chardata[$this->runseq[$kdx]['start']]['char'] == UniConstant::PDI)
) {
$pdimatch = $this->runseq[$kdx]['start'];
$this->chardata[$pdimatch]['pdimatch'] = $numiso;
break;
}
}
}
// For each level run in the paragraph whose first character is not a PDI,
// or is a PDI that does not match any isolate initiator
if ($this->chardata[$seq['start']]['pdimatch'] >= 0) {
$parent = $this->chardata[$seq['start']]['pdimatch'];
$this->ilrs[$parent]['item'] = array_merge(
$this->ilrs[$parent]['item'],
$isorun['item']
);
$this->ilrs[$parent]['length'] += $isorun['length'];
$this->ilrs[$parent]['end'] += $isorun['end'];
if ($pdimatch >= 0) {
$this->chardata[$pdimatch]['pdimatch'] = $parent;
}
} else {
$this->ilrs[$numiso] = $isorun;
++$numiso;
}
}
$this->setStartEndOfSequence();
}
/**
* Determine the start-of-sequence (sos) and end-of-sequence (eos) types, either L or R,
* for each isolating run sequence.
*/
protected function setStartEndOfSequence(): void
{
foreach ($this->ilrs as $key => $seq) {
// For sos, compare the level of the first character in the sequence with the level of the character
// preceding it in the paragraph (not counting characters removed by X9), and if there is none,
// with the paragraph embedding level.
$lev = $seq['item'][0]['level'];
if ($seq['start'] == 0) {
$prev = $this->pel;
} else {
$lastchr = $this->chardata[($seq['start'] - 1)];
$prev = $lastchr['level'];
}
$this->ilrs[$key]['sos'] = $this->getEmbeddedDirection(max($prev, $lev));
// For eos, compare the level of the last character in the sequence with the level of the character
// following it in the paragraph (not counting characters removed by X9), and if there is none or the
// last character of the sequence is an isolate initiator (lacking a matching PDI), with the paragraph
// embedding level.
$lastchr = end($seq['item']);
if ($lastchr === false) {
return;
}
$lev = $lastchr['level'];
if ((! isset($this->chardata[($seq['end'] + 1)]['level'])) || $this->isIsolateInitiator($lastchr['char'])) {
$next = $this->pel;
} else {
$next = $this->chardata[($seq['end'] + 1)]['level'];
}
$this->ilrs[$key]['eos'] = $this->getEmbeddedDirection(max($next, $lev));
// If the higher level is odd, the sos or eos is R; otherwise, it is L.
}
}
}

131
vendor/tecnickcom/tc-lib-unicode/src/Convert.php vendored Normal file
View File

@@ -0,0 +1,131 @@
<?php
/**
* Convert.php
*
* @since 2011-05-23
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*
* This file is part of tc-lib-unicode software library.
*/
namespace Com\Tecnick\Unicode;
use Com\Tecnick\Unicode\Exception as UniException;
/**
* Com\Tecnick\Unicode\Convert
*
* @since 2015-07-13
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*/
class Convert extends \Com\Tecnick\Unicode\Convert\Encoding
{
/**
* Returns the unicode string containing the character specified by value
*
* @param int $ord Unicode character value to convert
*
* @return string Returns the unicode string
*/
public function chr(int $ord): string
{
return mb_convert_encoding(pack('N', $ord), 'UTF-8', 'UCS-4BE');
}
/**
* Returns the unicode value of the specified character
*
* @param string $chr Unicode character
*
* @return int Returns the unicode value
*/
public function ord(string $chr): int
{
$uni = unpack('N', mb_convert_encoding($chr, 'UCS-4BE', 'UTF-8'));
if (($uni === false) || (!isset($uni[1])) || (!is_int($uni[1]))) {
throw new UniException('Error converting string');
}
return $uni[1];
}
/**
* Converts an UTF-8 string to an array of UTF-8 codepoints (integer values)
*
* @param string $str String to convert
*
* @return array<int, string>
*/
public function strToChrArr(string $str): array
{
$ret = preg_split('//u', $str, -1, PREG_SPLIT_NO_EMPTY);
if ($ret === false) {
throw new UniException('Error splitting string');
}
return $ret;
}
/**
* Converts an array of UTF-8 chars to an array of codepoints (integer values)
*
* @param array<string> $chars Array of UTF-8 chars
*
* @return array<int>
*/
public function chrArrToOrdArr(array $chars): array
{
return array_map(fn (string $chr): int => $this->ord($chr), $chars);
}
/**
* Converts an array of UTF-8 code points array of chars
*
* @param array<int> $ords Array of UTF-8 code points
*
* @return array<string>
*/
public function ordArrToChrArr(array $ords): array
{
return array_map(fn (int $ord): string => $this->chr($ord), $ords);
}
/**
* Converts an UTF-8 string to an array of UTF-8 codepoints (integer values)
*
* @param string $str Convert to convert
*
* @return array<int>
*/
public function strToOrdArr(string $str): array
{
return $this->chrArrToOrdArr($this->strToChrArr($str));
}
/**
* Extract a slice of the $uniarr array and return it as string
*
* @param array<string> $uniarr The input array of characters
* @param int $start The position of the starting element
* @param int|null $end The position of the first element that will not be returned.
*/
public function getSubUniArrStr(array $uniarr, int $start = 0, ?int $end = null): string
{
if ($end === null) {
$end = count($uniarr);
}
return implode('', array_slice($uniarr, $start, ($end - $start)));
}
}

136
vendor/tecnickcom/tc-lib-unicode/src/Convert/Encoding.php vendored Normal file
View File

@@ -0,0 +1,136 @@
<?php
/**
* Encoding.php
*
* @since 2011-05-23
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*
* This file is part of tc-lib-unicode software library.
*/
namespace Com\Tecnick\Unicode\Convert;
use Com\Tecnick\Unicode\Data\Latin as Latin;
/**
* Com\Tecnick\Unicode\Convert\Encoding
*
* @since 2015-07-13
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*/
class Encoding
{
/**
* Converts UTF-8 code array to Latin1 codes
*
* @param array<int> $ordarr Array containing UTF-8 code points
*
* @return array<int> Array containing Latin1 code points
*/
public function uniArrToLatinArr(array $ordarr): array
{
$latarr = [];
foreach ($ordarr as $chr) {
if ($chr < 256) {
$latarr[] = $chr;
} elseif (array_key_exists($chr, Latin::SUBSTITUTE)) {
$latarr[] = Latin::SUBSTITUTE[$chr];
} elseif ($chr !== 0xFFFD) {
$latarr[] = 63; // '?' character
}
}
return $latarr;
}
/**
* Converts an array of Latin1 code points to a string
*
* @param array<int> $latarr Array of Latin1 code points
*/
public function latinArrToStr(array $latarr): string
{
return implode('', array_map('chr', $latarr));
}
/**
* Convert a string to an hexadecimal string (byte string) representation (as in the PDF standard)
*
* @param string $str String to convert
*/
public function strToHex(string $str): string
{
$hexstr = '';
$len = strlen($str);
for ($idx = 0; $idx < $len; ++$idx) {
$hexstr .= sprintf('%02s', dechex(ord($str[$idx])));
}
return $hexstr;
}
/**
* Convert an hexadecimal string (byte string - as in the PDF standard) to string
*
* @param string $hex Hex code to convert
*/
public function hexToStr(string $hex): string
{
if (strlen($hex) == 0) {
return '';
}
$str = '';
$bytes = str_split($hex, 2);
foreach ($bytes as $byte) {
$str .= chr((int) hexdec($byte));
}
return $str;
}
/**
* Converts a string with an unknown encoding to UTF-8
*
* @param string $str String to convert
* @param null|string|array<string> $enc Array or comma separated list string of encodings
*
* @return string UTF-8 encoded string
*/
public function toUTF8(string $str, null|string|array $enc = null): string
{
if ($enc === null) {
$enc = (array) mb_detect_order();
}
$chrenc = mb_detect_encoding($str, $enc);
if ($chrenc === false) {
$chrenc = null;
}
return mb_convert_encoding($str, 'UTF-8', $chrenc);
}
/**
* Converts an UTF-8 string to UTF-16BE
*
* @param string $str UTF-8 String to convert
*
* @return string UTF-16BE encoded string
*/
public function toUTF16BE(string $str): string
{
return mb_convert_encoding($str, 'UTF-16BE', 'UTF-8');
}
}

34
vendor/tecnickcom/tc-lib-unicode/src/Exception.php vendored Normal file
View File

@@ -0,0 +1,34 @@
<?php
/**
* Exception.php
*
* @since 2015-07-28
* @category Library
* @package File
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2015-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-file
*
* This file is part of tc-lib-unicode software library.
*/
namespace Com\Tecnick\Unicode;
/**
* Com\Tecnick\Unicode\Exception
*
* Custom Exception class
*
* @since 2015-07-28
* @category Library
* @package File
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2015-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-file
*/
class Exception extends \Exception
{
}

306
vendor/tecnickcom/tc-lib-unicode/test/Bidi/StepITest.php vendored Normal file
View File

@@ -0,0 +1,306 @@
<?php
/**
* StepITest.php
*
* @since 2011-05-23
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*
* This file is part of tc-lib-unicode software library.
*/
namespace Test\Bidi;
use Com\Tecnick\Unicode\Bidi\StepI;
use PHPUnit\Framework\TestCase;
use PHPUnit\Framework\Attributes\DataProvider;
/**
* Bidi Test
*
* @since 2011-05-23
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*/
class StepITest extends TestCase
{
/**
* @param array{
* 'e': int,
* 'edir': string,
* 'end': int,
* 'eos': string,
* 'length': int,
* 'maxlevel': int,
* 'sos': string,
* 'start': int,
* 'item': array<int, array{
* 'char': int,
* 'i': int,
* 'level': int,
* 'otype': string,
* 'pdimatch': int,
* 'pos': int,
* 'type': string,
* 'x': int,
* }>,
* } $seq Isolated Sequence array
*
* @param mixed $expected Expected result
*/
#[DataProvider('stepIDataProvider')]
public function testStepI(array $seq, mixed $expected): void
{
$stepi = new StepI($seq);
$this->assertEquals($expected, $stepi->getSequence());
}
/**
* @return array<int, array<int, array{
* 'e': int,
* 'edir': string,
* 'end': int,
* 'eos': string,
* 'length': int,
* 'maxlevel': int,
* 'sos': string,
* 'start': int,
* 'item': array<int, array{
* 'char': int,
* 'i': int,
* 'level': int,
* 'otype': string,
* 'pdimatch': int,
* 'pos': int,
* 'type': string,
* 'x': int,
* }>,
* }>>
*/
public static function stepIDataProvider(): array
{
return [
[
[
'e' => 0,
'edir' => 'L',
'end' => 3,
'eos' => 'L',
'length' => 4,
'maxlevel' => 0,
'sos' => 'L',
'start' => 0,
'item' => [
[
'char' => 65,
'i' => -1,
'level' => 0,
'otype' => 'L',
'pos' => 0,
'pdimatch' => -1,
'type' => 'L',
'x' => 0,
],
[
'char' => 8207,
'i' => -1,
'level' => 0,
'otype' => 'R',
'pos' => 1,
'pdimatch' => -1,
'type' => 'R',
'x' => 0,
],
[
'char' => 1632,
'i' => -1,
'level' => 0,
'otype' => 'AN',
'pos' => 2,
'pdimatch' => -1,
'type' => 'AN',
'x' => 0,
],
[
'char' => 1776,
'i' => -1,
'level' => 0,
'otype' => 'EN',
'pos' => 3,
'pdimatch' => -1,
'type' => 'EN',
'x' => 0,
],
],
],
[
'e' => 0,
'edir' => 'L',
'end' => 3,
'eos' => 'L',
'length' => 4,
'maxlevel' => 2,
'sos' => 'L',
'start' => 0,
'item' => [
[
'char' => 65,
'i' => -1,
'level' => 0,
'otype' => 'L',
'pos' => 0,
'pdimatch' => -1,
'type' => 'L',
'x' => 0,
],
[
'char' => 8207,
'i' => -1,
'level' => 1,
'otype' => 'R',
'pos' => 1,
'pdimatch' => -1,
'type' => 'R',
'x' => 0,
],
[
'char' => 1632,
'i' => -1,
'level' => 2,
'otype' => 'AN',
'pos' => 2,
'pdimatch' => -1,
'type' => 'AN',
'x' => 0,
],
[
'char' => 1776,
'i' => -1,
'level' => 2,
'otype' => 'EN',
'pos' => 3,
'pdimatch' => -1,
'type' => 'EN',
'x' => 0,
],
],
],
],
[
[
'e' => 1,
'edir' => 'R',
'end' => 3,
'eos' => 'R',
'length' => 4,
'maxlevel' => 0,
'sos' => 'R',
'start' => 0,
'item' => [
[
'char' => 65,
'i' => -1,
'level' => 1,
'otype' => 'L',
'pos' => 0,
'pdimatch' => -1,
'type' => 'L',
'x' => 0,
],
[
'char' => 8207,
'i' => -1,
'level' => 1,
'otype' => 'R',
'pos' => 1,
'pdimatch' => -1,
'type' => 'R',
'x' => 0,
],
[
'char' => 1632,
'i' => -1,
'level' => 1,
'otype' => 'AN',
'pos' => 2,
'pdimatch' => -1,
'type' => 'AN',
'x' => 0,
],
[
'char' => 1776,
'i' => -1,
'level' => 1,
'otype' => 'EN',
'pos' => 3,
'pdimatch' => -1,
'type' => 'EN',
'x' => 0,
],
],
],
[
'e' => 1,
'edir' => 'R',
'end' => 3,
'eos' => 'R',
'length' => 4,
'maxlevel' => 2,
'sos' => 'R',
'start' => 0,
'item' => [
[
'char' => 65,
'i' => -1,
'level' => 2,
'otype' => 'L',
'pos' => 0,
'pdimatch' => -1,
'type' => 'L',
'x' => 0,
],
[
'char' => 8207,
'i' => -1,
'level' => 1,
'otype' => 'R',
'pos' => 1,
'pdimatch' => -1,
'type' => 'R',
'x' => 0,
],
[
'char' => 1632,
'i' => -1,
'level' => 2,
'otype' => 'AN',
'pos' => 2,
'pdimatch' => -1,
'type' => 'AN',
'x' => 0,
],
[
'char' => 1776,
'i' => -1,
'level' => 2,
'otype' => 'EN',
'pos' => 3,
'pdimatch' => -1,
'type' => 'EN',
'x' => 0,
],
],
],
],
];
}
}

2758
vendor/tecnickcom/tc-lib-unicode/test/Bidi/StepLTest.php vendored Normal file
View File

File diff suppressed because it is too large Load Diff

3235
vendor/tecnickcom/tc-lib-unicode/test/Bidi/StepNTest.php vendored Normal file
View File

File diff suppressed because it is too large Load Diff

2790
vendor/tecnickcom/tc-lib-unicode/test/Bidi/StepWTest.php vendored Normal file
View File

File diff suppressed because it is too large Load Diff

869
vendor/tecnickcom/tc-lib-unicode/test/Bidi/StepXTest.php vendored Normal file
View File

@@ -0,0 +1,869 @@
<?php
/**
* StepXTest.php
*
* @since 2011-05-23
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*
* This file is part of tc-lib-unicode software library.
*/
namespace Test\Bidi;
use Com\Tecnick\Unicode\Bidi\StepX;
use PHPUnit\Framework\TestCase;
use PHPUnit\Framework\Attributes\DataProvider;
/**
* Bidi Test
*
* @since 2011-05-23
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*/
class StepXTest extends TestCase
{
/**
* @param array<int> $ordarr Array of character codes
*/
#[DataProvider('stepXDataProvider')]
public function testStepX(array $ordarr, int $pel, mixed $expected): void
{
$stepx = new StepX($ordarr, $pel);
$this->assertEquals($expected, $stepx->getChrData());
}
/**
* @return array<int, array{
* 0: array<int>,
* 1: int,
* 2: array<int, array{
* 'char': int,
* 'i': int,
* 'level': int,
* 'otype': string,
* 'pdimatch': int,
* 'pos': int,
* 'type': string,
* 'x': int,
* }>,
* }>
*/
public static function stepXDataProvider(): array
{
return [
[
// BD13 Example 1: text1·RLE·text2·PDF·RLE·text3·PDF·text4
[33, 8235, 34, 8236, 8235, 38, 8236, 39],
0,
[
[
'x' => -1,
'pos' => 0,
'char' => 33,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 2,
'char' => 34,
'i' => -1,
'level' => 1,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 5,
'char' => 38,
'i' => -1,
'level' => 1,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 7,
'char' => 39,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
],
],
[
// BD13 Example 2: text1·RLI·text2·PDI·RLI·text3·PDI·text4
[33, 8295, 34, 8297, 8295, 38, 8297, 39],
0,
[
[
'x' => -1,
'pos' => 0,
'char' => 33,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 1,
'char' => 8295,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'NI',
'otype' => 'NI',
],
[
'x' => -1,
'pos' => 2,
'char' => 34,
'i' => -1,
'level' => 1,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 3,
'char' => 8297,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'NI',
'otype' => 'NI',
],
[
'x' => -1,
'pos' => 4,
'char' => 8295,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'NI',
'otype' => 'NI',
],
[
'x' => -1,
'pos' => 5,
'char' => 38,
'i' => -1,
'level' => 1,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 6,
'char' => 8297,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'NI',
'otype' => 'NI',
],
[
'x' => -1,
'pos' => 7,
'char' => 39,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
],
],
[
// BD13 Example 3: text1·RLI·text2·LRI·text3·RLE·text4·PDF·text5·PDI·text6·PDI·text7
[33, 8295, 34, 8294, 38, 8235, 39, 8236, 40, 8297, 41, 8297, 42],
0,
[
[
'x' => -1,
'pos' => 0,
'char' => 33,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 1,
'char' => 8295,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'NI',
'otype' => 'NI',
],
[
'x' => -1,
'pos' => 2,
'char' => 34,
'i' => -1,
'level' => 1,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 3,
'char' => 8294,
'i' => -1,
'level' => 1,
'pdimatch' => -1,
'type' => 'NI',
'otype' => 'NI',
],
[
'x' => -1,
'pos' => 4,
'char' => 38,
'i' => -1,
'level' => 2,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 6,
'char' => 39,
'i' => -1,
'level' => 3,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 8,
'char' => 40,
'i' => -1,
'level' => 2,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 9,
'char' => 8297,
'i' => -1,
'level' => 1,
'pdimatch' => -1,
'type' => 'NI',
'otype' => 'NI',
],
[
'x' => -1,
'pos' => 10,
'char' => 41,
'i' => -1,
'level' => 1,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 11,
'char' => 8297,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'NI',
'otype' => 'NI',
],
[
'x' => -1,
'pos' => 12,
'char' => 42,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
],
],
[
// X10 Example 1: text1·RLE·text2·LRE·text3·PDF·text4·PDF·RLE·text5·PDF·text6
[33, 8235, 34, 8234, 38, 8236, 39, 8236, 8235, 40, 8236, 41],
0,
[
[
'x' => -1,
'pos' => 0,
'char' => 33,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 2,
'char' => 34,
'i' => -1,
'level' => 1,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 4,
'char' => 38,
'i' => -1,
'level' => 2,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 6,
'char' => 39,
'i' => -1,
'level' => 1,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 9,
'char' => 40,
'i' => -1,
'level' => 1,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 11,
'char' => 41,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
],
],
[
// X10 Example 2: text1·RLI·text2·LRI·text3·PDI·text4·PDI·RLI·text5·PDI·text6
[33, 8295, 34, 8294, 38, 8297, 39, 8297, 8295, 40, 8297, 41],
0,
[
[
'x' => -1,
'pos' => 0,
'char' => 33,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 1,
'char' => 8295,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'NI',
'otype' => 'NI',
],
[
'x' => -1,
'pos' => 2,
'char' => 34,
'i' => -1,
'level' => 1,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 3,
'char' => 8294,
'i' => -1,
'level' => 1,
'pdimatch' => -1,
'type' => 'NI',
'otype' => 'NI',
],
[
'x' => -1,
'pos' => 4,
'char' => 38,
'i' => -1,
'level' => 2,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 5,
'char' => 8297,
'i' => -1,
'level' => 1,
'pdimatch' => -1,
'type' => 'NI',
'otype' => 'NI',
],
[
'x' => -1,
'pos' => 6,
'char' => 39,
'i' => -1,
'level' => 1,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 7,
'char' => 8297,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'NI',
'otype' => 'NI',
],
[
'x' => -1,
'pos' => 8,
'char' => 8295,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'NI',
'otype' => 'NI',
],
[
'x' => -1,
'pos' => 9,
'char' => 40,
'i' => -1,
'level' => 1,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 10,
'char' => 8297,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'NI',
'otype' => 'NI',
],
[
'x' => -1,
'pos' => 11,
'char' => 41,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
],
],
[
// X10 Example 3: text1·RLE·text2·LRI·text3·RLE·text4·PDI·text5·PDF·text6
[33, 8235, 34, 8294, 38, 8235, 39, 8297, 40, 8236, 41],
0,
[
[
'x' => -1,
'pos' => 0,
'char' => 33,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 2,
'char' => 34,
'i' => -1,
'level' => 1,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 3,
'char' => 8294,
'i' => -1,
'level' => 1,
'pdimatch' => -1,
'type' => 'NI',
'otype' => 'NI',
],
[
'x' => -1,
'pos' => 4,
'char' => 38,
'i' => -1,
'level' => 2,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 6,
'char' => 39,
'i' => -1,
'level' => 3,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 7,
'char' => 8297,
'i' => -1,
'level' => 1,
'pdimatch' => -1,
'type' => 'NI',
'otype' => 'NI',
],
[
'x' => -1,
'pos' => 8,
'char' => 40,
'i' => -1,
'level' => 1,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 10,
'char' => 41,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
],
],
[
// text1·RLO·text2·LRO·text3·RLO·text4·PDF·text5·PDF·text6
[33, 8238, 34, 8237, 38, 8238, 39, 8236, 40, 8236, 41],
0,
[
[
'x' => -1,
'pos' => 0,
'char' => 33,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 2,
'char' => 34,
'i' => -1,
'level' => 1,
'pdimatch' => -1,
'type' => 'R',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 4,
'char' => 38,
'i' => -1,
'level' => 2,
'pdimatch' => -1,
'type' => 'L',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 6,
'char' => 39,
'i' => -1,
'level' => 3,
'pdimatch' => -1,
'type' => 'R',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 8,
'char' => 40,
'i' => -1,
'level' => 2,
'pdimatch' => -1,
'type' => 'L',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 10,
'char' => 41,
'i' => -1,
'level' => 1,
'pdimatch' => -1,
'type' => 'R',
'otype' => 'ON',
],
],
],
[
// text1·FSI·text2·PDI·text3
[33, 8296, 34, 8297, 38],
0,
[
[
'x' => -1,
'pos' => 0,
'char' => 33,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 1,
'char' => 8296,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'NI',
'otype' => 'NI',
],
[
'x' => -1,
'pos' => 2,
'char' => 34,
'i' => -1,
'level' => 2,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 3,
'char' => 8297,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'NI',
'otype' => 'NI',
],
[
'x' => -1,
'pos' => 4,
'char' => 38,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
],
],
[
// text1·FSI·text2·PDI·text3
[1488, 8296, 1489, 8297, 1490],
1,
[
[
'x' => -1,
'pos' => 0,
'char' => 1488,
'i' => -1,
'level' => 1,
'pdimatch' => -1,
'type' => 'R',
'otype' => 'R',
],
[
'x' => -1,
'pos' => 1,
'char' => 8296,
'i' => -1,
'level' => 1,
'pdimatch' => -1,
'type' => 'NI',
'otype' => 'NI',
],
[
'x' => -1,
'pos' => 2,
'char' => 1489,
'i' => -1,
'level' => 3,
'pdimatch' => -1,
'type' => 'R',
'otype' => 'R',
],
[
'x' => -1,
'pos' => 3,
'char' => 8297,
'i' => -1,
'level' => 1,
'pdimatch' => -1,
'type' => 'NI',
'otype' => 'NI',
],
[
'x' => -1,
'pos' => 4,
'char' => 1490,
'i' => -1,
'level' => 1,
'pdimatch' => -1,
'type' => 'R',
'otype' => 'R',
],
],
],
[
// text1·BN·text2·BN·text3
[33, 1807, 34, 1807, 38],
0,
[
[
'x' => -1,
'pos' => 0,
'char' => 33,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 2,
'char' => 34,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 4,
'char' => 38,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
],
],
[
// Test overflow: text1·130xLRE·LRI·PDF·PDI·PDF·PDI·text2
[
33, 8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234,
8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234,
8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234,
8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234,
8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234,
8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234,
8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234,
8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234,
8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234,
8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234,
8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234,
8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234, 8234,
8234, 8294, 8236, 8297, 8236, 8297, 34,
],
0,
[
[
'x' => -1,
'pos' => 0,
'char' => 33,
'i' => -1,
'level' => 0,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
[
'x' => -1,
'pos' => 121,
'char' => 8294,
'i' => -1,
'level' => 124,
'pdimatch' => -1,
'type' => 'NI',
'otype' => 'NI',
],
[
'x' => -1,
'pos' => 126,
'char' => 34,
'i' => -1,
'level' => 124,
'pdimatch' => -1,
'type' => 'ON',
'otype' => 'ON',
],
],
],
];
}
}

1417
vendor/tecnickcom/tc-lib-unicode/test/Bidi/StepXtenTest.php vendored Normal file
View File

File diff suppressed because it is too large Load Diff

181
vendor/tecnickcom/tc-lib-unicode/test/BidiTest.php vendored Normal file
View File

@@ -0,0 +1,181 @@
<?php
/**
* BidiTest.php
*
* @since 2011-05-23
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*
* This file is part of tc-lib-unicode software library.
*/
namespace Test;
use Com\Tecnick\Unicode\Bidi;
use PHPUnit\Framework\Attributes\DataProvider;
/**
* Bidi Test
*
* @since 2011-05-23
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*/
class BidiTest extends TestUtil
{
public function testException(): void
{
$this->bcExpectException('\\' . \Com\Tecnick\Unicode\Exception::class);
new \Com\Tecnick\Unicode\Bidi();
}
/**
* @param ?string $str String to convert (if null it will be generated from $chrarr or $ordarr)
* @param ?array<string> $chrarr Array of UTF-8 chars (if empty it will be generated from $str or $ordarr)
* @param ?array<int> $ordarr Array of UTF-8 codepoints (if empty it will be generated from $str or $chrarr)
* @param string $forcedir If 'R' forces RTL, if 'L' forces LTR
* @param bool $shaping If true enable the shaping algorithm
*/
#[DataProvider('inputDataProvider')]
public function testStr(
?string $str = null,
?array $chrarr = null,
?array $ordarr = null,
string $forcedir = '',
bool $shaping = true
): void {
$bidi = new Bidi($str, $chrarr, $ordarr, $forcedir, $shaping);
$this->assertEquals('test', $bidi->getString());
$this->assertEquals(['t', 'e', 's', 't'], $bidi->getChrArray());
$this->assertEquals([116, 101, 115, 116], $bidi->getOrdArray());
$this->assertEquals([
116 => true,
101 => true,
115 => true,
], $bidi->getCharKeys());
$this->assertEquals(4, $bidi->getNumChars());
}
/**
* @return array<int, array{?string, ?array<string>, ?array<int>, string, bool}>
*/
public static function inputDataProvider(): array
{
return [
['test', null, null, '', true],
[null, ['t', 'e', 's', 't'], null, '', true],
[null, null, [116, 101, 115, 116], '', true],
['test', ['t', 'e', 's', 't'], null, '', true],
['test', null, [116, 101, 115, 116], '', true],
[null, ['t', 'e', 's', 't'], [116, 101, 115, 116], '', true],
['test', ['t', 'e', 's', 't'], [116, 101, 115, 116], '', true],
['test', null, null, 'L', true],
['test', null, null, 'R', true],
];
}
#[DataProvider('bidiStrDataProvider')]
public function testBidiStr(string $str, mixed $expected, string $forcedir = ''): void
{
$bidi = new Bidi($str, null, null, $forcedir, true);
$this->assertEquals($expected, $bidi->getString());
}
/**
* @return array<int, array{string, string, string}>
*/
public static function bidiStrDataProvider(): array
{
return [
[
"\n\nABC\nEFG\n\nHIJ\n\n",
"\n\nABC\nEFG\n\nHIJ\n\n",
'L',
],
[
json_decode('"\u202EABC\u202C"'),
'CBA',
'',
],
[
'left to right',
'right to left',
'R',
],
[
'left to right ',
' right to left',
'R',
],
[
json_decode('"smith (fabrikam \u0600\u0601\u0602) \u05de\u05d6\u05dc"'),
json_decode('"\u05dc\u05d6\u05de (\u0602\u0601\u0600 fabrikam) smith"'),
'R',
],
[
json_decode('"\u0600\u0601\u0602 book(s)"'),
json_decode('"book(s) \u0602\u0601\u0600"'),
'R',
],
[
json_decode('"\u0600\u0601(\u0602\u0603[&ef]!)gh"'),
json_decode('"gh(![ef&]\u0603\u0602)\u0601\u0600"'),
'R',
],
[
'تشكيل اختبار',
'ﺭﺎﺒﺘﺧﺍ ﻞﻴﻜﺸﺗ',
'',
],
[
json_decode('"\u05de\u05d6\u05dc \u05d8\u05d5\u05d1"'),
json_decode('"\u05d1\u05d5\u05d8 \u05dc\u05d6\u05de"'),
'',
],
[
json_decode(
'"\u0644\u0644\u0647 \u0600\u0601\u0602 \uFB50'
. ' \u0651\u064c\u0651\u064d\u0651\u064e\u0651\u064f\u0651\u0650'
. ' \u0644\u0622"'
),
json_decode('"\ufef5\ufedf \ufc62\ufc61\ufc60\ufc5f\ufc5e \ufb50 \u0602\u0601\u0600 \ufdf2"'),
'',
],
[
json_decode('"A\u2067\u05d8\u2069B"'),
json_decode('"A\u2067\u05d8\u2069B"'),
'',
],
[
// RLI + PDI
json_decode(
'"The words \"\u2067\u05de\u05d6\u05dc [mazel] \u05d8\u05d5\u05d1 [tov]\u2069\"'
. ' mean \"Congratulations!\""'
),
'The words "⁧[tov] בוט [mazel] לזמ⁩" mean "Congratulations!"',
'',
],
[
// RLE + PDF
json_decode('"it is called \"\u202bAN INTRODUCTION TO java\u202c\" - $19.95 in hardcover."'),
'it is called "java TO INTRODUCTION AN" - $19.95 in hardcover.',
'',
],
[
// RLI + PDI
json_decode('"it is called \"\u2067AN INTRODUCTION TO java\u2069\" - $19.95 in hardcover."'),
'it is called "⁧java TO INTRODUCTION AN⁩" - $19.95 in hardcover.',
'',
],
];
}
}

207
vendor/tecnickcom/tc-lib-unicode/test/ConvertTest.php vendored Normal file
View File

@@ -0,0 +1,207 @@
<?php
/**
* ConvertTest.php
*
* @since 2011-05-23
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*
* This file is part of tc-lib-unicode software library.
*/
namespace Test;
use Com\Tecnick\Unicode\Data\Latin;
use PHPUnit\Framework\TestCase;
use PHPUnit\Framework\Attributes\DataProvider;
/**
* Convert Test
*
* @since 2011-05-23
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2011-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*/
class ConvertTest extends TestCase
{
protected function getTestObject(): \Com\Tecnick\Unicode\Convert
{
return new \Com\Tecnick\Unicode\Convert();
}
#[DataProvider('chrDataProvider')]
public function testChr(int $ord, mixed $expected): void
{
$convert = $this->getTestObject();
$chr = $convert->chr($ord);
$this->assertEquals($expected, $chr);
}
#[DataProvider('chrDataProvider')]
public function testOrd(mixed $expected, string $chr): void
{
$convert = $this->getTestObject();
$ord = $convert->ord($chr);
$this->assertEquals($expected, $ord);
}
/**
* @return array<int, array{0:int,1:string}>
*/
public static function chrDataProvider(): array
{
return [
[32, ' '],
[48, '0'],
[65, 'A'],
[182, '¶'],
[255, 'ÿ'],
[256, 'Ā'],
[544, 'Ƞ'],
[916, 'Δ'],
[1488, 'א'],
[21488, '台'],
[49436, '서'],
[70039, '𑆗'],
[195101, '𪘀'],
];
}
public function testStrToChrArr(): void
{
$convert = $this->getTestObject();
$res = $convert->strToChrArr('0A¶ÿĀȠΔא台서');
$this->assertEquals(['0', 'A', '¶', 'ÿ', 'Ā', 'Ƞ', 'Δ', 'א', '台', '서'], $res);
}
public function testChrArrToOrdArr(): void
{
$convert = $this->getTestObject();
$res = $convert->chrArrToOrdArr(['0', 'A', '¶', 'ÿ', 'Ā', 'Ƞ', 'Δ', 'א', '台', '서']);
$this->assertEquals([48, 65, 182, 255, 256, 544, 916, 1488, 21488, 49436], $res);
}
public function testOrdArrToChrArr(): void
{
$convert = $this->getTestObject();
$res = $convert->ordArrToChrArr([48, 65, 182, 255, 256, 544, 916, 1488, 21488, 49436]);
$this->assertEquals(['0', 'A', '¶', 'ÿ', 'Ā', 'Ƞ', 'Δ', 'א', '台', '서'], $res);
}
public function testStrToOrdArr(): void
{
$convert = $this->getTestObject();
$res = $convert->strToOrdArr('0A¶ÿĀȠΔא台서');
$this->assertEquals([48, 65, 182, 255, 256, 544, 916, 1488, 21488, 49436], $res);
}
public function testGetSubUniArrStr(): void
{
$convert = $this->getTestObject();
$res = $convert->getSubUniArrStr(['0', 'A', '¶', 'ÿ', 'Ā', 'Ƞ', 'Δ', 'א', '台', '서']);
$this->assertEquals('0A¶ÿĀȠΔא台서', $res);
$res = $convert->getSubUniArrStr(['0', 'A', '¶', 'ÿ', 'Ā', 'Ƞ', 'Δ', 'א', '台', '서'], 2, 8);
$this->assertEquals('¶ÿĀȠΔא', $res);
}
public function testUniArrToLatinArr(): void
{
$convert = $this->getTestObject();
$uniarr = array_keys(Latin::SUBSTITUTE);
$uniarr[] = 65533; // 0xFFFD - character to ignore
$uniarr[] = 123456; // undefined char
$uniarr[] = 65; // ASCII char
$latarr = array_values(Latin::SUBSTITUTE);
$latarr[] = 63;
$latarr[] = 65;
$res = $convert->uniArrToLatinArr($uniarr);
$this->assertEquals($latarr, $res);
}
public function testLatinArrToStr(): void
{
$convert = $this->getTestObject();
$res = $convert->latinArrToStr([48, 57, 65, 90, 97, 122]);
$this->assertEquals('09AZaz', $res);
}
#[DataProvider('strToHexDataProvider')]
public function testStrToHex(string $str, mixed $hex): void
{
$convert = $this->getTestObject();
$res = $convert->strToHex($str);
$this->assertEquals($hex, $res);
}
#[DataProvider('strToHexDataProvider')]
public function testHexToStr(mixed $str, string $hex): void
{
$convert = $this->getTestObject();
$res = $convert->hexToStr($hex);
$this->assertEquals($str, $res);
}
/**
* @return array<int, array<string>>
*/
public static function strToHexDataProvider(): array
{
return [
['', ''],
['A', '41'],
['AB', '4142'],
['ABC', '414243'],
["\n", '0a'],
];
}
#[DataProvider('toUTF16BEDataProvider')]
public function testToUTF16BE(string $str, mixed $exp): void
{
$convert = $this->getTestObject();
$res = $convert->toUTF16BE($str);
$this->assertEquals($exp, $convert->strToHex($res));
}
/**
* @return array<int, array<string>>
*/
public static function toUTF16BEDataProvider(): array
{
return [
['', ''],
['ABC', '004100420043'],
[json_decode('"\u0010\uffff\u00ff\uff00"'), '0010ffff00ffff00'],
];
}
#[DataProvider('toUTF8DataProvider')]
public function testToUTF8(string $str, mixed $exp, ?string $enc = null): void
{
$convert = $this->getTestObject();
$res = $convert->toUTF8($str, $enc);
$this->assertEquals($exp, $res);
}
/**
* @return array<int, array<string>>
*/
public static function toUTF8DataProvider(): array
{
return [
['', ''],
['òèìòù', 'òèìòù'],
['òèìòù', 'òèìòù', 'ISO-8859-1'],
];
}
}

41
vendor/tecnickcom/tc-lib-unicode/test/TestUtil.php vendored Normal file
View File

@@ -0,0 +1,41 @@
<?php
/**
* TestUtil.php
*
* @since 2020-12-19
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2015-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*
* This file is part of tc-lib-color software library.
*/
namespace Test;
use PHPUnit\Framework\TestCase;
/**
* Web Color class test
*
* @since 2020-12-19
* @category Library
* @package Unicode
* @author Nicola Asuni <info@tecnick.com>
* @copyright 2015-2024 Nicola Asuni - Tecnick.com LTD
* @license http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
* @link https://github.com/tecnickcom/tc-lib-unicode
*/
class TestUtil extends TestCase
{
/**
* @param class-string<\Throwable> $exception
*/
public function bcExpectException($exception): void
{
parent::expectException($exception);
}
}