// Now perform a write operation
            wrapperProps.setProperty("new.key", "new.value");

            // Read the initial key again - should return the current value
            assertEquals("externally.modified", wrapperProps.getProperty("initial.key"));

            // Read the external key that was set before the write operation

 *
 * IMPORTANT: Caches are only cleared between trials (10-second periods), not between individual
 * iterations, to properly test the cache benefits within each measurement period.
 */
@BenchmarkMode(Mode.AverageTime)
@OutputTimeUnit(TimeUnit.MICROSECONDS)
@Warmup(iterations = 3, time = 1)
@Measurement(iterations = 5, time = 10)
@Fork(1)
@State(Scope.Benchmark)
public class CompositeBeanHelperPerformanceTest {

/**
 * <p>Xpp3DomPerfTest class.</p>
 */
@BenchmarkMode(Mode.AverageTime)
@OutputTimeUnit(TimeUnit.MILLISECONDS)
@Warmup(iterations = 3)
@Measurement(time = 10)
public class Xpp3DomPerfTest {
    @State(Scope.Benchmark)
    public static class AdditionState {
        List<Path> poms;

        @Setup(Level.Iteration)
        public void setUp() throws IOException {
            Path userHome = Paths.get(System.getProperty("user.home"));

a single byte in the string.
</li>

<li>
The iteration order over maps is not specified
and is not guaranteed to be the same from one iteration to the next.
If a map entry that has not yet been reached is removed during iteration,
the corresponding iteration value will not be produced. If a map entry is
created during iteration, that entry may be produced during the iteration or

		//    a new entry in lockMap and acquires a lock for the same resource.

		<-lk2ch
		lk3ok := <-lk3ch
		lk4ok := <-lk4ch

		if lk3ok && lk4ok {
			t.Fatalf("multiple locks acquired; iteration=%d, lk3=%t, lk4=%t", i, lk3ok, lk4ok)
		}
	}

     *
     * <pre>{@literal
     * List<SourceRoot> enabledRoots = project.getSourceRoots()
     *         .stream().filter(SourceRoot::enabled).toList();
     * }</pre>
     *
     * The iteration order is the order in which the sources are declared in the POM file.
     *
     * @param project the project for which to get the source roots
     */
    @Nonnull

		gf2MatrixSquare(even, odd)
		if len2&1 != 0 {
			crc1n = gf2MatrixTimes(even, crc1n)
		}
		len2 >>= 1

		// if no more bits set, then done
		if len2 == 0 {
			break
		}

		// another iteration of the loop with odd and even swapped
		gf2MatrixSquare(odd, even)
		if len2&1 != 0 {
			crc1n = gf2MatrixTimes(odd, crc1n)
		}
		len2 >>= 1

		// if no more bits set, then done
		if len2 == 0 {

non-trivial square root Result = Composite W = 41 B = 2c # End of iteration Result = Composite W = 41 B = 16 # End of iteration Result = Composite W = 41 B = 14 # End of iteration Result = Composite W = 41 B = 2 # End of iteration Result = Composite W = 41 B = 3a # End of iteration Result = Composite W = 55 B = 40 # End of iteration Result = Composite W = 55 B = 7 # End of iteration Result = Composite W = 55 B = 23 # End of iteration Result = Composite W = 55 B = 2e # End of iteration Result = Composite...

non-trivial square root Result = Composite W = 41 B = 2c # End of iteration Result = Composite W = 41 B = 16 # End of iteration Result = Composite W = 41 B = 14 # End of iteration Result = Composite W = 41 B = 2 # End of iteration Result = Composite W = 41 B = 3a # End of iteration Result = Composite W = 55 B = 40 # End of iteration Result = Composite W = 55 B = 7 # End of iteration Result = Composite W = 55 B = 23 # End of iteration Result = Composite W = 55 B = 2e # End of iteration Result = Composite...

// The opening parenthesis has been absorbed.
func (in *Input) argsFor(macro *Macro) map[string][]Token {
	var args [][]Token
	// One macro argument per iteration. Collect them all and check counts afterwards.
	for argNum := 0; ; argNum++ {
		tokens, tok := in.collectArgument(macro)
		args = append(args, tokens)
		if tok == ')' {
			break
		}
	}