if (repositoryUrl.contains("${")) {
            // the repository url contains unresolved properties and getting the basedir is not possible
            // in JDK 20+ 'new URL(string)' will fail if the string contains a curly brace
            this.basedir = null;
        } else {
            try {
                URL url = new URL(repository.getUrl());
                if ("file".equals(url.getProtocol())) {

        // Test characters just outside ranges that are not valid
        assertFalse(CharUtil.isUrlChar('`')); // backtick (just before 'a')
        assertFalse(CharUtil.isUrlChar('{')); // left brace (just after 'z')
        assertFalse(CharUtil.isUrlChar('^')); // caret (before 'a' range)
        assertFalse(CharUtil.isUrlChar('|')); // pipe (not in valid set)
    }

mvn test                       # Run tests
mvn formatter:format           # Format code
mvn license:format             # Update license headers
```

### Code Style

- 4 spaces (no tabs)
- Opening brace on same line
- Max line length: 120
- JavaDoc required for public APIs
- License headers required

### Testing

**Structure**: `src/test/java/org/codelibs/fess/crawler/`

TypeName form of the LiteralType appears as an operand between the
<a href="#Keywords">keyword</a> and the opening brace of the block
of an "if", "for", or "switch" statement, and the composite literal
is not enclosed in parentheses, square brackets, or curly braces.
In this rare case, the opening brace of the literal is erroneously parsed
as the one introducing the block of statements. To resolve the ambiguity,

        //
        // Note that there is a race condition here which can result in missing
        // a cyclic edge: it's possible for two threads to simultaneous find
        // "safe" edges which together form a cycle. Preventing this race
        // condition efficiently without _introducing_ deadlock is probably
        // tricky. For now, just accept the race condition---missing a warning

        //
        // Note that there is a race condition here which can result in missing
        // a cyclic edge: it's possible for two threads to simultaneous find
        // "safe" edges which together form a cycle. Preventing this race
        // condition efficiently without _introducing_ deadlock is probably
        // tricky. For now, just accept the race condition---missing a warning

			// Form and append a line of stack trace into a
			// collection, 'trace', to build full stack trace
			trace = append(trace, fmt.Sprintf("%v:%v:%v()", file, lineNumber, funcName))

			// Ignore trace logs beyond the following conditions
			for _, name := range matchingFuncNames {
				if funcName == name {
					return trace
				}
			}
		}
		traceLevel++

        SmbTreeConnectionTrace trace = Mockito.spy(new SmbTreeConnectionTrace(ctx));
        doReturn(true).when(trace).isConnected();
        trace.acquire(); // usageCount becomes 1

        // Act & Assert: checkRelease should call isConnected() and not throw
        assertDoesNotThrow(trace::checkRelease);
        verify(trace, atLeastOnce()).isConnected();
    }

    @Test

 *   <li>Supports both internal session operations and client-provided trace information</li>
 * </ul>
 *
 * <p>For internal session operations, the trace typically contains {@code *Request} objects
 * that represent the current processing state. Client code can also create traces with
 * application-specific data to provide context when invoking session methods.</p>
 *
 * <p>This trace information is particularly useful for:</p>
 * <ul>

		return nil
	}

	traceLength := len(entry.Trace.Source)
	trace := make([]string, traceLength)

	// Add a sequence number and formatting for each stack trace
	// No formatting is required for the first entry
	for i, element := range entry.Trace.Source {
		trace[i] = fmt.Sprintf("%8v: %s", traceLength-i, element)
	}

	tagString := ""
	for key, value := range entry.Trace.Variables {
		if value != "" {
			if tagString != "" {