Need help outputting to a text file...

[Adam Ellsworth]

I have a binary search tree and need to output it before it clears to create the next one. I can output strings in the main but can't figure out how to put anything dealing with the tree to the outputted text file. Here's my code, please help, hehe. Thanks

Code:

 import java.io.*;
import java.util.*;
 

 
public class LatinSort {
 

   static class TreeNode {
           
      String line;      // The data in this node.
      TreeNode left;    // Pointer to left subtree.
      TreeNode right;   // Pointer to right subtree.
      TreeNode(String str) {
             // Constructor.  Make a node containing the specified string.
         line = str;
      }
   }  // end nested class TreeNode
 
   
   static TreeNode root;  // Pointer to the root node in a binary tree.
   
 

   public static void main(String[] args) throws IOException{
   String filename = "Latin.txt", latin, english;
    BufferedReader fin = new BufferedReader(new FileReader(filename));
    FileWriter file = new FileWriter("Output.txt"); 
    PrintWriter out = new PrintWriter(file);
    BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
    String Oline;
    System.out.println("This program will read from a file called 'Latin.txt' containing a");
    System.out.println("Latin-English word list and write to a file named 'output.txt' with the");
    System.out.println("computed data in alphabetical order.\n");
    System.out.println("To change the results of this program, open 'Latin.txt' and add what you want.");
    System.out.println("Directions: ");
    System.out.println("1) Unit names are preceded by a percentage symbol.");
    System.out.println("2) There is only one entry per line.");
    System.out.println("3) A Latin word is seperated by a colon from its English quivalent(s);");
    System.out.println("   if there is more than one equivalent, they are seperated by a comma.");

String line = fin.readLine().trim().toLowerCase();
    out.println("This sucks");
    while (line != null) {
    line = line.toLowerCase();
int ind = line.indexOf("%");
if(ind != -1){
clear();
out.println(line);
}
if(line.length()!=0){
StringTokenizer stok = new StringTokenizer(line,":,");
latin = stok.nextToken();
while(stok.hasMoreTokens()){
english = stok.nextToken();
if (english.length() == 0){
             break;
            }
             english.trim();
       if (treeContains(root,english)) {        
                   english = english + ", " + latin;
            System.out.println("\nThat item is already in the tree.");
            }
            
 
        else {
        english = english + " : " + latin;
            treeInsert(english.trim());
                treeList(root);
 
             
}
}
        }
      line = fin.readLine();
      }  // end while
      
System.out.println("\n\nExiting program.");
    fin.close();
    out.close();
   }  // end main()
   
   
   static void treeInsert(String english) {
 
      if ( root == null ) {
             // The tree is empty.  Set root to point to a new node containing
             // the new item.  This becomes the only node in the tree.
         root = new TreeNode( english );
         return;
      }
      TreeNode runner;  // Runs down the tree to find a place for newItem.
      runner = root;   // Start at the root.
      while (true) {
         if ( english.compareTo(runner.line) < 0 ) {
 
            if ( runner.left == null ) {
               runner.left = new TreeNode( english );
               
               return;  // New item has been added to the tree.
            }
            else
               runner = runner.left;
               
         }
         else {
            if ( runner.right == null ) {
               runner.right = new TreeNode( english );
               return;  // New item has been added to the tree.
            }
            else
               runner = runner.right;
          }
          
      } // end while
   }  // end treeInsert()
   
   
   static boolean treeContains( TreeNode root, String english) {
          // Return true if item is one of the items in the binary
          // sort tree to which root points.   Return false if not.   
      if ( root == null ) {
            // Tree is empty, so it certainly doesn't contain item.
         return false;
      }
      else if ( english.equals(root.line)) {
            // Yes, the item has been found in the root node.
         return true;
      }
      else if ( english.compareTo(root.line) < 0 ) {
            // If the item occurs, it must be in the left subtree.
         return treeContains( root.left, english);
      }
      else {
            // If the item occurs, it must be in the right subtree.
         return treeContains( root.right, english);
      }
   }  // end treeContains()
   
 
   static String treeList(TreeNode node) throws IOException{
       FileWriter file = new FileWriter("Output.txt"); 
    PrintWriter out = new PrintWriter(file);
    String Oline;
   if ( node != null ) {
          treeList(node.left);          // Print items in left subtree.
//System.out.println("  " + node.line);  // Print item in the node.
Oline = node.line;
          treeList(node.right); // Print items in the right subtree.
      }
      return Oline;
     
   } // end treeList()
   
   
public static void clear(){
root=null;
}

 
} // end class LatinSort 

[Adam Ellsworth]

Sorry, don't use that code, the output is hard to follow. This is a little better...

 import java.io.*;
import java.util.*;
 

 
public class LatinSort {
 

   static class TreeNode {
           
      String line;      // The data in this node.
      TreeNode left;    // Pointer to left subtree.
      TreeNode right;   // Pointer to right subtree.
      TreeNode(String str) {
             // Constructor.  Make a node containing the specified string.
         line = str;
      }
   }  // end nested class TreeNode
 
   
   static TreeNode root;  // Pointer to the root node in a binary tree.
   
 

