I’m trying to get the closest hit to the origin of a multi-sphere trace, but I can’t seam to find a clean efficient way of doing this without checking each and every result. Is there no order to the results? I assumed first index of the hit array would be exactly what I need, but it’s sometimes way off in no mans land.
I’ve a chain lightning ability and of course want it to chain to the nearest next target. Below is my collision check.
You could make a function which takes the Out Hits array, grabs the Distance from hit result struct, puts into a local Float array, and then get the Min value from float array.
I know I can intenerate through every hit, but was hoping to avoid that. Blows my mind there’s no built in functionality for this. Surely it’s a common check, lol. If I’ve to intenerate over the hits it will have to be moved to CPP as BP is ridiculously slow dealing with large loops as this could hit 30+ AI or more easily.
It’s significantly slower. It’s easy to test. Make a simple bullet manager looping a large array of vectors and calculate their next destination based off their speed. Lets say there’s 100 bullets for example. This will be a lot slower in BP than CPP. It’s honestly the only bottleneck I’ve found in the BP VM thus far is that it’s terrible for looping arrays of data.
Anyway, solving this with the above BP solution for those curious for a solution. I however have implemented this in CPP. Works fine. Just weird there’s no internal solution for this.
Basically take the hits, loop them, get the distance between trace start and the actor. Now add this to a Map variable with float key and the hit as the value. Once that’s complete get the keys from the map and sort them (I’m using LE Extended Standard Library here for this). Now loop the keys and add them to a sorted hits array using a foreach break and break the loop once you’ve the number of hits you want. You can optionally reserve the sort to get the furthest hits.
