{
		natFromString(strings.Repeat("1", 70000)),
		natFromString("1" + strings.Repeat(strings.Repeat("0", 699)+"1", 99)),
		natFromString(strings.Repeat("1", 700)),
	},
	// z = 111....1 (20000 digits)
	// x = 10^10000 + 1
	// y = 111....1 (10000 digits)
	{
		natFromString(strings.Repeat("1", 20000)),
		natFromString("1" + strings.Repeat("0", 9999) + "1"),

    }
  }
  attr: {
    key: "Tout"
    value: {
      list: {
        type: [DT_INT64]
      }
    }
  }
  attr: {
    key: "batch_timeout_micros"
    value: {
      i: 100000
    }
  }
  attr: {
    key: "f"
    value: {
      func: {
        name: "inference_function"
      }
    }
  }
  attr: {
    key: "max_batch_size"
    value: {
      i: 32

				MemoryLimitInBytes: 268435456,
				CpuPeriod:          100000,
				CpuQuota:           400000,
				CpuShares:          2048,
			},
			expectedOverhead: &runtimeapi.LinuxContainerResources{
				MemoryLimitInBytes: 134217728,
				CpuPeriod:          100000,
				CpuQuota:           100000,
				CpuShares:          1024,
			},
			cgroupVersion: cgroupV1,
		},
		{

  // CHECK: "tf.BatchFunction"(%arg0, %0)
  // CHECK: operandSegmentSizes = array<i32: 1, 1>

func calculateCPUMaximum(cpuLimit *resource.Quantity, cpuCount int64) int64 {
	cpuMaximum := 10 * cpuLimit.MilliValue() / cpuCount

	// ensure cpuMaximum is in range [1, 10000].
	if cpuMaximum < 1 {
		cpuMaximum = 1
	} else if cpuMaximum > 10000 {
		cpuMaximum = 10000
	}
	return cpuMaximum
}

type T struct {
	a, b, c int
}

func usestack() {
	usestack1(32)
}
func usestack1(d int) byte {
	if d == 0 {
		return 0
	}
	var b [1024]byte
	usestack1(d - 1)
	return b[3]
}

const n = 100000

func main() {
	c := make(chan interface{})
	done := make(chan bool)

	for i := 0; i < 10; i++ {
		go func() {
			for j := 0; j < n; j++ {
				c <- new(T)
			}
			done <- true
		}()

	defer bytes.Compare(nil, nil)
	growstack(10000)
	c <- struct{}{}
}
func equal(c chan struct{}) {
	defer bytes.Equal(nil, nil)
	growstack(10000)
	c <- struct{}{}
}
func indexByte(c chan struct{}) {
	defer bytes.IndexByte(nil, 0)
	growstack(10000)
	c <- struct{}{}
}
func indexByteString(c chan struct{}) {
	defer strings.IndexByte("", 0)
	growstack(10000)
	c <- struct{}{}

// license that can be found in the LICENSE file.

package main

import (
	"fmt"
	"time"
)

func main() {
	// Make a big map.
	m := map[int]int{}
	for i := 0; i < 100000; i++ {
		m[i] = i
	}
	c := make(chan string)
	go func() {
		// Print the map.
		s := fmt.Sprintln(m)
		c <- s
	}()
	go func() {
		time.Sleep(1 * time.Millisecond)

              "priority": "DEFAULT",
              "max_connections": 100000,
              "max_pending_requests": 100000,
              "max_requests": 100000
            },
            {
              "priority": "HIGH",
              "max_connections": 100000,
              "max_pending_requests": 100000,
              "max_requests": 100000
            }
          ]
        },

              "priority": "DEFAULT",
              "max_connections": 100000,
              "max_pending_requests": 100000,
              "max_requests": 100000
            },
            {
              "priority": "HIGH",
              "max_connections": 100000,
              "max_pending_requests": 100000,
              "max_requests": 100000
            }
          ]
        },