// resumed at once, as a starting point we assume that each such goroutine
	// is taking 1/Nth of a seat for M milliseconds.
	// We allow the accounting of that work in P&F to be reshaped into another
	// rectangle of equal area for practical reasons.
	var finalSeats uint64
	var additionalLatency time.Duration

	// TODO: Make this unconditional after we tune the algorithm better.

            compileJava {
                options.compilerArgs = ['-sourcepath', files('src/main/java').asPath]
            }
        '''
        file('src/main/java/Square.java') << 'public class Square extends Rectangle {}'

        when:
        fails 'compileJava'

        then:

		}
	}
}

// See golang.org/issue/22237
func TestDecodeMemoryConsumption(t *testing.T) {
	const frames = 3000
	img := image.NewPaletted(image.Rectangle{Max: image.Point{1, 1}}, palette.WebSafe)
	hugeGIF := &GIF{
		Image:    make([]*image.Paletted, frames),
		Delay:    make([]int, frames),
		Disposal: make([]byte, frames),
	}
	for i := 0; i < frames; i++ {

		return
	}

	b := pm.Bounds()
	if b.Min.X < 0 || b.Max.X >= 1<<16 || b.Min.Y < 0 || b.Max.Y >= 1<<16 {
		e.err = errors.New("gif: image block is too large to encode")
		return
	}
	if !b.In(image.Rectangle{Max: image.Point{e.g.Config.Width, e.g.Config.Height}}) {
		e.err = errors.New("gif: image block is out of bounds")
		return
	}

	transparentIndex := -1
	for i, c := range pm.Palette {
		if c == nil {

		{"(Point).Sub", Method, 0},
		{"(Rectangle).Add", Method, 0},
		{"(Rectangle).At", Method, 5},
		{"(Rectangle).Bounds", Method, 5},
		{"(Rectangle).Canon", Method, 0},
		{"(Rectangle).ColorModel", Method, 5},
		{"(Rectangle).Dx", Method, 0},
		{"(Rectangle).Dy", Method, 0},
		{"(Rectangle).Empty", Method, 0},
		{"(Rectangle).Eq", Method, 0},
		{"(Rectangle).In", Method, 0},
		{"(Rectangle).Inset", Method, 0},

		}
		if i == 0 {
			i = 1
		} else {
			i *= 2
		}
	}
}

// check checks that the two pix data are equal, within the given bounds.
func check(bounds image.Rectangle, pix0, pix1 []byte, stride0, stride1 int) error {
	if stride0 <= 0 || stride0%8 != 0 {
		return fmt.Errorf("bad stride %d", stride0)
	}
	if stride1 <= 0 || stride1%8 != 0 {
		return fmt.Errorf("bad stride %d", stride1)

pkg image, method (Rectangle) Add(Point) Rectangle
pkg image, method (Rectangle) Canon() Rectangle
pkg image, method (Rectangle) Dx() int
pkg image, method (Rectangle) Dy() int
pkg image, method (Rectangle) Empty() bool
pkg image, method (Rectangle) Eq(Rectangle) bool
pkg image, method (Rectangle) In(Rectangle) bool
pkg image, method (Rectangle) Inset(int) Rectangle

func (d *decoder) mergePassInto(dst image.Image, src image.Image, pass int) {
	p := interlacing[pass]
	var (
		srcPix        []uint8
		dstPix        []uint8
		stride        int
		rect          image.Rectangle
		bytesPerPixel int
	)
	switch target := dst.(type) {
	case *image.Alpha:
		srcPix = src.(*image.Alpha).Pix
		dstPix, stride, rect = target.Pix, target.Stride, target.Rect
		bytesPerPixel = 1

2B97          ; valid                  ;      ; NV8    # 13.0 SYMBOL FOR TYPE A ELECTRONICS
2B98..2BB9    ; valid                  ;      ; NV8    # 7.0  THREE-D TOP-LIGHTED LEFTWARDS EQUILATERAL ARROWHEAD..UP ARROWHEAD IN A RECTANGLE BOX
2BBA..2BBC    ; valid                  ;      ; NV8    # 11.0 OVERLAPPING WHITE SQUARES..OVERLAPPING BLACK SQUARES

refracting Surface into one and the same Medium, the Interval of the
following Fits of easy Reflexion and Transmission are either accurately
or very nearly, as the Rectangle of the Secant of the Angle of
Refraction, and of the Secant of another Angle, whose Sine is the first
of 106 arithmetical mean Proportionals, between the Sines of Incidence
and Refraction, counted from the Sine of Refraction._