The MIT License (MIT)

Copyright (c) 2018 Sebastián Ramírez

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is

    }

    @Test
    public void test_constructor_withLargeBufferSize() throws IOException {
        Process mockProcess = createMockProcess("large buffer test");
        JobProcess jobProcess = new JobProcess(mockProcess, 10000, null);

        assertNotNull(jobProcess.getInputStreamThread());
    }

    @Test

    class EdgeCasesTests {

        @Test
        @DisplayName("Should handle maximum size arrays")
        void testMaximumSizeArrays() {
            // Test with reasonably large arrays
            int[] largeCiphers = new int[100];
            for (int i = 0; i < 100; i++) {
                largeCiphers[i] = i;
            }

 * This job removes old crawling sessions, search logs, job logs, and user info logs
 * based on configured retention periods. It helps maintain system performance by
 * preventing log tables from growing too large.
 */
public class PurgeLogJob {

    /** Logger instance for this class */
    private static final Logger logger = LogManager.getLogger(PurgeLogJob.class);

    /**
     * Default constructor for PurgeLogJob.

	r := &netperfReader{eof: make(chan struct{})}
	r.buf = make([]byte, 128*humanize.KiByte)
	rand.Read(r.buf)

	connectionsPerPeer := 16

	if len(globalNotificationSys.peerClients) > 16 {
		// For a large cluster it's enough to have 1 connection per peer to saturate the network.
		connectionsPerPeer = 1
	}

	errStr := ""
	var wg sync.WaitGroup
	for index := range globalNotificationSys.peerClients {

= vendor/github.com/MakeNowJust/heredoc licensed under: =

The MIT License (MIT)

Copyright (c) 2014-2019 TSUYUSATO Kitsune

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell

                // Values should be within reasonable range for security flags
                assertTrue(value <= 0xFFFF, "Constant " + field.getName() + " value seems unusually large");
            }
        }
    }

    /**
     * Helper method to check if a number is a power of two
     */
    private boolean isPowerOfTwo(int n) {
        return n > 0 && (n & (n - 1)) == 0;

 * features}, the features supported by the iterator; and {@code expectedElements}, the elements the
 * iterator should return in order.
 *
 * <p>The items in {@code elementsToInsert} will be repeated if {@code steps} is larger than the
 * number of provided elements.
 *
 * @author Chris Povirk
 */
@GwtCompatible
@NullMarked
public abstract class ListIteratorTester<E extends @Nullable Object>

The MIT License (MIT)

Copyright (c) 2015-2018 gimme contributors

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is

The MIT License (MIT)

Copyright (c) 2015-2016 Manfred Touron

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is