private void runInteractive(String task, String answer) {
        executer.withForceInteractive(true)
        executer.withStdinPipe()
        executer.withTasks(task, "--configuration-cache")
        def handle = executer.start()
        ConcurrentTestUtil.poll(60) {
            assert handle.standardOutput.contains("there? [yes, no]")
        }
        handle.stdinPipe.write((answer + TextUtil.platformLineSeparator).bytes)

	// If "1e23+8388608" is implemented as "1e23" + "8388608",
	// that ends up computing 1e23-8388608 + 8388608 = 1e23,
	// which rounds back to 1e23-8388608.
	// The correct answer, of course, would be "1e23+8388608" = 1e23+8388608.
	// This is not going to be correct until 6g has multiprecision floating point.
	// A simpler case is "1e23+1", which should also round to 1e23+8388608.

        By asking questions in a structured way (following this) it will be much easier to help you.

        And there's a high chance that you will find the solution along the way and you won't even have to submit it and wait for an answer. 😎

        As there are too many questions, I'll have to discard and close the incomplete ones. That will allow me (and others) to focus on helping people like you that follow the whole process and help us help you. 🤓

		}
		switch t1 {
		case 0:	testi(i,t1,t2,t3);
		case 1:	testi(i,t1,t2,t3);
		case 2:	testu(u,t1,t2,t3);
		}
	}
	}
	}
}

func
init() {
	/*
	 * set the 'correct' answer
	 */

	ians[index(0,0,0)] =   1234;
	ians[index(0,0,1)] =   1234;
	ians[index(0,1,0)] =  39488;
	ians[index(0,1,1)] =     38;
	ians[index(0,2,0)] =      0;
	ians[index(0,2,1)] =      0;

	Found:
		pd, err := fd.Stat()
		fd.Close()
		if err != nil {
			return "", err
		}
		if SameFile(pd, root) {
			break
		}
		// Set up for next round.
		dot = pd
	}

	// Save answer as hint to avoid the expensive path next time.
	getwdCache.Lock()
	getwdCache.dir = dir
	getwdCache.Unlock()

	return dir, nil

	Unalias(a)
	return a
}

// Enabled reports whether [NewAlias] should create [types.Alias] types.
//
// This function is expensive! Call it sparingly.
func Enabled() bool {
	// The only reliable way to compute the answer is to invoke go/types.
	// We don't parse the GODEBUG environment variable, because
	// (a) it's tricky to do so in a manner that is consistent
	//     with the godebug package; in particular, a simple

title: "x/pkgsite: package removal request for [type path here]"
labels: ["pkgsite/package-removal"]
body:
  - type: markdown
    attributes:
      value: "Please answer these questions before submitting your issue. Thanks!"
  - type: input
    id: package-path
    attributes:
      label: "What is the path of the package that you would like to have removed?"
      description: |

/**
 * A safe hasher that can be marked as invalid.
 * <p>
 * In order to avoid collisions we prepend the length of the next bytes to the underlying hasher
 * (see this <a href="http://crypto.stackexchange.com/a/10065">answer</a> on stackexchange).
 */
public interface Hasher {
    /**
     * Feed a bunch of bytes into the hasher.
     */
    void putBytes(byte[] bytes);

    /**

		// i ≤ h < j
		if cmp.Less(x[h], target) {
			i = h + 1 // preserves x[i-1] < target
		} else {
			j = h // preserves x[j] >= target
		}
	}
	// i == j, x[i-1] < target, and x[j] (= x[i]) >= target  =>  answer is i.
	return i, i < n && (x[i] == target || (isNaN(x[i]) && isNaN(target)))
}

// BinarySearchFunc works like [BinarySearch], but uses a custom comparison

name: Bugs
description: The go command, standard library, or anything else
title: "import/path: issue title"

body:
  - type: markdown
    attributes:
      value: |
        Thanks for helping us improve! 🙏 Please answer these questions and provide as much information as possible about your problem.

  - type: input
    id: go-version
    attributes:
      label: Go version
      description: |