steps to reproduce

Write a loop, from 1 to 80000, each time add a random int to the max heap.

In theory it takes very little time(NlogN, N=80000, <1sec ), but the program does take a long time.

I'v also tested the BinaryHeap in https://github.com/SolutionsDesign/Algorithmia, it performs well, so it is probably due to the bad algorithm.

It's not easy to understand what the code generators under jctools-build are supposed to do. I think one or two phases documenting their goal would be useful.

I am proposing to document these classes:

• JavaParsingAtomicArrayQueueGenerator.java
• JavaParsingAtomicLinkedQueueGenerator.java
• JavaParsingAtomicQueueGenerator.java

ZTransducer is an effectful chunk processing function, and thus forms an arrow. We should add the following combinators on it:

• zipping: (ZTransducer[A, B], ZTransducer[A, C]) => ZTransducer[A, (B, C)]
• racing: (ZTransducer[A, B], ZTransducer[A, C]) => ZTransducer[A, Either[B, C]] looks problematic to implement currently
• both: `(ZTransducer[A, C], ZTransducer[B, D]) => ZTr

The ShouldQueue interface is a laravel common to tell the queueable class to queue itself as normal behavior.
It would be great if this packages supports this interface and queues actions called via execute() only if the class implements this interface.

Check the repository

You can find the book here

Go to any unsolved chapter solve it's Programming Projects.

Keep .java file in the correct folder and update the ReadMe.md accordingly.

Add a PR 😄 and be a contribu