int outlen = 5;
        byte[] expanded = PacMac.expandNFold(data, outlen);
        assertNotNull(expanded);
        assertEquals(outlen, expanded.length);

        // Test vectors from RFC 3961 Appendix A.1
        // 64-fold("012345")
        verifyNfold("012345", 8,
                new byte[] { (byte) 0xbe, (byte) 0x07, (byte) 0x26, (byte) 0x31, (byte) 0x27, (byte) 0x6b, (byte) 0x19, (byte) 0x55 });

class package org.gradle.wrapper; public final class Logger implements Appendable { public final boolean quiet; public void Logger(boolean); public final void log(String); public final Appendable append(CharSequence); public final Appendable append(CharSequence, int, int); public final Appendable append(char); } org/gradle/wrapper/PathAssembler.class package org.gradle.wrapper; public final class PathAssembler { public void PathAssembler(java.io.File, java.io.File); } org/gradle/wrapper/PropertiesFileHandle.class...

s3 := append(s2, s0...)            // append a slice              s3 is []int{0, 0, 2, 3, 5, 7, 0, 0}
s4 := append(s3[3:6], s3[2:]...)   // append overlapping slice    s4 is []int{3, 5, 7, 2, 3, 5, 7, 0, 0}

var t []interface{}
t = append(t, 42, 3.1415, "foo")   //                             t is []interface{}{42, 3.1415, "foo"}

var b []byte

 *
 * <p>The text normalization process includes:
 * <ul>
 *   <li>Treating ISO control characters and specified space characters as spaces.</li>
 *   <li>Appending alphanumeric characters (0-9, A-Z, a-z) to the buffer.</li>
 *   <li>Appending symbol characters (!-/, :-@, [-`, {-~) to the buffer.</li>
 *   <li>Optionally removing duplicate terms based on a flag.</li>

        buf.append(Character.forDigit(i & 0x0f, 16));
    }

    /**
     * Appends the hexadecimal string representation of a number to the given StringBuilder.
     *
     * @param buf
     *            the StringBuilder to append to
     * @param i
     *            the number to convert
     */
    public static void appendHex(final StringBuilder buf, final int i) {

        // When
        initialReferral.append(appendedReferral);

        // Then
        assertEquals(appendedReferral, initialReferral.next,
                "The 'next' property of the initial referral should point to the appended referral.");
        assertEquals(initialReferral, appendedReferral.next,
                "The 'next' property of the appended referral should point back to the initial referral, closing the loop.");

     * @param chain the existing filter chain to append to
     * @return a new filter chain that includes the appended filter
     */
    protected FilterChain appendFilterChain(final Filter filter, final FilterChain chain) {
        return (context, query, boost) -> filter.execute(context, query, boost, chain);
    }

    /**
     * Creates the default filter chain that executes query commands.

    assertEquals(expected, joiner.join(parts.iterator()));

    StringBuilder sb1FromIterable = new StringBuilder().append('x');
    joiner.appendTo(sb1FromIterable, parts);
    assertEquals("x" + expected, sb1FromIterable.toString());

    StringBuilder sb1FromIterator = new StringBuilder().append('x');
    joiner.appendTo(sb1FromIterator, parts.iterator());
    assertEquals("x" + expected, sb1FromIterator.toString());

		}
	}()
	// TODO(http://golang.org/issue/51462): We should rely on the append-make
	// pattern so that the compiler can call runtime.growslice. For example:
	//	return append(b, make([]byte, n)...)
	// This avoids unnecessary zero-ing of the first len(b) bytes of the
	// allocated slice, but this pattern causes b to escape onto the heap.
	//
	// Instead use the append-make pattern with a nil slice to ensure that

        final String tag = element.getTagName();
        buf.append('<');
        buf.append(tag);
        appendAttrs(element.getAttributes(), buf);
        buf.append('>');
        appendChildren(element.getChildNodes(), buf);
        buf.append("</");
        buf.append(tag);
        buf.append('>');
    }

    /**
     * Appends the string representation of a {@link NodeList}.
     *