From c941f9bb085e769fa55a05dd3b75b99904b46fac Mon Sep 17 00:00:00 2001
From: schaudge <yuanshenran@yeah.net>
Date: Wed, 16 Oct 2024 09:58:42 +0800
Subject: [PATCH] pretty code format

---
 .../org/broadinstitute/hellbender/utils/haplotype/EventMap.java | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/main/java/org/broadinstitute/hellbender/utils/haplotype/EventMap.java b/src/main/java/org/broadinstitute/hellbender/utils/haplotype/EventMap.java
index 82d27f539a8..7a399ac2633 100644
--- a/src/main/java/org/broadinstitute/hellbender/utils/haplotype/EventMap.java
+++ b/src/main/java/org/broadinstitute/hellbender/utils/haplotype/EventMap.java
@@ -286,7 +286,7 @@ public static TreeSet<Integer> getEventStartPositions(final Collection<Haplotype
      * Returns any events in the map that overlap loc, including spanning deletions and events that start at loc.
      */
     public List<Event> getOverlappingEvents(final int loc) {
-        final List<Event> overlappingEvents = headMap(loc, true).values().stream().filter(v -> (v.getStart() >= loc || v.isTrimmedEvent()) && v.getEnd() >= loc).collect(Collectors.toList());
+        final List<Event> overlappingEvents = headMap(loc, true).values().stream().filter(v -> (v.getStart() >= loc || v.isTrimmedEvent()) && v.getEnd() >= loc).toList();
         // if we're at the start of an insertion, exclude deletions that end here; otherwise keep everything
         final Predicate<Event> filter = overlappingEvents.stream().anyMatch(Event::isSimpleInsertion) ?
                 v -> !(v.isSimpleDeletion() && v.getEnd() == loc) : v -> true;