Re: Efficient Matrix?

["James S. Rogers" <jimmaureenrogers@worldnet.att.net>]

Testing the following program on the free Aonix Object Ada (7.2.2)
I get the expected results:

with Ada.Text_Io;
use Ada.Text_Io;

procedure Bla is

   type Unconstrained_Type is array (Positive range <>, Positive range <>)
of Boolean;
   pragma Pack (Unconstrained_Type);

   subtype Constrained_Type is Unconstrained_Type (1 .. 10000, 1 .. 5000);
   type Constrained_Type_Ptr is access Constrained_Type;
   function Component_Bits (Item : constrained_Type) return Integer is
   begin
      return Item'Component_Size;
   end Component_Bits;


   A : Constrained_Type_Ptr := new Constrained_Type;

begin
   Put_Line (Integer'Image (Constrained_Type'Component_Size));
   Put_Line (Integer'Image (Unconstrained_Type'Component_Size));
   Put_Line(Integer'Image(A(1,1)'Size));
   Put_Line(Integer'Image(Component_Bits(A.all)));
   Put_Line (Integer'Image (Constrained_Type'Size));
   Put_Line (Integer'Image (A.All'Size));
end Bla;

Results:

1
1
1
1
50000
50000

Jim Rogers