Yeah, that's what I ended up doing. It's just a little less general than
chaining all the values together and then combining them.
Thanks,
Tal
On Monday, March 7, 2016 at 8:46:40 AM UTC+2, hbf wrote:
>
> Can you do it recursively? Write method that takes two and combines their
> materialized
Can you do it recursively? Write method that takes two and combines their
materialized values. Then recurse to do *n*.
Hbf.
On Friday, 26 February 2016 05:02:34 UTC-8, Tal Pressman wrote:
>
> This isn't actually a matter of size - I don't expect that I'll have too
> many sinks, I just don't
This isn't actually a matter of size - I don't expect that I'll have too
many sinks, I just don't know how many I'll have ahead of time.
Tal
On Friday, February 26, 2016 at 2:49:16 PM UTC+2, drewhk wrote:
>
>
>
> On Fri, Feb 26, 2016 at 1:45 PM, Tal Pressman > wrote:
>
>>
On Fri, Feb 26, 2016 at 1:45 PM, Tal Pressman wrote:
> Hi,
>
> So in my case all the sinks return a Future (well, CompletionStage) and I
> want to sequence them.
> I understand the HLists might be a little too complicated (and I'm not
> sure if it can be used from Java...) but
Hi,
So in my case all the sinks return a Future (well, CompletionStage) and I
want to sequence them.
I understand the HLists might be a little too complicated (and I'm not sure
if it can be used from Java...) but I still think something that works on a
Seq of the least common ancestor could be
Hi Tal,
The issue why you can't convert in the GraphDSL an arbitrary number of
materialized values is because that would need HLists (lists if
heterogeneous types, a generalization of tuples). What is exactly what you
want to achieve?
-Endre
On Thu, Feb 25, 2016 at 3:50 PM, Tal Pressman
Hi,
I find myself needing a way to send messages to several sinks, while
aggregating their materialized values. Trying to use the GraphDSL, I can
either:
- Pass a static number of graphs to GraphDSL.create and use their
materialized values, or
- Call builder.add for each graph, but