do not print directly to print writer but use a bufferedwriter and an intermediate string builder

Author: danieldietsch

trunk/source/Library-Automata/src/de/uni_freiburg/informatik/ultimate/automata/GeneralAutomatonPrinter.java

@@ -26,13 +26,17 @@
  */
 package de.uni_freiburg.informatik.ultimate.automata;
 
+import java.io.BufferedWriter;
+import java.io.IOException;
 import java.io.PrintWriter;
 import java.util.Collection;
 import java.util.Map;
 
+import de.uni_freiburg.informatik.ultimate.util.CoreUtil;
+
 /**
  * Abstract superclass for automaton printers.
- * 
+ *
  * @author Christian Schilling ([email protected])
  */
 @SuppressWarnings("squid:S1694")
@@ -41,33 +45,50 @@ public abstract class GeneralAutomatonPrinter {
 	public static final String NEW_LINE = System.lineSeparator();
 
 	private final PrintWriter mPrintWriter;
+	private StringBuilder mStringBuilder;
 
 	/**
 	 * @param printWriter
 	 *            Print writer to write to.
 	 */
 	protected GeneralAutomatonPrinter(final PrintWriter printWriter) {
 		mPrintWriter = printWriter;
+		mStringBuilder = new StringBuilder();
+	}
+
+	protected void finish() {
+		final BufferedWriter bw = new BufferedWriter(mPrintWriter);
+		try {
+			bw.write(mStringBuilder.toString());
+			bw.flush();
+			mStringBuilder = new StringBuilder();
+		} catch (final IOException e) {
+			throw new RuntimeException(e);
+		}
 	}
 
 	protected final void println(final String string) {
-		mPrintWriter.println(string);
+		mStringBuilder.append(string).append(CoreUtil.getPlatformLineSeparator());
 	}
 
 	protected final void println(final char character) {
-		mPrintWriter.println(character);
+		mStringBuilder.append(character).append(CoreUtil.getPlatformLineSeparator());
 	}
 
 	protected final void print(final String string) {
-		mPrintWriter.print(string);
+		mStringBuilder.append(string);
+	}
+
+	protected final void printElement(final String elem) {
+		mStringBuilder.append(elem).append(' ');
 	}
 
 	protected final void print(final char character) {
-		mPrintWriter.print(character);
+		mStringBuilder.append(character);
 	}
 
 	protected final void print(final StringBuilder builder) {
-		mPrintWriter.print(builder);
+		mStringBuilder.append(builder);
 	}
 
 	protected final void printAutomatonPrefix() {
@@ -100,10 +121,6 @@ protected final void printlnCollectionPrefix(final String string) {
 		println(getCollectionPrefix(string));
 	}
 
-	protected final void printElement(final String elem) {
-		mPrintWriter.print(elem + ' ');
-	}
-
 	private static String replaceBackslashes(final Object input) {
 		return input.toString().replaceAll("\"", "\\\"");
 	}
@@ -131,11 +148,11 @@ protected final void printOneTransitionSuffix() {
 	protected final void printTransitionsSuffix() {
 		print("\t}");
 	}
-	
+
 	protected final void printTransitionListSeparator() {
 		println(",");
 	}
-	
+
 	protected final void printLastTransitionLineSeparator() {
 		println("");
 	}

trunk/source/Library-Automata/src/de/uni_freiburg/informatik/ultimate/automata/alternating/visualization/AlternatingAutomatonWriter.java

@@ -34,7 +34,7 @@
 
 /**
  * Constructor takes a AlternatingAutomaton and writes it to a testfile.
- * 
+ *
  * @author Alexander Nutz ([email protected])
  * @author Christian Schilling ([email protected])
  * @param <LETTER>
@@ -69,6 +69,7 @@ public AlternatingAutomatonWriter(final PrintWriter writer, final String name,
 		// printFinalStates(mAa.getFinalStates());
 		// printInternalTransitions(mAa.getTransitionsMap());
 		printAutomatonSuffix();
+		finish();
 	}
 
 	/*
@@ -78,25 +79,25 @@ public AlternatingAutomatonWriter(final PrintWriter writer, final String name,
 	 * private void printExistentialStates(Set<STATE> set) { mprintWriter.print(TAB + "existentialStates = { "); for
 	 * (STATE state : set) { mprintWriter.print(state + ' '); } mprintWriter.print("},\n"); }
 	 *
-	 * private void printUniversalStates(Set<STATE> set) { mprintWriter.print(TAB + "universalStates = { "); for
-	 * (STATE state : set) { mprintWriter.print(state + ' '); } mprintWriter.print("},\n"); }
+	 * private void printUniversalStates(Set<STATE> set) { mprintWriter.print(TAB + "universalStates = { "); for (STATE
+	 * state : set) { mprintWriter.print(state + ' '); } mprintWriter.print("},\n"); }
 	 *
 	 * private void printInitialStates(Set<STATE> set) { mprintWriter.print(TAB + "initialStates = { "); for (STATE
 	 * state : set) { mprintWriter.print(state + ' '); } mprintWriter.print("},\n"); }
 	 *
-	 * private void printFinalStates(Set<STATE> set) { mprintWriter.print(TAB + "finalStates = { "); for (STATE
-	 * state : set) { mprintWriter.print(state + ' '); } mprintWriter.print("},\n"); }
+	 * private void printFinalStates(Set<STATE> set) { mprintWriter.print(TAB + "finalStates = { "); for (STATE state :
+	 * set) { mprintWriter.print(state + ' '); } mprintWriter.print("},\n"); }
 	 *
 	 * private void printInternalTransitions(Map<STATE, Map<LETTER, Set<STATE>>> map) { mprintWriter.println(TAB +
 	 * "internalTransitions = {"); for (Entry<STATE, Map<LETTER, Set<STATE>>> entry : map.entrySet()) { STATE pre =
-	 * entry.getKey(); Map<LETTER, Set<STATE>> transitionsMap = entry.getValue(); if (transitionsMap != null) {//
-	 * state has no outgoing transitions, so nothing has to be printed for (Entry<LETTER, Set<STATE>> entry1 :
+	 * entry.getKey(); Map<LETTER, Set<STATE>> transitionsMap = entry.getValue(); if (transitionsMap != null) {// state
+	 * has no outgoing transitions, so nothing has to be printed for (Entry<LETTER, Set<STATE>> entry1 :
 	 * transitionsMap.entrySet()) { LETTER letter = entry1.getKey(); Set<STATE> succStates = entry1.getValue(); for
 	 * (STATE succ : succStates) { printInternalTransition(pre, letter, succ); } } }
 	 *
 	 * } mprintWriter.println("\t},"); }
 	 *
-	 * private void printInternalTransition(STATE pre, LETTER letter, STATE succ) { mprintWriter.println("\t\t (" +
-	 * pre + ' ' + letter + ' ' + succ + ')' ); }
+	 * private void printInternalTransition(STATE pre, LETTER letter, STATE succ) { mprintWriter.println("\t\t (" + pre
+	 * + ' ' + letter + ' ' + succ + ')' ); }
 	 */
 }

trunk/source/Library-Automata/src/de/uni_freiburg/informatik/ultimate/automata/nestedword/visualization/BaFormatWriter.java

@@ -36,7 +36,7 @@
 
 /**
  * <tt>BA</tt> format writer.
- * 
+ *
  * @author Matthias Heizmann ([email protected])
  * @author Christian Schilling ([email protected])
  * @param <LETTER>
@@ -57,6 +57,7 @@ public final class BaFormatWriter<LETTER, STATE> extends CommonExternalFormatWri
 	public BaFormatWriter(final PrintWriter writer, final INestedWordAutomaton<LETTER, STATE> nwa) {
 		super(writer, nwa);
 		doPrint();
+		finish();
 	}
 
 	private void doPrint() {

trunk/source/Library-Automata/src/de/uni_freiburg/informatik/ultimate/automata/nestedword/visualization/CommonExternalFormatWriter.java

@@ -40,7 +40,7 @@
 
 /**
  * Common methods for writers of external formats.
- * 
+ *
  * @author Matthias Heizmann ([email protected])
  * @author Christian Schilling ([email protected])
  * @param <LETTER>
@@ -64,14 +64,15 @@ public CommonExternalFormatWriter(final PrintWriter writer, final INestedWordAut
 		mAlphabetMapping = getAlphabetMapping(nwa.getVpAlphabet().getInternalAlphabet());
 		mStateMapping = getStateMapping(nwa.getStates());
 		mNwa = nwa;
+		finish();
 	}
 
 	private Map<LETTER, String> getAlphabetMapping(final Collection<LETTER> alphabet) {
 		int counter = 0;
 		final Map<LETTER, String> alphabetMapping = new LinkedHashMap<>();
-		
-		ArrayList<LETTER> alphabetList=new ArrayList<LETTER>(alphabet);
-		
+
+		final ArrayList<LETTER> alphabetList = new ArrayList<>(alphabet);
+
 		Collections.sort(alphabetList, new sortLetter<LETTER>());
 		for (final LETTER letter : alphabetList) {
 			alphabetMapping.put(letter, Integer.toString(counter));

trunk/source/Library-Automata/src/de/uni_freiburg/informatik/ultimate/automata/nestedword/visualization/GoalFormatWriter.java

@@ -34,7 +34,7 @@
 
 /**
  * <tt>GOAL</tt> format writer.
- * 
+ *
  * @author Matthias Heizmann ([email protected])
  * @author Christian Schilling ([email protected])
  * @param <LETTER>
@@ -62,6 +62,7 @@ public GoalFormatWriter(final PrintWriter writer, final INestedWordAutomaton<LET
 		mLetterConverter = new MapBasedConverter<>(mAlphabetMapping);
 		mStateConverter = new MapBasedConverter<>(mStateMapping);
 		doPrint();
+		finish();
 	}
 
 	private void doPrint() {

trunk/source/Library-Automata/src/de/uni_freiburg/informatik/ultimate/automata/nestedword/visualization/HanoiFormatWriter.java

@@ -34,7 +34,7 @@
 
 /**
  * {@code Hanoi} format writer.
- * 
+ *
  * @author Matthias Heizmann ([email protected])
  * @author Christian Schilling ([email protected])
  * @param <LETTER>
@@ -60,6 +60,7 @@ public HanoiFormatWriter(final PrintWriter writer, final INestedWordAutomaton<LE
 		super(writer, nwa);
 		mLetterConverter = USE_LABELS ? new ToStringConverter<>() : new MapBasedConverter<>(mAlphabetMapping);
 		doPrint();
+		finish();
 	}
 
 	private void doPrint() {

trunk/source/Library-Automata/src/de/uni_freiburg/informatik/ultimate/automata/nestedword/visualization/NwaWriter.java

@@ -40,7 +40,7 @@
 
 /**
  * Prints an {@link INestedWordAutomaton}.
- * 
+ *
  * @author Matthias Heizmann ([email protected])
  * @author Christian Schilling ([email protected])
  * @param <LETTER>
@@ -123,6 +123,7 @@ public NwaWriter(final PrintWriter writer, final String name, final INestedWordA
 				printAutomatonSuffix();
 			}
 		}
+		finish();
 	}
 
 	/**
@@ -254,7 +255,7 @@ private void printReturnTransitions(final Collection<STATE> allStates) {
 		}
 		printTransitionsSuffix();
 	}
-	
+
 	private void printEpsilonTransitions(final Collection<STATE> allStates) {
 		printlnCollectionPrefix("epsilonTransitions");
 		for (final STATE state : allStates) {

trunk/source/Library-Automata/src/de/uni_freiburg/informatik/ultimate/automata/petrinet/visualization/NetWriter.java

@@ -38,7 +38,7 @@
 
 /**
  * Prints a {@link PetriNetJulian}.
- * 
+ *
  * @author Matthias Heizmann ([email protected])
  * @author Christian Schilling ([email protected])
  * @param <LETTER>
@@ -73,6 +73,7 @@ public NetWriter(final PrintWriter writer, final String name, final PetriNetJuli
 		printInitialMarking(net.getInitialMarking());
 		printAcceptingPlaces(net.getAcceptingPlaces());
 		printAutomatonSuffix();
+		finish();
 	}
 
 	protected abstract Map<LETTER, String> getAlphabetMapping(final Collection<LETTER> alphabet);

trunk/source/Library-Automata/src/de/uni_freiburg/informatik/ultimate/automata/tree/visualization/TreeAutomatonWriter.java

@@ -87,6 +87,7 @@ protected TreeAutomatonWriter(final PrintWriter writer, final String name,
 		printFinalStates(mTreeAutomaton.getFinalStates(), stateMapping);
 		printTransitionTable(mTreeAutomaton.getRules(), alphabetMapping, stateMapping);
 		printAutomatonSuffix();
+		finish();
 	}
 
 	private void printTransitionTable(final Iterable<TreeAutomatonRule<LETTER, STATE>> rules,
@@ -195,25 +196,25 @@ protected Map<STATE, String> getStateMapping(final Collection<STATE> states) {
 	 * private void printExistentialStates(Set<STATE> set) { mprintWriter.print(TAB + "existentialStates = { "); for
 	 * (STATE state : set) { mprintWriter.print(state + ' '); } mprintWriter.print("},\n"); }
 	 *
-	 * private void printUniversalStates(Set<STATE> set) { mprintWriter.print(TAB + "universalStates = { "); for
-	 * (STATE state : set) { mprintWriter.print(state + ' '); } mprintWriter.print("},\n"); }
+	 * private void printUniversalStates(Set<STATE> set) { mprintWriter.print(TAB + "universalStates = { "); for (STATE
+	 * state : set) { mprintWriter.print(state + ' '); } mprintWriter.print("},\n"); }
 	 *
 	 * private void printInitialStates(Set<STATE> set) { mprintWriter.print(TAB + "initialStates = { "); for (STATE
 	 * state : set) { mprintWriter.print(state + ' '); } mprintWriter.print("},\n"); }
 	 *
-	 * private void printFinalStates(Set<STATE> set) { mprintWriter.print(TAB + "finalStates = { "); for (STATE
-	 * state : set) { mprintWriter.print(state + ' '); } mprintWriter.print("},\n"); }
+	 * private void printFinalStates(Set<STATE> set) { mprintWriter.print(TAB + "finalStates = { "); for (STATE state :
+	 * set) { mprintWriter.print(state + ' '); } mprintWriter.print("},\n"); }
 	 *
 	 * private void printInternalTransitions(Map<STATE, Map<LETTER, Set<STATE>>> map) { mprintWriter.println(TAB +
 	 * "internalTransitions = {"); for (Entry<STATE, Map<LETTER, Set<STATE>>> entry : map.entrySet()) { STATE pre =
-	 * entry.getKey(); Map<LETTER, Set<STATE>> transitionsMap = entry.getValue(); if (transitionsMap != null) {//
-	 * state has no outgoing transitions, so nothing has to be printed for (Entry<LETTER, Set<STATE>> entry1 :
+	 * entry.getKey(); Map<LETTER, Set<STATE>> transitionsMap = entry.getValue(); if (transitionsMap != null) {// state
+	 * has no outgoing transitions, so nothing has to be printed for (Entry<LETTER, Set<STATE>> entry1 :
 	 * transitionsMap.entrySet()) { LETTER letter = entry1.getKey(); Set<STATE> succStates = entry1.getValue(); for
 	 * (STATE succ : succStates) { printInternalTransition(pre, letter, succ); } } }
 	 *
 	 * } mprintWriter.println("\t},"); }
 	 *
-	 * private void printInternalTransition(STATE pre, LETTER letter, STATE succ) { mprintWriter.println("\t\t (" +
-	 * pre + ' ' + letter + ' ' + succ + ')' ); }
+	 * private void printInternalTransition(STATE pre, LETTER letter, STATE succ) { mprintWriter.println("\t\t (" + pre
+	 * + ' ' + letter + ' ' + succ + ')' ); }
 	 */
 }