Two-Phase Recipe Addition System

[TechLord22]

What

Adds recipes into the trie in a two-phase system. This will reduce memory usage and provide a minor speed boost to recipe searching. It reduces memory usage by flattening all of the recipe inputs, and sorting them by frequency, then using that frequency index to sort each recipe's inputs and add them in sorted order. This means the biggest nodes will be at the root of the trie and the leaves will be the smallest, instead of an even distribution. This will lower the size of the maps overall in the trie by compacting all occurrences of ingredients into the same condensed region within the datastructure.

Implementation Details

I refactored and significantly cleaned up GTRecipeLookup. It is now called RecipeDB. I stopped exposing most of the internal implementation details of GTRecipeLookup that never should have been made available outside it.

Outcome

Better performance.

Potential Compatibility Issues

Will cause code breakage. The majority of the time, the fix is changing gtRecipeType.getLookup().find() to gtRecipeType.db().find().

Any addons using the internal implementation details of GTRecipeLookup were doing something very wrong, and there is no obvious migration path for them. They will need to figure out how to move to the actual API methods, or result to brittle unsupported mixins into GT code.