("change",f).on("change",f).valAttr("depending-value",c.valAttr("depends-on-value")),this.dependingInputs=this.dependingInputs||[],this.dependingInputs.push(c)})})},c=function(b,c){var d=function(){var c=a(this),d=c.valAttr("optional-if-answered"),e=!1,f=!!a.formUtils.getValue(c);f||(a.each(a.split(d),function(c,d){var f=b.find('[name="'+d+'"]');if(e=!!a.formUtils.getValue(f))return!1}),e&&c.valAttr("skipped",1))},e=function(){var d=a(this),e=d.valAttr("optional-if-answered");a.each(a.split(e),function(d,e){var...

    }
  }

  @CollectionFeature.Require(SUPPORTS_ADD)
  public void testAddOccurrencesNegative() {
    try {
      getMultiset().add(e0(), -1);
      fail("multiset.add(E, -1) didn't throw an exception");
    } catch (IllegalArgumentException required) {
    }
  }

  @CollectionFeature.Require(SUPPORTS_ADD)
  public void testAddTooMany() {
    getMultiset().add(e3(), Integer.MAX_VALUE);

## FIXME:
## In OSX, 'sort -V' option does not exist, hence
## we have our own version compare function.
## Once OSX has the option, below function is good enough.
##
## check_minimum_version() {
##     versions=($(echo -e "$1\n$2" | sort -V))
##     return [ "$1" == "${versions[0]}" ]
## }
##
check_minimum_version() {
	IFS='.' read -r -a varray1 <<<"$1"
	IFS='.' read -r -a varray2 <<<"$2"

	for i in "${!varray1[@]}"; do

package envoyfilter

import (
	"testing"

	"istio.io/istio/pkg/slices"
)

func TestReplaceAndInsert(t *testing.T) {
	f := func(e int) (bool, int) {
		// replace 1 with 10
		if e == 1 {
			return true, 10
		}
		return false, 0
	}

	cases := []struct {
		name         string
		input        []int
		replace      []int
		insertBefore []int
		insertAfter  []int
		applied      bool

    }
  }

  @CollectionFeature.Require(SUPPORTS_ADD)
  public void testAddOccurrencesNegative() {
    try {
      getMultiset().add(e0(), -1);
      fail("multiset.add(E, -1) didn't throw an exception");
    } catch (IllegalArgumentException required) {
    }
  }

  @CollectionFeature.Require(SUPPORTS_ADD)
  public void testAddTooMany() {
    getMultiset().add(e3(), Integer.MAX_VALUE);

        run("impl:${language.compileTaskName}")

        then:
        impl.recompiledClasses('B', 'C', 'C$Inner', 'D', 'D$Inner', 'E', 'E$1', 'F', 'F$Inner')

        where:
        visibility << ['public', 'private', '']
    }

    def "does full recompilation if change of constant value in annotation"() {
        source api: [

	// converted in Bytes and SetBytes.
	x {{ .Prefix }}MontgomeryDomainFieldElement
}

const {{ .Prefix }}ElementLen = {{ .BytesLen }}

type {{ .Prefix }}UntypedFieldElement = {{ .FiatType }}

// One sets e = 1, and returns e.
func (e *{{ .Element }}) One() *{{ .Element }} {
	{{ .Prefix }}SetOne(&e.x)
	return e
}

// Equal returns 1 if e == t, and zero otherwise.
func (e *{{ .Element }}) Equal(t *{{ .Element }}) int {

#
# The module dependency graph initially looks like:
#
# m ---- a.1
# |       |
# +----- b.1
# |       |
# +----- c.1
# |
# +----- d.1
#
# b.2 ---- c.2
#  |
#  +------ d.2
#  |
#  +------ e.1
#
# If we upgrade module b to version 2, we will upgrade c and d and add a new
# dependency on e. If b version 2 is disallowed because of any of those
# dependencies, the other dependencies should not be upgraded as a side-effect.

		// - Add 0.499.. or 0.5 before truncating depending on whether the truncated
		//   number is even or odd (respectively).
		const halfMinusULP = (1 << (shift - 1)) - 1
		e -= bias
		bits += (halfMinusULP + (bits>>(shift-e))&1) >> e
		bits &^= fracMask >> e
	} else if e == bias-1 && bits&fracMask != 0 {
		// Round 0.5 < abs(x) < 1.
		bits = bits&signMask | uvone // +-1
	} else {
		// Round abs(x) <= 0.5 including denormals.

)){var g=e.replace(/\(/g,"").replace(/\)/g,""),h=g.split(","),i=!0;return h.forEach(function(a,c){var e=b(a);Number.isInteger(e)?0===c?(d=0<=e&&e<=360,d||(i=!1)):(d=0<=e&&e<=100,d||(i=!1)):isNaN(e)?(e=parseInt(a),d=0<=e&&e<=100,d||(i=!1)):(d=0<=e&&e<=1,d||(i=!1))}),i}return!1},errorMessage:"",errorMessageKey:"badHsla"})}(a)});...