iritkatriel / streamulus Goto Github PK

1. The Stream should have timestamps so that ticks are combined correctly even in situations like x+filter(x).
2. Merging input streams should happen in a separate class so that different merge methods can be implemented, such as a coalesce version. Also, if there is no need to timestamp resolution (single input or user hint), it can be skipped.

It would work like this:

1. Streamulus defines placeholder terminals streamulus::_1, etc..
2. The user defines a streamulus expression over them.
3. Then user subscribes the expression along with actual strops that replace the placeholders.

The advantage is that expressions can be reused on different inputs.

Initially, just issue an error.
Bonus points: Allow feedback loops (exclude them from top-sort).

Unsubscribe marks nodes as deleted. Such a node will never be activated. However, it is not actually removed from the graph (so we have a memory leak). This is because the graph uses vectors for the node-list and edge-list. Vectors are more efficient for everything but deletions, and deletions will not happen often. The solution is to keep track of the number of deleted nodes, and when there are many, replace the graph by a new ones and insert only the unmarked nodes to it.

Check parameter count and types. Generate a friendly error message if they don't match.
(Currently the error message is whatever the compiler spews out when the compilation fails).