"⪹":                     "\u2ab9",
	"⪵":                        "\u2ab5",
	"⋨":                        "\u22e8",
	"≾":                         "\u227e",
	"′":                           "\u2032",
	"ℙ":                          "\u2119",
	"⪵":                            "\u2ab5",
	"⪹":                           "\u2ab9",
	"⋨":                          "\u22e8",

	pc=5078500 func=35 file=36 line=68
Stack id=13 nframes=1
	pc=5077820 func=35 file=36 line=28
Stack id=65 nframes=2
	pc=4224086 func=57 file=58 line=145
	pc=5080123 func=59 file=36 line=94
Stack id=21 nframes=3
	pc=4640852 func=60 file=61 line=195
	pc=5081128 func=62 file=36 line=125
	pc=5077843 func=35 file=36 line=32
Stack id=11 nframes=1
	pc=5077754 func=35 file=36 line=27
Stack id=10 nframes=1

	}
	if priv.PublicKey.N.Cmp(priv2.PublicKey.N) != 0 ||
		priv.PublicKey.E != priv2.PublicKey.E ||
		priv.D.Cmp(priv2.D) != 0 ||
		len(priv2.Primes) != 3 ||
		priv.Primes[0].Cmp(priv2.Primes[0]) != 0 ||
		priv.Primes[1].Cmp(priv2.Primes[1]) != 0 ||
		priv.Primes[2].Cmp(priv2.Primes[2]) != 0 {
		t.Errorf("got:%+v want:%+v", priv, priv2)
	}
}

func TestMarshalRSAPublicKey(t *testing.T) {
	pub := &rsa.PublicKey{

	pc=4804475 func=32 file=33 line=60
Stack id=14 nframes=1
	pc=4546157 func=24 file=23 line=874
Stack id=17 nframes=1
	pc=0 func=0 file=0 line=0
Stack id=19 nframes=2
	pc=4540420 func=22 file=23 line=353
	pc=4546157 func=24 file=23 line=874
Stack id=13 nframes=1
	pc=0 func=0 file=0 line=0
Stack id=5 nframes=2
	pc=4418893 func=60 file=61 line=402
	pc=4301860 func=62 file=35 line=1297

		"precneqq;":                        '\U00002AB5',
		"precnsim;":                        '\U000022E8',
		"precsim;":                         '\U0000227E',
		"prime;":                           '\U00002032',
		"primes;":                          '\U00002119',
		"prnE;":                            '\U00002AB5',
		"prnap;":                           '\U00002AB9',
		"prnsim;":                          '\U000022E8',

type randomOrder struct {
	count    uint32
	coprimes []uint32
}

type randomEnum struct {
	i     uint32
	count uint32
	pos   uint32
	inc   uint32
}

func (ord *randomOrder) reset(count uint32) {
	ord.count = count
	ord.coprimes = ord.coprimes[:0]
	for i := uint32(1); i <= count; i++ {
		if gcd(i, count) == 1 {
			ord.coprimes = append(ord.coprimes, i)
		}
	}
}

last the Dodo said, `EVERYBODY has won, and all must have
prizes.'

  `But who is to give the prizes?' quite a chorus of voices
asked.

  `Why, SHE, of course,' said the Dodo, pointing to Alice with
one finger; and the whole party at once crowded round her,
calling out in a confused way, `Prizes! Prizes!'

  Alice had no idea what to do, and in despair she put her hand

			warning: false,
		},
		{
			name: "partial wildcard hosts", in: &networking.ServiceEntry{
				Hosts:     []string{"*.nytimes.com", "*washingtonpost.com"},
				Addresses: []string{},
				Ports: []*networking.ServicePort{
					{Number: 443, Protocol: "HTTPS", Name: "https-nytimes"},
				},
				Endpoints:  []*networking.WorkloadEntry{},
				Resolution: networking.ServiceEntry_NONE,
			},
			valid:   true,

	}
}

// Wait until number of goroutines is no greater than nmax, or time out.
func waitNumGoroutine(nmax int) int {
	nfinal := runtime.NumGoroutine()
	for ntries := 10; ntries > 0 && nfinal > nmax; ntries-- {
		time.Sleep(50 * time.Millisecond)
		runtime.GC()
		nfinal = runtime.NumGoroutine()
	}
	return nfinal
}

github.com/Masterminds/sprig/v3 v3.2.3 h1:eL2fZNezLomi0uOLqjQoN6BfsDD+fyLtgbJMAj9n6YA=
github.com/Masterminds/sprig/v3 v3.2.3/go.mod h1:rXcFaZ2zZbLRJv/xSysmlgIM1u11eBaRMhvYXJNkGuM=
github.com/NYTimes/gziphandler v0.0.0-20170623195520-56545f4a5d46/go.mod h1:3wb06e3pkSAbeQ52E9H9iFoQsEEwGN64994WTCIhntQ=
github.com/OneOfOne/xxhash v1.2.2/go.mod h1:HSdplMjZKSmBqAxg5vPj2TmRDmfkzw+cTzAElWljhcU=