// to pass a dst bigger than src, and in that case, XORKeyStream will
	// only update dst[:len(src)] and will not touch the rest of dst.
	//
	// Multiple calls to XORKeyStream behave as if the concatenation of
	// the src buffers was passed in a single run. That is, Stream
	// maintains state and does not reset at each XORKeyStream call.
	XORKeyStream(dst, src []byte)
}

// A BlockMode represents a block cipher running in a block-based mode (CBC,

// license that can be found in the LICENSE file.

package rand

import "internal/syscall/unix"

func init() {
	// arc4random_buf is the recommended application CSPRNG, accepts buffers of
	// any size, and never returns an error.
	//
	// "The subsystem is re-seeded from the kernel random number subsystem on a
	// regular basis, and also upon fork(2)." - arc4random(3)
	//

  private int length;

  @BeforeExperiment
  void setUp() throws Exception {
    Random r = new Random();
    ba1 = new byte[length];
    r.nextBytes(ba1);
    ba2 = Arrays.copyOf(ba1, ba1.length);
    // Differ at the last element
    ba3 = Arrays.copyOf(ba1, ba1.length);
    ba4 = Arrays.copyOf(ba1, ba1.length);
    ba3[ba1.length - 1] = (byte) 43;
    ba4[ba1.length - 1] = (byte) 42;

            """
        )

        and: "multiple sub-projects"
        settingsFile << """
            include 'foo:foo'
            include 'bar:bar'
        """

        // Make the classpath of :foo differ from :bar's
        // thus causing :foo:foo and :bar:bar to have separate ClassLoaders.
        File someLib = file('lib/someLib.jar')
        jarWithClasses(someLib, SomeClass: 'class SomeClass {}')

            | foo       | bar         |
            | very long | short       |
            | tiny      | even longer |
        """.stripIndent(true).trim()
    }

    def "fails when header and row sizes differ"() {
        given:
        def header = ["a"]
        def rows = [
            new StyledTable.Row(["b"], StyledTextOutput.Style.Normal),
            new StyledTable.Row(["c"], StyledTextOutput.Style.Normal),

          "outputs": [ 1 ],
          "builtin_options_type": "ReshapeOptions",
          "builtin_options": {
            "new_shape": [ 2, 2 ]
          }
        }
      ]
    }
  ],
  "buffers": []

			continue
		}

		d, err := s.Data()
		if err != nil {
			t.Logf("reading data of note section %d: %v", i, err)
			continue
		}

		for len(d) > 0 {

			// ELF standards differ as to the sizes in
			// note sections.  Both the GNU linker and
			// gold always generate 32-bit sizes, so that
			// is what we assume here.

			if len(d) < 12 {

        /**
         * Returns Java VM version such as {@code 17.0.3.1+2-LTS}.
         * <p>
         * This value is identical to {@link #getRuntimeVersion()} for most of the vendors,
         * but could still differ for example by not including the language version.
         */
        String getJvmVersion();

        /**
         * Returns Java VM vendor such as {@code Eclipse Adoptium}.
         */

// CHECK-NEXT:      buffer: 1,
// CHECK-NEXT:      name: "tfl.pseudo_const",
// CHECK-NEXT:      quantization: {
// CHECK-NEXT:
// CHECK-NEXT:      },
// CHECK-NEXT:      has_rank: true

// CHECK:   buffers: [ {
// CHECK-EMPTY:
// CHECK-NEXT:   }, {
// CHECK-NEXT:     data: [ 1, 0, 0, 0, 2, 0, 0, 0 ]

	// Profile calls Modularize which implements the Louvain modularization algorithm.
	// Since this is a randomized algorithm we use a defined random source to ensure
	// consistency between test runs. In practice, results will not differ greatly
	// between runs with different PRNG seeds.
	src := rand.NewSource(1)

	// Create dumbell graph:
	//
	//  0       4
	//  |\     /|
	//  | 2 - 3 |
	//  |/     \|
	//  1       5
	//