// Given - buffer with padding before actual data
            ByteBuffer buffer = ByteBuffer.allocate(34);
            buffer.order(ByteOrder.LITTLE_ENDIAN);
            buffer.position(10); // Add 10 bytes of padding
            buffer.putLong(2048L);
            buffer.putLong(1024L);
            buffer.putInt(4);
            buffer.putInt(4096);
            byte[] bufferArray = buffer.array();

        assertEquals(5, skipped);
        assertEquals(5L, raf.getFilePointer());
        assertEquals(0, raf.skipBytes(-3));
    }

    @Test
    @DisplayName("seek() and getFilePointer(): set and get position")
    void seek_and_getFilePointer() throws Exception {
        SmbRandomAccessFile raf = newInstance("r", false, false, false);
        raf.seek(123L);
        assertEquals(123L, raf.getFilePointer());
    }

        byte[] nameBytes = serverName.getBytes(StandardCharsets.US_ASCII);
        System.arraycopy(nameBytes, 0, buffer, bufferIndex, 15);
        buffer[15] = 0; // null terminator at position 15
        bufferIndex += 16;

        // Write version
        buffer[bufferIndex++] = 6;
        buffer[bufferIndex++] = 1;

        // Write type
        SMBUtil.writeInt4(0, buffer, bufferIndex);

			for _, e := range list {
				fmt.Fprintln(os.Stderr, e)
			}
			os.Exit(2)
		}
		fatalf("parsing %s: %s", name, err)
	}
	return ast1
}

func sourceLine(n ast.Node) int {
	return fset.Position(n.Pos()).Line
}

// ParseGo populates f with information learned from the Go source code
// which was read from the named file. It gathers the C preamble
// attached to the import "C" comment, a list of references to C.xxx,

    for (int i = start; i < end; i++) {
      if (array[i] == target) {
        return i;
      }
    }
    return -1;
  }

  /**
   * Returns the start position of the first occurrence of the specified {@code target} within
   * {@code array}, or {@code -1} if there is no such occurrence.
   *

    for (int i = start; i < end; i++) {
      if (array[i] == target) {
        return i;
      }
    }
    return -1;
  }

  /**
   * Returns the start position of the first occurrence of the specified {@code target} within
   * {@code array}, or {@code -1} if there is no such occurrence.
   *

    for (int i = start; i < end; i++) {
      if (array[i] == target) {
        return i;
      }
    }
    return -1;
  }

  /**
   * Returns the start position of the first occurrence of the specified {@code target} within
   * {@code array}, or {@code -1} if there is no such occurrence.
   *

 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

/*
 * Portions of this file are modified versions of
 * http://gee.cs.oswego.edu/cgi-bin/viewcvs.cgi/jsr166/src/test/tck/AbstractExecutorServiceTest.java?revision=1.30
 * which contained the following notice:
 *

     * This method always compares the full length of both arrays, regardless of when
     * differences are found, making the execution time independent of the position
     * of differing characters.
     *
     * @param a first char array to compare
     * @param b second char array to compare
     * @return true if arrays are equal, false otherwise
     */

            // Given - buffer with padding before actual data
            ByteBuffer buffer = ByteBuffer.allocate(42);
            buffer.order(ByteOrder.LITTLE_ENDIAN);
            buffer.position(10); // Add 10 bytes of padding
            buffer.putLong(2048L);
            buffer.putLong(1024L);
            buffer.putLong(1024L);
            buffer.putInt(4);
            buffer.putInt(4096);