// Path: src/main/java/com/rolfje/anonimatron/synonyms/StringSynonym.java
// public class StringSynonym implements Synonym {
//     private String type;
//     private String from;
//     private String to;
//     private boolean shortlived = false;
// 
//     public StringSynonym() {
//     }
// 
//     public StringSynonym(String type, String from, String to, boolean shortlived) {
//         this.type = type;
//         this.from = from;
//         this.to = to;
//         this.shortlived = shortlived;
//     }
// 
//     @Override
//     public String getType() {
//         return type;
//     }
// 
//     @Override
//     public Object getFrom() {
//         return from;
//     }
// 
//     @Override
//     public Object getTo() {
//         return to;
//     }
// 
//     public void setType(String type) {
//         this.type = type;
//     }
// 
//     public void setFrom(String from) {
//         this.from = from;
//     }
// 
//     public void setTo(String to) {
//         this.to = to;
//     }
// 
//     public void setShortlived(boolean shortlived) {
//         this.shortlived = shortlived;
//     }
// 
//     @Override
//     public boolean isShortLived() {
//         return shortlived;
//     }
// 
//     @Override
//     public boolean equals(Object obj) {
//         return (obj != null) && (this.getClass() == obj.getClass()) && (this.hashCode() == obj.hashCode());
//     }
// 
//     @Override
//     public int hashCode() {
//         return from.hashCode() + to.hashCode() + type.hashCode();
//     }
// }
// 
// Path: src/main/java/com/rolfje/anonimatron/synonyms/Synonym.java
// public interface Synonym {
// 
// 	/**
// 	 * Indicates if this Synonym is short-lived or transient, meaning that
//      * it should not be stored in the synonyms file. Transient Synonyms
//      * are not stored, need to be calculated each run time.
// 	 *
// 	 * Transient synonyms are:
// 	 *
// 	 * <ol>
// 	 *     <li>Not stored in memory.</li>
// 	 *     <li>Not stored in the synonym file.</li>
// 	 * </ol>
// 	 *
// 	 * @return <code>true</code> if the synonym should be thrown away
// 	 * after use (not stored in the synonym file).
// 	 */
// 	boolean isShortLived();
// 
// 	/**
// 	 * @return The semantic data type of this Synonym, usually something
// 	 *         descriptive as "NAME" or "STREET".
// 	 */
// 	String getType();
// 
// 	/**
// 	 * @return The data which was in the original database for this Synonym
// 	 */
// 	Object getFrom();
// 
// 	/**
// 	 * 
// 	 * @return The data with which the original data in the database will be or
// 	 *         is replaced when the Anonymizer runs.
// 	 */
// 	Object getTo();
// }


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Set;
import com.rolfje.anonimatron.synonyms.StringSynonym;
import com.rolfje.anonimatron.synonyms.Synonym;
									+ "but there is none. You should add one, or remove requirements that cannot be fulfilled.. the part used, was : \""
									+ mid.get(b[i])
									+ "\", which "
									+ "means there should be a suffix available, that has \"-c\" requirement or no requirements for previous syllables at all.");
			}
			if (vocalLast(pureSyl(mid.get(b[i]))))
				last = 1;
			else
				last = 2;
		}

		int c;
		do {
			c = (int) (Math.random() * sur.size());
		} while (expecting == 1 && !vocalFirst(pureSyl(sur.get(c)))
				|| expecting == 2
				&& !consonantFirst(pureSyl(sur.get(c))) || last == 1
				&& hatesPreviousVocals(sur.get(c)) || last == 2
				&& hatesPreviousConsonants(sur.get(c)));

		name = upper(pureSyl(pre.get(a).toLowerCase()));
		for (int i = 0; i < b.length - 2; i++) {
			name = name.concat(pureSyl(mid.get(b[i]).toLowerCase()));
		}
		if (syls > 1)
			name = name.concat(pureSyl(sur.get(c).toLowerCase()));
		return name;
	}

	@Override
