Why are transitions internally stored as a key pair table rather than an array?

[LeehamsonThe3rd]

This decision doesn't make very much sense to me and it also makes having transitions which should be executed in a specific order less obvious. In my game, I have a system where if a player gets ragdolled and they need to get up they can hold the block key to preemptively block as soon as the players ragdoll state expires. However, I have another state transition which sets the player state to a getting up state. I want to check if the player is blocking first before trying to make the player get up. However, when transitions are assigned a random identifier the key pair table in which they're stored in will automatically sort itself by alphabet effectively making the decision of whether to check for the player blocking or getting up random. I love this project and it's very useful for me, but the decision to me seems very irrational as to my knowledge making it a key pair table seems completely arbitrary. I have thought of ways to fix this in my own case, but I just don't really want other people to get stuck on this.

[LeehamsonThe3rd]

Actually, I would just like to know why this exists. I changed the _ to i and the index transitionClone.name to i which fixed the problem for me. I think this solution would just make more sense in general and hope to see it implemented

[prooheckcp]

Hi, the reason why it is stored by the name rather than by a numerical value was to have an easy 0(1) way of avoiding duplicate transitions (I believe the states use similar logic to this).

Execution order of transitions was never taken into consideration primarily because I've never fallen into a situation where that was important for my use case (but I can imagine some scenarios where it would make sense (e.g having a state transition have priority over another).

I'll consider adding a new property to define execution priority and set by default the fed order to the system. I'm currently not in my home country so I'll likely only look into this in a week

[advra]

Hi All,

I needed this feature and found it was necessary for complex behavior graphs. I created a MR with the needed changes which uses optional priorities. This solution retains O(1) execution as the list is sorted one time upon initialization.

#27