private int maxAlphanumTermSize = -1;

        private int maxSymbolTermSize = -1;

        private boolean duplicateTermRemoved = false;

        /**
         * Array of space characters. Default includes common space characters.
         */
        private int[] spaceChars = { '\u0020', '\u00a0', '\u3000', '\ufffd' };

        /**
         * Constructor.
         * @param reader The reader.
         */

        netdfs.DfsInfo1 info1 = new netdfs.DfsInfo1();
        info1.entry_path = "test_path";

        ByteArrayOutputStream bos = new ByteArrayOutputStream();
        // Create buffer for encoding - initially allocate some space
        byte[] encodeBuffer = new byte[1024];
        NdrBuffer dst = new NdrBuffer(encodeBuffer, 0);
        info1.encode(dst);

        ByteArrayInputStream bis = new ByteArrayInputStream(bos.toByteArray());

        }

        /** The percentage of used space on the filesystem. */
        public short percent;
        /** Used space in bytes */
        public long used;
        /** Filesystem path */
        public String path;
        /** Free space in bytes */
        public long free;
        /** Total space in bytes */
        public long total;
        /** Usable space in bytes */
        public long usable;
    }

        «««
        ## Ein weiteres Modul mit `APIRouter`. { #another-module-with-apirouter }
        »»»

3) Replace occurrences of literal « - » (a space followed by a hyphen followed by a space) with « – » (a space followed by a dash followed by a space) in the translated part of the heading.

Example:

    Source (English):

        «««
        # FastAPI in Containers - Docker { #fastapi-in-containers-docker }

        @ParameterizedTest
        @DisplayName("Should handle various capacity and free space values")
        @CsvSource({ "0, 0", "1024, 512", "1048576, 524288", "1073741824, 536870912", "9223372036854775807, 4611686018427387903", // Long.MAX_VALUE and half
                "-1, -1", // Negative values (edge case)
                "100, 200" // Free space greater than capacity (edge case)
        })

	return false
}

// ScanWords is a split function for a [Scanner] that returns each
// space-separated word of text, with surrounding spaces deleted. It will
// never return an empty string. The definition of space is set by
// unicode.IsSpace.
func ScanWords(data []byte, atEOF bool) (advance int, token []byte, err error) {
	// Skip leading spaces.
	start := 0
	for width := 0; start < len(data); start += width {
		var r rune

                "1000, 500, 8, 4096", // 4K sectors
                "1000, 500, 16, 4096", // Large sectors and allocation
                "1000, 0, 8, 512", // No free space
                "1000, 1000, 8, 512" // All space free
        })
        void shouldDecodeVariousSectorConfigurations(long alloc, long free, int sectPerAlloc, int bytesPerSect)
                throws SMBProtocolDecodingException {

    }

    /**
     * Returns whether space trimming is enabled.
     * @return True if space trimming is enabled, false otherwise.
     */
    public boolean isTrimSpace() {
        return trimSpaceEnabled;
    }

    /**
     * Sets whether space trimming is enabled.
     * @param trimSpace The trim space flag to set.
     */
    public void setTrimSpace(final boolean trimSpace) {

                "1000, 500, 600, 8, 4096", // 4K sectors
                "1000, 500, 600, 16, 4096", // Large sectors and allocation
                "1000, 0, 0, 8, 512", // No free space
                "1000, 1000, 1000, 8, 512" // All space free
        })
        void shouldDecodeVariousSectorConfigurations(long alloc, long callerFree, long actualFree, int sectPerAlloc, int bytesPerSect)

		return l, true
	}
	return 0, false
}

// grow grows the buffer to guarantee space for n more bytes.
// It returns the index where bytes should be written.
// If the buffer can't grow it will panic with ErrTooLarge.
func (b *Buffer) grow(n int) int {
	m := b.Len()
	// If buffer is empty, reset to recover space.
	if m == 0 && b.off != 0 {
		b.Reset()
	}
	// Try to grow by means of a reslice.