public static <T extends @Nullable Object, E>
      Collector<T, ?, ImmutableSortedMultiset<E>> toImmutableSortedMultiset(
          Comparator<? super E> comparator,
          Function<? super T, ? extends E> elementFunction,
          ToIntFunction<? super T> countFunction) {
    checkNotNull(comparator);
    checkNotNull(elementFunction);
    checkNotNull(countFunction);
    return Collector.of(

      return null;
    }
  }

  // this doc comment is overridden to remove the reference to collections
  // greater in size than Integer.MAX_VALUE
  /**
   * Returns the number of elements in this queue.
   *
   * @return the number of elements in this queue
   */
  @CanIgnoreReturnValue
  @Override
  public int size() {
    Monitor monitor = this.monitor;
    monitor.enter();
    try {

    public String id;

    /** Sequence number for ordering search list entries */
    @ValidateTypeFailure
    public Long seqNo;

    /** Primary term value for search list configuration */
    @ValidateTypeFailure
    public Long primaryTerm;

    /**
     * Default constructor for EditForm.
     */
    public EditForm() {
        super();
    }

   * provides more control over the underlying data structure.
   *
   * @param expectedKeys the expected number of distinct keys
   * @param expectedValuesPerKey the expected average number of values per key
   * @throws IllegalArgumentException if {@code expectedKeys} or {@code expectedValuesPerKey} is
   *     negative
   */

     * @param <P>           the type of problem
     * @param maxCountLimit the maximum number of problems to preserve
     * @param filter        predicate to decide which problems to record
     * @return a new filtered problem collector instance
     */
    @Nonnull
    static <P extends BuilderProblem> ProblemCollector<P> create(int maxCountLimit, Predicate<? super P> filter) {
        return new Impl<>(maxCountLimit, filter);
    }

			}
		default:
			bts, err = msgp.Skip(bts)
			if err != nil {
				err = msgp.WrapError(err)
				return
			}
		}
	}
	o = bts
	return
}

// Msgsize returns an upper bound estimate of the number of bytes occupied by the serialized message
func (z *allTierStats) Msgsize() (s int) {
	s = 1 + 3 + msgp.MapHeaderSize
	if z.Tiers != nil {
		for za0001, za0002 := range z.Tiers {
			_ = za0002

        }
        return len;
    }

    /**
     * Writes the AndX wire format to buffer
     * @param dst the destination buffer
     * @param dstIndex the starting index
     * @return the number of bytes written
     */
    protected int writeAndXWireFormat(final byte[] dst, int dstIndex) {
        final int start = dstIndex;

    public String url;

    /** Number of results parameter */
    public String num;

    /** Sort order parameter for search results */
    public String sort;

    /** Language parameter for search interface */
    public String lang;

    /**
     * Default constructor for ErrorForm.
     */
    public ErrorForm() {
        super();
    }

    }

    @Override
    public String toString() {
      return iterable.toString();
    }
    // no equals and hashCode; it would break the contract!
  }

  /** Returns the number of elements in {@code iterable}. */
  public static int size(Iterable<?> iterable) {
    return (iterable instanceof Collection)
        ? ((Collection<?>) iterable).size()
        : Iterators.size(iterable.iterator());

    public SmbComReadAndX(final Configuration config) {
        super(config, SMB_COM_READ_ANDX);
        this.openTimeout = 0xFFFFFFFF;
    }

    /**
     * Constructs a Read AndX request with parameters.
     *
     * @param config the configuration
     * @param fid the file identifier
     * @param offset the file offset to read from
     * @param maxCount the maximum number of bytes to read
     * @param andx the next command in the chain