Re: Counting words in text file (Mirek Fidler -- : was Java - c++, IO)

Well, I am really disappointed with C++ people and especially VC+++. I
fixed a minor bug in version three and it's now two time faster :)

Here is what I have now

3 meg file
Time: 625 ms (My version 1) (3 meg)
Time: 187 ms (My version 3 with the fix) (3 meg)

40 meg file (and java -server)
Time: 5297 ms (my version 1)
Time: 1265 ms (my version 3 with the fix)

What about C++ with standard library and VC++?

Time: 531 ms (3 meg)
Time: 5546 ms (for 40 meg)

Am I to believe that C++ with standard library is 4 TIMES SLOWER?

C++ IS FOUR TIMES SLOWER THAN JAVA WITH standard library?

This is really disappointing. I had high hopes.

The version 3 with bug fix is here
---------------

Also, posted here http://www.pastebin.ca/964045

//counts the words in a text file...
//combined effort: wlfshmn from #java on IRC Undernet
//and RAZII
import java.io.*;
import java.util.*;
import java.nio.*;
import java.nio.channels.*;
public final class WordCount3
{
 private static final Map<String, int[]> dictionary =
         new HashMap<String, int[]>(16000);
 private static int tWords = 0;
 private static int tLines = 0;
 private static long tBytes = 0;
 
 public static void main(final String[] args) throws Exception
 {
  System.out.println("Lines\tWords\tBytes\tFile\n");
  
  //TIME STARTS HERE
  final long start = System.currentTimeMillis();
  for (String arg : args)
  {
   File file = new File(arg);
   if (!file.isFile())
   {
    continue;
   }
   
   int numLines = 0;
   int numWords = 0;
   long numBytes = file.length();

    ByteBuffer in = new FileInputStream(arg).getChannel().map(
        FileChannel.MapMode.READ_ONLY, 0, numBytes);
              
    StringBuilder sb = new StringBuilder();
    boolean inword = false;
    in.rewind();
    for (int i = 0; i < numBytes; i= i +2)
    {
       char c = (char) in.get();
       if (c == '\n')
            numLines++;
        else if (c >= 'a' && c <= 'z' || c >= 'A' && c <= 'Z')
        {
         sb.append(c);
         inword = true;
        }
        else if (inword)
        {
         numWords++;
         int[] count = dictionary.get(sb.toString());
         if (count != null)
         { count[0]++;}
         else
             {dictionary.put(sb.toString(), new int[]{1});}
             sb.delete(0, sb.length());
             inword = false;
        }
      
    }
      
  
   System.out.println( numLines + "\t" + numWords + "\t" + numBytes +
"\t" + arg);
   tLines += numLines;
   tWords += numWords;
   tBytes += numBytes;
  }
  
  //only converting it to TreepMap so the result
  //appear ordered, I could have
  //moved this part down to printing phase
  //(i.e. not include it in time).
  TreeMap<String, int[] > sort = new TreeMap<String, int[]>
(dictionary);
  
  //TIME ENDS HERE
  final long end = System.currentTimeMillis();
  
  System.out.println("---------------------------------------");
  if (args.length > 1)
  {
  System.out.println(tLines + "\t" + tWords + "\t" + tBytes +
"\tTotal");
   System.out.println("---------------------------------------");
  }
  for (Map.Entry<String, int[]> pairs : sort.entrySet())
  {
   System.out.println(pairs.getValue()[0] + "\t" + pairs.getKey());
  }
     System.out.println("Time: " + (end - start) + " ms");
 }
}