Client->>Client: Process Item 1
    App->>Client: Send Item 2
    App->>App: Produce Item 3
    Client->>Client: Process Item 2
    App->>Client: Send Item 3
    Client->>Client: Process Item 3
    Note over App: Keeps producing...
    Note over Client: Keeps consuming...
```

It could even be an infinite stream, where you keep sending data.

## JSON Lines { #json-lines }

        // When
        Type1Message type1 = new Type1Message(mockContext, flags, null, null);

        // Then
        // Note: Constructor sets default flags OR'd with provided flags
        assertTrue((type1.getFlags() & flags) != 0);
        // Note: getType() method does not exist in Type1Message
    }

    @Test
    @DisplayName("Should create Type 1 message with domain and workstation")

```Python
contents = myfile.file.read()
```

/// note | Technische Details zu `async`

Wenn Sie die `async`-Methoden verwenden, führt **FastAPI** die Datei-Methoden in einem <abbr title="Mehrere unabhängige Kindprozesse">Threadpool</abbr> aus und erwartet sie.

///

/// note | Technische Details zu Starlette

                "Prefix": "users-uploads/"
            },
            "NoncurrentVersionExpiration": {
                "NewerNoncurrentVersions": 5
            }
        }
    ]
}
```
Note: This rule has an implicit zero NoncurrentDays, which makes the expiry of those 'extra' noncurrent versions immediate.

#### 3.2.b Automatic removal of all versions (MinIO only extension)

### Custom Algorithms (SFTP)

Custom algorithms can be specified via command line parameters.
Algorithms are comma separated. 
Note that valid values does not in all cases represent default values.

`--sftp=pub-key-algos=...` specifies the supported client public key
authentication algorithms. Note that this doesn't include certificate types
since those use the underlying algorithm. This list is sent to the client if

/**
 * Standard implementation of {@link Network} that supports the options supplied by {@link
 * NetworkBuilder}.
 *
 * <p>This class maintains a map of nodes to {@link NetworkConnections}. This class also maintains a
 * map of edges to reference nodes. The reference node is defined to be the edge's source node on
 * directed graphs, and an arbitrary endpoint of the edge on undirected graphs.
 *

    client ->> dep_req: Startet den Request
    Note over dep_req: Führt den Code bis zum yield aus
    dep_req ->> dep_func: Reicht Abhängigkeit weiter
    Note over dep_func: Führt den Code bis zum yield aus
    dep_func ->> operation: Führt Pfadoperation mit Abhängigkeit aus
    operation ->> dep_func: Kehrt aus Pfadoperation zurück
    Note over dep_func: Führt Code nach yield aus
    Note over dep_func: ✅ Abhängigkeit geschlossen

    /**
     * Get the number of currently blocked IPs.
     * Note: This may include expired entries not yet evicted.
     * @return the count of blocked IPs
     */
    public int getBlockedIpCount() {
        blockedIps.cleanUp();
        return (int) blockedIps.size();
    }

    /**
     * Get the number of tracked IP counters.
     * Note: This may include expired entries not yet evicted.

allowing a racing thread to read 1 as well.
</p>

<p>
Note that all these optimizations are permitted in C/C++ compilers:
a Go compiler sharing a back end with a C/C++ compiler must take care
to disable optimizations that are invalid for Go.
</p>

<p>
Note that the prohibition on introducing data races
does not apply if the compiler can prove that the races

import com.google.errorprone.annotations.DoNotMock;

/**
 * Provides similar behavior to {@link String#intern} for any immutable type. Common implementations
 * are available from the {@link Interners} class.
 *
 * <p>Note that {@code String.intern()} has some well-known performance limitations, and should
 * generally be avoided. Prefer {@link Interners#newWeakInterner} or another {@code Interner}
 * implementation even for {@code String} interning.
 *