assertEquals(response.getTreeId(), response.getTid());
    }

    /**
     * Helper method to create a valid response buffer
     */
    private byte[] createValidResponseBuffer(int shareType, int shareFlags, int capabilities, int maxAccess) {
        byte[] buffer = new byte[256];
        SMBUtil.writeInt2(16, buffer, 0);
        buffer[2] = (byte) shareType;
        buffer[3] = 0;

			db.RowsAffected++
			db.AddError(rows.Scan(values...))

			mapValue := map[string]interface{}{}
			scanIntoMap(mapValue, values, columns)
			*dest = append(*dest, mapValue)
		}
	case *int, *int8, *int16, *int32, *int64,
		*uint, *uint8, *uint16, *uint32, *uint64, *uintptr,
		*float32, *float64,
		*bool, *string, *time.Time,
		*sql.NullInt32, *sql.NullInt64, *sql.NullFloat64,
		*sql.NullBool, *sql.NullString, *sql.NullTime:

			if e != nil {
				return e
			}
			// Quote string...
			b, _ := json.Marshal(file.Name)
			if hasWritten {
				fmt.Print(",\n")
			}
			fmt.Printf("\t%s: ", string(b))

			b, e = decode(r, file.Name)
			if e != nil {
				return e
			}
			fmt.Print(string(b))
			hasWritten = true
		}
	}
	fmt.Println("")
	fmt.Println("}")

	return nil
}

var (

    stream.defaultReadObject();
    int keyCount = stream.readInt();
    if (keyCount < 0) {
      throw new InvalidObjectException("Invalid key count " + keyCount);
    }
    ImmutableMap.Builder<Object, ImmutableList<Object>> builder = ImmutableMap.builder();
    int tmpSize = 0;

    for (int i = 0; i < keyCount; i++) {
      Object key = requireNonNull(stream.readObject());
      int valueCount = stream.readInt();

	sort.Slice(result.Pets, func(i, j int) bool {
		return result.Pets[i].ID < result.Pets[j].ID
	})
	sort.Slice(result.Team, func(i, j int) bool {
		return result.Team[i].ID < result.Team[j].ID
	})
	sort.Slice(result.Friends, func(i, j int) bool {
		return result.Friends[i].ID < result.Friends[j].ID
	})
	sort.Slice(result2.Pets, func(i, j int) bool {
		return result2.Pets[i].ID < result2.Pets[j].ID
	})

end }} ` func main() { type Params struct { DstOffset int Sizes []int } params := Params{ DstOffset: dstOffset, Sizes: []int{1, 2, 4, 8}, } type RegsBatch struct { Size int Regs string // Comma-separated list of registers. } type LoadKeysArgs struct { FirstKey int NKeys int } type EncArgs struct { Key int N int WithMc bool } funcs := template.FuncMap{ "add": func(a, b int) int { return a + b }, "xrange": func(n int) []int { result := make([]int, n) for i := 0; i < n; i++ { result[i] = i } return result...

    static class ExecResult {
        String stdout
        String stderr
        int returnCode
    }

    static ExecResult exec(String command) {
        Process process = command.execute()
        def stdoutFuture = readStreamAsync(process.inputStream)
        def stderrFuture = readStreamAsync(process.errorStream)

        int returnCode = process.waitFor()
        String stdout = stdoutFuture.get()

    stream.defaultReadObject();
    int keyCount = stream.readInt();
    if (keyCount < 0) {
      throw new InvalidObjectException("Invalid key count " + keyCount);
    }
    ImmutableMap.Builder<Object, ImmutableList<Object>> builder = ImmutableMap.builder();
    int tmpSize = 0;

    for (int i = 0; i < keyCount; i++) {
      Object key = requireNonNull(stream.readObject());
      int valueCount = stream.readInt();

pkg container/ring, func New(int) *Ring
pkg container/ring, method (*Ring) Do(func(interface{}))
pkg container/ring, method (*Ring) Len() int
pkg container/ring, method (*Ring) Link(*Ring) *Ring
pkg container/ring, method (*Ring) Move(int) *Ring
pkg container/ring, method (*Ring) Next() *Ring
pkg container/ring, method (*Ring) Prev() *Ring
pkg container/ring, method (*Ring) Unlink(int) *Ring

	maxTokenSize int       // Maximum size of a token; modified by tests.
	token        []byte    // Last token returned by split.
	buf          []byte    // Buffer used as argument to split.
	start        int       // First non-processed byte in buf.
	end          int       // End of data in buf.
	err          error     // Sticky error.
	empties      int       // Count of successive empty tokens.