}


    private void updatePreauthHash ( byte[] input ) throws CIFSException {
        synchronized ( this.preauthIntegrityHash ) {
            this.preauthIntegrityHash = calculatePreauthHash(input, 0, input.length, this.preauthIntegrityHash);
        }
    }


    byte[] calculatePreauthHash ( byte[] input, int off, int len, byte[] oldHash ) throws CIFSException {

	return errors.Is(err, syscall.ENOSPC)
}

// Invalid argument, unsupported flags such as O_DIRECT
func isSysErrInvalidArg(err error) bool {
	return errors.Is(err, syscall.EINVAL)
}

// Input/output error
func isSysErrIO(err error) bool {
	return errors.Is(err, syscall.EIO)
}

// Check if the given error corresponds to EISDIR (is a directory).
func isSysErrIsDir(err error) bool {

                                    <div class="form-inline col-sm-9">
                                        <la:errors property="sortOrder"/>
                                        <input type="number" name="sortOrder" id="sortOrder"
                                               value="${f:h(sortOrder)}" class="form-control"
                                               min="0" max="100000">

   * value} is greater than {@code max}, {@code max} is returned.
   *
   * <p><b>Java 21+ users:</b> Use {@code Math.clamp} instead. Note that that method is capable of
   * constraining a {@code long} input to an {@code int} range.
   *
   * @param value the {@code int} value to constrain
   * @param min the lower bound (inclusive) of the range to constrain {@code value} to

                                                        data-href="${contextPath}/admin/dict/stemmeroverride/details/${f:u(dictId)}/4/${f:u(data.id)}">
                                                    <td>${f:h(data.input)}</td>
                                                    <td>${f:h(data.output)}</td>
                                                </tr>
                                            </c:forEach>

 * }</pre>
 *
 * <p>Graph algorithms that need additional capabilities (accessing both predecessors and
 * successors, iterating over the edges, etc.) should declare their input to be of a type that
 * provides those capabilities, such as {@link Graph}, {@link ValueGraph}, or {@link Network}.
 *
 * <h3>Additional documentation</h3>
 *

                                            key="labels.dict_kuromoji_file"/></label>
                                    <div class="col-sm-9">
                                        <input type="file" id="kuromojiFile" name="kuromojiFile" class="form-control-file"/>
                                    </div>
                                </div>
                            </div>

                                            key="labels.dict_mapping_file"/></label>
                                    <div class="col-sm-9">
                                        <input type="file" id="charMappingFile" name="charMappingFile" class="form-control-file"/>
                                    </div>
                                </div>
                            </div>

                                            key="labels.dict_stopwords_file"/></label>
                                    <div class="col-sm-9">
                                        <input type="file" id="stopwordsFile" name="stopwordsFile" class="form-control-file"/>
                                    </div>
                                </div>
                            </div>

	// test cases with sample input and expected output.
	testCases := []struct {
		bucketName string
		// bucket policy to be set,
		// set as request body.
		bucketPolicyReader io.ReadSeeker
		// length in bytes of the bucket policy being set.