DataMuseum.dk Presents historical artifacts from the history of: Rational R1000/400

This is an automatic "excavation" of a thematic subset of artifacts from Datamuseum.dk's BitArchive. See our Wiki for more about Rational R1000/400 Excavated with: AutoArchaeologist - Free & Open Source Software.

top - download

⟦99514943d⟧ Ada Source

    Length: 7168 (0x1c00)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, generic, package Unbounded_String, seg_01b4d7

Derivation

└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
    └─ ⟦cfc2e13cd⟧ »Space Info Vol 2« 
        └─⟦this⟧ 

generic
    Default_Maximum_Length : Natural := 20;
package Unbounded_String is

    -------------------------------------------------------------------------------
    --  Managed Pointer Sequential Unbounded Strings:
    --  Restrictions and assumptions
    -- Storage management performed
    -- All new allocations for extensions are twice requirements
    -- CANNOT be used by multiple tasks unless user guarantees sequential use
    -- := is reference copy, use copy to assign contents
    --    uninitialized or Free'd objects are true null's and changes to one
    --    of the referents will not be reflected in the other;
    --    use Free prior to assignment to prevent garbage
    -- = is object identity, use string_utilities for comparison
    --
    -------------------------------------------------------------------------------


    subtype String_Length is Natural;
    type Variable_String is private;

    -- release storage associated with a string
    procedure Free (V : in out Variable_String);

    -- Get information about current length or contents of a string
    function Length (Source : Variable_String) return String_Length;
    function Char_At (Source : Variable_String; At_Pos : Positive)
                     return Character;

    function Extract (Source : Variable_String;
                      Start_Pos : Positive;
                      End_Pos : Natural) return String;

    function Image (V : Variable_String) return String;
    function Value (S : String) return Variable_String;

    -- Image (Target) := Image (Source);
    procedure Copy (Target : in out Variable_String; Source : Variable_String);
    procedure Copy (Target : in out Variable_String; Source : String);
    procedure Copy (Target : in out Variable_String; Source : Character);

    -- Target := Source; Source := ""; with appropriate storage management
    procedure Move (Target : in out Variable_String;
                    Source : in out Variable_String);

    -- Target := Target & Source;
    procedure Append (Target : in out Variable_String;
                      Source : Variable_String);

    procedure Append (Target : in out Variable_String; Source : String);

    procedure Append (Target : in out Variable_String; Source : Character);

    procedure Append (Target : in out Variable_String;
                      Source : Character;
                      Count : String_Length);

    -- Target := Target (1..At_Pos-1) & Source & Target (At_Pos..Target'Length)
    procedure Insert (Target : in out Variable_String;
                      At_Pos : Positive;
                      Source : Variable_String);

    procedure Insert (Target : in out Variable_String;
                      At_Pos : Positive;
                      Source : String);

    procedure Insert (Target : in out Variable_String;
                      At_Pos : Positive;
                      Source : Character);

    procedure Insert (Target : in out Variable_String;
                      At_Pos : Positive;
                      Source : Character;
                      Count : String_Length);

    -- Target (At_Pos .. At_Pos + Count -1) := "";
    procedure Delete (Target : in out Variable_String;
                      At_Pos : Positive;
                      Count : String_Length := 1);

    -- Target (At_Pos .. At_Pos + Source'Length - 1) := Source;
    procedure Replace (Target : in out Variable_String;
                       At_Pos : Positive;
                       Source : Character);

    procedure Replace (Target : in out Variable_String;
                       At_Pos : Positive;
                       Source : Character;
                       Count : String_Length);

    procedure Replace (Target : in out Variable_String;
                       At_Pos : Positive;
                       Source : String);

    procedure Replace (Target : in out Variable_String;
                       At_Pos : Positive;
                       Source : Variable_String);

    -- Target'Length := New_Length;
    -- Target (Target'Length .. New_Length) := Fill_With;
    procedure Set_Length (Target : in out Variable_String;
                          New_Length : String_Length;
                          Fill_With : Character := ' ');


    -- Determine if a Variable_String is null; different from = ""
    function Is_Nil (V : Variable_String) return Boolean;

    -- Return a null Variable_String.  Note that assignment of Nil may
    -- create garbage; see procedure Free above.
    function Nil return Variable_String;

private
    type Pointer is access String;

    type Real_String;
    type Variable_String is access Real_String;
    subtype String_Bound is Integer range -1 .. Integer'Last;

    type Real_String is
        record
            Length : String_Bound;
            Contents : Pointer;
            Next_Free : Variable_String;
        end record;

    Null_String : Pointer := new String (1 .. 0);

    Free_List_Item : constant String_Bound := -1;

    Free_List : Real_String := Real_String'(Free_List_Item,  
                                            Null_String,  
                                            new Real_String'(Free_List_Item,  
                                                             Null_String,  
                                                             null));
end Unbounded_String;

    nblk1=6
    nid=0
    hdr6=c
        [0x00] rec0=18 rec1=00 rec2=01 rec3=05c
        [0x01] rec0=16 rec1=00 rec2=02 rec3=028
        [0x02] rec0=19 rec1=00 rec2=03 rec3=04e
        [0x03] rec0=1a rec1=00 rec2=04 rec3=050
        [0x04] rec0=1d rec1=00 rec2=05 rec3=01a
        [0x05] rec0=0d rec1=00 rec2=06 rec3=000
    tail 0x21718b97e83638710b86f 0x42a00088462060003