Re: Computer Language Shootout

[mheaney@on2.com (Matthew Heaney)]

Craig Carey <research@ijs.co.nz> wrote in message news:<n54tgvgugor0ag2qsv97t9mf9sn9rr542i@4ax.com>...
> The Ada 95 entries have appeared that the new
>  "Computer Language Shootout" website:
> 
>    http://dada.perl.it/shootout/gnat.html

I just cobbled together the "hash table (associative array)" example
using the hashed set in Charles.  Here it is:

 
procedure Test_Hash is

   Map : String_Integer_Maps.Container_Type;

   N : Natural := 0;
   
   Last : Natural;

begin

   if Ada.Command_Line.Argument_Count > 0 then
      Get (Ada.Command_Line.Argument (1), N, Last);
   end if;      

   Resize (Map, N);
   
   for I in Integer range 1 .. N loop
      Insert (Map, To_Key (I, Base => 16), I);
   end loop;
   
   declare
      I : Iterator_Type := First (Map);
      J : constant Iterator_Type := Back (Map);
   begin
      while I /= J loop
         Put (Key (I));
         Put (":");
         Put (Element (I), Width => 0);
         New_Line;
         I := Succ (I);
      end loop;
      
      New_Line;
   end;
   
   Put ("map.length=");
   Put (Length (Map), Width => 0);
   New_Line;
   
   declare
      Count : Integer'Base := 0;
   begin      
      for I in reverse Integer range 1 .. N loop
         if Find (Map, To_Key (I, Base => 10)) then
            Count := Count + 1;
         end if;
      end loop;
      
      Put ("map.count=");
      Put (Count, Width => 0);
      New_Line;
   end;

end Test_Hash;

The latest release (20030710) of Charles has better hash table
support.  There are also containers for storing elements whose type is
limited.

http://home.earthlink.net/~matthewjheaney/charles/index.html

I must say, nothing beats having a predefined container library. 
Problems that would otherwise take hours to solve now take just
minutes.

-Matt