   public static void main(String[] args) throws IOException{
   String filename = "Latin.txt", latin, english;
    BufferedReader fin = new BufferedReader(new FileReader(filename));
    FileWriter file = new FileWriter("Output.txt"); 
    PrintWriter out = new PrintWriter(file);
    BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
    System.out.println("This program will read from a file called 'Latin.txt' containing a");
    System.out.println("Latin-English word list and write to a file named 'output.txt' with the");
    System.out.println("computed data in alphabetical order.\n");
    System.out.println("To change the results of this program, open 'Latin.txt' and add what you want.");
    System.out.println("Directions: ");
    System.out.println("1) Unit names are preceded by a percentage symbol.");
    System.out.println("2) There is only one entry per line.");
    System.out.println("3) A Latin word is seperated by a colon from its English quivalent(s);");
    System.out.println("   if there is more than one equivalent, they are seperated by a comma.");

String line = fin.readLine().trim().toLowerCase();
    out.println("This sucks");
    while (line != null) {
    line = line.toLowerCase();
int ind = line.indexOf("%");
if(ind != -1){
clear();
out.println(line);
}
if(line.length()!=0){
StringTokenizer stok = new StringTokenizer(line,":,");
latin = stok.nextToken();
while(stok.hasMoreTokens()){
english = stok.nextToken();
if (english.length() == 0){
             break;
            }
             english.trim();
       if (treeContains(root,english)) {        
                   english = english + ", " + latin;
            System.out.println("\nThat item is already in the tree.");
            }
            
 
        else {
        english = english + " : " + latin;
            treeInsert(english.trim());
            System.out.println("\nCurrent tree contains:");
                treeList(root);
 
             
}
}
        }
      line = fin.readLine();
      }  // end while
      
System.out.println("\n\nExiting program.");
    fin.close();
    out.close();
   }  // end main()
   
   
   static void treeInsert(String english) {
 
      if ( root == null ) {
             // The tree is empty.  Set root to point to a new node containing
             // the new item.  This becomes the only node in the tree.
         root = new TreeNode( english );
         return;
      }
      TreeNode runner;  // Runs down the tree to find a place for newItem.
      runner = root;   // Start at the root.
      while (true) {
         if ( english.compareTo(runner.line) < 0 ) {
 
            if ( runner.left == null ) {
               runner.left = new TreeNode( english );
               
               return;  // New item has been added to the tree.
            }
            else
               runner = runner.left;
               
         }
         else {
            if ( runner.right == null ) {
               runner.right = new TreeNode( english );
               return;  // New item has been added to the tree.
            }
            else
               runner = runner.right;
          }
          
      } // end while
   }  // end treeInsert()
   
   
   static boolean treeContains( TreeNode root, String english) {
          // Return true if item is one of the items in the binary
          // sort tree to which root points.   Return false if not.   
      if ( root == null ) {
            // Tree is empty, so it certainly doesn't contain item.
         return false;
      }
      else if ( english.equals(root.line)) {
            // Yes, the item has been found in the root node.
         return true;
      }
      else if ( english.compareTo(root.line) < 0 ) {
            // If the item occurs, it must be in the left subtree.
         return treeContains( root.left, english);
      }
      else {
            // If the item occurs, it must be in the right subtree.
         return treeContains( root.right, english);
      }
   }  // end treeContains()
   
 
   static void treeList(TreeNode node) throws IOException{
       FileWriter file = new FileWriter("Output.txt"); 
    PrintWriter out = new PrintWriter(file);
    //String Oline;
   if ( node != null ) {
          treeList(node.left);          // Print items in left subtree.
//out.println("This is the output " + node.line);  // Print item in the node.
System.out.println(" " + node.line);//Oline = node.line;
          treeList(node.right);
          // Print items in the right subtree.
      }
//      return Oline;
     
   } // end treeList()
   
   
public static void clear(){
root=null;
}

 
} // end class LatinSort 

[Jimmy Die]

Hi,



I'm a little unclear about some of the specifics of your data, and what sort of fuctionality's your accomplishing, however I created a file "Latin.txt" with the following entries:

%casa:home
%uno ne
%dose:two

Then with this method below I create similiar output to what you have in "Latin.txt". The current positioning of your output to the console will not be the same as your output written to file "Output.txt" until you adjust the logic. There are other ways of accomplishing writing to files, such as using channels. Anyhow this is one way of accomplishing this, but I would personally utilize the channels from java.nio ... I'm sure there are tutuorials out there to review...

P.S. I was never prompted for input from your variable 'stdin' (no stdin.readLine()) which leads me to believe that your program is still being refined...

Good luck!

static void treeList(TreeNode node) throws IOException{
File aFile = new File("c:\\Output.txt");
 
FileOutputStream outputFile = null;
try {
outputFile = new FileOutputStream(aFile, true);
} catch(FileNotFoundException e) {
e.printStackTrace();
}
//outputFile.write(node.getBytes());
    
//FileWriter file = new FileWriter("Output.txt");     
//PrintWriter out = new PrintWriter(file);    //String Oline;   
if ( node != null ) {          
treeList(node.left);          // Print items in left subtree.
//out.println("This is the output " + node.line);  
// Print item in the node.
System.out.println(" " + node.line);
outputFile.write(node.line.getBytes());
//Oline = node.line;          
treeList(node.right);          // Print items in the right subtree.      
}
//return Oline;        
} // end treeList()      
 

  

[Adam Ellsworth]

Thanks for your help Jimmy Your suggestion unfortunately didn't work either. Sorry for the very vague question and sloppy code. I was in a hurry and didn't have too much time to do anything I ended up appending the text file and it kind of worked. It would output to the console perfectly, but the output to the text file was all screwy, but at least it outputted something The program was turned in today and I can post the results on how to make it work if anyone cares to see, hehe. Thanks again, Adam