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

⟦6a0594eaa⟧ Ada Source

    Length: 5120 (0x1400)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Verbs_Dictionary, seg_042183

Derivation

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

with Binary_Trees_Pkg, Bounded_String, Text_Io;
use Bounded_String;

package body Verbs_Dictionary is

    Lower : constant Integer := -1;
    Equal : constant Integer := 0;
    Upper : constant Integer := 1;

    Current_Verb : Verb;

-- ----------------------------------------------------
-- Definition des fonctions pour le paquetage generique
-- ----------------------------------------------------

    function Compare (A, B : Verb) return Integer is
    begin
        if Image (A.Name) < Image (B.Name) then
            return Lower;
        else
            if Image (A.Name) = Image (B.Name) then
                return Equal;
            else
                return Upper;
            end if;
        end if;
    end Compare;


    procedure Write (Scr : Verb) is
    begin
        Text_Io.Put_Line ("Name -> " & Image (Scr.Name) &
                          " / Source ->" & Image (Scr.Source));
    end Write;


    procedure Show is new Verbs_Tree.Visit (Write);


-- -------------------------------------------
-- Definition des fontions de Verbs_Dictionary
-- -------------------------------------------


    procedure Create (Dict : in out Object) is
    begin
        Dict.Root := Verbs_Tree.Create;
    end Create;


    procedure Destroy (Dict : in out Object) is
    begin
        Verbs_Tree.Destroy (Dict.Root);
    end Destroy;


    procedure Add_New (New_Verb : String; Dict : Object) is
        Tmp_Verb : Verb;
    begin
        Bounded_String.Free (Tmp_Verb.Name);
        Bounded_String.Free (Tmp_Verb.Source);
        Bounded_String.Copy (Tmp_Verb.Name, New_Verb);
        Bounded_String.Copy (Tmp_Verb.Source, New_Verb);

        Current_Verb := Tmp_Verb;

        Verbs_Tree.Insert (Tmp_Verb, Dict.Root);

    exception
        when Verbs_Tree.Duplicate_Value =>
            raise Duplicate_Value;
    end Add_New;


    procedure Add_Synonym (New_Syn : String; Dict : Object) is
        Tmp_Verb : Verb;
    begin
        Bounded_String.Free (Tmp_Verb.Name);
        Bounded_String.Copy (Tmp_Verb.Name, New_Syn);

        Tmp_Verb.Source := Current_Verb.Source;

        Verbs_Tree.Insert (Tmp_Verb, Dict.Root);

    exception
        when Verbs_Tree.Duplicate_Value =>
            raise Duplicate_Value;
    end Add_Synonym;


    function Exist (Scan_Verb : String; Dict : Object) return Boolean is
        Tmp_Verb : Verb;
    begin
        Bounded_String.Free (Tmp_Verb.Name);
        Bounded_String.Free (Tmp_Verb.Source);
        Bounded_String.Copy (Tmp_Verb.Name, Scan_Verb);
        return Verbs_Tree.Is_Found (Tmp_Verb, Dict.Root);
    end Exist;

    function Synonym_From (Scan_Syn : String; Dict : Object) return String is
        Tmp_Verb : Verb;
        Iter : Verbs_Tree.Iterator;
    begin
        Iter := Verbs_Tree.Make_Iter (Dict.Root);
        while Verbs_Tree.More (Iter) loop
            Verbs_Tree.Next (Iter, Tmp_Verb);
            exit when Image (Tmp_Verb.Name) = Scan_Syn;
        end loop;
        return Image (Tmp_Verb.Source);
    end Synonym_From;

    procedure Dump (Dict : Object) is
    begin
        Show (Dict.Root, Verbs_Tree.Inorder);
    end Dump;


end Verbs_Dictionary;

    nblk1=4
    nid=0
    hdr6=8
        [0x00] rec0=26 rec1=00 rec2=01 rec3=024
        [0x01] rec0=26 rec1=00 rec2=02 rec3=044
        [0x02] rec0=1f rec1=00 rec2=03 rec3=00c
        [0x03] rec0=0d rec1=00 rec2=04 rec3=000
    tail 0x21742e05a86295a5bcedf 0x42a00088462060003