// Path: src/main/java/com/rolfje/anonimatron/synonyms/StringSynonym.java
// public class StringSynonym implements Synonym {
//     private String type;
//     private String from;
//     private String to;
//     private boolean shortlived = false;
// 
//     public StringSynonym() {
//     }
// 
//     public StringSynonym(String type, String from, String to, boolean shortlived) {
//         this.type = type;
//         this.from = from;
//         this.to = to;
//         this.shortlived = shortlived;
//     }
// 
//     @Override
//     public String getType() {
//         return type;
//     }
// 
//     @Override
//     public Object getFrom() {
//         return from;
//     }
// 
//     @Override
//     public Object getTo() {
//         return to;
//     }
// 
//     public void setType(String type) {
//         this.type = type;
//     }
// 
//     public void setFrom(String from) {
//         this.from = from;
//     }
// 
//     public void setTo(String to) {
//         this.to = to;
//     }
// 
//     public void setShortlived(boolean shortlived) {
//         this.shortlived = shortlived;
//     }
// 
//     @Override
//     public boolean isShortLived() {
//         return shortlived;
//     }
// 
//     @Override
//     public boolean equals(Object obj) {
//         return (obj != null) && (this.getClass() == obj.getClass()) && (this.hashCode() == obj.hashCode());
//     }
// 
//     @Override
//     public int hashCode() {
//         return from.hashCode() + to.hashCode() + type.hashCode();
//     }
// }
// 
// Path: src/main/java/com/rolfje/anonimatron/synonyms/Synonym.java
// public interface Synonym {
// 
// 	/**
// 	 * Indicates if this Synonym is short-lived or transient, meaning that
//      * it should not be stored in the synonyms file. Transient Synonyms
//      * are not stored, need to be calculated each run time.
// 	 *
// 	 * Transient synonyms are:
// 	 *
// 	 * <ol>
// 	 *     <li>Not stored in memory.</li>
// 	 *     <li>Not stored in the synonym file.</li>
// 	 * </ol>
// 	 *
// 	 * @return <code>true</code> if the synonym should be thrown away
// 	 * after use (not stored in the synonym file).
// 	 */
// 	boolean isShortLived();
// 
// 	/**
// 	 * @return The semantic data type of this Synonym, usually something
// 	 *         descriptive as "NAME" or "STREET".
// 	 */
// 	String getType();
// 
// 	/**
// 	 * @return The data which was in the original database for this Synonym
// 	 */
// 	Object getFrom();
// 
// 	/**
// 	 * 
// 	 * @return The data with which the original data in the database will be or
// 	 *         is replaced when the Anonymizer runs.
// 	 */
// 	Object getTo();
// }


// Path: src/main/java/com/rolfje/anonimatron/anonymizer/AbstractNameGenerator.java
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Set;
import com.rolfje.anonimatron.synonyms.StringSynonym;
import com.rolfje.anonimatron.synonyms.Synonym;

									+ "but there is none. You should add one, or remove requirements that cannot be fulfilled.. the part used, was : \""
									+ mid.get(b[i])
									+ "\", which "
									+ "means there should be a suffix available, that has \"-c\" requirement or no requirements for previous syllables at all.");
			}
			if (vocalLast(pureSyl(mid.get(b[i]))))
				last = 1;
			else
				last = 2;
		}

		int c;
		do {
			c = (int) (Math.random() * sur.size());
		} while (expecting == 1 && !vocalFirst(pureSyl(sur.get(c)))
				|| expecting == 2
				&& !consonantFirst(pureSyl(sur.get(c))) || last == 1
				&& hatesPreviousVocals(sur.get(c)) || last == 2
				&& hatesPreviousConsonants(sur.get(c)));

		name = upper(pureSyl(pre.get(a).toLowerCase()));
		for (int i = 0; i < b.length - 2; i++) {
			name = name.concat(pureSyl(mid.get(b[i]).toLowerCase()));
		}
		if (syls > 1)
			name = name.concat(pureSyl(sur.get(c).toLowerCase()));
		return name;
	}

	@Override
	public Synonym anonymize(Object from, int size, boolean shortlived) {