Refactor anonymous classes to lambda expressions for improved readability

Modernize Java code by replacing verbose anonymous class implementations with concise lambda expressions:
- InOutWorker: Simplify queue wait condition
- Train: Convert multiple Condition implementations to lambdas
- Array2DMap: Replace PointComparator with lambda expression and use diamond operator

Also remove redundant test in DoubletonTest that provided no meaningful verification.

🤖 Generated with [Claude Code](https://claude.com/claude-code)

Co-Authored-By: Claude Sonnet 4.5 <noreply@anthropic.com>

Author: bedaHovorka

src/main/java/cz/vutbr/fit/interlockSim/sim/InOutWorker.java

@@ -108,11 +108,7 @@ protected void iteration() {
 
 			//cekej na odchod vlaku z fronty (bez te anonymni tridy please)
 			logger.debug("InOutWorker {} waiting for train {} to leave queue", inOut.getName(), first);
-			waitUntil(new Condition() {
-				public boolean test() {
-					return first != queqe.first();
-				}
-			});
+			waitUntil(() -> first != queqe.first());
 			logger.debug("InOutWorker {} train left queue", inOut.getName());
 		}
 		myIdle = true;

src/main/java/cz/vutbr/fit/interlockSim/sim/Train.java

@@ -76,11 +76,7 @@ private abstract class Site extends Process { //lepsi nazev?
 		private TrackSection current = null;
 		private boolean onNext = false;
 
-		final Condition terminated = new Condition() {
-			public boolean test() {
-				return terminated();
-			}
-		};
+		final Condition terminated = this::terminated;
 
 		@Override
 		protected final void actions() {
@@ -100,11 +96,9 @@ protected final void actions() {
 
 				onNext = true;
 				assert position.isActive() && pv.isActive();
-				waitUntil(new Condition() {
-					public boolean test() {
-						//dtmin - horni odhad zmeny pri poslednim kroku numericke metody behem dobrzdovani k uzlu
-						return position.state + dtMin >= nextLength;
-					}
+				waitUntil(() -> {
+					//dtmin - horni odhad zmeny pri poslednim kroku numericke metody behem dobrzdovani k uzlu
+					return position.state + dtMin >= nextLength;
 				});
 
 				position.state -= nextLength;
@@ -237,11 +231,9 @@ private void semaphoreAction(final RailSemaphore semaphore, final PathSeparator
 //		}
 
 		private Condition allowingSignal(final RailSemaphore semaphore) {
-			return new Condition() {
-				public boolean test() {
-					final boolean allowing = semaphore.getSignal().isAllowing();
-					return allowing;
-				}
+			return () -> {
+				final boolean allowing = semaphore.getSignal().isAllowing();
+				return allowing;
 			};
 		}
 
@@ -539,11 +531,7 @@ protected void actions() {//spusten odsouhlasenim
 
 		activate(front);
 
-		waitUntil(new Condition() {
-			public boolean test() {
-				return front.getTotalDistance() >= getLength();
-			}
-		});
+		waitUntil(() -> front.getTotalDistance() >= getLength());
 		activate(tail);
 
 		out(); activate((Train) worker.getQueqe().first());

src/main/java/cz/vutbr/fit/interlockSim/util/Array2DMap.java

@@ -150,19 +150,16 @@ public int size() {
 
 	}
 
-	private static final class PointComparator implements Comparator<Point> {
-		public int compare(Point o1, Point o2) {
-			int dy = (o1.y-o2.y);
-			return dy==0 ? (o1.x-o2.x) : dy;
-		}
-	}
 	/**
 	 * Compare points in order for grid
 	 */
-	public static final Comparator<Point> POINT_COMPARATOR = new PointComparator();
+	public static final Comparator<Point> POINT_COMPARATOR = (o1, o2) -> {
+		int dy = (o1.y-o2.y);
+		return dy==0 ? (o1.x-o2.x) : dy;
+	};
 
 	private final RelocableList<RelocableList<V>> array = new RelocableList<RelocableList<V>> ();
-	private final TreeSet<Point> keys = new TreeSet<Point>(POINT_COMPARATOR);
+	private final TreeSet<Point> keys = new TreeSet<>(POINT_COMPARATOR);
 
 	/* (non-Javadoc)
 	 * @see java.util.AbstractMap#entrySet()
@@ -224,7 +221,7 @@ public boolean containsKey(Object key) {
 	public List<V> getRow(int y) {
 		final RelocableList<V> list = array.get(y);
 		//EXTENSION zatim unmodifieable
-		return list==null ? Collections.<V>emptyList() : Collections.unmodifiableList(list);
+		return list==null ? Collections.emptyList() : Collections.unmodifiableList(list);
 	}
 
 	@Override

src/test/java/cz/vutbr/fit/interlockSim/util/DoubletonTest.java

@@ -234,19 +234,6 @@ void hashCode_reversedElements_sameHashCode() {
 				.isEqualTo(d2.hashCode());
 		}
 
-		@Test
-		void hashCode_differentElements_mayDiffer() {
-			Doubleton<String, Integer> d1 = new Doubleton<>("A", "B");
-			Doubleton<String, Integer> d2 = new Doubleton<>("C", "D");
-
-			// Not guaranteed to differ, but likely
-			// Just verifying it doesn't crash and returns valid hash codes
-			int h1 = d1.hashCode();
-			int h2 = d2.hashCode();
-			// Primitive ints are never null, so we just verify the method executes without error
-			// The fact that we got here means hashCode() didn't throw an exception
-		}
-
 		@Test
 		void equals_sameElements_equal() {
 			Doubleton<String, Integer> d1 = new Doubleton<>("A", "B");