expect:
        filter(1, 2, 3) == [1, 2, 3]
        filter(7, 8, 9) == []
        filter() == []
        filter(4, 5, 6) == [4]
    }

    def "array filtering"() {
        given:
        def spec = { it < 5 }
        def filter = { Integer[] nums -> filter(nums, spec) }

        expect:
        filter(1, 2, 3) == [1, 2, 3]
        filter(7, 8, 9) == []
        filter() == []
        filter(4, 5, 6) == [4]
    }

	podLogsDirectory := "/var/log/pods"
	removed := []string{
		filepath.Join(podLogsDirectory, "789"),
		filepath.Join(podLogsDirectory, "012"),
		filepath.Join(podLogsDirectory, "name_namespace_654"),
	}
	podStateProvider.removed["012"] = struct{}{}
	podStateProvider.removed["789"] = struct{}{}
	podStateProvider.removed["654"] = struct{}{}

	ctrl := gomock.NewController(t)
	defer ctrl.Finish()

        then:
        byteBuffer.totalBytesUnread() == 13

        when:
        byteBuffer.readAsString()
        then:
        byteBuffer.totalBytesUnread() == 0

        when:
        out.write("789".bytes)
        then:
        byteBuffer.totalBytesUnread() == 3

        when:
        byteBuffer.readAsString()
        then:
        byteBuffer.totalBytesUnread() == 0

        when:

	a[775] = 0
	a[776] = 0
	a[777] = 0
	a[778] = 0
	a[779] = 0
	a[780] = 0
	a[781] = 0
	a[782] = 0
	a[783] = 0
	a[784] = 0
	a[785] = 0
	a[786] = 0
	a[787] = 0
	a[788] = 0
	a[789] = 0
	a[790] = 0
	a[791] = 0
	a[792] = 0
	a[793] = 0
	a[794] = 0
	a[795] = 0
	a[796] = 0
	a[797] = 0
	a[798] = 0
	a[799] = 0
	a[800] = 0
	a[801] = 0
	a[802] = 0
	a[803] = 0

	case 783:
		return 783
	case 784:
		return 784
	case 785:
		return 785
	case 786:
		return 786
	case 787:
		return 787
	case 788:
		return 788
	case 789:
		return 789
	case 790:
		return 790
	case 791:
		return 791
	case 792:
		return 792
	case 793:
		return 793
	case 794:
		return 794
	case 795:
		return 795
	case 796:

	"60419369e-46",
	"702990899e-20",
	"6930161142e-48",
	"25933168707e+13",
	"596428896559e+20",

	// Table 15: Stress Inputs for Conversion to 24-bit Binary, >1/2 ULP
	"3e-23",
	"57e+18",
	"789e-35",
	"2539e-18",
	"76173e+28",
	"887745e-11",
	"5382571e-37",
	"82381273e-35",
	"750486563e-38",
	"3752432815e-39",
	"75224575729e-45",
	"459926601011e+15",

000000e0  c6 0a 87 ff 17 03 03 02  6d 79 97 6c 2f f6 01 7b  |........my.l/..{|
000000f0  3a 49 0e 1a 00 96 10 fd  7f 77 db 76 b2 d4 e4 68  |:I.......w.v...h|
00000100  46 4e 4f 3c 64 54 ca 27  9a 5c 78 98 f4 96 a4 fe  |FNO<dT.'.\x.....|
00000110  29 e5 44 cb 6d 3e bd ce  89 15 c6 75 d8 28 00 da  |).D.m>.....u.(..|
00000120  ff d8 ec 27 2c f2 4c e5  a0 6e 88 ce 67 6e 35 f4  |...',.L..n..gn5.|

	return tile, nil
}

// To limit the size of any particular directory listing,
// we encode the (possibly very large) number N
// by encoding three digits at a time.
// For example, 123456789 encodes as x123/x456/789.
// Each directory has at most 1000 each xNNN, NNN, and NNN.p children,
// so there are at most 3000 entries in any one directory.
const pathBase = 1000

// Path returns a tile coordinate path describing t.

000001c0  a1 5c ae f1 e1 4b 5c 2a  be 64 3c 7a 61 10 3d 73  |.\...K\*.d<za.=s|
000001d0  76 94 27 e9 8c 9a 8f 14  9e 9f cb 75 7e 73 14 e0  |v.'........u~s..|
000001e0  7d 78 90 3d a7 2d cb df  db 2b eb b6 b1 01 aa e4  |}x.=.-...+......|
000001f0  5f 7f 39 7e eb e9 79 14  07 fa 9d d9 b6 4b 0d 7a  |_.9~..y......K.z|
00000200  e7 ea 17 d5 c8 0b bd 12  c3 2d fa b1 cc 36 97 a3  |.........-...6..|

			},
			"testTracebackArgs2(0x0, {0x1, 0x2, 0x3, {0x4, 0x5}}, {}, {0x6, 0x7, 0x8})",
		},
		{
			func() int { return testTracebackArgs3([3]byte{1, 2, 3}, 4, 5, 6, [3]byte{7, 8, 9}) },
			"testTracebackArgs3({0x1, 0x2, 0x3}, 0x4, 0x5, 0x6, {0x7, 0x8, 0x9})",
		},
		// too deeply nested type
		{
			func() int { return testTracebackArgs4(false, [1][1][1][1][1][1][1][1][1][1]int{}) },