mirror of
https://git.minetest.land/MineClone2/MineClone2.git
synced 2024-08-19 05:24:11 +02:00
Add 'mods/CORE/tga_encoder/' from commit 'aad231f5e406a7c1eaafe6595a64b9c55f230692'
git-subtree-dir: mods/CORE/tga_encoder git-subtree-mainline: a5740f8edf894395605ce936272452cb84f1cd7f git-subtree-split: aad231f5e406a7c1eaafe6595a64b9c55f230692
This commit is contained in:
commit
b04493dcb6
674
mods/CORE/tga_encoder/LICENSE
Normal file
674
mods/CORE/tga_encoder/LICENSE
Normal file
@ -0,0 +1,674 @@
|
|||||||
|
GNU GENERAL PUBLIC LICENSE
|
||||||
|
Version 3, 29 June 2007
|
||||||
|
|
||||||
|
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
|
||||||
|
Everyone is permitted to copy and distribute verbatim copies
|
||||||
|
of this license document, but changing it is not allowed.
|
||||||
|
|
||||||
|
Preamble
|
||||||
|
|
||||||
|
The GNU General Public License is a free, copyleft license for
|
||||||
|
software and other kinds of works.
|
||||||
|
|
||||||
|
The licenses for most software and other practical works are designed
|
||||||
|
to take away your freedom to share and change the works. By contrast,
|
||||||
|
the GNU General Public License is intended to guarantee your freedom to
|
||||||
|
share and change all versions of a program--to make sure it remains free
|
||||||
|
software for all its users. We, the Free Software Foundation, use the
|
||||||
|
GNU General Public License for most of our software; it applies also to
|
||||||
|
any other work released this way by its authors. You can apply it to
|
||||||
|
your programs, too.
|
||||||
|
|
||||||
|
When we speak of free software, we are referring to freedom, not
|
||||||
|
price. Our General Public Licenses are designed to make sure that you
|
||||||
|
have the freedom to distribute copies of free software (and charge for
|
||||||
|
them if you wish), that you receive source code or can get it if you
|
||||||
|
want it, that you can change the software or use pieces of it in new
|
||||||
|
free programs, and that you know you can do these things.
|
||||||
|
|
||||||
|
To protect your rights, we need to prevent others from denying you
|
||||||
|
these rights or asking you to surrender the rights. Therefore, you have
|
||||||
|
certain responsibilities if you distribute copies of the software, or if
|
||||||
|
you modify it: responsibilities to respect the freedom of others.
|
||||||
|
|
||||||
|
For example, if you distribute copies of such a program, whether
|
||||||
|
gratis or for a fee, you must pass on to the recipients the same
|
||||||
|
freedoms that you received. You must make sure that they, too, receive
|
||||||
|
or can get the source code. And you must show them these terms so they
|
||||||
|
know their rights.
|
||||||
|
|
||||||
|
Developers that use the GNU GPL protect your rights with two steps:
|
||||||
|
(1) assert copyright on the software, and (2) offer you this License
|
||||||
|
giving you legal permission to copy, distribute and/or modify it.
|
||||||
|
|
||||||
|
For the developers' and authors' protection, the GPL clearly explains
|
||||||
|
that there is no warranty for this free software. For both users' and
|
||||||
|
authors' sake, the GPL requires that modified versions be marked as
|
||||||
|
changed, so that their problems will not be attributed erroneously to
|
||||||
|
authors of previous versions.
|
||||||
|
|
||||||
|
Some devices are designed to deny users access to install or run
|
||||||
|
modified versions of the software inside them, although the manufacturer
|
||||||
|
can do so. This is fundamentally incompatible with the aim of
|
||||||
|
protecting users' freedom to change the software. The systematic
|
||||||
|
pattern of such abuse occurs in the area of products for individuals to
|
||||||
|
use, which is precisely where it is most unacceptable. Therefore, we
|
||||||
|
have designed this version of the GPL to prohibit the practice for those
|
||||||
|
products. If such problems arise substantially in other domains, we
|
||||||
|
stand ready to extend this provision to those domains in future versions
|
||||||
|
of the GPL, as needed to protect the freedom of users.
|
||||||
|
|
||||||
|
Finally, every program is threatened constantly by software patents.
|
||||||
|
States should not allow patents to restrict development and use of
|
||||||
|
software on general-purpose computers, but in those that do, we wish to
|
||||||
|
avoid the special danger that patents applied to a free program could
|
||||||
|
make it effectively proprietary. To prevent this, the GPL assures that
|
||||||
|
patents cannot be used to render the program non-free.
|
||||||
|
|
||||||
|
The precise terms and conditions for copying, distribution and
|
||||||
|
modification follow.
|
||||||
|
|
||||||
|
TERMS AND CONDITIONS
|
||||||
|
|
||||||
|
0. Definitions.
|
||||||
|
|
||||||
|
"This License" refers to version 3 of the GNU General Public License.
|
||||||
|
|
||||||
|
"Copyright" also means copyright-like laws that apply to other kinds of
|
||||||
|
works, such as semiconductor masks.
|
||||||
|
|
||||||
|
"The Program" refers to any copyrightable work licensed under this
|
||||||
|
License. Each licensee is addressed as "you". "Licensees" and
|
||||||
|
"recipients" may be individuals or organizations.
|
||||||
|
|
||||||
|
To "modify" a work means to copy from or adapt all or part of the work
|
||||||
|
in a fashion requiring copyright permission, other than the making of an
|
||||||
|
exact copy. The resulting work is called a "modified version" of the
|
||||||
|
earlier work or a work "based on" the earlier work.
|
||||||
|
|
||||||
|
A "covered work" means either the unmodified Program or a work based
|
||||||
|
on the Program.
|
||||||
|
|
||||||
|
To "propagate" a work means to do anything with it that, without
|
||||||
|
permission, would make you directly or secondarily liable for
|
||||||
|
infringement under applicable copyright law, except executing it on a
|
||||||
|
computer or modifying a private copy. Propagation includes copying,
|
||||||
|
distribution (with or without modification), making available to the
|
||||||
|
public, and in some countries other activities as well.
|
||||||
|
|
||||||
|
To "convey" a work means any kind of propagation that enables other
|
||||||
|
parties to make or receive copies. Mere interaction with a user through
|
||||||
|
a computer network, with no transfer of a copy, is not conveying.
|
||||||
|
|
||||||
|
An interactive user interface displays "Appropriate Legal Notices"
|
||||||
|
to the extent that it includes a convenient and prominently visible
|
||||||
|
feature that (1) displays an appropriate copyright notice, and (2)
|
||||||
|
tells the user that there is no warranty for the work (except to the
|
||||||
|
extent that warranties are provided), that licensees may convey the
|
||||||
|
work under this License, and how to view a copy of this License. If
|
||||||
|
the interface presents a list of user commands or options, such as a
|
||||||
|
menu, a prominent item in the list meets this criterion.
|
||||||
|
|
||||||
|
1. Source Code.
|
||||||
|
|
||||||
|
The "source code" for a work means the preferred form of the work
|
||||||
|
for making modifications to it. "Object code" means any non-source
|
||||||
|
form of a work.
|
||||||
|
|
||||||
|
A "Standard Interface" means an interface that either is an official
|
||||||
|
standard defined by a recognized standards body, or, in the case of
|
||||||
|
interfaces specified for a particular programming language, one that
|
||||||
|
is widely used among developers working in that language.
|
||||||
|
|
||||||
|
The "System Libraries" of an executable work include anything, other
|
||||||
|
than the work as a whole, that (a) is included in the normal form of
|
||||||
|
packaging a Major Component, but which is not part of that Major
|
||||||
|
Component, and (b) serves only to enable use of the work with that
|
||||||
|
Major Component, or to implement a Standard Interface for which an
|
||||||
|
implementation is available to the public in source code form. A
|
||||||
|
"Major Component", in this context, means a major essential component
|
||||||
|
(kernel, window system, and so on) of the specific operating system
|
||||||
|
(if any) on which the executable work runs, or a compiler used to
|
||||||
|
produce the work, or an object code interpreter used to run it.
|
||||||
|
|
||||||
|
The "Corresponding Source" for a work in object code form means all
|
||||||
|
the source code needed to generate, install, and (for an executable
|
||||||
|
work) run the object code and to modify the work, including scripts to
|
||||||
|
control those activities. However, it does not include the work's
|
||||||
|
System Libraries, or general-purpose tools or generally available free
|
||||||
|
programs which are used unmodified in performing those activities but
|
||||||
|
which are not part of the work. For example, Corresponding Source
|
||||||
|
includes interface definition files associated with source files for
|
||||||
|
the work, and the source code for shared libraries and dynamically
|
||||||
|
linked subprograms that the work is specifically designed to require,
|
||||||
|
such as by intimate data communication or control flow between those
|
||||||
|
subprograms and other parts of the work.
|
||||||
|
|
||||||
|
The Corresponding Source need not include anything that users
|
||||||
|
can regenerate automatically from other parts of the Corresponding
|
||||||
|
Source.
|
||||||
|
|
||||||
|
The Corresponding Source for a work in source code form is that
|
||||||
|
same work.
|
||||||
|
|
||||||
|
2. Basic Permissions.
|
||||||
|
|
||||||
|
All rights granted under this License are granted for the term of
|
||||||
|
copyright on the Program, and are irrevocable provided the stated
|
||||||
|
conditions are met. This License explicitly affirms your unlimited
|
||||||
|
permission to run the unmodified Program. The output from running a
|
||||||
|
covered work is covered by this License only if the output, given its
|
||||||
|
content, constitutes a covered work. This License acknowledges your
|
||||||
|
rights of fair use or other equivalent, as provided by copyright law.
|
||||||
|
|
||||||
|
You may make, run and propagate covered works that you do not
|
||||||
|
convey, without conditions so long as your license otherwise remains
|
||||||
|
in force. You may convey covered works to others for the sole purpose
|
||||||
|
of having them make modifications exclusively for you, or provide you
|
||||||
|
with facilities for running those works, provided that you comply with
|
||||||
|
the terms of this License in conveying all material for which you do
|
||||||
|
not control copyright. Those thus making or running the covered works
|
||||||
|
for you must do so exclusively on your behalf, under your direction
|
||||||
|
and control, on terms that prohibit them from making any copies of
|
||||||
|
your copyrighted material outside their relationship with you.
|
||||||
|
|
||||||
|
Conveying under any other circumstances is permitted solely under
|
||||||
|
the conditions stated below. Sublicensing is not allowed; section 10
|
||||||
|
makes it unnecessary.
|
||||||
|
|
||||||
|
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
||||||
|
|
||||||
|
No covered work shall be deemed part of an effective technological
|
||||||
|
measure under any applicable law fulfilling obligations under article
|
||||||
|
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
||||||
|
similar laws prohibiting or restricting circumvention of such
|
||||||
|
measures.
|
||||||
|
|
||||||
|
When you convey a covered work, you waive any legal power to forbid
|
||||||
|
circumvention of technological measures to the extent such circumvention
|
||||||
|
is effected by exercising rights under this License with respect to
|
||||||
|
the covered work, and you disclaim any intention to limit operation or
|
||||||
|
modification of the work as a means of enforcing, against the work's
|
||||||
|
users, your or third parties' legal rights to forbid circumvention of
|
||||||
|
technological measures.
|
||||||
|
|
||||||
|
4. Conveying Verbatim Copies.
|
||||||
|
|
||||||
|
You may convey verbatim copies of the Program's source code as you
|
||||||
|
receive it, in any medium, provided that you conspicuously and
|
||||||
|
appropriately publish on each copy an appropriate copyright notice;
|
||||||
|
keep intact all notices stating that this License and any
|
||||||
|
non-permissive terms added in accord with section 7 apply to the code;
|
||||||
|
keep intact all notices of the absence of any warranty; and give all
|
||||||
|
recipients a copy of this License along with the Program.
|
||||||
|
|
||||||
|
You may charge any price or no price for each copy that you convey,
|
||||||
|
and you may offer support or warranty protection for a fee.
|
||||||
|
|
||||||
|
5. Conveying Modified Source Versions.
|
||||||
|
|
||||||
|
You may convey a work based on the Program, or the modifications to
|
||||||
|
produce it from the Program, in the form of source code under the
|
||||||
|
terms of section 4, provided that you also meet all of these conditions:
|
||||||
|
|
||||||
|
a) The work must carry prominent notices stating that you modified
|
||||||
|
it, and giving a relevant date.
|
||||||
|
|
||||||
|
b) The work must carry prominent notices stating that it is
|
||||||
|
released under this License and any conditions added under section
|
||||||
|
7. This requirement modifies the requirement in section 4 to
|
||||||
|
"keep intact all notices".
|
||||||
|
|
||||||
|
c) You must license the entire work, as a whole, under this
|
||||||
|
License to anyone who comes into possession of a copy. This
|
||||||
|
License will therefore apply, along with any applicable section 7
|
||||||
|
additional terms, to the whole of the work, and all its parts,
|
||||||
|
regardless of how they are packaged. This License gives no
|
||||||
|
permission to license the work in any other way, but it does not
|
||||||
|
invalidate such permission if you have separately received it.
|
||||||
|
|
||||||
|
d) If the work has interactive user interfaces, each must display
|
||||||
|
Appropriate Legal Notices; however, if the Program has interactive
|
||||||
|
interfaces that do not display Appropriate Legal Notices, your
|
||||||
|
work need not make them do so.
|
||||||
|
|
||||||
|
A compilation of a covered work with other separate and independent
|
||||||
|
works, which are not by their nature extensions of the covered work,
|
||||||
|
and which are not combined with it such as to form a larger program,
|
||||||
|
in or on a volume of a storage or distribution medium, is called an
|
||||||
|
"aggregate" if the compilation and its resulting copyright are not
|
||||||
|
used to limit the access or legal rights of the compilation's users
|
||||||
|
beyond what the individual works permit. Inclusion of a covered work
|
||||||
|
in an aggregate does not cause this License to apply to the other
|
||||||
|
parts of the aggregate.
|
||||||
|
|
||||||
|
6. Conveying Non-Source Forms.
|
||||||
|
|
||||||
|
You may convey a covered work in object code form under the terms
|
||||||
|
of sections 4 and 5, provided that you also convey the
|
||||||
|
machine-readable Corresponding Source under the terms of this License,
|
||||||
|
in one of these ways:
|
||||||
|
|
||||||
|
a) Convey the object code in, or embodied in, a physical product
|
||||||
|
(including a physical distribution medium), accompanied by the
|
||||||
|
Corresponding Source fixed on a durable physical medium
|
||||||
|
customarily used for software interchange.
|
||||||
|
|
||||||
|
b) Convey the object code in, or embodied in, a physical product
|
||||||
|
(including a physical distribution medium), accompanied by a
|
||||||
|
written offer, valid for at least three years and valid for as
|
||||||
|
long as you offer spare parts or customer support for that product
|
||||||
|
model, to give anyone who possesses the object code either (1) a
|
||||||
|
copy of the Corresponding Source for all the software in the
|
||||||
|
product that is covered by this License, on a durable physical
|
||||||
|
medium customarily used for software interchange, for a price no
|
||||||
|
more than your reasonable cost of physically performing this
|
||||||
|
conveying of source, or (2) access to copy the
|
||||||
|
Corresponding Source from a network server at no charge.
|
||||||
|
|
||||||
|
c) Convey individual copies of the object code with a copy of the
|
||||||
|
written offer to provide the Corresponding Source. This
|
||||||
|
alternative is allowed only occasionally and noncommercially, and
|
||||||
|
only if you received the object code with such an offer, in accord
|
||||||
|
with subsection 6b.
|
||||||
|
|
||||||
|
d) Convey the object code by offering access from a designated
|
||||||
|
place (gratis or for a charge), and offer equivalent access to the
|
||||||
|
Corresponding Source in the same way through the same place at no
|
||||||
|
further charge. You need not require recipients to copy the
|
||||||
|
Corresponding Source along with the object code. If the place to
|
||||||
|
copy the object code is a network server, the Corresponding Source
|
||||||
|
may be on a different server (operated by you or a third party)
|
||||||
|
that supports equivalent copying facilities, provided you maintain
|
||||||
|
clear directions next to the object code saying where to find the
|
||||||
|
Corresponding Source. Regardless of what server hosts the
|
||||||
|
Corresponding Source, you remain obligated to ensure that it is
|
||||||
|
available for as long as needed to satisfy these requirements.
|
||||||
|
|
||||||
|
e) Convey the object code using peer-to-peer transmission, provided
|
||||||
|
you inform other peers where the object code and Corresponding
|
||||||
|
Source of the work are being offered to the general public at no
|
||||||
|
charge under subsection 6d.
|
||||||
|
|
||||||
|
A separable portion of the object code, whose source code is excluded
|
||||||
|
from the Corresponding Source as a System Library, need not be
|
||||||
|
included in conveying the object code work.
|
||||||
|
|
||||||
|
A "User Product" is either (1) a "consumer product", which means any
|
||||||
|
tangible personal property which is normally used for personal, family,
|
||||||
|
or household purposes, or (2) anything designed or sold for incorporation
|
||||||
|
into a dwelling. In determining whether a product is a consumer product,
|
||||||
|
doubtful cases shall be resolved in favor of coverage. For a particular
|
||||||
|
product received by a particular user, "normally used" refers to a
|
||||||
|
typical or common use of that class of product, regardless of the status
|
||||||
|
of the particular user or of the way in which the particular user
|
||||||
|
actually uses, or expects or is expected to use, the product. A product
|
||||||
|
is a consumer product regardless of whether the product has substantial
|
||||||
|
commercial, industrial or non-consumer uses, unless such uses represent
|
||||||
|
the only significant mode of use of the product.
|
||||||
|
|
||||||
|
"Installation Information" for a User Product means any methods,
|
||||||
|
procedures, authorization keys, or other information required to install
|
||||||
|
and execute modified versions of a covered work in that User Product from
|
||||||
|
a modified version of its Corresponding Source. The information must
|
||||||
|
suffice to ensure that the continued functioning of the modified object
|
||||||
|
code is in no case prevented or interfered with solely because
|
||||||
|
modification has been made.
|
||||||
|
|
||||||
|
If you convey an object code work under this section in, or with, or
|
||||||
|
specifically for use in, a User Product, and the conveying occurs as
|
||||||
|
part of a transaction in which the right of possession and use of the
|
||||||
|
User Product is transferred to the recipient in perpetuity or for a
|
||||||
|
fixed term (regardless of how the transaction is characterized), the
|
||||||
|
Corresponding Source conveyed under this section must be accompanied
|
||||||
|
by the Installation Information. But this requirement does not apply
|
||||||
|
if neither you nor any third party retains the ability to install
|
||||||
|
modified object code on the User Product (for example, the work has
|
||||||
|
been installed in ROM).
|
||||||
|
|
||||||
|
The requirement to provide Installation Information does not include a
|
||||||
|
requirement to continue to provide support service, warranty, or updates
|
||||||
|
for a work that has been modified or installed by the recipient, or for
|
||||||
|
the User Product in which it has been modified or installed. Access to a
|
||||||
|
network may be denied when the modification itself materially and
|
||||||
|
adversely affects the operation of the network or violates the rules and
|
||||||
|
protocols for communication across the network.
|
||||||
|
|
||||||
|
Corresponding Source conveyed, and Installation Information provided,
|
||||||
|
in accord with this section must be in a format that is publicly
|
||||||
|
documented (and with an implementation available to the public in
|
||||||
|
source code form), and must require no special password or key for
|
||||||
|
unpacking, reading or copying.
|
||||||
|
|
||||||
|
7. Additional Terms.
|
||||||
|
|
||||||
|
"Additional permissions" are terms that supplement the terms of this
|
||||||
|
License by making exceptions from one or more of its conditions.
|
||||||
|
Additional permissions that are applicable to the entire Program shall
|
||||||
|
be treated as though they were included in this License, to the extent
|
||||||
|
that they are valid under applicable law. If additional permissions
|
||||||
|
apply only to part of the Program, that part may be used separately
|
||||||
|
under those permissions, but the entire Program remains governed by
|
||||||
|
this License without regard to the additional permissions.
|
||||||
|
|
||||||
|
When you convey a copy of a covered work, you may at your option
|
||||||
|
remove any additional permissions from that copy, or from any part of
|
||||||
|
it. (Additional permissions may be written to require their own
|
||||||
|
removal in certain cases when you modify the work.) You may place
|
||||||
|
additional permissions on material, added by you to a covered work,
|
||||||
|
for which you have or can give appropriate copyright permission.
|
||||||
|
|
||||||
|
Notwithstanding any other provision of this License, for material you
|
||||||
|
add to a covered work, you may (if authorized by the copyright holders of
|
||||||
|
that material) supplement the terms of this License with terms:
|
||||||
|
|
||||||
|
a) Disclaiming warranty or limiting liability differently from the
|
||||||
|
terms of sections 15 and 16 of this License; or
|
||||||
|
|
||||||
|
b) Requiring preservation of specified reasonable legal notices or
|
||||||
|
author attributions in that material or in the Appropriate Legal
|
||||||
|
Notices displayed by works containing it; or
|
||||||
|
|
||||||
|
c) Prohibiting misrepresentation of the origin of that material, or
|
||||||
|
requiring that modified versions of such material be marked in
|
||||||
|
reasonable ways as different from the original version; or
|
||||||
|
|
||||||
|
d) Limiting the use for publicity purposes of names of licensors or
|
||||||
|
authors of the material; or
|
||||||
|
|
||||||
|
e) Declining to grant rights under trademark law for use of some
|
||||||
|
trade names, trademarks, or service marks; or
|
||||||
|
|
||||||
|
f) Requiring indemnification of licensors and authors of that
|
||||||
|
material by anyone who conveys the material (or modified versions of
|
||||||
|
it) with contractual assumptions of liability to the recipient, for
|
||||||
|
any liability that these contractual assumptions directly impose on
|
||||||
|
those licensors and authors.
|
||||||
|
|
||||||
|
All other non-permissive additional terms are considered "further
|
||||||
|
restrictions" within the meaning of section 10. If the Program as you
|
||||||
|
received it, or any part of it, contains a notice stating that it is
|
||||||
|
governed by this License along with a term that is a further
|
||||||
|
restriction, you may remove that term. If a license document contains
|
||||||
|
a further restriction but permits relicensing or conveying under this
|
||||||
|
License, you may add to a covered work material governed by the terms
|
||||||
|
of that license document, provided that the further restriction does
|
||||||
|
not survive such relicensing or conveying.
|
||||||
|
|
||||||
|
If you add terms to a covered work in accord with this section, you
|
||||||
|
must place, in the relevant source files, a statement of the
|
||||||
|
additional terms that apply to those files, or a notice indicating
|
||||||
|
where to find the applicable terms.
|
||||||
|
|
||||||
|
Additional terms, permissive or non-permissive, may be stated in the
|
||||||
|
form of a separately written license, or stated as exceptions;
|
||||||
|
the above requirements apply either way.
|
||||||
|
|
||||||
|
8. Termination.
|
||||||
|
|
||||||
|
You may not propagate or modify a covered work except as expressly
|
||||||
|
provided under this License. Any attempt otherwise to propagate or
|
||||||
|
modify it is void, and will automatically terminate your rights under
|
||||||
|
this License (including any patent licenses granted under the third
|
||||||
|
paragraph of section 11).
|
||||||
|
|
||||||
|
However, if you cease all violation of this License, then your
|
||||||
|
license from a particular copyright holder is reinstated (a)
|
||||||
|
provisionally, unless and until the copyright holder explicitly and
|
||||||
|
finally terminates your license, and (b) permanently, if the copyright
|
||||||
|
holder fails to notify you of the violation by some reasonable means
|
||||||
|
prior to 60 days after the cessation.
|
||||||
|
|
||||||
|
Moreover, your license from a particular copyright holder is
|
||||||
|
reinstated permanently if the copyright holder notifies you of the
|
||||||
|
violation by some reasonable means, this is the first time you have
|
||||||
|
received notice of violation of this License (for any work) from that
|
||||||
|
copyright holder, and you cure the violation prior to 30 days after
|
||||||
|
your receipt of the notice.
|
||||||
|
|
||||||
|
Termination of your rights under this section does not terminate the
|
||||||
|
licenses of parties who have received copies or rights from you under
|
||||||
|
this License. If your rights have been terminated and not permanently
|
||||||
|
reinstated, you do not qualify to receive new licenses for the same
|
||||||
|
material under section 10.
|
||||||
|
|
||||||
|
9. Acceptance Not Required for Having Copies.
|
||||||
|
|
||||||
|
You are not required to accept this License in order to receive or
|
||||||
|
run a copy of the Program. Ancillary propagation of a covered work
|
||||||
|
occurring solely as a consequence of using peer-to-peer transmission
|
||||||
|
to receive a copy likewise does not require acceptance. However,
|
||||||
|
nothing other than this License grants you permission to propagate or
|
||||||
|
modify any covered work. These actions infringe copyright if you do
|
||||||
|
not accept this License. Therefore, by modifying or propagating a
|
||||||
|
covered work, you indicate your acceptance of this License to do so.
|
||||||
|
|
||||||
|
10. Automatic Licensing of Downstream Recipients.
|
||||||
|
|
||||||
|
Each time you convey a covered work, the recipient automatically
|
||||||
|
receives a license from the original licensors, to run, modify and
|
||||||
|
propagate that work, subject to this License. You are not responsible
|
||||||
|
for enforcing compliance by third parties with this License.
|
||||||
|
|
||||||
|
An "entity transaction" is a transaction transferring control of an
|
||||||
|
organization, or substantially all assets of one, or subdividing an
|
||||||
|
organization, or merging organizations. If propagation of a covered
|
||||||
|
work results from an entity transaction, each party to that
|
||||||
|
transaction who receives a copy of the work also receives whatever
|
||||||
|
licenses to the work the party's predecessor in interest had or could
|
||||||
|
give under the previous paragraph, plus a right to possession of the
|
||||||
|
Corresponding Source of the work from the predecessor in interest, if
|
||||||
|
the predecessor has it or can get it with reasonable efforts.
|
||||||
|
|
||||||
|
You may not impose any further restrictions on the exercise of the
|
||||||
|
rights granted or affirmed under this License. For example, you may
|
||||||
|
not impose a license fee, royalty, or other charge for exercise of
|
||||||
|
rights granted under this License, and you may not initiate litigation
|
||||||
|
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
||||||
|
any patent claim is infringed by making, using, selling, offering for
|
||||||
|
sale, or importing the Program or any portion of it.
|
||||||
|
|
||||||
|
11. Patents.
|
||||||
|
|
||||||
|
A "contributor" is a copyright holder who authorizes use under this
|
||||||
|
License of the Program or a work on which the Program is based. The
|
||||||
|
work thus licensed is called the contributor's "contributor version".
|
||||||
|
|
||||||
|
A contributor's "essential patent claims" are all patent claims
|
||||||
|
owned or controlled by the contributor, whether already acquired or
|
||||||
|
hereafter acquired, that would be infringed by some manner, permitted
|
||||||
|
by this License, of making, using, or selling its contributor version,
|
||||||
|
but do not include claims that would be infringed only as a
|
||||||
|
consequence of further modification of the contributor version. For
|
||||||
|
purposes of this definition, "control" includes the right to grant
|
||||||
|
patent sublicenses in a manner consistent with the requirements of
|
||||||
|
this License.
|
||||||
|
|
||||||
|
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
||||||
|
patent license under the contributor's essential patent claims, to
|
||||||
|
make, use, sell, offer for sale, import and otherwise run, modify and
|
||||||
|
propagate the contents of its contributor version.
|
||||||
|
|
||||||
|
In the following three paragraphs, a "patent license" is any express
|
||||||
|
agreement or commitment, however denominated, not to enforce a patent
|
||||||
|
(such as an express permission to practice a patent or covenant not to
|
||||||
|
sue for patent infringement). To "grant" such a patent license to a
|
||||||
|
party means to make such an agreement or commitment not to enforce a
|
||||||
|
patent against the party.
|
||||||
|
|
||||||
|
If you convey a covered work, knowingly relying on a patent license,
|
||||||
|
and the Corresponding Source of the work is not available for anyone
|
||||||
|
to copy, free of charge and under the terms of this License, through a
|
||||||
|
publicly available network server or other readily accessible means,
|
||||||
|
then you must either (1) cause the Corresponding Source to be so
|
||||||
|
available, or (2) arrange to deprive yourself of the benefit of the
|
||||||
|
patent license for this particular work, or (3) arrange, in a manner
|
||||||
|
consistent with the requirements of this License, to extend the patent
|
||||||
|
license to downstream recipients. "Knowingly relying" means you have
|
||||||
|
actual knowledge that, but for the patent license, your conveying the
|
||||||
|
covered work in a country, or your recipient's use of the covered work
|
||||||
|
in a country, would infringe one or more identifiable patents in that
|
||||||
|
country that you have reason to believe are valid.
|
||||||
|
|
||||||
|
If, pursuant to or in connection with a single transaction or
|
||||||
|
arrangement, you convey, or propagate by procuring conveyance of, a
|
||||||
|
covered work, and grant a patent license to some of the parties
|
||||||
|
receiving the covered work authorizing them to use, propagate, modify
|
||||||
|
or convey a specific copy of the covered work, then the patent license
|
||||||
|
you grant is automatically extended to all recipients of the covered
|
||||||
|
work and works based on it.
|
||||||
|
|
||||||
|
A patent license is "discriminatory" if it does not include within
|
||||||
|
the scope of its coverage, prohibits the exercise of, or is
|
||||||
|
conditioned on the non-exercise of one or more of the rights that are
|
||||||
|
specifically granted under this License. You may not convey a covered
|
||||||
|
work if you are a party to an arrangement with a third party that is
|
||||||
|
in the business of distributing software, under which you make payment
|
||||||
|
to the third party based on the extent of your activity of conveying
|
||||||
|
the work, and under which the third party grants, to any of the
|
||||||
|
parties who would receive the covered work from you, a discriminatory
|
||||||
|
patent license (a) in connection with copies of the covered work
|
||||||
|
conveyed by you (or copies made from those copies), or (b) primarily
|
||||||
|
for and in connection with specific products or compilations that
|
||||||
|
contain the covered work, unless you entered into that arrangement,
|
||||||
|
or that patent license was granted, prior to 28 March 2007.
|
||||||
|
|
||||||
|
Nothing in this License shall be construed as excluding or limiting
|
||||||
|
any implied license or other defenses to infringement that may
|
||||||
|
otherwise be available to you under applicable patent law.
|
||||||
|
|
||||||
|
12. No Surrender of Others' Freedom.
|
||||||
|
|
||||||
|
If conditions are imposed on you (whether by court order, agreement or
|
||||||
|
otherwise) that contradict the conditions of this License, they do not
|
||||||
|
excuse you from the conditions of this License. If you cannot convey a
|
||||||
|
covered work so as to satisfy simultaneously your obligations under this
|
||||||
|
License and any other pertinent obligations, then as a consequence you may
|
||||||
|
not convey it at all. For example, if you agree to terms that obligate you
|
||||||
|
to collect a royalty for further conveying from those to whom you convey
|
||||||
|
the Program, the only way you could satisfy both those terms and this
|
||||||
|
License would be to refrain entirely from conveying the Program.
|
||||||
|
|
||||||
|
13. Use with the GNU Affero General Public License.
|
||||||
|
|
||||||
|
Notwithstanding any other provision of this License, you have
|
||||||
|
permission to link or combine any covered work with a work licensed
|
||||||
|
under version 3 of the GNU Affero General Public License into a single
|
||||||
|
combined work, and to convey the resulting work. The terms of this
|
||||||
|
License will continue to apply to the part which is the covered work,
|
||||||
|
but the special requirements of the GNU Affero General Public License,
|
||||||
|
section 13, concerning interaction through a network will apply to the
|
||||||
|
combination as such.
|
||||||
|
|
||||||
|
14. Revised Versions of this License.
|
||||||
|
|
||||||
|
The Free Software Foundation may publish revised and/or new versions of
|
||||||
|
the GNU General Public License from time to time. Such new versions will
|
||||||
|
be similar in spirit to the present version, but may differ in detail to
|
||||||
|
address new problems or concerns.
|
||||||
|
|
||||||
|
Each version is given a distinguishing version number. If the
|
||||||
|
Program specifies that a certain numbered version of the GNU General
|
||||||
|
Public License "or any later version" applies to it, you have the
|
||||||
|
option of following the terms and conditions either of that numbered
|
||||||
|
version or of any later version published by the Free Software
|
||||||
|
Foundation. If the Program does not specify a version number of the
|
||||||
|
GNU General Public License, you may choose any version ever published
|
||||||
|
by the Free Software Foundation.
|
||||||
|
|
||||||
|
If the Program specifies that a proxy can decide which future
|
||||||
|
versions of the GNU General Public License can be used, that proxy's
|
||||||
|
public statement of acceptance of a version permanently authorizes you
|
||||||
|
to choose that version for the Program.
|
||||||
|
|
||||||
|
Later license versions may give you additional or different
|
||||||
|
permissions. However, no additional obligations are imposed on any
|
||||||
|
author or copyright holder as a result of your choosing to follow a
|
||||||
|
later version.
|
||||||
|
|
||||||
|
15. Disclaimer of Warranty.
|
||||||
|
|
||||||
|
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
||||||
|
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
||||||
|
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
||||||
|
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
||||||
|
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
||||||
|
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
||||||
|
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
||||||
|
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
||||||
|
|
||||||
|
16. Limitation of Liability.
|
||||||
|
|
||||||
|
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
||||||
|
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
||||||
|
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
||||||
|
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
||||||
|
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
||||||
|
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
||||||
|
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
||||||
|
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
||||||
|
SUCH DAMAGES.
|
||||||
|
|
||||||
|
17. Interpretation of Sections 15 and 16.
|
||||||
|
|
||||||
|
If the disclaimer of warranty and limitation of liability provided
|
||||||
|
above cannot be given local legal effect according to their terms,
|
||||||
|
reviewing courts shall apply local law that most closely approximates
|
||||||
|
an absolute waiver of all civil liability in connection with the
|
||||||
|
Program, unless a warranty or assumption of liability accompanies a
|
||||||
|
copy of the Program in return for a fee.
|
||||||
|
|
||||||
|
END OF TERMS AND CONDITIONS
|
||||||
|
|
||||||
|
How to Apply These Terms to Your New Programs
|
||||||
|
|
||||||
|
If you develop a new program, and you want it to be of the greatest
|
||||||
|
possible use to the public, the best way to achieve this is to make it
|
||||||
|
free software which everyone can redistribute and change under these terms.
|
||||||
|
|
||||||
|
To do so, attach the following notices to the program. It is safest
|
||||||
|
to attach them to the start of each source file to most effectively
|
||||||
|
state the exclusion of warranty; and each file should have at least
|
||||||
|
the "copyright" line and a pointer to where the full notice is found.
|
||||||
|
|
||||||
|
<one line to give the program's name and a brief idea of what it does.>
|
||||||
|
Copyright (C) <year> <name of author>
|
||||||
|
|
||||||
|
This program is free software: you can redistribute it and/or modify
|
||||||
|
it under the terms of the GNU General Public License as published by
|
||||||
|
the Free Software Foundation, either version 3 of the License, or
|
||||||
|
(at your option) any later version.
|
||||||
|
|
||||||
|
This program is distributed in the hope that it will be useful,
|
||||||
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||||
|
GNU General Public License for more details.
|
||||||
|
|
||||||
|
You should have received a copy of the GNU General Public License
|
||||||
|
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
|
Also add information on how to contact you by electronic and paper mail.
|
||||||
|
|
||||||
|
If the program does terminal interaction, make it output a short
|
||||||
|
notice like this when it starts in an interactive mode:
|
||||||
|
|
||||||
|
<program> Copyright (C) <year> <name of author>
|
||||||
|
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
||||||
|
This is free software, and you are welcome to redistribute it
|
||||||
|
under certain conditions; type `show c' for details.
|
||||||
|
|
||||||
|
The hypothetical commands `show w' and `show c' should show the appropriate
|
||||||
|
parts of the General Public License. Of course, your program's commands
|
||||||
|
might be different; for a GUI interface, you would use an "about box".
|
||||||
|
|
||||||
|
You should also get your employer (if you work as a programmer) or school,
|
||||||
|
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
||||||
|
For more information on this, and how to apply and follow the GNU GPL, see
|
||||||
|
<https://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
|
The GNU General Public License does not permit incorporating your program
|
||||||
|
into proprietary programs. If your program is a subroutine library, you
|
||||||
|
may consider it more useful to permit linking proprietary applications with
|
||||||
|
the library. If this is what you want to do, use the GNU Lesser General
|
||||||
|
Public License instead of this License. But first, please read
|
||||||
|
<https://www.gnu.org/licenses/why-not-lgpl.html>.
|
87
mods/CORE/tga_encoder/README.md
Normal file
87
mods/CORE/tga_encoder/README.md
Normal file
@ -0,0 +1,87 @@
|
|||||||
|
# tga_encoder
|
||||||
|
A TGA Encoder written in Lua without the use of external Libraries.
|
||||||
|
|
||||||
|
Created by fleckenstein for MineClone2, then improved by erlehmann.
|
||||||
|
|
||||||
|
May be used as a Minetest mod.
|
||||||
|
|
||||||
|
See `examples.lua` for example code and usage hints.
|
||||||
|
|
||||||
|
## Use Cases for `tga_encoder`
|
||||||
|
|
||||||
|
### Encoding Textures for Editing
|
||||||
|
|
||||||
|
TGA images of types 1/2/3 consist of header data followed by a pixel array.
|
||||||
|
|
||||||
|
This makes it trivial to parse TGA files – and even edit pixels in-place.
|
||||||
|
|
||||||
|
No checksums need to be updated on any kind of in-place texture editing.
|
||||||
|
|
||||||
|
**Tip**: When storing an editable image in item meta, use zlib compression.
|
||||||
|
|
||||||
|
### Legacy Minetest Texture Encoding
|
||||||
|
|
||||||
|
Minetest 5.4 did not include `minetest.encode_png()` (or any equvivalent).
|
||||||
|
|
||||||
|
Since `tga_encoder` is written in pure Lua, it does not need engine support.
|
||||||
|
|
||||||
|
**Tip:** Look at `examples.lua` and the Minetest mod `mcl_maps` for guidance.
|
||||||
|
|
||||||
|
### Advanced Texture Format Control
|
||||||
|
|
||||||
|
The function `minetest.encode_png()` always encodes images as 32bpp RGBA.
|
||||||
|
|
||||||
|
`tga_encoder` allows saving images as grayscale, 16bpp RGBA and 24bpp RGB.
|
||||||
|
|
||||||
|
For generating maps from terrain, color-mapped formats can be more useful.
|
||||||
|
|
||||||
|
### Encoding Very Small Textures
|
||||||
|
|
||||||
|
Images of size 8×8 or below are often smaller than an equivalent PNG file.
|
||||||
|
|
||||||
|
Note that on many filesystems files use at least 4096 bytes (i.e. 64×64).
|
||||||
|
|
||||||
|
Therefore, saving bytes on files up to a few 100 bytes is often useless.
|
||||||
|
|
||||||
|
### Encoding Reference Textures
|
||||||
|
|
||||||
|
TGA is a simple format, which makes it easy to create reference textures.
|
||||||
|
|
||||||
|
Using a hex editor, one can trivially see how all the pixels are stored.
|
||||||
|
|
||||||
|
## Supported Image Types
|
||||||
|
|
||||||
|
For all types, images are encoded in a fast single pass (i.e. append-only).
|
||||||
|
|
||||||
|
### Color-Mapped Images (Type 1)
|
||||||
|
|
||||||
|
These images contain a palette, followed by pixel data.
|
||||||
|
|
||||||
|
* `A1R5G5B5` (8bpp RGB)
|
||||||
|
* `B8G8R8` (8bpp RGB)
|
||||||
|
* `B8G8R8A8` (8bpp RGBA)
|
||||||
|
|
||||||
|
### True-Color Images (Type 2)
|
||||||
|
|
||||||
|
These images contain uncompressed RGB(A) pixel data.
|
||||||
|
|
||||||
|
* `A1R5G5B5` (16bpp RGBA)
|
||||||
|
* `B8G8R8` (24bpp RGB)
|
||||||
|
* `B8G8R8A8` (32bpp RGBA)
|
||||||
|
|
||||||
|
### Grayscale Images (Type 3)
|
||||||
|
|
||||||
|
* `Y8` (8bpp grayscale)
|
||||||
|
|
||||||
|
### Run-Length Encoded (RLE), True-Color Images (Type 10)
|
||||||
|
|
||||||
|
These images contain compressed RGB(A) pixel data.
|
||||||
|
|
||||||
|
* `A1R5G5B5` (16bpp RGBA)
|
||||||
|
* `B8G8R8` (24bpp RGB)
|
||||||
|
* `B8G8R8A8` (32bpp RGBA)
|
||||||
|
|
||||||
|
## TODO
|
||||||
|
|
||||||
|
* Actually support `R8G8B8A8` input for `A1R5G5B5` output
|
||||||
|
* Add both zoomable and explorable maps to `mcl_maps`.
|
32
mods/CORE/tga_encoder/colormap_generator.lua
Normal file
32
mods/CORE/tga_encoder/colormap_generator.lua
Normal file
@ -0,0 +1,32 @@
|
|||||||
|
dofile("init.lua")
|
||||||
|
|
||||||
|
-- This generates images necessary to colorize 16 Minetest nodes in 4096 colors.
|
||||||
|
-- It serves as a demonstration of what you can achieve using colormapped nodes.
|
||||||
|
-- It is be useful for grass or beam or glass nodes that need to blend smoothly.
|
||||||
|
|
||||||
|
-- Sample depth rescaling is done according to the algorithm presented in:
|
||||||
|
-- <https://www.w3.org/TR/2003/REC-PNG-20031110/#13Sample-depth-rescaling>
|
||||||
|
local max_sample_in = math.pow(2, 4) - 1
|
||||||
|
local max_sample_out = math.pow(2, 8) - 1
|
||||||
|
|
||||||
|
for r = 0,15 do
|
||||||
|
local pixels = {}
|
||||||
|
for g = 0,15 do
|
||||||
|
if nil == pixels[g + 1] then
|
||||||
|
pixels[g + 1] = {}
|
||||||
|
end
|
||||||
|
for b = 0,15 do
|
||||||
|
local color = {
|
||||||
|
math.floor((r * max_sample_out / max_sample_in) + 0.5),
|
||||||
|
math.floor((g * max_sample_out / max_sample_in) + 0.5),
|
||||||
|
math.floor((b * max_sample_out / max_sample_in) + 0.5),
|
||||||
|
}
|
||||||
|
pixels[g + 1][b + 1] = color
|
||||||
|
end
|
||||||
|
end
|
||||||
|
local filename = "colormap_" .. tostring(r) .. ".tga"
|
||||||
|
tga_encoder.image(pixels):save(
|
||||||
|
filename,
|
||||||
|
{ color_format="A1R5G5B5" } -- waste less bits
|
||||||
|
)
|
||||||
|
end
|
105
mods/CORE/tga_encoder/donut.lua
Normal file
105
mods/CORE/tga_encoder/donut.lua
Normal file
@ -0,0 +1,105 @@
|
|||||||
|
#!/usr/bin/env lua5.1
|
||||||
|
-- -*- coding: utf-8 -*-
|
||||||
|
|
||||||
|
-- 3D “donut” shape rendering using floating-point math
|
||||||
|
-- see <https://www.a1k0n.net/2011/07/20/donut-math.html>
|
||||||
|
|
||||||
|
-- cargo-culted by erle 2023-09-18
|
||||||
|
|
||||||
|
local theta_spacing = 0.01 -- 0.07
|
||||||
|
local phi_spacing = 0.002 -- 0.02
|
||||||
|
|
||||||
|
local R1 = 1
|
||||||
|
local R2 = 2
|
||||||
|
local K2 = 5
|
||||||
|
|
||||||
|
local screen_height = 256
|
||||||
|
local screen_width = 256
|
||||||
|
|
||||||
|
local K1 = screen_width * K2 * 3 / ( 8 * ( R1 + R2 ) )
|
||||||
|
|
||||||
|
local output = {}
|
||||||
|
local zbuffer = {}
|
||||||
|
|
||||||
|
local grey = { 120, 120, 120 }
|
||||||
|
local gray = { 136, 136, 136 }
|
||||||
|
|
||||||
|
for y = 1,screen_height,1 do
|
||||||
|
output[y] = {}
|
||||||
|
zbuffer[y] = {}
|
||||||
|
for x = 1,screen_width,1 do
|
||||||
|
local hori = math.floor( ( (y - 1) / 32 ) % 2 )
|
||||||
|
local vert = math.floor( ( (x - 1) / 32 ) % 2 )
|
||||||
|
output[y][x] = hori ~= vert and grey or gray
|
||||||
|
zbuffer[y][x] = 0
|
||||||
|
end
|
||||||
|
end
|
||||||
|
|
||||||
|
function render_frame(A, B)
|
||||||
|
-- precompute sines and cosines of A and B
|
||||||
|
local cosA = math.cos(A)
|
||||||
|
local sinA = math.sin(A)
|
||||||
|
local cosB = math.cos(B)
|
||||||
|
local sinB = math.sin(B)
|
||||||
|
|
||||||
|
-- theta goas around the cross-sectional circle of a torus
|
||||||
|
local theta = 0
|
||||||
|
while theta <= 2*math.pi do
|
||||||
|
if ( theta < 2*math.pi * 1/8 ) or ( theta > 2*math.pi * 7/8 ) then
|
||||||
|
theta = theta + (theta_spacing * 16)
|
||||||
|
else
|
||||||
|
theta = theta + theta_spacing
|
||||||
|
end
|
||||||
|
-- precompute sines and cosines of theta
|
||||||
|
local costheta = math.cos(theta)
|
||||||
|
local sintheta = math.sin(theta)
|
||||||
|
|
||||||
|
-- phi goes around the center of revolution of a torus
|
||||||
|
local phi = 0
|
||||||
|
while phi <= 2*math.pi do
|
||||||
|
if ( phi > 2*math.pi * 3/8 ) and ( phi < 2*math.pi * 5/8 ) then
|
||||||
|
phi = phi + (phi_spacing * 128)
|
||||||
|
else
|
||||||
|
phi = phi + phi_spacing
|
||||||
|
end
|
||||||
|
-- precompute sines and cosines of phi
|
||||||
|
local cosphi = math.cos(phi)
|
||||||
|
local sinphi = math.sin(phi)
|
||||||
|
|
||||||
|
-- 2D (x, y) coordinates of the circle, before revolving
|
||||||
|
local circlex = R2 + R1*costheta
|
||||||
|
local circley = R1*sintheta
|
||||||
|
|
||||||
|
-- 3D (x, y, z) coordinates after rotation
|
||||||
|
local x = circlex*(cosB*cosphi + sinA*sinB*sinphi) - circley*cosA*sinB
|
||||||
|
local y = circlex*(sinB*cosphi - sinA*cosB*sinphi) + circley*cosA*cosB
|
||||||
|
local z = K2 + cosA*circlex*sinphi + circley*sinA
|
||||||
|
|
||||||
|
local ooz = 1/z
|
||||||
|
|
||||||
|
-- x and y projection
|
||||||
|
local xp = math.floor(screen_width/2 + K1*ooz*x)
|
||||||
|
local yp = math.floor(screen_height/2 + K1*ooz*y)
|
||||||
|
|
||||||
|
-- calculate luminance
|
||||||
|
local L = cosphi*costheta*sinB - cosA*costheta*sinphi - sinA*sintheta + cosB*( cosA*sintheta - costheta*sinA*sinphi )
|
||||||
|
-- if (L > 0) then
|
||||||
|
if (true) then
|
||||||
|
if (ooz > zbuffer[yp][xp]) then
|
||||||
|
zbuffer[yp][xp] = ooz
|
||||||
|
local luminance = math.max( math.ceil( L * 180 ), 0 )
|
||||||
|
-- luminance is now in the range 0 to 255
|
||||||
|
r = math.ceil( (luminance + xp) / 2 )
|
||||||
|
g = math.ceil( (luminance + yp) / 2 )
|
||||||
|
b = math.ceil( (luminance + xp + yp) / 3 )
|
||||||
|
output[yp][xp] = { r, g, b }
|
||||||
|
end
|
||||||
|
end
|
||||||
|
end
|
||||||
|
end
|
||||||
|
end
|
||||||
|
|
||||||
|
dofile('init.lua')
|
||||||
|
|
||||||
|
render_frame(-0.7, 0.7)
|
||||||
|
tga_encoder.image(output):save("donut.tga")
|
181
mods/CORE/tga_encoder/examples.lua
Normal file
181
mods/CORE/tga_encoder/examples.lua
Normal file
@ -0,0 +1,181 @@
|
|||||||
|
dofile("init.lua")
|
||||||
|
|
||||||
|
-- encode a bitmap
|
||||||
|
local _ = { 0, 0, 0 }
|
||||||
|
local R = { 255, 127, 127 }
|
||||||
|
local pixels = {
|
||||||
|
{ _, _, _, _, _, _, _ },
|
||||||
|
{ _, _, _, R, _, _, _ },
|
||||||
|
{ _, _, R, R, R, _, _ },
|
||||||
|
{ _, R, R, R, R, R, _ },
|
||||||
|
{ _, R, R, R, R, R, _ },
|
||||||
|
{ _, _, R, _, R, _, _ },
|
||||||
|
{ _, _, _, _, _, _, _ },
|
||||||
|
}
|
||||||
|
tga_encoder.image(pixels):save("bitmap_small.tga")
|
||||||
|
|
||||||
|
-- test that image can be encoded
|
||||||
|
local bitmap_small_0 = tga_encoder.image(pixels)
|
||||||
|
bitmap_small_0:encode()
|
||||||
|
assert(191 == #bitmap_small_0.data)
|
||||||
|
|
||||||
|
-- test that imbage can be encoded with parameters
|
||||||
|
local bitmap_small_1 = tga_encoder.image(pixels)
|
||||||
|
bitmap_small_1:encode(
|
||||||
|
{
|
||||||
|
colormap = {},
|
||||||
|
color_format = "B8G8R8",
|
||||||
|
compression = "RAW",
|
||||||
|
}
|
||||||
|
)
|
||||||
|
assert(191 == #bitmap_small_1.data)
|
||||||
|
|
||||||
|
-- change a single pixel, then rescale the bitmap
|
||||||
|
local pixels_orig = pixels
|
||||||
|
pixels_orig[4][4] = { 255, 255, 255 }
|
||||||
|
local pixels = {}
|
||||||
|
for x = 1,56,1 do
|
||||||
|
local x_orig = math.ceil(x/8)
|
||||||
|
for z = 1,56,1 do
|
||||||
|
local z_orig = math.ceil(z/8)
|
||||||
|
local color = pixels_orig[z_orig][x_orig]
|
||||||
|
pixels[z] = pixels[z] or {}
|
||||||
|
pixels[z][x] = color
|
||||||
|
end
|
||||||
|
end
|
||||||
|
tga_encoder.image(pixels):save("bitmap_large.tga")
|
||||||
|
|
||||||
|
-- note that the uncompressed grayscale TGA file written in this
|
||||||
|
-- example is 80 bytes – but an optimized PNG file is 81 bytes …
|
||||||
|
local pixels = {}
|
||||||
|
for x = 1,6,1 do -- left to right
|
||||||
|
for z = 1,6,1 do -- bottom to top
|
||||||
|
local color = { math.min(x * z * 4 - 1, 255) }
|
||||||
|
pixels[z] = pixels[z] or {}
|
||||||
|
pixels[z][x] = color
|
||||||
|
end
|
||||||
|
end
|
||||||
|
tga_encoder.image(pixels):save("gradient_8bpp_raw.tga", {color_format="Y8", compression="RAW"})
|
||||||
|
|
||||||
|
local pixels = {}
|
||||||
|
for x = 1,16,1 do -- left to right
|
||||||
|
for z = 1,16,1 do -- bottom to top
|
||||||
|
local r = math.min(x * 32 - 1, 255)
|
||||||
|
local g = math.min(z * 32 - 1, 255)
|
||||||
|
local b = 0
|
||||||
|
-- blue rectangle in top right corner
|
||||||
|
if x > 8 and z > 8 then
|
||||||
|
r = 0
|
||||||
|
g = 0
|
||||||
|
b = math.min(z * 16 - 1, 255)
|
||||||
|
end
|
||||||
|
local color = { r, g, b }
|
||||||
|
pixels[z] = pixels[z] or {}
|
||||||
|
pixels[z][x] = color
|
||||||
|
end
|
||||||
|
end
|
||||||
|
local gradients = tga_encoder.image(pixels)
|
||||||
|
gradients:save("gradients_8bpp_raw.tga", {color_format="Y8", compression="RAW"})
|
||||||
|
gradients:save("gradients_16bpp_raw.tga", {color_format="A1R5G5B5", compression="RAW"})
|
||||||
|
gradients:save("gradients_16bpp_rle.tga", {color_format="A1R5G5B5", compression="RLE"})
|
||||||
|
gradients:save("gradients_24bpp_raw.tga", {color_format="B8G8R8", compression="RAW"})
|
||||||
|
gradients:save("gradients_24bpp_rle.tga", {color_format="B8G8R8", compression="RLE"})
|
||||||
|
|
||||||
|
for x = 1,16,1 do -- left to right
|
||||||
|
for z = 1,16,1 do -- bottom to top
|
||||||
|
local color = pixels[z][x]
|
||||||
|
color[#color+1] = ((x * x) + (z * z)) % 256
|
||||||
|
pixels[z][x] = color
|
||||||
|
end
|
||||||
|
end
|
||||||
|
gradients:save("gradients_32bpp_raw.tga", {color_format="B8G8R8A8", compression="RAW"})
|
||||||
|
-- the RLE-compressed file is larger than just dumping pixels because
|
||||||
|
-- the gradients in this picture can not be compressed well using RLE
|
||||||
|
gradients:save("gradients_32bpp_rle.tga", {color_format="B8G8R8A8", compression="RLE"})
|
||||||
|
|
||||||
|
local pixels = {}
|
||||||
|
for x = 1,512,1 do -- left to right
|
||||||
|
for z = 1,512,1 do -- bottom to top
|
||||||
|
local oz = (z - 256) / 256 + 0.75
|
||||||
|
local ox = (x - 256) / 256
|
||||||
|
local px, pz, i = 0, 0, 0
|
||||||
|
while (px * px) + (pz * pz) <= 4 and i < 128 do
|
||||||
|
px = (px * px) - (pz * pz) + oz
|
||||||
|
pz = (2 * px * pz) + ox
|
||||||
|
i = i + 1
|
||||||
|
end
|
||||||
|
local color = {
|
||||||
|
math.max(0, math.min(255, math.floor(px * 64))),
|
||||||
|
math.max(0, math.min(255, math.floor(pz * 64))),
|
||||||
|
math.max(0, math.min(255, math.floor(i))),
|
||||||
|
}
|
||||||
|
pixels[z] = pixels[z] or {}
|
||||||
|
pixels[z][x] = color
|
||||||
|
end
|
||||||
|
end
|
||||||
|
tga_encoder.image(pixels):save("fractal_8bpp.tga", {color_format="Y8"})
|
||||||
|
tga_encoder.image(pixels):save("fractal_16bpp.tga", {color_format="A1R5G5B5"})
|
||||||
|
tga_encoder.image(pixels):save("fractal_24bpp.tga", {color_format="B8G8R8"})
|
||||||
|
|
||||||
|
-- encode a colormapped bitmap
|
||||||
|
local K = { 0 }
|
||||||
|
local B = { 1 }
|
||||||
|
local R = { 2 }
|
||||||
|
local G = { 3 }
|
||||||
|
local W = { 4 }
|
||||||
|
local colormap = {
|
||||||
|
{ 1, 2, 3 }, -- K
|
||||||
|
{ 0, 0, 255 }, -- B
|
||||||
|
{ 255, 0, 0 }, -- R
|
||||||
|
{ 0, 255, 0 }, -- G
|
||||||
|
{ 253, 254, 255 }, -- W
|
||||||
|
}
|
||||||
|
local pixels = {
|
||||||
|
{ W, K, W, K, W, K, W },
|
||||||
|
{ R, G, B, R, G, B, K },
|
||||||
|
{ K, W, K, W, K, W, K },
|
||||||
|
{ G, B, R, G, B, R, W },
|
||||||
|
{ W, W, W, K, K, K, W },
|
||||||
|
{ B, R, G, B, R, G, K },
|
||||||
|
{ B, R, G, B, R, G, W },
|
||||||
|
}
|
||||||
|
-- note that the uncompressed colormapped TGA file written in this
|
||||||
|
-- example is 108 bytes – but an optimized PNG file is 121 bytes …
|
||||||
|
tga_encoder.image(pixels):save("colormapped_B8G8R8.tga", {colormap=colormap})
|
||||||
|
-- encoding as A1R5G5B5 saves 1 byte per palette entry → 103 bytes
|
||||||
|
tga_encoder.image(pixels):save("colormapped_A1R5G5B5.tga", {colormap=colormap, color_format="A1R5G5B5"})
|
||||||
|
|
||||||
|
-- encode a colormapped bitmap with transparency
|
||||||
|
local _ = { 0 }
|
||||||
|
local K = { 1 }
|
||||||
|
local W = { 2 }
|
||||||
|
local colormap = {
|
||||||
|
{ 0, 0, 0, 0 },
|
||||||
|
{ 0, 0, 0, 255 },
|
||||||
|
{ 255, 255, 255, 255 },
|
||||||
|
}
|
||||||
|
local pixels = {
|
||||||
|
{ _, K, K, K, K, K, _ },
|
||||||
|
{ _, K, W, W, W, K, _ },
|
||||||
|
{ K, K, W, W, W, K, K },
|
||||||
|
{ K, W, W, W, W, W, K },
|
||||||
|
{ _, K, W, W, W, K, _ },
|
||||||
|
{ _, _, K, W, K, _, _ },
|
||||||
|
{ _, _, _, K, _, _, _ },
|
||||||
|
}
|
||||||
|
tga_encoder.image(pixels):save("colormapped_B8G8R8A8.tga", {colormap=colormap})
|
||||||
|
|
||||||
|
-- encoding a colormapped image with illegal colormap indexes should error out
|
||||||
|
local colormap = {
|
||||||
|
{ 0, 0, 0, 0 },
|
||||||
|
{ 0, 0, 0, 255 },
|
||||||
|
}
|
||||||
|
local status, message = pcall(
|
||||||
|
function ()
|
||||||
|
tga_encoder.image(pixels):encode({colormap=colormap})
|
||||||
|
end
|
||||||
|
)
|
||||||
|
assert(
|
||||||
|
false == status and
|
||||||
|
"init.lua:36: colormap index 2 not in colormap of size 2" == message
|
||||||
|
)
|
628
mods/CORE/tga_encoder/init.lua
Normal file
628
mods/CORE/tga_encoder/init.lua
Normal file
@ -0,0 +1,628 @@
|
|||||||
|
tga_encoder = {}
|
||||||
|
|
||||||
|
local image = setmetatable({}, {
|
||||||
|
__call = function(self, ...)
|
||||||
|
local t = setmetatable({}, {__index = self})
|
||||||
|
t:constructor(...)
|
||||||
|
return t
|
||||||
|
end,
|
||||||
|
})
|
||||||
|
|
||||||
|
function image:constructor(pixels)
|
||||||
|
self.pixels = pixels
|
||||||
|
self.width = #pixels[1]
|
||||||
|
self.height = #pixels
|
||||||
|
end
|
||||||
|
|
||||||
|
local pixel_depth_by_color_format = {
|
||||||
|
["Y8"] = 8,
|
||||||
|
["A1R5G5B5"] = 16,
|
||||||
|
["B8G8R8"] = 24,
|
||||||
|
["B8G8R8A8"] = 32,
|
||||||
|
}
|
||||||
|
|
||||||
|
function image:encode_colormap_spec(properties)
|
||||||
|
local colormap = properties.colormap
|
||||||
|
local colormap_pixel_depth = 0
|
||||||
|
if 0 ~= #colormap then
|
||||||
|
colormap_pixel_depth = pixel_depth_by_color_format[
|
||||||
|
properties.color_format
|
||||||
|
]
|
||||||
|
-- ensure that each pixel references a legal colormap entry
|
||||||
|
for _, row in ipairs(self.pixels) do
|
||||||
|
for _, pixel in ipairs(row) do
|
||||||
|
local colormap_index = pixel[1]
|
||||||
|
if colormap_index >= #colormap then
|
||||||
|
error(
|
||||||
|
"colormap index " .. colormap_index ..
|
||||||
|
" not in colormap of size " .. #colormap
|
||||||
|
)
|
||||||
|
end
|
||||||
|
end
|
||||||
|
end
|
||||||
|
end
|
||||||
|
local colormap_spec =
|
||||||
|
string.char(0, 0) .. -- first entry index
|
||||||
|
string.char(#colormap % 256, math.floor(#colormap / 256)) .. -- number of entries
|
||||||
|
string.char(colormap_pixel_depth) -- bits per pixel
|
||||||
|
self.data = self.data .. colormap_spec
|
||||||
|
end
|
||||||
|
|
||||||
|
function image:encode_image_spec(properties)
|
||||||
|
local color_format = properties.color_format
|
||||||
|
assert(
|
||||||
|
"Y8" == color_format or -- (8 bit grayscale = 1 byte = 8 bits)
|
||||||
|
"A1R5G5B5" == color_format or -- (A1R5G5B5 = 2 bytes = 16 bits)
|
||||||
|
"B8G8R8" == color_format or -- (B8G8R8 = 3 bytes = 24 bits)
|
||||||
|
"B8G8R8A8" == color_format -- (B8G8R8A8 = 4 bytes = 32 bits)
|
||||||
|
)
|
||||||
|
local scanline_order = properties.scanline_order
|
||||||
|
assert (
|
||||||
|
"bottom-top" == scanline_order or
|
||||||
|
"top-bottom" == scanline_order
|
||||||
|
)
|
||||||
|
local pixel_depth
|
||||||
|
if 0 ~= #properties.colormap then
|
||||||
|
pixel_depth = self.pixel_depth
|
||||||
|
else
|
||||||
|
pixel_depth = pixel_depth_by_color_format[color_format]
|
||||||
|
end
|
||||||
|
assert( nil ~= pixel_depth)
|
||||||
|
-- the origin is the bottom left corner of the image (always)
|
||||||
|
local x_origin_lo = 0
|
||||||
|
local x_origin_hi = 0
|
||||||
|
local y_origin_lo = 0
|
||||||
|
local y_origin_hi = 0
|
||||||
|
local image_descriptor = 0 -- equal to bottom-top scanline order
|
||||||
|
local width_lo = self.width % 256
|
||||||
|
local width_hi = math.floor(self.width / 256)
|
||||||
|
local height_lo = self.height % 256
|
||||||
|
local height_hi = math.floor(self.height / 256)
|
||||||
|
if "top-bottom" == scanline_order then
|
||||||
|
image_descriptor = 32
|
||||||
|
y_origin_lo = height_lo
|
||||||
|
y_origin_hi = height_hi
|
||||||
|
end
|
||||||
|
self.data = self.data .. string.char (
|
||||||
|
x_origin_lo, x_origin_hi,
|
||||||
|
y_origin_lo, y_origin_hi,
|
||||||
|
width_lo, width_hi,
|
||||||
|
height_lo, height_hi,
|
||||||
|
pixel_depth,
|
||||||
|
image_descriptor
|
||||||
|
)
|
||||||
|
end
|
||||||
|
|
||||||
|
function image:encode_colormap(properties)
|
||||||
|
local colormap = properties.colormap
|
||||||
|
if 0 == #colormap then
|
||||||
|
return
|
||||||
|
end
|
||||||
|
local color_format = properties.color_format
|
||||||
|
assert (
|
||||||
|
"A1R5G5B5" == color_format or
|
||||||
|
"B8G8R8" == color_format or
|
||||||
|
"B8G8R8A8" == color_format
|
||||||
|
)
|
||||||
|
local colors = {}
|
||||||
|
if "A1R5G5B5" == color_format then
|
||||||
|
-- Sample depth rescaling is done according to the algorithm presented in:
|
||||||
|
-- <https://www.w3.org/TR/2003/REC-PNG-20031110/#13Sample-depth-rescaling>
|
||||||
|
local max_sample_in = math.pow(2, 8) - 1
|
||||||
|
local max_sample_out = math.pow(2, 5) - 1
|
||||||
|
for i = 1,#colormap,1 do
|
||||||
|
local color = colormap[i]
|
||||||
|
local colorword = 32768 +
|
||||||
|
((math.floor((color[1] * max_sample_out / max_sample_in) + 0.5)) * 1024) +
|
||||||
|
((math.floor((color[2] * max_sample_out / max_sample_in) + 0.5)) * 32) +
|
||||||
|
((math.floor((color[3] * max_sample_out / max_sample_in) + 0.5)) * 1)
|
||||||
|
local color_bytes = string.char(
|
||||||
|
colorword % 256,
|
||||||
|
math.floor(colorword / 256)
|
||||||
|
)
|
||||||
|
colors[#colors + 1] = color_bytes
|
||||||
|
end
|
||||||
|
elseif "B8G8R8" == color_format then
|
||||||
|
for i = 1,#colormap,1 do
|
||||||
|
local color = colormap[i]
|
||||||
|
local color_bytes = string.char(
|
||||||
|
color[3], -- B
|
||||||
|
color[2], -- G
|
||||||
|
color[1] -- R
|
||||||
|
)
|
||||||
|
colors[#colors + 1] = color_bytes
|
||||||
|
end
|
||||||
|
elseif "B8G8R8A8" == color_format then
|
||||||
|
for i = 1,#colormap,1 do
|
||||||
|
local color = colormap[i]
|
||||||
|
local color_bytes = string.char(
|
||||||
|
color[3], -- B
|
||||||
|
color[2], -- G
|
||||||
|
color[1], -- R
|
||||||
|
color[4] -- A
|
||||||
|
)
|
||||||
|
colors[#colors + 1] = color_bytes
|
||||||
|
end
|
||||||
|
end
|
||||||
|
assert( 0 ~= #colors )
|
||||||
|
self.data = self.data .. table.concat(colors)
|
||||||
|
end
|
||||||
|
|
||||||
|
function image:encode_header(properties)
|
||||||
|
local color_format = properties.color_format
|
||||||
|
local colormap = properties.colormap
|
||||||
|
local compression = properties.compression
|
||||||
|
local colormap_type
|
||||||
|
local image_type
|
||||||
|
if "Y8" == color_format and "RAW" == compression then
|
||||||
|
colormap_type = 0
|
||||||
|
image_type = 3 -- grayscale
|
||||||
|
elseif (
|
||||||
|
"A1R5G5B5" == color_format or
|
||||||
|
"B8G8R8" == color_format or
|
||||||
|
"B8G8R8A8" == color_format
|
||||||
|
) then
|
||||||
|
if "RAW" == compression then
|
||||||
|
if 0 ~= #colormap then
|
||||||
|
colormap_type = 1
|
||||||
|
image_type = 1 -- colormapped RGB(A)
|
||||||
|
else
|
||||||
|
colormap_type = 0
|
||||||
|
image_type = 2 -- RAW RGB(A)
|
||||||
|
end
|
||||||
|
elseif "RLE" == compression then
|
||||||
|
colormap_type = 0
|
||||||
|
image_type = 10 -- RLE RGB
|
||||||
|
end
|
||||||
|
end
|
||||||
|
assert( nil ~= colormap_type )
|
||||||
|
assert( nil ~= image_type )
|
||||||
|
self.data = self.data
|
||||||
|
.. string.char(0) -- image id
|
||||||
|
.. string.char(colormap_type)
|
||||||
|
.. string.char(image_type)
|
||||||
|
self:encode_colormap_spec(properties) -- color map specification
|
||||||
|
self:encode_image_spec(properties) -- image specification
|
||||||
|
self:encode_colormap(properties)
|
||||||
|
end
|
||||||
|
|
||||||
|
function image:encode_data(properties)
|
||||||
|
local color_format = properties.color_format
|
||||||
|
local colormap = properties.colormap
|
||||||
|
local compression = properties.compression
|
||||||
|
|
||||||
|
local data_length_before = #self.data
|
||||||
|
if "Y8" == color_format and "RAW" == compression then
|
||||||
|
if 8 == self.pixel_depth then
|
||||||
|
self:encode_data_Y8_as_Y8_raw()
|
||||||
|
elseif 24 == self.pixel_depth then
|
||||||
|
self:encode_data_R8G8B8_as_Y8_raw()
|
||||||
|
end
|
||||||
|
elseif "A1R5G5B5" == color_format then
|
||||||
|
if 0 ~= #colormap then
|
||||||
|
if "RAW" == compression then
|
||||||
|
if 8 == self.pixel_depth then
|
||||||
|
self:encode_data_Y8_as_Y8_raw()
|
||||||
|
end
|
||||||
|
end
|
||||||
|
else
|
||||||
|
if "RAW" == compression then
|
||||||
|
self:encode_data_R8G8B8_as_A1R5G5B5_raw()
|
||||||
|
elseif "RLE" == compression then
|
||||||
|
self:encode_data_R8G8B8_as_A1R5G5B5_rle()
|
||||||
|
end
|
||||||
|
end
|
||||||
|
elseif "B8G8R8" == color_format then
|
||||||
|
if 0 ~= #colormap then
|
||||||
|
if "RAW" == compression then
|
||||||
|
if 8 == self.pixel_depth then
|
||||||
|
self:encode_data_Y8_as_Y8_raw()
|
||||||
|
end
|
||||||
|
end
|
||||||
|
else
|
||||||
|
if "RAW" == compression then
|
||||||
|
self:encode_data_R8G8B8_as_B8G8R8_raw()
|
||||||
|
elseif "RLE" == compression then
|
||||||
|
self:encode_data_R8G8B8_as_B8G8R8_rle()
|
||||||
|
end
|
||||||
|
end
|
||||||
|
elseif "B8G8R8A8" == color_format then
|
||||||
|
if 0 ~= #colormap then
|
||||||
|
if "RAW" == compression then
|
||||||
|
if 8 == self.pixel_depth then
|
||||||
|
self:encode_data_Y8_as_Y8_raw()
|
||||||
|
end
|
||||||
|
end
|
||||||
|
else
|
||||||
|
if "RAW" == compression then
|
||||||
|
self:encode_data_R8G8B8A8_as_B8G8R8A8_raw()
|
||||||
|
elseif "RLE" == compression then
|
||||||
|
self:encode_data_R8G8B8A8_as_B8G8R8A8_rle()
|
||||||
|
end
|
||||||
|
end
|
||||||
|
end
|
||||||
|
local data_length_after = #self.data
|
||||||
|
assert(
|
||||||
|
data_length_after ~= data_length_before,
|
||||||
|
"No data encoded for color format: " .. color_format
|
||||||
|
)
|
||||||
|
end
|
||||||
|
|
||||||
|
function image:encode_data_Y8_as_Y8_raw()
|
||||||
|
assert(8 == self.pixel_depth)
|
||||||
|
local raw_pixels = {}
|
||||||
|
for _, row in ipairs(self.pixels) do
|
||||||
|
for _, pixel in ipairs(row) do
|
||||||
|
local raw_pixel = string.char(pixel[1])
|
||||||
|
raw_pixels[#raw_pixels + 1] = raw_pixel
|
||||||
|
end
|
||||||
|
end
|
||||||
|
self.data = self.data .. table.concat(raw_pixels)
|
||||||
|
end
|
||||||
|
|
||||||
|
function image:encode_data_R8G8B8_as_Y8_raw()
|
||||||
|
assert(24 == self.pixel_depth)
|
||||||
|
local raw_pixels = {}
|
||||||
|
for _, row in ipairs(self.pixels) do
|
||||||
|
for _, pixel in ipairs(row) do
|
||||||
|
-- the HSP RGB to brightness formula is
|
||||||
|
-- sqrt( 0.299 r² + .587 g² + .114 b² )
|
||||||
|
-- see <https://alienryderflex.com/hsp.html>
|
||||||
|
local gray = math.floor(
|
||||||
|
math.sqrt(
|
||||||
|
0.299 * pixel[1]^2 +
|
||||||
|
0.587 * pixel[2]^2 +
|
||||||
|
0.114 * pixel[3]^2
|
||||||
|
) + 0.5
|
||||||
|
)
|
||||||
|
local raw_pixel = string.char(gray)
|
||||||
|
raw_pixels[#raw_pixels + 1] = raw_pixel
|
||||||
|
end
|
||||||
|
end
|
||||||
|
self.data = self.data .. table.concat(raw_pixels)
|
||||||
|
end
|
||||||
|
|
||||||
|
function image:encode_data_R8G8B8_as_A1R5G5B5_raw()
|
||||||
|
assert(24 == self.pixel_depth)
|
||||||
|
local raw_pixels = {}
|
||||||
|
-- Sample depth rescaling is done according to the algorithm presented in:
|
||||||
|
-- <https://www.w3.org/TR/2003/REC-PNG-20031110/#13Sample-depth-rescaling>
|
||||||
|
local max_sample_in = math.pow(2, 8) - 1
|
||||||
|
local max_sample_out = math.pow(2, 5) - 1
|
||||||
|
for _, row in ipairs(self.pixels) do
|
||||||
|
for _, pixel in ipairs(row) do
|
||||||
|
local colorword = 32768 +
|
||||||
|
((math.floor((pixel[1] * max_sample_out / max_sample_in) + 0.5)) * 1024) +
|
||||||
|
((math.floor((pixel[2] * max_sample_out / max_sample_in) + 0.5)) * 32) +
|
||||||
|
((math.floor((pixel[3] * max_sample_out / max_sample_in) + 0.5)) * 1)
|
||||||
|
local raw_pixel = string.char(colorword % 256, math.floor(colorword / 256))
|
||||||
|
raw_pixels[#raw_pixels + 1] = raw_pixel
|
||||||
|
end
|
||||||
|
end
|
||||||
|
self.data = self.data .. table.concat(raw_pixels)
|
||||||
|
end
|
||||||
|
|
||||||
|
function image:encode_data_R8G8B8_as_A1R5G5B5_rle()
|
||||||
|
assert(24 == self.pixel_depth)
|
||||||
|
local colorword = nil
|
||||||
|
local previous_r = nil
|
||||||
|
local previous_g = nil
|
||||||
|
local previous_b = nil
|
||||||
|
local raw_pixel = ''
|
||||||
|
local raw_pixels = {}
|
||||||
|
local count = 1
|
||||||
|
local packets = {}
|
||||||
|
local raw_packet = ''
|
||||||
|
local rle_packet = ''
|
||||||
|
-- Sample depth rescaling is done according to the algorithm presented in:
|
||||||
|
-- <https://www.w3.org/TR/2003/REC-PNG-20031110/#13Sample-depth-rescaling>
|
||||||
|
local max_sample_in = math.pow(2, 8) - 1
|
||||||
|
local max_sample_out = math.pow(2, 5) - 1
|
||||||
|
for _, row in ipairs(self.pixels) do
|
||||||
|
for _, pixel in ipairs(row) do
|
||||||
|
if pixel[1] ~= previous_r or pixel[2] ~= previous_g or pixel[3] ~= previous_b or count == 128 then
|
||||||
|
if nil ~= previous_r then
|
||||||
|
colorword = 32768 +
|
||||||
|
((math.floor((previous_r * max_sample_out / max_sample_in) + 0.5)) * 1024) +
|
||||||
|
((math.floor((previous_g * max_sample_out / max_sample_in) + 0.5)) * 32) +
|
||||||
|
((math.floor((previous_b * max_sample_out / max_sample_in) + 0.5)) * 1)
|
||||||
|
if 1 == count then
|
||||||
|
-- remember pixel verbatim for raw encoding
|
||||||
|
raw_pixel = string.char(colorword % 256, math.floor(colorword / 256))
|
||||||
|
raw_pixels[#raw_pixels + 1] = raw_pixel
|
||||||
|
if 128 == #raw_pixels then
|
||||||
|
raw_packet = string.char(#raw_pixels - 1)
|
||||||
|
packets[#packets + 1] = raw_packet
|
||||||
|
for i=1, #raw_pixels do
|
||||||
|
packets[#packets +1] = raw_pixels[i]
|
||||||
|
end
|
||||||
|
raw_pixels = {}
|
||||||
|
end
|
||||||
|
else
|
||||||
|
-- encode raw pixels, if any
|
||||||
|
if #raw_pixels > 0 then
|
||||||
|
raw_packet = string.char(#raw_pixels - 1)
|
||||||
|
packets[#packets + 1] = raw_packet
|
||||||
|
for i=1, #raw_pixels do
|
||||||
|
packets[#packets +1] = raw_pixels[i]
|
||||||
|
end
|
||||||
|
raw_pixels = {}
|
||||||
|
end
|
||||||
|
-- RLE encoding
|
||||||
|
rle_packet = string.char(128 + count - 1, colorword % 256, math.floor(colorword / 256))
|
||||||
|
packets[#packets +1] = rle_packet
|
||||||
|
end
|
||||||
|
end
|
||||||
|
count = 1
|
||||||
|
previous_r = pixel[1]
|
||||||
|
previous_g = pixel[2]
|
||||||
|
previous_b = pixel[3]
|
||||||
|
else
|
||||||
|
count = count + 1
|
||||||
|
end
|
||||||
|
end
|
||||||
|
end
|
||||||
|
colorword = 32768 +
|
||||||
|
((math.floor((previous_r * max_sample_out / max_sample_in) + 0.5)) * 1024) +
|
||||||
|
((math.floor((previous_g * max_sample_out / max_sample_in) + 0.5)) * 32) +
|
||||||
|
((math.floor((previous_b * max_sample_out / max_sample_in) + 0.5)) * 1)
|
||||||
|
if 1 == count then
|
||||||
|
raw_pixel = string.char(colorword % 256, math.floor(colorword / 256))
|
||||||
|
raw_pixels[#raw_pixels + 1] = raw_pixel
|
||||||
|
raw_packet = string.char(#raw_pixels - 1)
|
||||||
|
packets[#packets + 1] = raw_packet
|
||||||
|
for i=1, #raw_pixels do
|
||||||
|
packets[#packets +1] = raw_pixels[i]
|
||||||
|
end
|
||||||
|
raw_pixels = {}
|
||||||
|
else
|
||||||
|
-- encode raw pixels, if any
|
||||||
|
if #raw_pixels > 0 then
|
||||||
|
raw_packet = string.char(#raw_pixels - 1)
|
||||||
|
packets[#packets + 1] = raw_packet
|
||||||
|
for i=1, #raw_pixels do
|
||||||
|
packets[#packets +1] = raw_pixels[i]
|
||||||
|
end
|
||||||
|
raw_pixels = {}
|
||||||
|
end
|
||||||
|
-- RLE encoding
|
||||||
|
rle_packet = string.char(128 + count - 1, colorword % 256, math.floor(colorword / 256))
|
||||||
|
packets[#packets +1] = rle_packet
|
||||||
|
end
|
||||||
|
self.data = self.data .. table.concat(packets)
|
||||||
|
end
|
||||||
|
|
||||||
|
function image:encode_data_R8G8B8_as_B8G8R8_raw()
|
||||||
|
assert(24 == self.pixel_depth)
|
||||||
|
local raw_pixels = {}
|
||||||
|
for _, row in ipairs(self.pixels) do
|
||||||
|
for _, pixel in ipairs(row) do
|
||||||
|
local raw_pixel = string.char(pixel[3], pixel[2], pixel[1])
|
||||||
|
raw_pixels[#raw_pixels + 1] = raw_pixel
|
||||||
|
end
|
||||||
|
end
|
||||||
|
self.data = self.data .. table.concat(raw_pixels)
|
||||||
|
end
|
||||||
|
|
||||||
|
function image:encode_data_R8G8B8_as_B8G8R8_rle()
|
||||||
|
assert(24 == self.pixel_depth)
|
||||||
|
local previous_r = nil
|
||||||
|
local previous_g = nil
|
||||||
|
local previous_b = nil
|
||||||
|
local raw_pixel = ''
|
||||||
|
local raw_pixels = {}
|
||||||
|
local count = 1
|
||||||
|
local packets = {}
|
||||||
|
local raw_packet = ''
|
||||||
|
local rle_packet = ''
|
||||||
|
for _, row in ipairs(self.pixels) do
|
||||||
|
for _, pixel in ipairs(row) do
|
||||||
|
if pixel[1] ~= previous_r or pixel[2] ~= previous_g or pixel[3] ~= previous_b or count == 128 then
|
||||||
|
if nil ~= previous_r then
|
||||||
|
if 1 == count then
|
||||||
|
-- remember pixel verbatim for raw encoding
|
||||||
|
raw_pixel = string.char(previous_b, previous_g, previous_r)
|
||||||
|
raw_pixels[#raw_pixels + 1] = raw_pixel
|
||||||
|
if 128 == #raw_pixels then
|
||||||
|
raw_packet = string.char(#raw_pixels - 1)
|
||||||
|
packets[#packets + 1] = raw_packet
|
||||||
|
for i=1, #raw_pixels do
|
||||||
|
packets[#packets +1] = raw_pixels[i]
|
||||||
|
end
|
||||||
|
raw_pixels = {}
|
||||||
|
end
|
||||||
|
else
|
||||||
|
-- encode raw pixels, if any
|
||||||
|
if #raw_pixels > 0 then
|
||||||
|
raw_packet = string.char(#raw_pixels - 1)
|
||||||
|
packets[#packets + 1] = raw_packet
|
||||||
|
for i=1, #raw_pixels do
|
||||||
|
packets[#packets +1] = raw_pixels[i]
|
||||||
|
end
|
||||||
|
raw_pixels = {}
|
||||||
|
end
|
||||||
|
-- RLE encoding
|
||||||
|
rle_packet = string.char(128 + count - 1, previous_b, previous_g, previous_r)
|
||||||
|
packets[#packets +1] = rle_packet
|
||||||
|
end
|
||||||
|
end
|
||||||
|
count = 1
|
||||||
|
previous_r = pixel[1]
|
||||||
|
previous_g = pixel[2]
|
||||||
|
previous_b = pixel[3]
|
||||||
|
else
|
||||||
|
count = count + 1
|
||||||
|
end
|
||||||
|
end
|
||||||
|
end
|
||||||
|
if 1 == count then
|
||||||
|
raw_pixel = string.char(previous_b, previous_g, previous_r)
|
||||||
|
raw_pixels[#raw_pixels + 1] = raw_pixel
|
||||||
|
raw_packet = string.char(#raw_pixels - 1)
|
||||||
|
packets[#packets + 1] = raw_packet
|
||||||
|
for i=1, #raw_pixels do
|
||||||
|
packets[#packets +1] = raw_pixels[i]
|
||||||
|
end
|
||||||
|
raw_pixels = {}
|
||||||
|
else
|
||||||
|
-- encode raw pixels, if any
|
||||||
|
if #raw_pixels > 0 then
|
||||||
|
raw_packet = string.char(#raw_pixels - 1)
|
||||||
|
packets[#packets + 1] = raw_packet
|
||||||
|
for i=1, #raw_pixels do
|
||||||
|
packets[#packets +1] = raw_pixels[i]
|
||||||
|
end
|
||||||
|
raw_pixels = {}
|
||||||
|
end
|
||||||
|
-- RLE encoding
|
||||||
|
rle_packet = string.char(128 + count - 1, previous_b, previous_g, previous_r)
|
||||||
|
packets[#packets +1] = rle_packet
|
||||||
|
end
|
||||||
|
self.data = self.data .. table.concat(packets)
|
||||||
|
end
|
||||||
|
|
||||||
|
function image:encode_data_R8G8B8A8_as_B8G8R8A8_raw()
|
||||||
|
assert(32 == self.pixel_depth)
|
||||||
|
local raw_pixels = {}
|
||||||
|
for _, row in ipairs(self.pixels) do
|
||||||
|
for _, pixel in ipairs(row) do
|
||||||
|
local raw_pixel = string.char(pixel[3], pixel[2], pixel[1], pixel[4])
|
||||||
|
raw_pixels[#raw_pixels + 1] = raw_pixel
|
||||||
|
end
|
||||||
|
end
|
||||||
|
self.data = self.data .. table.concat(raw_pixels)
|
||||||
|
end
|
||||||
|
|
||||||
|
function image:encode_data_R8G8B8A8_as_B8G8R8A8_rle()
|
||||||
|
assert(32 == self.pixel_depth)
|
||||||
|
local previous_r = nil
|
||||||
|
local previous_g = nil
|
||||||
|
local previous_b = nil
|
||||||
|
local previous_a = nil
|
||||||
|
local raw_pixel = ''
|
||||||
|
local raw_pixels = {}
|
||||||
|
local count = 1
|
||||||
|
local packets = {}
|
||||||
|
local raw_packet = ''
|
||||||
|
local rle_packet = ''
|
||||||
|
for _, row in ipairs(self.pixels) do
|
||||||
|
for _, pixel in ipairs(row) do
|
||||||
|
if pixel[1] ~= previous_r or pixel[2] ~= previous_g or pixel[3] ~= previous_b or pixel[4] ~= previous_a or count == 128 then
|
||||||
|
if nil ~= previous_r then
|
||||||
|
if 1 == count then
|
||||||
|
-- remember pixel verbatim for raw encoding
|
||||||
|
raw_pixel = string.char(previous_b, previous_g, previous_r, previous_a)
|
||||||
|
raw_pixels[#raw_pixels + 1] = raw_pixel
|
||||||
|
if 128 == #raw_pixels then
|
||||||
|
raw_packet = string.char(#raw_pixels - 1)
|
||||||
|
packets[#packets + 1] = raw_packet
|
||||||
|
for i=1, #raw_pixels do
|
||||||
|
packets[#packets +1] = raw_pixels[i]
|
||||||
|
end
|
||||||
|
raw_pixels = {}
|
||||||
|
end
|
||||||
|
else
|
||||||
|
-- encode raw pixels, if any
|
||||||
|
if #raw_pixels > 0 then
|
||||||
|
raw_packet = string.char(#raw_pixels - 1)
|
||||||
|
packets[#packets + 1] = raw_packet
|
||||||
|
for i=1, #raw_pixels do
|
||||||
|
packets[#packets +1] = raw_pixels[i]
|
||||||
|
end
|
||||||
|
raw_pixels = {}
|
||||||
|
end
|
||||||
|
-- RLE encoding
|
||||||
|
rle_packet = string.char(128 + count - 1, previous_b, previous_g, previous_r, previous_a)
|
||||||
|
packets[#packets +1] = rle_packet
|
||||||
|
end
|
||||||
|
end
|
||||||
|
count = 1
|
||||||
|
previous_r = pixel[1]
|
||||||
|
previous_g = pixel[2]
|
||||||
|
previous_b = pixel[3]
|
||||||
|
previous_a = pixel[4]
|
||||||
|
else
|
||||||
|
count = count + 1
|
||||||
|
end
|
||||||
|
end
|
||||||
|
end
|
||||||
|
if 1 == count then
|
||||||
|
raw_pixel = string.char(previous_b, previous_g, previous_r, previous_a)
|
||||||
|
raw_pixels[#raw_pixels + 1] = raw_pixel
|
||||||
|
raw_packet = string.char(#raw_pixels - 1)
|
||||||
|
packets[#packets + 1] = raw_packet
|
||||||
|
for i=1, #raw_pixels do
|
||||||
|
packets[#packets +1] = raw_pixels[i]
|
||||||
|
end
|
||||||
|
raw_pixels = {}
|
||||||
|
else
|
||||||
|
-- encode raw pixels, if any
|
||||||
|
if #raw_pixels > 0 then
|
||||||
|
raw_packet = string.char(#raw_pixels - 1)
|
||||||
|
packets[#packets + 1] = raw_packet
|
||||||
|
for i=1, #raw_pixels do
|
||||||
|
packets[#packets +1] = raw_pixels[i]
|
||||||
|
end
|
||||||
|
raw_pixels = {}
|
||||||
|
end
|
||||||
|
-- RLE encoding
|
||||||
|
rle_packet = string.char(128 + count - 1, previous_b, previous_g, previous_r, previous_a)
|
||||||
|
packets[#packets +1] = rle_packet
|
||||||
|
end
|
||||||
|
self.data = self.data .. table.concat(packets)
|
||||||
|
end
|
||||||
|
|
||||||
|
function image:encode_footer()
|
||||||
|
self.data = self.data
|
||||||
|
.. string.char(0, 0, 0, 0) -- extension area offset
|
||||||
|
.. string.char(0, 0, 0, 0) -- developer area offset
|
||||||
|
.. "TRUEVISION-XFILE"
|
||||||
|
.. "."
|
||||||
|
.. string.char(0)
|
||||||
|
end
|
||||||
|
|
||||||
|
function image:encode(properties)
|
||||||
|
local properties = properties or {}
|
||||||
|
properties.colormap = properties.colormap or {}
|
||||||
|
properties.compression = properties.compression or "RAW"
|
||||||
|
properties.scanline_order = properties.scanline_order or "bottom-top"
|
||||||
|
|
||||||
|
self.pixel_depth = #self.pixels[1][1] * 8
|
||||||
|
|
||||||
|
local color_format_defaults_by_pixel_depth = {
|
||||||
|
[8] = "Y8",
|
||||||
|
[24] = "B8G8R8",
|
||||||
|
[32] = "B8G8R8A8",
|
||||||
|
}
|
||||||
|
if nil == properties.color_format then
|
||||||
|
if 0 ~= #properties.colormap then
|
||||||
|
properties.color_format =
|
||||||
|
color_format_defaults_by_pixel_depth[
|
||||||
|
#properties.colormap[1] * 8
|
||||||
|
]
|
||||||
|
else
|
||||||
|
properties.color_format =
|
||||||
|
color_format_defaults_by_pixel_depth[
|
||||||
|
self.pixel_depth
|
||||||
|
]
|
||||||
|
end
|
||||||
|
end
|
||||||
|
assert( nil ~= properties.color_format )
|
||||||
|
|
||||||
|
self.data = ""
|
||||||
|
self:encode_header(properties) -- header
|
||||||
|
-- no color map and image id data
|
||||||
|
self:encode_data(properties) -- encode data
|
||||||
|
-- no extension or developer area
|
||||||
|
self:encode_footer() -- footer
|
||||||
|
end
|
||||||
|
|
||||||
|
function image:save(filename, properties)
|
||||||
|
self:encode(properties)
|
||||||
|
|
||||||
|
local f = assert(io.open(filename, "wb"))
|
||||||
|
f:write(self.data)
|
||||||
|
f:close()
|
||||||
|
end
|
||||||
|
|
||||||
|
tga_encoder.image = image
|
51
mods/CORE/tga_encoder/logo.lua
Normal file
51
mods/CORE/tga_encoder/logo.lua
Normal file
@ -0,0 +1,51 @@
|
|||||||
|
dofile("init.lua")
|
||||||
|
|
||||||
|
local colormap = {
|
||||||
|
{ 0, 0, 0 }, -- black
|
||||||
|
{ 255, 255, 255 }, -- white
|
||||||
|
{ 255, 0, 0 }, -- red
|
||||||
|
{ 0, 255, 0 }, -- green
|
||||||
|
{ 0, 0, 255 }, -- blue
|
||||||
|
}
|
||||||
|
|
||||||
|
local _ = { 0 }
|
||||||
|
local W = { 1 }
|
||||||
|
local R = { 2 }
|
||||||
|
local G = { 3 }
|
||||||
|
local B = { 4 }
|
||||||
|
|
||||||
|
local pixels_tiny = {
|
||||||
|
{ W, W, W, W, W, W, W, W, W, W, W, W, },
|
||||||
|
{ W, _, _, _, _, _, _, _, _, _, _, W, },
|
||||||
|
{ W, _, _, _, _, _, _, B, _, B, _, W, },
|
||||||
|
{ W, _, _, _, _, _, _, B, B, B, _, W, },
|
||||||
|
{ W, _, _, _, G, G, G, B, _, B, _, W, },
|
||||||
|
{ W, _, _, _, G, _, G, B, B, B, _, W, },
|
||||||
|
{ W, _, _, R, G, _, _, _, _, _, _, W, },
|
||||||
|
{ W, _, _, R, G, G, G, _, _, _, _, W, },
|
||||||
|
{ W, _, _, R, _, _, _, _, _, _, _, W, },
|
||||||
|
{ W, _, R, R, R, _, _, _, _, _, _, W, },
|
||||||
|
{ W, _, _, _, _, _, _, _, _, _, _, W, },
|
||||||
|
{ W, W, W, W, W, W, W, W, W, W, W, W, },
|
||||||
|
}
|
||||||
|
|
||||||
|
local pixels_huge = {}
|
||||||
|
|
||||||
|
local size_tiny = #pixels_tiny
|
||||||
|
local size_huge = 1200
|
||||||
|
local scale = size_huge / size_tiny
|
||||||
|
|
||||||
|
for x_huge = 1,size_huge,1 do
|
||||||
|
local x_tiny = math.ceil( x_huge / scale )
|
||||||
|
for z_huge = 1,size_huge,1 do
|
||||||
|
local z_tiny = math.ceil( z_huge / scale )
|
||||||
|
if nil == pixels_huge[z_huge] then
|
||||||
|
pixels_huge[z_huge] = {}
|
||||||
|
end
|
||||||
|
pixels_huge[z_huge][x_huge] = pixels_tiny[z_tiny][x_tiny]
|
||||||
|
end
|
||||||
|
end
|
||||||
|
|
||||||
|
tga_encoder.image(pixels_tiny):save("logo_tiny.tga", {colormap=colormap})
|
||||||
|
tga_encoder.image(pixels_huge):save("logo_huge.tga", {colormap=colormap})
|
||||||
|
|
2
mods/CORE/tga_encoder/mod.conf
Normal file
2
mods/CORE/tga_encoder/mod.conf
Normal file
@ -0,0 +1,2 @@
|
|||||||
|
name = tga_encoder
|
||||||
|
description = A TGA Encoder written in Lua without the use of external Libraries.
|
180
mods/CORE/tga_encoder/tools/generate_test_textures.lua
Executable file
180
mods/CORE/tga_encoder/tools/generate_test_textures.lua
Executable file
@ -0,0 +1,180 @@
|
|||||||
|
#!/usr/bin/env lua5.1
|
||||||
|
dofile("../init.lua")
|
||||||
|
|
||||||
|
local _ = { 0 }
|
||||||
|
local R = { 1 }
|
||||||
|
local G = { 2 }
|
||||||
|
local B = { 3 }
|
||||||
|
|
||||||
|
local pixels_colormapped_bt = {
|
||||||
|
{ _, _, _, _, _, B, _, B, },
|
||||||
|
{ _, _, _, _, _, B, B, B, },
|
||||||
|
{ _, _, G, G, G, B, _, B, },
|
||||||
|
{ _, _, G, _, G, B, B, B, },
|
||||||
|
{ _, R, G, _, _, _, _, _, },
|
||||||
|
{ _, R, G, G, G, _, _, _, },
|
||||||
|
{ _, R, _, _, _, _, _, _, },
|
||||||
|
{ R, R, R, _, _, _, _, _, },
|
||||||
|
}
|
||||||
|
|
||||||
|
local pixels_colormapped_tb = {
|
||||||
|
{ R, R, R, _, _, _, _, _, },
|
||||||
|
{ _, R, _, _, _, _, _, _, },
|
||||||
|
{ _, R, G, G, G, _, _, _, },
|
||||||
|
{ _, R, G, _, _, _, _, _, },
|
||||||
|
{ _, _, G, _, G, B, B, B, },
|
||||||
|
{ _, _, G, G, G, B, _, B, },
|
||||||
|
{ _, _, _, _, _, B, B, B, },
|
||||||
|
{ _, _, _, _, _, B, _, B, },
|
||||||
|
}
|
||||||
|
|
||||||
|
image_colormapped_bt = tga_encoder.image(pixels_colormapped_bt)
|
||||||
|
image_colormapped_tb = tga_encoder.image(pixels_colormapped_tb)
|
||||||
|
|
||||||
|
colormap_32bpp = {
|
||||||
|
{ 0, 0, 0, 128 },
|
||||||
|
{ 255, 0, 0, 255 },
|
||||||
|
{ 0, 255, 0, 255 },
|
||||||
|
{ 0, 0, 255, 255 },
|
||||||
|
}
|
||||||
|
image_colormapped_bt:save(
|
||||||
|
"type1_32bpp_bt.tga",
|
||||||
|
{ colormap = colormap_32bpp, color_format = "B8G8R8A8", scanline_order = "bottom-top" }
|
||||||
|
)
|
||||||
|
image_colormapped_tb:save(
|
||||||
|
"type1_32bpp_tb.tga",
|
||||||
|
{ colormap = colormap_32bpp, color_format = "B8G8R8A8", scanline_order = "top-bottom" }
|
||||||
|
)
|
||||||
|
image_colormapped_bt:save(
|
||||||
|
"type1_16bpp_bt.tga",
|
||||||
|
{ colormap = colormap_32bpp, color_format = "A1R5G5B5", scanline_order = "bottom-top" }
|
||||||
|
)
|
||||||
|
image_colormapped_tb:save(
|
||||||
|
"type1_16bpp_tb.tga",
|
||||||
|
{ colormap = colormap_32bpp, color_format = "A1R5G5B5", scanline_order = "top-bottom" }
|
||||||
|
)
|
||||||
|
|
||||||
|
colormap_24bpp = {
|
||||||
|
{ 0, 0, 0 },
|
||||||
|
{ 255, 0, 0 },
|
||||||
|
{ 0, 255, 0 },
|
||||||
|
{ 0, 0, 255 },
|
||||||
|
}
|
||||||
|
image_colormapped_bt:save(
|
||||||
|
"type1_24bpp_bt.tga",
|
||||||
|
{ colormap = colormap_32bpp, color_format = "B8G8R8", scanline_order = "bottom-top" }
|
||||||
|
)
|
||||||
|
image_colormapped_tb:save(
|
||||||
|
"type1_24bpp_tb.tga",
|
||||||
|
{ colormap = colormap_32bpp, color_format = "B8G8R8", scanline_order = "top-bottom" }
|
||||||
|
)
|
||||||
|
|
||||||
|
local _ = { 0, 0, 0, 128 }
|
||||||
|
local R = { 255, 0, 0, 255 }
|
||||||
|
local G = { 0, 255, 0, 255 }
|
||||||
|
local B = { 0, 0, 255, 255 }
|
||||||
|
|
||||||
|
local pixels_rgba_bt = {
|
||||||
|
{ _, _, _, _, _, B, _, B, },
|
||||||
|
{ _, _, _, _, _, B, B, B, },
|
||||||
|
{ _, _, G, G, G, B, _, B, },
|
||||||
|
{ _, _, G, _, G, B, B, B, },
|
||||||
|
{ _, R, G, _, _, _, _, _, },
|
||||||
|
{ _, R, G, G, G, _, _, _, },
|
||||||
|
{ _, R, _, _, _, _, _, _, },
|
||||||
|
{ R, R, R, _, _, _, _, _, },
|
||||||
|
}
|
||||||
|
|
||||||
|
local pixels_rgba_tb = {
|
||||||
|
{ R, R, R, _, _, _, _, _, },
|
||||||
|
{ _, R, _, _, _, _, _, _, },
|
||||||
|
{ _, R, G, G, G, _, _, _, },
|
||||||
|
{ _, R, G, _, _, _, _, _, },
|
||||||
|
{ _, _, G, _, G, B, B, B, },
|
||||||
|
{ _, _, G, G, G, B, _, B, },
|
||||||
|
{ _, _, _, _, _, B, B, B, },
|
||||||
|
{ _, _, _, _, _, B, _, B, },
|
||||||
|
}
|
||||||
|
|
||||||
|
image_rgba_bt = tga_encoder.image(pixels_rgba_bt)
|
||||||
|
image_rgba_tb = tga_encoder.image(pixels_rgba_tb)
|
||||||
|
|
||||||
|
image_rgba_bt:save(
|
||||||
|
"type2_32bpp_bt.tga",
|
||||||
|
{ color_format="B8G8R8A8", compression="RAW", scanline_order = "bottom-top" }
|
||||||
|
)
|
||||||
|
image_rgba_tb:save(
|
||||||
|
"type2_32bpp_tb.tga",
|
||||||
|
{ color_format="B8G8R8A8", compression="RAW", scanline_order = "top-bottom" }
|
||||||
|
)
|
||||||
|
image_rgba_bt:save(
|
||||||
|
"type10_32bpp_bt.tga",
|
||||||
|
{ color_format="B8G8R8A8", compression="RLE", scanline_order = "bottom-top" }
|
||||||
|
)
|
||||||
|
image_rgba_tb:save(
|
||||||
|
"type10_32bpp_tb.tga",
|
||||||
|
{ color_format="B8G8R8A8", compression="RLE", scanline_order = "top-bottom" }
|
||||||
|
)
|
||||||
|
|
||||||
|
local _ = { 0, 0, 0 }
|
||||||
|
local R = { 255, 0, 0 }
|
||||||
|
local G = { 0, 255, 0 }
|
||||||
|
local B = { 0, 0, 255 }
|
||||||
|
|
||||||
|
local pixels_rgb_bt = {
|
||||||
|
{ _, _, _, _, _, B, _, B, },
|
||||||
|
{ _, _, _, _, _, B, B, B, },
|
||||||
|
{ _, _, G, G, G, B, _, B, },
|
||||||
|
{ _, _, G, _, G, B, B, B, },
|
||||||
|
{ _, R, G, _, _, _, _, _, },
|
||||||
|
{ _, R, G, G, G, _, _, _, },
|
||||||
|
{ _, R, _, _, _, _, _, _, },
|
||||||
|
{ R, R, R, _, _, _, _, _, },
|
||||||
|
}
|
||||||
|
|
||||||
|
local pixels_rgb_tb = {
|
||||||
|
{ R, R, R, _, _, _, _, _, },
|
||||||
|
{ _, R, _, _, _, _, _, _, },
|
||||||
|
{ _, R, G, G, G, _, _, _, },
|
||||||
|
{ _, R, G, _, _, _, _, _, },
|
||||||
|
{ _, _, G, _, G, B, B, B, },
|
||||||
|
{ _, _, G, G, G, B, _, B, },
|
||||||
|
{ _, _, _, _, _, B, B, B, },
|
||||||
|
{ _, _, _, _, _, B, _, B, },
|
||||||
|
}
|
||||||
|
|
||||||
|
image_rgb_bt = tga_encoder.image(pixels_rgb_bt)
|
||||||
|
image_rgb_tb = tga_encoder.image(pixels_rgb_tb)
|
||||||
|
|
||||||
|
image_rgb_bt:save(
|
||||||
|
"type2_24bpp_bt.tga",
|
||||||
|
{ color_format="B8G8R8", compression="RAW", scanline_order = "bottom-top" }
|
||||||
|
)
|
||||||
|
image_rgb_tb:save(
|
||||||
|
"type2_24bpp_tb.tga",
|
||||||
|
{ color_format="B8G8R8", compression="RAW", scanline_order = "top-bottom" }
|
||||||
|
)
|
||||||
|
image_rgb_bt:save(
|
||||||
|
"type10_24bpp_bt.tga",
|
||||||
|
{ color_format="B8G8R8", compression="RLE", scanline_order = "bottom-top" }
|
||||||
|
)
|
||||||
|
image_rgb_tb:save(
|
||||||
|
"type10_24bpp_tb.tga",
|
||||||
|
{ color_format="B8G8R8", compression="RLE", scanline_order = "top-bottom" }
|
||||||
|
)
|
||||||
|
image_rgb_bt:save(
|
||||||
|
"type2_16bpp_bt.tga",
|
||||||
|
{ color_format="A1R5G5B5", compression="RAW", scanline_order = "bottom-top" }
|
||||||
|
)
|
||||||
|
image_rgb_tb:save(
|
||||||
|
"type2_16bpp_tb.tga",
|
||||||
|
{ color_format="A1R5G5B5", compression="RAW", scanline_order = "top-bottom" }
|
||||||
|
)
|
||||||
|
image_rgb_bt:save(
|
||||||
|
"type10_16bpp_bt.tga",
|
||||||
|
{ color_format="A1R5G5B5", compression="RLE", scanline_order = "bottom-top" }
|
||||||
|
)
|
||||||
|
image_rgb_tb:save(
|
||||||
|
"type10_16bpp_tb.tga",
|
||||||
|
{ color_format="A1R5G5B5", compression="RLE", scanline_order = "top-bottom" }
|
||||||
|
)
|
Loading…
Reference in New Issue
Block a user