Re:Graph: Faster Abstractions for Structured Computation
by taliesinb on Wednesday May 01, 2013 @11:21PM
(#5642313)
At one point, I did a similar thing for a computer vision system I was working on.
That was quite naturally a filter graph: every component was time-dependent, caching and logging was important (rewind to find this blob 5 minutes ago), and parallelism was crucial because the system had to deal with synchronizing multiple IP cameras.
Amazingly, it was possible to do this in an entirely safe way in C++, with templates.
I wish I could put the code up on github, but unfortunately the company got taken apart and sold, so the code is in limbo.
That was quite naturally a filter graph: every component was time-dependent, caching and logging was important (rewind to find this blob 5 minutes ago), and parallelism was crucial because the system had to deal with synchronizing multiple IP cameras.
Amazingly, it was possible to do this in an entirely safe way in C++, with templates.
I wish I could put the code up on github, but unfortunately the company got taken apart and sold, so the code is in limbo.