This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
If 'true', provides a fix for possible leaks through | |
Minecraft's enchantment helper code that can leak | |
entity and world references without much interaction | |
Forge native (so when running SpongeForge implementation) | |
has a similar patch, but Sponge's patch works a little harder | |
at it, but Vanilla (SpongeVanilla implementation) does NOT | |
have any of the patch, leading to the recommendation that this | |
patch is enabled "for sure" when using SpongeVanilla implementation. | |
See https://bugs.mojang.com/browse/MC-128547 for more information. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
ServerRoot "/etc/httpd" | |
Listen 80 | |
Include conf.modules.d/*.conf | |
User apache | |
Group apache | |
<Directory /> | |
AllowOverride none |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
for(value in your dataset) | |
{ | |
for(unique in List1) | |
{ | |
if(unique == value) | |
{ | |
List2[index]++; | |
return to original loop; | |
} | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
1) Create 2 lists: List1 and List2. | |
List1 is the unique values from the original data | |
List2 is the frequency those items appear in the data. | |
List1 and List2 are linked by their index. I.e. List1[9] will look at List2[9] for the frequency | |
2) Go through List2 and find the largest value in the list. | |
3) Go through List2 again, looking for this value. | |
If value is found, go to List1[x], store that value into List3. |