Compare commits

...

5 Commits

Author SHA1 Message Date
Noodlemire f21cea11a0
Update README.md 2020-01-25 23:55:50 -06:00
Noodlemire 1224bfe414 Update Clump III 2020-01-25 14:35:02 -06:00
Noodlemire 553a091943
Add files via upload 2018-06-15 12:12:54 -05:00
Noodlemire ef03512410
Add files via upload 2018-06-15 11:39:07 -05:00
Noodlemire aadf924fa4
Add files via upload 2018-06-10 22:23:14 -05:00
9 changed files with 1203 additions and 1 deletions

458
LICENSE.txt Normal file
View File

@ -0,0 +1,458 @@
GNU LESSER GENERAL PUBLIC LICENSE
Version 2.1, February 1999
Copyright (C) 1991, 1999 Free Software Foundation, Inc.
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
[This is the first released version of the Lesser GPL. It also counts
as the successor of the GNU Library Public License, version 2, hence
the version number 2.1.]
Preamble
The licenses for most software are designed to take away your
freedom to share and change it. By contrast, the GNU General Public
Licenses are intended to guarantee your freedom to share and change
free software--to make sure the software is free for all its users.
This license, the Lesser General Public License, applies to some
specially designated software packages--typically libraries--of the
Free Software Foundation and other authors who decide to use it. You
can use it too, but we suggest you first think carefully about whether
this license or the ordinary General Public License is the better
strategy to use in any particular case, based on the explanations below.
When we speak of free software, we are referring to freedom of use,
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 this service if you wish); that you receive source code or can get
it if you want it; that you can change the software and use pieces of
it in new free programs; and that you are informed that you can do
these things.
To protect your rights, we need to make restrictions that forbid
distributors to deny you these rights or to ask you to surrender these
rights. These restrictions translate to certain responsibilities for
you if you distribute copies of the library or if you modify it.
For example, if you distribute copies of the library, whether gratis
or for a fee, you must give the recipients all the rights that we gave
you. You must make sure that they, too, receive or can get the source
code. If you link other code with the library, you must provide
complete object files to the recipients, so that they can relink them
with the library after making changes to the library and recompiling
it. And you must show them these terms so they know their rights.
We protect your rights with a two-step method: (1) we copyright the
library, and (2) we offer you this license, which gives you legal
permission to copy, distribute and/or modify the library.
To protect each distributor, we want to make it very clear that
there is no warranty for the free library. Also, if the library is
modified by someone else and passed on, the recipients should know
that what they have is not the original version, so that the original
author's reputation will not be affected by problems that might be
introduced by others.
Finally, software patents pose a constant threat to the existence of
any free program. We wish to make sure that a company cannot
effectively restrict the users of a free program by obtaining a
restrictive license from a patent holder. Therefore, we insist that
any patent license obtained for a version of the library must be
consistent with the full freedom of use specified in this license.
Most GNU software, including some libraries, is covered by the
ordinary GNU General Public License. This license, the GNU Lesser
General Public License, applies to certain designated libraries, and
is quite different from the ordinary General Public License. We use
this license for certain libraries in order to permit linking those
libraries into non-free programs.
When a program is linked with a library, whether statically or using
a shared library, the combination of the two is legally speaking a
combined work, a derivative of the original library. The ordinary
General Public License therefore permits such linking only if the
entire combination fits its criteria of freedom. The Lesser General
Public License permits more lax criteria for linking other code with
the library.
We call this license the "Lesser" General Public License because it
does Less to protect the user's freedom than the ordinary General
Public License. It also provides other free software developers Less
of an advantage over competing non-free programs. These disadvantages
are the reason we use the ordinary General Public License for many
libraries. However, the Lesser license provides advantages in certain
special circumstances.
For example, on rare occasions, there may be a special need to
encourage the widest possible use of a certain library, so that it becomes
a de-facto standard. To achieve this, non-free programs must be
allowed to use the library. A more frequent case is that a free
library does the same job as widely used non-free libraries. In this
case, there is little to gain by limiting the free library to free
software only, so we use the Lesser General Public License.
In other cases, permission to use a particular library in non-free
programs enables a greater number of people to use a large body of
free software. For example, permission to use the GNU C Library in
non-free programs enables many more people to use the whole GNU
operating system, as well as its variant, the GNU/Linux operating
system.
Although the Lesser General Public License is Less protective of the
users' freedom, it does ensure that the user of a program that is
linked with the Library has the freedom and the wherewithal to run
that program using a modified version of the Library.
The precise terms and conditions for copying, distribution and
modification follow. Pay close attention to the difference between a
"work based on the library" and a "work that uses the library". The
former contains code derived from the library, whereas the latter must
be combined with the library in order to run.
GNU LESSER GENERAL PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. This License Agreement applies to any software library or other
program which contains a notice placed by the copyright holder or
other authorized party saying it may be distributed under the terms of
this Lesser General Public License (also called "this License").
Each licensee is addressed as "you".
A "library" means a collection of software functions and/or data
prepared so as to be conveniently linked with application programs
(which use some of those functions and data) to form executables.
The "Library", below, refers to any such software library or work
which has been distributed under these terms. A "work based on the
Library" means either the Library or any derivative work under
copyright law: that is to say, a work containing the Library or a
portion of it, either verbatim or with modifications and/or translated
straightforwardly into another language. (Hereinafter, translation is
included without limitation in the term "modification".)
"Source code" for a work means the preferred form of the work for
making modifications to it. For a library, complete source code means
all the source code for all modules it contains, plus any associated
interface definition files, plus the scripts used to control compilation
and installation of the library.
Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope. The act of
running a program using the Library is not restricted, and output from
such a program is covered only if its contents constitute a work based
on the Library (independent of the use of the Library in a tool for
writing it). Whether that is true depends on what the Library does
and what the program that uses the Library does.
1. You may copy and distribute verbatim copies of the Library's
complete source code as you receive it, in any medium, provided that
you conspicuously and appropriately publish on each copy an
appropriate copyright notice and disclaimer of warranty; keep intact
all the notices that refer to this License and to the absence of any
warranty; and distribute a copy of this License along with the
Library.
You may charge a fee for the physical act of transferring a copy,
and you may at your option offer warranty protection in exchange for a
fee.
2. You may modify your copy or copies of the Library or any portion
of it, thus forming a work based on the Library, and copy and
distribute such modifications or work under the terms of Section 1
above, provided that you also meet all of these conditions:
a) The modified work must itself be a software library.
b) You must cause the files modified to carry prominent notices
stating that you changed the files and the date of any change.
c) You must cause the whole of the work to be licensed at no
charge to all third parties under the terms of this License.
d) If a facility in the modified Library refers to a function or a
table of data to be supplied by an application program that uses
the facility, other than as an argument passed when the facility
is invoked, then you must make a good faith effort to ensure that,
in the event an application does not supply such function or
table, the facility still operates, and performs whatever part of
its purpose remains meaningful.
(For example, a function in a library to compute square roots has
a purpose that is entirely well-defined independent of the
application. Therefore, Subsection 2d requires that any
application-supplied function or table used by this function must
be optional: if the application does not supply it, the square
root function must still compute square roots.)
These requirements apply to the modified work as a whole. If
identifiable sections of that work are not derived from the Library,
and can be reasonably considered independent and separate works in
themselves, then this License, and its terms, do not apply to those
sections when you distribute them as separate works. But when you
distribute the same sections as part of a whole which is a work based
on the Library, the distribution of the whole must be on the terms of
this License, whose permissions for other licensees extend to the
entire whole, and thus to each and every part regardless of who wrote
it.
Thus, it is not the intent of this section to claim rights or contest
your rights to work written entirely by you; rather, the intent is to
exercise the right to control the distribution of derivative or
collective works based on the Library.
In addition, mere aggregation of another work not based on the Library
with the Library (or with a work based on the Library) on a volume of
a storage or distribution medium does not bring the other work under
the scope of this License.
3. You may opt to apply the terms of the ordinary GNU General Public
License instead of this License to a given copy of the Library. To do
this, you must alter all the notices that refer to this License, so
that they refer to the ordinary GNU General Public License, version 2,
instead of to this License. (If a newer version than version 2 of the
ordinary GNU General Public License has appeared, then you can specify
that version instead if you wish.) Do not make any other change in
these notices.
Once this change is made in a given copy, it is irreversible for
that copy, so the ordinary GNU General Public License applies to all
subsequent copies and derivative works made from that copy.
This option is useful when you wish to copy part of the code of
the Library into a program that is not a library.
4. You may copy and distribute the Library (or a portion or
derivative of it, under Section 2) in object code or executable form
under the terms of Sections 1 and 2 above provided that you accompany
it with the complete corresponding machine-readable source code, which
must be distributed under the terms of Sections 1 and 2 above on a
medium customarily used for software interchange.
If distribution of object code is made by offering access to copy
from a designated place, then offering equivalent access to copy the
source code from the same place satisfies the requirement to
distribute the source code, even though third parties are not
compelled to copy the source along with the object code.
5. A program that contains no derivative of any portion of the
Library, but is designed to work with the Library by being compiled or
linked with it, is called a "work that uses the Library". Such a
work, in isolation, is not a derivative work of the Library, and
therefore falls outside the scope of this License.
However, linking a "work that uses the Library" with the Library
creates an executable that is a derivative of the Library (because it
contains portions of the Library), rather than a "work that uses the
library". The executable is therefore covered by this License.
Section 6 states terms for distribution of such executables.
When a "work that uses the Library" uses material from a header file
that is part of the Library, the object code for the work may be a
derivative work of the Library even though the source code is not.
Whether this is true is especially significant if the work can be
linked without the Library, or if the work is itself a library. The
threshold for this to be true is not precisely defined by law.
If such an object file uses only numerical parameters, data
structure layouts and accessors, and small macros and small inline
functions (ten lines or less in length), then the use of the object
file is unrestricted, regardless of whether it is legally a derivative
work. (Executables containing this object code plus portions of the
Library will still fall under Section 6.)
Otherwise, if the work is a derivative of the Library, you may
distribute the object code for the work under the terms of Section 6.
Any executables containing that work also fall under Section 6,
whether or not they are linked directly with the Library itself.
6. As an exception to the Sections above, you may also combine or
link a "work that uses the Library" with the Library to produce a
work containing portions of the Library, and distribute that work
under terms of your choice, provided that the terms permit
modification of the work for the customer's own use and reverse
engineering for debugging such modifications.
You must give prominent notice with each copy of the work that the
Library is used in it and that the Library and its use are covered by
this License. You must supply a copy of this License. If the work
during execution displays copyright notices, you must include the
copyright notice for the Library among them, as well as a reference
directing the user to the copy of this License. Also, you must do one
of these things:
a) Accompany the work with the complete corresponding
machine-readable source code for the Library including whatever
changes were used in the work (which must be distributed under
Sections 1 and 2 above); and, if the work is an executable linked
with the Library, with the complete machine-readable "work that
uses the Library", as object code and/or source code, so that the
user can modify the Library and then relink to produce a modified
executable containing the modified Library. (It is understood
that the user who changes the contents of definitions files in the
Library will not necessarily be able to recompile the application
to use the modified definitions.)
b) Use a suitable shared library mechanism for linking with the
Library. A suitable mechanism is one that (1) uses at run time a
copy of the library already present on the user's computer system,
rather than copying library functions into the executable, and (2)
will operate properly with a modified version of the library, if
the user installs one, as long as the modified version is
interface-compatible with the version that the work was made with.
c) Accompany the work with a written offer, valid for at
least three years, to give the same user the materials
specified in Subsection 6a, above, for a charge no more
than the cost of performing this distribution.
d) If distribution of the work is made by offering access to copy
from a designated place, offer equivalent access to copy the above
specified materials from the same place.
e) Verify that the user has already received a copy of these
materials or that you have already sent this user a copy.
For an executable, the required form of the "work that uses the
Library" must include any data and utility programs needed for
reproducing the executable from it. However, as a special exception,
the materials to be distributed need not include anything that is
normally distributed (in either source or binary form) with the major
components (compiler, kernel, and so on) of the operating system on
which the executable runs, unless that component itself accompanies
the executable.
It may happen that this requirement contradicts the license
restrictions of other proprietary libraries that do not normally
accompany the operating system. Such a contradiction means you cannot
use both them and the Library together in an executable that you
distribute.
7. You may place library facilities that are a work based on the
Library side-by-side in a single library together with other library
facilities not covered by this License, and distribute such a combined
library, provided that the separate distribution of the work based on
the Library and of the other library facilities is otherwise
permitted, and provided that you do these two things:
a) Accompany the combined library with a copy of the same work
based on the Library, uncombined with any other library
facilities. This must be distributed under the terms of the
Sections above.
b) Give prominent notice with the combined library of the fact
that part of it is a work based on the Library, and explaining
where to find the accompanying uncombined form of the same work.
8. You may not copy, modify, sublicense, link with, or distribute
the Library except as expressly provided under this License. Any
attempt otherwise to copy, modify, sublicense, link with, or
distribute the Library is void, and will automatically terminate your
rights under this License. However, parties who have received copies,
or rights, from you under this License will not have their licenses
terminated so long as such parties remain in full compliance.
9. You are not required to accept this License, since you have not
signed it. However, nothing else grants you permission to modify or
distribute the Library or its derivative works. These actions are
prohibited by law if you do not accept this License. Therefore, by
modifying or distributing the Library (or any work based on the
Library), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Library or works based on it.
10. Each time you redistribute the Library (or any work based on the
Library), the recipient automatically receives a license from the
original licensor to copy, distribute, link with or modify the Library
subject to these terms and conditions. You may not impose any further
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties with
this License.
11. If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
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
distribute so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you
may not distribute the Library at all. For example, if a patent
license would not permit royalty-free redistribution of the Library by
all those who receive copies directly or indirectly through you, then
the only way you could satisfy both it and this License would be to
refrain entirely from distribution of the Library.
If any portion of this section is held invalid or unenforceable under any
particular circumstance, the balance of the section is intended to apply,
and the section as a whole is intended to apply in other circumstances.
It is not the purpose of this section to induce you to infringe any
patents or other property right claims or to contest validity of any
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system which is
implemented by public license practices. Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.
This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.
12. If the distribution and/or use of the Library is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Library under this License may add
an explicit geographical distribution limitation excluding those countries,
so that distribution is permitted only in or among countries not thus
excluded. In such case, this License incorporates the limitation as if
written in the body of this License.
13. The Free Software Foundation may publish revised and/or new
versions of the Lesser General Public License from time to time.
Such new versions will be similar in spirit to the present version,
but may differ in detail to address new problems or concerns.
Each version is given a distinguishing version number. If the Library
specifies a version number of this License which applies to it and
"any later version", you have the option of following the terms and
conditions either of that version or of any later version published by
the Free Software Foundation. If the Library does not specify a
license version number, you may choose any version ever published by
the Free Software Foundation.
14. If you wish to incorporate parts of the Library into other free
programs whose distribution conditions are incompatible with these,
write to the author to ask for permission. For software which is
copyrighted by the Free Software Foundation, write to the Free
Software Foundation; we sometimes make exceptions for this. Our
decision will be guided by the two goals of preserving the free status
of all derivatives of our free software and of promoting the sharing
and reuse of software generally.
NO WARRANTY
15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
OTHER PARTIES PROVIDE THE LIBRARY "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
LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
AND/OR REDISTRIBUTE THE LIBRARY 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
LIBRARY (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 LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
DAMAGES.
END OF TERMS AND CONDITIONS

View File

@ -1 +1,24 @@
# clumpfall
-------------------------------------------------------------------------------------------------------------
Clump Fall Nodes
[clumpfall]
-------------------------------------------------------------------------------------------------------------
-------------------------------------------------------------------------------------------------------------
About
-------------------------------------------------------------------------------------------------------------
This mod is designed to allow almost every node in Minetest to fall down, similar to sand or gravel. However, there are two key differences between regular Falling Nodes and Clump Fall Nodes; first that nodes that are part of the new "clump_fall_node" group will fall down slowly in small "clumps", gradually cascading until there is nothing left in the air. The other key difference is that individual nodes don't automatically fall just because nothing is immediately underneath them. Instead, if there's a block below and to the side or corner of the node in question, then the node still won't fall. Because Clump Fall Nodes only start to fall if there are no other Clump Fall Nodes connected to their underside, lower edges, or lower corners, this means that pyramid shapes will often become structurally sound. It also means that cubic houses won't need to be completely filled with supports in order to keep their roofs from collapsing, and that giant holes won't appear on the world's surface every time a cave collapses.
-------------------------------------------------------------------------------------------------------------
Dependencies and Support
-------------------------------------------------------------------------------------------------------------
This mod has only one dependency, for the mod entitycontrol, which is used to fix some glitches with Clump Fall Behavior. Other than that, support that this mod has for others is built-in and automatic, able to effect all added nodes without much issue, and is able to correctly differentiate between nodes that should be Clump Fall Nodes and nodes that are Falling Nodes, Attached Nodes, Liquid, or Unbreakable.
-------------------------------------------------------------------------------------------------------------
License
-------------------------------------------------------------------------------------------------------------
The LGPL v2.1 License is used with this mod. See https://www.gnu.org/licenses/old-licenses/lgpl-2.1.en.html or LICENSE.txt for more details.
-------------------------------------------------------------------------------------------------------------
Installation
-------------------------------------------------------------------------------------------------------------
Download, unzip, and place within the usual minetest/current/mods folder, and it will behave in relation to the Minetest engine like any other mod.

55
changelog.txt Normal file
View File

@ -0,0 +1,55 @@
Initial Clump:
+New group "clump_fall_node" created that applies to nodes that aren't, air, ignore, or part of the groups falling_node, attached_node, or liquid
+Set the above + to occur after every other mod has registered nodes, so that nodes from every mod will be affected
+Added a check between two points for clump_fall_nodes that are susceptible to falling
+Created a seperate clump_fall function that performes the above + once every second
+It also, upon looping, changes the area to be checked in response to the locations of the last nodes that fell
+Furthermore, it removes nodes to fall and spawns the appropriate falling_nodes in their place
+Made a method to spawn a falling node while also automatically giving it the node and metadata information about the node that is trying to fall
+This clump_fall function has lastly been registered to occur automatically on nodes that are punched, broken, and placed
+Beds have been excluded from the clump_fall_node group due to major issues with how they fall
+Documented most of the above
Clump The Second:
+Created this changelog
+Added an actual description to the documentation of spawn_falling_node (whoops), also revisioned a few other random pieces of documentation
+Whenever a node falls, all nearby falling_nodes and attached_nodes are updated to prevent such nodes from floating after clump_fall_nodes fall
+Clump Fall Nodes no longer repeatedly try to fall when placed on top of nodes in the falling_node group like sand or gravel
+Split a majority of init.lua into functions.lua and override.lua, with clumpfall as the global variable
*Renamed function clump_fall to do_clump_fall to be less confusable with global clumpfall
-Re-included beds in the clump_fall_node group
+Made override_entity method and used it to fix issue where sand can land on a floating block without causing that floating block to fall by making falling nodes punch themselves after landing
*Moved that override_entity method to the entitycontrol mod and added a dependency and depends.txt for that
*Turned the individual checks inside of the check_group_for_fall function into the function check_individual_for_fall, so it can be used for other purposes
+Heavily modified behavior of objects that are in both clump_fall_node and bed groups:
+You can now fix half beds by punching them (Well, unless they're the untouchable top parts, for now...)
+More importantly, beds' on_destruct method has been fixed to account for the possibility of half beds being destroyed.
+Also, beds are more thorough when checking their other halves, so a destroyed bed will only destroy its own other half, given that such exists
+Added functions that will add to existing on_dig, on_place, and on_punch events instead of replacing them completely. This fixes issues with nodes like Mesecon Switches that will either turn on/off when punched, or will fall down when punched and without support. Now, these kinds of nodes properly do both.
*Overrides the previously changed on_place in this mod now change the after_place_node event because that gives a pos argument usable for the clump_fall function
Clump III:
+Variable support strength:
+Now, not all clump fall nodes are created equally; some, typically types of wood and stone, are much more stable and easier to work with.
+The "level" group now also increases the node's support range
+Though no nodes currently have this group, "clump_fall_support" can be used to give certain nodes a larger support range.
+Added settings that can be changed in the "All Settings" menu: Clumpfall's Clump Interval, Clumpfall's Clump Radius, and Clumpfall's Support Radius
+Added a mod.conf
*Switched license to LGPL2
*Spaced out the changelog a little to make it easier to read
-Removed most of the functions that add to existing node callbacks, except add_punch_event, because minetest.register_on_(callback) functions are used now instead.
+Fixed:
-Error message in debug.txt about undeclared globals x, y, and z during clump falls.
-Chests and other containers losing their contents upon falling
-group:clump_fall_node nodes floating if the group:falling_node node underneath falls.
-Connected nodes like fences refusing to make connections, and only ever remaining pole-shaped.

1
depends.txt Normal file
View File

@ -0,0 +1 @@
entitycontrol

292
functions.lua Normal file
View File

@ -0,0 +1,292 @@
--[[
clumpfall
Copyright (C) 2018-2020 Noodlemire
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
--]]
clumpfall.functions = {} --global functions variable
--[[
Description:
Searches for clump_fall_nodes within a given volume of radius clump_radius and all of the center points between the 3D points given by the parameters.
Parameters:
Two 3D vectors; the first is the smaller, and the second is the larger. These are the two corners of the volume to be searched through. Note that clump_radius is added on to these min and max points, so keep that in mind in relation to the size of the volume that is actually effected by this function.
Returns:
A table containing the positions of all clump_fall_nodes found
--]]
function clumpfall.functions.check_group_for_fall(min_pos, max_pos)
--Local created to temporarily store clump_fall_nodes that should fall down
local nodes_that_can_fall = {}
--iterates through the entire cubic volume contained between the minimum and maximum positions
for t = min_pos.z - clumpfall.clump_radius, max_pos.z + clumpfall.clump_radius do
for n = min_pos.y - clumpfall.clump_radius, max_pos.y + clumpfall.clump_radius do
for i = min_pos.x - clumpfall.clump_radius, max_pos.x + clumpfall.clump_radius do
--Creates a 3D vector to store the position that is currently being inspected
local check_this = {x=i, y=n, z=t}
--If at least one clump_fall_node was found underneath, nothing else will happen. If none are found, the current position will be placed within the table nodes_that_can_fall. Also won't make a node fall if any walkable node is directly underneath, even if that node is not a clump_fall_node
if clumpfall.functions.check_individual_for_fall(check_this, true) then
table.insert(nodes_that_can_fall, check_this)
end
end
end
end
--Once all this looping is complete, the list of nodes that can fall is complete and can be returned.
return nodes_that_can_fall
end
--A helper function to help clumpfall.functions.check_individual_for_fall determine how supportable the node being checked is.
--Being in the cracky (stone) or choppy (wood) groups will help, as well as having a high level.
local function get_support_strength(nodename)
local highest = 1
if minetest.get_item_group(nodename, "cracky") > 0 then
highest = 3
elseif minetest.get_item_group(nodename, "choppy") > 0 then
highest = 2
end
highest = highest + minetest.get_item_group(nodename, "level") + minetest.get_item_group(nodename, "clump_fall_support")
return math.floor(highest * clumpfall.support_radius + 0.5)
end
--[[
Description:
Checks a 3x3 area under the given pos for clump fall nodes that can be used as supports, and for a non-clump walkable node
Parameters:
check_pos: The 3D Vector {x=?, y=?, z=?} as the location in which to check
extended_search: If true, also check for supported side supports.
Returns:
true if none of the described supports are found, false is supports are found, nil if this isn't a clump fall node being checked
--]]
function clumpfall.functions.check_individual_for_fall(check_pos, extended_search)
local check_node = minetest.get_node(check_pos)
--If the position currently being checked belongs to the clump_fall_node group, then
if minetest.get_item_group(check_node.name, "clump_fall_node") ~= 0 then
--First, check for a solid directly underneath. If there is one, this node can't fall.
local underdef = minetest.registered_nodes[minetest.get_node({x=check_pos.x, y=check_pos.y-1, z=check_pos.z}).name]
if not underdef or underdef.walkable then
return false
end
--Next, look for clump fall nodes in a 3x3 area underneath. If one is found, this node can't fall.
for b = check_pos.z - 1, check_pos.z + 1 do
for a = check_pos.x - 1, check_pos.x + 1 do
local bottom_pos = {x=a, y=check_pos.y-1, z=b}
if minetest.get_item_group(minetest.get_node(bottom_pos).name, "clump_fall_node") ~= 0 then
return false
end
end
end
--The extended search, where side supports are factored in.
if extended_search then
--Stores information about nodes at the same high which may be able to support the node being checked.
local support_structure = {}
--A node is easier to support if it's cracky, choppy, and/or has a high level.
local max_support_radius = get_support_strength(check_node.name)
--Supports are calculated one "circle" at a time
for r = 1, max_support_radius - 1 do
support_structure[r] = {}
--In each circle, iterate over a square, with [b, a] being a position within that square.
for b = check_pos.z - r, check_pos.z + r do
support_structure[r][b] = {}
for a = check_pos.x - r, check_pos.x + r do
--This if statement makes sure that the area inside the current circle is not considered more than once.
if b == check_pos.z - r or b == check_pos.z + r or a == check_pos.x - r or a == check_pos.x + r then
--Only consider support when the side node is also a clump fall node.
local side_pos = {x=a, y=check_pos.y, z=b}
if minetest.get_item_group(minetest.get_node(side_pos).name, "clump_fall_node") ~= 0 then
--If this is the first circle, no extra consideration is required.
if r == 1 then
support_structure[r][b][a] = true
else
--Otherwise, look in the inner circle for a support that connects to the node we're looking at right now.
for bi = b - 1, b + 1 do
for ai = a - 1, a + 1 do
if support_structure[r - 1][bi] and support_structure[r - 1][bi][ai] then
support_structure[r][b][a] = true
end
end
end
end
end
end
end
end
--Once a circle is finished, check if any nodes within it have support underneath.
--If they do, it's safe to exit the function early; regardless of what is found in outer circles, that support is enough.
for b = check_pos.z - r, check_pos.z + r do
for a = check_pos.x - r, check_pos.x + r do
if support_structure[r][b][a] then
local side_pos = {x=a, y=check_pos.y, z=b}
--Recursively check each support for supports, but ONLY in the 3x3 area underneath.
if not clumpfall.functions.check_individual_for_fall(side_pos, false) then
return false
end
end
end
end
end
end
--A node can fall only if all support checks have failed.
return true
end
end
--[[
Description:
Initiate a clump fall that starts within the given 3D points, and if needed, will cascade farther until there is nothing left in the area that can fall
Parameters:
Any number of 3D vectors of which to draw a cubic volume around. This volume will be the starting point for this clump fall
Returns:
Nothing
--]]
function clumpfall.functions.do_clump_fall(...)
--Used to store an array version of the arguments
local arg_array = ({...})[1]
--Used to store an array version of the arguments once they are standardized
local node_pos_to_check = {}
--This check is needed to properly standardize the arguments. Without it, results of this function would be needlessly inconsistant.
if type(arg_array[1]) ~= "table" then
node_pos_to_check = {arg_array}
else
node_pos_to_check = arg_array
end
--List of postions of nodes that check_group_for_fall() found to need falling
local node_pos_to_fall = {}
--Variable that assumes that no nodes needed to fall
local found_no_fallable_nodes = true
--Stores the largest x, y, and z values out of the 3D vertices given by the arguments
local max_pos = {}
--Stores the smallest x, y, and z values out of the 3D vertices given by the arguments
local min_pos = {}
--To be used later in this function, this stores the largest x, y, and z values of nodes that were actually found to need falling.
local new_max_pos = {}
--To be used later in this function, this stores the smallest x, y, and z values of nodes that were actually found to need falling.
local new_min_pos = {}
--Compares max_pos and min_pos to the list of arguments, and individually sets the x, y, and z values of each to, respectively, the largest/smallest x/y/z values
for v, pos_find_minmax in pairs(node_pos_to_check) do
if max_pos.x == nil or max_pos.x < pos_find_minmax.x then
max_pos.x = pos_find_minmax.x
end
if max_pos.y == nil or max_pos.y < pos_find_minmax.y then
max_pos.y = pos_find_minmax.y
end
if max_pos.z == nil or max_pos.z < pos_find_minmax.z then
max_pos.z = pos_find_minmax.z
end
if min_pos.x == nil or min_pos.x > pos_find_minmax.x then
min_pos.x = pos_find_minmax.x
end
if min_pos.y == nil or min_pos.y > pos_find_minmax.y then
min_pos.y = pos_find_minmax.y
end
if min_pos.z == nil or min_pos.z > pos_find_minmax.z then
min_pos.z = pos_find_minmax.z
end
end
--Now that min_pos and max_pos have been calculated, they can be used to find fallable nodes
node_pos_to_fall = clumpfall.functions.check_group_for_fall(min_pos, max_pos)
--Next, iterate through each of the newfound clump_fall_node positions, if any...
for v,pos_fall in pairs(node_pos_to_fall) do
--Used to store the node at the current position
local node_fall = minetest.get_node(pos_fall)
--Make one more check in case the node at the current postion already fell or has otherwise been replaced
if minetest.get_item_group(node_fall.name, "clump_fall_node") ~= 0 then
--Finally, turn the node into a falling node.
minetest.spawn_falling_node(pos_fall)
--Update nearby nodes to stop blocks in the falling_node and attached_node groups from floating
clumpfall.functions.update_nearby_nonclump(pos_fall)
--Since a node has truly been found that needed to fall, found_no_fallable_nodes can be set to false
found_no_fallable_nodes = false
--Compares new_max_pos and new_min_pos to the location of each falling node, and individually sets the x, y, and z values of each to, respectively, the largest/smallest x/y/z values
if new_max_pos.x == nil or new_max_pos.x < pos_fall.x then
new_max_pos.x = pos_fall.x
end
if new_max_pos.y == nil or new_max_pos.y < pos_fall.y then
new_max_pos.y = pos_fall.y
end
if new_max_pos.z == nil or new_max_pos.z < pos_fall.z then
new_max_pos.z = pos_fall.z
end
if new_min_pos.x == nil or new_min_pos.x > pos_fall.x then
new_min_pos.x = pos_fall.x
end
if new_min_pos.y == nil or new_min_pos.y > pos_fall.y then
new_min_pos.y = pos_fall.y
end
if new_min_pos.z == nil or new_min_pos.z > pos_fall.z then
new_min_pos.z = pos_fall.z
end
end
end
--If nodes were found that need to fall in the next round of cascading, loop by calling this very method after a set delay (default: 1 second)
if found_no_fallable_nodes == false then
--This will be used with the new min and max position that have been found.
--These are used instead of the old ones so that the range of cascading can't expand indefinitely and cause crashes
minetest.after(clumpfall.clump_interval, clumpfall.functions.do_clump_fall, {new_min_pos, new_max_pos})
end
end
--[[
Description:
Checks the position for any falling nodes or attached nodes to call check_for_falling with, so that falling Clump Fall Nodes do not leave behind floating sand/gravel/plants/etc. The size of the volume checked is based on clump_radius.
Parameters:
pos as the 3D vector {x=?, y=?, z=?} of the position to check around
Returns:
Nothing
--]]
function clumpfall.functions.update_nearby_nonclump(pos)
--Iterates through the entire cubic volume with radius clump_radius and pos as its center
for t = pos.z - clumpfall.clump_radius, pos.z + clumpfall.clump_radius do
for n = pos.y - clumpfall.clump_radius, pos.y + clumpfall.clump_radius do
for i = pos.x - clumpfall.clump_radius, pos.x + clumpfall.clump_radius do
--check_pos is used to store the point that is currently being checked.
local check_pos = {x=i, y=n, z=t}
--check_name is used to store the name of the node at check_pos
local check_name = minetest.get_node(check_pos).name
--If the node being checked doesn't belong to the falling_node or attached_node groups, then
if minetest.get_item_group(check_name, "falling_node") ~= 0 or minetest.get_item_group(check_name, "attached_node") ~= 0 then
--Call the method check_for_falling which will cause those nodes to begin falling if nothing is underneath.
minetest.check_for_falling(check_pos)
end
end
end
end
end

49
init.lua Normal file
View File

@ -0,0 +1,49 @@
--[[
clumpfall
Copyright (C) 2018-2020 Noodlemire
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
--]]
clumpfall = {} --global variable
--the maximum radius of blocks to cause to fall at once.
clumpfall.clump_interval = math.max(0.1, tonumber(minetest.settings:get("clumpfall_clump_interval")) or 1)
clumpfall.clump_radius = math.max(1, tonumber(minetest.settings:get("clumpfall_clump_radius")) or 1)
clumpfall.support_radius = math.max(0, tonumber(minetest.settings:get("clumpfall_support_radius")) or 1)
--Short for modpath, this stores this really long but automatic modpath get
local mp = minetest.get_modpath(minetest.get_current_modname()).."/"
--Load other lua components
dofile(mp.."functions.lua")
dofile(mp.."override.lua")
--Add callbacks to nodes in general so that when they are dug, punched, or placed, a clump fall may begin
minetest.register_on_dignode(function(pos, oldnode, digger)
clumpfall.functions.do_clump_fall(pos)
end)
minetest.register_on_punchnode(function(pos, node, puncher, pointed_thing)
clumpfall.functions.do_clump_fall(pos)
end)
minetest.register_on_placenode(function(pos, newnode, placer, oldnode, itemstack, pointed_thing)
clumpfall.functions.do_clump_fall(pos)
end)
--run the make_nodes_fallable function to make most nodes into Clump Fall Nodes,
minetest.after(0, clumpfall.override.make_nodes_fallable)
--and run the place_node() fix
minetest.after(0, clumpfall.override.fix_falling_nodes)

3
mod.conf Normal file
View File

@ -0,0 +1,3 @@
name = clumpfall
description = Clump Fall Nodes: Any node can fall, and will do so one clump at a time.
depends = entitycontrol

311
override.lua Normal file
View File

@ -0,0 +1,311 @@
--[[
clumpfall
Copyright (C) 2018-2020 Noodlemire
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
--]]
clumpfall.override = {} --global override variable
--[[
Description:
Overrides the on_punch event of the given node in such a way that it adds the provided function to on_punch, without deleting the old on_punch method
Parameters:
nodename: The internal name of the node that will be overridden
new_on_punch: The name of the function that will be called in addition to nodename's usual on_punch event
Returns:
Nothing
--]]
function clumpfall.override.add_punch_event(nodename, new_on_punch)
--Store the old on_punch event for later use
local old_on_punch = minetest.registered_nodes[nodename].on_punch
--Create a function that calls both the old and new on_punch methods
local master_on_punch = function(pos, node, player, pointed_thing)
--Call the old on_punch function if there is one set
if old_on_punch then
old_on_punch(pos, node, player, pointed_thing)
end
--Then, call the new on_punch method
new_on_punch(pos, node, player, pointed_thing)
end
--Override the given node with the combination of old and new on_punch functions
minetest.override_item(nodename, {on_punch = master_on_punch})
end
--[[
Description:
Add a punch event to beds so that if a player punches a half bed, that bed will instantly spawn its other half in the event that said other half doesn't exist, or it will destroy itself if it is unable to spawn its other half
Parameters:
bed_to_override: The name of the bed half to make fixable via punching
Returns:
Nothing
--]]
function clumpfall.override.bed_update_on_punch(bed_to_override)
clumpfall.override.add_punch_event(bed_to_override, function(pos, node)
--If this is indeed a bed being affected and it doens't need to clump fall instead, then
if clumpfall.functions.check_individual_for_fall(pos) == false and minetest.get_item_group(node.name, "bed") ~= 0 then
--Create local variables to store the bed's name without _top or _bottom at the end, the suffix of its other half, and the position of its other half
local base_node_name
local other_suffix
local other_pos
--If this half's name ends in "_bottom", then
if node.name:sub(#node.name - #"bottom", #node.name) == "_bottom" then
--The other half must be the top half, so update variables accordingly.
base_node_name = node.name:sub(1, #node.name - #"_bottom")
other_suffix = "_top"
other_pos = vector.add(pos, minetest.facedir_to_dir(node.param2))
else
--Otherwise, the other half is the bottom half.
base_node_name = node.name:sub(1, #node.name - #"_top")
other_suffix = "_bottom"
other_pos = vector.subtract(pos, minetest.facedir_to_dir(node.param2))
end
--If the name of the node at the other half's position is not actually the name of the other half or that other half is turned incorrectly, then...
if minetest.get_node(other_pos).name ~= base_node_name..other_suffix or minetest.get_node(other_pos).param2 ~= node.param2 then
--Check if the other half is simply missing by seeing it the node at the other half's position is walkable.
if minetest.registered_nodes[minetest.get_node(other_pos).name].walkable == false then
--If not, spawn the other half with the correct position and direction
minetest.set_node(other_pos, {name = base_node_name..other_suffix, param2 = node.param2})
else
--Otherwise, replace this bed half with air and spawn it as an item
minetest.set_node(pos, {name = "air"})
minetest.spawn_item(pos, base_node_name.."_bottom")
end
end
end
end)
end
--[[
Description:
Completely override the on_destruct method of a given bed with a fixed version of the destruct_bed function
Parameters:
bed_name: The name of the bed half to override
Returns:
Nothing
--]]
function clumpfall.override.set_fix_destruct_bed(bed_name)
--Stores a number reporesenting which half of a bed this is
local bed_half
--If this bed half's name ends in _bottom,
if bed_name:sub(#bed_name - #"bottom", #bed_name) == "_bottom" then
--Set bed_half = 1.
bed_half = 1
else
--Otherwise, this is half 2.
bed_half = 2
end
--Override the on_dustruct of the node known by the given name
minetest.override_item(bed_name,
{
on_destruct = function(pos)
--Call the fixed destruct_bed at on_destruct's postion and the value of bed_half
clumpfall.override.fix_destruct_bed(pos, bed_half)
--Just in case there was only one bed punched, reset reverse to false afterwards
reverse = false
end
})
end
--[[
Description:
Destroy a bed in such a way that the other half will also be destroyed, but only if that other half actually exists and this half hasn't already been destroyed
Parameters:
pos: The position of the bed half to destroy
n: A number representing which half of the bed is currently being destoryed
Returns:
Nothing
--]]
--reverse: global variable that defaults to false, and is used in determining if the other bed half should be destroyed
reverse = false
function clumpfall.override.fix_destruct_bed(pos, n)
--Store the node at the given position
local node = minetest.get_node(pos)
--Will be used to store the position of the other bed half
local other
--Based on n and this node's param2 (direction), get the other half's postion
if n == 2 then
local dir = minetest.facedir_to_dir(node.param2)
other = vector.subtract(pos, dir)
elseif n == 1 then
local dir = minetest.facedir_to_dir(node.param2)
other = vector.add(pos, dir)
end
--Flip the value inside of reverse. If reverse was false before, it is true now and this bed will destroy the other half. If not, this half will do nothing more.
reverse = not reverse
--If the other half is indeed a bed, it is this bed's other half (and not the other half of a completely different bed), and reverse is true, then
if minetest.get_item_group(minetest.get_node(other).name, "bed") ~= 0 and minetest.get_node(other).param2 == node.param2 and reverse then
--Delete the other node without spawning an item; this will call the entirety of that bed half's on_destruct before reverse is automatically reset to false
minetest.remove_node(other)
--Use the helper function check_for_falling to update nodes near the other half
minetest.check_for_falling(other)
end
end
--[[
Description:
Overrides falling_node entities so that they punch their position when spawning and landing, so that they interact properly with clump fall nodes.
Parameters:
None
Returns:
Nothing
--]]
function clumpfall.override.fix_falling_nodes()
entitycontrol.override_entity("__builtin:falling_node",
{
on_activate = function(self, staticdata)
self.object:set_armor_groups({immortal = 1})
local ds = minetest.deserialize(staticdata)
if ds and ds.node then
self:set_node(ds.node, ds.meta)
elseif ds then
self:set_node(ds)
elseif staticdata ~= "" then
self:set_node({name = staticdata})
end
--Punch node at position after a delay of spawning (default: 1 second), so clump fall nodes on top don't float
minetest.after(clumpfall.clump_interval, minetest.punch_node, self.object:get_pos())
end,
on_step = function(self, dtime)
-- Set gravity
local acceleration = self.object:get_acceleration()
if not vector.equals(acceleration, {x = 0, y = -10, z = 0}) then
self.object:set_acceleration({x = 0, y = -10, z = 0})
end
-- Turn to actual node when colliding with ground, or continue to move
local pos = self.object:get_pos()
-- Position of bottom center point
local bcp = {x = pos.x, y = pos.y - 0.7, z = pos.z}
-- 'bcn' is nil for unloaded nodes
local bcn = minetest.get_node_or_nil(bcp)
-- Delete on contact with ignore at world edges
if bcn and bcn.name == "ignore" then
self.object:remove()
return
end
local bcd = bcn and minetest.registered_nodes[bcn.name]
if bcn and
(not bcd or bcd.walkable or
(minetest.get_item_group(self.node.name, "float") ~= 0 and
bcd.liquidtype ~= "none")) then
if bcd and bcd.leveled and
bcn.name == self.node.name then
local addlevel = self.node.level
if not addlevel or addlevel <= 0 then
addlevel = bcd.leveled
end
if minetest.add_node_level(bcp, addlevel) == 0 then
self.object:remove()
return
end
elseif bcd and bcd.buildable_to and
(minetest.get_item_group(self.node.name, "float") == 0 or
bcd.liquidtype == "none") then
minetest.remove_node(bcp)
return
end
local np = {x = bcp.x, y = bcp.y + 1, z = bcp.z}
-- Check what's here
local n2 = minetest.get_node(np)
local nd = minetest.registered_nodes[n2.name]
-- If it's not air or liquid, remove node and replace it with
-- it's drops
if n2.name ~= "air" and (not nd or nd.liquidtype == "none") then
minetest.remove_node(np)
if nd and nd.buildable_to == false then
-- Add dropped items
local drops = minetest.get_node_drops(n2, "")
for _, dropped_item in pairs(drops) do
minetest.add_item(np, dropped_item)
end
end
-- Run script hook
for _, callback in pairs(minetest.registered_on_dignodes) do
callback(np, n2)
end
end
-- Create node and remove entity
local def = minetest.registered_nodes[self.node.name]
if def then
--After landing, punch the node it set so that it causes a floating clump fall node to realize it should fall.
minetest.set_node(np, self.node)
minetest.punch_node(np)
if self.meta then
local meta = minetest.get_meta(np)
meta:from_table(self.meta)
end
if def.sounds and def.sounds.place then
minetest.sound_play(def.sounds.place, {pos = np})
end
end
self.object:remove()
minetest.check_for_falling(np)
return
end
local vel = self.object:get_velocity()
if vector.equals(vel, {x = 0, y = 0, z = 0}) then
local npos = self.object:get_pos()
self.object:set_pos(vector.round(npos))
end
end
})
end
--[[
Description:
This function iterates through every registered node, including those that were registered by other mods, and turns ones that don't already fall by themselves and aren't unbreakable into clump_fall_nodes
Parameters:
None
Returns:
Nothing
--]]
function clumpfall.override.make_nodes_fallable()
--Inspect each registered node, one at a time
for nodename, nodereal in pairs(minetest.registered_nodes) do
--create a temporary list of the current node's groups
local temp_node_group_list = nodereal.groups
--Ensure that the nodes being modified aren't the placeholder block types that tecnically don't exist
if nodename ~= "air" and nodename ~= "ignore" and
minetest.get_item_group(nodename, "falling_node") == 0 and --Don't need to affect nodes that already fall by themselves
minetest.get_item_group(nodename, "attached_node") == 0 and --Same thing for nodes in this group, which fall when no longer attached to another node
minetest.get_item_group(nodename, "liquid") == 0 and --Same thing for nodes in this group, which do technically fall and spread around
minetest.get_item_group(nodename, "unbreakable") == 0 then --Lastly, if a block is invulnerable to begin with, it shouldn't fall down like a typical node
--Initialize a new group variable in the temp list known as "clump_fall_node" as 1
temp_node_group_list.clump_fall_node = 1
--Override the node's previous group list with the one that includes the new clump_fall_node group
--minetest.override_item(nodename, {groups = temp_node_group_list})
end
if minetest.get_item_group(nodename, "bed") ~= 0 then
clumpfall.override.bed_update_on_punch(nodename)
clumpfall.override.set_fix_destruct_bed(nodename)
end
end
end

10
settingtypes.txt Normal file
View File

@ -0,0 +1,10 @@
#The amount of time, in seconds, that must pass before another clump can fall.
clumpfall_clump_interval (Clumpfall's Clump Interval) float 1
#Increasing this increases that maximum size of each individual clump.
#Warning: Increasing this setting can cause a lot of lag!
clumpfall_clump_radius (Clumpfall's Clump Radius) int 1
#Multiply each node's support radius by this number. This means that increasing it will make all nodes easier to support.
#However, at minimum, a clump fall node will always be supported if its lower edge or corner touches another clump fall node.
clumpfall_support_radius (Clumpfall's Support Radius) float 1