bad = true
	}
	if (-4 >> 1) != -2 {
		println("-4>>1 =", -4>>1, "want -2")
		bad = true
	}
	if (-3 >> 1) != -2 {
		println("-3>>1 =", -3>>1, "want -2")
		bad = true
	}
	if (-2 >> 1) != -1 {
		println("-2>>1 =", -2>>1, "want -1")
		bad = true
	}
	if (-1 >> 1) != -1 {
		println("-1>>1 =", -1>>1, "want -1")
		bad = true
	}
	if bad {
		println("errors")
		panic("fail")
	}

// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.

// Issue 7214: No duplicate key error for maps with interface{} key type

package p

var _ = map[interface{}]int{2: 1, 2: 1} // ERROR "duplicate key"
var _ = map[interface{}]int{int(2): 1, int16(2): 1}
var _ = map[interface{}]int{int16(2): 1, int16(2): 1} // ERROR "duplicate key"

type S string

    %3:2 = tf_executor.island wraps "tf.Add"(%2#0, %2#0) {T = "tfdtype$DT_INT32"} : (tensor<i32>, tensor<i32>) -> tensor<i32> loc("Addition")
    %4:2 = tf_executor.island wraps "tf.Mul"(%2#1, %2#1) {T = "tfdtype$DT_INT32"} : (tensor<i32>, tensor<i32>) -> tensor<i32> loc("Multiplication")
    %5:3 = tf_executor.Merge %3#0, %4#0 : tensor<i32> {device = "", N = 2, T = "tfdtype$DT_INT32"} loc("Merge")
    tf_executor.fetch
  }

        1 * graph.getEdgeValues(1, 2, _) >> { args -> args[2] << '1->2' }
        1 * graph.getNodeValues(2, _, _) >> { args -> args[1] << '2'; args[2] << 3 }
        1 * graph.getEdgeValues(2, 3, _) >> { args -> args[2] << '2->3' }
        1 * graph.getNodeValues(3, _, _) >> { args -> args[1] << '3'; args[2] << 1 }
        1 * graph.getEdgeValues(3, 1, _) >> { args -> args[2] << '3->1' }

        "latest.milestone"   | "reject all"               | '["2.0"]'               | ['2.1', '2.0']        | false
        "1.+"                | "reject all with metadata" | '["1.2", "1.1", "1.0"]' | ['1.2', '1.1', '1.0'] | true
        "latest.integration" | "reject all with metadata" | '["2.1"]'               | ['2.1']               | false

	18: {exits: [10]int{down: 16, east: 19, west: 18, up: 22}},
	19: {exits: [10]int{up: 29, west: 18, ne: 15, east: 20, south: 30}},
	20: {exits: [10]int{ne: 19, west: 20, se: 21}},
	21: {exits: [10]int{north: 20}}, // Dead End
	22: {exits: [10]int{north: 18, east: 24, down: 23, south: 28, west: 26, nw: 22}},
	23: {exits: [10]int{east: 22, west: 28, up: 24}},

        where:
        value | fromUnits        | toUnits          | converted
        21    | Fruit.apples     | Fruit.apples     | 21
        2.1   | Fruit.oranges    | Fruit.apples     | 6.3
        1024  | Fruit.grapefruit | Fruit.apples     | 1024 * 5
        1     | Fruit.apples     | Fruit.grapefruit | 0.2

val tomljVersion = "1.0.0"

// test only
val archunitVersion = "1.2.0"
val bytebuddyVersion = "1.10.20"
val jettyVersion = "9.4.36.v20210114"
val sshdVersion = "2.12.1"

// For the junit-bom
javaPlatform.allowDependencies()

dependencies {
    api(platform("org.junit:junit-bom:${junit5Version}!!"))

    constraints {

    assertNextPermutation(newArrayList(1, 2, 1, 2), permutations);
    assertNextPermutation(newArrayList(1, 2, 2, 1), permutations);
    assertNextPermutation(newArrayList(2, 1, 1, 2), permutations);
    assertNextPermutation(newArrayList(2, 1, 2, 1), permutations);
    assertNextPermutation(newArrayList(2, 2, 1, 1), permutations);
    assertNoMorePermutations(permutations);
  }

>>> Flow 3 (client to server)
00000000  14 03 03 00 01 01 17 03  03 00 35 52 13 5e 7a c8  |..........5R.^z.|
00000010  3e b6 e1 8e 59 c9 cf 54  0b c8 c2 17 ab 76 0d 3d  |>...Y..T.....v.=|
00000020  ec 5c 76 2c 21 21 f3 1e  a7 25 ba 67 97 8a 8f de  |.\v,!!...%.g....|
00000030  03 7d 1a bc 0a 9e c7 e7  02 52 cf d4 80 3e 80 7e  |.}.......R...>.~|
>>> Flow 4 (server to client)