>460
// SortDemo.java
import java.io.*;
import java.util.*;
public class SortDemo {
private static final File FILE_INPUT = new File( "before.txt" );
private static final File FILE_OUTPUT = new File( "after.txt" );
private static TreeSet<Integer> numbers = new TreeSet<Integer>();
public static void main(String[] args) {
BufferedWriter bw = null;
try {
BufferedReader br = new BufferedReader( new FileReader(FILE_INPUT) );
String line;
while( (line=br.readLine()) != null ) numbers.add( Integer.parseInt( line ) );
System.out.println( FILE_INPUT.getName() + "を読み込みました。" );
bw = new BufferedWriter( new FileWriter(FILE_OUTPUT) );
Iterator<Integer> iterator = numbers.iterator();
while( iterator.hasNext() ) bw.write( iterator.next() + "\n" );
System.out.println( FILE_OUTPUT.getName() + "に書き込みました。" );
} catch( FileNotFoundException fnfe ) {
fnfe.printStackTrace();
} catch( IOException ioe ) {
ioe.printStackTrace();
} catch( NumberFormatException nfe ) {
nfe.printStackTrace();
} finally {
try {
if( bw != null ) bw.close();
} catch( IOException ioe ) {}
}
}
}