*
     * @return The new part of speech.
     */
    public String getNewPos() {
        return newPos;
    }

    /**
     * Sets the new part of speech.
     *
     * @param newPos The new part of speech.
     */
    public void setNewPos(final String newPos) {
        this.newPos = newPos;
    }

    /**
     * Returns the token.
     *
     * @return The token.
     */

            final Map<String, Object> newDoc = fessConfig.convertToStorableDoc(doc);
            newDoc.put(indexFieldId, crawlingInfoHelper.generateId(newDoc));
            newDoc.put(indexFieldDocId, systemHelper.generateDocId(newDoc));
            if (newDoc.get(indexFieldLang) instanceof final List<?> langList) {
                if (langList.contains("auto")) {
                    newDoc.remove(indexFieldLang);
                }

        AvlNode<E> newTop = pred();
        // newTop is the maximum node in my left subtree
        newTop.left = left.removeMax(newTop);
        newTop.right = right;
        newTop.distinctElements = distinctElements - 1;
        newTop.totalCount = totalCount - oldElemCount;
        return newTop.rebalance();
      } else {
        AvlNode<E> newTop = succ();

                  TF_Status* status) {
  tensorflow::ImmediateExecutionOperation* new_op =
      tensorflow::unwrap(ctx)->CreateOperation();
  status->status = new_op->Reset(op_or_function_name, nullptr);
  if (!status->status.ok()) {
    new_op->Release();
    new_op = nullptr;
  }
  return tensorflow::wrap(new_op);
}

void TFE_DeleteOp(TFE_Op* op) {
  if (op == nullptr) {
    return;
  }

        List<Integer> indexes = Arrays.asList(1, 2);
        RelevanceEvaluationResult result = RelevanceEvaluationResult.withRelevantDocs(docIds, indexes);

        try {
            result.getRelevantDocIds().add("newDoc");
            fail("DocIds list should be immutable");
        } catch (UnsupportedOperationException e) {
            // Expected
        }
    }

    @Test
    public void test_indexesAreImmutable() {

	want := []string{"src/compress/bzip2/bit_reader.go", "src/compress/bzip2/bzip2.go", "src/compress/bzip2/bzip2_test.go", "src/compress/bzip2/huffman.go", "src/compress/bzip2/move_to_front.go", "src/compress/bzip2/testdata/Isaac.Newton-Opticks.txt.bz2", "src/compress/bzip2/testdata/e.txt.bz2", "src/compress/bzip2/testdata/fail-issue5747.bz2", "src/compress/bzip2/testdata/pass-random1.bin", "src/compress/bzip2/testdata/pass-random1.bz2", "src/compress/bzip2/testdata/pass-random2.bin",...

pkg crypto/hpke, func NewHybridPublicKey(crypto.Encapsulator, *ecdh.PublicKey) (PublicKey, error) #75300
pkg crypto/hpke, func NewKDF(uint16) (KDF, error) #75300
pkg crypto/hpke, func NewKEM(uint16) (KEM, error) #75300
pkg crypto/hpke, func NewMLKEMPrivateKey(crypto.Decapsulator) (PrivateKey, error) #75300
pkg crypto/hpke, func NewMLKEMPublicKey(crypto.Encapsulator) (PublicKey, error) #75300

     *
     * We start out with a double-precision approximation, which may be higher or lower than the
     * true value. Therefore, we perform at least one Newton iteration to get a guess that's
     * definitely >= floor(sqrt(x)), and then continue the iteration until we reach a fixed point.
     */
    BigInteger sqrt0;
    int log2 = log2(x, FLOOR);

		t.Fatalf("delete auto_increment_struct fail, err: %v", err)
	}

	newRow := &AutoIncrementStruct{}
	if err := DB.Create(newRow).Error; err != nil {
		t.Fatalf("create auto_increment_struct fail, err: %v", err)
	}

	AssertEqual(t, newRow.ID, lastID+1)
}

// https://github.com/go-gorm/gorm/issues/5320
func TestPrimarykeyID(t *testing.T) {

gcmPlatformData } func New(cipher *aes.Block, nonceSize, tagSize int) (*GCM, error) { // This function is outlined to let the allocation happen on the parent stack. return newGCM(&GCM{}, cipher, nonceSize, tagSize) } // newGCM is marked go:noinline to avoid it inlining into New, and making New // too complex to inline itself. // //go:noinline func newGCM(g *GCM, cipher *aes.Block, nonceSize, tagSize int) (*GCM, error) { if tagSize < gcmMinimumTagSize || tagSize > gcmBlockSize { return nil, errors.New("cipher:...