nape.shape

Internally this list is at present implemented as a linked list with
object pooled nodes and iterators with various fast paths made for
standard access patterns (For instance accessing successive elements
runs in constant time when using random access functions)

Iteration of this list can be done in various ways, but the preferred
way on all targets, is through use of the foreach function:

list.foreach(function (obj) {
});

This method is inlined so that in haxe no closure will need to be created.

In AS3, a closure would need to be created in general, so for performance
reasons you 'may' choose to use iteration as follows:

Internally this list is at present implemented as a linked list with
object pooled nodes and iterators with various fast paths made for
standard access patterns (For instance accessing successive elements
runs in constant time when using random access functions)

Iteration of this list can be done in various ways, but the preferred
way on all targets, is through use of the foreach function:

list.foreach(function (obj) {
});

This method is inlined so that in haxe no closure will need to be created.

In AS3, a closure would need to be created in general, so for performance
reasons you 'may' choose to use iteration as follows: