assertEquals(asList("a", "b", "c", "d"), list);
    b.set(0, "f");
    assertEquals(asList("a", "b", "c", "d"), list);
  }

  public void testComplexBuilder() {
    List<Integer> colorElem = asList(0x00, 0x33, 0x66, 0x99, 0xCC, 0xFF);
    ImmutableList.Builder<Integer> webSafeColorsBuilder = ImmutableList.builder();
    for (Integer red : colorElem) {
      for (Integer green : colorElem) {

     * and simply return 0. These would need to be completed for a server
     * implementation.
     */

    /** SMB2 negotiate protocol command */
    protected static final short SMB2_NEGOTIATE = 0x00;
    /** SMB2 session setup command */
    protected static final short SMB2_SESSION_SETUP = 0x01;
    /** SMB2 logoff command */
    protected static final short SMB2_LOGOFF = 0x02;
    /** SMB2 tree connect command */

	CMPW R3, $0, CR2                // CMPW R3,CR2,$0       // 2d030000
	CMPW R3, $-32768, CR2           // CMPW R3,CR2,$-32768  // 2d038000
	CMPWU R3, $0, CR3               // CMPWU R3,CR3,$0      // 29830000
	CMPWU R3, $0x8008, CR3          // CMPWU R3,CR3,$32776  // 29838008

	CMPEQB R3,R4,CR6                // 7f0321c0
	CMPB R3,R4,R4                   // 7c6423f8

	ADD R3, R4                      // 7c841a14

		tw := NewWriter(new(bytes.Buffer))
		hdr := &Header{Name: "dir/", Typeflag: TypeDir}
		if err := tw.WriteHeader(hdr); err != nil {
			t.Fatalf("WriteHeader() = %v, want nil", err)
		}
		if _, err := tw.Write([]byte{0x00}); err != ErrWriteTooLong {
			t.Fatalf("Write() = %v, want %v", err, ErrWriteTooLong)
		}
	})

	t.Run("NegativeSize", func(t *testing.T) {
		tw := NewWriter(new(bytes.Buffer))

                final byte[] clientChallenge = new byte[24];
                tc.getConfig().getRandom().nextBytes(clientChallenge);
                java.util.Arrays.fill(clientChallenge, 8, 24, (byte) 0x00);

                final byte[] ntlm2Response = NtlmUtil.getNTLM2Response(passwordHash, type2.getChallenge(), clientChallenge);

                setLMResponse(clientChallenge);

			// Argsize set below.
		},
	}
	nameAddr.Sym.Func().Text = prog
	prog.To.Val = int32(argSize)
	p.append(prog, "", true)
}

// asmData assembles a DATA pseudo-op.
// DATA masks<>+0x00(SB)/4, $0x00000000
func (p *Parser) asmData(operands [][]lex.Token) {
	if len(operands) != 2 {
		p.errorf("expect two operands for DATA")
		return
	}

	// Operand 0 has the general form foo<>+0x04(SB)/4.

		{"☻x\xe2\x98�", '�', len("☻x")},
		{"☻x\xe2\x98x", '�', len("☻x")},

		// Invalid rune values should never match.
		{"a☺b☻c☹d\xe2\x98�\xff�\xed\xa0\x80", -1, -1},
		{"a☺b☻c☹d\xe2\x98�\xff�\xed\xa0\x80", 0xD800, -1}, // Surrogate pair
		{"a☺b☻c☹d\xe2\x98�\xff�\xed\xa0\x80", utf8.MaxRune + 1, -1},

		// Test the cutover to bytealg.Index when it is triggered in
		// the middle of rune that contains consecutive runs of equal bytes.

4 MOVQ 32(BX), AX MULQ SI ADDQ 32(CX), AX ADCQ $0x00, DX ADDQ DI, AX ADCQ $0x00, DX MOVQ DX, DI MOVQ AX, 32(CX) // Iteration 5 MOVQ 40(BX), AX MULQ SI ADDQ 40(CX), AX ADCQ $0x00, DX ADDQ DI, AX ADCQ $0x00, DX MOVQ DX, DI MOVQ AX, 40(CX) // Iteration 6 MOVQ 48(BX), AX MULQ SI ADDQ 48(CX), AX ADCQ $0x00, DX ADDQ DI, AX ADCQ $0x00, DX MOVQ DX, DI MOVQ AX, 48(CX) // Iteration 7 MOVQ 56(BX), AX MULQ SI ADDQ 56(CX), AX ADCQ $0x00, DX ADDQ DI, AX ADCQ $0x00, DX MOVQ DX, DI MOVQ AX, 56(CX) // Iteration 8...

      	  <match value="0x0100" type="string" offset="28"/>
      	  <match value="0x0400" type="string" offset="28"/>
      	  <match value="0x0800" type="string" offset="28"/>
      	  <match value="0x1000" type="string" offset="28"/>
      	  <match value="0x1800" type="string" offset="28"/>
      	  <match value="0x2000" type="string" offset="28"/>
        </match>
      </match>
    </magic>