Under the Render_Master system, a tree structure may be implemented on top of a linked list such that gl state changes are ordered in an optimal manner. For example, switching shader programs is expensive and so should happen infrequently, while changing uniform values is cheap and may happen often. So a tree to organize queued renders would work something like this:
And at the bottom exists some sort of array (probably linked list since we don't know beforehand what will need to be drawn), which describes an order for state changes and draw calls. Then on every tick the master render system will iterate through it and draw everything.
Under the Render_Master system, a tree structure may be implemented on top of a linked list such that gl state changes are ordered in an optimal manner. For example, switching shader programs is expensive and so should happen infrequently, while changing uniform values is cheap and may happen often. So a tree to organize queued renders would work something like this:
uniforms ... ... ... ... ... ...
And at the bottom exists some sort of array (probably linked list since we don't know beforehand what will need to be drawn), which describes an order for state changes and draw calls. Then on every tick the master render system will iterate through it and draw everything.