Subversion Repositories openrisc

-- CXA4007.A

--

--                             Grant of Unlimited Rights

--

--     Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,

--     F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained

--     unlimited rights in the software and documentation contained herein.

--     Unlimited rights are defined in DFAR 252.227-7013(a)(19).  By making

--     this public release, the Government intends to confer upon all

--     recipients unlimited rights  equal to those held by the Government.

--     These rights include rights to use, duplicate, release or disclose the

--     released technical data and computer software in whole or in part, in

--     any manner and for any purpose whatsoever, and to have or permit others

--     to do so.

--

--                                    DISCLAIMER

--

--     ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR

--     DISCLOSED ARE AS IS.  THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED

--     WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE

--     SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE

--     OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A

--     PARTICULAR PURPOSE OF SAID MATERIAL.

--*

--

-- OBJECTIVE:

--      Check that the subprograms defined in package Ada.Strings.Bounded are

--      available, and that they produce correct results. Specifically, check

--      the subprograms Append, Count, Element, Find_Token, Head,

--      Index_Non_Blank, Replace_Element, Replicate, Tail, To_Bounded_String,

--      "&", ">", "<", ">=", "<=", and "*".

--

-- TEST DESCRIPTION:

--      This test, when taken in conjunction with tests CXA400[6,8,9], will

--      constitute a test of all the functionality contained in package

--      Ada.Strings.Bounded.  This test uses a variety of the

--      subprograms defined in the bounded string package in ways typical

--      of common usage.  Different combinations of available subprograms

--      are used to accomplish similar bounded string processing goals.

--

--

-- CHANGE HISTORY:

--      06 Dec 94   SAIC    ACVC 2.0

--      22 Dec 94   SAIC    Changed obsolete constant to Ada.Strings.Space.

--

--!

with Ada.Strings;

with Ada.Strings.Bounded;

with Ada.Strings.Maps;

with Report;

procedure CXA4007 is

