Re: Optimizing Ada

[Egil H H <ehh.public@gmail.com>]

On Wednesday, October 2, 2013 4:58:40 AM UTC+2, kennet...@gmail.com wrote:
> 
<snip>
>  The only real snags I've hit with Ada is trouble with finding documentation on the standard library.
> 

The Standard Library is defined in Annex A of the reference manual,
http://www.adaic.org/resources/add_content/standards/12rm/html/RM-A.html

Specifically, see section A.18.4 for a description of Maps:
http://www.adaic.org/resources/add_content/standards/12rm/html/RM-A-18-4.html

> 
> Ada Code : http://pastebin.com/vDbdXCYD (a quotation mark messed up highlighting near bottom)
> 


You could try to preallocate space in the Word_Map by calling
Word_Map.Reserve_Capacity(some_fairly_large_number);

Also, you're calling Update_Element even for new words. Depending on your dataset, that could potentially be a lot of unneccessary callbacks. Try this:

Word_Map.Insert(Key      => Word,
                New_Item => 1,      -- <----
                Position => Location,
                Inserted => Added);
if not Added then
   Word_Map.Update_Element(Position => Location,
                           Process   => Increment_By_One'Access);
end if;



Rust probably have a faster hash function (seems they use SipHash 2-4). Try to implement the same algorithm in Ada, see if that makes a difference.