docs: public final int weakOffer(final E e) {
          if (null == e) {
              throw new NullPointerException("Null is not a valid element");
          }
          final int mask = this.mask;
          final long capacity = mask + 1;
          final long currentTail = lvProducerIndex(); // LoadLoad
          final long consumerIndexCache = lvConsumerIndexCache(); // LoadLoad
          final long wrapPoint = currentTail - capacity;
          if (consumerIndexCache <= wrapPoint) {
              long currHead = lvConsumerIndex(); // LoadLoad
              if (currHead <= wrapPoint) {
                  return 1; // FULL :(
              } else {
                  svConsumerIndexCache(currHead); // StoreLoad
              }
          }
  
          // look Ma, no loop!
          if (!casProducerIndex(currentTail, currentTail + 1)) {
              return -1; // CAS FAIL :(
          }
  
          // Won CAS, move on to storing
          final int offset = calcElementOffset(currentTail, mask);
          soElement(offset, e);
          return 0; // AWESOME :)
      }