Appendable secretlyAWriter = new StringWriter();
    result = CharStreams.asWriter(secretlyAWriter);
    assertSame(secretlyAWriter, result);
  }

  // CharStreams.copy has type specific optimizations for Readers,StringBuilders and Writers

  public void testCopy() throws IOException {
    StringBuilder builder = new StringBuilder();
    long copied =
        CharStreams.copy(

    Appendable secretlyAWriter = new StringWriter();
    result = CharStreams.asWriter(secretlyAWriter);
    assertSame(secretlyAWriter, result);
  }

  // CharStreams.copy has type specific optimizations for Readers,StringBuilders and Writers

  public void testCopy() throws IOException {
    StringBuilder builder = new StringBuilder();
    long copied =
        CharStreams.copy(

- **Template Method** - Resource traversal utilities with customizable handlers
- **Utility Classes** - All core functionality exposed through static utility methods for easy access

### Performance Optimizations
- **Caching** - Bean descriptors and reflection metadata are cached for improved performance
- **Lazy initialization** - Resources and expensive operations are initialized only when needed  

        assertTrue("Boundary value tests should be fast", true);
    }

    public void test_performance_optimization() {
        // Verify that performance optimizations are working
        long startTime = System.currentTimeMillis();
        try {
            dataIndexHelper.crawl("performance-test");
        } catch (Exception e) {
            // Expected
        }

       * doesn't need access to the futures again, so we can just pass `null`.
       *
       * TODO(b/112550045): Allocating a single, cheaper listener is (I think) only an optimization.
       * If we make some other optimizations, this one will no longer be necessary. The optimization
       * could actually hurt in some cases, as it forces us to keep all inputs in memory until the
       * final input completes.
       */
      @RetainedLocalRef

        } catch (InterruptedException e) {
            logExecutor.shutdownNow();
            Thread.currentThread().interrupt();
        }
    }

    /**
     * Log a security event with performance optimizations
     *
     * @param type event type
     * @param severity event severity
     * @param message event message
     * @param context additional context
     */

        double totalTimeMs = (end - start) / 1_000_000.0;

        System.out.printf("Overall Performance Test: completed in %.2f ms%n", totalTimeMs);

        // Should complete very quickly with all optimizations
        assertTrue(totalTimeMs < 100, "All operations should complete quickly with performance fixes");

        pool.close();
    }

    return getBooleanProperty(DIRECTORY_NOTIFICATIONS_ENABLED, true);
}

public int getMaxDirectoryCacheEntries() {
    return getIntProperty(MAX_DIRECTORY_CACHE_ENTRIES, 1000);
}
```

## 7. Performance Optimizations

### 7.1 Batch Directory Operations
```java
public class BatchDirectoryOperations {
    private final DirectoryLeaseManager leaseManager;
    
    public List<SmbFile> batchExists(List<String> paths) {

   * be updated after modifications to {@code graph}.
   *
   * @since 33.1.0 (present with return type {@code Graph} since 20.0)
   */
  // TODO(b/31438252): Consider potential optimizations for this algorithm.
  public static <N> ImmutableGraph<N> transitiveClosure(Graph<N> graph) {
    ImmutableGraph.Builder<N> transitiveClosure =
        GraphBuilder.from(graph).allowsSelfLoops(true).<N>immutable();

   * be updated after modifications to {@code graph}.
   *
   * @since 33.1.0 (present with return type {@code Graph} since 20.0)
   */
  // TODO(b/31438252): Consider potential optimizations for this algorithm.
  public static <N> ImmutableGraph<N> transitiveClosure(Graph<N> graph) {
    ImmutableGraph.Builder<N> transitiveClosure =
        GraphBuilder.from(graph).allowsSelfLoops(true).<N>immutable();