Parts:            nil,
		Erasure: ErasureInfo{
			Algorithm:    ReedSolomon.String(),
			DataBlocks:   4,
			ParityBlocks: 2,
			BlockSize:    10000,
			Index:        1,
			Distribution: []int{1, 2, 3, 4, 5, 6, 7, 8},
			Checksums: []ChecksumInfo{{
				PartNumber: 1,
				Algorithm:  HighwayHash256S,
				Hash:       nil,
			}},
		},
		MarkDeleted:      false,
		NumVersions:      1,
		SuccessorModTime: time.Time{},

        int byteCountValue = 8 + domainBytes.length;
        setByteCount(response, byteCountValue);
        byte[] buffer = new byte[byteCountValue];
        int bufferIndex = 0;
        byte[] key = new byte[] { 1, 2, 3, 4, 5, 6, 7, 8 };
        System.arraycopy(key, 0, buffer, bufferIndex, key.length);
        bufferIndex += key.length;
        System.arraycopy(domainBytes, 0, buffer, bufferIndex, domainBytes.length);

		Parts:            nil,
		Erasure: ErasureInfo{
			Algorithm:    ReedSolomon.String(),
			DataBlocks:   4,
			ParityBlocks: 2,
			BlockSize:    10000,
			Index:        1,
			Distribution: []int{1, 2, 3, 4, 5, 6, 7, 8},
			Checksums: []ChecksumInfo{{
				PartNumber: 1,
				Algorithm:  HighwayHash256S,
				Hash:       nil,
			}},
		},
		MarkDeleted:      false,
		NumVersions:      1,

        // Name bytes at 0x10
        byte[] name = new byte[] { 'T', 'E', 'S', 'T' };
        System.arraycopy(name, 0, ctx, 0x10, name.length);
        // Data bytes at 0x20
        byte[] data = new byte[] { 1, 2, 3, 4, 5, 6, 7, 8 };
        System.arraycopy(data, 0, ctx, 0x20, data.length);

        // Update base to point to the context area
        int offsetFieldPos = base.length - 8; // position of CreateContextsOffset

	// Validate the input
	for scanner.Scan() {
		fmt.Printf("%s\n", scanner.Text())
	}

	if err := scanner.Err(); err != nil {
		fmt.Printf("Invalid input: %s", err)
	}
	// Output:
	// 1234
	// 5678
	// Invalid input: strconv.ParseInt: parsing "1234567901234567890": value out of range
}

// Use a Scanner with a custom split function to parse a comma-separated
// list with an empty final value.

        @Test
        @DisplayName("Should get NTLM challenge with address")
        void testGetChallengeWithAddress() throws CIFSException {
            // Given
            byte[] expectedChallenge = new byte[] { 1, 2, 3, 4, 5, 6, 7, 8 };
            when(transportPool.getChallenge(context, address)).thenReturn(expectedChallenge);

            // When
            byte[] result = transportPool.getChallenge(context, address);

  }

  public void testToAddrStringIPv6() {
    assertThat(InetAddresses.toAddrString(InetAddresses.forString("1:2:3:4:5:6:7:8")))
        .isEqualTo("1:2:3:4:5:6:7:8");
    assertThat(InetAddresses.toAddrString(InetAddresses.forString("2001:0:0:4:0:0:0:8")))
        .isEqualTo("2001:0:0:4::8");

// along with this program.  If not, see <http://www.gnu.org/licenses/>.

package dsync

import (
	"context"
	"fmt"
	"runtime"
	"sync/atomic"
	"testing"
	"time"
)

const (
	id     = "1234-5678"
	source = "main.go"
)

func testSimpleWriteLock(t *testing.T, duration time.Duration) (locked bool) {
	drwm1 := NewDRWMutex(ds, "simplelock")
	ctx1, cancel1 := context.WithCancel(t.Context())

    assertPermutationsCount(6, Collections2.permutations(newArrayList(1, 2, 3)));
    assertPermutationsCount(5040, Collections2.permutations(newArrayList(1, 2, 3, 4, 5, 6, 7)));
    assertPermutationsCount(40320, Collections2.permutations(newArrayList(1, 2, 3, 4, 5, 6, 7, 8)));
  }

  public void testPermutationSetSizeOverflow() {
    // 13 elements overflow an int
    assertEquals(
        Integer.MAX_VALUE,

		b.WriteString("56789012")   // longer than BufSize
		tw.check(t, "12345678", "") // but not enough (after filling the partially-filled buffer)
		b.Flush()
		tw.check(t, "123456789012", "")
	}
	{
		tw := &teststringwriter{}
		b := NewWriterSize(tw, BufSize)
		b.WriteString("123456789")   // long string, empty buffer:
		tw.check(t, "", "123456789") // use WriteString
	}
	{
		tw := &teststringwriter{}