Initial commit
This commit is contained in:
Sasha Koshka
commit
1b51937e52
674
LICENSE
Normal file
674
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>.
|
||||||
3
README.md
Normal file
3
README.md
Normal file
@ -0,0 +1,3 @@
|
|||||||
|
# art
|
||||||
|
|
||||||
|
Art is a simple 2D software drawing library used by Tomo.
|
||||||
62
artutil/util.go
Normal file
62
artutil/util.go
Normal file
@ -0,0 +1,62 @@
|
|||||||
|
// Package artutil provides utility functions for working with art's interfaces.
|
||||||
|
package artutil
|
||||||
|
|
||||||
|
import "art"
|
||||||
|
import "image"
|
||||||
|
import "art/shatter"
|
||||||
|
import "image/color"
|
||||||
|
|
||||||
|
// Fill fills the destination canvas with the given pattern.
|
||||||
|
func Fill (destination art.Canvas, source art.Pattern) (updated image.Rectangle) {
|
||||||
|
source.Draw(destination, destination.Bounds())
|
||||||
|
return destination.Bounds()
|
||||||
|
}
|
||||||
|
|
||||||
|
// DrawClip lets you draw several subsets of a pattern at once.
|
||||||
|
func DrawClip (
|
||||||
|
destination art.Canvas,
|
||||||
|
source art.Pattern,
|
||||||
|
bounds image.Rectangle,
|
||||||
|
subsets ...image.Rectangle,
|
||||||
|
) (
|
||||||
|
updatedRegion image.Rectangle,
|
||||||
|
) {
|
||||||
|
for _, subset := range subsets {
|
||||||
|
source.Draw(art.Cut(destination, subset), bounds)
|
||||||
|
updatedRegion = updatedRegion.Union(subset)
|
||||||
|
}
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
// DrawShatter is like an inverse of DrawClip, drawing nothing in the areas
|
||||||
|
// specified by "rocks".
|
||||||
|
func DrawShatter (
|
||||||
|
destination art.Canvas,
|
||||||
|
source art.Pattern,
|
||||||
|
bounds image.Rectangle,
|
||||||
|
rocks ...image.Rectangle,
|
||||||
|
) (
|
||||||
|
updatedRegion image.Rectangle,
|
||||||
|
) {
|
||||||
|
tiles := shatter.Shatter(bounds, rocks...)
|
||||||
|
return DrawClip(destination, source, bounds, tiles...)
|
||||||
|
}
|
||||||
|
|
||||||
|
// AllocateSample returns a new canvas containing the result of a pattern. The
|
||||||
|
// resulting canvas can be sourced from shape drawing functions. I beg of you
|
||||||
|
// please do not call this every time you need to draw a shape with a pattern on
|
||||||
|
// it because that is horrible and cruel to the computer.
|
||||||
|
func AllocateSample (source art.Pattern, width, height int) art.Canvas {
|
||||||
|
allocated := art.NewBasicCanvas(width, height)
|
||||||
|
Fill(allocated, source)
|
||||||
|
return allocated
|
||||||
|
}
|
||||||
|
|
||||||
|
// Hex creates a color.RGBA value from an RGBA integer value.
|
||||||
|
func Hex (color uint32) (c color.RGBA) {
|
||||||
|
c.A = uint8(color)
|
||||||
|
c.B = uint8(color >> 8)
|
||||||
|
c.G = uint8(color >> 16)
|
||||||
|
c.R = uint8(color >> 24)
|
||||||
|
return
|
||||||
|
}
|
||||||
111
canvas.go
Normal file
111
canvas.go
Normal file
@ -0,0 +1,111 @@
|
|||||||
|
package art
|
||||||
|
|
||||||
|
import "image"
|
||||||
|
import "image/draw"
|
||||||
|
import "image/color"
|
||||||
|
|
||||||
|
// Image represents an immutable canvas.
|
||||||
|
type Image interface {
|
||||||
|
image.Image
|
||||||
|
RGBAAt (x, y int) color.RGBA
|
||||||
|
}
|
||||||
|
|
||||||
|
// Canvas is like draw.Image but is also able to return a raw pixel buffer for
|
||||||
|
// more efficient drawing. This interface can be easily satisfied using a
|
||||||
|
// BasicCanvas struct.
|
||||||
|
type Canvas interface {
|
||||||
|
draw.Image
|
||||||
|
Buffer () (data []color.RGBA, stride int)
|
||||||
|
}
|
||||||
|
|
||||||
|
// BasicCanvas is a general purpose implementation of tomo.Canvas.
|
||||||
|
type BasicCanvas struct {
|
||||||
|
pix []color.RGBA
|
||||||
|
stride int
|
||||||
|
rect image.Rectangle
|
||||||
|
}
|
||||||
|
|
||||||
|
// NewBasicCanvas creates a new basic canvas with the specified width and
|
||||||
|
// height, allocating a buffer for it.
|
||||||
|
func NewBasicCanvas (width, height int) (canvas BasicCanvas) {
|
||||||
|
canvas.pix = make([]color.RGBA, height * width)
|
||||||
|
canvas.stride = width
|
||||||
|
canvas.rect = image.Rect(0, 0, width, height)
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
// FromImage creates a new BasicCanvas from an image.Image.
|
||||||
|
func FromImage (img image.Image) (canvas BasicCanvas) {
|
||||||
|
bounds := img.Bounds()
|
||||||
|
canvas = NewBasicCanvas(bounds.Dx(), bounds.Dy())
|
||||||
|
point := image.Point { }
|
||||||
|
for point.Y = bounds.Min.Y; point.Y < bounds.Max.Y; point.Y ++ {
|
||||||
|
for point.X = bounds.Min.X; point.X < bounds.Max.X; point.X ++ {
|
||||||
|
canvasPoint := point.Sub(bounds.Min)
|
||||||
|
canvas.Set (
|
||||||
|
canvasPoint.X, canvasPoint.Y,
|
||||||
|
img.At(point.X, point.Y))
|
||||||
|
}}
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
// you know what it do
|
||||||
|
func (canvas BasicCanvas) Bounds () (bounds image.Rectangle) {
|
||||||
|
return canvas.rect
|
||||||
|
}
|
||||||
|
|
||||||
|
// you know what it do
|
||||||
|
func (canvas BasicCanvas) At (x, y int) (color.Color) {
|
||||||
|
if !image.Pt(x, y).In(canvas.rect) { return nil }
|
||||||
|
return canvas.pix[x + y * canvas.stride]
|
||||||
|
}
|
||||||
|
|
||||||
|
// you know what it do
|
||||||
|
func (canvas BasicCanvas) ColorModel () (model color.Model) {
|
||||||
|
return color.RGBAModel
|
||||||
|
}
|
||||||
|
|
||||||
|
// you know what it do
|
||||||
|
func (canvas BasicCanvas) Set (x, y int, c color.Color) {
|
||||||
|
if !image.Pt(x, y).In(canvas.rect) { return }
|
||||||
|
r, g, b, a := c.RGBA()
|
||||||
|
canvas.pix[x + y * canvas.stride] = color.RGBA {
|
||||||
|
R: uint8(r >> 8),
|
||||||
|
G: uint8(g >> 8),
|
||||||
|
B: uint8(b >> 8),
|
||||||
|
A: uint8(a >> 8),
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// you know what it do
|
||||||
|
func (canvas BasicCanvas) Buffer () (data []color.RGBA, stride int) {
|
||||||
|
return canvas.pix, canvas.stride
|
||||||
|
}
|
||||||
|
|
||||||
|
// Reallocate efficiently reallocates the canvas. The data within will be
|
||||||
|
// garbage. This method will do nothing if this is a cut image.
|
||||||
|
func (canvas *BasicCanvas) Reallocate (width, height int) {
|
||||||
|
if canvas.rect.Min != (image.Point { }) { return }
|
||||||
|
|
||||||
|
previousLen := len(canvas.pix)
|
||||||
|
newLen := width * height
|
||||||
|
bigger := newLen > previousLen
|
||||||
|
smaller := newLen < previousLen / 2
|
||||||
|
if bigger || smaller {
|
||||||
|
canvas.pix = make (
|
||||||
|
[]color.RGBA,
|
||||||
|
((height * width) / 4096) * 4096 + 4096)
|
||||||
|
}
|
||||||
|
canvas.stride = width
|
||||||
|
canvas.rect = image.Rect(0, 0, width, height)
|
||||||
|
}
|
||||||
|
|
||||||
|
// Cut returns a sub-canvas of a given canvas.
|
||||||
|
func Cut (canvas Canvas, bounds image.Rectangle) (reduced BasicCanvas) {
|
||||||
|
// println(canvas.Bounds().String(), bounds.String())
|
||||||
|
bounds = bounds.Intersect(canvas.Bounds())
|
||||||
|
if bounds.Empty() { return }
|
||||||
|
reduced.rect = bounds
|
||||||
|
reduced.pix, reduced.stride = canvas.Buffer()
|
||||||
|
return
|
||||||
|
}
|
||||||
2
doc.go
Normal file
2
doc.go
Normal file
@ -0,0 +1,2 @@
|
|||||||
|
// Package art provides a simple 2D drawing library.
|
||||||
|
package art
|
||||||
13
icon.go
Normal file
13
icon.go
Normal file
@ -0,0 +1,13 @@
|
|||||||
|
package art
|
||||||
|
|
||||||
|
import "image"
|
||||||
|
import "image/color"
|
||||||
|
|
||||||
|
type Icon interface {
|
||||||
|
// Draw draws the icon to the destination canvas at the specified point,
|
||||||
|
// using the specified color (if the icon is monochrome).
|
||||||
|
Draw (destination Canvas, color color.RGBA, at image.Point)
|
||||||
|
|
||||||
|
// Bounds returns the bounds of the icon.
|
||||||
|
Bounds () image.Rectangle
|
||||||
|
}
|
||||||
82
inset.go
Normal file
82
inset.go
Normal file
@ -0,0 +1,82 @@
|
|||||||
|
package art
|
||||||
|
|
||||||
|
import "image"
|
||||||
|
|
||||||
|
// Side represents one side of a rectangle.
|
||||||
|
type Side int; const (
|
||||||
|
SideTop Side = iota
|
||||||
|
SideRight
|
||||||
|
SideBottom
|
||||||
|
SideLeft
|
||||||
|
)
|
||||||
|
|
||||||
|
// Inset represents an inset amount for all four sides of a rectangle. The top
|
||||||
|
// side is at index zero, the right at index one, the bottom at index two, and
|
||||||
|
// the left at index three. These values may be negative.
|
||||||
|
type Inset [4]int
|
||||||
|
|
||||||
|
// I allows you to create an inset in a CSS-ish way:
|
||||||
|
//
|
||||||
|
// - One argument: all sides are set to this value
|
||||||
|
// - Two arguments: the top and bottom sides are set to the first value, and
|
||||||
|
// the left and right sides are set to the second value.
|
||||||
|
// - Three arguments: the top side is set by the first value, the left and
|
||||||
|
// right sides are set by the second vaue, and the bottom side is set by the
|
||||||
|
// third value.
|
||||||
|
// - Four arguments: each value corresponds to a side.
|
||||||
|
//
|
||||||
|
// This function will panic if an argument count that isn't one of these is
|
||||||
|
// given.
|
||||||
|
func I (sides ...int) Inset {
|
||||||
|
switch len(sides) {
|
||||||
|
case 1: return Inset { sides[0], sides[0], sides[0], sides[0] }
|
||||||
|
case 2: return Inset { sides[0], sides[1], sides[0], sides[1] }
|
||||||
|
case 3: return Inset { sides[0], sides[1], sides[2], sides[1] }
|
||||||
|
case 4: return Inset { sides[0], sides[1], sides[2], sides[3] }
|
||||||
|
default: panic("I: illegal argument count.")
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Apply returns the given rectangle, shrunk on all four sides by the given
|
||||||
|
// inset. If a measurment of the inset is negative, that side will instead be
|
||||||
|
// expanded outward. If the rectangle's dimensions cannot be reduced any
|
||||||
|
// further, an empty rectangle near its center will be returned.
|
||||||
|
func (inset Inset) Apply (bigger image.Rectangle) (smaller image.Rectangle) {
|
||||||
|
smaller = bigger
|
||||||
|
if smaller.Dx() < inset[3] + inset[1] {
|
||||||
|
smaller.Min.X = (smaller.Min.X + smaller.Max.X) / 2
|
||||||
|
smaller.Max.X = smaller.Min.X
|
||||||
|
} else {
|
||||||
|
smaller.Min.X += inset[3]
|
||||||
|
smaller.Max.X -= inset[1]
|
||||||
|
}
|
||||||
|
|
||||||
|
if smaller.Dy() < inset[0] + inset[2] {
|
||||||
|
smaller.Min.Y = (smaller.Min.Y + smaller.Max.Y) / 2
|
||||||
|
smaller.Max.Y = smaller.Min.Y
|
||||||
|
} else {
|
||||||
|
smaller.Min.Y += inset[0]
|
||||||
|
smaller.Max.Y -= inset[2]
|
||||||
|
}
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
// Inverse returns a negated version of the inset.
|
||||||
|
func (inset Inset) Inverse () (prime Inset) {
|
||||||
|
return Inset {
|
||||||
|
inset[0] * -1,
|
||||||
|
inset[1] * -1,
|
||||||
|
inset[2] * -1,
|
||||||
|
inset[3] * -1,
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Horizontal returns the sum of SideRight and SideLeft.
|
||||||
|
func (inset Inset) Horizontal () int {
|
||||||
|
return inset[SideRight] + inset[SideLeft]
|
||||||
|
}
|
||||||
|
|
||||||
|
// Vertical returns the sum of SideTop and SideBottom.
|
||||||
|
func (inset Inset) Vertical () int {
|
||||||
|
return inset[SideTop] + inset[SideBottom]
|
||||||
|
}
|
||||||
13
pattern.go
Normal file
13
pattern.go
Normal file
@ -0,0 +1,13 @@
|
|||||||
|
package art
|
||||||
|
|
||||||
|
import "image"
|
||||||
|
|
||||||
|
// Pattern is capable of drawing to a canvas within the bounds of a given
|
||||||
|
// clipping rectangle.
|
||||||
|
type Pattern interface {
|
||||||
|
// Draw draws the pattern onto the destination canvas, using the
|
||||||
|
// specified bounds. The given bounds can be smaller or larger than the
|
||||||
|
// bounds of the destination canvas. The destination canvas can be cut
|
||||||
|
// using canvas.Cut() to draw only a specific subset of a pattern.
|
||||||
|
Draw (destination Canvas, bounds image.Rectangle)
|
||||||
|
}
|
||||||
89
patterns/border.go
Normal file
89
patterns/border.go
Normal file
@ -0,0 +1,89 @@
|
|||||||
|
package patterns
|
||||||
|
|
||||||
|
import "art"
|
||||||
|
import "image"
|
||||||
|
|
||||||
|
// Border is a pattern that behaves similarly to border-image in CSS. It divides
|
||||||
|
// a source canvas into nine sections...
|
||||||
|
//
|
||||||
|
// Inset[1]
|
||||||
|
// ┌──┴──┐
|
||||||
|
// ┌─┌─────┬─────┬─────┐
|
||||||
|
// Inset[0]─┤ │ 0 │ 1 │ 2 │
|
||||||
|
// └─├─────┼─────┼─────┤
|
||||||
|
// │ 3 │ 4 │ 5 │
|
||||||
|
// ├─────┼─────┼─────┤─┐
|
||||||
|
// │ 6 │ 7 │ 8 │ ├─Inset[2]
|
||||||
|
// └─────┴─────┴─────┘─┘
|
||||||
|
// └──┬──┘
|
||||||
|
// Inset[3]
|
||||||
|
//
|
||||||
|
// ... Where the bounds of section 4 are defined as the application of the
|
||||||
|
// pattern's inset to the canvas's bounds. The bounds of the other eight
|
||||||
|
// sections are automatically sized around it.
|
||||||
|
//
|
||||||
|
// When drawn to a destination canvas, the bounds of sections 1, 3, 4, 5, and 7
|
||||||
|
// are expanded or contracted to fit the given drawing bounds. All sections are
|
||||||
|
// rendered as if they are Texture patterns, meaning these flexible sections
|
||||||
|
// will repeat to fill in any empty space.
|
||||||
|
//
|
||||||
|
// This pattern can be used to make a static image texture into something that
|
||||||
|
// responds well to being resized.
|
||||||
|
type Border struct {
|
||||||
|
art.Canvas
|
||||||
|
art.Inset
|
||||||
|
}
|
||||||
|
|
||||||
|
// Draw draws the border pattern onto the destination canvas within the given
|
||||||
|
// bounds.
|
||||||
|
func (pattern Border) Draw (destination art.Canvas, bounds image.Rectangle) {
|
||||||
|
drawBounds := bounds.Canon().Intersect(destination.Bounds())
|
||||||
|
if drawBounds.Empty() { return }
|
||||||
|
|
||||||
|
srcSections := nonasect(pattern.Bounds(), pattern.Inset)
|
||||||
|
srcTextures := [9]Texture { }
|
||||||
|
for index, section := range srcSections {
|
||||||
|
srcTextures[index].Canvas = art.Cut(pattern, section)
|
||||||
|
}
|
||||||
|
|
||||||
|
dstSections := nonasect(bounds, pattern.Inset)
|
||||||
|
for index, section := range dstSections {
|
||||||
|
srcTextures[index].Draw(destination, section)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
func nonasect (bounds image.Rectangle, inset art.Inset) [9]image.Rectangle {
|
||||||
|
center := inset.Apply(bounds)
|
||||||
|
return [9]image.Rectangle {
|
||||||
|
// top
|
||||||
|
image.Rectangle {
|
||||||
|
bounds.Min,
|
||||||
|
center.Min },
|
||||||
|
image.Rect (
|
||||||
|
center.Min.X, bounds.Min.Y,
|
||||||
|
center.Max.X, center.Min.Y),
|
||||||
|
image.Rect (
|
||||||
|
center.Max.X, bounds.Min.Y,
|
||||||
|
bounds.Max.X, center.Min.Y),
|
||||||
|
|
||||||
|
// center
|
||||||
|
image.Rect (
|
||||||
|
bounds.Min.X, center.Min.Y,
|
||||||
|
center.Min.X, center.Max.Y),
|
||||||
|
center,
|
||||||
|
image.Rect (
|
||||||
|
center.Max.X, center.Min.Y,
|
||||||
|
bounds.Max.X, center.Max.Y),
|
||||||
|
|
||||||
|
// bottom
|
||||||
|
image.Rect (
|
||||||
|
bounds.Min.X, center.Max.Y,
|
||||||
|
center.Min.X, bounds.Max.Y),
|
||||||
|
image.Rect (
|
||||||
|
center.Min.X, center.Max.Y,
|
||||||
|
center.Max.X, bounds.Max.Y),
|
||||||
|
image.Rect (
|
||||||
|
center.Max.X, center.Max.Y,
|
||||||
|
bounds.Max.X, bounds.Max.Y),
|
||||||
|
}
|
||||||
|
}
|
||||||
3
patterns/doc.go
Normal file
3
patterns/doc.go
Normal file
@ -0,0 +1,3 @@
|
|||||||
|
// Package patterns provides a basic set of types that satisfy the Pattern
|
||||||
|
// interface.
|
||||||
|
package patterns
|
||||||
77
patterns/texture.go
Normal file
77
patterns/texture.go
Normal file
@ -0,0 +1,77 @@
|
|||||||
|
package patterns
|
||||||
|
|
||||||
|
import "art"
|
||||||
|
import "image"
|
||||||
|
|
||||||
|
// Texture is a pattern that tiles the content of a canvas both horizontally and
|
||||||
|
// vertically.
|
||||||
|
type Texture struct {
|
||||||
|
art.Canvas
|
||||||
|
}
|
||||||
|
|
||||||
|
// Draw tiles the pattern's canvas within the given bounds. The minimum
|
||||||
|
// point of the pattern's canvas will be lined up with the minimum point of the
|
||||||
|
// bounding rectangle.
|
||||||
|
func (pattern Texture) Draw (destination art.Canvas, bounds image.Rectangle) {
|
||||||
|
dstBounds := bounds.Canon().Intersect(destination.Bounds())
|
||||||
|
if dstBounds.Empty() { return }
|
||||||
|
|
||||||
|
dstData, dstStride := destination.Buffer()
|
||||||
|
srcData, srcStride := pattern.Buffer()
|
||||||
|
srcBounds := pattern.Bounds()
|
||||||
|
|
||||||
|
// offset is a vector that is added to points in destination space to
|
||||||
|
// convert them to points in source space
|
||||||
|
offset := srcBounds.Min.Sub(bounds.Min)
|
||||||
|
|
||||||
|
// calculate the starting position in source space
|
||||||
|
srcPoint := dstBounds.Min.Add(offset)
|
||||||
|
srcPoint.X = wrap(srcPoint.X, srcBounds.Min.X, srcBounds.Max.X)
|
||||||
|
srcPoint.Y = wrap(srcPoint.Y, srcBounds.Min.Y, srcBounds.Max.Y)
|
||||||
|
srcStartPoint := srcPoint
|
||||||
|
|
||||||
|
// for each row
|
||||||
|
dstPoint := image.Point { }
|
||||||
|
for dstPoint.Y = dstBounds.Min.Y; dstPoint.Y < dstBounds.Max.Y; dstPoint.Y ++ {
|
||||||
|
srcPoint.X = srcStartPoint.X
|
||||||
|
dstPoint.X = dstBounds.Min.X
|
||||||
|
dstYComponent := dstPoint.Y * dstStride
|
||||||
|
srcYComponent := srcPoint.Y * srcStride
|
||||||
|
|
||||||
|
// for each pixel in the row
|
||||||
|
for {
|
||||||
|
// draw pixel
|
||||||
|
dstIndex := dstYComponent + dstPoint.X
|
||||||
|
srcIndex := srcYComponent + srcPoint.X
|
||||||
|
dstData[dstIndex] = srcData[srcIndex]
|
||||||
|
|
||||||
|
// increment X in source space. wrap to start if out of
|
||||||
|
// bounds.
|
||||||
|
srcPoint.X ++
|
||||||
|
if srcPoint.X >= srcBounds.Max.X {
|
||||||
|
srcPoint.X = srcBounds.Min.X
|
||||||
|
}
|
||||||
|
|
||||||
|
// increment X in destination space. stop drawing this
|
||||||
|
// row if out of bounds.
|
||||||
|
dstPoint.X ++
|
||||||
|
if dstPoint.X >= dstBounds.Max.X {
|
||||||
|
break
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// increment row in source space. wrap to start if out of
|
||||||
|
// bounds.
|
||||||
|
srcPoint.Y ++
|
||||||
|
if srcPoint.Y >= srcBounds.Max.Y {
|
||||||
|
srcPoint.Y = srcBounds.Min.Y
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
func wrap (value, min, max int) int {
|
||||||
|
difference := max - min
|
||||||
|
value = (value - min) % difference
|
||||||
|
if value < 0 { value += difference }
|
||||||
|
return value + min
|
||||||
|
}
|
||||||
20
patterns/uniform.go
Normal file
20
patterns/uniform.go
Normal file
@ -0,0 +1,20 @@
|
|||||||
|
package patterns
|
||||||
|
|
||||||
|
import "art"
|
||||||
|
import "image"
|
||||||
|
import "art/shapes"
|
||||||
|
import "art/artutil"
|
||||||
|
import "image/color"
|
||||||
|
|
||||||
|
// Uniform is a pattern that draws a solid color.
|
||||||
|
type Uniform color.RGBA
|
||||||
|
|
||||||
|
// Draw fills the bounding rectangle with the pattern's color.
|
||||||
|
func (pattern Uniform) Draw (destination art.Canvas, bounds image.Rectangle) {
|
||||||
|
shapes.FillColorRectangle(destination, color.RGBA(pattern), bounds)
|
||||||
|
}
|
||||||
|
|
||||||
|
// Uhex creates a new Uniform pattern from an RGBA integer value.
|
||||||
|
func Uhex (color uint32) (uniform Uniform) {
|
||||||
|
return Uniform(artutil.Hex(color))
|
||||||
|
}
|
||||||
11
shapes/doc.go
Normal file
11
shapes/doc.go
Normal file
@ -0,0 +1,11 @@
|
|||||||
|
// Package shapes provides some basic shape drawing routines.
|
||||||
|
//
|
||||||
|
// A word about using patterns with shape routines:
|
||||||
|
//
|
||||||
|
// Most drawing routines have a version that samples from other canvases, and a
|
||||||
|
// version that samples from a solid color. None of these routines can use
|
||||||
|
// patterns directly, but it is entirely possible to have a pattern draw to an
|
||||||
|
// off-screen canvas and then draw a shape based on that canvas. As a little
|
||||||
|
// bonus, you can save the canvas for later so you don't have to render the
|
||||||
|
// pattern again when you need to redraw the shape.
|
||||||
|
package shapes
|
||||||
231
shapes/ellipse.go
Normal file
231
shapes/ellipse.go
Normal file
@ -0,0 +1,231 @@
|
|||||||
|
package shapes
|
||||||
|
|
||||||
|
import "art"
|
||||||
|
import "math"
|
||||||
|
import "image"
|
||||||
|
import "image/color"
|
||||||
|
|
||||||
|
// TODO: redo fill ellipse, stroke ellipse, etc. so that it only takes in
|
||||||
|
// destination and source, using the bounds of destination as the bounds of the
|
||||||
|
// ellipse and the bounds of source as the "clipping rectangle". Line up the Min
|
||||||
|
// of both canvases.
|
||||||
|
|
||||||
|
func FillEllipse (
|
||||||
|
destination art.Canvas,
|
||||||
|
source art.Canvas,
|
||||||
|
bounds image.Rectangle,
|
||||||
|
) (
|
||||||
|
updatedRegion image.Rectangle,
|
||||||
|
) {
|
||||||
|
dstData, dstStride := destination.Buffer()
|
||||||
|
srcData, srcStride := source.Buffer()
|
||||||
|
|
||||||
|
offset := source.Bounds().Min.Sub(destination.Bounds().Min)
|
||||||
|
drawBounds :=
|
||||||
|
source.Bounds().Sub(offset).
|
||||||
|
Intersect(destination.Bounds()).
|
||||||
|
Intersect(bounds)
|
||||||
|
if bounds.Empty() { return }
|
||||||
|
updatedRegion = bounds
|
||||||
|
|
||||||
|
point := image.Point { }
|
||||||
|
for point.Y = drawBounds.Min.Y; point.Y < drawBounds.Max.Y; point.Y ++ {
|
||||||
|
for point.X = drawBounds.Min.X; point.X < drawBounds.Max.X; point.X ++ {
|
||||||
|
if inEllipse(point, bounds) {
|
||||||
|
offsetPoint := point.Add(offset)
|
||||||
|
dstIndex := point.X + point.Y * dstStride
|
||||||
|
srcIndex := offsetPoint.X + offsetPoint.Y * srcStride
|
||||||
|
dstData[dstIndex] = srcData[srcIndex]
|
||||||
|
}
|
||||||
|
}}
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
func StrokeEllipse (
|
||||||
|
destination art.Canvas,
|
||||||
|
source art.Canvas,
|
||||||
|
bounds image.Rectangle,
|
||||||
|
weight int,
|
||||||
|
) {
|
||||||
|
if weight < 1 { return }
|
||||||
|
|
||||||
|
dstData, dstStride := destination.Buffer()
|
||||||
|
srcData, srcStride := source.Buffer()
|
||||||
|
|
||||||
|
drawBounds := destination.Bounds().Inset(weight - 1)
|
||||||
|
offset := source.Bounds().Min.Sub(destination.Bounds().Min)
|
||||||
|
if drawBounds.Empty() { return }
|
||||||
|
|
||||||
|
context := ellipsePlottingContext {
|
||||||
|
plottingContext: plottingContext {
|
||||||
|
dstData: dstData,
|
||||||
|
dstStride: dstStride,
|
||||||
|
srcData: srcData,
|
||||||
|
srcStride: srcStride,
|
||||||
|
weight: weight,
|
||||||
|
offset: offset,
|
||||||
|
bounds: bounds,
|
||||||
|
},
|
||||||
|
radii: image.Pt(drawBounds.Dx() / 2, drawBounds.Dy() / 2),
|
||||||
|
}
|
||||||
|
context.center = drawBounds.Min.Add(context.radii)
|
||||||
|
context.plotEllipse()
|
||||||
|
}
|
||||||
|
|
||||||
|
type ellipsePlottingContext struct {
|
||||||
|
plottingContext
|
||||||
|
radii image.Point
|
||||||
|
center image.Point
|
||||||
|
}
|
||||||
|
|
||||||
|
func (context ellipsePlottingContext) plotEllipse () {
|
||||||
|
x := float64(0)
|
||||||
|
y := float64(context.radii.Y)
|
||||||
|
|
||||||
|
// region 1 decision parameter
|
||||||
|
decision1 :=
|
||||||
|
float64(context.radii.Y * context.radii.Y) -
|
||||||
|
float64(context.radii.X * context.radii.X * context.radii.Y) +
|
||||||
|
(0.25 * float64(context.radii.X) * float64(context.radii.X))
|
||||||
|
decisionX := float64(2 * context.radii.Y * context.radii.Y * int(x))
|
||||||
|
decisionY := float64(2 * context.radii.X * context.radii.X * int(y))
|
||||||
|
|
||||||
|
// draw region 1
|
||||||
|
for decisionX < decisionY {
|
||||||
|
points := []image.Point {
|
||||||
|
image.Pt(-int(x) + context.center.X, -int(y) + context.center.Y),
|
||||||
|
image.Pt( int(x) + context.center.X, -int(y) + context.center.Y),
|
||||||
|
image.Pt(-int(x) + context.center.X, int(y) + context.center.Y),
|
||||||
|
image.Pt( int(x) + context.center.X, int(y) + context.center.Y),
|
||||||
|
}
|
||||||
|
if context.srcData == nil {
|
||||||
|
context.plotColor(points[0])
|
||||||
|
context.plotColor(points[1])
|
||||||
|
context.plotColor(points[2])
|
||||||
|
context.plotColor(points[3])
|
||||||
|
} else {
|
||||||
|
context.plotSource(points[0])
|
||||||
|
context.plotSource(points[1])
|
||||||
|
context.plotSource(points[2])
|
||||||
|
context.plotSource(points[3])
|
||||||
|
}
|
||||||
|
|
||||||
|
if (decision1 < 0) {
|
||||||
|
x ++
|
||||||
|
decisionX += float64(2 * context.radii.Y * context.radii.Y)
|
||||||
|
decision1 += decisionX + float64(context.radii.Y * context.radii.Y)
|
||||||
|
} else {
|
||||||
|
x ++
|
||||||
|
y --
|
||||||
|
decisionX += float64(2 * context.radii.Y * context.radii.Y)
|
||||||
|
decisionY -= float64(2 * context.radii.X * context.radii.X)
|
||||||
|
decision1 +=
|
||||||
|
decisionX - decisionY +
|
||||||
|
float64(context.radii.Y * context.radii.Y)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// region 2 decision parameter
|
||||||
|
decision2 :=
|
||||||
|
float64(context.radii.Y * context.radii.Y) * (x + 0.5) * (x + 0.5) +
|
||||||
|
float64(context.radii.X * context.radii.X) * (y - 1) * (y - 1) -
|
||||||
|
float64(context.radii.X * context.radii.X * context.radii.Y * context.radii.Y)
|
||||||
|
|
||||||
|
// draw region 2
|
||||||
|
for y >= 0 {
|
||||||
|
points := []image.Point {
|
||||||
|
image.Pt( int(x) + context.center.X, int(y) + context.center.Y),
|
||||||
|
image.Pt(-int(x) + context.center.X, int(y) + context.center.Y),
|
||||||
|
image.Pt( int(x) + context.center.X, -int(y) + context.center.Y),
|
||||||
|
image.Pt(-int(x) + context.center.X, -int(y) + context.center.Y),
|
||||||
|
}
|
||||||
|
if context.srcData == nil {
|
||||||
|
context.plotColor(points[0])
|
||||||
|
context.plotColor(points[1])
|
||||||
|
context.plotColor(points[2])
|
||||||
|
context.plotColor(points[3])
|
||||||
|
} else {
|
||||||
|
context.plotSource(points[0])
|
||||||
|
context.plotSource(points[1])
|
||||||
|
context.plotSource(points[2])
|
||||||
|
context.plotSource(points[3])
|
||||||
|
}
|
||||||
|
|
||||||
|
if decision2 > 0 {
|
||||||
|
y --
|
||||||
|
decisionY -= float64(2 * context.radii.X * context.radii.X)
|
||||||
|
decision2 += float64(context.radii.X * context.radii.X) - decisionY
|
||||||
|
} else {
|
||||||
|
y --
|
||||||
|
x ++
|
||||||
|
decisionX += float64(2 * context.radii.Y * context.radii.Y)
|
||||||
|
decisionY -= float64(2 * context.radii.X * context.radii.X)
|
||||||
|
decision2 +=
|
||||||
|
decisionX - decisionY +
|
||||||
|
float64(context.radii.X * context.radii.X)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// FillColorEllipse fills an ellipse within the destination canvas with a solid
|
||||||
|
// color.
|
||||||
|
func FillColorEllipse (
|
||||||
|
destination art.Canvas,
|
||||||
|
color color.RGBA,
|
||||||
|
bounds image.Rectangle,
|
||||||
|
) (
|
||||||
|
updatedRegion image.Rectangle,
|
||||||
|
) {
|
||||||
|
dstData, dstStride := destination.Buffer()
|
||||||
|
|
||||||
|
realBounds := bounds
|
||||||
|
bounds = bounds.Intersect(destination.Bounds()).Canon()
|
||||||
|
if bounds.Empty() { return }
|
||||||
|
updatedRegion = bounds
|
||||||
|
|
||||||
|
point := image.Point { }
|
||||||
|
for point.Y = bounds.Min.Y; point.Y < bounds.Max.Y; point.Y ++ {
|
||||||
|
for point.X = bounds.Min.X; point.X < bounds.Max.X; point.X ++ {
|
||||||
|
if inEllipse(point, realBounds) {
|
||||||
|
dstData[point.X + point.Y * dstStride] = color
|
||||||
|
}
|
||||||
|
}}
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
// StrokeColorEllipse is similar to FillColorEllipse, but it draws an inset
|
||||||
|
// outline of an ellipse instead.
|
||||||
|
func StrokeColorEllipse (
|
||||||
|
destination art.Canvas,
|
||||||
|
color color.RGBA,
|
||||||
|
bounds image.Rectangle,
|
||||||
|
weight int,
|
||||||
|
) (
|
||||||
|
updatedRegion image.Rectangle,
|
||||||
|
) {
|
||||||
|
if weight < 1 { return }
|
||||||
|
|
||||||
|
dstData, dstStride := destination.Buffer()
|
||||||
|
insetBounds := bounds.Inset(weight - 1)
|
||||||
|
|
||||||
|
context := ellipsePlottingContext {
|
||||||
|
plottingContext: plottingContext {
|
||||||
|
dstData: dstData,
|
||||||
|
dstStride: dstStride,
|
||||||
|
color: color,
|
||||||
|
weight: weight,
|
||||||
|
bounds: bounds.Intersect(destination.Bounds()),
|
||||||
|
},
|
||||||
|
radii: image.Pt(insetBounds.Dx() / 2, insetBounds.Dy() / 2),
|
||||||
|
}
|
||||||
|
context.center = insetBounds.Min.Add(context.radii)
|
||||||
|
context.plotEllipse()
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
func inEllipse (point image.Point, bounds image.Rectangle) bool {
|
||||||
|
point = point.Sub(bounds.Min)
|
||||||
|
x := (float64(point.X) + 0.5) / float64(bounds.Dx()) - 0.5
|
||||||
|
y := (float64(point.Y) + 0.5) / float64(bounds.Dy()) - 0.5
|
||||||
|
return math.Hypot(x, y) <= 0.5
|
||||||
|
}
|
||||||
110
shapes/line.go
Normal file
110
shapes/line.go
Normal file
@ -0,0 +1,110 @@
|
|||||||
|
package shapes
|
||||||
|
|
||||||
|
import "art"
|
||||||
|
import "image"
|
||||||
|
import "image/color"
|
||||||
|
|
||||||
|
// ColorLine draws a line from one point to another with the specified weight
|
||||||
|
// and color.
|
||||||
|
func ColorLine (
|
||||||
|
destination art.Canvas,
|
||||||
|
color color.RGBA,
|
||||||
|
weight int,
|
||||||
|
min image.Point,
|
||||||
|
max image.Point,
|
||||||
|
) (
|
||||||
|
updatedRegion image.Rectangle,
|
||||||
|
) {
|
||||||
|
updatedRegion = image.Rectangle { Min: min, Max: max }.Canon()
|
||||||
|
updatedRegion.Max.X ++
|
||||||
|
updatedRegion.Max.Y ++
|
||||||
|
|
||||||
|
data, stride := destination.Buffer()
|
||||||
|
bounds := destination.Bounds()
|
||||||
|
context := linePlottingContext {
|
||||||
|
plottingContext: plottingContext {
|
||||||
|
dstData: data,
|
||||||
|
dstStride: stride,
|
||||||
|
color: color,
|
||||||
|
weight: weight,
|
||||||
|
bounds: bounds,
|
||||||
|
},
|
||||||
|
min: min,
|
||||||
|
max: max,
|
||||||
|
}
|
||||||
|
|
||||||
|
if abs(max.Y - min.Y) < abs(max.X - min.X) {
|
||||||
|
if max.X < min.X { context.swap() }
|
||||||
|
context.lineLow()
|
||||||
|
|
||||||
|
} else {
|
||||||
|
if max.Y < min.Y { context.swap() }
|
||||||
|
context.lineHigh()
|
||||||
|
}
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
type linePlottingContext struct {
|
||||||
|
plottingContext
|
||||||
|
min image.Point
|
||||||
|
max image.Point
|
||||||
|
}
|
||||||
|
|
||||||
|
func (context *linePlottingContext) swap () {
|
||||||
|
temp := context.max
|
||||||
|
context.max = context.min
|
||||||
|
context.min = temp
|
||||||
|
}
|
||||||
|
|
||||||
|
func (context linePlottingContext) lineLow () {
|
||||||
|
deltaX := context.max.X - context.min.X
|
||||||
|
deltaY := context.max.Y - context.min.Y
|
||||||
|
yi := 1
|
||||||
|
|
||||||
|
if deltaY < 0 {
|
||||||
|
yi = -1
|
||||||
|
deltaY *= -1
|
||||||
|
}
|
||||||
|
|
||||||
|
D := (2 * deltaY) - deltaX
|
||||||
|
point := context.min
|
||||||
|
|
||||||
|
for ; point.X < context.max.X; point.X ++ {
|
||||||
|
context.plotColor(point)
|
||||||
|
if D > 0 {
|
||||||
|
D += 2 * (deltaY - deltaX)
|
||||||
|
point.Y += yi
|
||||||
|
} else {
|
||||||
|
D += 2 * deltaY
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
func (context linePlottingContext) lineHigh () {
|
||||||
|
deltaX := context.max.X - context.min.X
|
||||||
|
deltaY := context.max.Y - context.min.Y
|
||||||
|
xi := 1
|
||||||
|
|
||||||
|
if deltaX < 0 {
|
||||||
|
xi = -1
|
||||||
|
deltaX *= -1
|
||||||
|
}
|
||||||
|
|
||||||
|
D := (2 * deltaX) - deltaY
|
||||||
|
point := context.min
|
||||||
|
|
||||||
|
for ; point.Y < context.max.Y; point.Y ++ {
|
||||||
|
context.plotColor(point)
|
||||||
|
if D > 0 {
|
||||||
|
point.X += xi
|
||||||
|
D += 2 * (deltaX - deltaY)
|
||||||
|
} else {
|
||||||
|
D += 2 * deltaX
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
func abs (n int) int {
|
||||||
|
if n < 0 { n *= -1}
|
||||||
|
return n
|
||||||
|
}
|
||||||
47
shapes/plot.go
Normal file
47
shapes/plot.go
Normal file
@ -0,0 +1,47 @@
|
|||||||
|
package shapes
|
||||||
|
|
||||||
|
import "image"
|
||||||
|
import "image/color"
|
||||||
|
|
||||||
|
// FIXME? drawing a ton of overlapping squares might be a bit wasteful.
|
||||||
|
|
||||||
|
type plottingContext struct {
|
||||||
|
dstData []color.RGBA
|
||||||
|
dstStride int
|
||||||
|
srcData []color.RGBA
|
||||||
|
srcStride int
|
||||||
|
color color.RGBA
|
||||||
|
weight int
|
||||||
|
offset image.Point
|
||||||
|
bounds image.Rectangle
|
||||||
|
}
|
||||||
|
|
||||||
|
func (context plottingContext) square (center image.Point) (square image.Rectangle) {
|
||||||
|
return image.Rect(0, 0, context.weight, context.weight).
|
||||||
|
Sub(image.Pt(context.weight / 2, context.weight / 2)).
|
||||||
|
Add(center).
|
||||||
|
Intersect(context.bounds)
|
||||||
|
}
|
||||||
|
|
||||||
|
func (context plottingContext) plotColor (center image.Point) {
|
||||||
|
square := context.square(center)
|
||||||
|
for y := square.Min.Y; y < square.Max.Y; y ++ {
|
||||||
|
for x := square.Min.X; x < square.Max.X; x ++ {
|
||||||
|
context.dstData[x + y * context.dstStride] = context.color
|
||||||
|
}}
|
||||||
|
}
|
||||||
|
|
||||||
|
func (context plottingContext) plotSource (center image.Point) {
|
||||||
|
square := context.square(center)
|
||||||
|
for y := square.Min.Y; y < square.Max.Y; y ++ {
|
||||||
|
for x := square.Min.X; x < square.Max.X; x ++ {
|
||||||
|
// we offset srcIndex here because we have already applied the
|
||||||
|
// offset to the square, and we need to reverse that to get the
|
||||||
|
// proper source coordinates.
|
||||||
|
srcIndex :=
|
||||||
|
x + context.offset.X +
|
||||||
|
(y + context.offset.Y) * context.dstStride
|
||||||
|
dstIndex := x + y * context.dstStride
|
||||||
|
context.dstData[dstIndex] = context.srcData [srcIndex]
|
||||||
|
}}
|
||||||
|
}
|
||||||
130
shapes/rectangle.go
Normal file
130
shapes/rectangle.go
Normal file
@ -0,0 +1,130 @@
|
|||||||
|
package shapes
|
||||||
|
|
||||||
|
import "art"
|
||||||
|
import "image"
|
||||||
|
import "art/shatter"
|
||||||
|
import "image/color"
|
||||||
|
|
||||||
|
// TODO: return updatedRegion for all routines in this package
|
||||||
|
|
||||||
|
func FillRectangle (
|
||||||
|
destination art.Canvas,
|
||||||
|
source art.Canvas,
|
||||||
|
bounds image.Rectangle,
|
||||||
|
) (
|
||||||
|
updatedRegion image.Rectangle,
|
||||||
|
) {
|
||||||
|
dstData, dstStride := destination.Buffer()
|
||||||
|
srcData, srcStride := source.Buffer()
|
||||||
|
|
||||||
|
offset := source.Bounds().Min.Sub(destination.Bounds().Min)
|
||||||
|
drawBounds :=
|
||||||
|
source.Bounds().Sub(offset).
|
||||||
|
Intersect(destination.Bounds()).
|
||||||
|
Intersect(bounds)
|
||||||
|
if drawBounds.Empty() { return }
|
||||||
|
updatedRegion = drawBounds
|
||||||
|
|
||||||
|
point := image.Point { }
|
||||||
|
for point.Y = drawBounds.Min.Y; point.Y < drawBounds.Max.Y; point.Y ++ {
|
||||||
|
for point.X = drawBounds.Min.X; point.X < drawBounds.Max.X; point.X ++ {
|
||||||
|
offsetPoint := point.Add(offset)
|
||||||
|
dstIndex := point.X + point.Y * dstStride
|
||||||
|
srcIndex := offsetPoint.X + offsetPoint.Y * srcStride
|
||||||
|
dstData[dstIndex] = srcData[srcIndex]
|
||||||
|
}}
|
||||||
|
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
func StrokeRectangle (
|
||||||
|
destination art.Canvas,
|
||||||
|
source art.Canvas,
|
||||||
|
bounds image.Rectangle,
|
||||||
|
weight int,
|
||||||
|
) (
|
||||||
|
updatedRegion image.Rectangle,
|
||||||
|
) {
|
||||||
|
insetBounds := bounds.Inset(weight)
|
||||||
|
if insetBounds.Empty() {
|
||||||
|
return FillRectangle(destination, source, bounds)
|
||||||
|
}
|
||||||
|
return FillRectangleShatter(destination, source, bounds, insetBounds)
|
||||||
|
}
|
||||||
|
|
||||||
|
// FillRectangleShatter is like FillRectangle, but it does not draw in areas
|
||||||
|
// specified in "rocks".
|
||||||
|
func FillRectangleShatter (
|
||||||
|
destination art.Canvas,
|
||||||
|
source art.Canvas,
|
||||||
|
bounds image.Rectangle,
|
||||||
|
rocks ...image.Rectangle,
|
||||||
|
) (
|
||||||
|
updatedRegion image.Rectangle,
|
||||||
|
) {
|
||||||
|
tiles := shatter.Shatter(bounds, rocks...)
|
||||||
|
for _, tile := range tiles {
|
||||||
|
FillRectangle (
|
||||||
|
art.Cut(destination, tile),
|
||||||
|
source, tile)
|
||||||
|
updatedRegion = updatedRegion.Union(tile)
|
||||||
|
}
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
// FillColorRectangle fills a rectangle within the destination canvas with a
|
||||||
|
// solid color.
|
||||||
|
func FillColorRectangle (
|
||||||
|
destination art.Canvas,
|
||||||
|
color color.RGBA,
|
||||||
|
bounds image.Rectangle,
|
||||||
|
) (
|
||||||
|
updatedRegion image.Rectangle,
|
||||||
|
) {
|
||||||
|
dstData, dstStride := destination.Buffer()
|
||||||
|
bounds = bounds.Canon().Intersect(destination.Bounds())
|
||||||
|
if bounds.Empty() { return }
|
||||||
|
|
||||||
|
updatedRegion = bounds
|
||||||
|
for y := bounds.Min.Y; y < bounds.Max.Y; y ++ {
|
||||||
|
for x := bounds.Min.X; x < bounds.Max.X; x ++ {
|
||||||
|
dstData[x + y * dstStride] = color
|
||||||
|
}}
|
||||||
|
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
// FillColorRectangleShatter is like FillColorRectangle, but it does not draw in
|
||||||
|
// areas specified in "rocks".
|
||||||
|
func FillColorRectangleShatter (
|
||||||
|
destination art.Canvas,
|
||||||
|
color color.RGBA,
|
||||||
|
bounds image.Rectangle,
|
||||||
|
rocks ...image.Rectangle,
|
||||||
|
) (
|
||||||
|
updatedRegion image.Rectangle,
|
||||||
|
) {
|
||||||
|
tiles := shatter.Shatter(bounds, rocks...)
|
||||||
|
for _, tile := range tiles {
|
||||||
|
FillColorRectangle(destination, color, tile)
|
||||||
|
updatedRegion = updatedRegion.Union(tile)
|
||||||
|
}
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
// StrokeColorRectangle is similar to FillColorRectangle, but it draws an inset
|
||||||
|
// outline of the given rectangle instead.
|
||||||
|
func StrokeColorRectangle (
|
||||||
|
destination art.Canvas,
|
||||||
|
color color.RGBA,
|
||||||
|
bounds image.Rectangle,
|
||||||
|
weight int,
|
||||||
|
) (
|
||||||
|
updatedRegion image.Rectangle,
|
||||||
|
) {
|
||||||
|
insetBounds := bounds.Inset(weight)
|
||||||
|
if insetBounds.Empty() {
|
||||||
|
return FillColorRectangle(destination, color, bounds)
|
||||||
|
}
|
||||||
|
return FillColorRectangleShatter(destination, color, bounds, insetBounds)
|
||||||
|
}
|
||||||
97
shatter/shatter.go
Normal file
97
shatter/shatter.go
Normal file
@ -0,0 +1,97 @@
|
|||||||
|
// Package shatter provides boolean operations for image.Rectangle.
|
||||||
|
package shatter
|
||||||
|
|
||||||
|
import "image"
|
||||||
|
|
||||||
|
// Shatter takes in a bounding rectangle, and several rectangles to be
|
||||||
|
// subtracted from it. It returns a slice of rectangles that tile together to
|
||||||
|
// make up the difference between them. This is intended to be used for figuring
|
||||||
|
// out which areas of a container element's background are covered by other
|
||||||
|
// elements so it doesn't waste CPU cycles drawing to those areas.
|
||||||
|
func Shatter (
|
||||||
|
glass image.Rectangle,
|
||||||
|
rocks ...image.Rectangle,
|
||||||
|
) (
|
||||||
|
tiles []image.Rectangle,
|
||||||
|
) {
|
||||||
|
// in this function, the metaphor of throwing several rocks at a sheet
|
||||||
|
// of glass is used to illustrate the concept.
|
||||||
|
|
||||||
|
tiles = []image.Rectangle { glass }
|
||||||
|
for _, rock := range rocks {
|
||||||
|
|
||||||
|
// check each tile to see if the rock has collided with it
|
||||||
|
tileLen := len(tiles)
|
||||||
|
for tileIndex := 0; tileIndex < tileLen; tileIndex ++ {
|
||||||
|
tile := tiles[tileIndex]
|
||||||
|
if !rock.Overlaps(tile) { continue }
|
||||||
|
newTiles, n := shatterOnce(tile, rock)
|
||||||
|
if n > 0 {
|
||||||
|
// the tile was shattered into one or more sub
|
||||||
|
// tiles
|
||||||
|
tiles[tileIndex] = newTiles[0]
|
||||||
|
tiles = append(tiles, newTiles[1:n]...)
|
||||||
|
} else {
|
||||||
|
// the tile was entirely obscured by the rock
|
||||||
|
// and must be wholly removed
|
||||||
|
tiles = remove(tiles, tileIndex)
|
||||||
|
tileIndex --
|
||||||
|
tileLen --
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
func shatterOnce (glass, rock image.Rectangle) (tiles [4]image.Rectangle, n int) {
|
||||||
|
rock = rock.Intersect(glass)
|
||||||
|
|
||||||
|
// |'''''''''''|
|
||||||
|
// | |
|
||||||
|
// |###|'''| |
|
||||||
|
// |###|___| |
|
||||||
|
// | |
|
||||||
|
// |___________|
|
||||||
|
if rock.Min.X > glass.Min.X { tiles[n] = image.Rect (
|
||||||
|
glass.Min.X, rock.Min.Y,
|
||||||
|
rock.Min.X, rock.Max.Y,
|
||||||
|
); n ++ }
|
||||||
|
|
||||||
|
// |'''''''''''|
|
||||||
|
// | |
|
||||||
|
// | |'''|###|
|
||||||
|
// | |___|###|
|
||||||
|
// | |
|
||||||
|
// |___________|
|
||||||
|
if rock.Max.X < glass.Max.X { tiles[n] = image.Rect (
|
||||||
|
rock.Max.X, rock.Min.Y,
|
||||||
|
glass.Max.X, rock.Max.Y,
|
||||||
|
); n ++ }
|
||||||
|
|
||||||
|
// |###########|
|
||||||
|
// |###########|
|
||||||
|
// | |'''| |
|
||||||
|
// | |___| |
|
||||||
|
// | |
|
||||||
|
// |___________|
|
||||||
|
if rock.Min.Y > glass.Min.Y { tiles[n] = image.Rect (
|
||||||
|
glass.Min.X, glass.Min.Y,
|
||||||
|
glass.Max.X, rock.Min.Y,
|
||||||
|
); n ++ }
|
||||||
|
|
||||||
|
// |'''''''''''|
|
||||||
|
// | |
|
||||||
|
// | |'''| |
|
||||||
|
// | |___| |
|
||||||
|
// |###########|
|
||||||
|
// |###########|
|
||||||
|
if rock.Max.Y < glass.Max.Y { tiles[n] = image.Rect (
|
||||||
|
glass.Min.X, rock.Max.Y,
|
||||||
|
glass.Max.X, glass.Max.Y,
|
||||||
|
); n ++ }
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
func remove[ELEMENT any] (slice []ELEMENT, s int) []ELEMENT {
|
||||||
|
return append(slice[:s], slice[s + 1:]...)
|
||||||
|
}
|
||||||
Reference in New Issue
Block a user