/** The CRUD operation mode for form processing */
    @ValidateTypeFailure
    public Integer crudMode;

    /** The input terms that should be considered synonymous */
    @Required
    @Size(max = 1000)
    public String inputs;

    /** The output synonyms that should be matched for the input terms */
    @Required
    @Size(max = 1000)
    public String outputs;

    /**

    class ConstructorTests {

        @ParameterizedTest
        @DisplayName("Should mask input values with 0xFF correctly")
        @ValueSource(ints = { 0, 1, 127, 128, 255, 256, -1, -128, -255, -256, 32767, -32768, 65535, 65536 })
        void testConstructorMasking(int inputValue) {
            // Given: An input value
            // When: Creating NdrShort with that value
            NdrShort ndrShort = new NdrShort(inputValue);

   * consistent hashing</a> for more information.
   */
  public static int consistentHash(long input, int buckets) {
    checkArgument(buckets > 0, "buckets must be positive: %s", buckets);
    LinearCongruentialGenerator generator = new LinearCongruentialGenerator(input);
    int candidate = 0;
    int next;

    // Jump from bucket to bucket until we go out of range
    while (true) {

                                        <th style="width: 25%"><la:message
                                                key="labels.dict_protwords_source"/></th>
                                        <td>${f:h(input)}<la:hidden property="input"/></td>
                                    </tr>
                                    </tbody>
                                </table>
                            </div>

import java.util.Random;
import org.jspecify.annotations.NullUnmarked;

/**
 * Utilities for benchmarks.
 *
 * <p>In many cases, we wish to vary the order of magnitude of the input as much as we want to vary
 * the input itself, so most methods which generate values use an exponential distribution varying
 * the order of magnitude of the generated values uniformly at random.
 *
 * @author Louis Wasserman
 */
@NullUnmarked

        assertFalse(Arrays.equals(encKey, decKey), "Encryption and decryption keys should be different");
    }

    @Test
    @DisplayName("Should produce consistent keys for same input")
    void testDeriveKeys_Consistency() {
        // Given
        int dialect = Smb2Constants.SMB2_DIALECT_0311;

        // When - derive same key twice

    /**
     * Calculates the effective repositories for the given input repositories which are assumed to be already mirrored
     * (if applicable). This process will essentially remove duplicate repositories by merging them into one equivalent
     * repository. It is worth to point out that merging does not simply choose one of the input repositories and
     * discards the others but actually combines their possibly different policies.

					<input class="form-control" type="text" id="as_q" name="as.q" value="${f:h(fe:join(as.q))}">
				</div>
			</div>
			<div class="mb-3 row">
				<label for="as_epq" class="col-lg-3 col-md-4 col-sm-5 col-12 col-form-label"><la:message
						key="labels.advance_search_phrase_query"
					/></label>
				<div class="col-lg-5 col-md-8 col-sm-7 col-6">

    public static OptionalEntity<StopwordsItem> createStopwordsItem(final CreateForm form, final VaErrorHook hook) {
        return getEntity(form).map(entity -> {
            final String newInput = form.input;
            validateStopwordsString(newInput, "input", hook);
            entity.setNewInput(newInput);
            return entity;
        });
    }

                    fp = cur;
                }
                break;
            default:
                input.append((char) c);
                break;
            }
        }

        if (c == -1 && input.length() == 0) {
            return null;
        }

        return input.toString();
    }

    @Override
    public final String readUTF() throws SmbException {