Re: Counting words continues (Mirek Fidler.. continues)

From:

Razii <DONTwhatevere3e@hotmail.com>

Newsgroups:

comp.lang.c++,comp.lang.java.programmer

Date:

Sun, 06 Apr 2008 02:23:10 -0500

Message-ID:

<vbtgv31mlmru6f42hlem8ub8u5g219o355@4ax.com>

On Sat, 5 Apr 2008 21:54:50 -0700 (PDT), Mirek Fidler <cxl@ntllib.org>
wrote:

Well, it is my guts feeling again, but I am afraid that reconstructing
words back from your nice tree structure will not be as simple task as
you think. I might be wrong, but I think it can very well be much
longer for "single bible case" than parsing/mapping phase.

It took only 120 ms ( for bible.txt) to fill HashMap with words and
counts...

//time
final long start = System.currentTimeMillis();

HashMap<String, Integer > map = new HashMap<String, Integer>(1600);

dictionary.fillMap("", map);

//stop time.
final long end = System.currentTimeMillis();


  public final void fillMap (String s, Map<String, Integer> map)
  {
   for(char c = 'a';c <= 'z';++c)
   {
    int i = charToIndex(c);
    Dictionary t = myLinks[i];
    if (t != null)
    {
     if(t.count > 0) map.put(s+c, t.count);
     t.fillMap(s + c, map);
    }
   }
   for(char c = 'A';c <= 'Z';++c)
   {
    int i = charToIndex(c);
    Dictionary t = myLinks[i];
    if (t != null)
    {
     if(t.count > 0) map.put(s+c, t.count);
     t.fillMap(s + c, map);
    }
   }
  }