Improve falling tree performance and consistency on tree scan

[avavakin]

Improve falling tree performance and consistency on tree scan

1. Frequently used tree extremums cached:

• getTopMostLog
• getBottomMostLog
• getStart

they are updated only when new part added
retrieval is O(1) instead of O(n)

2. Tree builds only once

Created TreeHandlerState to build tree only once for one event without rebuling it

Reasons:

• performance improvements (both CPU and memory)
• consistency: in case of introduction multithreading in mod platforms or Minecraft itself we would have a risk of passing validation shouldCancelEvent and breaking tree breakTree could build different trees in rare circumstances

[Rakambda]

I did a little bit of refactoring/changes :

• TreeHandlerState : wasn't a big fan of it, what actually happened is that the create method was more of a factory for the treeHandler that now contains its own state to perform actions. It's purely a naming thng, doesn't change the logic.
  • The new create method is part of the factory
• For the mutable tree, instead of abstracting its behavior with an interface, also make a class that only exposes the actual immutable behavior. This avoids a potential cast back to MutableTree later on.
• Refactor caching logic to avoid duplication.

If that's fine with you, we can merge the PR.