}

	newID := id[:strings.LastIndex(id, "/")] + "/" + buildid.HashToString(hash)
	if len(newID) != len(id) {
		log.Fatalf("%s: build ID length mismatch %q vs %q", file, id, newID)
	}

	if len(matches) == 0 {
		return
	}

	f, err = os.OpenFile(file, os.O_RDWR, 0)
	if err != nil {
		log.Fatal(err)
	}

    /**
     * NDR encoding error fault code
     */
    int DCERPC_FAULT_NDR = 0x000006F7;
    /**
     * Invalid tag fault code
     */
    int DCERPC_FAULT_INVALID_TAG = 0x1C000006;
    /**
     * Context mismatch fault code
     */
    int DCERPC_FAULT_CONTEXT_MISMATCH = 0x1C00001A;
    /**
     * Operation range error fault code
     */
    int DCERPC_FAULT_OP_RNG_ERROR = 0x1C010002;
    /**

          + "adjacentNode(node) if you already have a node, or nodeU()/nodeV() if you don't.";
  static final String EDGE_ALREADY_EXISTS = "Edge %s already exists in the graph.";
  static final String ENDPOINTS_MISMATCH =
      "Mismatch: endpoints' ordering is not compatible with directionality of the graph";

  /** Singleton edge value for {@link Graph} implementations backed by {@link ValueGraph}s. */
  enum Presence {
    EDGE_EXISTS
  }

)

func TestIsRequested(t *testing.T) {
	for i, test := range kmsIsRequestedTests {
		_, got := IsRequested(test.Header)
		if Requested(test.Header) != got {
			// Test if result matches.
			t.Errorf("Requested mismatch, want %v, got %v", Requested(test.Header), got)
		}
		got = got && S3KMS.IsRequested(test.Header)
		if got != test.Expected {
			t.Errorf("SSE-KMS: Test %d: Wanted %v but got %v", i, test.Expected, got)
		}
	}

The following code block uses quadruple backticks.

````python
# Hello world function
def hello_world():
    print("Hello, world!")  # Print greeting
````

### Backticks number mismatch is fixable { #backticks-number-mismatch-is-fixable }

The following code block has triple backticks in the original document, but quadruple backticks in the translated document.
It will be fixed by the fixer tool (will convert to triple backticks).

	if len(tx.Statement.Joins) == 0 {
		t.Fatalf("Joins expected")
	}
	if tx.Statement.Joins[0].Name != "JOIN accounts ON accounts.user_id = users.id" {
		t.Fatalf("Join name mismatch: %v", tx.Statement.Joins[0].Name)
	}

	// Preload
	tx = tx.Preload("Orders", "state != ?", "cancelled")
	args, ok := tx.Statement.Preloads["Orders"]
	if !ok || len(args) != 2 {

        // Assert: copied region equals the source slice.
        for (int i = 0; i < len; i++) {
            assertEquals(src[off + i], dst[dstIndex + i], "Byte mismatch at " + i);
        }

        // Assert: bytes before and after region remain unchanged.
        for (int i = 0; i < dstIndex; i++) {

        // Compare actual bytes (up to encoded length)
        for (int i = 0; i < encoded1; i++) {
            assertEquals(buffer1[i], buffer2[i], "Mismatch at position " + i);
            assertEquals(buffer2[i], buffer3[i], "Mismatch at position " + i);
        }
    }

    @Test
    @DisplayName("Test with typical Windows pipe name format")
    void testWithTypicalWindowsPipeName() {

			t.Errorf("Test %d: %s:  Expected to pass, but failed with: <ERROR> %s", i+1, instanceType, err.Error())
			continue
		}

		if len(result.Objects) != len(testCase.objectsAfterDelete) {
			t.Errorf("Test %d: %s: mismatch number of objects after delete, expected = %v, found = %v", i+1, instanceType, testCase.objectsAfterDelete, result.Objects)
			continue
		}

		for idx := range result.Objects {

func (e *Evaluator) Eval(objs []ObjectOpts) ([]Event, error) {
	if len(objs) == 0 {
		return nil, nil
	}
	if len(objs) != objs[0].NumVersions {
		return nil, fmt.Errorf("number of versions mismatch, expected %d, got %d", objs[0].NumVersions, len(objs))
	}
	return e.eval(objs, time.Now().UTC()), nil