*/
    int read() throws SmbException;

    /**
     * Read into buffer from current position
     *
     * @param b
     *            buffer
     * @return number of bytes read
     * @throws SmbException if an I/O error occurs during read
     */
    int read(byte[] b) throws SmbException;

    /**
     * Read into buffer from current position
     *
     * @param b

                        "price": {"title": "Price", "type": "number"},
                        "description": {
                            "title": "Description",
                            "anyOf": [{"type": "string"}, {"type": "null"}],
                        },
                        "tax": {
                            "title": "Tax",
                            "anyOf": [{"type": "number"}, {"type": "null"}],
                        },

            result = buf.dec_ndr_long();
        } else { /* Bind_ack or Response */
            decode_out(buf);
        }
    }

    /**
     * Get the operation number for this DCERPC message.
     * @return the operation number
     */
    public abstract int getOpnum();

    /**
     * Encode the input parameters for this DCERPC message.
     * @param buf the buffer to encode into

        // 4 (maxParameterCount) + 4 (maxDataCount) + 4 (parameterCount) + 4 (parameterOffset) +
        // 4 (dataCount) + 4 (dataOffset) + 1 (setupCount) + 2 (function)
        assertEquals(38, bytesWritten, "Number of bytes written should be 38 for primary transaction");

        // Verify some key values
        assertEquals(smbComNtTransaction.maxSetupCount, dst[0], "maxSetupCount should be written correctly");

		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 BucketBandwidthReport) Msgsize() (s int) {
	s = 1
	return
}

// DecodeMsg implements msgp.Decodable
func (z *Details) DecodeMsg(dc *msgp.Reader) (err error) {

                        "price": {
                            "title": "Price",
                            "type": "number",
                        },
                        "tax": {
                            "title": "Tax",
                            "anyOf": [{"type": "number"}, {"type": "null"}],
                        },
                        "tags": {
                            "title": "Tags",

	}
	if r.lastErr != nil {
		err = r.lastErr
		return n, err
	}
	b := r.throttle.Burst()  // maximum available tokens
	need := len(buf)         // number of bytes requested by caller
	hdr := r.opts.HeaderSize // remaining header bytes
	var tokens int           // number of tokens to request

	if hdr > 0 { // available tokens go towards header first
		if hdr < b { // all of header can be accommodated
			r.opts.HeaderSize = 0

			na++
			break
		}
		_, size = utf8.DecodeRune(s)
		a[na] = s[0:size:size]
		s = s[size:]
		na++
	}
	return a[0:na]
}

// Count counts the number of non-overlapping instances of sep in s.
// If sep is an empty slice, Count returns 1 + the number of UTF-8-encoded code points in s.
func Count(s, sep []byte) int {
	// special case
	if len(sep) == 0 {
		return utf8.RuneCount(s) + 1
	}
	if len(sep) == 1 {

     *
     * @param attemptNumber the current attempt number
     * @return true if retry should be attempted
     */
    public boolean shouldRetry(int attemptNumber) {
        return retryPolicy.shouldRetry(this, attemptNumber);
    }

    /**
     * Get the delay before next retry
     *
     * @param attemptNumber the current attempt number
     * @return delay in milliseconds
     */

   * Returns the minimum of the two values. If the values compare as 0, the first is returned.
   *
   * <p>The recommended solution for finding the {@code minimum} of some values depends on the type
   * of your data and the number of elements you have. Read more in the Guava User Guide article on
   * <a href="https://github.com/google/guava/wiki/CollectionUtilitiesExplained#comparators">{@code
   * Comparators}</a>.
   *