fix Console

Author: lecousin

net.lecousin.core/src/main/java/net/lecousin/framework/concurrent/Console.java

@@ -15,22 +15,22 @@
 public class Console implements Closeable {
 
 	/** Print the given line. */
-	public synchronized void out(String line) {
+	public void out(String line) {
 		add(line, out);
 	}
 
 	/** Print the given error. */
-	public synchronized void out(Throwable t) {
+	public void out(Throwable t) {
 		add(t, out);
 	}
 
 	/** Print the given line. */
-	public synchronized void err(String line) {
+	public void err(String line) {
 		add(line, err);
 	}
 
 	/** Print the given error. */
-	public synchronized void err(Throwable t) {
+	public void err(Throwable t) {
 		add(t, err);
 	}
 
@@ -45,7 +45,7 @@ private void add(Object o, PrintStream s) {
 		if (nb > 5000) {
 			// pause the thread to let time to logging
 			try {
-				Thread.sleep(nb > 10000 ? 400 : nb > 7500 ? 200 : 100);
+				Thread.sleep(nb > 10000 ? 200 : nb > 7500 ? 100 : 25);
 			} catch (InterruptedException e) {
 				// ignore
 			}

net.lecousin.core/src/main/java/net/lecousin/framework/log/LoggerThread.java

@@ -66,7 +66,7 @@ void log(Appender appender, Log log) {
 		if (s > 5000) {
 			// pause the thread to let time to logging
 			try {
-				Thread.sleep(s > 10000 ? 400 : s > 7500 ? 200 : 100);
+				Thread.sleep(s > 10000 ? 250 : s > 7500 ? 100 : 50);
 			} catch (InterruptedException e) {
 				// ignore
 			}

net.lecousin.core/src/main/java/net/lecousin/framework/memory/ArrayCache.java

@@ -5,6 +5,7 @@
 import java.util.LinkedList;
 import java.util.List;
 
+import net.lecousin.framework.application.LCCore;
 import net.lecousin.framework.collections.TurnArray;
 import net.lecousin.framework.collections.sort.RedBlackTreeInteger;
 import net.lecousin.framework.collections.sort.RedBlackTreeInteger.Node;
@@ -72,8 +73,10 @@ private static class ArraysBySize<T> {
 
 	private RedBlackTreeInteger<ArraysBySize<T>> arraysBySize = new RedBlackTreeInteger<>();
 	private int totalSize = 0;
+	private boolean debug;
 
 	protected ArrayCache() {
+		debug = LCCore.getApplication().isDebugMode();
 		MemoryManager.register(this);
 	}
 
@@ -131,6 +134,8 @@ public void free(T array) {
 				return;
 			}
 			ArraysBySize<T> arrays = node.getElement();
+			if (debug && arrays.arrays.contains(array))
+				throw new IllegalStateException("Array already in cache!");
 			arrays.lastCachedTime = System.currentTimeMillis();
 			if (arrays.arrays.isFull()) return;
 			totalSize += len;

net.lecousin.core/src/main/java/net/lecousin/framework/util/HierarchyProvider.java

@@ -4,6 +4,7 @@
 import java.util.function.Consumer;
 
 import net.lecousin.framework.concurrent.async.AsyncSupplier;
+import net.lecousin.framework.concurrent.threads.Task.Priority;
 
 /**
  * Generic interface to navigate in a hierarchy.
@@ -49,10 +50,10 @@ public static interface Asynchronous<ElementType> {
 		boolean mayHaveChildren(ElementType element);
 
 		/** Return true if the given element has children. */
-		AsyncSupplier<Boolean,Exception> hasChildren(ElementType element, boolean refresh, byte priority);
+		AsyncSupplier<Boolean,Exception> hasChildren(ElementType element, boolean refresh, Priority priority);
 
 		/** Return the children of the given element. */
-		AsyncSupplier<List<? extends ElementType>,Exception> getChildren(ElementType element, boolean refresh, byte priority);
+		AsyncSupplier<List<? extends ElementType>,Exception> getChildren(ElementType element, boolean refresh, Priority priority);
 	}
 
 }