begin

   Report.Test ("CXA4007", "Check that the subprograms defined in package " &

                           "Ada.Strings.Bounded are available, and that "   &

                           "they produce correct results");

   Test_Block:

   declare

      package BS80 is new Ada.Strings.Bounded.Generic_Bounded_Length(80);

      use type BS80.Bounded_String;

      Part1 : constant String     := "Rum";

      Part2 : Character           := 'p';

      Part3 : BS80.Bounded_String := BS80.To_Bounded_String("el");

      Part4 : Character           := 's';

      Part5 : BS80.Bounded_String := BS80.To_Bounded_String("tilt");

      Part6 : String(1..3)        := "ski";

      Full_Catenate_String,

      Full_Append_String,

      Constructed_String,

      Drop_String,

      Replicated_String,

      Token_String         : BS80.Bounded_String;

      CharA : Character := 'A';

      CharB : Character := 'B';

      CharC : Character := 'C';

      CharD : Character := 'D';

      CharE : Character := 'E';

      CharF : Character := 'F';

      ABStr : String(1..15) := "AAAAABBBBBBBBBB";

      StrB  : String(1..2)  := "BB";

      StrE  : String(1..2)  := "EE";

   begin

      -- Evaluation of the overloaded forms of the "&" operator defined

      -- for instantiations of Bounded Strings.

      Full_Catenate_String :=

        BS80."&"(Part2,                            -- Char & Bnd Str

                 BS80."&"(Part3,                   -- Bnd Str & Bnd Str

                          BS80."&"(Part4,          -- Char & Bnd Str

                                   BS80."&"(Part5, -- Bnd Str & Bnd Str

                                           BS80.To_Bounded_String(Part6)))));

      Full_Catenate_String :=

        Part1 &  Full_Catenate_String;             -- Str & Bnd Str

      Full_Catenate_String :=

        Full_Catenate_String & 'n';                -- Bnd Str & Char

      -- Evaluation of the overloaded forms of function Append.

      Full_Append_String :=

        BS80.Append(Part2,                                      -- Char,Bnd

               BS80.Append(Part3,                               -- Bnd, Bnd

                      BS80.Append(Part4,                        -- Char,Bnd

                             BS80.Append(BS80.To_String(Part5), -- Str,Bnd

                                         BS80.To_Bounded_String(Part6)))));

      Full_Append_String :=

        BS80.Append(BS80.To_Bounded_String(Part1),            -- Bnd , Str

                    BS80.To_String(Full_Append_String));

      Full_Append_String :=

        BS80.Append(Left  => Full_Append_String,

                    Right => 'n');                            -- Bnd, Char

      -- Validate the resulting bounded strings.

      if Full_Catenate_String < Full_Append_String or

         Full_Catenate_String > Full_Append_String or

         not (Full_Catenate_String  = Full_Append_String and

              Full_Catenate_String <= Full_Append_String and

              Full_Catenate_String >= Full_Append_String)

      then

         Report.Failed("Incorrect results from bounded string catenation" &

                       " and comparison");

      end if;

      -- Evaluate the overloaded forms of the Constructor function "*" and

      -- the Replicate function.

      Constructed_String :=

        (2 * CharA) &                           -- "AA"

        (2 * StrB)  &                           -- "AABBBB"

        (3 * BS80."*"(2, CharC)) &              -- "AABBBBCCCCCC"

        BS80.Replicate(3,

                   BS80.Replicate(2, CharD)) &  -- "AABBBBCCCCCCDDDDDD"

        BS80.Replicate(2, StrE) &               -- "AABBBBCCCCCCDDDDDDEEEE"

        BS80.Replicate(2, CharF);               -- "AABBBBCCCCCCDDDDDDEEEEFF"

      -- Use of Function Replicate that involves dropping characters.  The

      -- attempt to replicate the 15 character string six times will exceed

      -- the 80 character bound of the string.  Therefore, the result should

      -- be the catenation of 5 copies of the 15 character string, followed

      -- by 5 'A' characters (the first five characters of the 6th

      -- replication) with the remaining characters of the 6th replication

      -- dropped.

      Drop_String :=

         BS80.Replicate(Count => 6,

                        Item  => ABStr,              -- "AAAAABBBBBBBBBB"

                        Drop  => Ada.Strings.Right);

      if BS80.Element(Drop_String, 1)  /= 'A' or

         BS80.Element(Drop_String, 6)  /= 'B' or

         BS80.Element(Drop_String, 76) /= 'A' or

         BS80.Element(Drop_String, 80) /= 'A'

      then

         Report.Failed("Incorrect result from Replicate with Drop");

      end if;

      -- Use function Index_Non_Blank in the evaluation of the

      -- Constructed_String.

      if BS80.Index_Non_Blank(Constructed_String, Ada.Strings.Forward)  /=

         BS80.To_String(Constructed_String)'First                         or

         BS80.Index_Non_Blank(Constructed_String, Ada.Strings.Backward) /=

         BS80.Length(Constructed_String)

      then

         Report.Failed("Incorrect results from constructor functions");

      end if;

      declare

         -- Define character set objects for use with the Count function.

         -- Constructed_String = "AABBBBCCCCCCDDDDDDEEEEFF" from above.

         A_Set : Ada.Strings.Maps.Character_Set :=

                 Ada.Strings.Maps.To_Set(BS80.Element(Constructed_String,1));

         B_Set : Ada.Strings.Maps.Character_Set :=

                 Ada.Strings.Maps.To_Set(BS80.Element(Constructed_String,3));

         C_Set : Ada.Strings.Maps.Character_Set :=

                 Ada.Strings.Maps.To_Set(BS80.Element(Constructed_String,7));

         D_Set : Ada.Strings.Maps.Character_Set :=

                 Ada.Strings.Maps.To_Set(BS80.Element(Constructed_String,13));

         E_Set : Ada.Strings.Maps.Character_Set :=

                 Ada.Strings.Maps.To_Set(BS80.Element(Constructed_String,19));

         F_Set : Ada.Strings.Maps.Character_Set :=

                 Ada.Strings.Maps.To_Set(BS80.Element(Constructed_String,23));

         Start : Positive;

         Stop  : Natural  := 0;

      begin

         -- Evaluate the results from function Count by comparing the number

         -- of A's to the number of F's, B's to E's, and C's to D's in the

         -- Constructed_String.

         -- There should be an equal number of each of the characters that

         -- are being compared (i.e., 2 A's and F's, 4 B's and E's, etc)

         if BS80.Count(Constructed_String, A_Set)      /=

            BS80.Count(Constructed_String, F_Set)        or

            BS80.Count(Constructed_String, B_Set)      /=

            BS80.Count(Constructed_String, E_Set)        or

            not (BS80.Count(Constructed_String, C_Set)  =

                 BS80.Count(Constructed_String, D_Set))

         then

            Report.Failed("Incorrect result from function Count");

         end if;

         -- Evaluate the functions Head, Tail, and Find_Token.

         -- Create the Token_String from the Constructed_String above.

         Token_String :=

           BS80.Tail(BS80.Head(Constructed_String,  3), 2) &     -- "AB" &

           BS80.Head(BS80.Tail(Constructed_String, 13), 2) &     -- "CD" &

           BS80.Head(BS80.Tail(Constructed_String,  3), 2);      -- "EF"

         if Token_String /= BS80.To_Bounded_String("ABCDEF") then

            Report.Failed("Incorrect result from Catenation of Token_String");

         end if;

         -- Find the starting/ending position of the first A in the

         -- Token_String (both should be 1, only one A appears in string).

         -- The Function Head uses the default pad character to return a

         -- bounded string longer than its input parameter bounded string.

         BS80.Find_Token(BS80.Head(Token_String, 10),  -- Default pad.

                         A_Set,

                         Ada.Strings.Inside,

                         Start,

                         Stop);

         if Start /= 1 and Stop /= 1 then

            Report.Failed("Incorrect result from Find_Token - 1");

         end if;

         -- Find the starting/ending position of the first non-AB slice in

         -- the "head" five characters of Token_String (slice CDE at

         -- positions 3-5)

         BS80.Find_Token(BS80.Head(Token_String, 5),            -- "ABCDE"

                         Ada.Strings.Maps."OR"(A_Set, B_Set),   -- Set (AB)

                         Ada.Strings.Outside,

                         Start,

                         Stop);

         if Start /= 3 and Stop /= 5 then

            Report.Failed("Incorrect result from Find_Token - 2");

         end if;

         -- Find the starting/ending position of the first CD slice in

         -- the "tail" eight characters (including two pad characters)

         -- of Token_String (slice CD at positions 5-6 of the tail

         -- portion specified)

         BS80.Find_Token(BS80.Tail(Token_String, 8,

                                   Ada.Strings.Space),         -- "  ABCDEF"

                         Ada.Strings.Maps."OR"(C_Set, D_Set),  -- Set (CD)

                         Ada.Strings.Inside,

                         Start,

                         Stop);

         if Start /= 5 and Stop /= 6 then

            Report.Failed("Incorrect result from Find_Token - 3");

         end if;

         -- Evaluate the Replace_Element procedure.

         -- Token_String = "ABCDEF"

         BS80.Replace_Element(Token_String, 3, BS80.Element(Token_String,4));

         -- Token_String = "ABDDEF"

         BS80.Replace_Element(Source => Token_String,

                              Index  => 2,

                              By     => BS80.Element(Token_String, 5));

         -- Token_String = "AEDDEF"

         BS80.Replace_Element(Token_String,

                              1,

                              BS80.Element(BS80.Tail(Token_String, 2), 2));

         -- Token_String = "FEDDEF"

         -- Evaluate this result.

         if BS80.Element(Token_String, BS80.To_String(Token_String)'First) /=

            BS80.Element(Token_String, BS80.To_String(Token_String)'Last)  or

            BS80.Count(Token_String, D_Set)                                /=

            BS80.Count(Token_String, E_Set)                                or

            BS80.Index_Non_Blank(BS80.Head(Token_String,6))                /=

            BS80.Index_Non_Blank(BS80.Tail(Token_String,6))                or

            BS80.Head(Token_String, 1)                                     /=

            BS80.Tail(Token_String, 1)

         then

            Report.Failed("Incorrect result from operations in combination");

         end if;

      end;

   exception

      when others => Report.Failed ("Exception raised in Test_Block");

   end Test_Block;

   Report.Result;

end CXA4007;