on Sat Jun 23 2012, Irit Katriel
wrote:
> Good day,
>
> Streamulus is a C++ DSEL for event stream processing.
>
> It uses Proto to transform simple expressions into a data structure that
> computes
> the expression over an infinite stream of inputs. With user-defined operators
> that
> ca
On 24 Jun 2012, at 03:47, Dave Abrahams wrote:
>
> Well, I think the hello world example is too simple to illustrate what
> this does, and the blog posting is TL;DR, but I skimmed it, and still
> didn't really have a clue. Have you looked at
> http://www.boost.org/doc/libs/1_49_0/doc/html/accumu
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 6/24/2012 8:50 AM, Irit Katriel wrote:
>
> On 24 Jun 2012, at 03:47, Dave Abrahams wrote:
>>
>> Well, I think the hello world example is too simple to illustrate
>> what this does, and the blog posting is TL;DR, but I skimmed it,
>> and still didn
On 24 Jun 2012, at 22:24, Eric Niebler wrote:
> Very interesting! So ... data flow? Or does this take inspiration from
> stream databases?
>
Thank you.
Yes, data flow. With central control to make sure things propagate through the
graph in topological order.
This is necessary for diamond-sha
on Sun Jun 24 2012, Eric Niebler
wrote:
> On 6/24/2012 8:50 AM, Irit Katriel wrote:
>>
>> In the accumulators library, all the accumulators are invoked for
>> every update to the input. This is why the visitation order can be
>> determined at compile time.
>
> That's correct.
Are you forgetti
On 6/24/2012 4:42 PM, Dave Abrahams wrote:
>
> on Sun Jun 24 2012, Eric Niebler
> wrote:
>
>> On 6/24/2012 8:50 AM, Irit Katriel wrote:
>>>
>>> In the accumulators library, all the accumulators are invoked for
>>> every update to the input. This is why the visitation order can be
>>> determined
