linked hash map keeping the last n entries (for test runs)

PhilippSalvisberg · PhilippSalvisberg · commit 9c40705b9d53 · 2019-06-10T02:01:02.000+02:00
diff --git a/sqldev/src/main/java/org/utplsql/sqldev/model/LimitedLinkedHashMap.xtend b/sqldev/src/main/java/org/utplsql/sqldev/model/LimitedLinkedHashMap.xtend
@@ -0,0 +1,33 @@
+/*
+ * Copyright 2019 Philipp Salvisberg <philipp.salvisberg@trivadis.com>
+ * 
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ * 
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ * 
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+package org.utplsql.sqldev.model
+
+import java.util.LinkedHashMap
+import java.util.Map
+
+class LimitedLinkedHashMap<K, V> extends LinkedHashMap<K, V> {
+	val int maxEntries
+	
+	new (int maxEntries) {
+		super(maxEntries + 1, 1.0f, false)
+		
+		this.maxEntries = maxEntries;
+	}
+	
+	override removeEldestEntry(Map.Entry<K, V> eldest) {
+		return size > maxEntries
+	}
+}
