Release 5.1

• BiOptional orElse(a, b), orElseThrow().
• Both<A, B> and collectors.

Release 5.0

• BiOptional
• BiStream#findFirst(), BiStream#findAny()
• BiStream#collect(container, accumulator)

Release 4.8

• flatMapping() to BiStream
• BiComparator

Release 4.7

• mug-guava artifact with Guava specific collectors and BiCollectors
• BiStream mapKeysIfPresent(), mapValuesIfPresent().

Release 4.6

• Substring removeAllFrom(), replaceAllFrom(), delimit(), iterateIn() etc.
• split() strings to Map, Multimap, BiStream or custom collection.
• MoreStreams.flatteningMaps()

Release 4.4

• Tarjan's strongly connected components algorithm
• yield() to turn recursive algorithms into streams.

Release 4.3

• Walker.inGraph(...).topologicalOrderFrom() and Walker.inGraph(...).detectCycleFrom().

Release 4.2

• Walker.inBinaryTree() with in-order and more efficient traversals.

Release 4.1

• Selection.

Release 4.0

Graph utilities.

• Walker walks (or traverses) a graph or tree as a lazy Stream.
• CycleDetector detects cycles in arbitrary graph topology (Guava's Graph, or others).
• ShortestPath implements Dijkstra algorithm as a lazy Stream.