Table of pointers question

[Rob Solomon <usenet@drrob1-noreply.com>]

I am working my way thru Ada As A Second Language by Norman Cohen (c)
1996

This confuses me.

It is a simple sorting routine that swaps pointers rather than the
data.  Note that the variables are more like Modula-2 syntax as I am
very comfortable with that.  And it is easier to type.

with Ada.Text_IO, Ada.Strings.Bounded; use Ada.Text_IO;
procedure PrintDirectory is
  maxLineLength : constant := 80;
  maxEntries    : constant := 1000;
  
  package InputLines is new Ada.Strings.Bounded.Generic_Bounded_Length
(MaxLineLength);
  
  use InputLines;
  
  type DirectoryEntryType is
    record
      NamePart, StreetPart, CityPart: Bounded_String;
    end record;
  
  type DirectoryEntryPointerType is access DirectoryEntryType;
  
  NewEntry        : DirectoryEntryPointerType;
  Buffer          : String (1..MaxLineLength);
  Length          : Integer range 0..MaxLineLength;
  OutOfPlaceEntry : DirectoryEntryPointerType;
  NumberOfEntries : Integer range 0..MaxEntries := 0;
  No_Exchanges    : Boolean;
  
  EntryList        : array (1..MaxEntries) of DirectoryEntryType;
  EntryPointerList : array (1..MaxEntries) of
DirectoryEntryPointerType;
  
begin
  -- read data into entry list
  WHILE NOT End_Of_File LOOP
    Get_Line(Buffer, length);
    NewEntry.NamePart := To_Bounded_String(Buffer(1..Length));
    Get_Line(Buffer, Length);
    NewEntry.StreetPart := To_Bounded_String(Buffer(1..Length));
    Get_Line(Buffer, Length);
    NewEntry.CityPart := To_Bounded_String(Buffer(1..Length));
    NumberOfEntries := NumberOfEntries + 1;
    EntryPointerList(NumberOfEntries) := new
DirectoryEntryType'(NewEntry);  -- MY QUESTION HERE
  END LOOP;
  
  -- sort entryList using bubble sort
  
  LOOP
    No_Exchanges := True;
    FOR I in 1 .. NumberOfEntries - 1 LOOP
      IF EntryPointerList(I).NamePart > EntryPointerList(I+1).NamePart
THEN
        OutOfPlaceEntry := EntryPointerList(I+1);
        EntryPointerList(I+1) := EntryPointerList(I);
        EntryPointerList(I) := OutOfPlaceEntry;
        No_Exchanges := False;
      END IF:
    END LOOP;
    EXIT WHEN No_Exchanges;
  END LOOP;
  
  -- write sorted data
  FOR I in 1 .. NumberOfEntries LOOP
    Put_Line(To_String(EntryPointerList(I).NamePart));
    Put_Line(To_String(EntryPointerList(I).StreetPart));
    Put_Line(To_String(EntryPointerList(I).CityPart));
  END LOOP;


My question is that I would expect to have an array that contains the
data, and a second array that is an array of pointers to the 1st
array.  The example does not define that.

How does the line:
EntryPointerList(NumberOfEntries) := new DirectoryEntryType'(NewEntry)
;

Do what's needed?

Thanks