|
@ -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>.
|
|
@ -0,0 +1,35 @@
|
|||
--------------------
|
||||
-- Mob Core Items --
|
||||
--------------------
|
||||
------ Ver 0.1 -----
|
||||
|
||||
-- Protection Gem --
|
||||
|
||||
minetest.register_craftitem("mob_core:protection_gem", {
|
||||
description = "Protection Gem",
|
||||
inventory_image = "mob_core_protection_gem.png",
|
||||
})
|
||||
|
||||
-- Nametag --
|
||||
|
||||
minetest.register_craftitem("mob_core:nametag", {
|
||||
description = "Name Tag",
|
||||
inventory_image = "mob_core_nametag.png",
|
||||
groups = {flammable = 2}
|
||||
})
|
||||
|
||||
-- Crafting --
|
||||
|
||||
minetest.register_craft({
|
||||
type = "shapeless",
|
||||
output = "mob_core:protection_gem",
|
||||
recipe = {"default:diamond"}
|
||||
})
|
||||
|
||||
if minetest.get_modpath("dye") and minetest.get_modpath("farming") then
|
||||
minetest.register_craft({
|
||||
type = "shapeless",
|
||||
output = "mob_core:nametag",
|
||||
recipe = {"default:paper", "dye:black", "farming:string"}
|
||||
})
|
||||
end
|
|
@ -0,0 +1,18 @@
|
|||
mob_core = {}
|
||||
|
||||
--------------
|
||||
-- Mob Core --
|
||||
--------------
|
||||
--- Ver 0.1 --
|
||||
|
||||
local path = minetest.get_modpath("mob_core")
|
||||
|
||||
dofile(path.."/api.lua")
|
||||
dofile(path.."/hq_lq.lua")
|
||||
dofile(path.."/logic.lua")
|
||||
dofile(path.."/craftitems.lua")
|
||||
dofile(path.."/pathfinder.lua")
|
||||
|
||||
if minetest.get_modpath("default") then
|
||||
dofile(path.."/mount.lua")
|
||||
end
|
|
@ -0,0 +1,201 @@
|
|||
--------------------
|
||||
-- Mob Core Logic --
|
||||
--------------------
|
||||
------ Ver 0.1 -----
|
||||
|
||||
-- Defend Owner --
|
||||
|
||||
minetest.register_on_mods_loaded(function()
|
||||
for name, def in pairs(minetest.registered_entities) do
|
||||
if minetest.registered_entities[name].logic
|
||||
or minetest.registered_entities[name].brainfunc then
|
||||
local old_punch = def.on_punch
|
||||
if not old_punch then
|
||||
old_punch = function() end
|
||||
end
|
||||
local on_punch = function(self, puncher, time_from_last_punch, tool_capabilities, dir)
|
||||
old_punch(self, puncher, time_from_last_punch, tool_capabilities, dir)
|
||||
local pos = self.object:get_pos()
|
||||
if not pos then
|
||||
return
|
||||
end
|
||||
local objects = minetest.get_objects_inside_radius(pos, 32)
|
||||
for _, object in ipairs(objects) do
|
||||
if object:get_luaentity()
|
||||
and mob_core.is_mobkit_mob(object) then
|
||||
local entity = object:get_luaentity()
|
||||
if object ~= self.object
|
||||
and entity.defend_owner
|
||||
and entity.owner
|
||||
and entity.owner == puncher:get_player_name() then
|
||||
entity.owner_target = self.object
|
||||
end
|
||||
end
|
||||
end
|
||||
end
|
||||
def.on_punch = on_punch
|
||||
minetest.register_entity(":"..name, def)
|
||||
end
|
||||
end
|
||||
end)
|
||||
|
||||
-------------
|
||||
-- Runaway --
|
||||
-------------
|
||||
|
||||
function mob_core.logic_runaway_player(self, prty) -- Runaway from player
|
||||
local player = mobkit.get_nearby_player(self)
|
||||
if player and vector.distance(self.object:get_pos(), player:get_pos()) < self.view_range then
|
||||
if player:get_player_name() ~= self.owner then
|
||||
mobkit.hq_runfrom(self,prty,player)
|
||||
return
|
||||
end
|
||||
end
|
||||
end
|
||||
|
||||
function mob_core.logic_runaway_mob(self, prty, tbl) -- Runaway from specified mobs
|
||||
tbl = tbl or self.runaway_from
|
||||
if tbl then
|
||||
for i = 1, #tbl do
|
||||
local runaway_mob = mobkit.get_closest_entity(self, tbl[i])
|
||||
if runaway_mob and vector.distance(self.object:get_pos(), runaway_mob:get_pos()) < self.view_range then
|
||||
mobkit.hq_runfrom(self, prty, runaway_mob)
|
||||
return
|
||||
end
|
||||
end
|
||||
end
|
||||
end
|
||||
|
||||
------------
|
||||
-- Attack --
|
||||
------------
|
||||
|
||||
function mob_core.logic_attack_player(self, prty, player) -- Attack player
|
||||
player = player or mobkit.get_nearby_player(self)
|
||||
if player
|
||||
and vector.distance(self.object:get_pos(), player:get_pos()) < self.view_range
|
||||
and mobkit.is_alive(player) then
|
||||
mob_core.hq_hunt(self,prty,player)
|
||||
return
|
||||
end
|
||||
return
|
||||
end
|
||||
|
||||
function mob_core.logic_attack_mob(self, prty, target) -- Attack specified mobs
|
||||
if not mobkit.exists(target) then return true end
|
||||
if target
|
||||
and vector.distance(self.object:get_pos(), target:get_pos()) < self.view_range
|
||||
and mobkit.is_alive(target) then
|
||||
if not mob_core.shared_owner(self, target) then
|
||||
mob_core.hq_hunt(self, prty, target)
|
||||
return
|
||||
end
|
||||
end
|
||||
end
|
||||
|
||||
function mob_core.logic_attack_mobs(self, prty, tbl) -- Attack specified mobs
|
||||
tbl = tbl or self.targets
|
||||
if tbl then
|
||||
for i = 1, #tbl do
|
||||
local target = mobkit.get_closest_entity(self, tbl[i])
|
||||
if target
|
||||
and vector.distance(self.object:get_pos(), target:get_pos()) < self.view_range
|
||||
and mobkit.is_alive(target) then
|
||||
if (self.tamed == true and target:get_luaentity().owner ~= self.owner)
|
||||
or not self.tamed then
|
||||
mob_core.hq_hunt(self,prty,target)
|
||||
return
|
||||
end
|
||||
end
|
||||
end
|
||||
end
|
||||
end
|
||||
|
||||
function mob_core.logic_aqua_attack_player(self, prty, player) -- Attack player
|
||||
player = player or mobkit.get_nearby_player(self)
|
||||
if player
|
||||
and vector.distance(self.object:get_pos(), player:get_pos()) < self.view_range
|
||||
and mobkit.is_alive(player)
|
||||
and mobkit.is_in_deep(player) then
|
||||
mob_core.hq_aqua_attack(self,prty,player,self.max_speed)
|
||||
return
|
||||
end
|
||||
end
|
||||
|
||||
function mob_core.logic_aqua_attack_mob(self, prty, target) -- Attack specified mobs
|
||||
if not mobkit.exists(target) then return true end
|
||||
if target
|
||||
and vector.distance(self.object:get_pos(), target:get_pos()) < self.view_range
|
||||
and mobkit.is_alive(target) then
|
||||
if not mob_core.shared_owner(self, target) then
|
||||
mob_core.hq_aqua_attack(self, prty, target, 1)
|
||||
return
|
||||
end
|
||||
end
|
||||
end
|
||||
|
||||
function mob_core.logic_aqua_attack_mobs(self, prty, tbl) -- Attack specified mobs
|
||||
tbl = tbl or self.targets
|
||||
if tbl then
|
||||
for i = 1, #tbl do
|
||||
local target = mobkit.get_closest_entity(self, tbl[i])
|
||||
if target
|
||||
and vector.distance(self.object:get_pos(), target:get_pos()) < self.view_range
|
||||
and mobkit.is_alive(target)
|
||||
and mobkit.is_in_deep(target) then
|
||||
if (self.tamed == true and target:get_luaentity().owner ~= self.owner)
|
||||
or not self.tamed then
|
||||
mob_core.hq_aqua_attack(self,prty,target,self.max_speed)
|
||||
return
|
||||
end
|
||||
end
|
||||
end
|
||||
end
|
||||
end
|
||||
|
||||
--------------
|
||||
-- Run From --
|
||||
--------------
|
||||
|
||||
function mob_core.logic_aerial_takeoff_flee_mobs(self, prty, lift_force) -- Attack specified mobs
|
||||
if self.runaway_from then
|
||||
for i = 1, #self.runaway_from do
|
||||
local runfrom = mobkit.get_closest_entity(self, self.runaway_from[i])
|
||||
if runfrom and runfrom.owner ~= self.owner then
|
||||
return
|
||||
end
|
||||
if runfrom and vector.distance(self.object:get_pos(), runfrom:get_pos()) < 8 then
|
||||
mob_core.hq_takeoff(self, prty, lift_force)
|
||||
return
|
||||
end
|
||||
end
|
||||
end
|
||||
end
|
||||
|
||||
function mob_core.logic_aerial_takeoff_flee_player(self, prty, lift_force) -- Attack specified mobs
|
||||
local player = mobkit.get_nearby_player(self)
|
||||
if player and vector.distance(self.object:get_pos(), player:get_pos()) < 8 then
|
||||
mob_core.hq_takeoff(self, prty, lift_force)
|
||||
return
|
||||
end
|
||||
end
|
||||
|
||||
------------------------
|
||||
-- Randomly drop item --
|
||||
------------------------
|
||||
|
||||
function mob_core.random_drop(self, interval, chance, item)
|
||||
self.drop_timer = (self.drop_timer or 0) + 1
|
||||
if self.drop_timer >= interval then
|
||||
self.droptimer = 0
|
||||
if math.random(1, chance) == 1 then
|
||||
local pos = self.object:get_pos()
|
||||
minetest.add_item(pos, item)
|
||||
minetest.sound_play("default_place_node_hard", {
|
||||
pos = pos,
|
||||
gain = 1.0,
|
||||
max_hear_distance = 5,
|
||||
})
|
||||
end
|
||||
end
|
||||
end
|
|
@ -0,0 +1,203 @@
|
|||
Mob Core API Documentation
|
||||
|
||||
Entity definition
|
||||
---------------------
|
||||
|
||||
minetest.register_entity("mod:name",{
|
||||
|
||||
-- required minetest api props
|
||||
|
||||
initial_properties = {
|
||||
physical = true,
|
||||
collide_with_objects = true,
|
||||
collisionbox = {...},
|
||||
visual = "mesh",
|
||||
mesh = "...",
|
||||
textures = {...},
|
||||
},
|
||||
|
||||
-- required mob_core props (refer to mobkits documentation for required mobkit props)
|
||||
|
||||
fall_damage = [bool] If true, the mob will take fall damage (true by default)
|
||||
igniter_damage = [bool] If true, the mob will take fire/lava damage (true by default)
|
||||
follow = [table/string] Table of items mob should follow (will also accept a single string)
|
||||
immune_to = [table] Table of items mob can't take damage from
|
||||
reach = [num] The distance from the center of the mobs hitbox in which it can hit another mob
|
||||
damage = [num] The amount of damage the mob does in the fleshy group (2 damage = 1 player heart)
|
||||
knockback = [num] How much knockback the mob deals to other mobs or players
|
||||
defend_owner = [bool] If true, when the mobs owner punches another mob, the mob will be stored in the self.owner_target variable
|
||||
drops = [table] Table of items mob can drop. Example:
|
||||
{
|
||||
{name = "my_mob:meat_raw", chance = 1, min = 1, max = 3}
|
||||
}
|
||||
|
||||
-- Obstacle Avoidance
|
||||
obstacle_avoidance_range = [num] Multiplier for how far ahead the mob checks for obstacles.
|
||||
surface_avoidance_range = [num] How close (in nodes) from the center of the mobs hitbox it will get to the water surface
|
||||
floor_avoidance_range = [num] How close (in nodes) from the center of the mobs hitbox it will get to the water floor
|
||||
|
||||
-- For mobs that use mob_core.growth()
|
||||
scale_stage1 = [num] Multiplier for how big the mob will be at growth stage 1 (default: 0.25)
|
||||
scale_stage2 = [num] Multiplier for how big the mob will be at growth stage 2 (default: 0.5)
|
||||
scale_stage3 = [num] Multiplier for how big the mob will be at growth stage 3 (default: 0.75)
|
||||
|
||||
-- For mobs that have unique textures for males, females, and children
|
||||
female_textures = [table] Texture/Textures for female mobs
|
||||
male_textures = [table] Texture/Textures for male mobs
|
||||
child_textures = [table] Texture/Textures for child mobs
|
||||
})
|
||||
|
||||
------------
|
||||
Misc Functions (not specific to mobs but useful for new functions)
|
||||
------------
|
||||
|
||||
function mob_core.find_val(tbl, val)
|
||||
-- tbl: table
|
||||
-- val: any value
|
||||
-- return true if tbl contains val
|
||||
|
||||
|
||||
------------
|
||||
1. Required Functions
|
||||
------------
|
||||
|
||||
function mob_core.on_step(self, dtime, moveresult)
|
||||
-- REQUIRED, many functions will not work if this is not used
|
||||
|
||||
function mob_core.on_activate(self, staticdata, dtime_s)
|
||||
-- REQUIRED, many functions will not work if this is not used
|
||||
|
||||
------------
|
||||
2. Utility Functions
|
||||
------------
|
||||
|
||||
These functions are used to get/set attributes quickly, as well as easily manage mobs
|
||||
|
||||
function mob_core.set_scale(self, scale)
|
||||
-- Sets mobs scale (visual and collisionbox)
|
||||
-- self: luaentity
|
||||
-- scale: multiplier for moba current scale
|
||||
|
||||
function mob_core.set_owner(self, name)
|
||||
-- Sets mobs owner
|
||||
-- self: luaentity
|
||||
-- name: name of player to set as owner
|
||||
|
||||
function mob_core.spawn_child(pos, mob)
|
||||
-- Spawns a child mob
|
||||
-- pos: position
|
||||
-- mob: name of the mob to be spawned
|
||||
|
||||
mob_core.follow_holding(self, player)
|
||||
-- Check if player is holding an item the mob follows
|
||||
-- self: luaentity
|
||||
-- player: player
|
||||
|
||||
function mob_core.shared_owner(self, object)
|
||||
-- self: luaentity
|
||||
-- object: luaentity or userdata
|
||||
-- returns true if self and object have the same owner
|
||||
|
||||
function mob_core.is_mobkit_mob(object)
|
||||
-- object: luaentity or userdata
|
||||
-- returns true if object uses mobkit
|
||||
|
||||
function mob_core.register_spawn({
|
||||
name = [string] mob name
|
||||
nodes = [table] list of nodes to spawn mob on
|
||||
min_light = [number] minimum light level
|
||||
max_light = [number] maximum ligth level
|
||||
min_height = [number] minimum world heigh
|
||||
max_height = [number] maximum world heigh
|
||||
min_rad = [number] minimum radius around player
|
||||
max_rad = [number] maximum radius around player
|
||||
group = [number] amount of mobs to spawn
|
||||
}, interval, chance)
|
||||
-- interval: how often (in seconds) to attempt spawning
|
||||
-- chance: chance to attempt spawning
|
||||
-- mob_core.registered_spawns[name].last_pos can be used to find the last position the mob/mobs were spawned
|
||||
|
||||
function mob_core.register_on_spawn(name, func, ...)
|
||||
-- name: name of a mob
|
||||
-- func: function
|
||||
-- ...: params of func
|
||||
-- func is called when 'name' is spawned
|
||||
-- Ex: mob_core.register_on_spawn("my_mobs:alligator", minetest.chat_send_all, "an alligator has spawned")
|
||||
|
||||
------------
|
||||
3. Interaction Functions
|
||||
------------
|
||||
|
||||
These functions are used for player -> mob interactions, like right-clicking and punches
|
||||
|
||||
function mob_core.mount(self, clicker)
|
||||
-- self: luaentity
|
||||
-- clicker: player
|
||||
|
||||
function mob_core.mount(self, clicker, capture_tool, capture_chance, wear, force_take)
|
||||
-- self: luaentity
|
||||
-- clicker: player
|
||||
-- capture_tool: itemstring
|
||||
-- capture_chance: 1 / x chance
|
||||
-- wear: amount of wear to be added to tool
|
||||
-- force_take: boolean, true means any player can catch mob
|
||||
|
||||
function mob_core.feed_tame(self, clicker, feed_count, tame, breed)
|
||||
-- self: luaentity
|
||||
-- clicker: player
|
||||
-- feed_count: amount of feeds to reach full hp
|
||||
-- tame: bool, if true mob will be tamed when feed_count is met
|
||||
-- breed: bool, if true self.breed_mode variable will be set to true when feed_count is met
|
||||
|
||||
function mob_core.protect(self, clicker, force_protect)
|
||||
-- self: luaentity
|
||||
-- clicker: player
|
||||
-- force_protect: bool, if true any player can protect mob
|
||||
|
||||
|
||||
function mob_core.nametag(self, clicker, force_name)
|
||||
-- self: luaentity
|
||||
-- clicker: player
|
||||
-- force_protect: bool, if true any player can name mob
|
||||
|
||||
------------
|
||||
4. Built-in behaviors
|
||||
------------
|
||||
|
||||
function mob_core.item_drop(self)
|
||||
-- self: luaentity
|
||||
-- Mob drops items based on self.drops
|
||||
|
||||
function mob_core.on_die(self)
|
||||
-- self: luaentity
|
||||
-- Basic mob death (falls over, drops items, disappears)
|
||||
|
||||
function mob_core.fly_to_next_waypoint(self, tpos, speed_factor)
|
||||
-- mob flies to tpos while avoiding obstacles
|
||||
-- speed_factor: multiplier for self.max_speed
|
||||
|
||||
function mob_core.swim_to_next_waypoint(self, tpos, speed_factor)
|
||||
-- mob swims to tpos while avoiding obstacles
|
||||
-- speed_factor: multiplier for self.max_speed
|
||||
|
||||
function mob_core.goto_next_waypoint(self, tpos, speed_factor)
|
||||
-- same was mobkit.goto_next_waypoint, but allows for walking into water
|
||||
-- speed_factor: multiplier for self.max_speed
|
||||
|
||||
|
||||
------------
|
||||
5. Pathfinding
|
||||
------------
|
||||
|
||||
function mob_core.find_path_lite(pos, tpos, width)
|
||||
-- pos: position
|
||||
-- tpos: position
|
||||
-- wdith: number
|
||||
-- Finds a path from pos to tpos, and adjusts away from walls to account for width
|
||||
-- Note: This doesn't always return a path with appropriate width, but is faster than mob_core.find_path()
|
||||
|
||||
function mob_core.find_path(self, tpos)
|
||||
-- self: luaentity
|
||||
-- tpos: position
|
||||
-- Finds a path to tpos, accounting for mob width
|
||||
-- Note: This may not find a path 100% of the time
|
|
@ -0,0 +1,4 @@
|
|||
name = mob_core
|
||||
depends = mobkit
|
||||
optional_depends = default
|
||||
description = A Mob API meant to expand upon mobkit and bring easy to use features for creating new Mobs.
|
|
@ -0,0 +1,168 @@
|
|||
------------------------
|
||||
-- Mob Core Mount API --
|
||||
------------------------
|
||||
-------- Ver 1.0 -------
|
||||
|
||||
local player_attached = {}
|
||||
local animate_player = {}
|
||||
|
||||
if minetest.get_modpath("default") then
|
||||
player_attached = default.player_attached
|
||||
animate_player = default.player_set_animation
|
||||
elseif minetest.get_modpath("mcl_player") then
|
||||
player_attached = mcl_player.player_attached
|
||||
animate_player = mcl_player.player_set_animation
|
||||
end
|
||||
|
||||
----------------------
|
||||
-- Helper functions --
|
||||
----------------------
|
||||
|
||||
local function detach(name)
|
||||
local player = minetest.get_player_by_name(name)
|
||||
if not player then
|
||||
return
|
||||
end
|
||||
local attached_to = player:get_attach()
|
||||
if not attached_to then
|
||||
return
|
||||
end
|
||||
local entity = attached_to:get_luaentity()
|
||||
if entity.driver and entity.driver == player then
|
||||
entity.driver = nil
|
||||
end
|
||||
mobkit.clear_queue_high(entity)
|
||||
entity.status = mobkit.remember(entity,"status","")
|
||||
player:set_detach()
|
||||
if player_attached ~= nil then
|
||||
player_attached[player:get_player_name()] = false
|
||||
end
|
||||
player:set_eye_offset({x = 0, y = 0, z = 0}, {x = 0, y = 0, z = 0})
|
||||
animate_player(player, "stand" , 30)
|
||||
player:set_properties({visual_size = {x = 1, y = 1}, pointable = true })
|
||||
end
|
||||
|
||||
function mob_core.force_detach(player)
|
||||
minetest.after(0, detach, player:get_player_name())
|
||||
end
|
||||
|
||||
local function reverse_animation(self,anim,output_name)
|
||||
if self.animation and self.animation[anim] then
|
||||
local frame_x = self.animation[anim].range.x
|
||||
local frame_y = self.animation[anim].range.y
|
||||
local loop = self.animation[anim].loop
|
||||
local speed = self.animation[anim].speed
|
||||
self.animation[output_name] = {range={x=frame_x,y=frame_y},speed=-speed,loop=loop}
|
||||
end
|
||||
end
|
||||
|
||||
minetest.register_on_leaveplayer(function(player)
|
||||
mob_core.force_detach(player)
|
||||
end)
|
||||
|
||||
minetest.register_on_shutdown(function()
|
||||
local players = minetest.get_connected_players()
|
||||
for i = 1, #players do
|
||||
mob_core.force_detach(players[i])
|
||||
end
|
||||
end)
|
||||
|
||||
minetest.register_on_dieplayer(function(player)
|
||||
mob_core.force_detach(player)
|
||||
return true
|
||||
end)
|
||||
|
||||
function mob_core.attach(entity, player)
|
||||
entity.player_rotation = entity.player_rotation or {x = 0, y = 0, z = 0}
|
||||
entity.driver_attach_at = entity.driver_attach_at or {x = 0, y = 0, z = 0}
|
||||
entity.driver_eye_offset = entity.driver_eye_offset or {{x = 0, y = 0, z = 0},{x = 0, y = 0, z = 0}}
|
||||
entity.driver_scale = entity.driver_scale or {x = 1, y = 1}
|
||||
local rot_view = 0
|
||||
if entity.player_rotation.y == 90 then
|
||||
rot_view = math.pi/2
|
||||
end
|
||||
local attach_at = entity.driver_attach_at
|
||||
local eye_offset = entity.driver_eye_offset[1] or {x = 0, y = 0, z = 0}
|
||||
local eye_offset_3p = entity.driver_eye_offset[2] or {x = 0, y = 0, z = 0}
|
||||
entity.driver = player
|
||||
player:set_attach(entity.object, "", attach_at, entity.player_rotation)
|
||||
if player_attached ~= nil then
|
||||
player_attached[player:get_player_name()] = true
|
||||
end
|
||||
player:set_eye_offset(eye_offset,eye_offset_3p)
|
||||
player:set_properties({
|
||||
visual_size = {
|
||||
x = entity.driver_scale.x,
|
||||
y = entity.driver_scale.y
|
||||
},
|
||||
pointable = false
|
||||
})
|
||||
minetest.after(0.2, function()
|
||||
animate_player(player, "sit" , 30)
|
||||
end)
|
||||
player:set_look_horizontal(entity.object:get_yaw() - rot_view)
|
||||
end
|
||||
|
||||
function mob_core.detach(player, offset)
|
||||
mob_core.force_detach(player)
|
||||
animate_player(player, "stand" , 30)
|
||||
local pos = player:get_pos()
|
||||
pos = {x = pos.x + offset.x, y = pos.y + 0.2 + offset.y, z = pos.z + offset.z}
|
||||
minetest.after(0.1, function()
|
||||
player:set_pos(pos)
|
||||
end)
|
||||
end
|
||||
|
||||
local function go_forward(self,tvel)
|
||||
local y = self.object:get_velocity().y
|
||||
local yaw = self.object:get_yaw()
|
||||
local vel = vector.multiply(minetest.yaw_to_dir(yaw),tvel)
|
||||
vel.y = y
|
||||
self.object:set_velocity(vel)
|
||||
end
|
||||
|
||||
function mob_core.hq_mount_logic(self,prty)
|
||||
local tvel = 0
|
||||
local func = function(self)
|
||||
if not self.driver then return true end
|
||||
local vel = self.object:get_velocity()
|
||||
local ctrl = self.driver:get_player_control()
|
||||
if ctrl.up then
|
||||
tvel = self.max_speed_forward
|
||||
elseif ctrl.down and self.isonground then -- move backwards
|
||||
if self.max_speed_reverse == 0 and vel == 0 then
|
||||
return
|
||||
end
|
||||
tvel = -self.max_speed_reverse
|
||||
reverse_animation(self, "walk", "walk_reverse")
|
||||
mobkit.animate(self, "walk_reverse")
|
||||
elseif tvel < 0.25 or tvel == 0 then
|
||||
tvel = 0
|
||||
self.object:set_velocity({x=0,y=vel.y,z=0})
|
||||
mobkit.animate(self, "stand")
|
||||
end
|
||||
-- jump
|
||||
if self.isonground then
|
||||
if ctrl.jump then
|
||||
vel.y = (self.jump_height)+4
|
||||
end
|
||||
end
|
||||
--stand
|
||||
if tvel ~= 0 and not ctrl.up or ctrl.down then
|
||||
tvel = tvel*0.75
|
||||
end
|
||||
if tvel > 0 then
|
||||
mobkit.animate(self,"walk")
|
||||
end
|
||||
local tyaw = self.driver:get_look_horizontal() or 0
|
||||
self.object:set_yaw(tyaw)
|
||||
self.object:set_velocity({x=vel.x,y=vel.y,z=vel.y})
|
||||
go_forward(self,tvel)
|
||||
if ctrl.sneak then
|
||||
mobkit.clear_queue_low(self)
|
||||
mobkit.clear_queue_high(self)
|
||||
mob_core.detach(self.driver, {x = 1, y = 0, z = 1})
|
||||
end
|
||||
end
|
||||
mobkit.queue_high(self,func,prty)
|
||||
end
|
|
@ -0,0 +1,404 @@
|
|||
pathfinder = {}
|
||||
|
||||
local openSet = {}
|
||||
local closedSet = {}
|
||||
local random = math.random
|
||||
|
||||
local function get_distance(start_pos, end_pos)
|
||||
local distX = math.abs(start_pos.x - end_pos.x)
|
||||
local distZ = math.abs(start_pos.z - end_pos.z)
|
||||
|
||||
if distX > distZ then
|
||||
return 14 * distZ + 10 * (distX - distZ)
|
||||
else
|
||||
return 14 * distX + 10 * (distZ - distX)
|
||||
end
|
||||
end
|
||||
|
||||
local function get_distance_to_neighbor(start_pos, end_pos)
|
||||
local distX = math.abs(start_pos.x - end_pos.x)
|
||||
local distY = math.abs(start_pos.y - end_pos.y)
|
||||
local distZ = math.abs(start_pos.z - end_pos.z)
|
||||
|
||||
if distX > distZ then
|
||||
return (14 * distZ + 10 * (distX - distZ)) * (distY + 1)
|
||||
else
|
||||
return (14 * distX + 10 * (distZ - distX)) * (distY + 1)
|
||||
end
|
||||
end
|
||||
|
||||
local function walkable(node, pos, current_pos)
|
||||
if string.find(node.name, "doors:door") then
|
||||
if (node.param2 == 0 or node.param2 == 2) and
|
||||
math.abs(pos.z - current_pos.z) > 0 and pos.x == current_pos.x then
|
||||
return true
|
||||
elseif (node.param2 == 1 or node.param2 == 3) and
|
||||
math.abs(pos.z - current_pos.z) > 0 and pos.x == current_pos.x then
|
||||
return false
|
||||
elseif (node.param2 == 0 or node.param2 == 2) and
|
||||
math.abs(pos.x - current_pos.x) > 0 and pos.z == current_pos.z then
|
||||
return false
|
||||
elseif (node.param2 == 1 or node.param2 == 3) and
|
||||
math.abs(pos.x - current_pos.x) > 0 and pos.z == current_pos.z then
|
||||
return true
|
||||
end
|
||||
elseif string.find(node.name, "doors:hidden") then
|
||||
local node_door = minetest.get_node(
|
||||
{x = pos.x, y = pos.y - 1, z = pos.z})
|
||||
if (node_door.param2 == 0 or node_door.param2 == 2) and
|
||||
math.abs(pos.z - current_pos.z) > 0 and pos.x == current_pos.x then
|
||||
return true
|
||||
elseif (node_door.param2 == 1 or node_door.param2 == 3) and
|
||||
math.abs(pos.z - current_pos.z) > 0 and pos.x == current_pos.x then
|
||||
return false
|
||||
elseif (node_door.param2 == 0 or node_door.param2 == 2) and
|
||||
math.abs(pos.x - current_pos.x) > 0 and pos.z == current_pos.z then
|
||||
return false
|
||||
elseif (node_door.param2 == 1 or node_door.param2 == 3) and
|
||||
math.abs(pos.x - current_pos.x) > 0 and pos.z == current_pos.z then
|
||||
return true
|
||||
end
|
||||
|
||||
end
|
||||
if minetest.registered_nodes[node.name] and
|
||||
minetest.registered_nodes[node.name].walkable then
|
||||
return true
|
||||
else
|
||||
return false
|
||||
end
|
||||
end
|
||||
|
||||
local function can_fit(pos, width)
|
||||
local pos1 = vector.new(pos.x - width, pos.y, pos.z - width)
|
||||
local pos2 = vector.new(pos.x + width, pos.y, pos.z + width)
|
||||
for x = pos1.x, pos2.x do
|
||||
for y = pos1.y, pos2.y do
|
||||
for z = pos1.z, pos2.z do
|
||||
local p2 = vector.new(x, y, z)
|
||||
local node = minetest.get_node(p2)
|
||||
if minetest.registered_nodes[node.name]
|
||||
and minetest.registered_nodes[node.name].walkable then
|
||||
local p3 = vector.new(p2.x, p2.y + 1, p2.z)
|
||||
local node2 = minetest.get_node(p3)
|
||||
if minetest.registered_nodes[node2.name]
|
||||
and minetest.registered_nodes[node2.name].walkable then
|
||||
return false
|
||||
end
|
||||
end
|
||||
end
|
||||
end
|
||||
end
|
||||
return true
|
||||
end
|
||||
|
||||
local function move_from_wall(pos, width)
|
||||
local pos1 = vector.new(pos.x - width, pos.y, pos.z - width)
|
||||
local pos2 = vector.new(pos.x + width, pos.y, pos.z + width)
|
||||
for x = pos1.x, pos2.x do
|
||||
for y = pos1.y, pos2.y do
|
||||
for z = pos1.z, pos2.z do
|
||||
local p2 = vector.new(x, y, z)
|
||||
if can_fit(p2, width) then
|
||||
return p2
|
||||
end
|
||||
end
|
||||
end
|
||||
end
|
||||
return pos
|
||||
end
|
||||
|
||||
|
||||
local function get_neighbor_ground_level(pos, jump_height, fall_height,
|
||||
current_pos)
|
||||
local node = minetest.get_node(pos)
|
||||
local height = 0
|
||||
if walkable(node, pos, current_pos) then
|
||||
repeat
|
||||
height = height + 1
|
||||
if height > jump_height then return nil end
|
||||
pos.y = pos.y + 1
|
||||
node = minetest.get_node(pos)
|
||||
until not walkable(node, pos, current_pos)
|
||||
return pos
|
||||
else
|
||||
repeat
|
||||
height = height + 1
|
||||
if height > fall_height then return nil end
|
||||
pos.y = pos.y - 1
|
||||
node = minetest.get_node(pos)
|
||||
until walkable(node, pos, current_pos)
|
||||
return {x = pos.x, y = pos.y + 1, z = pos.z}
|
||||
end
|
||||
end
|
||||
|
||||
-- local function dot(a, b)
|
||||
-- return a.x * b.x + a.y * b.y + a.z * b.z
|
||||
-- end
|
||||
--
|
||||
-- local function len(a)
|
||||
-- return math.sqrt(a.x * a.x + a.y * a.y + a.z * a.z)
|
||||
-- end
|
||||
--
|
||||
-- local function lensq(a)
|
||||
-- return a.x * a.x + a.y * a.y + a.z * a.z
|
||||
-- end
|
||||
--
|
||||
-- local function normalize(a)
|
||||
-- local l = len(a)
|
||||
-- a.x = a.x / l
|
||||
-- a.y = a.y / l
|
||||
-- a.z = a.z / l
|
||||
-- return a
|
||||
-- end
|
||||
|
||||
function pathfinder.find_path(self, pos, endpos, max_length, dtime)
|
||||
-- if dtime > 0.1 then
|
||||
-- return
|
||||
-- end
|
||||
-- round positions if not done by former functions
|
||||
pos = {
|
||||
x = math.floor(pos.x + 0.5),
|
||||
y = math.floor(pos.y + 0.5),
|
||||
z = math.floor(pos.z + 0.5)
|
||||
}
|
||||
|
||||
endpos = {
|
||||
x = math.floor(endpos.x + 0.5),
|
||||
y = math.floor(endpos.y + 0.5),
|
||||
z = math.floor(endpos.z + 0.5)
|
||||
}
|
||||
|
||||
local target_node = minetest.get_node(endpos)
|
||||
if walkable(target_node, endpos, endpos) then endpos.y = endpos.y + 1 end
|
||||
|
||||
local start_node = minetest.get_node(pos)
|
||||
if string.find(start_node.name, "doors:door") then
|
||||
if start_node.param2 == 0 then
|
||||
pos.z = pos.z + 1
|
||||
elseif start_node.param2 == 1 then
|
||||
pos.x = pos.x + 1
|
||||
elseif start_node.param2 == 2 then
|
||||
pos.z = pos.z - 1
|
||||
elseif start_node.param2 == 3 then
|
||||
pos.x = pos.x - 1
|
||||
end
|
||||
end
|
||||
|
||||
local start_time = minetest.get_us_time()
|
||||
local start_index = minetest.hash_node_position(pos)
|
||||
local target_index = minetest.hash_node_position(endpos)
|
||||
local count = 1
|
||||
|
||||
openSet = {}
|
||||
closedSet = {}
|
||||
-- minetest.set_node(pos, {name = "default:glass"})
|
||||
-- minetest.set_node(endpos, {name = "default:glass"})
|
||||
-- print(dump(pos))
|
||||
-- print(endpos)
|
||||
|
||||
local h_start = get_distance(pos, endpos)
|
||||
openSet[start_index] = {
|
||||
hCost = h_start,
|
||||
gCost = 0,
|
||||
fCost = h_start,
|
||||
parent = nil,
|
||||
pos = pos
|
||||
}
|
||||
|
||||
-- self values
|
||||
local self_height = math.ceil(self.collisionbox[5] -
|
||||
self.collisionbox[2]) or 2
|
||||
local self_width = math.ceil(self.collisionbox[4]) or 1
|
||||
local self_fear_height = self.max_fall or 3
|
||||
local self_jump_height = self.jump_height or 1
|
||||
local neighbors_cache = {}
|
||||
|
||||
repeat
|
||||
local current_index
|
||||
local current_values
|
||||
|
||||
-- Get one index as reference from openSet
|
||||
for i, v in pairs(openSet) do
|
||||
current_index = i
|
||||
current_values = v
|
||||
break
|
||||
end
|
||||
|
||||
-- Search for lowest fCost
|
||||
for i, v in pairs(openSet) do
|
||||
if v.fCost < openSet[current_index].fCost or v.fCost ==
|
||||
current_values.fCost and v.hCost < current_values.hCost then
|
||||
current_index = i
|
||||
current_values = v
|
||||
end
|
||||
end
|
||||
|
||||
openSet[current_index] = nil
|
||||
closedSet[current_index] = current_values
|
||||
count = count - 1
|
||||
|
||||
if current_index == target_index then
|
||||
-- ~ minetest.chat_send_all("Found path in " .. (minetest.get_us_time() - start_time) / 1000 .. "ms")
|
||||
local path = {}
|
||||
repeat
|
||||
if not closedSet[current_index] then return end
|
||||
table.insert(path, closedSet[current_index].pos)
|
||||
current_index = closedSet[current_index].parent
|
||||
until start_index == current_index
|
||||
table.insert(path, closedSet[current_index].pos)
|
||||
local reverse_path = {}
|
||||
repeat table.insert(reverse_path, table.remove(path)) until #path ==
|
||||
0
|
||||
-- minetest.chat_send_all("Found path in " .. (minetest.get_us_time() - start_time) / 1000 .. "ms. " .. "Path length: " .. #reverse_path)
|
||||
return reverse_path
|
||||
end
|
||||
|
||||
local current_pos = current_values.pos
|
||||
|
||||
local neighbors = {}
|
||||
local neighbors_index = 1
|
||||
for z = -1, 1 do
|
||||
for x = -1, 1 do
|
||||
local neighbor_pos = {
|
||||
x = current_pos.x + x,
|
||||
y = current_pos.y,
|
||||
z = current_pos.z + z
|
||||
}
|
||||
local neighbor = minetest.get_node(neighbor_pos)
|
||||
local neighbor_ground_level =
|
||||
get_neighbor_ground_level(neighbor_pos, self_jump_height,
|
||||
self_fear_height, current_pos)
|
||||
local neighbor_clearance = false
|
||||
local above_neighbor_pos = {
|
||||
x = neighbor_pos.x,
|
||||
y = neighbor_pos.y + 1,
|
||||
z = neighbor_pos.z
|
||||
}
|
||||
local above_neighbor = minetest.get_node(above_neighbor_pos)
|
||||
if neighbor_ground_level
|
||||
and can_fit(current_pos, self_width) then
|
||||
local neighbor_hash =
|
||||
minetest.hash_node_position(neighbor_ground_level)
|
||||
local pos_above_head =
|
||||
{
|
||||
x = current_pos.x,
|
||||
y = current_pos.y + self_height,
|
||||
z = current_pos.z
|
||||
}
|
||||
local node_above_head = minetest.get_node(pos_above_head)
|
||||
if neighbor_ground_level.y - current_pos.y > 0
|
||||
and not walkable(node_above_head, pos_above_head, current_pos) then
|
||||
local height = -1
|
||||
repeat
|
||||
height = height + 1
|
||||
local pos = {
|
||||
x = neighbor_ground_level.x,
|
||||
y = neighbor_ground_level.y + height,
|
||||
z = neighbor_ground_level.z
|
||||
}
|
||||
local node = minetest.get_node(pos)
|
||||
until walkable(node, pos, current_pos) or height >
|
||||
self_height
|
||||
if height >= self_height then
|
||||
neighbor_clearance = true
|
||||
end
|
||||
elseif neighbor_ground_level.y - current_pos.y > 0 and
|
||||
walkable(node_above_head, pos_above_head, current_pos) then
|
||||
neighbors[neighbors_index] = {hash = nil, pos = nil, clear = nil, walkable = nil}
|
||||
else
|
||||
local height = -1
|
||||
repeat
|
||||
height = height + 1
|
||||
local pos = {
|
||||
x = neighbor_ground_level.x,
|
||||
y = current_pos.y + height,
|
||||
z = neighbor_ground_level.z
|
||||
}
|
||||
local node = minetest.get_node(pos)
|
||||
until walkable(node, pos, current_pos) or height >
|
||||
self_height
|
||||
if height >= self_height then
|
||||
neighbor_clearance = true
|
||||
end
|
||||
end
|
||||
|
||||
neighbors[neighbors_index] =
|
||||
{
|
||||
hash = minetest.hash_node_position(
|
||||
neighbor_ground_level),
|
||||
pos = neighbor_ground_level,
|
||||
clear = neighbor_clearance,
|
||||
walkable = walkable(neighbor, neighbor_pos,
|
||||
current_pos)
|
||||
}
|
||||
else
|
||||
neighbors[neighbors_index] =
|
||||
{hash = nil, pos = nil, clear = nil, walkable = nil}
|
||||
end
|
||||
|
||||
neighbors_index = neighbors_index + 1
|
||||
end
|
||||
end
|
||||
|
||||
for id, neighbor in pairs(neighbors) do
|
||||
-- don't cut corners
|
||||
local cut_corner = false
|
||||
if id == 1 then
|
||||
if not neighbors[id + 1].clear or not neighbors[id + 3].clear or
|
||||
neighbors[id + 1].walkable or neighbors[id + 3].walkable then
|
||||
cut_corner = true
|
||||
end
|
||||
elseif id == 3 then
|
||||
if not neighbors[id - 1].clear or not neighbors[id + 3].clear or
|
||||
neighbors[id - 1].walkable or neighbors[id + 3].walkable then
|
||||
cut_corner = true
|
||||
end
|
||||
elseif id == 7 then
|
||||
if not neighbors[id + 1].clear or not neighbors[id - 3].clear or
|
||||
neighbors[id + 1].walkable or neighbors[id - 3].walkable then
|
||||
cut_corner = true
|
||||
end
|
||||
elseif id == 9 then
|
||||
if not neighbors[id - 1].clear or not neighbors[id - 3].clear or
|
||||
neighbors[id - 1].walkable or neighbors[id - 3].walkable then
|
||||
cut_corner = true
|
||||
end
|
||||
end
|
||||
if neighbor.hash ~= current_index and not closedSet[neighbor.hash] and
|
||||
neighbor.clear and not cut_corner then
|
||||
local move_cost_to_neighbor =
|
||||
current_values.gCost +
|
||||
get_distance_to_neighbor(current_values.pos,
|
||||
neighbor.pos)
|
||||
local gCost = 0
|
||||
if openSet[neighbor.hash] then
|
||||
gCost = openSet[neighbor.hash].gCost
|
||||
end
|
||||
if move_cost_to_neighbor < gCost or not openSet[neighbor.hash] then
|
||||
if not openSet[neighbor.hash] then
|
||||
count = count + 1
|
||||
end
|
||||
local hCost = get_distance(neighbor.pos, endpos)
|
||||
openSet[neighbor.hash] =
|
||||
{
|
||||
gCost = move_cost_to_neighbor,
|
||||
hCost = hCost,
|
||||
fCost = move_cost_to_neighbor + hCost,
|
||||
parent = current_index,
|
||||
pos = neighbor.pos
|
||||
}
|
||||
end
|
||||
end
|
||||
end
|
||||
if count > max_length then
|
||||
-- minetest.chat_send_all("Path fail")
|
||||
return
|
||||
end
|
||||
if (minetest.get_us_time() - start_time) / 1000 > 100 - dtime * 50 then
|
||||
-- minetest.chat_send_all("Path timeout")
|
||||
return
|
||||
end
|
||||
until count < 1
|
||||
-- minetest.chat_send_all("count < 1")
|
||||
return {pos}
|
||||
end
|
|
@ -0,0 +1,11 @@
|
|||
# Blocks mobs from spawning in protected areas
|
||||
block_protected_spawn (Block Spawning in Protected Areas) bool true
|
||||
|
||||
# Sets the limit for amount of mobs in area (of a single name)
|
||||
mob_limit (Mob Limit) float 4
|
||||
|
||||
# Allows for large mobs to jump on pre-5.3 clients
|
||||
legacy_jump (Legacy node jumping. For pre-5.3 clients) bool false
|
||||
|
||||
# Mod used to set player animations (default for minetest game, mcl_player for MineClone 2)
|
||||
mount_mod (Mod used to set player animation) string default
|
After Width: | Height: | Size: 1.9 KiB |
After Width: | Height: | Size: 1.9 KiB |
After Width: | Height: | Size: 1.5 KiB |
After Width: | Height: | Size: 1.9 KiB |
After Width: | Height: | Size: 1.9 KiB |
After Width: | Height: | Size: 235 B |
After Width: | Height: | Size: 1.7 KiB |