From 23027a2801726c3e5d945e63c86846b5234dd2e5 Mon Sep 17 00:00:00 2001 From: Alexander Golubev Date: Tue, 31 May 2016 13:28:07 +0300 Subject: [PATCH] =str #19921 Error in documentation: Graph_cycles (#20656) * =str 19921 Error in documentation: Graph_cycles * =str 19921 Error in documentation: Graph_cycles --- akka-docs/rst/java/stream/stream-graphs.rst | 3 +++ akka-docs/rst/scala/stream/stream-graphs.rst | 3 +++ 2 files changed, 6 insertions(+) diff --git a/akka-docs/rst/java/stream/stream-graphs.rst b/akka-docs/rst/java/stream/stream-graphs.rst index f7b5b3cab7..2c5675e034 100644 --- a/akka-docs/rst/java/stream/stream-graphs.rst +++ b/akka-docs/rst/java/stream/stream-graphs.rst @@ -235,6 +235,9 @@ Cycles in bounded stream topologies need special considerations to avoid potenti This section shows several examples of problems that can arise from the presence of feedback arcs in stream processing graphs. +In the following examples runnable graphs are created but do not run because each have some issue and will deadlock after start. +``Source`` variable is not defined as the nature and number of element does not matter for described problems. + The first example demonstrates a graph that contains a naive cycle. The graph takes elements from the source, prints them, then broadcasts those elements to a consumer (we just used ``Sink.ignore`` for now) and to a feedback arc that is merged back into the main diff --git a/akka-docs/rst/scala/stream/stream-graphs.rst b/akka-docs/rst/scala/stream/stream-graphs.rst index d9b9f6bf55..8bfa9611c4 100644 --- a/akka-docs/rst/scala/stream/stream-graphs.rst +++ b/akka-docs/rst/scala/stream/stream-graphs.rst @@ -292,6 +292,9 @@ Cycles in bounded stream topologies need special considerations to avoid potenti This section shows several examples of problems that can arise from the presence of feedback arcs in stream processing graphs. +In the following examples runnable graphs are created but do not run because each have some issue and will deadlock after start. +``Source`` variable is not defined as the nature and number of element does not matter for described problems. + The first example demonstrates a graph that contains a naïve cycle. The graph takes elements from the source, prints them, then broadcasts those elements to a consumer (we just used ``Sink.ignore`` for now) and to a feedback arc that is merged back into the main stream via