for {
		tok = p.nextToken()
		// We save the line number here so error messages from this instruction
		// are labeled with this line. Otherwise we complain after we've absorbed
		// the terminating newline and the line numbers are off by one in errors.
		p.lineNum = p.lex.Line()
		switch tok {
		case '\n', ';':
			continue
		case scanner.EOF:
			return "", "", nil, false
		}
		break
	}

		HTTPStatusCode: http.StatusBadRequest,
	},
	ErrParseExpectedMember: {
		Code:           "ParseExpectedMember",
		Description:    "The SQL expression contains an unsupported use of MEMBER.",
		HTTPStatusCode: http.StatusBadRequest,
	},
	ErrParseUnsupportedSelect: {
		Code:           "ParseUnsupportedSelect",
		Description:    "The SQL expression contains an unsupported use of SELECT.",

	BitrotChecksumAlgo ChecksumAlgo      `json:"CSumAlgo" msg:"CSumAlgo"`                        // Bitrot checksum algo
	PartNumbers        []int             `json:"PartNums" msg:"PartNums"`                        // Part Numbers
	PartETags          []string          `json:"PartETags" msg:"PartETags,allownil"`             // Part ETags
	PartSizes          []int64           `json:"PartSizes" msg:"PartSizes"`                      // Part Sizes

			return
		}
	}
}

func createTestInput(n int) []byte {
	input := make([]byte, n)
	for i := range input {
		// 101 and 251 are arbitrary prime numbers.
		// The idea is to create an input sequence
		// which doesn't repeat too frequently.
		input[i] = byte(i % 251)
		if i%101 == 0 {
			input[i] ^= byte(i / 101)
		}
	}
	return input
}

*testing.T) { prefixes := map[crypto.Hash]asn1.ObjectIdentifier{ // RFC 3370, Section 2.1 and 2.2 // // sha-1 OBJECT IDENTIFIER ::= { iso(1) identified-organization(3) // oiw(14) secsig(3) algorithm(2) 26 } // // md5 OBJECT IDENTIFIER ::= { iso(1) member-body(2) us(840) // rsadsi(113549) digestAlgorithm(2) 5 } crypto.MD5: {1, 2, 840, 113549, 2, 5}, crypto.SHA1: {1, 3, 14, 3, 2, 26}, // https://csrc.nist.gov/projects/computer-security-objects-register/algorithm-registration // // nistAlgorithms OBJECT...

*testing.T) { prefixes := map[crypto.Hash]asn1.ObjectIdentifier{ // RFC 3370, Section 2.1 and 2.2 // // sha-1 OBJECT IDENTIFIER ::= { iso(1) identified-organization(3) // oiw(14) secsig(3) algorithm(2) 26 } // // md5 OBJECT IDENTIFIER ::= { iso(1) member-body(2) us(840) // rsadsi(113549) digestAlgorithm(2) 5 } crypto.MD5: {1, 2, 840, 113549, 2, 5}, crypto.SHA1: {1, 3, 14, 3, 2, 26}, // https://csrc.nist.gov/projects/computer-security-objects-register/algorithm-registration // // nistAlgorithms OBJECT...

medium and for any number of copies, and (iv) for any purpose whatsoever,
including without limitation commercial, advertising or promotional
purposes (the "Waiver"). Affirmer makes the Waiver for the benefit of each
member of the public at large and to the detriment of Affirmer's heirs and
successors, fully intending that such Waiver shall not be subject to
revocation, rescission, cancellation, termination, or any other legal or