code: private boolean move0(PoolChunk<T> chunk) {
          if (prevList == null) {
              // There is no previous PoolChunkList so return false which result in having the PoolChunk destroyed and
              // all memory associated with the PoolChunk will be released.
              assert chunk.usage() == 0;
              return false;
          }
          return prevList.move(chunk);
      }
docs: Moves the {@link PoolChunk} down the {@link PoolChunkList} linked-list so it will end up in the right
  {@link PoolChunkList} that has the correct minUsage / maxUsage in respect to {@link PoolChunk#usage()}.