runtime.HandleError(fmt.Errorf("feature %q is not implemented in DefaultFeatureSupportChecker", feature))
	}
}

func (f *defaultFeatureSupportChecker) checkClient(ctx context.Context, c client) {
	// start with 10 ms, multiply by 2 each step, until 15 s and stays on 15 seconds.
	delayFunc := wait.Backoff{
		Duration: 10 * time.Millisecond,
		Cap:      15 * time.Second,
		Factor:   2.0,
		Steps:    11}.DelayFunc()
	f.lock.Lock()

            matmul_op.getAdjY() ? shape_y.back() : *(shape_y.rbegin() + 1);
        const int y_col =
            !matmul_op.getAdjY() ? shape_y.back() : *(shape_y.rbegin() + 1);

        // Checks that matrix multiply can perform a valid contraction.
        if (x_col != y_row) {
          result_shape.clear();
          return false;
        }

        result_shape.push_back(x_row);
        result_shape.push_back(y_col);

  // will overcount the divisors.
  //    Following from (LEMMA 1) the only windows which contain overcounted
  // divisors are the ones on the outside right and bottom edge. We can iterate
  // over these windows and multiply the corresponding out element by
  // `kernel_size / X` where `X` is the number of elements in the padded input
  // tensor not in the newly padded zone. This corrects the overcounting of

        4      | Fruit.apples  | 1.2    | Fruit.oranges    | 1.111111
        125    | Fruit.oranges | 23.4   | Fruit.grapefruit | 3.205128
    }

    def "can multiply amount by a unitless value"() {
        expect:
        Amount.valueOf(a, Fruit.apples) * b == Amount.valueOf(c, Fruit.apples)

        where:
        a     | b   | c
        0     | 200 | 0