Re: Invade wikipedia!

[Georg Bauhaus <rm.dash-bauhaus@futureapps.de>]

Adam Beneschan schrieb:
> On Feb 26, 9:44 am, Georg Bauhaus <rm.dash-bauh...@futureapps.de>
> wrote:
>> Ivan Levashew schrieb:
>>
>>>    Integer_Text_IO.Put (8);
>> Integer should not be used in the first place,
>> and neither in examples ... (What do you mean by
>> Huh? :-)
> 
> Hmmm... This thread started out with a request that we increase the
> visibility of Ada by providing examples for some Wikipedia algorithms
> written in Ada.  What better way to get people interested in the
> language than by making it seem that you have to define your own
> numeric types before you can write any code?  :) :( :-|

Adding the declarations of suitable number types in an example
algorithm maybe doesn't seem to hurt that much. Taking
http://en.wikipedia.org/wiki/Insertion_sort  as an example,
I tried

   type Mug is (Metal, Plastic, Thermo, Porcelain);
   type Mug_Number is range 1 .. 10;
   type Mug_List is array(Mug_Number) of Mug;

   procedure Insertion_Sort(A: in out Mug_List) is
      j: Mug_Number'Base;
      value: Mug;
   begin
      for i in A'First + 1 .. A'Last loop
           value := A(i);
           j := i-1;
           while j >= A'First and then A(j) > value loop
                A(j+1) := A(j);
                j := j-1;
           end loop;
           A(j+1) := value;
      end loop;
   end Insertion_Sort;

No big changes due to going from Pseudo-Pascal to real Ada,
I think, other than having to explain 'Base.
The "and then" of the shifting loop actually clarifies that
short circuit control is required.

If the Wikipedia example authors could agree on an example
problem space (like Mugs in this case), then even the three
declaractions before Insertion_Sort could be left out.
Instead, a simple with will do, or as custom seems to permit,
visibility of the problem space declarations is always assumed.