Iterators

These are used to dictate how the the behaviour tree is traversed by the system. Each node has it own default iterator.

Types of Iterators

In Order

This version will get the next node within the collection, it will not carry out checks before returning and will not loop.

Until Requirement Met

This will get the next node within the collection which requirements are met, this means it'll skip over ones which are not met. It will not loop.

Random Order

This will randomly select a node from the selection and will do so for the amount in the collection. It does not loop and can have duplicates

Random Unique Order

This will randomly select a node from the selection and will do so until nodes in the collection have run. It does not loop but can not have duplicates.

Until Fail

This version will get the next node within the collection, it will not carry out checks before returning but will loop. Failing will result in all other nodes being skipped like normal.

Until Requirement Weighted

This version will get the next node within the collection, it will not carry out checks before returning but will loop. Failing will result in all other nodes being skipped like normal. This will be done in order of local weight.

Weighted

This version will get the next node within the collection based upon local weighting, it will not carry out checks before returning and will not loop.