text
stringlengths 437
491k
| meta
dict |
|---|---|
with Agar.Core.Thin;
package Agar.Core.DSO is
subtype DSO_Access_t is Thin.DSO.DSO_Access_t;
subtype DSO_Not_Null_Access_t is Thin.DSO.DSO_Not_Null_Access_t;
function Load
(Name : in String;
Path : in String) return DSO_Access_t;
function Unload (DSO : DSO_Not_Null_Access_t) return Boolean;
function Lookup (Name : in String) return DSO_Access_t;
procedure Lock renames Thin.DSO.Lock;
procedure Unlock renames Thin.DSO.Unlock;
generic
type Subprogram_Access_Type is private;
function Generic_Symbol_Lookup
(DSO : in DSO_Not_Null_Access_t;
Name : in String) return Subprogram_Access_Type;
end Agar.Core.DSO;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-----------------------------------------------------------------------
with System;
with Ada.Finalization;
private with Interfaces.C.Strings;
-- == Secret Service API ==
-- The Secret Service API is a service developped for the Gnome keyring and the KDE KWallet.
-- It allows application to access and manage stored passwords and secrets in the two
-- desktop environments. The libsecret is the C library that gives access to the secret
-- service. The <tt>Secret</tt> package provides an Ada binding for this secret service API.
--
-- @include secret-values.ads
-- @include secret-attributes.ads
-- @include secret-services.ads
package Secret is
type Object_Type is tagged private;
-- Check if the value is empty.
function Is_Null (Value : in Object_Type'Class) return Boolean;
private
use type System.Address;
subtype Opaque_Type is System.Address;
type Object_Type is new Ada.Finalization.Controlled with record
Opaque : Opaque_Type := System.Null_Address;
end record;
-- Internal operation to set the libsecret internal pointer.
procedure Set_Opaque (Into : in out Object_Type'Class;
Data : in Opaque_Type);
-- Internal operation to get the libsecret internal pointer.
function Get_Opaque (From : in Object_Type'Class) return Opaque_Type;
subtype Chars_Ptr is Interfaces.C.Strings.chars_ptr;
procedure Free (P : in out Chars_Ptr)
renames Interfaces.C.Strings.Free;
function To_String (P : Chars_Ptr) return String
renames Interfaces.C.Strings.Value;
function New_String (V : in String) return Chars_Ptr
renames Interfaces.C.Strings.New_String;
type GError_Type is record
Domain : Interfaces.Unsigned_32 := 0;
Code : Interfaces.C.int := 0;
Message : Chars_Ptr;
end record with Convention => C;
type GError is access all GError_Type with Convention => C;
pragma Linker_Options ("-lsecret-1");
pragma Linker_Options ("-lglib-2.0");
pragma Linker_Options ("-lgio-2.0");
-- pragma Linker_Options ("-liconv");
end Secret;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with Interfaces;
use Interfaces;
package GBA.Numerics is
pragma Preelaborate;
Pi : constant :=
3.14159_26535_89793_23846_26433_83279_50288_41971_69399_37511;
e : constant :=
2.71828_18284_59045_23536_02874_71352_66249_77572_47093_69996;
type Fixed_2_14 is
delta 2.0**(-14) range -2.0 .. 2.0 - 2.0**(-14)
with Size => 16;
type Fixed_20_8 is
delta 2.0**(-8) range -2.0**19 .. 2.0**19
with Size => 32;
type Fixed_8_8 is
delta 2.0**(-8) range -2.0**7 .. 2.0**7 - 2.0**(-8)
with Size => 16;
type Fixed_2_30 is
delta 2.0**(-30) range -2.0 .. 2.0 - 2.0**(-30)
with Size => 32;
type Fixed_Unorm_8 is
delta 2.0**(-8) range 0.0 .. 1.0 - 2.0**(-8)
with Size => 8;
type Fixed_Unorm_16 is
delta 2.0**(-16) range 0.0 .. 1.0 - 2.0**(-16)
with Size => 16;
type Fixed_Unorm_32 is
delta 2.0**(-32) range 0.0 .. 1.0 - 2.0**(-32)
with Size => 32;
subtype Fixed_Snorm_16 is
Fixed_2_14 range -1.0 .. 1.0;
subtype Fixed_Snorm_32 is
Fixed_2_30 range -1.0 .. 1.0;
-- Consider this to have an implicit unit of 2*Pi.
-- Additive operators are defined to be cyclic.
type Radians_16 is new Fixed_Unorm_16;
overriding
function "+" (X, Y : Radians_16) return Radians_16
with Pure_Function, Inline_Always;
overriding
function "-" (X, Y : Radians_16) return Radians_16
with Pure_Function, Inline_Always;
overriding
function "-" (X : Radians_16) return Radians_16
with Pure_Function, Inline_Always;
-- Consider this to have an implicit unit of 2*Pi.
-- Additive operators are defined to be cyclic.
type Radians_32 is new Fixed_Unorm_32;
overriding
function "+" (X, Y : Radians_32) return Radians_32
with Pure_Function, Inline_Always;
overriding
function "-" (X, Y : Radians_32) return Radians_32
with Pure_Function, Inline_Always;
overriding
function "-" (X : Radians_32) return Radians_32
with Pure_Function, Inline_Always;
subtype Affine_Transform_Parameter is
Fixed_8_8;
type Affine_Transform_Matrix is
record
DX, DMX, DY, DMY : Affine_Transform_Parameter;
end record
with Size => 64;
for Affine_Transform_Matrix use
record
DX at 0 range 0 .. 15;
DMX at 2 range 0 .. 15;
DY at 4 range 0 .. 15;
DMY at 6 range 0 .. 15;
end record;
function Sqrt (N : Unsigned_32) return Unsigned_16
with Pure_Function, Import, External_Name => "usqrt";
generic
type Fixed is delta <>;
with function Sqrt (N : Unsigned_32) return Unsigned_16;
function Fixed_Sqrt (F : Fixed) return Fixed
with Inline_Always;
function Sin (Theta : Radians_32) return Fixed_Snorm_32
with Pure_Function, Inline_Always;
function Cos (Theta : Radians_32) return Fixed_Snorm_32
with Pure_Function, Inline_Always;
procedure Sin_Cos (Theta : Radians_32; Sin, Cos : out Fixed_Snorm_32)
with Linker_Section => ".iwram.sin_cos";
pragma Machine_Attribute (Sin_Cos, "target", "arm");
function Sin_LUT (Theta : Radians_16) return Fixed_Snorm_16
with Pure_Function, Linker_Section => ".iwram.sin_lut";
function Cos_LUT (Theta : Radians_16) return Fixed_Snorm_16
with Pure_Function, Inline_Always;
procedure Sin_Cos_LUT (Theta : Radians_16; Sin, Cos : out Fixed_Snorm_16)
with Inline_Always;
pragma Machine_Attribute (Sin_LUT, "target", "arm");
function Count_Trailing_Zeros (I : Long_Long_Integer) return Natural
with Pure_Function, Inline_Always;
function Count_Trailing_Zeros (I : Unsigned_64) return Natural
with Pure_Function, Linker_Section => ".iwram.ctz64";
pragma Machine_Attribute (Count_Trailing_Zeros, "target", "arm");
function Count_Trailing_Zeros (I : Integer) return Natural
with Pure_Function, Inline_Always;
function Count_Trailing_Zeros (I : Unsigned_32) return Natural
with Pure_Function, Linker_Section => ".iwram.ctz";
pragma Machine_Attribute (Count_Trailing_Zeros, "target", "arm");
function Count_Trailing_Zeros (I : Integer_16) return Natural
with Pure_Function, Inline_Always;
function Count_Trailing_Zeros (I : Unsigned_16) return Natural
with Pure_Function, Linker_Section => ".iwram.ctz16";
pragma Machine_Attribute (Count_Trailing_Zeros, "target", "arm");
function Count_Leading_Zeros (I : Long_Long_Integer) return Natural
with Pure_Function, Inline_Always;
function Count_Leading_Zeros (I : Unsigned_64) return Natural
with Pure_Function, Linker_Section => ".iwram.clz64";
pragma Machine_Attribute (Count_Leading_Zeros, "target", "arm");
function Count_Leading_Zeros (I : Integer) return Natural
with Pure_Function, Inline_Always;
function Count_Leading_Zeros (I : Unsigned_32) return Natural
with Pure_Function, Linker_Section => ".iwram.clz";
pragma Machine_Attribute (Count_Leading_Zeros, "target", "arm");
function Count_Leading_Zeros (I : Integer_16) return Natural
with Pure_Function, Inline_Always;
function Count_Leading_Zeros (I : Unsigned_16) return Natural
with Pure_Function, Linker_Section => ".iwram.clz16";
pragma Machine_Attribute (Count_Leading_Zeros, "target", "arm");
end GBA.Numerics;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- --
-- GNAT is maintained by AdaCore (http://www.adacore.com) --
-- --
------------------------------------------------------------------------------
with AUnit.Time_Measure; use AUnit.Time_Measure;
with Ada_Containers; use Ada_Containers;
-- This is a xUnit reporter with output compatible with jUnit capable of
-- reporing to Streams.
package body AUnit.Reporter.Stream_XML is
use Ada.Streams;
use GNAT.OS_Lib;
procedure Dump_Result_List (Engine : XML_Reporter; L : Result_Lists.List);
-- List failed assertions
-- procedure Put_Measure is new Gen_Put_Measure;
-- Output elapsed time
procedure Report_Test (Engine : XML_Reporter; Test : Test_Result);
-- Report a single assertion failure or unexpected exception
------------------------------
-- Catch_Output_And_Error --
------------------------------
procedure Catch_Output_And_Error (Engine : in out XML_Reporter) is
begin
GNAT.OS_Lib.Close (GNAT.OS_Lib.Standout);
GNAT.OS_Lib.Close (GNAT.OS_Lib.Standerr);
GNAT.OS_Lib.Create_Temp_Output_File (Engine.Stdout, Engine.Stdout_Name);
GNAT.OS_Lib.Create_Temp_Output_File (Engine.Stderr, Engine.Stderr_Name);
end;
----------------------
-- Dump_Result_List --
----------------------
procedure Dump_Result_List (Engine : XML_Reporter; L : Result_Lists.List) is
use Result_Lists;
C : Cursor := First (L);
begin
-- Note: can't use Iterate because it violates restriction
-- No_Implicit_Dynamic_Code
while Has_Element (C) loop
Report_Test (Engine, Element (C));
Next (C);
end loop;
end Dump_Result_List;
-------------
-- Image --
-------------
function Image (S : Ada_Containers.Count_Type) return String is
I : constant String := S'Img;
begin
return (if I (I'First) = ' ' then I (I'First + 1 .. I'Last) else I);
end;
-------------
-- Image --
-------------
function Image (S : Integer) return String is
I : constant String := S'Img;
begin
return (if I (I'First) = ' 'then I (I'First + 1 .. I'Last) else I);
end;
-------------
-- Image --
-------------
function Image (S : AUnit_Duration) return String is
Buffer : String (1 .. 40) := (others => ' ');
Cursor : Natural := Buffer'First;
Dummy : AUnit.IO.File_Type;
procedure Put (Dummy_F : AUnit.IO.File_Type; S : String) is
begin
Buffer (Cursor .. Cursor + S'Length - 1) := S;
Cursor := Cursor + S'Length;
end;
procedure Put is new Gen_Put_Measure;
begin
Put (Dummy, S);
return Buffer (Buffer'First .. Cursor - 1);
end;
------------------
-- Set_Output --
------------------
procedure Set_Output (Engine : in out XML_Reporter; Stream : Stream_Access) is
begin
Engine.Output := Stream;
end;
-------------
-- Write --
-------------
procedure Write (Stream : not null access Ada.Streams.Root_Stream_Type'Class;
From_Path : String) is
Last : Integer;
Fd : File_Descriptor;
begin
Fd := Open_Read (From_Path, GNAT.OS_Lib.Binary);
declare
Buffer : Stream_Element_Array (1 .. Stream_Element_Offset (File_Length (Fd)));
begin
Last := Read (Fd, Buffer'Address, Buffer'Length);
Stream_Element_Array'Write (Stream, Buffer);
if Last /= Buffer'Length then
String'Write (Stream, "<<< Warning Output is incopmplete>>>" & ASCII.LF);
end if;
end;
GNAT.OS_Lib.Close (Fd);
end;
------------
-- Report --
------------
procedure Report (Engine : XML_Reporter;
R : in out Result'Class;
Options : AUnit_Options := Default_Options)
is
T : AUnit_Duration;
Dummy_OK : Boolean;
begin
String'Write (Engine.Output, "<?xml version='1.0' encoding='utf-8' ?>" & ASCII.LF);
String'Write (Engine.Output, "<TestRun");
if Elapsed (R) /= Time_Measure.Null_Time then
T := Get_Measure (Elapsed (R));
String'Write (Engine.Output, " elapsed=""");
String'Write (Engine.Output, Image (T));
String'Write (Engine.Output, """>" & ASCII.LF);
else
String'Write (Engine.Output, ">" & ASCII.LF);
end if;
String'Write (Engine.Output, " <Statistics>" & ASCII.LF);
String'Write (Engine.Output, " <Tests>");
String'Write (Engine.Output, Image (Test_Count (R)));
String'Write (Engine.Output, "</Tests>" & ASCII.LF);
String'Write (Engine.Output, " <FailuresTotal>");
String'Write (Engine.Output, Image (Integer (Failure_Count (R)) + Integer (Error_Count (R))));
String'Write (Engine.Output, "</FailuresTotal>" & ASCII.LF);
String'Write (Engine.Output, " <Failures>");
String'Write (Engine.Output, Image (Integer (Failure_Count (R))));
String'Write (Engine.Output, "</Failures>" & ASCII.LF);
String'Write (Engine.Output, " <Errors>");
String'Write (Engine.Output, Image (Integer (Error_Count (R))));
String'Write (Engine.Output, "</Errors>" & ASCII.LF);
String'Write (Engine.Output, " </Statistics>" & ASCII.LF);
declare
S : Result_Lists.List;
begin
String'Write (Engine.Output, " <SuccessfulTests>" & ASCII.LF);
if Options.Report_Successes then
Successes (R, S);
Dump_Result_List (Engine, S);
end if;
String'Write (Engine.Output, " </SuccessfulTests>" & ASCII.LF);
end;
String'Write (Engine.Output, " <FailedTests>" & ASCII.LF);
declare
F : Result_Lists.List;
begin
Failures (R, F);
Dump_Result_List (Engine, F);
end;
declare
E : Result_Lists.List;
begin
Errors (R, E);
Dump_Result_List (Engine, E);
end;
String'Write (Engine.Output, " </FailedTests>" & ASCII.LF);
if Engine.Stdout_Name /= null then
GNAT.OS_Lib.Close (Engine.Stdout);
GNAT.OS_Lib.Close (Engine.Stderr);
String'Write (Engine.Output, " <StandardOutput>");
Write (Engine.Output, Engine.Stdout_Name.all);
String'Write (Engine.Output, "</StandardOutput>" & ASCII.LF);
String'Write (Engine.Output, " <StandardError>");
Write (Engine.Output, Engine.Stderr_Name.all);
String'Write (Engine.Output, "</StandardError>" & ASCII.LF);
GNAT.OS_Lib.Delete_File (Engine.Stderr_Name.all, Dummy_OK);
GNAT.OS_Lib.Delete_File (Engine.Stdout_Name.all, Dummy_OK);
end if;
String'Write (Engine.Output, "</TestRun>" & ASCII.LF);
end Report;
------------------
-- Report_Test --
------------------
procedure Report_Test (Engine : XML_Reporter; Test : Test_Result) is
Is_Assert : Boolean;
T : AUnit_Duration;
begin
String'Write (Engine.Output, " <Test");
if Test.Elapsed /= Time_Measure.Null_Time then
T := Get_Measure (Test.Elapsed);
String'Write (Engine.Output, " elapsed=""");
String'Write (Engine.Output, Image (T));
String'Write (Engine.Output, """>" & ASCII.LF);
else
String'Write (Engine.Output, ">" & ASCII.LF);
end if;
String'Write (Engine.Output, " <Name>");
String'Write (Engine.Output, Test.Test_Name.all);
if Test.Routine_Name /= null then
String'Write (Engine.Output, " : ");
String'Write (Engine.Output, Test.Routine_Name.all);
end if;
String'Write (Engine.Output, "</Name>" & ASCII.LF);
if Test.Failure /= null or else Test.Error /= null then
if Test.Failure /= null then
Is_Assert := True;
else
Is_Assert := False;
end if;
String'Write (Engine.Output, " <FailureType>");
if Is_Assert then
String'Write (Engine.Output, "Assertion");
else
String'Write (Engine.Output, "Error");
end if;
String'Write (Engine.Output, "</FailureType>" & ASCII.LF);
String'Write (Engine.Output, " <Message>");
if Is_Assert then
String'Write (Engine.Output, Test.Failure.Message.all);
else
String'Write (Engine.Output, Test.Error.Exception_Name.all);
end if;
String'Write (Engine.Output, "</Message>" & ASCII.LF);
if Is_Assert then
String'Write (Engine.Output, " <Location>" & ASCII.LF);
String'Write (Engine.Output, " <File>");
String'Write (Engine.Output, Test.Failure.Source_Name.all);
String'Write (Engine.Output, "</File>" & ASCII.LF);
String'Write (Engine.Output, " <Line>");
String'Write (Engine.Output, Image (Test.Failure.Line));
String'Write (Engine.Output, "</Line>" & ASCII.LF);
String'Write (Engine.Output, " </Location>" & ASCII.LF);
else
String'Write (Engine.Output, " <Exception>" & ASCII.LF);
String'Write (Engine.Output, " <Message>");
String'Write (Engine.Output, Test.Error.Exception_Name.all);
String'Write (Engine.Output, "</Message>" & ASCII.LF);
if Test.Error.Exception_Message /= null then
String'Write (Engine.Output, " <Information>");
String'Write (Engine.Output, Test.Error.Exception_Message.all);
String'Write (Engine.Output, "</Information>" & ASCII.LF);
end if;
if Test.Error.Traceback /= null then
String'Write (Engine.Output, " <Traceback>");
String'Write (Engine.Output, Test.Error.Traceback.all);
String'Write (Engine.Output, "</Traceback>" & ASCII.LF);
end if;
String'Write (Engine.Output, " </Exception>" & ASCII.LF);
end if;
end if;
String'Write (Engine.Output, " </Test>" & ASCII.LF);
end Report_Test;
end AUnit.Reporter.Stream_XML;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This unit contains the routines used to handle setting of warning options
package Warnsw is
-------------------
-- Warning Flags --
-------------------
-- These flags are activated or deactivated by -gnatw switches and control
-- whether warnings of a given class will be generated or not.
-- Note: most of these flags are still in opt, but the plan is to move them
-- here as time goes by. And in fact a really nice idea would be to put
-- them all in a Warn_Record so that they would be easy to save/restore.
Warn_On_Anonymous_Allocators : Boolean := False;
-- Warn when allocators for anonymous access types are present, which,
-- although not illegal in Ada, may be confusing to users due to how
-- accessibility checks get generated. Off by default, modified by use
-- of -gnatw_a/_A and set as part of -gnatwa.
Warn_On_Late_Primitives : Boolean := False;
-- Warn when tagged type public primitives are defined after its private
-- extensions.
Warn_On_Unknown_Compile_Time_Warning : Boolean := True;
-- Warn on a pragma Compile_Time_Warning whose condition has a value that
-- is not known at compile time.
Warn_On_Overridden_Size : Boolean := False;
-- Warn when explicit record component clause or array component_size
-- clause specifies a size that overrides a size for the type which was
-- set with an explicit size clause. Off by default, modified by use of
-- -gnatw.s/.S (but not -gnatwa).
Warn_On_Questionable_Layout : Boolean := False;
-- Warn when default layout of a record type is questionable for run-time
-- efficiency reasons and would be improved by reordering the components.
-- Off by default, modified by use of -gnatw.q/.Q (but not -gnatwa).
-- WARNING: There is a matching C declaration of this variable in fe.h
Warn_On_Record_Holes : Boolean := False;
-- Warn when explicit record component clauses leave uncovered holes (gaps)
-- in a record layout. Off by default, set by -gnatw.h (but not -gnatwa).
Warn_On_Component_Order : Boolean := False;
-- Warn when record component clauses are out of order with respect to the
-- component declarations, or if the memory layout is out of order with
-- respect to component declarations and clauses. Off by default, set by
-- -gnatw_r (but not -gnatwa).
Warn_On_Size_Alignment : Boolean := True;
-- Warn when explicit Size and Alignment clauses are given for a type, and
-- the size is not a multiple of the alignment. Off by default, modified
-- by use of -gnatw.z/.Z and set as part of -gnatwa.
Warn_On_Standard_Redefinition : Boolean := False;
-- Warn when a program defines an identifier that matches a name in
-- Standard. Off by default, modified by use of -gnatw.k/.K (but not
-- by -gnatwa).
-----------------------------------
-- Saving and Restoring Warnings --
-----------------------------------
-- Type used to save and restore warnings
type Warning_Record is record
Address_Clause_Overlay_Warnings : Boolean;
Check_Unreferenced : Boolean;
Check_Unreferenced_Formals : Boolean;
Check_Withs : Boolean;
Constant_Condition_Warnings : Boolean;
Elab_Info_Messages : Boolean;
Elab_Warnings : Boolean;
Implementation_Unit_Warnings : Boolean;
Ineffective_Inline_Warnings : Boolean;
List_Body_Required_Info : Boolean;
List_Inherited_Aspects : Boolean;
No_Warn_On_Non_Local_Exception : Boolean;
Warning_Doc_Switch : Boolean;
Warn_On_Ada_2005_Compatibility : Boolean;
Warn_On_Ada_2012_Compatibility : Boolean;
Warn_On_All_Unread_Out_Parameters : Boolean;
Warn_On_Anonymous_Allocators : Boolean;
Warn_On_Assertion_Failure : Boolean;
Warn_On_Assumed_Low_Bound : Boolean;
Warn_On_Atomic_Synchronization : Boolean;
Warn_On_Bad_Fixed_Value : Boolean;
Warn_On_Biased_Representation : Boolean;
Warn_On_Constant : Boolean;
Warn_On_Deleted_Code : Boolean;
Warn_On_Dereference : Boolean;
Warn_On_Export_Import : Boolean;
Warn_On_Hiding : Boolean;
Warn_On_Late_Primitives : Boolean;
Warn_On_Modified_Unread : Boolean;
Warn_On_No_Value_Assigned : Boolean;
Warn_On_Non_Local_Exception : Boolean;
Warn_On_Object_Renames_Function : Boolean;
Warn_On_Obsolescent_Feature : Boolean;
Warn_On_Overlap : Boolean;
Warn_On_Overridden_Size : Boolean;
Warn_On_Parameter_Order : Boolean;
Warn_On_Questionable_Layout : Boolean;
Warn_On_Questionable_Missing_Parens : Boolean;
Warn_On_Record_Holes : Boolean;
Warn_On_Component_Order : Boolean;
Warn_On_Redundant_Constructs : Boolean;
Warn_On_Reverse_Bit_Order : Boolean;
Warn_On_Size_Alignment : Boolean;
Warn_On_Standard_Redefinition : Boolean;
Warn_On_Suspicious_Contract : Boolean;
Warn_On_Suspicious_Modulus_Value : Boolean;
Warn_On_Unchecked_Conversion : Boolean;
Warn_On_Unknown_Compile_Time_Warning : Boolean;
Warn_On_Unordered_Enumeration_Type : Boolean;
Warn_On_Unrecognized_Pragma : Boolean;
Warn_On_Unrepped_Components : Boolean;
Warn_On_Warnings_Off : Boolean;
end record;
function Save_Warnings return Warning_Record;
-- Returns current settingh of warnings
procedure Restore_Warnings (W : Warning_Record);
-- Restores current settings of warning flags from W
-----------------
-- Subprograms --
-----------------
function Set_Warning_Switch (C : Character) return Boolean;
-- This function sets the warning switch or switches corresponding to the
-- given character. It is used to process a -gnatw switch on the command
-- line, or a character in a string literal in pragma Warnings. Returns
-- True for valid warning character C, False for invalid character.
function Set_Dot_Warning_Switch (C : Character) return Boolean;
-- This function sets the warning switch or switches corresponding to the
-- given character preceded by a dot. Used to process a -gnatw. switch on
-- the command line or .C in a string literal in pragma Warnings. Returns
-- True for valid warning character C, False for invalid character.
function Set_Underscore_Warning_Switch (C : Character) return Boolean;
-- This function sets the warning switch or switches corresponding to the
-- given character preceded by an underscore. Used to process a -gnatw_
-- switch on the command line or _C in a string literal in pragma Warnings.
-- Returns True for valid warnings character C, False for invalid
-- character.
procedure Set_GNAT_Mode_Warnings;
-- This is called in -gnatg mode to set the warnings for gnat mode. It is
-- also used to set the proper warning statuses for -gnatw.g. Note that
-- this set of warnings is neither a subset nor a superset of -gnatwa, it
-- enables warnings that are not included in -gnatwa and disables warnings
-- that are included in -gnatwa (such as Warn_On_Implementation_Units, that
-- we clearly want to be False for units built with -gnatg).
end Warnsw;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
separate(Formatter.Get)
procedure Format_string (Data : in Contents;
In_The_String : in out String;
Location : in out Natural;
Width : in Natural := 0;
Precision : in Natural := 0;
Left_Justify : in Boolean := False) is
-- ++
--
-- FUNCTIONAL DESCRIPTION:
--
-- Formats data string according to input parameters.
--
-- FORMAL PARAMETERS:
--
-- Data:
-- Input data string contained in variant record.
--
-- In_The_String:
-- Formatted Output String
--
-- Location:
-- Position in output string to place formatted input data string.
--
-- Width:
-- Field width of formatted output.
--
-- Precision:
-- Number of characters of input string to place in formatted output
-- field.
--
-- Left_Justify:
-- Logical (Boolean) switch which specifies to left-justify output
-- formatted string.
--
-- DESIGN:
--
-- If input string is greater than specified output field width then place
-- justified sub-string in output field. Otherwise, place justified string
-- in output field.
--
-- --
-- Local variables
Blanks : String(1..255) := (others => ' ');
Data_Width : integer;
begin
-- Check data type
if Data.Class = String_type then -- Is correct type to convert
if Width = 0 then
-- Put entire string into output buffer
In_the_string(Location..Location + Data.String_value.The_Length - 1) :=
Data.String_value.The_String.All;
Location := Location + Data.String_value.The_Length;
else -- Non-zero field Width specified
Data_Width := Data.String_value.The_Length;
if Data_width > Width then -- Data string too long
if Precision > 0 then -- Sub-string specified
if Left_justify then
In_The_String(Location..Location + Width - 1) :=
Data.String_value.The_String(1..Precision) & Blanks(1..Width - Precision);
Location := Location + Width;
else -- Right-justify
In_The_String(Location..Location + WIDTH - 1) :=
Blanks(1..Width - Precision) & Data.String_value.The_String(1..Precision);
Location := Location + WIDTH;
end if;
else -- Truncate string to fit in width of field
if Left_Justify then -- Take left-most "width" characters
In_the_string (Location..Location + Width - 1) := Data.String_value.The_String(1..Width);
else -- Take right-most "width" characters
In_the_string (Location..Location + Width - 1) := Data.String_value.The_String(Data_Width - Width + 1..Data_Width);
end if;
Location := Location + Width;
end if; -- Long String
else -- String < specified field Width
If Precision > 0 Then -- Sub-String Specified
If Left_justify Then
In_the_string(Location..Location + Width - 1) :=
Data.String_value.The_String(1..Precision) & Blanks(1..Width - Precision);
Location := Location + Width;
Else -- Right-Justify
In_the_string(Location..Location + Width - 1) :=
Blanks(1..Width - Precision) & Data.String_value.The_String(1..Precision);
Location := Location + Width;
end if;
else -- No substring specified
If Left_justify Then
In_the_string(Location..Location + Width - 1) :=
Data.String_value.The_String.All & Blanks(1..Width - Data_width);
Location := Location + Width;
else -- Right justify
In_the_string(Location..Location + Width - 1) :=
Blanks(1..Width - Data_width) & Data.String_value.The_String.All;
Location := Location + Width;
end if; -- Justify test
end if; -- Substring specified
end if; -- Field width test
end if;
else -- Wrong class type for format specifier
-- Uses Global Default_Width constant
Format_Error(In_The_String, Location, Default_Width);
end if; -- Class test
exception
When others =>
-- Uses Global Default_Width constant
Format_Error(In_The_String, Location, Default_Width);
end Format_string;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.DG.Canvases;
with AMF.DG.Radial_Gradients;
with AMF.Internals.DG_Elements;
with AMF.Visitors;
package AMF.Internals.DG_Radial_Gradients is
type DG_Radial_Gradient_Proxy is
limited new AMF.Internals.DG_Elements.DG_Element_Proxy
and AMF.DG.Radial_Gradients.DG_Radial_Gradient with null record;
overriding function Get_Center_X
(Self : not null access constant DG_Radial_Gradient_Proxy)
return AMF.Real;
-- Getter of RadialGradient::centerX.
--
-- a real number (>=0 and >=1) representing a ratio of the graphical
-- element's width that is the x center point of the gradient.
overriding procedure Set_Center_X
(Self : not null access DG_Radial_Gradient_Proxy;
To : AMF.Real);
-- Setter of RadialGradient::centerX.
--
-- a real number (>=0 and >=1) representing a ratio of the graphical
-- element's width that is the x center point of the gradient.
overriding function Get_Center_Y
(Self : not null access constant DG_Radial_Gradient_Proxy)
return AMF.Real;
-- Getter of RadialGradient::centerY.
--
-- a real number (>=0 and >=1) representing a ratio of the graphical
-- element's width that is the y center point of the gradient.
overriding procedure Set_Center_Y
(Self : not null access DG_Radial_Gradient_Proxy;
To : AMF.Real);
-- Setter of RadialGradient::centerY.
--
-- a real number (>=0 and >=1) representing a ratio of the graphical
-- element's width that is the y center point of the gradient.
overriding function Get_Radius
(Self : not null access constant DG_Radial_Gradient_Proxy)
return AMF.Real;
-- Getter of RadialGradient::radius.
--
-- a real number (>=0 and >=1) representing a ratio of the graphical
-- element's size that is the radius of the gradient.
overriding procedure Set_Radius
(Self : not null access DG_Radial_Gradient_Proxy;
To : AMF.Real);
-- Setter of RadialGradient::radius.
--
-- a real number (>=0 and >=1) representing a ratio of the graphical
-- element's size that is the radius of the gradient.
overriding function Get_Focus_X
(Self : not null access constant DG_Radial_Gradient_Proxy)
return AMF.Real;
-- Getter of RadialGradient::focusX.
--
-- a real number (>=0 and >=1) representing a ratio of the graphical
-- element's width that is the x focus point of the gradient.
overriding procedure Set_Focus_X
(Self : not null access DG_Radial_Gradient_Proxy;
To : AMF.Real);
-- Setter of RadialGradient::focusX.
--
-- a real number (>=0 and >=1) representing a ratio of the graphical
-- element's width that is the x focus point of the gradient.
overriding function Get_Focus_Y
(Self : not null access constant DG_Radial_Gradient_Proxy)
return AMF.Real;
-- Getter of RadialGradient::focusY.
--
-- a real number (>=0 and >=1) representing a ratio of the graphical
-- element's width that is the y focus point of the gradient.
overriding procedure Set_Focus_Y
(Self : not null access DG_Radial_Gradient_Proxy;
To : AMF.Real);
-- Setter of RadialGradient::focusY.
--
-- a real number (>=0 and >=1) representing a ratio of the graphical
-- element's width that is the y focus point of the gradient.
overriding function Get_Stop
(Self : not null access constant DG_Radial_Gradient_Proxy)
return AMF.DG.Set_Of_DG_Gradient_Stop;
-- Getter of Gradient::stop.
--
-- a list of two or more gradient stops defining the color transitions of
-- the gradient.
overriding function Get_Canvas
(Self : not null access constant DG_Radial_Gradient_Proxy)
return AMF.DG.Canvases.DG_Canvas_Access;
-- Getter of Fill::canvas.
--
-- a reference to the canvas that owns this fill.
overriding procedure Set_Canvas
(Self : not null access DG_Radial_Gradient_Proxy;
To : AMF.DG.Canvases.DG_Canvas_Access);
-- Setter of Fill::canvas.
--
-- a reference to the canvas that owns this fill.
overriding function Get_Transform
(Self : not null access constant DG_Radial_Gradient_Proxy)
return AMF.DG.Sequence_Of_DG_Transform;
-- Getter of Fill::transform.
--
-- a list of zero or more transforms to apply to this fill.
overriding procedure Enter_Element
(Self : not null access constant DG_Radial_Gradient_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
overriding procedure Leave_Element
(Self : not null access constant DG_Radial_Gradient_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
overriding procedure Visit_Element
(Self : not null access constant DG_Radial_Gradient_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
end AMF.Internals.DG_Radial_Gradients;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
--*
-- OBJECTIVE:
-- CHECK THAT IF A COLLECTION SIZE SPECIFICATION IS GIVEN FOR AN
-- ACCESS TYPE WHOSE DESIGNATED TYPE IS A DISCRIMINATED RECORD, THEN
-- OPERATIONS ON VALUES OF THE ACCESS TYPE ARE NOT AFFECTED.
-- HISTORY:
-- BCB 09/29/87 CREATED ORIGINAL TEST.
-- PWB 05/11/89 CHANGED EXTENSION FROM '.DEP' TO '.ADA'.
WITH REPORT; USE REPORT;
PROCEDURE CD2B11F IS
BASIC_SIZE : CONSTANT := 1024;
TYPE RECORD_TYPE(DISC : INTEGER := 100) IS RECORD
COMP1 : INTEGER;
COMP2 : INTEGER;
COMP3 : INTEGER;
END RECORD;
TYPE ACC_RECORD IS ACCESS RECORD_TYPE;
FOR ACC_RECORD'STORAGE_SIZE USE BASIC_SIZE;
CHECK_RECORD1 : ACC_RECORD;
CHECK_RECORD2 : ACC_RECORD;
BEGIN
TEST ("CD2B11F", "CHECK THAT IF A COLLECTION SIZE SPECIFICATION " &
"IS GIVEN FOR AN ACCESS TYPE WHOSE " &
"DESIGNATED TYPE IS A DISCRIMINATED RECORD, " &
"THEN OPERATIONS ON VALUES OF THE ACCESS TYPE " &
"ARE NOT AFFECTED");
CHECK_RECORD1 := NEW RECORD_TYPE;
CHECK_RECORD1.COMP1 := 25;
CHECK_RECORD1.COMP2 := 25;
CHECK_RECORD1.COMP3 := 150;
IF ACC_RECORD'STORAGE_SIZE < BASIC_SIZE THEN
FAILED ("INCORRECT VALUE FOR RECORD TYPE ACCESS " &
"STORAGE_SIZE");
END IF;
IF CHECK_RECORD1.DISC /= IDENT_INT (100) THEN
FAILED ("INCORRECT VALUE FOR RECORD DISCRIMINANT");
END IF;
IF ((CHECK_RECORD1.COMP1 /= CHECK_RECORD1.COMP2) OR
(CHECK_RECORD1.COMP1 = CHECK_RECORD1.COMP3)) THEN
FAILED ("INCORRECT VALUE FOR RECORD COMPONENT");
END IF;
IF EQUAL (3,3) THEN
CHECK_RECORD2 := CHECK_RECORD1;
END IF;
IF CHECK_RECORD2 /= CHECK_RECORD1 THEN
FAILED ("INCORRECT RESULTS FOR RELATIONAL OPERATOR");
END IF;
RESULT;
END CD2B11F;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
--
pragma Ada_2005;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
with x86_64_linux_gnu_bits_types_h;
with Interfaces.C.Strings;
with stddef_h;
with xlocale_h;
with unistd_h;
with System;
package time_h is
-- unsupported macro: TIME_UTC 1
subtype clock_t is x86_64_linux_gnu_bits_types_h.uu_clock_t; -- /usr/include/time.h:59
subtype time_t is x86_64_linux_gnu_bits_types_h.uu_time_t; -- /usr/include/time.h:75
subtype clockid_t is x86_64_linux_gnu_bits_types_h.uu_clockid_t; -- /usr/include/time.h:91
subtype timer_t is x86_64_linux_gnu_bits_types_h.uu_timer_t; -- /usr/include/time.h:103
type timespec is record
tv_sec : aliased x86_64_linux_gnu_bits_types_h.uu_time_t; -- /usr/include/time.h:122
tv_nsec : aliased x86_64_linux_gnu_bits_types_h.uu_syscall_slong_t; -- /usr/include/time.h:123
end record;
pragma Convention (C_Pass_By_Copy, timespec); -- /usr/include/time.h:120
type tm is record
tm_sec : aliased int; -- /usr/include/time.h:135
tm_min : aliased int; -- /usr/include/time.h:136
tm_hour : aliased int; -- /usr/include/time.h:137
tm_mday : aliased int; -- /usr/include/time.h:138
tm_mon : aliased int; -- /usr/include/time.h:139
tm_year : aliased int; -- /usr/include/time.h:140
tm_wday : aliased int; -- /usr/include/time.h:141
tm_yday : aliased int; -- /usr/include/time.h:142
tm_isdst : aliased int; -- /usr/include/time.h:143
tm_gmtoff : aliased long; -- /usr/include/time.h:146
tm_zone : Interfaces.C.Strings.chars_ptr; -- /usr/include/time.h:147
end record;
pragma Convention (C_Pass_By_Copy, tm); -- /usr/include/time.h:133
type itimerspec is record
it_interval : aliased timespec; -- /usr/include/time.h:163
it_value : aliased timespec; -- /usr/include/time.h:164
end record;
pragma Convention (C_Pass_By_Copy, itimerspec); -- /usr/include/time.h:161
-- skipped empty struct sigevent
function clock return clock_t; -- /usr/include/time.h:189
pragma Import (C, clock, "clock");
function time (uu_timer : access time_t) return time_t; -- /usr/include/time.h:192
pragma Import (C, time, "time");
function difftime (uu_time1 : time_t; uu_time0 : time_t) return double; -- /usr/include/time.h:195
pragma Import (C, difftime, "difftime");
function mktime (uu_tp : access tm) return time_t; -- /usr/include/time.h:199
pragma Import (C, mktime, "mktime");
function strftime
(uu_s : Interfaces.C.Strings.chars_ptr;
uu_maxsize : stddef_h.size_t;
uu_format : Interfaces.C.Strings.chars_ptr;
uu_tp : access constant tm) return stddef_h.size_t; -- /usr/include/time.h:205
pragma Import (C, strftime, "strftime");
function strptime
(uu_s : Interfaces.C.Strings.chars_ptr;
uu_fmt : Interfaces.C.Strings.chars_ptr;
uu_tp : access tm) return Interfaces.C.Strings.chars_ptr; -- /usr/include/time.h:213
pragma Import (C, strptime, "strptime");
function strftime_l
(uu_s : Interfaces.C.Strings.chars_ptr;
uu_maxsize : stddef_h.size_t;
uu_format : Interfaces.C.Strings.chars_ptr;
uu_tp : access constant tm;
uu_loc : xlocale_h.uu_locale_t) return stddef_h.size_t; -- /usr/include/time.h:223
pragma Import (C, strftime_l, "strftime_l");
function strptime_l
(uu_s : Interfaces.C.Strings.chars_ptr;
uu_fmt : Interfaces.C.Strings.chars_ptr;
uu_tp : access tm;
uu_loc : xlocale_h.uu_locale_t) return Interfaces.C.Strings.chars_ptr; -- /usr/include/time.h:230
pragma Import (C, strptime_l, "strptime_l");
function gmtime (uu_timer : access time_t) return access tm; -- /usr/include/time.h:239
pragma Import (C, gmtime, "gmtime");
function localtime (uu_timer : access time_t) return access tm; -- /usr/include/time.h:243
pragma Import (C, localtime, "localtime");
function gmtime_r (uu_timer : access time_t; uu_tp : access tm) return access tm; -- /usr/include/time.h:249
pragma Import (C, gmtime_r, "gmtime_r");
function localtime_r (uu_timer : access time_t; uu_tp : access tm) return access tm; -- /usr/include/time.h:254
pragma Import (C, localtime_r, "localtime_r");
function asctime (uu_tp : access constant tm) return Interfaces.C.Strings.chars_ptr; -- /usr/include/time.h:261
pragma Import (C, asctime, "asctime");
function ctime (uu_timer : access time_t) return Interfaces.C.Strings.chars_ptr; -- /usr/include/time.h:264
pragma Import (C, ctime, "ctime");
function asctime_r (uu_tp : access constant tm; uu_buf : Interfaces.C.Strings.chars_ptr) return Interfaces.C.Strings.chars_ptr; -- /usr/include/time.h:272
pragma Import (C, asctime_r, "asctime_r");
function ctime_r (uu_timer : access time_t; uu_buf : Interfaces.C.Strings.chars_ptr) return Interfaces.C.Strings.chars_ptr; -- /usr/include/time.h:276
pragma Import (C, ctime_r, "ctime_r");
tzname : aliased array (0 .. 1) of Interfaces.C.Strings.chars_ptr; -- /usr/include/time.h:289
pragma Import (C, tzname, "tzname");
procedure tzset; -- /usr/include/time.h:293
pragma Import (C, tzset, "tzset");
daylight : aliased int; -- /usr/include/time.h:297
pragma Import (C, daylight, "daylight");
timezone : aliased long; -- /usr/include/time.h:298
pragma Import (C, timezone, "timezone");
function stime (uu_when : access time_t) return int; -- /usr/include/time.h:304
pragma Import (C, stime, "stime");
function timegm (uu_tp : access tm) return time_t; -- /usr/include/time.h:319
pragma Import (C, timegm, "timegm");
function timelocal (uu_tp : access tm) return time_t; -- /usr/include/time.h:322
pragma Import (C, timelocal, "timelocal");
function dysize (uu_year : int) return int; -- /usr/include/time.h:325
pragma Import (C, dysize, "dysize");
function nanosleep (uu_requested_time : access constant timespec; uu_remaining : access timespec) return int; -- /usr/include/time.h:334
pragma Import (C, nanosleep, "nanosleep");
function clock_getres (uu_clock_id : clockid_t; uu_res : access timespec) return int; -- /usr/include/time.h:339
pragma Import (C, clock_getres, "clock_getres");
function clock_gettime (uu_clock_id : clockid_t; uu_tp : access timespec) return int; -- /usr/include/time.h:342
pragma Import (C, clock_gettime, "clock_gettime");
function clock_settime (uu_clock_id : clockid_t; uu_tp : access constant timespec) return int; -- /usr/include/time.h:345
pragma Import (C, clock_settime, "clock_settime");
function clock_nanosleep
(uu_clock_id : clockid_t;
uu_flags : int;
uu_req : access constant timespec;
uu_rem : access timespec) return int; -- /usr/include/time.h:353
pragma Import (C, clock_nanosleep, "clock_nanosleep");
function clock_getcpuclockid (uu_pid : unistd_h.pid_t; uu_clock_id : access clockid_t) return int; -- /usr/include/time.h:358
pragma Import (C, clock_getcpuclockid, "clock_getcpuclockid");
function timer_create
(uu_clock_id : clockid_t;
uu_evp : System.Address;
uu_timerid : System.Address) return int; -- /usr/include/time.h:363
pragma Import (C, timer_create, "timer_create");
function timer_delete (uu_timerid : timer_t) return int; -- /usr/include/time.h:368
pragma Import (C, timer_delete, "timer_delete");
function timer_settime
(uu_timerid : timer_t;
uu_flags : int;
uu_value : access constant itimerspec;
uu_ovalue : access itimerspec) return int; -- /usr/include/time.h:371
pragma Import (C, timer_settime, "timer_settime");
function timer_gettime (uu_timerid : timer_t; uu_value : access itimerspec) return int; -- /usr/include/time.h:376
pragma Import (C, timer_gettime, "timer_gettime");
function timer_getoverrun (uu_timerid : timer_t) return int; -- /usr/include/time.h:380
pragma Import (C, timer_getoverrun, "timer_getoverrun");
function timespec_get (uu_ts : access timespec; uu_base : int) return int; -- /usr/include/time.h:386
pragma Import (C, timespec_get, "timespec_get");
getdate_err : aliased int; -- /usr/include/time.h:403
pragma Import (C, getdate_err, "getdate_err");
function getdate (uu_string : Interfaces.C.Strings.chars_ptr) return access tm; -- /usr/include/time.h:412
pragma Import (C, getdate, "getdate");
function getdate_r (uu_string : Interfaces.C.Strings.chars_ptr; uu_resbufp : access tm) return int; -- /usr/include/time.h:426
pragma Import (C, getdate_r, "getdate_r");
end time_h;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with Ada.Text_IO; use Ada.Text_IO;
procedure Test_LCS is
function LCS (A, B : String) return String is
L : array (A'First..A'Last + 1, B'First..B'Last + 1) of Natural;
begin
for I in L'Range (1) loop
L (I, B'First) := 0;
end loop;
for J in L'Range (2) loop
L (A'First, J) := 0;
end loop;
for I in A'Range loop
for J in B'Range loop
if A (I) = B (J) then
L (I + 1, J + 1) := L (I, J) + 1;
else
L (I + 1, J + 1) := Natural'Max (L (I + 1, J), L (I, J + 1));
end if;
end loop;
end loop;
declare
I : Integer := L'Last (1);
J : Integer := L'Last (2);
R : String (1..Integer'Max (A'Length, B'Length));
K : Integer := R'Last;
begin
while I > L'First (1) and then J > L'First (2) loop
if L (I, J) = L (I - 1, J) then
I := I - 1;
elsif L (I, J) = L (I, J - 1) then
J := J - 1;
else
I := I - 1;
J := J - 1;
R (K) := A (I);
K := K - 1;
end if;
end loop;
return R (K + 1..R'Last);
end;
end LCS;
begin
Put_Line (LCS ("thisisatest", "testing123testing"));
end Test_LCS;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-------------------------------------------------------------
with Incr.Nodes.Tokens;
package body Incr.Nodes is
To_Diff : constant array (Boolean) of Integer :=
(False => -1, True => 1);
------------------
-- Constructors --
------------------
package body Constructors is
----------------
-- Initialize --
----------------
procedure Initialize (Self : aliased in out Node_With_Parent'Class) is
begin
Versioned_Booleans.Initialize (Self.Exist, False);
Versioned_Booleans.Initialize (Self.LC, False);
Versioned_Booleans.Initialize (Self.LE, False);
Versioned_Nodes.Initialize (Self.Parent, null);
end Initialize;
------------------------
-- Initialize_Ancient --
------------------------
procedure Initialize_Ancient
(Self : aliased in out Node_With_Parent'Class;
Parent : Node_Access) is
begin
Versioned_Booleans.Initialize (Self.Exist, True);
Versioned_Booleans.Initialize (Self.LC, False);
Versioned_Booleans.Initialize (Self.LE, False);
Versioned_Nodes.Initialize (Self.Parent, Parent);
end Initialize_Ancient;
end Constructors;
------------
-- Exists --
------------
overriding function Exists
(Self : Node_With_Exist;
Time : Version_Trees.Version) return Boolean is
begin
return Versioned_Booleans.Get (Self.Exist, Time);
end Exists;
-----------------
-- Child_Index --
-----------------
function Child_Index
(Self : Node'Class;
Child : Constant_Node_Access;
Time : Version_Trees.Version) return Natural is
begin
for J in 1 .. Self.Arity loop
if Constant_Node_Access (Self.Child (J, Time)) = Child then
return J;
end if;
end loop;
return 0;
end Child_Index;
--------------------
-- Discard_Parent --
--------------------
overriding procedure Discard_Parent (Self : in out Node_With_Parent) is
Changed : Boolean;
Ignore : Integer := 0;
Now : constant Version_Trees.Version :=
Self.Document.History.Changing;
begin
Changed := Self.Local_Changes > 0 or Self.Nested_Changes > 0;
if Changed then
Self.Propagate_Nested_Changes (-1);
end if;
Versioned_Nodes.Discard (Self.Parent, Now, Ignore);
if Changed then
Self.Propagate_Nested_Changes (1);
end if;
end Discard_Parent;
-----------------
-- First_Token --
-----------------
function First_Token
(Self : aliased in out Node'Class;
Time : Version_Trees.Version)
return Tokens.Token_Access
is
Child : Node_Access;
begin
if Self.Arity > 0 then
Child := Self.Child (1, Time);
if Child.Is_Token then
return Tokens.Token_Access (Child);
else
return Child.First_Token (Time);
end if;
elsif Self.Is_Token then
return Tokens.Token'Class (Self)'Access;
else
return null;
end if;
end First_Token;
--------------
-- Get_Flag --
--------------
overriding function Get_Flag
(Self : Node_With_Exist;
Flag : Transient_Flags) return Boolean is
begin
return Self.Flag (Flag);
end Get_Flag;
----------------
-- Last_Token --
----------------
function Last_Token
(Self : aliased in out Node'Class;
Time : Version_Trees.Version) return Tokens.Token_Access
is
Child : Node_Access;
begin
if Self.Arity > 0 then
Child := Self.Child (Self.Arity, Time);
if Child.Is_Token then
return Tokens.Token_Access (Child);
else
return Child.Last_Token (Time);
end if;
elsif Self.Is_Token then
return Tokens.Token'Class (Self)'Access;
else
return null;
end if;
end Last_Token;
-------------------
-- Local_Changes --
-------------------
overriding function Local_Changes
(Self : Node_With_Exist;
From : Version_Trees.Version;
To : Version_Trees.Version) return Boolean
is
use type Version_Trees.Version;
Time : Version_Trees.Version := To;
begin
if Self.Document.History.Is_Changing (To) then
-- Self.LC doesn't contain Local_Changes for Is_Changing version yet
-- Take it from Self.Nested_Changes
if Self.Local_Changes > 0 then
return True;
elsif Time = From then
return False;
end if;
Time := Self.Document.History.Parent (Time);
end if;
while Time /= From loop
if Versioned_Booleans.Get (Self.LC, Time) then
return True;
end if;
Time := Self.Document.History.Parent (Time);
end loop;
return False;
end Local_Changes;
---------------------------
-- Mark_Deleted_Children --
---------------------------
procedure Mark_Deleted_Children (Self : in out Node'Class) is
function Find_Root (Node : Node_Access) return Node_Access;
-- Find top root accessible from the Node
procedure Delete_Tree
(Node : not null Node_Access;
Parent : Node_Access;
Index : Positive);
-- Check Node if it's disjointed from ultra-root.
-- Delete a subtree rooted from Node if so.
-- If Parent /= null also set Parent.Child(Index) to null.
Now : constant Version_Trees.Version := Self.Document.History.Changing;
-----------------
-- In_The_Tree --
-----------------
function Find_Root (Node : Node_Access) return Node_Access is
Child : not null Nodes.Node_Access := Node;
begin
loop
declare
Parent : constant Nodes.Node_Access := Child.Parent (Now);
begin
if Parent = null then
return Child;
else
Child := Parent;
end if;
end;
end loop;
end Find_Root;
-----------------
-- Delete_Tree --
-----------------
procedure Delete_Tree
(Node : not null Node_Access;
Parent : Node_Access;
Index : Positive)
is
Changes : Integer := 0;
begin
if not Node.Exists (Now) then
return;
elsif Node.Parent (Now) /= Parent then
declare
Root : constant Node_Access := Find_Root (Node);
begin
if Root = Self.Document.Ultra_Root then
return;
end if;
end;
end if;
for J in 1 .. Node.Arity loop
declare
Child : constant Node_Access := Node.Child (J, Now);
begin
Delete_Tree (Child, Node, J);
end;
end loop;
Versioned_Booleans.Set
(Node_With_Exist (Node.all).Exist,
False,
Now,
Changes => Changes);
if Parent /= null then
Parent.Set_Child (Index, null);
end if;
end Delete_Tree;
Prev : constant Version_Trees.Version :=
Self.Document.History.Parent (Now);
Child : Node_Access;
begin
for J in 1 .. Self.Arity loop
Child := Self.Child (J, Prev);
if Child /= null and then
Child.Exists (Now) and then
Child.Parent (Now) /= Self'Unchecked_Access
then
Child := Find_Root (Child);
if Child /= Self.Document.Ultra_Root then
Delete_Tree (Child, null, J);
end if;
end if;
end loop;
end Mark_Deleted_Children;
------------------
-- Local_Errors --
------------------
overriding function Local_Errors
(Self : Node_With_Exist;
Time : Version_Trees.Version) return Boolean is
begin
return Versioned_Booleans.Get (Self.LE, Time);
end Local_Errors;
------------------
-- Next_Subtree --
------------------
function Next_Subtree
(Self : Node'Class;
Time : Version_Trees.Version) return Node_Access
is
Node : Constant_Node_Access := Self'Unchecked_Access;
Parent : Node_Access := Node.Parent (Time);
Child : Node_Access;
begin
while Parent /= null loop
declare
J : constant Natural := Parent.Child_Index (Node, Time);
begin
if J in 1 .. Parent.Arity - 1 then
for K in J + 1 .. Parent.Arity loop
Child := Parent.Child (K, Time);
if Child /= null then
return Child;
end if;
end loop;
end if;
end;
Node := Constant_Node_Access (Parent);
Parent := Node.Parent (Time);
end loop;
return null;
end Next_Subtree;
---------------
-- On_Commit --
---------------
overriding procedure On_Commit
(Self : in out Node_With_Exist;
Parent : Node_Access)
is
Now : constant Version_Trees.Version := Self.Document.History.Changing;
This : constant Node_Access := Self'Unchecked_Access;
Child : Node_Access;
Diff : Integer := 0; -- Ignore this diff
begin
pragma Assert (Node'Class (Self).Parent (Now) = Parent);
Versioned_Booleans.Set (Self.LC, Self.Local_Changes > 0, Now, Diff);
Self.Nested_Changes := 0;
Self.Local_Changes := 0;
Self.Flag := (others => False);
for J in 1 .. This.Arity loop
Child := This.Child (J, Now);
if Child /= null then
Child.On_Commit (Self'Unchecked_Access);
end if;
end loop;
end On_Commit;
------------
-- Parent --
------------
overriding function Parent
(Self : Node_With_Parent;
Time : Version_Trees.Version)
return Node_Access is
begin
return Versioned_Nodes.Get (Self.Parent, Time);
end Parent;
----------------------
-- Previous_Subtree --
----------------------
function Previous_Subtree
(Self : Node'Class;
Time : Version_Trees.Version) return Node_Access
is
Node : Constant_Node_Access := Self'Unchecked_Access;
Parent : Node_Access := Node.Parent (Time);
Child : Node_Access;
begin
while Parent /= null loop
declare
J : constant Natural := Parent.Child_Index (Node, Time);
begin
if J in 2 .. Parent.Arity then
for K in reverse 1 .. J - 1 loop
Child := Parent.Child (K, Time);
if Child /= null then
return Child;
end if;
end loop;
end if;
end;
Node := Constant_Node_Access (Parent);
Parent := Node.Parent (Time);
end loop;
return null;
end Previous_Subtree;
------------------------------
-- Propagate_Nested_Changes --
------------------------------
procedure Propagate_Nested_Changes
(Self : in out Node'Class;
Diff : Integer)
is
Parent : constant Node_Access :=
Self.Parent (Self.Document.History.Changing);
begin
if Parent /= null then
Parent.On_Nested_Changes (Diff);
end if;
end Propagate_Nested_Changes;
------------------------------
-- Propagate_Nested_Changes --
------------------------------
overriding procedure On_Nested_Changes
(Self : in out Node_With_Exist;
Diff : Integer)
is
Before : Boolean;
After : Boolean;
begin
Before := Self.Local_Changes > 0 or Self.Nested_Changes > 0;
Self.Nested_Changes := Self.Nested_Changes + Diff;
After := Self.Local_Changes > 0 or Self.Nested_Changes > 0;
if Before /= After then
Self.Propagate_Nested_Changes (To_Diff (After));
end if;
end On_Nested_Changes;
--------------
-- Set_Flag --
--------------
overriding procedure Set_Flag
(Self : in out Node_With_Exist;
Flag : Transient_Flags;
Value : Boolean := True)
is
Before : Boolean;
After : Boolean;
begin
Before := (Self.Flag and Local_Changes_Mask) /= No_Flags;
Self.Flag (Flag) := Value;
After := (Self.Flag and Local_Changes_Mask) /= No_Flags;
if Before /= After then
Self.Update_Local_Changes (To_Diff (After));
end if;
end Set_Flag;
----------------------
-- Set_Local_Errors --
----------------------
overriding procedure Set_Local_Errors
(Self : in out Node_With_Exist;
Value : Boolean := True)
is
Now : constant Version_Trees.Version := Self.Document.History.Changing;
Diff : Integer := 0;
begin
Versioned_Booleans.Set (Self.LE, Value, Now, Diff);
Self.Update_Local_Changes (Diff);
end Set_Local_Errors;
----------------
-- Set_Parent --
----------------
overriding procedure Set_Parent
(Self : in out Node_With_Parent;
Value : Node_Access)
is
Changed : Boolean;
Ignore : Integer := 0;
Now : constant Version_Trees.Version :=
Self.Document.History.Changing;
begin
Changed := Self.Local_Changes > 0 or Self.Nested_Changes > 0;
if Changed then
Self.Propagate_Nested_Changes (-1);
end if;
Versioned_Nodes.Set (Self.Parent, Value, Now, Ignore);
if Changed then
Self.Propagate_Nested_Changes (1);
end if;
end Set_Parent;
--------------------------
-- Update_Local_Changes --
--------------------------
not overriding procedure Update_Local_Changes
(Self : in out Node_With_Exist;
Diff : Integer)
is
Before : Boolean;
After : Boolean;
begin
Before := Self.Local_Changes > 0 or Self.Nested_Changes > 0;
Self.Local_Changes := Self.Local_Changes + Diff;
After := Self.Local_Changes > 0 or Self.Nested_Changes > 0;
if Before /= After then
Self.Propagate_Nested_Changes (To_Diff (After));
end if;
end Update_Local_Changes;
end Incr.Nodes;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
package scanner.DFA is
Aflex_Debug : Boolean := False;
YYText_Ptr : Integer; -- points to start of yytext in buffer
-- yy_ch_buf has to be 2 characters longer than YY_BUF_SIZE because we
-- need to put in 2 end-of-buffer characters (this is explained where
-- it is done) at the end of yy_ch_buf
YY_READ_BUF_SIZE : constant Integer := 8192;
YY_BUF_SIZE : constant Integer := YY_READ_BUF_SIZE * 2;
-- Size of input buffer
type Unbounded_Character_Array is
array (Integer range <>) of Wide_Wide_Character;
type Ch_Buf_Type is record
Data : Unbounded_Character_Array (0 .. YY_BUF_SIZE + 1);
end record;
function Previous
(Data : Ch_Buf_Type; Index : Integer) return Wide_Wide_Character;
procedure Next
(Data : Ch_Buf_Type;
Index : in out Integer;
Code : out Wide_Wide_Character);
YY_Ch_Buf : Ch_Buf_Type;
YY_CP : Integer;
YY_BP : Integer;
YY_C_Buf_P : Integer; -- Points to current character in buffer
function YYText return Wide_Wide_String;
function YYLength return Integer;
procedure YY_DO_BEFORE_ACTION;
-- These variables are needed between calls to YYLex.
YY_Init : Boolean := True; -- do we need to initialize YYLex?
YY_Start : Integer := 0; -- current start state number
subtype YY_State_Type is Integer;
YY_Last_Accepting_State : YY_State_Type;
YY_Last_Accepting_Cpos : Integer;
end scanner.DFA;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
package body Ordered_Maps_G is
function Binary_Search (M: Map; Key: Key_Type;
Left: Integer; Right: Integer) return Integer is
Middle: Integer;
begin
if Right < Left then
return Left;
else
Middle := (Left + Right)/2;
if Left = Right then
return Left;
elsif M.P_Array(Middle).Key < Key then
return Binary_Search (M,Key,Middle + 1,Right);
elsif Key < M.P_Array(Middle).Key then
return Binary_Search (M,Key,Left,Middle);
else
return Middle;
end if;
end if;
end Binary_Search;
procedure Put (M: in out Map;
Key: Key_Type;
Value: Value_Type) is
Position: Integer := 0;
Left: Integer := 0;
begin
if M.P_Array = null or M.Length = 0 then
M.P_Array := new Cell_Array;
M.P_Array(0) := (Key, Value, True);
M.Length := 1;
else
Position := Binary_Search (M,Key,Left,M.Length);
if Position > Max - 1 then
raise Full_Map;
end if;
if M.P_Array(Position).Full and M.P_Array(Position).Key = Key then
M.P_Array(Position).Value := Value;
elsif M.P_Array(Position).Full then
for I in reverse Position..M.Length-1 loop
if M.Length = Max then
raise Full_Map;
end if;
M.P_Array(I + 1) := M.P_Array(I);
end loop;
M.Length := M.Length + 1;
M.P_Array(Position) := (Key, Value, True);
else
M.P_Array(Position) := (Key, Value, True);
M.Length := M.Length + 1;
end if;
end if;
end Put;
procedure Get (M: Map;
Key: in Key_Type;
Value: out Value_Type;
Success: out Boolean) is
Left: Integer := 0;
Right: Integer := Max-1;
Position: Integer := 0;
begin
Success := False;
if M.P_Array /= null then
Position := Binary_Search (M,Key,Left,Right);
if Position <= Max - 1 then
if M.P_Array(0).Key = Key then
Success := True;
Value := M.P_Array(Binary_Search (M,Key,Left,Right)).Value;
end if;
end if;
end if;
end Get;
procedure Delete (M: in out Map;
Key: in Key_Type;
Success: out Boolean) is
Left: Integer := 0;
Right: Integer := M.Length;
Position: Integer;
begin
Success := False;
Position := Binary_Search (M,Key,Left,Right);
if Position <= Max - 1 then
if M.P_Array(Position).Key = Key then
Success := True;
M.Length := M.Length - 1;
for I in Position..M.Length - 1 loop
M.P_Array(I) := M.P_Array(I + 1);
end loop;
end if;
end if;
end Delete;
function Map_Length (M: Map) return Natural is
begin
return M.Length;
end Map_Length;
function First (M: Map) return Cursor is
C: Cursor;
begin
C.M := M;
C.Position := 0;
return C;
end First;
procedure Next (C: in out Cursor) is
End_Of_Map: Boolean;
begin
End_Of_Map := False;
if C.Position <= Max then
C.Position := C.Position + 1;
end if;
end Next;
function Has_Element (C: Cursor) return Boolean is
begin
if C.Position >= C.M.Length then
return False;
end if;
return C.M.P_Array(C.Position).Full;
end Has_Element;
function Element (C: Cursor) return Element_Type is
Element: Element_Type;
begin
if Has_Element (C) then
Element.Key := C.M.P_Array(C.Position).Key;
Element.Value := C.M.P_Array(C.Position).Value;
else
raise No_Element;
end if;
return Element;
end Element;
end Ordered_Maps_G;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- SOFTWARE.
-- TODO Error Handling
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
package body Simh_Tapes is
function Reverse_Dword_Bytes (In_Dw : in Dword_T) return Dword_T is
begin
return Shift_Left (In_Dw and 16#0000_00ff#, 24) or
Shift_Left (In_Dw and 16#0000_ff00#, 8) or
Shift_Right (In_Dw and 16#00ff_0000#, 8) or
Shift_Right (In_Dw and 16#ff00_0000#, 24);
end Reverse_Dword_Bytes;
-- Read_Meta_Data reads a four byte (one doubleword) header, trailer, or other metadata record
-- from the supplied tape image file
procedure Read_Meta_Data
(Img_Stream : in out Stream_Access; Meta_Data : out Dword_T)
is
Tmp_Dw : Dword_T;
begin
Dword_T'Read (Img_Stream, Tmp_Dw);
-- Meta_Data := Reverse_Dword_Bytes (Tmp_Dw);
Meta_Data := Tmp_Dw;
end Read_Meta_Data;
-- Write_Meta_Data writes a 4-byte header/trailer or other metadata
procedure Write_Meta_Data (Img_Stream : in out Stream_Access; Meta_Data : in Dword_T) is
-- Tmp_Dw : Dword_T;
begin
-- Tmp_Dw := Reverse_Dword_Bytes (Meta_Data);
-- Dword_T'Write (Img_Stream, Tmp_Dw);
Dword_T'Write (Img_Stream, Meta_Data);
end Write_Meta_Data;
-- Read_Record_Data attempts to read a data record from SimH tape image, fails if wrong number of bytes read
-- N.B. does not read the header and trailer
procedure Read_Record_Data (Img_Stream : in out Stream_Access; Num_Bytes : in Natural; Rec : out Mt_Rec) is
Tmp_Rec : Mt_Rec (1..Num_Bytes);
Out_Rec_Ix : Integer := Rec'First;
begin
for C in 1 .. Num_Bytes loop
Byte_T'Read (Img_Stream, Tmp_Rec(C));
Rec(Out_Rec_Ix) := Tmp_Rec(C);
Out_Rec_Ix := Out_Rec_Ix + 1;
end loop;
end Read_Record_Data;
-- Write_Record_Data writes the actual data - not the header/trailer
procedure Write_Record_Data (Img_Stream : in out Stream_Access; Rec : in Mt_Rec) is
begin
for C in Rec'Range loop
Byte_T'Write( Img_Stream, Rec(C));
end loop;
end Write_Record_Data;
procedure Rewind (Img_File : in out File_Type) is
begin
Set_Index (Img_File, 1);
end Rewind;
-- internal function
function Space_Forward_1_Rec (Img_Stream : in out Stream_Access) return Mt_Stat is
Hdr, Trailer : Dword_T;
begin
Read_Meta_Data (Img_Stream , Hdr);
if Hdr = Mtr_Tmk then
return Tmk;
end if;
-- read and discard 1 record
declare
Rec : Mt_Rec(1..Natural(Hdr));
begin
Read_Record_Data (Img_Stream , Natural(Hdr), Rec);
end;
-- check trailer
Read_Meta_Data (Img_Stream , Trailer);
if Hdr /= Trailer then
return InvRec;
end if;
return OK;
end Space_Forward_1_Rec;
-- SpaceFwd advances the virtual tape by the specified amount (N.B. 0 means 1 whole file)
function Space_Forward (Img_Stream : in out Stream_Access; Num_Recs : in Integer) return Mt_Stat is
Simh_Stat : Mt_Stat := IOerr;
Done : Boolean := false;
Hdr, Trailer : Dword_T;
Rec_Cnt : Integer := Num_Recs;
begin
if Num_Recs = 0 then
-- one whole file
while not Done loop
Read_Meta_Data (Img_Stream , Hdr);
if Hdr = Mtr_Tmk then
Simh_Stat := OK;
Done := true;
else
-- read and discard 1 record
declare
Rec : Mt_Rec(1..Natural(Hdr));
begin
Read_Record_Data (Img_Stream , Natural(Hdr), Rec);
end;
-- check trailer
Read_Meta_Data (Img_Stream , Trailer);
if Hdr /= Trailer then
return InvRec;
end if;
end if;
end loop;
else
-- otherwise word count is a negative number and we space fwd that many records
while Rec_Cnt /= 0 loop
Rec_Cnt := Rec_Cnt + 1;
Simh_Stat := Space_Forward_1_Rec (Img_Stream);
if Simh_Stat /= OK then
return Simh_Stat;
end if;
end loop;
end if;
return Simh_Stat;
end Space_Forward;
-- Scan_Image - attempt to read a whole tape image ensuring headers, record sizes, and trailers match
-- TODO if csv is true then output is in CSV format
function Scan_Image (Img_Filename : in String) return String is
Result : Unbounded_String;
Img_File : File_Type;
Img_Stream : Stream_Access;
Hdr, Trailer : Dword_T;
File_Count : Integer := -1;
File_Size, Mark_Count, Record_Num : Integer := 0;
Dummy_Rec : Mt_Rec(1..32768);
begin
Open (File => Img_File, Mode => In_File, Name => Img_Filename);
Img_Stream := stream(Img_File);
Record_Loop :
loop
Read_Meta_Data (Img_Stream , Hdr);
case Hdr is
when Mtr_Tmk =>
if File_Size > 0 then
File_Count := File_Count + 1;
Result := Result & Dasher_NL & "File " & Integer'Image(File_Count) &
" : " & Integer'Image(File_Size) & " bytes in " &
Integer'Image(Record_Num) & " blocks";
File_Size := 0;
Record_Num := 0;
end if;
Mark_Count := Mark_Count + 1;
if Mark_Count = 3 then
Result := Result & Dasher_NL & "Triple Mark (old End-of-Tape indicator)";
exit Record_Loop;
end if;
when Mtr_EOM =>
Result := Result & Dasher_NL & "End of Medium";
exit Record_Loop;
when Mtr_Gap =>
Result := Result & Dasher_NL & "Erase Gap";
Mark_Count := 0;
when others =>
Record_Num := Record_Num + 1;
Mark_Count := 0;
Read_Record_Data (Img_Stream, Natural(Hdr), Dummy_Rec);
Read_Meta_Data (Img_Stream , Trailer);
if Hdr = Trailer then
File_Size := File_Size + Integer(Hdr);
else
Result := Result & Dasher_NL & "Non-matching trailer found.";
end if;
end case;
end loop Record_Loop;
Close (Img_File);
return To_String(Result);
end Scan_Image;
end Simh_Tapes;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
package AMF.Internals.Tables.DG_Metamodel is
pragma Preelaborate;
function MM_DG_DG return AMF.Internals.CMOF_Element;
function MC_DG_Close_Path return AMF.Internals.CMOF_Element;
function MC_DG_Cubic_Curve_To return AMF.Internals.CMOF_Element;
function MC_DG_Elliptical_Arc_To return AMF.Internals.CMOF_Element;
function MC_DG_Gradient_Stop return AMF.Internals.CMOF_Element;
function MC_DG_Line_To return AMF.Internals.CMOF_Element;
function MC_DG_Matrix return AMF.Internals.CMOF_Element;
function MC_DG_Move_To return AMF.Internals.CMOF_Element;
function MC_DG_Path_Command return AMF.Internals.CMOF_Element;
function MC_DG_Quadratic_Curve_To return AMF.Internals.CMOF_Element;
function MC_DG_Rotate return AMF.Internals.CMOF_Element;
function MC_DG_Scale return AMF.Internals.CMOF_Element;
function MC_DG_Skew return AMF.Internals.CMOF_Element;
function MC_DG_Transform return AMF.Internals.CMOF_Element;
function MC_DG_Translate return AMF.Internals.CMOF_Element;
function MP_DG_Cubic_Curve_To_End_Control return AMF.Internals.CMOF_Element;
function MP_DG_Cubic_Curve_To_Point return AMF.Internals.CMOF_Element;
function MP_DG_Cubic_Curve_To_Start_Control return AMF.Internals.CMOF_Element;
function MP_DG_Elliptical_Arc_To_Is_Large_Arc return AMF.Internals.CMOF_Element;
function MP_DG_Elliptical_Arc_To_Is_Sweep return AMF.Internals.CMOF_Element;
function MP_DG_Elliptical_Arc_To_Point return AMF.Internals.CMOF_Element;
function MP_DG_Elliptical_Arc_To_Radii return AMF.Internals.CMOF_Element;
function MP_DG_Elliptical_Arc_To_Rotation return AMF.Internals.CMOF_Element;
function MP_DG_Gradient_Stop_Color return AMF.Internals.CMOF_Element;
function MP_DG_Gradient_Stop_Offset return AMF.Internals.CMOF_Element;
function MP_DG_Gradient_Stop_Opacity return AMF.Internals.CMOF_Element;
function MP_DG_Line_To_Point return AMF.Internals.CMOF_Element;
function MP_DG_Matrix_A return AMF.Internals.CMOF_Element;
function MP_DG_Matrix_B return AMF.Internals.CMOF_Element;
function MP_DG_Matrix_C return AMF.Internals.CMOF_Element;
function MP_DG_Matrix_D return AMF.Internals.CMOF_Element;
function MP_DG_Matrix_E return AMF.Internals.CMOF_Element;
function MP_DG_Matrix_F return AMF.Internals.CMOF_Element;
function MP_DG_Move_To_Point return AMF.Internals.CMOF_Element;
function MP_DG_Path_Command_Is_Relative return AMF.Internals.CMOF_Element;
function MP_DG_Quadratic_Curve_To_Control return AMF.Internals.CMOF_Element;
function MP_DG_Quadratic_Curve_To_Point return AMF.Internals.CMOF_Element;
function MP_DG_Rotate_Angle return AMF.Internals.CMOF_Element;
function MP_DG_Rotate_Center return AMF.Internals.CMOF_Element;
function MP_DG_Scale_Factor_X return AMF.Internals.CMOF_Element;
function MP_DG_Scale_Factor_Y return AMF.Internals.CMOF_Element;
function MP_DG_Skew_Angle_X return AMF.Internals.CMOF_Element;
function MP_DG_Skew_Angle_Y return AMF.Internals.CMOF_Element;
function MP_DG_Translate_Delta_X return AMF.Internals.CMOF_Element;
function MP_DG_Translate_Delta_Y return AMF.Internals.CMOF_Element;
function MC_DG_Canvas return AMF.Internals.CMOF_Element;
function MC_DG_Circle return AMF.Internals.CMOF_Element;
function MC_DG_Clip_Path return AMF.Internals.CMOF_Element;
function MC_DG_Ellipse return AMF.Internals.CMOF_Element;
function MC_DG_Fill return AMF.Internals.CMOF_Element;
function MC_DG_Gradient return AMF.Internals.CMOF_Element;
function MC_DG_Graphical_Element return AMF.Internals.CMOF_Element;
function MC_DG_Group return AMF.Internals.CMOF_Element;
function MC_DG_Image return AMF.Internals.CMOF_Element;
function MC_DG_Line return AMF.Internals.CMOF_Element;
function MC_DG_Linear_Gradient return AMF.Internals.CMOF_Element;
function MC_DG_Marked_Element return AMF.Internals.CMOF_Element;
function MC_DG_Marker return AMF.Internals.CMOF_Element;
function MC_DG_Path return AMF.Internals.CMOF_Element;
function MC_DG_Pattern return AMF.Internals.CMOF_Element;
function MC_DG_Polygon return AMF.Internals.CMOF_Element;
function MC_DG_Polyline return AMF.Internals.CMOF_Element;
function MC_DG_Radial_Gradient return AMF.Internals.CMOF_Element;
function MC_DG_Rectangle return AMF.Internals.CMOF_Element;
function MC_DG_Style return AMF.Internals.CMOF_Element;
function MC_DG_Text return AMF.Internals.CMOF_Element;
function MP_DG_Canvas_Background_Color return AMF.Internals.CMOF_Element;
function MP_DG_Canvas_Background_Fill_A_Canvas return AMF.Internals.CMOF_Element;
function MP_DG_Canvas_Packaged_Fill_Fill_Canvas return AMF.Internals.CMOF_Element;
function MP_DG_Canvas_Packaged_Marker_Marker_Canvas return AMF.Internals.CMOF_Element;
function MP_DG_Canvas_Packaged_Style_A_Canvas return AMF.Internals.CMOF_Element;
function MP_DG_Circle_Center return AMF.Internals.CMOF_Element;
function MP_DG_Circle_Radius return AMF.Internals.CMOF_Element;
function MP_DG_Clip_Path_Clipped_Element_Graphical_Element_Clip_Path return AMF.Internals.CMOF_Element;
function MP_DG_Ellipse_Center return AMF.Internals.CMOF_Element;
function MP_DG_Ellipse_Radii return AMF.Internals.CMOF_Element;
function MP_DG_Fill_Canvas_Canvas_Packaged_Fill return AMF.Internals.CMOF_Element;
function MP_DG_Fill_Transform return AMF.Internals.CMOF_Element;
function MP_DG_Gradient_Stop return AMF.Internals.CMOF_Element;
function MP_DG_Graphical_Element_Clip_Path_Clip_Path_Clipped_Element return AMF.Internals.CMOF_Element;
function MP_DG_Graphical_Element_Group_Group_Member return AMF.Internals.CMOF_Element;
function MP_DG_Graphical_Element_Local_Style_A_Styled_Element return AMF.Internals.CMOF_Element;
function MP_DG_Graphical_Element_Shared_Style_A_Styled_Element return AMF.Internals.CMOF_Element;
function MP_DG_Graphical_Element_Transform return AMF.Internals.CMOF_Element;
function MP_DG_Group_Member_Graphical_Element_Group return AMF.Internals.CMOF_Element;
function MP_DG_Image_Bounds return AMF.Internals.CMOF_Element;
function MP_DG_Image_Is_Aspect_Ratio_Preserved return AMF.Internals.CMOF_Element;
function MP_DG_Image_Source return AMF.Internals.CMOF_Element;
function MP_DG_Line_End return AMF.Internals.CMOF_Element;
function MP_DG_Line_Start return AMF.Internals.CMOF_Element;
function MP_DG_Linear_Gradient_X1 return AMF.Internals.CMOF_Element;
function MP_DG_Linear_Gradient_X2 return AMF.Internals.CMOF_Element;
function MP_DG_Linear_Gradient_Y1 return AMF.Internals.CMOF_Element;
function MP_DG_Linear_Gradient_Y2 return AMF.Internals.CMOF_Element;
function MP_DG_Marked_Element_End_Marker_A_Marked_Element return AMF.Internals.CMOF_Element;
function MP_DG_Marked_Element_Mid_Marker_A_Marked_Element return AMF.Internals.CMOF_Element;
function MP_DG_Marked_Element_Start_Marker_A_Marked_Element return AMF.Internals.CMOF_Element;
function MP_DG_Marker_Canvas_Canvas_Packaged_Marker return AMF.Internals.CMOF_Element;
function MP_DG_Marker_Reference return AMF.Internals.CMOF_Element;
function MP_DG_Marker_Size return AMF.Internals.CMOF_Element;
function MP_DG_Path_Command return AMF.Internals.CMOF_Element;
function MP_DG_Pattern_Bounds return AMF.Internals.CMOF_Element;
function MP_DG_Pattern_Tile_A_Pattern return AMF.Internals.CMOF_Element;
function MP_DG_Polygon_Point return AMF.Internals.CMOF_Element;
function MP_DG_Polyline_Point return AMF.Internals.CMOF_Element;
function MP_DG_Radial_Gradient_Center_X return AMF.Internals.CMOF_Element;
function MP_DG_Radial_Gradient_Center_Y return AMF.Internals.CMOF_Element;
function MP_DG_Radial_Gradient_Focus_X return AMF.Internals.CMOF_Element;
function MP_DG_Radial_Gradient_Focus_Y return AMF.Internals.CMOF_Element;
function MP_DG_Radial_Gradient_Radius return AMF.Internals.CMOF_Element;
function MP_DG_Rectangle_Bounds return AMF.Internals.CMOF_Element;
function MP_DG_Rectangle_Corner_Radius return AMF.Internals.CMOF_Element;
function MP_DG_Style_Fill_A_Style return AMF.Internals.CMOF_Element;
function MP_DG_Style_Fill_Color return AMF.Internals.CMOF_Element;
function MP_DG_Style_Fill_Opacity return AMF.Internals.CMOF_Element;
function MP_DG_Style_Font_Bold return AMF.Internals.CMOF_Element;
function MP_DG_Style_Font_Color return AMF.Internals.CMOF_Element;
function MP_DG_Style_Font_Italic return AMF.Internals.CMOF_Element;
function MP_DG_Style_Font_Name return AMF.Internals.CMOF_Element;
function MP_DG_Style_Font_Size return AMF.Internals.CMOF_Element;
function MP_DG_Style_Font_Strike_Through return AMF.Internals.CMOF_Element;
function MP_DG_Style_Font_Underline return AMF.Internals.CMOF_Element;
function MP_DG_Style_Stroke_Color return AMF.Internals.CMOF_Element;
function MP_DG_Style_Stroke_Dash_Length return AMF.Internals.CMOF_Element;
function MP_DG_Style_Stroke_Opacity return AMF.Internals.CMOF_Element;
function MP_DG_Style_Stroke_Width return AMF.Internals.CMOF_Element;
function MP_DG_Text_Alignment return AMF.Internals.CMOF_Element;
function MP_DG_Text_Bounds return AMF.Internals.CMOF_Element;
function MP_DG_Text_Data return AMF.Internals.CMOF_Element;
function MP_DG_A_Pattern_Pattern_Tile return AMF.Internals.CMOF_Element;
function MP_DG_A_Canvas_Canvas_Packaged_Style return AMF.Internals.CMOF_Element;
function MP_DG_A_Marked_Element_Marked_Element_Start_Marker return AMF.Internals.CMOF_Element;
function MP_DG_A_Marked_Element_Marked_Element_End_Marker return AMF.Internals.CMOF_Element;
function MP_DG_A_Marked_Element_Marked_Element_Mid_Marker return AMF.Internals.CMOF_Element;
function MP_DG_A_Styled_Element_Graphical_Element_Local_Style return AMF.Internals.CMOF_Element;
function MP_DG_A_Style_Style_Fill return AMF.Internals.CMOF_Element;
function MP_DG_A_Styled_Element_Graphical_Element_Shared_Style return AMF.Internals.CMOF_Element;
function MP_DG_A_Canvas_Canvas_Background_Fill return AMF.Internals.CMOF_Element;
function MA_DG_Pattern_Tile_Pattern return AMF.Internals.CMOF_Element;
function MA_DG_Canvas_Packaged_Style_Canvas return AMF.Internals.CMOF_Element;
function MA_DG_Marked_Element_Start_Marker_Marked_Element return AMF.Internals.CMOF_Element;
function MA_DG_Marked_Element_End_Marker_Marked_Element return AMF.Internals.CMOF_Element;
function MA_DG_Group_Member_Group return AMF.Internals.CMOF_Element;
function MA_DG_Marked_Element_Mid_Marker_Marked_Element return AMF.Internals.CMOF_Element;
function MA_DG_Canvas_Packaged_Marker_Canvas return AMF.Internals.CMOF_Element;
function MA_DG_Graphical_Element_Clip_Path_Clipped_Element return AMF.Internals.CMOF_Element;
function MA_DG_Graphical_Element_Local_Style_Styled_Element return AMF.Internals.CMOF_Element;
function MA_DG_Canvas_Packaged_Fill_Canvas return AMF.Internals.CMOF_Element;
function MA_DG_Style_Fill_Style return AMF.Internals.CMOF_Element;
function MA_DG_Graphical_Element_Shared_Style_Styled_Element return AMF.Internals.CMOF_Element;
function MA_DG_Canvas_Background_Fill_Canvas return AMF.Internals.CMOF_Element;
function MB_DG return AMF.Internals.AMF_Element;
function ML_DG return AMF.Internals.AMF_Element;
private
Base : AMF.Internals.CMOF_Element := 0;
end AMF.Internals.Tables.DG_Metamodel;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with Definitions; use Definitions;
with HelperText;
private with Utilities;
package Parameters is
package HT renames HelperText;
no_ccache : constant String := "none";
no_unkindness : constant String := "none";
raven_confdir : constant String := host_localbase & "/etc/ravenadm";
type configuration_record is
record
profile : HT.Text;
dir_sysroot : HT.Text;
dir_toolchain : HT.Text;
dir_localbase : HT.Text;
dir_conspiracy : HT.Text;
dir_unkindness : HT.Text;
dir_distfiles : HT.Text;
dir_packages : HT.Text;
dir_ccache : HT.Text;
dir_buildbase : HT.Text;
dir_profile : HT.Text;
dir_logs : HT.Text;
dir_options : HT.Text;
num_builders : builders;
jobs_limit : builders;
avoid_tmpfs : Boolean;
defer_prebuilt : Boolean;
avec_ncurses : Boolean;
record_options : Boolean;
batch_mode : Boolean;
-- defaults
def_firebird : HT.Text;
def_lua : HT.Text;
def_mysql_group : HT.Text;
def_perl : HT.Text;
def_php : HT.Text;
def_postgresql : HT.Text;
def_python3 : HT.Text;
def_ruby : HT.Text;
def_ssl : HT.Text;
def_tcl_tk : HT.Text;
-- Computed, not saved
number_cores : cpu_range;
dir_repository : HT.Text;
sysroot_pkg8 : HT.Text;
end record;
configuration : configuration_record;
active_profile : HT.Text;
-- Gentoo linux puts chroot in /usr/bin when ever other system has the program or
-- a symlink at /usr/sbin. Precreate the longest string for the command.
chroot_cmd : String := "/usr/sbin/chroot ";
-- Return true if configuration file exists.
-- Reason: if it doesn't, we need to check privileges because root is needed
-- to pre-create the first version
function configuration_exists return Boolean;
-- This procedure will create a default configuration file if one
-- does not already exist, otherwise it will it load it. In every case,
-- the "configuration" record will be populated after this is run.
-- returns "True" on success
function load_configuration return Boolean;
-- Maybe a previously valid directory path has been removed. This
-- function returns true when all the paths still work.
-- The configuration must be loaded before it's run, of course.
function all_paths_valid (skip_mk_check : Boolean) return Boolean;
-- Return true if the localbase is set to someplace it really shouldn't be
function forbidden_localbase (candidate : String) return Boolean;
-- Return a profile record filled with dynamic defaults.
function default_profile (new_profile : String) return configuration_record;
-- Delete any existing profile data and create a new profile.
-- Typically a save operation follows.
procedure insert_profile (confrec : configuration_record);
-- Create or overwrite a complete ravenadm.ini file using internal data at IFM
procedure rewrite_configuration;
-- Return True if 3 or more sections exist (1 is global, the rest must be profiles)
function alternative_profiles_exist return Boolean;
-- Return a LF-delimited list of profiles contained in ravenadm.ini
function list_profiles return String;
-- Remove an entire profile from the configuration and save it.
procedure delete_profile (profile : String);
-- Updates master section with new profile name and initiates a transfer
procedure switch_profile (to_profile : String);
-- Returns SSL selection (converts "floating" to default)
function ssl_selection (confrec : in configuration_record) return String;
private
package UTL renames Utilities;
memory_probe : exception;
profile_DNE : exception;
memory_megs : Natural := 0;
-- Default Sizing by number of CPUS
-- 1 CPU :: 1 Builder, 1 job per builder
-- 2/3 CPU :: 2 builders, 2 jobs per builder
-- 4/5 CPU :: 3 builders, 3 jobs per builder
-- 6/7 CPU :: 4 builders, 3 jobs per builder
-- 8/9 CPU :: 6 builders, 4 jobs per builder
-- 10/11 CPU :: 8 builders, 4 jobs per builder
-- 12+ CPU :: floor (75% * CPU), 5 jobs per builder
Field_01 : constant String := "directory_sysroot";
Field_16 : constant String := "directory_toolchain";
Field_02 : constant String := "directory_localbase";
Field_03 : constant String := "directory_conspiracy";
Field_04 : constant String := "directory_unkindness";
Field_05 : constant String := "directory_distfiles";
Field_06 : constant String := "directory_profile";
Field_07 : constant String := "directory_packages";
Field_08 : constant String := "directory_ccache";
Field_09 : constant String := "directory_buildbase";
Field_10 : constant String := "number_of_builders";
Field_11 : constant String := "max_jobs_per_builder";
Field_12 : constant String := "avoid_tmpfs";
Field_13 : constant String := "leverage_prebuilt";
Field_14 : constant String := "display_with_ncurses";
Field_15 : constant String := "record_default_options";
Field_27 : constant String := "assume_default_options";
Field_17 : constant String := "default_firebird";
Field_18 : constant String := "default_lua";
Field_19 : constant String := "default_mysql_group";
Field_20 : constant String := "default_perl";
Field_21 : constant String := "default_php";
Field_22 : constant String := "default_postgresql";
Field_23 : constant String := "default_python3";
Field_24 : constant String := "default_ruby";
Field_25 : constant String := "default_ssl";
Field_26 : constant String := "default_tcl_tk";
global_01 : constant String := "profile_selected";
global_02 : constant String := "url_conspiracy";
first_profile : constant String := "primary";
master_section : constant String := "Global Configuration";
pri_packages : constant String := raven_var & "/[X]/packages";
pri_profile : constant String := raven_var & "/[X]";
pri_buildbase : constant String := raven_var & "/builders";
ravenadm_ini : constant String := "ravenadm.ini";
conf_location : constant String := raven_confdir & "/" & ravenadm_ini;
std_localbase : constant String := "/raven";
std_distfiles : constant String := raven_var & "/distfiles";
std_conspiracy : constant String := raven_var & "/conspiracy";
std_sysroot : constant String := std_localbase & "/share/raven/sysroot/" &
UTL.mixed_opsys (platform_type);
std_toolchain : constant String := std_localbase & "/share/raven/toolchain";
procedure query_physical_memory;
procedure query_physical_memory_linux;
procedure query_physical_memory_sunos;
function enough_memory (num_builders : builders) return Boolean;
procedure default_parallelism
(num_cores : cpu_range;
num_builders : out Integer;
jobs_per_builder : out Integer);
-- Copy from IFM to configuration record, updating type as necessary.
-- If values are missing, use default values.
-- If profile in global does not exist, throw exception
procedure transfer_configuration;
-- Determine and store number of cores. It's needed for dynamic configuration and
-- the value is used in the build cycle as well.
procedure set_cores;
-- Platform-specific routines to determine ncpu
function get_number_cpus return Positive;
-- Updates the global section to indicate active profile
procedure change_active_profile (new_active_profile : String);
-- Set chroot to /usr/bin/chroot if program is found
-- If not, chroot remains set to /usr/sbin/chroot
procedure set_chroot;
end Parameters;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with Ada.Characters.Wide_Wide_Latin_1;
with Ada.Containers.Ordered_Maps;
with Ada.Strings.Wide_Wide_Fixed;
package body XMLConf.Canonical_Writers is
use Ada.Characters.Wide_Wide_Latin_1;
use type League.Strings.Universal_String;
package Universal_String_Integer_Maps is
new Ada.Containers.Ordered_Maps
(League.Strings.Universal_String, Positive);
function Escape_Character_Data
(Item : League.Strings.Universal_String;
Version : XML_Version)
return League.Strings.Universal_String;
-- Escape character data according to canonical form representation.
-- '&', '<', '>' and '"' characters are replaced by general entity
-- reference; TAB, CR and LF characters are replaced by character
-- reference in hexadecimal format.
procedure Set_Version (Self : in out Canonical_Writer);
-- Sets version.
----------------
-- Characters --
----------------
overriding procedure Characters
(Self : in out Canonical_Writer;
Text : League.Strings.Universal_String;
Success : in out Boolean) is
begin
Self.Result.Append (Escape_Character_Data (Text, Self.Version));
end Characters;
-------------
-- End_DTD --
-------------
overriding procedure End_DTD
(Self : in out Canonical_Writer;
Success : in out Boolean)
is
procedure Output_Notation (Position : Notation_Maps.Cursor);
-- Outputs notation declaration.
---------------------
-- Output_Notation --
---------------------
procedure Output_Notation (Position : Notation_Maps.Cursor) is
Notation : constant Notation_Information
:= Notation_Maps.Element (Position);
begin
if Notation.Public_Id.Is_Empty then
Self.Result.Append
("<!NOTATION "
& Notation.Name
& " SYSTEM '"
& Notation.System_Id
& "'>"
& LF);
elsif Notation.System_Id.Is_Empty then
Self.Result.Append
("<!NOTATION "
& Notation.Name
& " PUBLIC '"
& Notation.Public_Id
& "'>"
& LF);
else
Self.Result.Append
("<!NOTATION "
& Notation.Name
& " PUBLIC '"
& Notation.Public_Id
& "' '"
& Notation.System_Id
& "'>"
& LF);
end if;
end Output_Notation;
begin
if not Self.Notations.Is_Empty then
Self.Result.Append ("<!DOCTYPE " & Self.Name & " [" & LF);
Self.Notations.Iterate (Output_Notation'Access);
Self.Result.Append
(League.Strings.To_Universal_String ("]>" & LF));
end if;
end End_DTD;
-----------------
-- End_Element --
-----------------
overriding procedure End_Element
(Self : in out Canonical_Writer;
Namespace_URI : League.Strings.Universal_String;
Local_Name : League.Strings.Universal_String;
Qualified_Name : League.Strings.Universal_String;
Success : in out Boolean) is
begin
Self.Result.Append ("</" & Qualified_Name & ">");
end End_Element;
------------------
-- Error_String --
------------------
overriding function Error_String
(Self : Canonical_Writer) return League.Strings.Universal_String is
begin
return League.Strings.Empty_Universal_String;
end Error_String;
---------------------------
-- Escape_Character_Data --
---------------------------
function Escape_Character_Data
(Item : League.Strings.Universal_String;
Version : XML_Version)
return League.Strings.Universal_String
is
Result : League.Strings.Universal_String := Item;
C : Wide_Wide_Character;
begin
for J in reverse 1 .. Item.Length loop
C := Result.Element (J).To_Wide_Wide_Character;
if C = '&' then
Result.Replace (J, J, "&");
elsif C = '<' then
Result.Replace (J, J, "<");
elsif C = '>' then
Result.Replace (J, J, ">");
elsif C = '"' then
Result.Replace (J, J, """);
else
case Version is
when Unspecified =>
raise Program_Error;
when XML_1_0 =>
if C = Wide_Wide_Character'Val (9) then
Result.Replace (J, J, "	");
elsif C = Wide_Wide_Character'Val (10) then
Result.Replace (J, J, " ");
elsif C = Wide_Wide_Character'Val (13) then
Result.Replace (J, J, " ");
end if;
when XML_1_1 =>
if C in Wide_Wide_Character'Val (16#01#)
.. Wide_Wide_Character'Val (16#1F#)
or C in Wide_Wide_Character'Val (16#7F#)
.. Wide_Wide_Character'Val (16#9F#)
then
Result.Replace
(J,
J,
"&#"
& Ada.Strings.Wide_Wide_Fixed.Trim
(Integer'Wide_Wide_Image
(Wide_Wide_Character'Pos (C)),
Ada.Strings.Both)
& ";");
end if;
end case;
end if;
end loop;
return Result;
end Escape_Character_Data;
--------------------------
-- Ignorable_Whitespace --
--------------------------
overriding procedure Ignorable_Whitespace
(Self : in out Canonical_Writer;
Text : League.Strings.Universal_String;
Success : in out Boolean) is
begin
Set_Version (Self);
Self.Result.Append (Escape_Character_Data (Text, Self.Version));
end Ignorable_Whitespace;
--------------------------
-- Notation_Declaration --
--------------------------
overriding procedure Notation_Declaration
(Self : in out Canonical_Writer;
Name : League.Strings.Universal_String;
Public_Id : League.Strings.Universal_String;
System_Id : League.Strings.Universal_String;
Success : in out Boolean) is
begin
Self.Notations.Insert (Name, (Name, Public_Id, System_Id));
end Notation_Declaration;
----------------------------
-- Processing_Instruction --
----------------------------
overriding procedure Processing_Instruction
(Self : in out Canonical_Writer;
Target : League.Strings.Universal_String;
Data : League.Strings.Universal_String;
Success : in out Boolean) is
begin
Set_Version (Self);
Self.Result.Append ("<?" & Target & " " & Data & "?>");
end Processing_Instruction;
--------------------------
-- Set_Document_Locator --
--------------------------
overriding procedure Set_Document_Locator
(Self : in out Canonical_Writer;
Locator : XML.SAX.Locators.SAX_Locator) is
begin
Self.Locator := Locator;
end Set_Document_Locator;
-----------------
-- Set_Version --
-----------------
procedure Set_Version (Self : in out Canonical_Writer) is
use League.Strings;
begin
if Self.Version = Unspecified then
if Self.Locator.Version = To_Universal_String ("1.0") then
Self.Version := XML_1_0;
elsif Self.Locator.Version = To_Universal_String ("1.1") then
-- Self.Result.Prepend ("<?xml version=""1.1""?>");
Self.Result := "<?xml version=""1.1""?>" & Self.Result;
Self.Version := XML_1_1;
else
raise Program_Error;
end if;
end if;
end Set_Version;
---------------
-- Start_DTD --
---------------
overriding procedure Start_DTD
(Self : in out Canonical_Writer;
Name : League.Strings.Universal_String;
Public_Id : League.Strings.Universal_String;
System_Id : League.Strings.Universal_String;
Success : in out Boolean) is
begin
Set_Version (Self);
Self.Name := Name;
end Start_DTD;
-------------------
-- Start_Element --
-------------------
overriding procedure Start_Element
(Self : in out Canonical_Writer;
Namespace_URI : League.Strings.Universal_String;
Local_Name : League.Strings.Universal_String;
Qualified_Name : League.Strings.Universal_String;
Attributes : XML.SAX.Attributes.SAX_Attributes;
Success : in out Boolean)
is
use League.Strings;
use Universal_String_Integer_Maps;
Map : Universal_String_Integer_Maps.Map;
Position : Universal_String_Integer_Maps.Cursor;
Index : Positive;
begin
Set_Version (Self);
Self.Result.Append ("<" & Qualified_Name);
for J in 1 .. Attributes.Length loop
Map.Insert (Attributes.Qualified_Name (J), J);
end loop;
Position := Map.First;
while Has_Element (Position) loop
Index := Element (Position);
Self.Result.Append
(" "
& Attributes.Qualified_Name (Index)
& "="""
& Escape_Character_Data (Attributes.Value (Index), Self.Version)
& '"');
Next (Position);
end loop;
Self.Result.Append ('>');
end Start_Element;
----------
-- Text --
----------
function Text
(Self : Canonical_Writer) return League.Strings.Universal_String is
begin
return Self.Result;
end Text;
end XMLConf.Canonical_Writers;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with
openGL.Renderer.lean,
mmi.World,
mmi.Sprite,
ada.Containers.Vectors,
ada.Containers.Hashed_Sets,
ada.Unchecked_Conversion;
package gasp.World
is
type Item is limited new mmi.World.item with private;
type View is access all item'Class;
package Forge
is
function new_World (Name : in String;
Renderer : in openGL.Renderer.lean.view) return View;
end Forge;
overriding
procedure destroy (Self : in out Item);
procedure free (Self : in out View);
procedure store (Self : in out Item);
procedure restore (Self : in out Item);
overriding
procedure evolve (Self : in out Item; By : in Duration);
function Pod (Self : in Item) return mmi.Sprite.view;
private
use type mmi.sprite_Id;
package sprite_id_Vectors is new ada.containers.Vectors (Positive, mmi.sprite_Id);
function Hash is new ada.Unchecked_Conversion (mmi.sprite_Id, ada.Containers.Hash_Type);
package organ_Sets is new ada.Containers.hashed_Sets (mmi.sprite_Id, Hash, "=");
type Item is limited new mmi.World.item with
record
Counter : Natural := 0;
pod_Sprite : mmi.Sprite.view;
end record;
end gasp.World;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
task Buffer is
entry Put (X : in Integer);
entry Get (X : out Integer);
end;
task body Buffer is
V: Integer;
begin
loop
accept Put (X : in Integer) do
Put_Line ("Requested put: " & Integer'Image (X));
V := X;
end Put;
if V = 0 then
exit;
end if;
delay 5.0; -- give time to other tasks
accept Get (X : out Integer) do
X := V;
Put_Line ("Requested get: " & Integer'Image (X));
end Get;
end loop;
end;
task E1;
task E2;
task body E1 is
P : Integer;
begin
Put_Line ("E1 puts 11...");
Buffer.Put (11);
delay 10.0;
Put_Line ("E1 getting...");
Buffer.Get (P);
Put_Line ("...E1 got " & Integer'Image (P));
end;
task body E2 is
P : Integer;
begin
delay 3.0;
-- a Put here would freeze because Buffer is executing the delay
-- and then expecting a Get. Hence, just get!
Buffer.Get (P);
Put_Line ("E2 gets " & Integer'Image (P));
Put_Line ("E2 puts 12...");
Buffer.Put (12);
Put_Line ("...E2 done");
end;
begin
Put_Line ("All set");
delay 16.0;
Buffer.Put (0);
Put_Line ("Stuck?");
end;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with Ada.Containers.Indefinite_Ordered_Maps;
with Ada.Containers.Ordered_Maps;
with Ada.Finalization;
generic
type Symbol_Type is private;
with function "<" (Left, Right : Symbol_Type) return Boolean is <>;
with procedure Put (Item : Symbol_Type);
type Symbol_Sequence is array (Positive range <>) of Symbol_Type;
type Frequency_Type is private;
with function "+" (Left, Right : Frequency_Type) return Frequency_Type
is <>;
with function "<" (Left, Right : Frequency_Type) return Boolean is <>;
package Huffman is
-- bits = booleans (true/false = 1/0)
type Bit_Sequence is array (Positive range <>) of Boolean;
Zero_Sequence : constant Bit_Sequence (1 .. 0) := (others => False);
-- output the sequence
procedure Put (Code : Bit_Sequence);
-- type for freqency map
package Frequency_Maps is new Ada.Containers.Ordered_Maps
(Element_Type => Frequency_Type,
Key_Type => Symbol_Type);
type Huffman_Tree is private;
-- create a huffman tree from frequency map
procedure Create_Tree
(Tree : out Huffman_Tree;
Frequencies : Frequency_Maps.Map);
-- encode a single symbol
function Encode
(Tree : Huffman_Tree;
Symbol : Symbol_Type)
return Bit_Sequence;
-- encode a symbol sequence
function Encode
(Tree : Huffman_Tree;
Symbols : Symbol_Sequence)
return Bit_Sequence;
-- decode a bit sequence
function Decode
(Tree : Huffman_Tree;
Code : Bit_Sequence)
return Symbol_Sequence;
-- dump the encoding table
procedure Dump_Encoding (Tree : Huffman_Tree);
private
-- type for encoding map
package Encoding_Maps is new Ada.Containers.Indefinite_Ordered_Maps
(Element_Type => Bit_Sequence,
Key_Type => Symbol_Type);
type Huffman_Node;
type Node_Access is access Huffman_Node;
-- a node is either internal (left_child/right_child used)
-- or a leaf (left_child/right_child are null)
type Huffman_Node is record
Frequency : Frequency_Type;
Left_Child : Node_Access := null;
Right_Child : Node_Access := null;
Symbol : Symbol_Type;
end record;
-- create a leaf node
function Create_Node
(Symbol : Symbol_Type;
Frequency : Frequency_Type)
return Node_Access;
-- create an internal node
function Create_Node (Left, Right : Node_Access) return Node_Access;
-- fill the encoding map
procedure Fill
(The_Node : Node_Access;
Map : in out Encoding_Maps.Map;
Prefix : Bit_Sequence);
-- huffman tree has a tree and an encoding map
type Huffman_Tree is new Ada.Finalization.Controlled with record
Tree : Node_Access := null;
Map : Encoding_Maps.Map := Encoding_Maps.Empty_Map;
end record;
-- free memory after finalization
overriding procedure Finalize (Object : in out Huffman_Tree);
end Huffman;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
private
with
openGL.Buffer.short_indices;
package openGL.Primitive.short_indexed
--
-- Provides a class for short indexed openGL primitives.
--
is
type Item is limited new Primitive.item with private;
subtype Class is Item'Class;
type View is access all Item'Class;
type Views is array (Index_t range <>) of View;
---------
-- Forge
--
function new_Primitive (Kind : in facet_Kind;
Indices : in openGL.short_Indices) return Primitive.short_indexed.view;
function new_Primitive (Kind : in facet_Kind;
Indices : in openGL.Indices) return Primitive.short_indexed.view;
function new_Primitive (Kind : in facet_Kind;
Indices : in openGL.long_Indices) return Primitive.short_indexed.view;
procedure define (Self : in out Item; Kind : in facet_Kind;
Indices : in openGL.short_Indices);
procedure define (Self : in out Item; Kind : in facet_Kind;
Indices : in openGL.Indices);
procedure define (Self : in out Item; Kind : in facet_Kind;
Indices : in openGL.long_Indices);
overriding
procedure destroy (Self : in out Item);
--------------
-- Attributes
--
procedure Indices_are (Self : in out Item; Now : in short_Indices);
procedure Indices_are (Self : in out Item; Now : in Indices);
procedure Indices_are (Self : in out Item; Now : in long_Indices);
--------------
-- Operations
--
overriding
procedure render (Self : in out Item);
private
type Item is limited new Primitive.item with
record
Indices : Buffer.short_indices.view;
end record;
end openGL.Primitive.short_indexed;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- copy and modify this specification, provided that if you redistribute a --
-- modified version, any changes that you have made are clearly indicated. --
-- --
------------------------------------------------------------------------------
with Ada.Numerics.Short_Complex_Types;
with Ada.Numerics.Generic_Complex_Elementary_Functions;
package Ada.Numerics.Short_Complex_Elementary_Functions is
new Ada.Numerics.Generic_Complex_Elementary_Functions
(Ada.Numerics.Short_Complex_Types);
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-----------------------------------------------------------------------
with Ada.Strings.Wide_Wide_Maps;
with Ada.Strings.Wide_Wide_Unbounded;
with Wiki.Documents;
with Wiki.Attributes;
with Wiki.Streams;
with Wiki.Strings;
-- === Wiki Renderer ===
-- The `Wiki_Renderer</tt> allows to render a wiki document into another wiki content.
-- The formatting rules are ignored except for the paragraphs and sections.
package Wiki.Render.Wiki is
use Standard.Wiki.Attributes;
-- ------------------------------
-- Wiki to HTML writer
-- ------------------------------
type Wiki_Renderer is new Renderer with private;
-- Set the output stream.
procedure Set_Output_Stream (Engine : in out Wiki_Renderer;
Stream : in Streams.Output_Stream_Access;
Format : in Wiki_Syntax);
-- Render the node instance from the document.
overriding
procedure Render (Engine : in out Wiki_Renderer;
Doc : in Documents.Document;
Node : in Nodes.Node_Type);
-- Add a section header in the document.
procedure Render_Header (Engine : in out Wiki_Renderer;
Header : in Wide_Wide_String;
Level : in Positive);
-- Add a paragraph (<p>). Close the previous paragraph if any.
-- The paragraph must be closed at the next paragraph or next header.
procedure Add_Paragraph (Engine : in out Wiki_Renderer);
-- Add a blockquote (<blockquote>). The level indicates the blockquote nested level.
-- The blockquote must be closed at the next header.
procedure Add_Blockquote (Engine : in out Wiki_Renderer;
Level : in Natural);
-- Add a list item (<li>). Close the previous paragraph and list item if any.
-- The list item will be closed at the next list item, next paragraph or next header.
procedure Add_List_Item (Engine : in out Wiki_Renderer;
Level : in Positive;
Ordered : in Boolean);
-- Render a link.
procedure Render_Link (Engine : in out Wiki_Renderer;
Name : in Strings.WString;
Attrs : in Attributes.Attribute_List);
-- Render an image.
procedure Render_Image (Engine : in out Wiki_Renderer;
Title : in Strings.WString;
Attrs : in Attributes.Attribute_List);
-- Render a quote.
procedure Render_Quote (Engine : in out Wiki_Renderer;
Title : in Strings.WString;
Attrs : in Attributes.Attribute_List);
-- Add a text block with the given format.
procedure Render_Text (Engine : in out Wiki_Renderer;
Text : in Wide_Wide_String;
Format : in Format_Map);
-- Render a text block that is pre-formatted.
procedure Render_Preformatted (Engine : in out Wiki_Renderer;
Text : in Strings.WString;
Format : in Strings.WString);
procedure Render_Tag (Engine : in out Wiki_Renderer;
Doc : in Documents.Document;
Node : in Nodes.Node_Type);
-- Finish the document after complete wiki text has been parsed.
procedure Finish (Engine : in out Wiki_Renderer;
Doc : in Documents.Document);
-- Set the text style format.
procedure Set_Format (Engine : in out Wiki_Renderer;
Format : in Format_Map);
private
use Ada.Strings.Wide_Wide_Unbounded;
type Wide_String_Access is access constant Wide_Wide_String;
type Wiki_Tag_Type is (Header_Start, Header_End,
Img_Start, Img_End,
Link_Start, Link_End, Link_Separator,
Quote_Start, Quote_End, Quote_Separator,
Preformat_Start, Preformat_End,
List_Start, List_Item, List_Ordered_Item,
Line_Break, Escape_Rule,
Horizontal_Rule,
Blockquote_Start, Blockquote_End);
type Wiki_Tag_Array is array (Wiki_Tag_Type) of Wide_String_Access;
type Wiki_Format_Array is array (Format_Type) of Wide_String_Access;
procedure Write_Optional_Space (Engine : in out Wiki_Renderer);
-- Emit a new line.
procedure New_Line (Engine : in out Wiki_Renderer;
Optional : in Boolean := False);
procedure Need_Separator_Line (Engine : in out Wiki_Renderer);
procedure Close_Paragraph (Engine : in out Wiki_Renderer);
procedure Start_Keep_Content (Engine : in out Wiki_Renderer);
type List_Style_Array is array (1 .. 32) of Boolean;
EMPTY_TAG : aliased constant Wide_Wide_String := "";
type Wiki_Renderer is new Renderer with record
Output : Streams.Output_Stream_Access := null;
Syntax : Wiki_Syntax := SYNTAX_CREOLE;
Format : Format_Map := (others => False);
Tags : Wiki_Tag_Array := (others => EMPTY_TAG'Access);
Style_Start_Tags : Wiki_Format_Array := (others => EMPTY_TAG'Access);
Style_End_Tags : Wiki_Format_Array := (others => EMPTY_TAG'Access);
Escape_Set : Ada.Strings.Wide_Wide_Maps.Wide_Wide_Character_Set;
Has_Paragraph : Boolean := False;
Has_Item : Boolean := False;
Need_Paragraph : Boolean := False;
Need_Newline : Boolean := False;
Need_Space : Boolean := False;
Empty_Line : Boolean := True;
Empty_Previous_Line : Boolean := True;
Keep_Content : Natural := 0;
In_List : Boolean := False;
Invert_Header_Level : Boolean := False;
Allow_Link_Language : Boolean := False;
Link_First : Boolean := False;
Html_Blockquote : Boolean := False;
Line_Count : Natural := 0;
Current_Level : Natural := 0;
Quote_Level : Natural := 0;
UL_List_Level : Natural := 0;
OL_List_Level : Natural := 0;
Current_Style : Format_Map := (others => False);
Content : Unbounded_Wide_Wide_String;
Link_Href : Unbounded_Wide_Wide_String;
Link_Title : Unbounded_Wide_Wide_String;
Link_Lang : Unbounded_Wide_Wide_String;
end record;
end Wiki.Render.Wiki;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- in a product, an acknowledgment in the product documentation would be
-- appreciated but is not required.
--
-- 2. Altered source versions must be plainly marked as such, and must not be
-- misrepresented as being the original software.
--
-- 3. This notice may not be removed or altered from any source
-- distribution.
--------------------------------------------------------------------------------------------------------------------
with Interfaces.C;
package body SDL.CPUS is
package C renames Interfaces.C;
function Count return Positive is
function SDL_Get_CPU_Count return C.int with
Import => True,
Convention => C,
External_Name => "SDL_GetCPUCount";
begin
return Positive (SDL_Get_CPU_Count);
end Count;
function Cache_Line_Size return Positive is
function SDL_Cache_Line_Size return C.int with
Import => True,
Convention => C,
External_Name => "SDL_GetCPUCacheLineSize";
begin
return Positive (SDL_Cache_Line_Size);
end Cache_Line_Size;
function Has_3DNow return Boolean is
function SDL_Has_3DNow return C.int with
Import => True,
Convention => C,
External_Name => "SDL_Has3DNow";
begin
return (if SDL_Has_3DNow = 1 then True else False);
end Has_3DNow;
function Has_AltiVec return Boolean is
function SDL_Has_AltiVec return C.int with
Import => True,
Convention => C,
External_Name => "SDL_HasAltiVec";
begin
return (if SDL_Has_AltiVec = 1 then True else False);
end Has_AltiVec;
function Has_MMX return Boolean is
function SDL_Has_MMX return C.int with
Import => True,
Convention => C,
External_Name => "SDL_HasMMX";
begin
return (if SDL_Has_MMX = 1 then True else False);
end Has_MMX;
function Has_RDTSC return Boolean is
function SDL_Has_RDTSC return C.int with
Import => True,
Convention => C,
External_Name => "SDL_HasRDTSC";
begin
return (if SDL_Has_RDTSC = 1 then True else False);
end Has_RDTSC;
function Has_SSE return Boolean is
function SDL_Has_SSE return C.int with
Import => True,
Convention => C,
External_Name => "SDL_HasSSE";
begin
return (if SDL_Has_SSE = 1 then True else False);
end Has_SSE;
function Has_SSE_2 return Boolean is
function SDL_Has_SSE_2 return C.int with
Import => True,
Convention => C,
External_Name => "SDL_HasSSE2";
begin
return (if SDL_Has_SSE_2 = 1 then True else False);
end Has_SSE_2;
function Has_SSE_3 return Boolean is
function SDL_Has_SSE_3 return C.int with
Import => True,
Convention => C,
External_Name => "SDL_HasSSE3";
begin
return (if SDL_Has_SSE_3 = 1 then True else False);
end Has_SSE_3;
function Has_SSE_4_1 return Boolean is
function SDL_Has_SSE_4_1 return C.int with
Import => True,
Convention => C,
External_Name => "SDL_HasSSE41";
begin
return (if SDL_Has_SSE_4_1 = 1 then True else False);
end Has_SSE_4_1;
function Has_SSE_4_2 return Boolean is
function SDL_Has_SSE_4_2 return C.int with
Import => True,
Convention => C,
External_Name => "SDL_HasSSE42";
begin
return (if SDL_Has_SSE_4_2 = 1 then True else False);
end Has_SSE_4_2;
end SDL.CPUS;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-------------------------------------------------------------
with Program.Elements.Type_Definitions;
with Program.Lexical_Elements;
with Program.Elements.Expressions;
with Program.Elements.Definitions;
package Program.Elements.Derived_Record_Extensions is
pragma Pure (Program.Elements.Derived_Record_Extensions);
type Derived_Record_Extension is
limited interface and Program.Elements.Type_Definitions.Type_Definition;
type Derived_Record_Extension_Access is
access all Derived_Record_Extension'Class with Storage_Size => 0;
not overriding function Parent
(Self : Derived_Record_Extension)
return not null Program.Elements.Expressions.Expression_Access
is abstract;
not overriding function Progenitors
(Self : Derived_Record_Extension)
return Program.Elements.Expressions.Expression_Vector_Access is abstract;
not overriding function Record_Definition
(Self : Derived_Record_Extension)
return not null Program.Elements.Definitions.Definition_Access
is abstract;
not overriding function Has_Abstract
(Self : Derived_Record_Extension)
return Boolean is abstract;
not overriding function Has_Limited
(Self : Derived_Record_Extension)
return Boolean is abstract;
type Derived_Record_Extension_Text is limited interface;
type Derived_Record_Extension_Text_Access is
access all Derived_Record_Extension_Text'Class with Storage_Size => 0;
not overriding function To_Derived_Record_Extension_Text
(Self : aliased in out Derived_Record_Extension)
return Derived_Record_Extension_Text_Access is abstract;
not overriding function Abstract_Token
(Self : Derived_Record_Extension_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function Limited_Token
(Self : Derived_Record_Extension_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function New_Token
(Self : Derived_Record_Extension_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function And_Token
(Self : Derived_Record_Extension_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function With_Token
(Self : Derived_Record_Extension_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
end Program.Elements.Derived_Record_Extensions;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-----------------------------------------------------------------------
with AWA.Events.Action_Method;
package body AWA.Jobs.Beans is
package Execute_Binding is
new AWA.Events.Action_Method.Bind (Bean => Process_Bean,
Method => Execute,
Name => "execute");
Process_Binding : aliased constant Util.Beans.Methods.Method_Binding_Array
:= (1 => Execute_Binding.Proxy'Access);
-- ------------------------------
-- Get the value identified by the name.
-- ------------------------------
overriding
function Get_Value (From : in Process_Bean;
Name : in String) return Util.Beans.Objects.Object is
begin
return AWA.Jobs.Services.Get_Parameter (From.Job, Name);
end Get_Value;
-- ------------------------------
-- Set the value identified by the name.
-- ------------------------------
overriding
procedure Set_Value (From : in out Process_Bean;
Name : in String;
Value : in Util.Beans.Objects.Object) is
begin
null;
end Set_Value;
-- ------------------------------
-- This bean provides some methods that can be used in a Method_Expression
-- ------------------------------
overriding
function Get_Method_Bindings (From : in Process_Bean)
return Util.Beans.Methods.Method_Binding_Array_Access is
pragma Unreferenced (From);
begin
return Process_Binding'Access;
end Get_Method_Bindings;
-- ------------------------------
-- Execute the job described by the event.
-- ------------------------------
procedure Execute (Bean : in out Process_Bean;
Event : in AWA.Events.Module_Event'Class) is
begin
AWA.Jobs.Services.Execute (Event, Bean.Job);
end Execute;
-- ------------------------------
-- Create the job process bean instance.
-- ------------------------------
function Create_Process_Bean (Module : in AWA.Jobs.Modules.Job_Module_Access)
return Util.Beans.Basic.Readonly_Bean_Access is
Result : constant Process_Bean_Access := new Process_Bean;
begin
Result.Module := Module;
return Result.all'Access;
end Create_Process_Bean;
end AWA.Jobs.Beans;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
--
with GNAT.Source_Info;
with HW.Time;
with HW.Debug;
with HW.GFX.GMA.Config;
with HW.GFX.GMA.Registers;
package body HW.GFX.GMA.Power_And_Clocks_Haswell is
PWR_WELL_CTL_ENABLE_REQUEST : constant := 1 * 2 ** 31;
PWR_WELL_CTL_DISABLE_REQUEST : constant := 0 * 2 ** 31;
PWR_WELL_CTL_STATE_ENABLED : constant := 1 * 2 ** 30;
----------------------------------------------------------------------------
SRD_CTL_ENABLE : constant := 1 * 2 ** 31;
SRD_STATUS_STATE_MASK : constant := 7 * 2 ** 29;
type Pipe is (EDP, A, B, C);
type SRD_Regs is record
CTL : Registers.Registers_Index;
STATUS : Registers.Registers_Index;
end record;
type SRD_Per_Pipe_Regs is array (Pipe) of SRD_Regs;
SRD : constant SRD_Per_Pipe_Regs := SRD_Per_Pipe_Regs'
(A => SRD_Regs'
(CTL => Registers.SRD_CTL_A,
STATUS => Registers.SRD_STATUS_A),
B => SRD_Regs'
(CTL => Registers.SRD_CTL_B,
STATUS => Registers.SRD_STATUS_B),
C => SRD_Regs'
(CTL => Registers.SRD_CTL_C,
STATUS => Registers.SRD_STATUS_C),
EDP => SRD_Regs'
(CTL => Registers.SRD_CTL_EDP,
STATUS => Registers.SRD_STATUS_EDP));
----------------------------------------------------------------------------
IPS_CTL_ENABLE : constant := 1 * 2 ** 31;
DISPLAY_IPS_CONTROL : constant := 16#19#;
GT_MAILBOX_READY : constant := 1 * 2 ** 31;
----------------------------------------------------------------------------
procedure PSR_Off
is
Enabled : Boolean;
begin
pragma Debug (Debug.Put_Line (GNAT.Source_Info.Enclosing_Entity));
if Config.Has_Per_Pipe_SRD then
for P in Pipe loop
Registers.Is_Set_Mask (SRD (P).CTL, SRD_CTL_ENABLE, Enabled);
if Enabled then
Registers.Unset_Mask (SRD (P).CTL, SRD_CTL_ENABLE);
Registers.Wait_Unset_Mask (SRD (P).STATUS, SRD_STATUS_STATE_MASK);
pragma Debug (Debug.Put_Line ("Disabled PSR."));
end if;
end loop;
else
Registers.Is_Set_Mask (Registers.SRD_CTL, SRD_CTL_ENABLE, Enabled);
if Enabled then
Registers.Unset_Mask (Registers.SRD_CTL, SRD_CTL_ENABLE);
Registers.Wait_Unset_Mask (Registers.SRD_STATUS, SRD_STATUS_STATE_MASK);
pragma Debug (Debug.Put_Line ("Disabled PSR."));
end if;
end if;
end PSR_Off;
----------------------------------------------------------------------------
procedure GT_Mailbox_Write (MBox : Word32; Value : Word32) is
begin
pragma Debug (Debug.Put_Line (GNAT.Source_Info.Enclosing_Entity));
Registers.Wait_Unset_Mask (Registers.GT_MAILBOX, GT_MAILBOX_READY);
Registers.Write (Registers.GT_MAILBOX_DATA, Value);
Registers.Write (Registers.GT_MAILBOX, GT_MAILBOX_READY or MBox);
Registers.Wait_Unset_Mask (Registers.GT_MAILBOX, GT_MAILBOX_READY);
Registers.Write (Registers.GT_MAILBOX_DATA, 0);
end GT_Mailbox_Write;
procedure IPS_Off
is
Enabled : Boolean;
begin
pragma Debug (Debug.Put_Line (GNAT.Source_Info.Enclosing_Entity));
if Config.Has_IPS then
Registers.Is_Set_Mask (Registers.IPS_CTL, IPS_CTL_ENABLE, Enabled);
if Enabled then
if Config.Has_IPS_CTL_Mailbox then
GT_Mailbox_Write (DISPLAY_IPS_CONTROL, 0);
Registers.Wait_Unset_Mask
(Register => Registers.IPS_CTL,
Mask => IPS_CTL_ENABLE,
TOut_MS => 42);
else
Registers.Unset_Mask (Registers.IPS_CTL, IPS_CTL_ENABLE);
end if;
pragma Debug (Debug.Put_Line ("Disabled IPS."));
-- We have to wait until the next vblank here.
-- 20ms should be enough.
Time.M_Delay (20);
end if;
end if;
end IPS_Off;
----------------------------------------------------------------------------
procedure PDW_Off
is
Ctl1, Ctl2, Ctl3, Ctl4 : Word32;
begin
pragma Debug (Debug.Put_Line (GNAT.Source_Info.Enclosing_Entity));
Registers.Read (Registers.PWR_WELL_CTL_BIOS, Ctl1);
Registers.Read (Registers.PWR_WELL_CTL_DRIVER, Ctl2);
Registers.Read (Registers.PWR_WELL_CTL_KVMR, Ctl3);
Registers.Read (Registers.PWR_WELL_CTL_DEBUG, Ctl4);
pragma Debug (Registers.Posting_Read (Registers.PWR_WELL_CTL5)); -- Result for debugging only
pragma Debug (Registers.Posting_Read (Registers.PWR_WELL_CTL6)); -- Result for debugging only
if ((Ctl1 or Ctl2 or Ctl3 or Ctl4) and
PWR_WELL_CTL_ENABLE_REQUEST) /= 0
then
Registers.Wait_Set_Mask
(Registers.PWR_WELL_CTL_DRIVER, PWR_WELL_CTL_STATE_ENABLED);
end if;
if (Ctl1 and PWR_WELL_CTL_ENABLE_REQUEST) /= 0 then
Registers.Write (Registers.PWR_WELL_CTL_BIOS, PWR_WELL_CTL_DISABLE_REQUEST);
end if;
if (Ctl2 and PWR_WELL_CTL_ENABLE_REQUEST) /= 0 then
Registers.Write (Registers.PWR_WELL_CTL_DRIVER, PWR_WELL_CTL_DISABLE_REQUEST);
end if;
end PDW_Off;
procedure PDW_On
is
Ctl1, Ctl2, Ctl3, Ctl4 : Word32;
begin
pragma Debug (Debug.Put_Line (GNAT.Source_Info.Enclosing_Entity));
Registers.Read (Registers.PWR_WELL_CTL_BIOS, Ctl1);
Registers.Read (Registers.PWR_WELL_CTL_DRIVER, Ctl2);
Registers.Read (Registers.PWR_WELL_CTL_KVMR, Ctl3);
Registers.Read (Registers.PWR_WELL_CTL_DEBUG, Ctl4);
pragma Debug (Registers.Posting_Read (Registers.PWR_WELL_CTL5)); -- Result for debugging only
pragma Debug (Registers.Posting_Read (Registers.PWR_WELL_CTL6)); -- Result for debugging only
if ((Ctl1 or Ctl2 or Ctl3 or Ctl4) and
PWR_WELL_CTL_ENABLE_REQUEST) = 0
then
Registers.Wait_Unset_Mask
(Registers.PWR_WELL_CTL_DRIVER, PWR_WELL_CTL_STATE_ENABLED);
end if;
if (Ctl2 and PWR_WELL_CTL_ENABLE_REQUEST) = 0 then
Registers.Write (Registers.PWR_WELL_CTL_DRIVER, PWR_WELL_CTL_ENABLE_REQUEST);
Registers.Wait_Set_Mask
(Registers.PWR_WELL_CTL_DRIVER, PWR_WELL_CTL_STATE_ENABLED);
end if;
end PDW_On;
function Need_PDW (Checked_Configs : Pipe_Configs) return Boolean
is
Primary : Pipe_Config renames Checked_Configs (GMA.Primary);
begin
return
(Config.Use_PDW_For_EDP_Scaling and then
(Primary.Port = Internal and Requires_Scaling (Primary)))
or
(Primary.Port /= Disabled and Primary.Port /= Internal)
or
Checked_Configs (Secondary).Port /= Disabled
or
Checked_Configs (Tertiary).Port /= Disabled;
end Need_PDW;
----------------------------------------------------------------------------
procedure Pre_All_Off is
begin
-- HSW: disable panel self refresh (PSR) on eDP if enabled
-- wait for PSR idling
PSR_Off;
IPS_Off;
end Pre_All_Off;
procedure Initialize is
begin
-- HSW: disable power down well
PDW_Off;
Config.Raw_Clock := Config.Default_RawClk_Freq;
end Initialize;
procedure Power_Set_To (Configs : Pipe_Configs) is
begin
if Need_PDW (Configs) then
PDW_On;
else
PDW_Off;
end if;
end Power_Set_To;
procedure Power_Up (Old_Configs, New_Configs : Pipe_Configs) is
begin
if not Need_PDW (Old_Configs) and Need_PDW (New_Configs) then
PDW_On;
end if;
end Power_Up;
procedure Power_Down (Old_Configs, Tmp_Configs, New_Configs : Pipe_Configs)
is
begin
if (Need_PDW (Old_Configs) or Need_PDW (Tmp_Configs)) and
not Need_PDW (New_Configs)
then
PDW_Off;
end if;
end Power_Down;
end HW.GFX.GMA.Power_And_Clocks_Haswell;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-----------------------------------------------------------------------
with Interfaces;
with Util.Log.Loggers;
with Keystore.Logs;
with Keystore.Repository.Workers;
-- === Data Block ===
--
-- Data block start is encrypted with wallet data key, data fragments are
-- encrypted with their own key. Loading and saving data blocks occurs exclusively
-- from the workers package. The data block can be stored in a separate file so that
-- the wallet repository and its keys are separate from the data blocks.
--
-- ```
-- +------------------+
-- | 03 03 | 2b
-- | Encrypt size | 2b = DATA_ENTRY_SIZE * Nb data fragment
-- | Wallet id | 4b
-- | PAD 0 | 4b
-- | PAD 0 | 4b
-- +------------------+-----
-- | Entry ID | 4b Encrypted with wallet id
-- | Slot size | 2b
-- | 0 0 | 2b
-- | Data offset | 8b
-- | Content HMAC-256 | 32b => 48b = DATA_ENTRY_SIZE
-- +------------------+
-- | ... |
-- +------------------+-----
-- | ... |
-- +------------------+
-- | Data content | Encrypted with data entry key
-- +------------------+-----
-- | Block HMAC-256 | 32b
-- +------------------+
-- ```
--
package body Keystore.Repository.Data is
use type Interfaces.Unsigned_64;
use type Keystore.Repository.Workers.Data_Work_Access;
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("Keystore.Repository.Data");
-- ------------------------------
-- Find the data block to hold a new data entry that occupies the given space.
-- The first data block that has enough space is used otherwise a new block
-- is allocated and initialized.
-- ------------------------------
procedure Allocate_Data_Block (Manager : in out Wallet_Repository;
Space : in IO.Block_Index;
Work : in Workers.Data_Work_Access) is
pragma Unreferenced (Space);
begin
Manager.Stream.Allocate (IO.DATA_BLOCK, Work.Data_Block);
Work.Data_Need_Setup := True;
Logs.Debug (Log, "Allocated data block{0}", Work.Data_Block);
end Allocate_Data_Block;
-- ------------------------------
-- Write the data in one or several blocks.
-- ------------------------------
procedure Add_Data (Manager : in out Wallet_Repository;
Iterator : in out Keys.Data_Key_Iterator;
Content : in Ada.Streams.Stream_Element_Array;
Offset : in out Interfaces.Unsigned_64) is
Size : IO.Buffer_Size;
Input_Pos : Stream_Element_Offset := Content'First;
Data_Offset : Stream_Element_Offset := Stream_Element_Offset (Offset);
Work : Workers.Data_Work_Access;
begin
Workers.Initialize_Queue (Manager);
while Input_Pos <= Content'Last loop
-- Get a data work instance or flush pending works to make one available.
Workers.Allocate_Work (Manager, Workers.DATA_ENCRYPT, null, Iterator, Work);
Workers.Fill (Work.all, Content, Input_Pos, Size);
if Size = 0 then
Workers.Put_Work (Manager.Workers.all, Work);
Work := null;
exit;
end if;
Allocate_Data_Block (Manager, Size, Work);
Keys.Allocate_Key_Slot (Manager, Iterator, Work.Data_Block, Size,
Work.Key_Pos, Work.Key_Block.Buffer.Block);
Work.Key_Block.Buffer := Iterator.Current.Buffer;
Workers.Queue_Cipher_Work (Manager, Work);
Work := null;
-- Move on to what remains.
Data_Offset := Data_Offset + Size;
Input_Pos := Input_Pos + Size;
end loop;
Offset := Interfaces.Unsigned_64 (Data_Offset);
Workers.Flush_Queue (Manager, null);
exception
when E : others =>
Log.Error ("Exception while encrypting data: ", E);
if Work /= null then
Workers.Put_Work (Manager.Workers.all, Work);
end if;
Workers.Flush_Queue (Manager, null);
raise;
end Add_Data;
-- ------------------------------
-- Write the data in one or several blocks.
-- ------------------------------
procedure Add_Data (Manager : in out Wallet_Repository;
Iterator : in out Keys.Data_Key_Iterator;
Content : in out Util.Streams.Input_Stream'Class;
Offset : in out Interfaces.Unsigned_64) is
Size : IO.Buffer_Size;
Data_Offset : Stream_Element_Offset := Stream_Element_Offset (Offset);
Work : Workers.Data_Work_Access;
begin
Workers.Initialize_Queue (Manager);
loop
-- Get a data work instance or flush pending works to make one available.
Workers.Allocate_Work (Manager, Workers.DATA_ENCRYPT, null, Iterator, Work);
-- Fill the work buffer by reading the stream.
Workers.Fill (Work.all, Content, DATA_MAX_SIZE, Size);
if Size = 0 then
Workers.Put_Work (Manager.Workers.all, Work);
exit;
end if;
Allocate_Data_Block (Manager, DATA_MAX_SIZE, Work);
Keys.Allocate_Key_Slot (Manager, Iterator, Work.Data_Block, Size,
Work.Key_Pos, Work.Key_Block.Buffer.Block);
Work.Key_Block.Buffer := Iterator.Current.Buffer;
Workers.Queue_Cipher_Work (Manager, Work);
-- Move on to what remains.
Data_Offset := Data_Offset + Size;
end loop;
Offset := Interfaces.Unsigned_64 (Data_Offset);
Workers.Flush_Queue (Manager, null);
exception
when E : others =>
Log.Error ("Exception while encrypting data: ", E);
Workers.Flush_Queue (Manager, null);
raise;
end Add_Data;
procedure Update_Data (Manager : in out Wallet_Repository;
Iterator : in out Keys.Data_Key_Iterator;
Content : in Ada.Streams.Stream_Element_Array;
Last_Pos : out Ada.Streams.Stream_Element_Offset;
Offset : in out Interfaces.Unsigned_64) is
Size : Stream_Element_Offset;
Input_Pos : Stream_Element_Offset := Content'First;
Work : Workers.Data_Work_Access;
Data_Offset : Stream_Element_Offset := Stream_Element_Offset (Offset);
begin
Workers.Initialize_Queue (Manager);
Keys.Next_Data_Key (Manager, Iterator);
while Input_Pos <= Content'Last and Keys.Has_Data_Key (Iterator) loop
Workers.Allocate_Work (Manager, Workers.DATA_ENCRYPT, null, Iterator, Work);
Size := Content'Last - Input_Pos + 1;
if Size > DATA_MAX_SIZE then
Size := DATA_MAX_SIZE;
end if;
if Size > AES_Align (Iterator.Data_Size) then
Size := AES_Align (Iterator.Data_Size);
end if;
Work.Buffer_Pos := 1;
Work.Last_Pos := Size;
Work.Data (1 .. Size) := Content (Input_Pos .. Input_Pos + Size - 1);
Keys.Update_Key_Slot (Manager, Iterator, Size);
Work.Key_Block.Buffer := Iterator.Current.Buffer;
-- Run the encrypt data work either through work manager or through current task.
Workers.Queue_Cipher_Work (Manager, Work);
Input_Pos := Input_Pos + Size;
Data_Offset := Data_Offset + Size;
exit when Input_Pos > Content'Last;
Keys.Next_Data_Key (Manager, Iterator);
end loop;
Workers.Flush_Queue (Manager, null);
Offset := Interfaces.Unsigned_64 (Data_Offset);
Last_Pos := Input_Pos;
if Input_Pos <= Content'Last then
Keys.Prepare_Append (Iterator);
end if;
exception
when E : others =>
Log.Error ("Exception while encrypting data: ", E);
Workers.Flush_Queue (Manager, null);
raise;
end Update_Data;
procedure Update_Data (Manager : in out Wallet_Repository;
Iterator : in out Keys.Data_Key_Iterator;
Content : in out Util.Streams.Input_Stream'Class;
End_Of_Stream : out Boolean;
Offset : in out Interfaces.Unsigned_64) is
Work : Workers.Data_Work_Access;
Size : IO.Buffer_Size := 0;
Data_Offset : Stream_Element_Offset := Stream_Element_Offset (Offset);
Mark : Keys.Data_Key_Marker;
begin
Workers.Initialize_Queue (Manager);
Keys.Mark_Data_Key (Iterator, Mark);
Keys.Next_Data_Key (Manager, Iterator);
while Keys.Has_Data_Key (Iterator) loop
Workers.Allocate_Work (Manager, Workers.DATA_ENCRYPT, null, Iterator, Work);
-- Fill the work buffer by reading the stream.
Workers.Fill (Work.all, Content, AES_Align (Iterator.Data_Size), Size);
if Size = 0 then
Workers.Put_Work (Manager.Workers.all, Work);
Delete_Data (Manager, Iterator, Mark);
exit;
end if;
Keys.Update_Key_Slot (Manager, Iterator, Size);
Work.Key_Block.Buffer := Iterator.Current.Buffer;
-- Run the encrypt data work either through work manager or through current task.
Workers.Queue_Cipher_Work (Manager, Work);
Data_Offset := Data_Offset + Size;
Keys.Mark_Data_Key (Iterator, Mark);
Keys.Next_Data_Key (Manager, Iterator);
end loop;
Workers.Flush_Queue (Manager, null);
Offset := Interfaces.Unsigned_64 (Data_Offset);
End_Of_Stream := Size = 0;
if not End_Of_Stream then
Keys.Prepare_Append (Iterator);
end if;
exception
when E : others =>
Log.Error ("Exception while encrypting data: ", E);
Workers.Flush_Queue (Manager, null);
raise;
end Update_Data;
-- ------------------------------
-- Erase the data fragments starting at the key iterator current position.
-- ------------------------------
procedure Delete_Data (Manager : in out Wallet_Repository;
Iterator : in out Keys.Data_Key_Iterator;
Mark : in out Keys.Data_Key_Marker) is
Work : Workers.Data_Work_Access;
begin
while Keys.Has_Data_Key (Iterator) loop
Workers.Allocate_Work (Manager, Workers.DATA_RELEASE, null, Iterator, Work);
-- Run the delete data work either through work manager or through current task.
Workers.Queue_Delete_Work (Manager, Work);
-- When the last data block was processed, erase the data key.
if Keys.Is_Last_Key (Iterator) then
Keys.Delete_Key (Manager, Iterator, Mark);
end if;
Keys.Next_Data_Key (Manager, Iterator);
end loop;
end Delete_Data;
-- ------------------------------
-- Erase the data fragments starting at the key iterator current position.
-- ------------------------------
procedure Delete_Data (Manager : in out Wallet_Repository;
Iterator : in out Keys.Data_Key_Iterator) is
Work : Workers.Data_Work_Access;
Mark : Keys.Data_Key_Marker;
begin
Keys.Mark_Data_Key (Iterator, Mark);
Workers.Initialize_Queue (Manager);
loop
Keys.Next_Data_Key (Manager, Iterator);
exit when not Keys.Has_Data_Key (Iterator);
Workers.Allocate_Work (Manager, Workers.DATA_RELEASE, null, Iterator, Work);
-- Run the delete data work either through work manager or through current task.
Workers.Queue_Delete_Work (Manager, Work);
-- When the last data block was processed, erase the data key.
if Keys.Is_Last_Key (Iterator) then
Keys.Delete_Key (Manager, Iterator, Mark);
end if;
end loop;
Workers.Flush_Queue (Manager, null);
exception
when E : others =>
Log.Error ("Exception while deleting data: ", E);
Workers.Flush_Queue (Manager, null);
raise;
end Delete_Data;
-- ------------------------------
-- Get the data associated with the named entry.
-- ------------------------------
procedure Get_Data (Manager : in out Wallet_Repository;
Iterator : in out Keys.Data_Key_Iterator;
Output : out Ada.Streams.Stream_Element_Array) is
procedure Process (Work : in Workers.Data_Work_Access);
Data_Offset : Stream_Element_Offset := Output'First;
procedure Process (Work : in Workers.Data_Work_Access) is
Data_Size : constant Stream_Element_Offset := Work.End_Data - Work.Start_Data + 1;
begin
Output (Data_Offset .. Data_Offset + Data_Size - 1)
:= Work.Data (Work.Buffer_Pos .. Work.Buffer_Pos + Data_Size - 1);
Data_Offset := Data_Offset + Data_Size;
end Process;
Work : Workers.Data_Work_Access;
Enqueued : Boolean;
begin
Workers.Initialize_Queue (Manager);
loop
Keys.Next_Data_Key (Manager, Iterator);
exit when not Keys.Has_Data_Key (Iterator);
Workers.Allocate_Work (Manager, Workers.DATA_DECRYPT, Process'Access, Iterator, Work);
-- Run the decipher work either through work manager or through current task.
Workers.Queue_Decipher_Work (Manager, Work, Enqueued);
if not Enqueued then
Process (Work);
end if;
end loop;
Workers.Flush_Queue (Manager, Process'Access);
exception
when E : others =>
Log.Error ("Exception while decrypting data: ", E);
Workers.Flush_Queue (Manager, null);
raise;
end Get_Data;
procedure Get_Data (Manager : in out Wallet_Repository;
Iterator : in out Keys.Data_Key_Iterator;
Output : in out Util.Streams.Output_Stream'Class) is
procedure Process (Work : in Workers.Data_Work_Access);
procedure Process (Work : in Workers.Data_Work_Access) is
begin
Output.Write (Work.Data (Work.Buffer_Pos .. Work.Last_Pos));
end Process;
Work : Workers.Data_Work_Access;
Enqueued : Boolean;
begin
Workers.Initialize_Queue (Manager);
loop
Keys.Next_Data_Key (Manager, Iterator);
exit when not Keys.Has_Data_Key (Iterator);
Workers.Allocate_Work (Manager, Workers.DATA_DECRYPT, Process'Access, Iterator, Work);
-- Run the decipher work either through work manager or through current task.
Workers.Queue_Decipher_Work (Manager, Work, Enqueued);
if not Enqueued then
Process (Work);
end if;
end loop;
Workers.Flush_Queue (Manager, Process'Access);
exception
when E : others =>
Log.Error ("Exception while decrypting data: ", E);
Workers.Flush_Queue (Manager, null);
raise;
end Get_Data;
-- ------------------------------
-- Get the data associated with the named entry.
-- ------------------------------
procedure Read (Manager : in out Wallet_Repository;
Iterator : in out Keys.Data_Key_Iterator;
Offset : in Ada.Streams.Stream_Element_Offset;
Output : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset) is
procedure Process (Work : in Workers.Data_Work_Access);
Seek_Offset : Stream_Element_Offset := Offset;
Data_Offset : Stream_Element_Offset := Output'First;
procedure Process (Work : in Workers.Data_Work_Access) is
Data_Size : Stream_Element_Offset
:= Work.End_Data - Work.Start_Data + 1 - Work.Seek_Offset;
begin
Work.Buffer_Pos := Work.Buffer_Pos + Work.Seek_Offset;
if Data_Offset + Data_Size - 1 >= Output'Last then
Data_Size := Output'Last - Data_Offset + 1;
end if;
Output (Data_Offset .. Data_Offset + Data_Size - 1)
:= Work.Data (Work.Buffer_Pos .. Work.Buffer_Pos + Data_Size - 1);
Data_Offset := Data_Offset + Data_Size;
end Process;
Work : Workers.Data_Work_Access;
Enqueued : Boolean;
Length : Stream_Element_Offset := Output'Length;
begin
Workers.Initialize_Queue (Manager);
Keys.Seek (Manager, Seek_Offset, Iterator);
Length := Length + Seek_Offset;
while Keys.Has_Data_Key (Iterator) and Length > 0 loop
Workers.Allocate_Work (Manager, Workers.DATA_DECRYPT, Process'Access, Iterator, Work);
Work.Seek_Offset := Seek_Offset;
-- Run the decipher work either through work manager or through current task.
Workers.Queue_Decipher_Work (Manager, Work, Enqueued);
if not Enqueued then
Process (Work);
end if;
exit when Length < Iterator.Data_Size;
Length := Length - Iterator.Data_Size;
Seek_Offset := 0;
Keys.Next_Data_Key (Manager, Iterator);
end loop;
Workers.Flush_Queue (Manager, Process'Access);
Last := Data_Offset - 1;
exception
when E : others =>
Log.Error ("Exception while decrypting data: ", E);
Workers.Flush_Queue (Manager, null);
raise;
end Read;
-- ------------------------------
-- Get the data associated with the named entry.
-- ------------------------------
procedure Write (Manager : in out Wallet_Repository;
Iterator : in out Keys.Data_Key_Iterator;
Offset : in Ada.Streams.Stream_Element_Offset;
Content : in Ada.Streams.Stream_Element_Array;
Result : in out Interfaces.Unsigned_64) is
use type Workers.Status_Type;
Seek_Offset : Stream_Element_Offset := Offset;
Input_Pos : Stream_Element_Offset := Content'First;
Work : Workers.Data_Work_Access;
Length : Stream_Element_Offset := Content'Length;
Status : Workers.Status_Type;
begin
Workers.Initialize_Queue (Manager);
Keys.Seek (Manager, Seek_Offset, Iterator);
-- First part that overlaps an existing data block:
-- read the current block, update the content.
if Keys.Has_Data_Key (Iterator) and Length > 0 then
Workers.Allocate_Work (Manager, Workers.DATA_DECRYPT, null, Iterator, Work);
-- Run the decipher work ourselves.
Work.Do_Decipher_Data;
Status := Work.Status;
if Status = Workers.SUCCESS then
declare
Data_Size : Stream_Element_Offset
:= Work.End_Data - Work.Start_Data + 1 - Seek_Offset;
Pos : constant Stream_Element_Offset
:= Work.Buffer_Pos + Seek_Offset;
begin
if Input_Pos + Data_Size - 1 >= Content'Last then
Data_Size := Content'Last - Input_Pos + 1;
end if;
Work.Data (Pos .. Pos + Data_Size - 1)
:= Content (Input_Pos .. Input_Pos + Data_Size - 1);
Input_Pos := Input_Pos + Data_Size;
Work.Kind := Workers.DATA_ENCRYPT;
Work.Status := Workers.PENDING;
Work.Entry_Id := Iterator.Entry_Id;
Work.Key_Pos := Iterator.Key_Pos;
Work.Key_Block.Buffer := Iterator.Current.Buffer;
Work.Data_Block := Iterator.Data_Block;
Work.Data_Need_Setup := False;
Work.Data_Offset := Iterator.Current_Offset;
Length := Length - Data_Size;
Keys.Update_Key_Slot (Manager, Iterator, Work.End_Data - Work.Start_Data + 1);
end;
-- Run the encrypt data work either through work manager or through current task.
Workers.Queue_Cipher_Work (Manager, Work);
else
Workers.Put_Work (Manager.Workers.all, Work);
-- Check_Raise_Error (Status);
end if;
Keys.Next_Data_Key (Manager, Iterator);
end if;
while Keys.Has_Data_Key (Iterator) and Length >= DATA_MAX_SIZE loop
Workers.Allocate_Work (Manager, Workers.DATA_ENCRYPT, null, Iterator, Work);
Work.Buffer_Pos := 1;
Work.Last_Pos := DATA_MAX_SIZE;
Work.Data (1 .. DATA_MAX_SIZE) := Content (Input_Pos .. Input_Pos + DATA_MAX_SIZE - 1);
Keys.Update_Key_Slot (Manager, Iterator, DATA_MAX_SIZE);
Work.Key_Block.Buffer := Iterator.Current.Buffer;
-- Run the encrypt data work either through work manager or through current task.
Workers.Queue_Cipher_Work (Manager, Work);
Input_Pos := Input_Pos + DATA_MAX_SIZE;
-- Data_Offset := Data_Offset + DATA_MAX_SIZE;
Length := Length - DATA_MAX_SIZE;
exit when Input_Pos > Content'Last;
Keys.Next_Data_Key (Manager, Iterator);
end loop;
-- Last part that overlaps an existing data block:
-- read the current block, update the content.
if Keys.Has_Data_Key (Iterator) and Length > 0 then
Workers.Allocate_Work (Manager, Workers.DATA_DECRYPT, null, Iterator, Work);
-- Run the decipher work ourselves.
Work.Do_Decipher_Data;
Status := Work.Status;
if Status = Workers.SUCCESS then
declare
Last : constant Stream_Element_Offset
:= Content'Last - Input_Pos + 1;
begin
Work.Data (1 .. Last) := Content (Input_Pos .. Content'Last);
Input_Pos := Content'Last + 1;
if Last > Work.End_Data then
Work.End_Data := Last;
end if;
Work.Kind := Workers.DATA_ENCRYPT;
Work.Status := Workers.PENDING;
Work.Entry_Id := Iterator.Entry_Id;
Work.Key_Pos := Iterator.Key_Pos;
Work.Key_Block.Buffer := Iterator.Current.Buffer;
Work.Data_Block := Iterator.Data_Block;
Work.Data_Need_Setup := False;
Work.Data_Offset := Iterator.Current_Offset;
Keys.Update_Key_Slot (Manager, Iterator, Work.End_Data - Work.Start_Data + 1);
end;
-- Run the encrypt data work either through work manager or through current task.
Workers.Queue_Cipher_Work (Manager, Work);
else
Workers.Put_Work (Manager.Workers.all, Work);
-- Check_Raise_Error (Status);
end if;
Keys.Next_Data_Key (Manager, Iterator);
end if;
Workers.Flush_Queue (Manager, null);
Result := Iterator.Current_Offset;
if Input_Pos <= Content'Last then
Keys.Prepare_Append (Iterator);
Add_Data (Manager, Iterator, Content (Input_Pos .. Content'Last), Result);
end if;
exception
when E : others =>
Log.Error ("Exception while decrypting data: ", E);
Workers.Flush_Queue (Manager, null);
raise;
end Write;
end Keystore.Repository.Data;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
--
with Rule_Table, Symbol_Table, Set_Pack;
use Rule_Table, Symbol_Table;
package LR0_Machine is
type Parse_State is range -1..5_000;
Null_Parse_State : constant Parse_State := -1;
type Item is
record
Rule_ID : Rule;
Dot_Position : Natural;
end record;
type Transition is
record
Symbol : Grammar_Symbol;
State_ID : Parse_State;
end record;
function "<" (Item_1, Item_2 : Item) return Boolean;
function "<" (Trans_1, Trans_2 : Transition) return Boolean;
package Parse_State_Set_Pack is new Set_Pack(Parse_State, "<");
package Item_Set_Pack is new Set_Pack(Item, "<");
package Transition_Set_Pack is new Set_Pack(Transition, "<");
package Grammar_Symbol_Set_Pack is new Set_Pack(Grammar_Symbol, "<");
subtype Parse_State_Set is Parse_State_Set_Pack.Set;
subtype Item_Set is Item_Set_Pack.Set;
subtype Transition_Set is Transition_Set_Pack.Set;
subtype Grammar_Symbol_Set is Grammar_Symbol_Set_Pack.Set;
subtype Parse_State_Iterator is Parse_State_Set_Pack.Set_Iterator;
subtype Item_Iterator is Item_Set_Pack.Set_Iterator;
subtype Transition_Iterator is Transition_Set_Pack.Set_Iterator;
subtype Grammar_Symbol_Iterator is Grammar_Symbol_Set_Pack.Set_Iterator;
procedure LR0_Initialize; -- must be called first.
function First_Parse_State return Parse_State;
function Last_Parse_State return Parse_State;
function Get_Goto
(State_ID : Parse_State;
Sym : Grammar_Symbol) return Parse_State;
-- Returns the predecessor states of STATE_ID and the item I.
-- Must be called with PRED_SET empty!
procedure Get_Pred_Set
(State_ID : in Parse_State;
I : in Item;
Pred_Set : in out Parse_State_Set);
type Transition_Type is (Terminals, Nonterminals, Grammar_Symbols);
procedure Get_Transitions
(State_ID : in Parse_State;
Kind : in Transition_Type;
Set_1 : in out Transition_Set);
procedure Get_Transition_Symbols
(State_ID : in Parse_State;
Kind : in Transition_Type;
Set_1 : in out Grammar_Symbol_Set);
procedure Get_Kernel
(State_ID : in Parse_State;
Set_1 : in out Item_Set);
procedure Closure (Set_1 : in out Item_Set);
--
-- The following routines allow the user to iterate over the
-- items in the kernel of a particular state.
--
type Kernel_Iterator is limited private;
procedure Initialize
(Iterator : in out Kernel_Iterator;
State_ID : in Parse_State);
function More(Iterator : Kernel_Iterator) return Boolean;
procedure Next(Iterator : in out Kernel_Iterator; I : out Item);
--
-- The following routines allow the user to iterate over the
-- nonterminal transitions of a particular state
--
type Nt_Transition_Iterator is limited private;
procedure Initialize
(Iterator : in out Nt_Transition_Iterator;
State_ID : in Parse_State);
function More (Iterator : Nt_Transition_Iterator) return Boolean;
procedure Next
(Iterator : in out Nt_Transition_Iterator;
Trans : out Transition);
-- The following routines allow iteration over the Terminal transitions
-- of a particular state.
type T_Transition_Iterator is limited private; -- For Terminals
procedure Initialize
(Iterator : in out T_Transition_Iterator;
State_ID : in Parse_State);
function More (Iterator : T_Transition_Iterator) return Boolean;
procedure Next
(Iterator : in out T_Transition_Iterator;
Trans : out Transition);
To_Many_States : exception;
No_More_Iterations : exception;
State_Out_of_Bounds : exception;
--RJS pragma inline(more); --DEC Ada Bug: , next);
private
type Item_Array_Index is range 0..5_000; -- An arbitrarily big number
----- type Item_Array;
type Item_Array is array (Item_Array_Index range <>) of Item;
type Item_Array_Pointer is access Item_Array;
type Kernel_Iterator is
record
Kernel : Item_Array_Pointer;
Curser : Item_Array_Index;
end record;
----- type Transition_Array;
-- The type declarations for storing the nonterminal transitions of
-- the DFA in the states.
type Transition_Array is
array(Integer range <>) of Transition;
type Transition_Array_Pointer is access Transition_Array;
type Nt_Transition_Iterator is
record
Nonterm_Trans : Transition_Array_Pointer;
Curser : Integer; -- Use a derived type instead ???
end record;
type T_Transition_Iterator is
record
Term_Trans : Transition_Array_Pointer;
Curser : Integer;
end record;
end LR0_Machine;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-------------------------------------------------------------
with Program.Elements.Expressions;
with Program.Lexical_Elements;
with Program.Elements.Defining_Identifiers;
with Program.Elements.Defining_Expanded_Names;
with Program.Element_Visitors;
package Program.Nodes.Defining_Expanded_Names is
pragma Preelaborate;
type Defining_Expanded_Name is
new Program.Nodes.Node
and Program.Elements.Defining_Expanded_Names.Defining_Expanded_Name
and Program.Elements.Defining_Expanded_Names
.Defining_Expanded_Name_Text
with private;
function Create
(Prefix : not null Program.Elements.Expressions.Expression_Access;
Dot_Token : not null Program.Lexical_Elements.Lexical_Element_Access;
Selector : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access)
return Defining_Expanded_Name;
type Implicit_Defining_Expanded_Name is
new Program.Nodes.Node
and Program.Elements.Defining_Expanded_Names.Defining_Expanded_Name
with private;
function Create
(Prefix : not null Program.Elements.Expressions
.Expression_Access;
Selector : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_Defining_Expanded_Name
with Pre =>
Is_Part_Of_Implicit or Is_Part_Of_Inherited or Is_Part_Of_Instance;
private
type Base_Defining_Expanded_Name is
abstract new Program.Nodes.Node
and Program.Elements.Defining_Expanded_Names.Defining_Expanded_Name
with record
Prefix : not null Program.Elements.Expressions.Expression_Access;
Selector : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
end record;
procedure Initialize (Self : in out Base_Defining_Expanded_Name'Class);
overriding procedure Visit
(Self : not null access Base_Defining_Expanded_Name;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class);
overriding function Prefix
(Self : Base_Defining_Expanded_Name)
return not null Program.Elements.Expressions.Expression_Access;
overriding function Selector
(Self : Base_Defining_Expanded_Name)
return not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
overriding function Is_Defining_Expanded_Name
(Self : Base_Defining_Expanded_Name)
return Boolean;
overriding function Is_Defining_Name
(Self : Base_Defining_Expanded_Name)
return Boolean;
type Defining_Expanded_Name is
new Base_Defining_Expanded_Name
and Program.Elements.Defining_Expanded_Names.Defining_Expanded_Name_Text
with record
Dot_Token : not null Program.Lexical_Elements.Lexical_Element_Access;
end record;
overriding function To_Defining_Expanded_Name_Text
(Self : in out Defining_Expanded_Name)
return Program.Elements.Defining_Expanded_Names
.Defining_Expanded_Name_Text_Access;
overriding function Dot_Token
(Self : Defining_Expanded_Name)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Image (Self : Defining_Expanded_Name) return Text;
type Implicit_Defining_Expanded_Name is
new Base_Defining_Expanded_Name
with record
Is_Part_Of_Implicit : Boolean;
Is_Part_Of_Inherited : Boolean;
Is_Part_Of_Instance : Boolean;
end record;
overriding function To_Defining_Expanded_Name_Text
(Self : in out Implicit_Defining_Expanded_Name)
return Program.Elements.Defining_Expanded_Names
.Defining_Expanded_Name_Text_Access;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Defining_Expanded_Name)
return Boolean;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Defining_Expanded_Name)
return Boolean;
overriding function Is_Part_Of_Instance
(Self : Implicit_Defining_Expanded_Name)
return Boolean;
overriding function Image
(Self : Implicit_Defining_Expanded_Name)
return Text;
end Program.Nodes.Defining_Expanded_Names;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This is a NO tasking version of this package.
package body System.Interrupt_Management.Operations is
----------------------------
-- Thread_Block_Interrupt --
----------------------------
procedure Thread_Block_Interrupt
(Interrupt : Interrupt_ID)
is
begin
null;
end Thread_Block_Interrupt;
------------------------------
-- Thread_Unblock_Interrupt --
------------------------------
procedure Thread_Unblock_Interrupt
(Interrupt : Interrupt_ID)
is
begin
null;
end Thread_Unblock_Interrupt;
------------------------
-- Set_Interrupt_Mask --
------------------------
procedure Set_Interrupt_Mask (Mask : access Interrupt_Mask) is
begin
null;
end Set_Interrupt_Mask;
procedure Set_Interrupt_Mask
(Mask : access Interrupt_Mask;
OMask : access Interrupt_Mask) is
begin
null;
end Set_Interrupt_Mask;
------------------------
-- Get_Interrupt_Mask --
------------------------
procedure Get_Interrupt_Mask (Mask : access Interrupt_Mask) is
begin
null;
end Get_Interrupt_Mask;
--------------------
-- Interrupt_Wait --
--------------------
function Interrupt_Wait
(Mask : access Interrupt_Mask)
return Interrupt_ID
is
begin
return 0;
end Interrupt_Wait;
----------------------------
-- Install_Default_Action --
----------------------------
procedure Install_Default_Action (Interrupt : Interrupt_ID) is
begin
null;
end Install_Default_Action;
---------------------------
-- Install_Ignore_Action --
---------------------------
procedure Install_Ignore_Action (Interrupt : Interrupt_ID) is
begin
null;
end Install_Ignore_Action;
-------------------------
-- Fill_Interrupt_Mask --
-------------------------
procedure Fill_Interrupt_Mask (Mask : access Interrupt_Mask) is
begin
null;
end Fill_Interrupt_Mask;
--------------------------
-- Empty_Interrupt_Mask --
--------------------------
procedure Empty_Interrupt_Mask (Mask : access Interrupt_Mask) is
begin
null;
end Empty_Interrupt_Mask;
-----------------------
-- Add_To_Sigal_Mask --
-----------------------
procedure Add_To_Interrupt_Mask
(Mask : access Interrupt_Mask;
Interrupt : Interrupt_ID)
is
begin
null;
end Add_To_Interrupt_Mask;
--------------------------------
-- Delete_From_Interrupt_Mask --
--------------------------------
procedure Delete_From_Interrupt_Mask
(Mask : access Interrupt_Mask;
Interrupt : Interrupt_ID)
is
begin
null;
end Delete_From_Interrupt_Mask;
---------------
-- Is_Member --
---------------
function Is_Member
(Mask : access Interrupt_Mask;
Interrupt : Interrupt_ID) return Boolean
is
begin
return False;
end Is_Member;
-------------------------
-- Copy_Interrupt_Mask --
-------------------------
procedure Copy_Interrupt_Mask
(X : out Interrupt_Mask;
Y : Interrupt_Mask)
is
begin
X := Y;
end Copy_Interrupt_Mask;
-------------------------
-- Interrupt_Self_Process --
-------------------------
procedure Interrupt_Self_Process (Interrupt : Interrupt_ID) is
begin
null;
end Interrupt_Self_Process;
end System.Interrupt_Management.Operations;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
package openGL.Palette
--
-- Provides a pallete of named colors.
--
-- Color values are sourced from WikiPaedia:
--
-- - http://en.wikipedia.org/wiki/Primary_color
-- - http://en.wikipedia.org/wiki/Secondary_color
-- - http://en.wikipedia.org/wiki/Tertiary_color
-- - http://en.wikipedia.org/wiki/List_of_colors
--
is
--------------------
-- Color Primitives
--
-- Shades
--
type Shade_Level is digits 7 range 0.0 .. 1.0;
function Shade_of (Self : in Color; Level : in Shade_Level) return Color;
--
-- Darkens a color by the given shade level factor.
-- Color Mixing
--
type mix_Factor is digits 7 range 0.0 .. 1.0; -- 0.0 returns 'Self', 1.0 returns 'Other'.
function mixed (Self : in Color; Other : in Color;
Mix : in mix_Factor := 0.5) return Color;
--
-- Combines two colors.
-- Similarity
--
default_Similarity : constant Primary;
function is_similar (Self : in Color; To : in Color;
Similarity : in Primary := default_Similarity) return Boolean;
--
-- Returns true if the none of the red, green, blue components of 'Self'
-- differ from 'to' by more than 'Similarity'.
-- Random Colors
--
function random_Color return Color;
----------------
-- Named Colors
--
-- Achromatic
--
White : constant Color;
Black : constant Color;
Grey : constant Color;
-- Primary
--
Red : constant Color;
Green : constant Color;
Blue : constant Color;
-- Secondary
--
Yellow : constant Color;
Cyan : constant Color;
Magenta : constant Color;
-- Tertiary
--
Azure : constant Color;
Violet : constant Color;
Rose : constant Color;
Orange : constant Color;
Chartreuse : constant Color;
spring_Green : constant Color;
-- Named (TODO: sort named colors into primary, secondary and tertiary categories).
--
Air_Force_blue : constant Color;
Alice_blue : constant Color;
Alizarin : constant Color;
Amaranth : constant Color;
Amaranth_cerise : constant Color;
Amaranth_deep_purple : constant Color;
Amaranth_magenta : constant Color;
Amaranth_pink : constant Color;
Amaranth_purple : constant Color;
Amber : constant Color;
Amber_SAE_ECE : constant Color;
American_rose : constant Color;
Amethyst : constant Color;
Android_Green : constant Color;
Anti_flash_white : constant Color;
Antique_fuchsia : constant Color;
Antique_white : constant Color;
Apple_green : constant Color;
Apricot : constant Color;
Aqua : constant Color;
Aquamarine : constant Color;
Army_green : constant Color;
Arsenic : constant Color;
Ash_grey : constant Color;
Asparagus : constant Color;
Atomic_tangerine : constant Color;
Auburn : constant Color;
Aureolin : constant Color;
Azure_mist : constant Color;
Baby_blue : constant Color;
Baby_pink : constant Color;
Battleship_grey : constant Color;
Beige : constant Color;
Bistre : constant Color;
Bittersweet : constant Color;
Blue_pigment : constant Color;
Blue_RYB : constant Color;
Blue_green : constant Color;
Blue_violet : constant Color;
Bole : constant Color;
Bondi_blue : constant Color;
Boston_University_Red : constant Color;
Brandeis_Blue : constant Color;
Brass : constant Color;
Brick_red : constant Color;
Bright_cerulean : constant Color;
Bright_green : constant Color;
Bright_lavender : constant Color;
Bright_maroon : constant Color;
Bright_pink : constant Color;
Bright_turquoise : constant Color;
Bright_ube : constant Color;
Brilliant_lavender : constant Color;
Brilliant_rose : constant Color;
Brink_Pink : constant Color;
British_racing_green : constant Color;
Bronze : constant Color;
Brown : constant Color;
Brown_web : constant Color;
Buff : constant Color;
Bulgarian_rose : constant Color;
Burgundy : constant Color;
Burnt_orange : constant Color;
Burnt_sienna : constant Color;
Burnt_umber : constant Color;
Byzantine : constant Color;
Byzantium : constant Color;
Cadet_blue : constant Color;
Cadmium_Green : constant Color;
Cadmium_Orange : constant Color;
Cadmium_Red : constant Color;
Cadmium_Yellow : constant Color;
Cambridge_Blue : constant Color;
Camel : constant Color;
Camouflage_green : constant Color;
Canary_yellow : constant Color;
Candy_apple_red : constant Color;
Candy_pink : constant Color;
Caput_mortuum : constant Color;
Cardinal : constant Color;
Carmine : constant Color;
Carmine_pink : constant Color;
Carmine_red : constant Color;
Carnation_pink : constant Color;
Carnelian : constant Color;
Carolina_blue : constant Color;
Caribbean_green : constant Color;
Carrot_orange : constant Color;
Ceil : constant Color;
Celadon : constant Color;
Celestial_blue : constant Color;
Cerise : constant Color;
Cerise_pink : constant Color;
Cerulean : constant Color;
Cerulean_blue : constant Color;
Chamoisee : constant Color;
Champagne : constant Color;
Charcoal : constant Color;
Chartreuse_web : constant Color;
Cherry_blossom_pink : constant Color;
Chestnut : constant Color;
Chocolate : constant Color;
Chrome_yellow : constant Color;
Cinereous : constant Color;
Cinnabar : constant Color;
Cinnamon : constant Color;
Citrine : constant Color;
Classic_rose : constant Color;
Cobalt : constant Color;
Columbia_blue : constant Color;
Cool_black : constant Color;
Cool_grey : constant Color;
Copper : constant Color;
Copper_rose : constant Color;
Coquelicot : constant Color;
Coral : constant Color;
Coral_pink : constant Color;
Coral_red : constant Color;
Cordovan : constant Color;
Corn : constant Color;
Cornsilk : constant Color;
Cornflower_blue : constant Color;
Cosmic_latte : constant Color;
Cotton_candy : constant Color;
Cream : constant Color;
Crimson : constant Color;
Crimson_glory : constant Color;
Cyan_process : constant Color;
Dandelion : constant Color;
Dark_blue : constant Color;
Dark_brown : constant Color;
Dark_byzantium : constant Color;
Dark_candy_apple_red : constant Color;
Dark_cerulean : constant Color;
Dark_champagne : constant Color;
Dark_chestnut : constant Color;
Dark_coral : constant Color;
Dark_cyan : constant Color;
Dark_electric_blue : constant Color;
Dark_goldenrod : constant Color;
Dark_green : constant Color;
Dark_jungle_green : constant Color;
Dark_khaki : constant Color;
Dark_lava : constant Color;
Dark_lavender : constant Color;
Dark_magenta : constant Color;
Dark_midnight_blue : constant Color;
Dark_orange : constant Color;
Dark_pastel_green : constant Color;
Dark_pink : constant Color;
Dark_powder_blue : constant Color;
Dark_raspberry : constant Color;
Dark_red : constant Color;
Dark_salmon : constant Color;
Dark_scarlet : constant Color;
Dark_sienna : constant Color;
Dark_slate_gray : constant Color;
Dark_spring_green : constant Color;
Dark_tan : constant Color;
Dark_tangerine : constant Color;
Dark_taupe : constant Color;
Dark_terra_cotta : constant Color;
Dark_turquoise : constant Color;
Dark_violet : constant Color;
Dartmouth_green : constant Color;
Davys_grey : constant Color;
Deep_carmine : constant Color;
Deep_carmine_pink : constant Color;
Deep_carrot_orange : constant Color;
Deep_cerise : constant Color;
Deep_champagne : constant Color;
Deep_chestnut : constant Color;
Deep_fuchsia : constant Color;
Deep_jungle_green : constant Color;
Deep_lilac : constant Color;
Deep_magenta : constant Color;
Deep_peach : constant Color;
Deep_pink : constant Color;
Deep_saffron : constant Color;
Deep_sky_blue : constant Color;
Denim : constant Color;
Desert : constant Color;
Desert_sand : constant Color;
Dim_gray : constant Color;
Dodger_blue : constant Color;
Dogwood_Rose : constant Color;
Drab : constant Color;
Duke_blue : constant Color;
Earth_yellow : constant Color;
Ecru : constant Color;
Eggplant : constant Color;
Eggshell : constant Color;
Egyptian_blue : constant Color;
Electric_blue : constant Color;
Electric_cyan : constant Color;
Electric_green : constant Color;
Electric_indigo : constant Color;
Electric_lavender : constant Color;
Electric_lime : constant Color;
Electric_purple : constant Color;
Electric_ultramarine : constant Color;
Electric_violet : constant Color;
Emerald : constant Color;
Eton_blue : constant Color;
Fallow : constant Color;
Falu_red : constant Color;
Fandango : constant Color;
Fashion_fuchsia : constant Color;
Fawn : constant Color;
Feldgrau : constant Color;
Fern_green : constant Color;
Field_drab : constant Color;
Firebrick : constant Color;
Fire_engine_red : constant Color;
Flame : constant Color;
Flamingo_pink : constant Color;
Flavescent : constant Color;
Flax : constant Color;
Forest_green : constant Color;
Forest_green_web : constant Color;
French_Beige : constant Color;
French_Rose : constant Color;
Fuchsia : constant Color;
Fuchsia_Pink : constant Color;
Fulvous : constant Color;
Gamboge : constant Color;
Ghost_white : constant Color;
Glaucous : constant Color;
Gold_metallic : constant Color;
Gold_web : constant Color;
Golden_brown : constant Color;
Golden_poppy : constant Color;
Golden_yellow : constant Color;
Goldenrod : constant Color;
Gray : constant Color;
Gray_asparagus : constant Color;
Green_web : constant Color;
Green_pigment : constant Color;
Green_RYB : constant Color;
Green_yellow : constant Color;
Grullo : constant Color;
Halaya_ube : constant Color;
Han_Blue : constant Color;
Han_Purple : constant Color;
Harlequin : constant Color;
Heliotrope : constant Color;
Hollywood_cerise : constant Color;
Honeydew : constant Color;
Hot_magenta : constant Color;
Hot_pink : constant Color;
Hunter_green : constant Color;
Iceberg : constant Color;
Icterine : constant Color;
India_green : constant Color;
Indian_yellow : constant Color;
Indigo : constant Color;
Indigo_web : constant Color;
International_Klein_Blue : constant Color;
International_orange : constant Color;
Iris : constant Color;
Isabelline : constant Color;
Islamic_green : constant Color;
Ivory : constant Color;
Jade : constant Color;
Jazzberry_jam : constant Color;
Jonquil : constant Color;
June_bud : constant Color;
Jungle_green : constant Color;
Kelly_green : constant Color;
Khaki_web : constant Color;
Khaki : constant Color;
Languid_lavender : constant Color;
Lava : constant Color;
Lavender_floral : constant Color;
Lavender_web : constant Color;
Lavender_blue : constant Color;
Lavender_blush : constant Color;
Lavender_gray : constant Color;
Lavender_indigo : constant Color;
Lavender_magenta : constant Color;
Lavender_mist : constant Color;
Lavender_pink : constant Color;
Lavender_purple : constant Color;
Lavender_rose : constant Color;
Lawn_green : constant Color;
Lemon : constant Color;
Lemon_chiffon : constant Color;
Light_apricot : constant Color;
Light_blue : constant Color;
Light_carmine_pink : constant Color;
Light_coral : constant Color;
Light_cornflower_blue : constant Color;
Light_fuchsia_pink : constant Color;
Light_khaki : constant Color;
Light_mauve : constant Color;
Light_pink : constant Color;
Light_sea_green : constant Color;
Light_salmon : constant Color;
Light_salmon_pink : constant Color;
Light_sky_blue : constant Color;
Light_slate_gray : constant Color;
Light_Thulian_pink : constant Color;
Lilac : constant Color;
Lime : constant Color;
Lime_web : constant Color;
Lime_green : constant Color;
Linen : constant Color;
Liver : constant Color;
Lust : constant Color;
Magenta_dye : constant Color;
Magenta_process : constant Color;
Magic_mint : constant Color;
Magnolia : constant Color;
Mahogany : constant Color;
Maize : constant Color;
Majorelle_Blue : constant Color;
Malachite : constant Color;
Maroon_web : constant Color;
Maroon : constant Color;
Mauve : constant Color;
Mauve_taupe : constant Color;
Maya_blue : constant Color;
Medium_aquamarine : constant Color;
Medium_blue : constant Color;
Medium_candy_apple_red : constant Color;
Medium_carmine : constant Color;
Medium_champagne : constant Color;
Medium_electric_blue : constant Color;
Medium_jungle_green : constant Color;
Medium_lavender_magenta : constant Color;
Medium_Persian_blue : constant Color;
Medium_purple : constant Color;
Medium_red_violet : constant Color;
Medium_sea_green : constant Color;
Medium_spring_bud : constant Color;
Medium_spring_green : constant Color;
Medium_taupe : constant Color;
Medium_teal_blue : constant Color;
Medium_turquoise : constant Color;
Midnight_blue : constant Color;
Midnight_green : constant Color;
Eagle_green : constant Color;
Mikado_yellow : constant Color;
Mint_green : constant Color;
Misty_rose : constant Color;
Moccasin : constant Color;
Mode_Beige : constant Color;
Mordant_red : constant Color;
Moss_green : constant Color;
Mountbatten_pink : constant Color;
Mulberry : constant Color;
Mustard : constant Color;
Myrtle : constant Color;
MSU_Green : constant Color;
Nadeshiko_pink : constant Color;
Napier_Green : constant Color;
Naples_Yellow : constant Color;
Navajo_white : constant Color;
Navy_Blue : constant Color;
Ochre : constant Color;
Office_green : constant Color;
Old_Gold : constant Color;
Old_Lace : constant Color;
Old_lavender : constant Color;
Old_Rose : constant Color;
Olive : constant Color;
Olive_Drab_web : constant Color;
Olive_Drab : constant Color;
Olivine : constant Color;
Onyx : constant Color;
Opera_mauve : constant Color;
Orange_color_wheel : constant Color;
Orange_RYB : constant Color;
Orange_web : constant Color;
Orange_peel : constant Color;
Orange_red : constant Color;
Orchid : constant Color;
Oxford_Blue : constant Color;
OU_Crimson_Red : constant Color;
Pale_Amaranth_Pink : constant Color;
Pale_blue : constant Color;
Pale_brown : constant Color;
Pale_carmine : constant Color;
Pale_cerulean : constant Color;
Pale_chestnut : constant Color;
Pale_copper : constant Color;
Pale_cornflower_blue : constant Color;
Pale_gold : constant Color;
Pale_magenta : constant Color;
Pale_pink : constant Color;
Pale_red_violet : constant Color;
Pale_robin_egg_blue : constant Color;
Pale_silver : constant Color;
Pale_spring_bud : constant Color;
Pale_taupe : constant Color;
Palatinate_blue : constant Color;
Palatinate_purple : constant Color;
Pansy_purple : constant Color;
Papaya_whip : constant Color;
Pastel_green : constant Color;
Pastel_pink : constant Color;
Paynes_grey : constant Color;
Peach : constant Color;
Peach_orange : constant Color;
Peach_puff : constant Color;
Peach_yellow : constant Color;
Pear : constant Color;
Pearl : constant Color;
Periwinkle : constant Color;
Persian_blue : constant Color;
Persian_green : constant Color;
Persian_indigo : constant Color;
Persian_orange : constant Color;
Persian_red : constant Color;
Persian_pink : constant Color;
Persian_rose : constant Color;
Persimmon : constant Color;
Phthalo_blue : constant Color;
Phthalo_green : constant Color;
Piggy_pink : constant Color;
Pine_green : constant Color;
Pink : constant Color;
Pink_orange : constant Color;
Pistachio : constant Color;
Platinum : constant Color;
Plum : constant Color;
Portland_Orange : constant Color;
Powder_blue : constant Color;
Princeton_Orange : constant Color;
Prussian_blue : constant Color;
Psychedelic_purple : constant Color;
Puce : constant Color;
Pumpkin : constant Color;
Purple_web : constant Color;
Purple : constant Color;
Purple_Heart : constant Color;
Purple_mountain_majesty : constant Color;
Purple_taupe : constant Color;
Radical_Red : constant Color;
Raspberry : constant Color;
Raspberry_glace : constant Color;
Raspberry_pink : constant Color;
Raspberry_rose : constant Color;
Raw_umber : constant Color;
Razzle_dazzle_rose : constant Color;
Razzmatazz : constant Color;
Red_pigment : constant Color;
Red_RYB : constant Color;
Red_violet : constant Color;
Rich_black : constant Color;
Rich_brilliant_lavender : constant Color;
Rich_carmine : constant Color;
Rich_electric_blue : constant Color;
Rich_lavender : constant Color;
Rich_maroon : constant Color;
Rifle_green : constant Color;
Robin_egg_blue : constant Color;
Rose_Ebony : constant Color;
Rose_Gold : constant Color;
Rose_Madder : constant Color;
Rose_pink : constant Color;
Rose_quartz : constant Color;
Rose_taupe : constant Color;
Rose_vale : constant Color;
Rosewood : constant Color;
Rosso_corsa : constant Color;
Rosy_brown : constant Color;
Royal_azure : constant Color;
Royal_blue : constant Color;
Royal_blue_web : constant Color;
Royal_fuchsia : constant Color;
Royal_purple : constant Color;
Ruby : constant Color;
Rufous : constant Color;
Russet : constant Color;
Rust : constant Color;
Sacramento_State_green : constant Color;
Saddle_brown : constant Color;
Safety_orange : constant Color;
blaze_orange : constant Color;
Saffron : constant Color;
St_Patricks_blue : constant Color;
Salmon : constant Color;
Salmon_pink : constant Color;
Sand : constant Color;
Sand_dune : constant Color;
Sandy_brown : constant Color;
Sandy_taupe : constant Color;
Sangria : constant Color;
Sap_green : constant Color;
Sapphire : constant Color;
Satin_sheen_gold : constant Color;
Scarlet : constant Color;
School_bus_yellow : constant Color;
Sea_green : constant Color;
Seal_brown : constant Color;
Seashell : constant Color;
Selective_yellow : constant Color;
Sepia : constant Color;
Shamrock_green : constant Color;
Shocking_pink : constant Color;
Sienna : constant Color;
Silver : constant Color;
Skobeloff : constant Color;
Sky_blue : constant Color;
Sky_magenta : constant Color;
Slate_gray : constant Color;
Smalt : constant Color;
Smoky_black : constant Color;
Snow : constant Color;
Splashed_white : constant Color;
Spring_bud : constant Color;
Steel_blue : constant Color;
Straw : constant Color;
Sunglow : constant Color;
Sunset : constant Color;
Tan : constant Color;
Tangelo : constant Color;
Tangerine : constant Color;
Tangerine_yellow : constant Color;
Taupe : constant Color;
Taupe_gray : constant Color;
Tea_green : constant Color;
Tea_rose_orange : constant Color;
Tea_rose : constant Color;
Teal : constant Color;
Teal_blue : constant Color;
Tenne : constant Color;
Tawny : constant Color;
Terra_cotta : constant Color;
Thistle : constant Color;
Thulian_pink : constant Color;
Tiffany_Blue : constant Color;
Tomato : constant Color;
Torch_red : constant Color;
Tropical_rain_forest : constant Color;
Turkish_Rose : constant Color;
Turquoise : constant Color;
Turquoise_blue : constant Color;
Tuscan_red : constant Color;
Twilight_lavender : constant Color;
Tyrian_purple : constant Color;
Ube : constant Color;
Ultramarine : constant Color;
Ultramarine_blue : constant Color;
Ultra_pink : constant Color;
Umber : constant Color;
United_Nations_blue : constant Color;
Upsdell_red : constant Color;
UP_Forest_green : constant Color;
UP_Maroon : constant Color;
Vegas_Gold : constant Color;
Venetian_red : constant Color;
Vermilion : constant Color;
Violet_web : constant Color;
Violet_RYB : constant Color;
Viridian : constant Color;
Vivid_auburn : constant Color;
Vivid_burgundy : constant Color;
Vivid_violet : constant Color;
Warm_black : constant Color;
Wenge : constant Color;
Wheat : constant Color;
White_smoke : constant Color;
Wild_blue_yonder : constant Color;
Wisteria : constant Color;
Xanadu : constant Color;
Yale_Blue : constant Color;
Yellow_process : constant Color;
Yellow_RYB : constant Color;
Yellow_green : constant Color;
private
default_Similarity : constant Primary := to_Primary (3);
White : constant Color := (1.0, 1.0, 1.0);
Black : constant Color := (0.0, 0.0, 0.0);
Grey : constant Color := (0.5, 0.5, 0.5);
Red : constant Color := (1.0, 0.0, 0.0);
Green : constant Color := (0.0, 1.0, 0.0);
Blue : constant Color := (0.0, 0.0, 1.0);
Yellow : constant Color := (1.0, 1.0, 0.0);
Cyan : constant Color := (0.0, 1.0, 1.0);
Magenta : constant Color := (1.0, 0.0, 1.0);
Azure : constant Color := +( 0, 127, 255);
Violet : constant Color := +(139, 0, 255);
Rose : constant Color := +(255, 0, 127);
Orange : constant Color := +(255, 127, 0);
Chartreuse : constant Color := +(223, 255, 0);
spring_Green : constant Color := +( 0, 255, 127);
Air_Force_blue : constant Color := +(93, 138, 168);
Alice_blue : constant Color := +(240, 248, 255);
Alizarin : constant Color := +(227, 38, 54);
Amaranth : constant Color := +(229, 43, 80);
Amaranth_cerise : constant Color := +(205, 38, 130);
Amaranth_deep_purple : constant Color := +(159, 43, 104);
Amaranth_magenta : constant Color := +(237, 60, 202);
Amaranth_pink : constant Color := +(241, 156, 187);
Amaranth_purple : constant Color := +(171, 39, 79);
Amber : constant Color := +(255, 191, 0);
Amber_SAE_ECE : constant Color := +(255, 126, 0);
American_rose : constant Color := +(255, 3, 62);
Amethyst : constant Color := +(153, 102, 204);
Android_Green : constant Color := +(164, 198, 57);
Anti_flash_white : constant Color := +(242, 243, 244);
Antique_fuchsia : constant Color := +(145, 92, 131);
Antique_white : constant Color := +(250, 235, 215);
Apple_green : constant Color := +(141, 182, 0);
Apricot : constant Color := +(251, 206, 177);
Aqua : constant Color := +(0, 255, 255);
Aquamarine : constant Color := +(127, 255, 212);
Army_green : constant Color := +(75, 83, 32);
Arsenic : constant Color := +(59, 68, 75);
Ash_grey : constant Color := +(178, 190, 181);
Asparagus : constant Color := +(135, 169, 107);
Atomic_tangerine : constant Color := +(255, 153, 102);
Auburn : constant Color := +(109, 53, 26);
Aureolin : constant Color := +(253, 238, 0);
Azure_mist : constant Color := +(240, 255, 255);
Baby_blue : constant Color := +(224, 255, 255);
Baby_pink : constant Color := +(244, 194, 194);
Battleship_grey : constant Color := +(132, 132, 130);
Beige : constant Color := +(245, 245, 220);
Bistre : constant Color := +(61, 43, 31);
Bittersweet : constant Color := +(254, 111, 94);
Blue_pigment : constant Color := +(51, 51, 153);
Blue_RYB : constant Color := +(2, 71, 254);
Blue_green : constant Color := +(0, 221, 221);
Blue_violet : constant Color := +(138, 43, 226);
Bole : constant Color := +(121, 68, 59);
Bondi_blue : constant Color := +(0, 149, 182);
Boston_University_Red : constant Color := +(204, 0, 0);
Brandeis_Blue : constant Color := +(0, 112, 255);
Brass : constant Color := +(181, 166, 66);
Brick_red : constant Color := +(203, 65, 84);
Bright_cerulean : constant Color := +(29, 172, 214);
Bright_green : constant Color := +(102, 255, 0);
Bright_lavender : constant Color := +(191, 148, 228);
Bright_maroon : constant Color := +(195, 33, 72);
Bright_pink : constant Color := +(255, 0, 127);
Bright_turquoise : constant Color := +(8, 232, 222);
Bright_ube : constant Color := +(209, 159, 232);
Brilliant_lavender : constant Color := +(244, 187, 255);
Brilliant_rose : constant Color := +(255, 85, 163);
Brink_Pink : constant Color := +(251, 96, 127);
British_racing_green : constant Color := +(0, 66, 37);
Bronze : constant Color := +(205, 127, 50);
Brown : constant Color := +(150, 75, 0);
Brown_web : constant Color := +(165, 42, 42);
Buff : constant Color := +(240, 220, 130);
Bulgarian_rose : constant Color := +(72, 6, 7);
Burgundy : constant Color := +(128, 0, 32);
Burnt_orange : constant Color := +(204, 85, 0);
Burnt_sienna : constant Color := +(233, 116, 81);
Burnt_umber : constant Color := +(138, 51, 36);
Byzantine : constant Color := +(189, 51, 164);
Byzantium : constant Color := +(112, 41, 99);
Cadet_blue : constant Color := +(95, 158, 160);
Cadmium_Green : constant Color := +(0, 107, 60);
Cadmium_Orange : constant Color := +(237, 135, 45);
Cadmium_Red : constant Color := +(227, 0, 34);
Cadmium_Yellow : constant Color := +(255, 246, 0);
Cambridge_Blue : constant Color := +(153, 204, 204);
Camel : constant Color := +(193, 154, 107);
Camouflage_green : constant Color := +(120, 134, 107);
Canary_yellow : constant Color := +(255, 239, 0);
Candy_apple_red : constant Color := +(255, 8, 0);
Candy_pink : constant Color := +(228, 113, 122);
Caput_mortuum : constant Color := +(89, 39, 32);
Cardinal : constant Color := +(196, 30, 58);
Carmine : constant Color := +(150, 0, 24);
Carmine_pink : constant Color := +(235, 76, 66);
Carmine_red : constant Color := +(255, 0, 51);
Carnation_pink : constant Color := +(255, 166, 201);
Carnelian : constant Color := +(179, 27, 27);
Carolina_blue : constant Color := +(153, 186, 227);
Caribbean_green : constant Color := +(0, 204, 153);
Carrot_orange : constant Color := +(237, 145, 33);
Ceil : constant Color := +(147, 162, 208);
Celadon : constant Color := +(172, 225, 175);
Celestial_blue : constant Color := +(73, 151, 208);
Cerise : constant Color := +(222, 49, 99);
Cerise_pink : constant Color := +(236, 59, 131);
Cerulean : constant Color := +(0, 123, 167);
Cerulean_blue : constant Color := +(42, 82, 190);
Chamoisee : constant Color := +(160, 120, 90);
Champagne : constant Color := +(247, 231, 206);
Charcoal : constant Color := +(54, 69, 79);
Chartreuse_web : constant Color := +(127, 255, 0);
Cherry_blossom_pink : constant Color := +(255, 183, 197);
Chestnut : constant Color := +(205, 92, 92);
Chocolate : constant Color := +(123, 63, 0);
Chrome_yellow : constant Color := +(255, 167, 0);
Cinereous : constant Color := +(152, 129, 123);
Cinnabar : constant Color := +(227, 66, 52);
Cinnamon : constant Color := +(210, 105, 30);
Citrine : constant Color := +(228, 208, 10);
Classic_rose : constant Color := +(251, 204, 231);
Cobalt : constant Color := +(0, 71, 171);
Columbia_blue : constant Color := +(155, 221, 255);
Cool_black : constant Color := +(0, 46, 99);
Cool_grey : constant Color := +(140, 146, 172);
Copper : constant Color := +(184, 115, 51);
Copper_rose : constant Color := +(153, 102, 102);
Coquelicot : constant Color := +(255, 56, 0);
Coral : constant Color := +(255, 127, 80);
Coral_pink : constant Color := +(248, 131, 121);
Coral_red : constant Color := +(255, 64, 64);
Cordovan : constant Color := +(137, 63, 69);
Corn : constant Color := +(251, 236, 93);
Cornsilk : constant Color := +(255, 248, 220);
Cornflower_blue : constant Color := +(100, 149, 237);
Cosmic_latte : constant Color := +(255, 248, 231);
Cotton_candy : constant Color := +(255, 188, 217);
Cream : constant Color := +(255, 253, 208);
Crimson : constant Color := +(220, 20, 60);
Crimson_glory : constant Color := +(190, 0, 50);
Cyan_process : constant Color := +(0, 183, 235);
Dandelion : constant Color := +(240, 225, 48);
Dark_blue : constant Color := +(0, 0, 139);
Dark_brown : constant Color := +(101, 67, 33);
Dark_byzantium : constant Color := +(93, 57, 84);
Dark_candy_apple_red : constant Color := +(164, 0, 0);
Dark_cerulean : constant Color := +(8, 69, 126);
Dark_champagne : constant Color := +(194, 178, 128);
Dark_chestnut : constant Color := +(152, 105, 96);
Dark_coral : constant Color := +(205, 91, 69);
Dark_cyan : constant Color := +(0, 139, 139);
Dark_electric_blue : constant Color := +(83, 104, 120);
Dark_goldenrod : constant Color := +(184, 134, 11);
Dark_green : constant Color := +(1, 50, 32);
Dark_jungle_green : constant Color := +(26, 36, 33);
Dark_khaki : constant Color := +(189, 183, 107);
Dark_lava : constant Color := +(72, 60, 50);
Dark_lavender : constant Color := +(115, 79, 150);
Dark_magenta : constant Color := +(139, 0, 139);
Dark_midnight_blue : constant Color := +(0, 51, 102);
Dark_orange : constant Color := +(255, 140, 0);
Dark_pastel_green : constant Color := +(3, 192, 60);
Dark_pink : constant Color := +(231, 84, 128);
Dark_powder_blue : constant Color := +(0, 51, 153);
Dark_raspberry : constant Color := +(135, 38, 87);
Dark_red : constant Color := +(139, 0, 0);
Dark_salmon : constant Color := +(233, 150, 122);
Dark_scarlet : constant Color := +(86, 3, 25);
Dark_sienna : constant Color := +(60, 20, 20);
Dark_slate_gray : constant Color := +(47, 79, 79);
Dark_spring_green : constant Color := +(23, 114, 69);
Dark_tan : constant Color := +(145, 129, 81);
Dark_tangerine : constant Color := +(255, 168, 18);
Dark_taupe : constant Color := +(72, 60, 50);
Dark_terra_cotta : constant Color := +(204, 78, 92);
Dark_turquoise : constant Color := +(0, 206, 209);
Dark_violet : constant Color := +(148, 0, 211);
Dartmouth_green : constant Color := +(13, 128, 15);
Davys_grey : constant Color := +(85, 85, 85);
Deep_carmine : constant Color := +(169, 32, 62);
Deep_carmine_pink : constant Color := +(239, 48, 56);
Deep_carrot_orange : constant Color := +(233, 105, 44);
Deep_cerise : constant Color := +(218, 50, 135);
Deep_champagne : constant Color := +(250, 214, 165);
Deep_chestnut : constant Color := +(185, 78, 72);
Deep_fuchsia : constant Color := +(193, 84, 193);
Deep_jungle_green : constant Color := +(0, 75, 73);
Deep_lilac : constant Color := +(153, 85, 187);
Deep_magenta : constant Color := +(205, 0, 204);
Deep_peach : constant Color := +(255, 203, 164);
Deep_pink : constant Color := +(255, 20, 147);
Deep_saffron : constant Color := +(255, 153, 51);
Deep_sky_blue : constant Color := +(0, 191, 255);
Denim : constant Color := +(21, 96, 189);
Desert : constant Color := +(193, 154, 107);
Desert_sand : constant Color := +(237, 201, 175);
Dim_gray : constant Color := +(105, 105, 105);
Dodger_blue : constant Color := +(30, 144, 255);
Dogwood_Rose : constant Color := +(215, 24, 104);
Drab : constant Color := +(150, 113, 23);
Duke_blue : constant Color := +(0, 0, 156);
Earth_yellow : constant Color := +(225, 169, 95);
Ecru : constant Color := +(194, 178, 128);
Eggplant : constant Color := +(97, 64, 81);
Eggshell : constant Color := +(240, 234, 214);
Egyptian_blue : constant Color := +(16, 52, 166);
Electric_blue : constant Color := +(125, 249, 255);
Electric_cyan : constant Color := +(0, 255, 255);
Electric_green : constant Color := +(0, 255, 0);
Electric_indigo : constant Color := +(111, 0, 255);
Electric_lavender : constant Color := +(244, 187, 255);
Electric_lime : constant Color := +(204, 255, 0);
Electric_purple : constant Color := +(191, 0, 255);
Electric_ultramarine : constant Color := +(63, 0, 255);
Electric_violet : constant Color := +(139, 0, 255);
Emerald : constant Color := +(80, 200, 120);
Eton_blue : constant Color := +(150, 200, 162);
Fallow : constant Color := +(193, 154, 107);
Falu_red : constant Color := +(128, 24, 24);
Fandango : constant Color := +(184, 84, 137);
Fashion_fuchsia : constant Color := +(244, 0, 161);
Fawn : constant Color := +(229, 170, 112);
Feldgrau : constant Color := +(77, 93, 83);
Fern_green : constant Color := +(79, 121, 66);
Field_drab : constant Color := +(108, 84, 30);
Firebrick : constant Color := +(178, 34, 34);
Fire_engine_red : constant Color := +(206, 22, 32);
Flame : constant Color := +(226, 88, 34);
Flamingo_pink : constant Color := +(252, 142, 172);
Flavescent : constant Color := +(247, 233, 142);
Flax : constant Color := +(238, 220, 130);
Forest_green : constant Color := +(1, 68, 33);
Forest_green_web : constant Color := +(34, 139, 34);
French_Beige : constant Color := +(166, 123, 91);
French_Rose : constant Color := +(246, 74, 138);
Fuchsia : constant Color := +(255, 0, 255);
Fuchsia_Pink : constant Color := +(255, 119, 255);
Fulvous : constant Color := +(220, 132, 0);
Gamboge : constant Color := +(228, 155, 15);
Ghost_white : constant Color := +(248, 248, 255);
Glaucous : constant Color := +(96, 130, 182);
Gold_metallic : constant Color := +(212, 175, 55);
Gold_web : constant Color := +(255, 215, 0);
Golden_brown : constant Color := +(153, 101, 21);
Golden_poppy : constant Color := +(252, 194, 0);
Golden_yellow : constant Color := +(255, 223, 0);
Goldenrod : constant Color := +(218, 165, 32);
Gray : constant Color := +(128, 128, 128);
Gray_asparagus : constant Color := +(70, 89, 69);
Green_web : constant Color := +(0, 128, 0);
Green_pigment : constant Color := +(0, 165, 80);
Green_RYB : constant Color := +(102, 176, 50);
Green_yellow : constant Color := +(173, 255, 47);
Grullo : constant Color := +(169, 154, 134);
Halaya_ube : constant Color := +(102, 56, 84);
Han_Blue : constant Color := +(82, 24, 250);
Han_Purple : constant Color := +(82, 24, 250);
Harlequin : constant Color := +(63, 255, 0);
Heliotrope : constant Color := +(223, 115, 255);
Hollywood_cerise : constant Color := +(244, 0, 161);
Honeydew : constant Color := +(240, 255, 240);
Hot_magenta : constant Color := +(255, 0, 204);
Hot_pink : constant Color := +(255, 105, 180);
Hunter_green : constant Color := +(53, 94, 59);
Iceberg : constant Color := +(113, 166, 210);
Icterine : constant Color := +(252, 247, 94);
India_green : constant Color := +(19, 136, 8);
Indian_yellow : constant Color := +(227, 168, 87);
Indigo : constant Color := +(0, 65, 106);
Indigo_web : constant Color := +(75, 0, 130);
International_Klein_Blue : constant Color := +(0, 47, 167);
International_orange : constant Color := +(255, 79, 0);
Iris : constant Color := +(90, 79, 207);
Isabelline : constant Color := +(244, 240, 236);
Islamic_green : constant Color := +(0, 144, 0);
Ivory : constant Color := +(255, 255, 240);
Jade : constant Color := +(0, 168, 107);
Jazzberry_jam : constant Color := +(165, 11, 94);
Jonquil : constant Color := +(250, 218, 94);
June_bud : constant Color := +(189, 218, 87);
Jungle_green : constant Color := +(41, 171, 135);
Kelly_green : constant Color := +(76, 187, 23);
Khaki_web : constant Color := +(195, 176, 145);
Khaki : constant Color := +(240, 230, 140);
Languid_lavender : constant Color := +(214, 202, 221);
Lava : constant Color := +(207, 16, 32);
Lavender_floral : constant Color := +(181, 126, 220);
Lavender_web : constant Color := +(230, 230, 250);
Lavender_blue : constant Color := +(204, 204, 255);
Lavender_blush : constant Color := +(255, 240, 245);
Lavender_gray : constant Color := +(196, 195, 208);
Lavender_indigo : constant Color := +(148, 87, 235);
Lavender_magenta : constant Color := +(238, 130, 238);
Lavender_mist : constant Color := +(230, 230, 250);
Lavender_pink : constant Color := +(251, 174, 210);
Lavender_purple : constant Color := +(150, 123, 182);
Lavender_rose : constant Color := +(251, 160, 227);
Lawn_green : constant Color := +(124, 252, 0);
Lemon : constant Color := +(255, 247, 0);
Lemon_chiffon : constant Color := +(255, 250, 205);
Light_apricot : constant Color := +(253, 213, 177);
Light_blue : constant Color := +(173, 216, 230);
Light_carmine_pink : constant Color := +(230, 103, 97);
Light_coral : constant Color := +(240, 128, 128);
Light_cornflower_blue : constant Color := +(173, 216, 230);
Light_fuchsia_pink : constant Color := +(249, 132, 229);
Light_khaki : constant Color := +(240, 230, 140);
Light_mauve : constant Color := +(220, 208, 255);
Light_pink : constant Color := +(255, 182, 193);
Light_sea_green : constant Color := +(32, 178, 170);
Light_salmon : constant Color := +(255, 160, 122);
Light_salmon_pink : constant Color := +(255, 153, 153);
Light_sky_blue : constant Color := +(135, 206, 250);
Light_slate_gray : constant Color := +(119, 136, 153);
Light_Thulian_pink : constant Color := +(230, 143, 172);
Lilac : constant Color := +(200, 162, 200);
Lime : constant Color := +(191, 255, 0);
Lime_web : constant Color := +(0, 255, 0);
Lime_green : constant Color := +(50, 205, 50);
Linen : constant Color := +(250, 240, 230);
Liver : constant Color := +(83, 75, 79);
Lust : constant Color := +(230, 32, 32);
Magenta_dye : constant Color := +(202, 21, 123);
Magenta_process : constant Color := +(255, 0, 144);
Magic_mint : constant Color := +(170, 240, 209);
Magnolia : constant Color := +(248, 244, 255);
Mahogany : constant Color := +(192, 64, 0);
Maize : constant Color := +(251, 236, 94);
Majorelle_Blue : constant Color := +(96, 80, 220);
Malachite : constant Color := +(11, 218, 81);
Maroon_web : constant Color := +(128, 0, 0);
Maroon : constant Color := +(176, 48, 96);
Mauve : constant Color := +(224, 176, 255);
Mauve_taupe : constant Color := +(145, 95, 109);
Maya_blue : constant Color := +(115, 194, 251);
Medium_aquamarine : constant Color := +(0, 84, 180);
Medium_blue : constant Color := +(0, 0, 205);
Medium_candy_apple_red : constant Color := +(226, 6, 44);
Medium_carmine : constant Color := +(175, 64, 53);
Medium_champagne : constant Color := +(243, 229, 171);
Medium_electric_blue : constant Color := +(3, 80, 150);
Medium_jungle_green : constant Color := +(28, 53, 45);
Medium_lavender_magenta : constant Color := +(204, 153, 204);
Medium_Persian_blue : constant Color := +(0, 103, 165);
Medium_purple : constant Color := +(147, 112, 219);
Medium_red_violet : constant Color := +(187, 51, 133);
Medium_sea_green : constant Color := +(60, 179, 113);
Medium_spring_bud : constant Color := +(201, 220, 137);
Medium_spring_green : constant Color := +(0, 250, 154);
Medium_taupe : constant Color := +(103, 76, 71);
Medium_teal_blue : constant Color := +(0, 84, 180);
Medium_turquoise : constant Color := +(72, 209, 204);
Midnight_blue : constant Color := +(25, 25, 112);
Midnight_green : constant Color := +(0, 73, 83);
Eagle_green : constant Color := +(0, 73, 83);
Mikado_yellow : constant Color := +(255, 196, 12);
Mint_green : constant Color := +(152, 255, 152);
Misty_rose : constant Color := +(255, 228, 225);
Moccasin : constant Color := +(250, 235, 215);
Mode_Beige : constant Color := +(150, 113, 23);
Mordant_red : constant Color := +(174, 12, 0);
Moss_green : constant Color := +(173, 223, 173);
Mountbatten_pink : constant Color := +(153, 122, 141);
Mulberry : constant Color := +(197, 75, 140);
Mustard : constant Color := +(255, 219, 88);
Myrtle : constant Color := +(33, 66, 30);
MSU_Green : constant Color := +(0, 102, 51);
Nadeshiko_pink : constant Color := +(246, 173, 198);
Napier_Green : constant Color := +(42, 128, 0);
Naples_Yellow : constant Color := +(250, 218, 94);
Navajo_white : constant Color := +(255, 222, 173);
Navy_Blue : constant Color := +(0, 0, 128);
Ochre : constant Color := +(204, 119, 34);
Office_green : constant Color := +(0, 128, 0);
Old_Gold : constant Color := +(207, 181, 59);
Old_Lace : constant Color := +(253, 245, 230);
Old_lavender : constant Color := +(121, 104, 120);
Old_Rose : constant Color := +(192, 128, 129);
Olive : constant Color := +(128, 128, 0);
Olive_Drab_web : constant Color := +(107, 142, 35);
Olive_Drab : constant Color := +(60, 52, 31);
Olivine : constant Color := +(154, 185, 115);
Onyx : constant Color := +(15, 15, 15);
Opera_mauve : constant Color := +(183, 132, 167);
Orange_color_wheel : constant Color := +(255, 127, 0);
Orange_RYB : constant Color := +(251, 153, 2);
Orange_web : constant Color := +(255, 165, 0);
Orange_peel : constant Color := +(255, 159, 0);
Orange_red : constant Color := +(255, 69, 0);
Orchid : constant Color := +(218, 112, 214);
Oxford_Blue : constant Color := +(0, 33, 71);
OU_Crimson_Red : constant Color := +(153, 0, 0);
Pale_Amaranth_Pink : constant Color := +(221, 190, 195);
Pale_blue : constant Color := +(175, 238, 238);
Pale_brown : constant Color := +(152, 118, 84);
Pale_carmine : constant Color := +(175, 64, 53);
Pale_cerulean : constant Color := +(155, 196, 226);
Pale_chestnut : constant Color := +(221, 173, 175);
Pale_copper : constant Color := +(218, 138, 103);
Pale_cornflower_blue : constant Color := +(171, 205, 239);
Pale_gold : constant Color := +(230, 190, 138);
Pale_magenta : constant Color := +(249, 132, 229);
Pale_pink : constant Color := +(250, 218, 221);
Pale_red_violet : constant Color := +(219, 112, 147);
Pale_robin_egg_blue : constant Color := +(150, 222, 209);
Pale_silver : constant Color := +(201, 192, 187);
Pale_spring_bud : constant Color := +(236, 235, 189);
Pale_taupe : constant Color := +(188, 152, 126);
Palatinate_blue : constant Color := +(39, 59, 226);
Palatinate_purple : constant Color := +(104, 40, 96);
Pansy_purple : constant Color := +(120, 24, 74);
Papaya_whip : constant Color := +(255, 239, 213);
Pastel_green : constant Color := +(119, 221, 119);
Pastel_pink : constant Color := +(255, 209, 220);
Paynes_grey : constant Color := +(64, 64, 72);
Peach : constant Color := +(255, 229, 180);
Peach_orange : constant Color := +(255, 204, 153);
Peach_puff : constant Color := +(255, 218, 185);
Peach_yellow : constant Color := +(250, 223, 173);
Pear : constant Color := +(209, 226, 49);
Pearl : constant Color := +(240, 234, 214);
Periwinkle : constant Color := +(204, 204, 255);
Persian_blue : constant Color := +(28, 57, 187);
Persian_green : constant Color := +(0, 166, 147);
Persian_indigo : constant Color := +(50, 18, 122);
Persian_orange : constant Color := +(217, 144, 88);
Persian_red : constant Color := +(204, 51, 51);
Persian_pink : constant Color := +(247, 127, 190);
Persian_rose : constant Color := +(254, 40, 162);
Persimmon : constant Color := +(236, 88, 0);
Phthalo_blue : constant Color := +(0, 15, 137);
Phthalo_green : constant Color := +(18, 53, 36);
Piggy_pink : constant Color := +(253, 221, 230);
Pine_green : constant Color := +(1, 121, 111);
Pink : constant Color := +(255, 192, 203);
Pink_orange : constant Color := +(255, 153, 102);
Pistachio : constant Color := +(147, 197, 114);
Platinum : constant Color := +(229, 228, 226);
Plum : constant Color := +(204, 153, 204);
Portland_Orange : constant Color := +(255, 90, 54);
Powder_blue : constant Color := +(176, 224, 230);
Princeton_Orange : constant Color := +(215, 71, 33);
Prussian_blue : constant Color := +(0, 49, 83);
Psychedelic_purple : constant Color := +(221, 0, 255);
Puce : constant Color := +(204, 136, 153);
Pumpkin : constant Color := +(255, 117, 24);
Purple_web : constant Color := +(127, 0, 127);
Purple : constant Color := +(160, 92, 240);
Purple_Heart : constant Color := +(105, 53, 156);
Purple_mountain_majesty : constant Color := +(150, 120, 182);
Purple_taupe : constant Color := +(80, 64, 77);
Radical_Red : constant Color := +(255, 53, 94);
Raspberry : constant Color := +(227, 11, 92);
Raspberry_glace : constant Color := +(145, 95, 109);
Raspberry_pink : constant Color := +(226, 80, 155);
Raspberry_rose : constant Color := +(179, 68, 108);
Raw_umber : constant Color := +(130, 102, 68);
Razzle_dazzle_rose : constant Color := +(255, 51, 204);
Razzmatazz : constant Color := +(227, 37, 107);
Red_pigment : constant Color := +(237, 28, 36);
Red_RYB : constant Color := +(254, 39, 18);
Red_violet : constant Color := +(199, 21, 133);
Rich_black : constant Color := +(0, 64, 64);
Rich_brilliant_lavender : constant Color := +(241, 167, 254);
Rich_carmine : constant Color := +(215, 0, 64);
Rich_electric_blue : constant Color := +(8, 146, 208);
Rich_lavender : constant Color := +(170, 97, 204);
Rich_maroon : constant Color := +(176, 48, 96);
Rifle_green : constant Color := +(65, 72, 51);
Robin_egg_blue : constant Color := +(0, 204, 204);
Rose_Ebony : constant Color := +(103, 76, 71);
Rose_Gold : constant Color := +(183, 110, 121);
Rose_Madder : constant Color := +(227, 38, 54);
Rose_pink : constant Color := +(255, 102, 204);
Rose_quartz : constant Color := +(170, 152, 169);
Rose_taupe : constant Color := +(144, 93, 93);
Rose_vale : constant Color := +(171, 78, 82);
Rosewood : constant Color := +(101, 0, 11);
Rosso_corsa : constant Color := +(212, 0, 0);
Rosy_brown : constant Color := +(188, 143, 143);
Royal_azure : constant Color := +(0, 56, 168);
Royal_blue : constant Color := +(0, 35, 102);
Royal_blue_web : constant Color := +(65, 105, 225);
Royal_fuchsia : constant Color := +(202, 44, 146);
Royal_purple : constant Color := +(107, 63, 160);
Ruby : constant Color := +(224, 17, 95);
Rufous : constant Color := +(168, 28, 7);
Russet : constant Color := +(128, 70, 27);
Rust : constant Color := +(183, 65, 14);
Sacramento_State_green : constant Color := +(0, 86, 63);
Saddle_brown : constant Color := +(139, 69, 19);
Safety_orange : constant Color := +(255, 102, 0);
blaze_orange : constant Color := +(255, 102, 0);
Saffron : constant Color := +(244, 196, 48);
St_Patricks_blue : constant Color := +(35, 41, 122);
Salmon : constant Color := +(255, 140, 105);
Salmon_pink : constant Color := +(255, 145, 164);
Sand : constant Color := +(194, 178, 128);
Sand_dune : constant Color := +(150, 113, 23);
Sandy_brown : constant Color := +(244, 164, 96);
Sandy_taupe : constant Color := +(150, 113, 23);
Sangria : constant Color := +(146, 0, 10);
Sap_green : constant Color := +(80, 125, 42);
Sapphire : constant Color := +(8, 37, 103);
Satin_sheen_gold : constant Color := +(203, 161, 53);
Scarlet : constant Color := +(255, 32, 0);
School_bus_yellow : constant Color := +(255, 216, 0);
Sea_green : constant Color := +(46, 139, 87);
Seal_brown : constant Color := +(50, 20, 20);
Seashell : constant Color := +(255, 245, 238);
Selective_yellow : constant Color := +(255, 186, 0);
Sepia : constant Color := +(112, 66, 20);
Shamrock_green : constant Color := +(0, 158, 96);
Shocking_pink : constant Color := +(252, 15, 192);
Sienna : constant Color := +(136, 45, 23);
Silver : constant Color := +(192, 192, 192);
Skobeloff : constant Color := +(0, 122, 116);
Sky_blue : constant Color := +(135, 206, 235);
Sky_magenta : constant Color := +(207, 113, 175);
Slate_gray : constant Color := +(112, 128, 144);
Smalt : constant Color := +(0, 51, 153);
Smoky_black : constant Color := +(16, 12, 8);
Snow : constant Color := +(255, 250, 250);
Splashed_white : constant Color := +(254, 253, 255);
Spring_bud : constant Color := +(167, 252, 0);
Steel_blue : constant Color := +(70, 130, 180);
Straw : constant Color := +(228, 117, 111);
Sunglow : constant Color := +(255, 204, 51);
Sunset : constant Color := +(250, 214, 165);
Tan : constant Color := +(210, 180, 140);
Tangelo : constant Color := +(249, 77, 0);
Tangerine : constant Color := +(242, 133, 0);
Tangerine_yellow : constant Color := +(255, 204, 0);
Taupe : constant Color := +(72, 60, 50);
Taupe_gray : constant Color := +(139, 133, 137);
Tea_green : constant Color := +(208, 240, 192);
Tea_rose_orange : constant Color := +(248, 131, 121);
Tea_rose : constant Color := +(244, 194, 194);
Teal : constant Color := +(0, 128, 128);
Teal_blue : constant Color := +(54, 117, 136);
Tenne : constant Color := +(205, 87, 0);
Tawny : constant Color := +(205, 87, 0);
Terra_cotta : constant Color := +(226, 114, 91);
Thistle : constant Color := +(216, 191, 216);
Thulian_pink : constant Color := +(222, 111, 161);
Tiffany_Blue : constant Color := +(10, 186, 181);
Tomato : constant Color := +(255, 99, 71);
Torch_red : constant Color := +(253, 14, 53);
Tropical_rain_forest : constant Color := +(0, 117, 94);
Turkish_Rose : constant Color := +(181, 114, 129);
Turquoise : constant Color := +(48, 213, 200);
Turquoise_blue : constant Color := +(0, 191, 255);
Tuscan_red : constant Color := +(123, 54, 54);
Twilight_lavender : constant Color := +(138, 73, 107);
Tyrian_purple : constant Color := +(102, 2, 60);
Ube : constant Color := +(136, 120, 195);
Ultramarine : constant Color := +(18, 10, 143);
Ultramarine_blue : constant Color := +(65, 102, 245);
Ultra_pink : constant Color := +(255, 111, 255);
Umber : constant Color := +(99, 81, 71);
United_Nations_blue : constant Color := +(91, 146, 229);
Upsdell_red : constant Color := +(174, 22, 32);
UP_Forest_green : constant Color := +(1, 68, 33);
UP_Maroon : constant Color := +(123, 17, 19);
Vegas_Gold : constant Color := +(197, 179, 88);
Venetian_red : constant Color := +(200, 8, 21);
Vermilion : constant Color := +(227, 66, 51);
Violet_wheel : constant Color := +(128, 0, 255);
Violet_web : constant Color := +(238, 130, 238);
Violet_RYB : constant Color := +(134, 1, 175);
Viridian : constant Color := +(64, 130, 109);
Vivid_auburn : constant Color := +(147, 39, 36);
Vivid_burgundy : constant Color := +(159, 29, 53);
Vivid_violet : constant Color := +(153, 0, 255);
Warm_black : constant Color := +(0, 66, 66);
Wenge : constant Color := +(100, 84, 82);
Wheat : constant Color := +(245, 222, 179);
White_smoke : constant Color := +(245, 245, 245);
Wild_blue_yonder : constant Color := +(162, 173, 208);
Wisteria : constant Color := +(201, 160, 220);
Xanadu : constant Color := +(115, 134, 120);
Yale_Blue : constant Color := +(15, 77, 146);
Yellow_process : constant Color := +(255, 239, 0);
Yellow_RYB : constant Color := +(254, 254, 51);
Yellow_green : constant Color := +(154, 205, 50);
end openGL.Palette;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Strings.Search;
with Ada.Unchecked_Deallocation;
package body Ada.Strings.Unbounded is
use Ada.Strings.Maps;
Growth_Factor : constant := 32;
-- The growth factor controls how much extra space is allocated when
-- we have to increase the size of an allocated unbounded string. By
-- allocating extra space, we avoid the need to reallocate on every
-- append, particularly important when a string is built up by repeated
-- append operations of small pieces. This is expressed as a factor so
-- 32 means add 1/32 of the length of the string as growth space.
Min_Mul_Alloc : constant := Standard'Maximum_Alignment;
-- Allocation will be done by a multiple of Min_Mul_Alloc. This causes
-- no memory loss as most (all?) malloc implementations are obliged to
-- align the returned memory on the maximum alignment as malloc does not
-- know the target alignment.
function Aligned_Max_Length (Max_Length : Natural) return Natural;
-- Returns recommended length of the shared string which is greater or
-- equal to specified length. Calculation take in sense alignment of the
-- allocated memory segments to use memory effectively by Append/Insert/etc
-- operations.
---------
-- "&" --
---------
function "&"
(Left : Unbounded_String;
Right : Unbounded_String) return Unbounded_String
is
LR : constant Shared_String_Access := Left.Reference;
RR : constant Shared_String_Access := Right.Reference;
DL : constant Natural := LR.Last + RR.Last;
DR : Shared_String_Access;
begin
-- Result is an empty string, reuse shared empty string
if DL = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Left string is empty, return Right string
elsif LR.Last = 0 then
Reference (RR);
DR := RR;
-- Right string is empty, return Left string
elsif RR.Last = 0 then
Reference (LR);
DR := LR;
-- Otherwise, allocate new shared string and fill data
else
DR := Allocate (DL);
DR.Data (1 .. LR.Last) := LR.Data (1 .. LR.Last);
DR.Data (LR.Last + 1 .. DL) := RR.Data (1 .. RR.Last);
DR.Last := DL;
end if;
return (AF.Controlled with Reference => DR);
end "&";
function "&"
(Left : Unbounded_String;
Right : String) return Unbounded_String
is
LR : constant Shared_String_Access := Left.Reference;
DL : constant Natural := LR.Last + Right'Length;
DR : Shared_String_Access;
begin
-- Result is an empty string, reuse shared empty string
if DL = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Right is an empty string, return Left string
elsif Right'Length = 0 then
Reference (LR);
DR := LR;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (DL);
DR.Data (1 .. LR.Last) := LR.Data (1 .. LR.Last);
DR.Data (LR.Last + 1 .. DL) := Right;
DR.Last := DL;
end if;
return (AF.Controlled with Reference => DR);
end "&";
function "&"
(Left : String;
Right : Unbounded_String) return Unbounded_String
is
RR : constant Shared_String_Access := Right.Reference;
DL : constant Natural := Left'Length + RR.Last;
DR : Shared_String_Access;
begin
-- Result is an empty string, reuse shared one
if DL = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Left is empty string, return Right string
elsif Left'Length = 0 then
Reference (RR);
DR := RR;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (DL);
DR.Data (1 .. Left'Length) := Left;
DR.Data (Left'Length + 1 .. DL) := RR.Data (1 .. RR.Last);
DR.Last := DL;
end if;
return (AF.Controlled with Reference => DR);
end "&";
function "&"
(Left : Unbounded_String;
Right : Character) return Unbounded_String
is
LR : constant Shared_String_Access := Left.Reference;
DL : constant Natural := LR.Last + 1;
DR : Shared_String_Access;
begin
DR := Allocate (DL);
DR.Data (1 .. LR.Last) := LR.Data (1 .. LR.Last);
DR.Data (DL) := Right;
DR.Last := DL;
return (AF.Controlled with Reference => DR);
end "&";
function "&"
(Left : Character;
Right : Unbounded_String) return Unbounded_String
is
RR : constant Shared_String_Access := Right.Reference;
DL : constant Natural := 1 + RR.Last;
DR : Shared_String_Access;
begin
DR := Allocate (DL);
DR.Data (1) := Left;
DR.Data (2 .. DL) := RR.Data (1 .. RR.Last);
DR.Last := DL;
return (AF.Controlled with Reference => DR);
end "&";
---------
-- "*" --
---------
function "*"
(Left : Natural;
Right : Character) return Unbounded_String
is
DR : Shared_String_Access;
begin
-- Result is an empty string, reuse shared empty string
if Left = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (Left);
for J in 1 .. Left loop
DR.Data (J) := Right;
end loop;
DR.Last := Left;
end if;
return (AF.Controlled with Reference => DR);
end "*";
function "*"
(Left : Natural;
Right : String) return Unbounded_String
is
DL : constant Natural := Left * Right'Length;
DR : Shared_String_Access;
K : Positive;
begin
-- Result is an empty string, reuse shared empty string
if DL = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (DL);
K := 1;
for J in 1 .. Left loop
DR.Data (K .. K + Right'Length - 1) := Right;
K := K + Right'Length;
end loop;
DR.Last := DL;
end if;
return (AF.Controlled with Reference => DR);
end "*";
function "*"
(Left : Natural;
Right : Unbounded_String) return Unbounded_String
is
RR : constant Shared_String_Access := Right.Reference;
DL : constant Natural := Left * RR.Last;
DR : Shared_String_Access;
K : Positive;
begin
-- Result is an empty string, reuse shared empty string
if DL = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Coefficient is one, just return string itself
elsif Left = 1 then
Reference (RR);
DR := RR;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (DL);
K := 1;
for J in 1 .. Left loop
DR.Data (K .. K + RR.Last - 1) := RR.Data (1 .. RR.Last);
K := K + RR.Last;
end loop;
DR.Last := DL;
end if;
return (AF.Controlled with Reference => DR);
end "*";
---------
-- "<" --
---------
function "<"
(Left : Unbounded_String;
Right : Unbounded_String) return Boolean
is
LR : constant Shared_String_Access := Left.Reference;
RR : constant Shared_String_Access := Right.Reference;
begin
return LR.Data (1 .. LR.Last) < RR.Data (1 .. RR.Last);
end "<";
function "<"
(Left : Unbounded_String;
Right : String) return Boolean
is
LR : constant Shared_String_Access := Left.Reference;
begin
return LR.Data (1 .. LR.Last) < Right;
end "<";
function "<"
(Left : String;
Right : Unbounded_String) return Boolean
is
RR : constant Shared_String_Access := Right.Reference;
begin
return Left < RR.Data (1 .. RR.Last);
end "<";
----------
-- "<=" --
----------
function "<="
(Left : Unbounded_String;
Right : Unbounded_String) return Boolean
is
LR : constant Shared_String_Access := Left.Reference;
RR : constant Shared_String_Access := Right.Reference;
begin
-- LR = RR means two strings shares shared string, thus they are equal
return LR = RR or else LR.Data (1 .. LR.Last) <= RR.Data (1 .. RR.Last);
end "<=";
function "<="
(Left : Unbounded_String;
Right : String) return Boolean
is
LR : constant Shared_String_Access := Left.Reference;
begin
return LR.Data (1 .. LR.Last) <= Right;
end "<=";
function "<="
(Left : String;
Right : Unbounded_String) return Boolean
is
RR : constant Shared_String_Access := Right.Reference;
begin
return Left <= RR.Data (1 .. RR.Last);
end "<=";
---------
-- "=" --
---------
function "="
(Left : Unbounded_String;
Right : Unbounded_String) return Boolean
is
LR : constant Shared_String_Access := Left.Reference;
RR : constant Shared_String_Access := Right.Reference;
begin
return LR = RR or else LR.Data (1 .. LR.Last) = RR.Data (1 .. RR.Last);
-- LR = RR means two strings shares shared string, thus they are equal
end "=";
function "="
(Left : Unbounded_String;
Right : String) return Boolean
is
LR : constant Shared_String_Access := Left.Reference;
begin
return LR.Data (1 .. LR.Last) = Right;
end "=";
function "="
(Left : String;
Right : Unbounded_String) return Boolean
is
RR : constant Shared_String_Access := Right.Reference;
begin
return Left = RR.Data (1 .. RR.Last);
end "=";
---------
-- ">" --
---------
function ">"
(Left : Unbounded_String;
Right : Unbounded_String) return Boolean
is
LR : constant Shared_String_Access := Left.Reference;
RR : constant Shared_String_Access := Right.Reference;
begin
return LR.Data (1 .. LR.Last) > RR.Data (1 .. RR.Last);
end ">";
function ">"
(Left : Unbounded_String;
Right : String) return Boolean
is
LR : constant Shared_String_Access := Left.Reference;
begin
return LR.Data (1 .. LR.Last) > Right;
end ">";
function ">"
(Left : String;
Right : Unbounded_String) return Boolean
is
RR : constant Shared_String_Access := Right.Reference;
begin
return Left > RR.Data (1 .. RR.Last);
end ">";
----------
-- ">=" --
----------
function ">="
(Left : Unbounded_String;
Right : Unbounded_String) return Boolean
is
LR : constant Shared_String_Access := Left.Reference;
RR : constant Shared_String_Access := Right.Reference;
begin
-- LR = RR means two strings shares shared string, thus they are equal
return LR = RR or else LR.Data (1 .. LR.Last) >= RR.Data (1 .. RR.Last);
end ">=";
function ">="
(Left : Unbounded_String;
Right : String) return Boolean
is
LR : constant Shared_String_Access := Left.Reference;
begin
return LR.Data (1 .. LR.Last) >= Right;
end ">=";
function ">="
(Left : String;
Right : Unbounded_String) return Boolean
is
RR : constant Shared_String_Access := Right.Reference;
begin
return Left >= RR.Data (1 .. RR.Last);
end ">=";
------------
-- Adjust --
------------
procedure Adjust (Object : in out Unbounded_String) is
begin
Reference (Object.Reference);
end Adjust;
------------------------
-- Aligned_Max_Length --
------------------------
function Aligned_Max_Length (Max_Length : Natural) return Natural is
Static_Size : constant Natural :=
Empty_Shared_String'Size / Standard'Storage_Unit;
-- Total size of all static components
begin
return
((Static_Size + Max_Length - 1) / Min_Mul_Alloc + 2) * Min_Mul_Alloc
- Static_Size;
end Aligned_Max_Length;
--------------
-- Allocate --
--------------
function Allocate
(Max_Length : Natural) return not null Shared_String_Access
is
begin
-- Empty string requested, return shared empty string
if Max_Length = 0 then
Reference (Empty_Shared_String'Access);
return Empty_Shared_String'Access;
-- Otherwise, allocate requested space (and probably some more room)
else
return new Shared_String (Aligned_Max_Length (Max_Length));
end if;
end Allocate;
------------
-- Append --
------------
procedure Append
(Source : in out Unbounded_String;
New_Item : Unbounded_String)
is
SR : constant Shared_String_Access := Source.Reference;
NR : constant Shared_String_Access := New_Item.Reference;
DL : constant Natural := SR.Last + NR.Last;
DR : Shared_String_Access;
begin
-- Source is an empty string, reuse New_Item data
if SR.Last = 0 then
Reference (NR);
Source.Reference := NR;
Unreference (SR);
-- New_Item is empty string, nothing to do
elsif NR.Last = 0 then
null;
-- Try to reuse existing shared string
elsif Can_Be_Reused (SR, DL) then
SR.Data (SR.Last + 1 .. DL) := NR.Data (1 .. NR.Last);
SR.Last := DL;
-- Otherwise, allocate new one and fill it
else
DR := Allocate (DL + DL / Growth_Factor);
DR.Data (1 .. SR.Last) := SR.Data (1 .. SR.Last);
DR.Data (SR.Last + 1 .. DL) := NR.Data (1 .. NR.Last);
DR.Last := DL;
Source.Reference := DR;
Unreference (SR);
end if;
end Append;
procedure Append
(Source : in out Unbounded_String;
New_Item : String)
is
SR : constant Shared_String_Access := Source.Reference;
DL : constant Natural := SR.Last + New_Item'Length;
DR : Shared_String_Access;
begin
-- New_Item is an empty string, nothing to do
if New_Item'Length = 0 then
null;
-- Try to reuse existing shared string
elsif Can_Be_Reused (SR, DL) then
SR.Data (SR.Last + 1 .. DL) := New_Item;
SR.Last := DL;
-- Otherwise, allocate new one and fill it
else
DR := Allocate (DL + DL / Growth_Factor);
DR.Data (1 .. SR.Last) := SR.Data (1 .. SR.Last);
DR.Data (SR.Last + 1 .. DL) := New_Item;
DR.Last := DL;
Source.Reference := DR;
Unreference (SR);
end if;
end Append;
procedure Append
(Source : in out Unbounded_String;
New_Item : Character)
is
SR : constant Shared_String_Access := Source.Reference;
DL : constant Natural := SR.Last + 1;
DR : Shared_String_Access;
begin
-- Try to reuse existing shared string
if Can_Be_Reused (SR, SR.Last + 1) then
SR.Data (SR.Last + 1) := New_Item;
SR.Last := SR.Last + 1;
-- Otherwise, allocate new one and fill it
else
DR := Allocate (DL + DL / Growth_Factor);
DR.Data (1 .. SR.Last) := SR.Data (1 .. SR.Last);
DR.Data (DL) := New_Item;
DR.Last := DL;
Source.Reference := DR;
Unreference (SR);
end if;
end Append;
-------------------
-- Can_Be_Reused --
-------------------
function Can_Be_Reused
(Item : not null Shared_String_Access;
Length : Natural) return Boolean
is
begin
return
System.Atomic_Counters.Is_One (Item.Counter)
and then Item.Max_Length >= Length
and then Item.Max_Length <=
Aligned_Max_Length (Length + Length / Growth_Factor);
end Can_Be_Reused;
-----------
-- Count --
-----------
function Count
(Source : Unbounded_String;
Pattern : String;
Mapping : Maps.Character_Mapping := Maps.Identity) return Natural
is
SR : constant Shared_String_Access := Source.Reference;
begin
return Search.Count (SR.Data (1 .. SR.Last), Pattern, Mapping);
end Count;
function Count
(Source : Unbounded_String;
Pattern : String;
Mapping : Maps.Character_Mapping_Function) return Natural
is
SR : constant Shared_String_Access := Source.Reference;
begin
return Search.Count (SR.Data (1 .. SR.Last), Pattern, Mapping);
end Count;
function Count
(Source : Unbounded_String;
Set : Maps.Character_Set) return Natural
is
SR : constant Shared_String_Access := Source.Reference;
begin
return Search.Count (SR.Data (1 .. SR.Last), Set);
end Count;
------------
-- Delete --
------------
function Delete
(Source : Unbounded_String;
From : Positive;
Through : Natural) return Unbounded_String
is
SR : constant Shared_String_Access := Source.Reference;
DL : Natural;
DR : Shared_String_Access;
begin
-- Empty slice is deleted, use the same shared string
if From > Through then
Reference (SR);
DR := SR;
-- Index is out of range
elsif Through > SR.Last then
raise Index_Error;
-- Compute size of the result
else
DL := SR.Last - (Through - From + 1);
-- Result is an empty string, reuse shared empty string
if DL = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (DL);
DR.Data (1 .. From - 1) := SR.Data (1 .. From - 1);
DR.Data (From .. DL) := SR.Data (Through + 1 .. SR.Last);
DR.Last := DL;
end if;
end if;
return (AF.Controlled with Reference => DR);
end Delete;
procedure Delete
(Source : in out Unbounded_String;
From : Positive;
Through : Natural)
is
SR : constant Shared_String_Access := Source.Reference;
DL : Natural;
DR : Shared_String_Access;
begin
-- Nothing changed, return
if From > Through then
null;
-- Through is outside of the range
elsif Through > SR.Last then
raise Index_Error;
else
DL := SR.Last - (Through - From + 1);
-- Result is empty, reuse shared empty string
if DL = 0 then
Reference (Empty_Shared_String'Access);
Source.Reference := Empty_Shared_String'Access;
Unreference (SR);
-- Try to reuse existing shared string
elsif Can_Be_Reused (SR, DL) then
SR.Data (From .. DL) := SR.Data (Through + 1 .. SR.Last);
SR.Last := DL;
-- Otherwise, allocate new shared string
else
DR := Allocate (DL);
DR.Data (1 .. From - 1) := SR.Data (1 .. From - 1);
DR.Data (From .. DL) := SR.Data (Through + 1 .. SR.Last);
DR.Last := DL;
Source.Reference := DR;
Unreference (SR);
end if;
end if;
end Delete;
-------------
-- Element --
-------------
function Element
(Source : Unbounded_String;
Index : Positive) return Character
is
SR : constant Shared_String_Access := Source.Reference;
begin
if Index <= SR.Last then
return SR.Data (Index);
else
raise Index_Error;
end if;
end Element;
--------------
-- Finalize --
--------------
procedure Finalize (Object : in out Unbounded_String) is
SR : constant not null Shared_String_Access := Object.Reference;
begin
if SR /= Null_Unbounded_String.Reference then
-- The same controlled object can be finalized several times for
-- some reason. As per 7.6.1(24) this should have no ill effect,
-- so we need to add a guard for the case of finalizing the same
-- object twice.
-- We set the Object to the empty string so there will be no ill
-- effects if a program references an already-finalized object.
Object.Reference := Null_Unbounded_String.Reference;
Reference (Object.Reference);
Unreference (SR);
end if;
end Finalize;
----------------
-- Find_Token --
----------------
procedure Find_Token
(Source : Unbounded_String;
Set : Maps.Character_Set;
From : Positive;
Test : Strings.Membership;
First : out Positive;
Last : out Natural)
is
SR : constant Shared_String_Access := Source.Reference;
begin
Search.Find_Token (SR.Data (From .. SR.Last), Set, Test, First, Last);
end Find_Token;
procedure Find_Token
(Source : Unbounded_String;
Set : Maps.Character_Set;
Test : Strings.Membership;
First : out Positive;
Last : out Natural)
is
SR : constant Shared_String_Access := Source.Reference;
begin
Search.Find_Token (SR.Data (1 .. SR.Last), Set, Test, First, Last);
end Find_Token;
----------
-- Free --
----------
procedure Free (X : in out String_Access) is
procedure Deallocate is
new Ada.Unchecked_Deallocation (String, String_Access);
begin
Deallocate (X);
end Free;
----------
-- Head --
----------
function Head
(Source : Unbounded_String;
Count : Natural;
Pad : Character := Space) return Unbounded_String
is
SR : constant Shared_String_Access := Source.Reference;
DR : Shared_String_Access;
begin
-- Result is empty, reuse shared empty string
if Count = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Length of the string is the same as requested, reuse source shared
-- string.
elsif Count = SR.Last then
Reference (SR);
DR := SR;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (Count);
-- Length of the source string is more than requested, copy
-- corresponding slice.
if Count < SR.Last then
DR.Data (1 .. Count) := SR.Data (1 .. Count);
-- Length of the source string is less than requested, copy all
-- contents and fill others by Pad character.
else
DR.Data (1 .. SR.Last) := SR.Data (1 .. SR.Last);
for J in SR.Last + 1 .. Count loop
DR.Data (J) := Pad;
end loop;
end if;
DR.Last := Count;
end if;
return (AF.Controlled with Reference => DR);
end Head;
procedure Head
(Source : in out Unbounded_String;
Count : Natural;
Pad : Character := Space)
is
SR : constant Shared_String_Access := Source.Reference;
DR : Shared_String_Access;
begin
-- Result is empty, reuse empty shared string
if Count = 0 then
Reference (Empty_Shared_String'Access);
Source.Reference := Empty_Shared_String'Access;
Unreference (SR);
-- Result is same as source string, reuse source shared string
elsif Count = SR.Last then
null;
-- Try to reuse existing shared string
elsif Can_Be_Reused (SR, Count) then
if Count > SR.Last then
for J in SR.Last + 1 .. Count loop
SR.Data (J) := Pad;
end loop;
end if;
SR.Last := Count;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (Count);
-- Length of the source string is greater than requested, copy
-- corresponding slice.
if Count < SR.Last then
DR.Data (1 .. Count) := SR.Data (1 .. Count);
-- Length of the source string is less than requested, copy all
-- existing data and fill remaining positions with Pad characters.
else
DR.Data (1 .. SR.Last) := SR.Data (1 .. SR.Last);
for J in SR.Last + 1 .. Count loop
DR.Data (J) := Pad;
end loop;
end if;
DR.Last := Count;
Source.Reference := DR;
Unreference (SR);
end if;
end Head;
-----------
-- Index --
-----------
function Index
(Source : Unbounded_String;
Pattern : String;
Going : Strings.Direction := Strings.Forward;
Mapping : Maps.Character_Mapping := Maps.Identity) return Natural
is
SR : constant Shared_String_Access := Source.Reference;
begin
return Search.Index (SR.Data (1 .. SR.Last), Pattern, Going, Mapping);
end Index;
function Index
(Source : Unbounded_String;
Pattern : String;
Going : Direction := Forward;
Mapping : Maps.Character_Mapping_Function) return Natural
is
SR : constant Shared_String_Access := Source.Reference;
begin
return Search.Index (SR.Data (1 .. SR.Last), Pattern, Going, Mapping);
end Index;
function Index
(Source : Unbounded_String;
Set : Maps.Character_Set;
Test : Strings.Membership := Strings.Inside;
Going : Strings.Direction := Strings.Forward) return Natural
is
SR : constant Shared_String_Access := Source.Reference;
begin
return Search.Index (SR.Data (1 .. SR.Last), Set, Test, Going);
end Index;
function Index
(Source : Unbounded_String;
Pattern : String;
From : Positive;
Going : Direction := Forward;
Mapping : Maps.Character_Mapping := Maps.Identity) return Natural
is
SR : constant Shared_String_Access := Source.Reference;
begin
return Search.Index
(SR.Data (1 .. SR.Last), Pattern, From, Going, Mapping);
end Index;
function Index
(Source : Unbounded_String;
Pattern : String;
From : Positive;
Going : Direction := Forward;
Mapping : Maps.Character_Mapping_Function) return Natural
is
SR : constant Shared_String_Access := Source.Reference;
begin
return Search.Index
(SR.Data (1 .. SR.Last), Pattern, From, Going, Mapping);
end Index;
function Index
(Source : Unbounded_String;
Set : Maps.Character_Set;
From : Positive;
Test : Membership := Inside;
Going : Direction := Forward) return Natural
is
SR : constant Shared_String_Access := Source.Reference;
begin
return Search.Index (SR.Data (1 .. SR.Last), Set, From, Test, Going);
end Index;
---------------------
-- Index_Non_Blank --
---------------------
function Index_Non_Blank
(Source : Unbounded_String;
Going : Strings.Direction := Strings.Forward) return Natural
is
SR : constant Shared_String_Access := Source.Reference;
begin
return Search.Index_Non_Blank (SR.Data (1 .. SR.Last), Going);
end Index_Non_Blank;
function Index_Non_Blank
(Source : Unbounded_String;
From : Positive;
Going : Direction := Forward) return Natural
is
SR : constant Shared_String_Access := Source.Reference;
begin
return Search.Index_Non_Blank (SR.Data (1 .. SR.Last), From, Going);
end Index_Non_Blank;
----------------
-- Initialize --
----------------
procedure Initialize (Object : in out Unbounded_String) is
begin
Reference (Object.Reference);
end Initialize;
------------
-- Insert --
------------
function Insert
(Source : Unbounded_String;
Before : Positive;
New_Item : String) return Unbounded_String
is
SR : constant Shared_String_Access := Source.Reference;
DL : constant Natural := SR.Last + New_Item'Length;
DR : Shared_String_Access;
begin
-- Check index first
if Before > SR.Last + 1 then
raise Index_Error;
end if;
-- Result is empty, reuse empty shared string
if DL = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Inserted string is empty, reuse source shared string
elsif New_Item'Length = 0 then
Reference (SR);
DR := SR;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (DL + DL / Growth_Factor);
DR.Data (1 .. Before - 1) := SR.Data (1 .. Before - 1);
DR.Data (Before .. Before + New_Item'Length - 1) := New_Item;
DR.Data (Before + New_Item'Length .. DL) :=
SR.Data (Before .. SR.Last);
DR.Last := DL;
end if;
return (AF.Controlled with Reference => DR);
end Insert;
procedure Insert
(Source : in out Unbounded_String;
Before : Positive;
New_Item : String)
is
SR : constant Shared_String_Access := Source.Reference;
DL : constant Natural := SR.Last + New_Item'Length;
DR : Shared_String_Access;
begin
-- Check bounds
if Before > SR.Last + 1 then
raise Index_Error;
end if;
-- Result is empty string, reuse empty shared string
if DL = 0 then
Reference (Empty_Shared_String'Access);
Source.Reference := Empty_Shared_String'Access;
Unreference (SR);
-- Inserted string is empty, nothing to do
elsif New_Item'Length = 0 then
null;
-- Try to reuse existing shared string first
elsif Can_Be_Reused (SR, DL) then
SR.Data (Before + New_Item'Length .. DL) :=
SR.Data (Before .. SR.Last);
SR.Data (Before .. Before + New_Item'Length - 1) := New_Item;
SR.Last := DL;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (DL + DL / Growth_Factor);
DR.Data (1 .. Before - 1) := SR.Data (1 .. Before - 1);
DR.Data (Before .. Before + New_Item'Length - 1) := New_Item;
DR.Data (Before + New_Item'Length .. DL) :=
SR.Data (Before .. SR.Last);
DR.Last := DL;
Source.Reference := DR;
Unreference (SR);
end if;
end Insert;
------------
-- Length --
------------
function Length (Source : Unbounded_String) return Natural is
begin
return Source.Reference.Last;
end Length;
---------------
-- Overwrite --
---------------
function Overwrite
(Source : Unbounded_String;
Position : Positive;
New_Item : String) return Unbounded_String
is
SR : constant Shared_String_Access := Source.Reference;
DL : Natural;
DR : Shared_String_Access;
begin
-- Check bounds
if Position > SR.Last + 1 then
raise Index_Error;
end if;
DL := Integer'Max (SR.Last, Position + New_Item'Length - 1);
-- Result is empty string, reuse empty shared string
if DL = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Result is same as source string, reuse source shared string
elsif New_Item'Length = 0 then
Reference (SR);
DR := SR;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (DL);
DR.Data (1 .. Position - 1) := SR.Data (1 .. Position - 1);
DR.Data (Position .. Position + New_Item'Length - 1) := New_Item;
DR.Data (Position + New_Item'Length .. DL) :=
SR.Data (Position + New_Item'Length .. SR.Last);
DR.Last := DL;
end if;
return (AF.Controlled with Reference => DR);
end Overwrite;
procedure Overwrite
(Source : in out Unbounded_String;
Position : Positive;
New_Item : String)
is
SR : constant Shared_String_Access := Source.Reference;
DL : Natural;
DR : Shared_String_Access;
begin
-- Bounds check
if Position > SR.Last + 1 then
raise Index_Error;
end if;
DL := Integer'Max (SR.Last, Position + New_Item'Length - 1);
-- Result is empty string, reuse empty shared string
if DL = 0 then
Reference (Empty_Shared_String'Access);
Source.Reference := Empty_Shared_String'Access;
Unreference (SR);
-- String unchanged, nothing to do
elsif New_Item'Length = 0 then
null;
-- Try to reuse existing shared string
elsif Can_Be_Reused (SR, DL) then
SR.Data (Position .. Position + New_Item'Length - 1) := New_Item;
SR.Last := DL;
-- Otherwise allocate new shared string and fill it
else
DR := Allocate (DL);
DR.Data (1 .. Position - 1) := SR.Data (1 .. Position - 1);
DR.Data (Position .. Position + New_Item'Length - 1) := New_Item;
DR.Data (Position + New_Item'Length .. DL) :=
SR.Data (Position + New_Item'Length .. SR.Last);
DR.Last := DL;
Source.Reference := DR;
Unreference (SR);
end if;
end Overwrite;
---------------
-- Reference --
---------------
procedure Reference (Item : not null Shared_String_Access) is
begin
System.Atomic_Counters.Increment (Item.Counter);
end Reference;
---------------------
-- Replace_Element --
---------------------
procedure Replace_Element
(Source : in out Unbounded_String;
Index : Positive;
By : Character)
is
SR : constant Shared_String_Access := Source.Reference;
DR : Shared_String_Access;
begin
-- Bounds check
if Index <= SR.Last then
-- Try to reuse existing shared string
if Can_Be_Reused (SR, SR.Last) then
SR.Data (Index) := By;
-- Otherwise allocate new shared string and fill it
else
DR := Allocate (SR.Last);
DR.Data (1 .. SR.Last) := SR.Data (1 .. SR.Last);
DR.Data (Index) := By;
DR.Last := SR.Last;
Source.Reference := DR;
Unreference (SR);
end if;
else
raise Index_Error;
end if;
end Replace_Element;
-------------------
-- Replace_Slice --
-------------------
function Replace_Slice
(Source : Unbounded_String;
Low : Positive;
High : Natural;
By : String) return Unbounded_String
is
SR : constant Shared_String_Access := Source.Reference;
DL : Natural;
DR : Shared_String_Access;
begin
-- Check bounds
if Low > SR.Last + 1 then
raise Index_Error;
end if;
-- Do replace operation when removed slice is not empty
if High >= Low then
DL := By'Length + SR.Last + Low - Integer'Min (High, SR.Last) - 1;
-- This is the number of characters remaining in the string after
-- replacing the slice.
-- Result is empty string, reuse empty shared string
if DL = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Otherwise allocate new shared string and fill it
else
DR := Allocate (DL);
DR.Data (1 .. Low - 1) := SR.Data (1 .. Low - 1);
DR.Data (Low .. Low + By'Length - 1) := By;
DR.Data (Low + By'Length .. DL) := SR.Data (High + 1 .. SR.Last);
DR.Last := DL;
end if;
return (AF.Controlled with Reference => DR);
-- Otherwise just insert string
else
return Insert (Source, Low, By);
end if;
end Replace_Slice;
procedure Replace_Slice
(Source : in out Unbounded_String;
Low : Positive;
High : Natural;
By : String)
is
SR : constant Shared_String_Access := Source.Reference;
DL : Natural;
DR : Shared_String_Access;
begin
-- Bounds check
if Low > SR.Last + 1 then
raise Index_Error;
end if;
-- Do replace operation only when replaced slice is not empty
if High >= Low then
DL := By'Length + SR.Last + Low - Integer'Min (High, SR.Last) - 1;
-- This is the number of characters remaining in the string after
-- replacing the slice.
-- Result is empty string, reuse empty shared string
if DL = 0 then
Reference (Empty_Shared_String'Access);
Source.Reference := Empty_Shared_String'Access;
Unreference (SR);
-- Try to reuse existing shared string
elsif Can_Be_Reused (SR, DL) then
SR.Data (Low + By'Length .. DL) := SR.Data (High + 1 .. SR.Last);
SR.Data (Low .. Low + By'Length - 1) := By;
SR.Last := DL;
-- Otherwise allocate new shared string and fill it
else
DR := Allocate (DL);
DR.Data (1 .. Low - 1) := SR.Data (1 .. Low - 1);
DR.Data (Low .. Low + By'Length - 1) := By;
DR.Data (Low + By'Length .. DL) := SR.Data (High + 1 .. SR.Last);
DR.Last := DL;
Source.Reference := DR;
Unreference (SR);
end if;
-- Otherwise just insert item
else
Insert (Source, Low, By);
end if;
end Replace_Slice;
--------------------------
-- Set_Unbounded_String --
--------------------------
procedure Set_Unbounded_String
(Target : out Unbounded_String;
Source : String)
is
TR : constant Shared_String_Access := Target.Reference;
DR : Shared_String_Access;
begin
-- In case of empty string, reuse empty shared string
if Source'Length = 0 then
Reference (Empty_Shared_String'Access);
Target.Reference := Empty_Shared_String'Access;
else
-- Try to reuse existing shared string
if Can_Be_Reused (TR, Source'Length) then
Reference (TR);
DR := TR;
-- Otherwise allocate new shared string
else
DR := Allocate (Source'Length);
Target.Reference := DR;
end if;
DR.Data (1 .. Source'Length) := Source;
DR.Last := Source'Length;
end if;
Unreference (TR);
end Set_Unbounded_String;
-----------
-- Slice --
-----------
function Slice
(Source : Unbounded_String;
Low : Positive;
High : Natural) return String
is
SR : constant Shared_String_Access := Source.Reference;
begin
-- Note: test of High > Length is in accordance with AI95-00128
if Low > SR.Last + 1 or else High > SR.Last then
raise Index_Error;
else
return SR.Data (Low .. High);
end if;
end Slice;
----------
-- Tail --
----------
function Tail
(Source : Unbounded_String;
Count : Natural;
Pad : Character := Space) return Unbounded_String
is
SR : constant Shared_String_Access := Source.Reference;
DR : Shared_String_Access;
begin
-- For empty result reuse empty shared string
if Count = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Result is whole source string, reuse source shared string
elsif Count = SR.Last then
Reference (SR);
DR := SR;
-- Otherwise allocate new shared string and fill it
else
DR := Allocate (Count);
if Count < SR.Last then
DR.Data (1 .. Count) := SR.Data (SR.Last - Count + 1 .. SR.Last);
else
for J in 1 .. Count - SR.Last loop
DR.Data (J) := Pad;
end loop;
DR.Data (Count - SR.Last + 1 .. Count) := SR.Data (1 .. SR.Last);
end if;
DR.Last := Count;
end if;
return (AF.Controlled with Reference => DR);
end Tail;
procedure Tail
(Source : in out Unbounded_String;
Count : Natural;
Pad : Character := Space)
is
SR : constant Shared_String_Access := Source.Reference;
DR : Shared_String_Access;
procedure Common
(SR : Shared_String_Access;
DR : Shared_String_Access;
Count : Natural);
-- Common code of tail computation. SR/DR can point to the same object
------------
-- Common --
------------
procedure Common
(SR : Shared_String_Access;
DR : Shared_String_Access;
Count : Natural) is
begin
if Count < SR.Last then
DR.Data (1 .. Count) := SR.Data (SR.Last - Count + 1 .. SR.Last);
else
DR.Data (Count - SR.Last + 1 .. Count) := SR.Data (1 .. SR.Last);
for J in 1 .. Count - SR.Last loop
DR.Data (J) := Pad;
end loop;
end if;
DR.Last := Count;
end Common;
begin
-- Result is empty string, reuse empty shared string
if Count = 0 then
Reference (Empty_Shared_String'Access);
Source.Reference := Empty_Shared_String'Access;
Unreference (SR);
-- Length of the result is the same as length of the source string,
-- reuse source shared string.
elsif Count = SR.Last then
null;
-- Try to reuse existing shared string
elsif Can_Be_Reused (SR, Count) then
Common (SR, SR, Count);
-- Otherwise allocate new shared string and fill it
else
DR := Allocate (Count);
Common (SR, DR, Count);
Source.Reference := DR;
Unreference (SR);
end if;
end Tail;
---------------
-- To_String --
---------------
function To_String (Source : Unbounded_String) return String is
begin
return Source.Reference.Data (1 .. Source.Reference.Last);
end To_String;
-------------------------
-- To_Unbounded_String --
-------------------------
function To_Unbounded_String (Source : String) return Unbounded_String is
DR : Shared_String_Access;
begin
if Source'Length = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
else
DR := Allocate (Source'Length);
DR.Data (1 .. Source'Length) := Source;
DR.Last := Source'Length;
end if;
return (AF.Controlled with Reference => DR);
end To_Unbounded_String;
function To_Unbounded_String (Length : Natural) return Unbounded_String is
DR : Shared_String_Access;
begin
if Length = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
else
DR := Allocate (Length);
DR.Last := Length;
end if;
return (AF.Controlled with Reference => DR);
end To_Unbounded_String;
---------------
-- Translate --
---------------
function Translate
(Source : Unbounded_String;
Mapping : Maps.Character_Mapping) return Unbounded_String
is
SR : constant Shared_String_Access := Source.Reference;
DR : Shared_String_Access;
begin
-- Nothing to translate, reuse empty shared string
if SR.Last = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (SR.Last);
for J in 1 .. SR.Last loop
DR.Data (J) := Value (Mapping, SR.Data (J));
end loop;
DR.Last := SR.Last;
end if;
return (AF.Controlled with Reference => DR);
end Translate;
procedure Translate
(Source : in out Unbounded_String;
Mapping : Maps.Character_Mapping)
is
SR : constant Shared_String_Access := Source.Reference;
DR : Shared_String_Access;
begin
-- Nothing to translate
if SR.Last = 0 then
null;
-- Try to reuse shared string
elsif Can_Be_Reused (SR, SR.Last) then
for J in 1 .. SR.Last loop
SR.Data (J) := Value (Mapping, SR.Data (J));
end loop;
-- Otherwise, allocate new shared string
else
DR := Allocate (SR.Last);
for J in 1 .. SR.Last loop
DR.Data (J) := Value (Mapping, SR.Data (J));
end loop;
DR.Last := SR.Last;
Source.Reference := DR;
Unreference (SR);
end if;
end Translate;
function Translate
(Source : Unbounded_String;
Mapping : Maps.Character_Mapping_Function) return Unbounded_String
is
SR : constant Shared_String_Access := Source.Reference;
DR : Shared_String_Access;
begin
-- Nothing to translate, reuse empty shared string
if SR.Last = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (SR.Last);
for J in 1 .. SR.Last loop
DR.Data (J) := Mapping.all (SR.Data (J));
end loop;
DR.Last := SR.Last;
end if;
return (AF.Controlled with Reference => DR);
exception
when others =>
Unreference (DR);
raise;
end Translate;
procedure Translate
(Source : in out Unbounded_String;
Mapping : Maps.Character_Mapping_Function)
is
SR : constant Shared_String_Access := Source.Reference;
DR : Shared_String_Access;
begin
-- Nothing to translate
if SR.Last = 0 then
null;
-- Try to reuse shared string
elsif Can_Be_Reused (SR, SR.Last) then
for J in 1 .. SR.Last loop
SR.Data (J) := Mapping.all (SR.Data (J));
end loop;
-- Otherwise allocate new shared string and fill it
else
DR := Allocate (SR.Last);
for J in 1 .. SR.Last loop
DR.Data (J) := Mapping.all (SR.Data (J));
end loop;
DR.Last := SR.Last;
Source.Reference := DR;
Unreference (SR);
end if;
exception
when others =>
if DR /= null then
Unreference (DR);
end if;
raise;
end Translate;
----------
-- Trim --
----------
function Trim
(Source : Unbounded_String;
Side : Trim_End) return Unbounded_String
is
SR : constant Shared_String_Access := Source.Reference;
DL : Natural;
DR : Shared_String_Access;
Low : Natural;
High : Natural;
begin
Low := Index_Non_Blank (Source, Forward);
-- All blanks, reuse empty shared string
if Low = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
else
case Side is
when Left =>
High := SR.Last;
DL := SR.Last - Low + 1;
when Right =>
Low := 1;
High := Index_Non_Blank (Source, Backward);
DL := High;
when Both =>
High := Index_Non_Blank (Source, Backward);
DL := High - Low + 1;
end case;
-- Length of the result is the same as length of the source string,
-- reuse source shared string.
if DL = SR.Last then
Reference (SR);
DR := SR;
-- Otherwise, allocate new shared string
else
DR := Allocate (DL);
DR.Data (1 .. DL) := SR.Data (Low .. High);
DR.Last := DL;
end if;
end if;
return (AF.Controlled with Reference => DR);
end Trim;
procedure Trim
(Source : in out Unbounded_String;
Side : Trim_End)
is
SR : constant Shared_String_Access := Source.Reference;
DL : Natural;
DR : Shared_String_Access;
Low : Natural;
High : Natural;
begin
Low := Index_Non_Blank (Source, Forward);
-- All blanks, reuse empty shared string
if Low = 0 then
Reference (Empty_Shared_String'Access);
Source.Reference := Empty_Shared_String'Access;
Unreference (SR);
else
case Side is
when Left =>
High := SR.Last;
DL := SR.Last - Low + 1;
when Right =>
Low := 1;
High := Index_Non_Blank (Source, Backward);
DL := High;
when Both =>
High := Index_Non_Blank (Source, Backward);
DL := High - Low + 1;
end case;
-- Length of the result is the same as length of the source string,
-- nothing to do.
if DL = SR.Last then
null;
-- Try to reuse existing shared string
elsif Can_Be_Reused (SR, DL) then
SR.Data (1 .. DL) := SR.Data (Low .. High);
SR.Last := DL;
-- Otherwise, allocate new shared string
else
DR := Allocate (DL);
DR.Data (1 .. DL) := SR.Data (Low .. High);
DR.Last := DL;
Source.Reference := DR;
Unreference (SR);
end if;
end if;
end Trim;
function Trim
(Source : Unbounded_String;
Left : Maps.Character_Set;
Right : Maps.Character_Set) return Unbounded_String
is
SR : constant Shared_String_Access := Source.Reference;
DL : Natural;
DR : Shared_String_Access;
Low : Natural;
High : Natural;
begin
Low := Index (Source, Left, Outside, Forward);
-- Source includes only characters from Left set, reuse empty shared
-- string.
if Low = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
else
High := Index (Source, Right, Outside, Backward);
DL := Integer'Max (0, High - Low + 1);
-- Source includes only characters from Right set or result string
-- is empty, reuse empty shared string.
if High = 0 or else DL = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (DL);
DR.Data (1 .. DL) := SR.Data (Low .. High);
DR.Last := DL;
end if;
end if;
return (AF.Controlled with Reference => DR);
end Trim;
procedure Trim
(Source : in out Unbounded_String;
Left : Maps.Character_Set;
Right : Maps.Character_Set)
is
SR : constant Shared_String_Access := Source.Reference;
DL : Natural;
DR : Shared_String_Access;
Low : Natural;
High : Natural;
begin
Low := Index (Source, Left, Outside, Forward);
-- Source includes only characters from Left set, reuse empty shared
-- string.
if Low = 0 then
Reference (Empty_Shared_String'Access);
Source.Reference := Empty_Shared_String'Access;
Unreference (SR);
else
High := Index (Source, Right, Outside, Backward);
DL := Integer'Max (0, High - Low + 1);
-- Source includes only characters from Right set or result string
-- is empty, reuse empty shared string.
if High = 0 or else DL = 0 then
Reference (Empty_Shared_String'Access);
Source.Reference := Empty_Shared_String'Access;
Unreference (SR);
-- Try to reuse existing shared string
elsif Can_Be_Reused (SR, DL) then
SR.Data (1 .. DL) := SR.Data (Low .. High);
SR.Last := DL;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (DL);
DR.Data (1 .. DL) := SR.Data (Low .. High);
DR.Last := DL;
Source.Reference := DR;
Unreference (SR);
end if;
end if;
end Trim;
---------------------
-- Unbounded_Slice --
---------------------
function Unbounded_Slice
(Source : Unbounded_String;
Low : Positive;
High : Natural) return Unbounded_String
is
SR : constant Shared_String_Access := Source.Reference;
DL : Natural;
DR : Shared_String_Access;
begin
-- Check bounds
if Low > SR.Last + 1 or else High > SR.Last then
raise Index_Error;
-- Result is empty slice, reuse empty shared string
elsif Low > High then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Otherwise, allocate new shared string and fill it
else
DL := High - Low + 1;
DR := Allocate (DL);
DR.Data (1 .. DL) := SR.Data (Low .. High);
DR.Last := DL;
end if;
return (AF.Controlled with Reference => DR);
end Unbounded_Slice;
procedure Unbounded_Slice
(Source : Unbounded_String;
Target : out Unbounded_String;
Low : Positive;
High : Natural)
is
SR : constant Shared_String_Access := Source.Reference;
TR : constant Shared_String_Access := Target.Reference;
DL : Natural;
DR : Shared_String_Access;
begin
-- Check bounds
if Low > SR.Last + 1 or else High > SR.Last then
raise Index_Error;
-- Result is empty slice, reuse empty shared string
elsif Low > High then
Reference (Empty_Shared_String'Access);
Target.Reference := Empty_Shared_String'Access;
Unreference (TR);
else
DL := High - Low + 1;
-- Try to reuse existing shared string
if Can_Be_Reused (TR, DL) then
TR.Data (1 .. DL) := SR.Data (Low .. High);
TR.Last := DL;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (DL);
DR.Data (1 .. DL) := SR.Data (Low .. High);
DR.Last := DL;
Target.Reference := DR;
Unreference (TR);
end if;
end if;
end Unbounded_Slice;
-----------------
-- Unreference --
-----------------
procedure Unreference (Item : not null Shared_String_Access) is
procedure Free is
new Ada.Unchecked_Deallocation (Shared_String, Shared_String_Access);
Aux : Shared_String_Access := Item;
begin
if System.Atomic_Counters.Decrement (Aux.Counter) then
-- Reference counter of Empty_Shared_String should never reach
-- zero. We check here in case it wraps around.
if Aux /= Empty_Shared_String'Access then
Free (Aux);
end if;
end if;
end Unreference;
end Ada.Strings.Unbounded;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with GNAT.String_Split;
with UxAS.Comms.Data.Addressed; use UxAS.Comms.Data.Addressed;
package body UxAS.Comms.Data is
--------------------
-- Set_Attributes --
--------------------
procedure Set_Attributes
(This : in out Message_Attributes;
Content_Type : String;
Descriptor : String;
Source_Group : String;
Source_Entity_Id : String;
Source_Service_Id : String;
Result : out Boolean)
is
begin
Result := False;
This.Is_Valid := False;
if Content_Type'Length = 0 then
return;
end if;
if Descriptor'Length = 0 then
return;
end if;
if Source_Entity_Id'Length = 0 then
return;
end if;
if Source_Service_Id'Length = 0 then
return;
end if;
Copy (Content_Type, To => This.Content_Type);
Copy (Descriptor, To => This.Descriptor);
Copy (Source_Group, To => This.Source_Group);
Copy (Source_Entity_Id, To => This.Source_Entity_Id);
Copy (Source_Service_Id, To => This.Source_Service_Id);
Copy (This.Content_Type & Addressed.Field_Delimiter &
This.Descriptor & Addressed.Field_Delimiter &
This.Source_Group & Addressed.Field_Delimiter &
This.Source_Entity_Id & Addressed.Field_Delimiter &
This.Source_Service_Id,
To => This.Content_String);
This.Is_Valid := True; -- already determined by preconditions...
Result := True;
end Set_Attributes;
------------------------------
-- Update_Source_Attributes --
------------------------------
procedure Update_Source_Attributes
(This : in out Message_Attributes;
Source_Group : String;
Source_Entity_Id : String;
Source_Service_Id : String;
Result : out Boolean)
is
begin
Copy (Source_Group, To => This.Source_Group);
Copy (Source_Entity_Id, To => This.Source_Entity_Id);
Copy (Source_Service_Id, To => This.Source_Service_Id);
Copy (This.Content_Type & Addressed.Field_Delimiter &
This.Descriptor & Addressed.Field_Delimiter &
This.Source_Group & Addressed.Field_Delimiter &
This.Source_Entity_Id & Addressed.Field_Delimiter &
This.Source_Service_Id & Addressed.Field_Delimiter,
To => This.Content_String);
This.Is_Valid := True; -- already determined by preconditions...
Result := True;
end Update_Source_Attributes;
------------------------------------------
-- Set_Attributes_From_Delimited_String --
------------------------------------------
procedure Set_Attributes_From_Delimited_String
(This : in out Message_Attributes;
Delimited_String : String;
Result : out Boolean)
is
begin
Parse_Message_Attributes_String_And_Set_Fields (This, Delimited_String, Result);
end Set_Attributes_From_Delimited_String;
--------------
-- Is_Valid --
--------------
function Is_Valid (This : Message_Attributes) return Boolean is
(This.Is_Valid);
--------------------------
-- Payload_Content_Type --
--------------------------
function Payload_Content_Type (This : Message_Attributes) return String is
(Value (This.Content_Type));
------------------------
-- Payload_Descriptor --
------------------------
function Payload_Descriptor (This : Message_Attributes) return String is
(Value (This.Descriptor));
------------------
-- Source_Group --
------------------
function Source_Group (This : Message_Attributes) return String is
(Value (This.Source_Group));
----------------------
-- Source_Entity_Id --
----------------------
function Source_Entity_Id (This : Message_Attributes) return String is
(Value (This.Source_Entity_Id));
-----------------------
-- Source_Service_Id --
-----------------------
function Source_Service_Id (This : Message_Attributes) return String is
(Value (This.Source_Service_Id));
--------------------
-- Content_String --
--------------------
function Content_String (This : Message_Attributes) return String is
(Value (This.Content_String));
----------------------------------------------------
-- Parse_Message_Attributes_String_And_Set_Fields --
----------------------------------------------------
procedure Parse_Message_Attributes_String_And_Set_Fields
(This : in out Message_Attributes;
Delimited_String : String;
Result : out Boolean)
is
use GNAT.String_Split;
Tokens : Slice_Set;
begin
Create (Tokens,
From => Delimited_String,
Separators => Field_Delimiter,
Mode => Single); -- contiguous delimiters are NOT treated as a single delimiter
if Slice_Count (Tokens) = Attribute_Count then
This.Set_Attributes
(Content_Type => Slice (Tokens, 1),
Descriptor => Slice (Tokens, 2),
Source_Group => Slice (Tokens, 3),
Source_Entity_Id => Slice (Tokens, 4),
Source_Service_Id => Slice (Tokens, 5),
Result => Result);
else
Result := False;
This.Is_Valid := False;
end if;
end Parse_Message_Attributes_String_And_Set_Fields;
end UxAS.Comms.Data;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-----------------------------------------------------------------------
with Gen.Model.List;
package Gen.Model.Operations is
type Operation_Type is (UNKNOWN, ASF_ACTION, ASF_UPLOAD, AWA_EVENT);
-- ------------------------------
-- Parameter Definition
-- ------------------------------
type Parameter_Definition is new Definition with private;
type Parameter_Definition_Access is access all Parameter_Definition'Class;
-- ------------------------------
-- Operation Definition
-- ------------------------------
type Operation_Definition is new Definition with private;
type Operation_Definition_Access is access all Operation_Definition'Class;
-- Get the value identified by the name.
-- If the name cannot be found, the method should return the Null object.
overriding
function Get_Value (From : in Operation_Definition;
Name : in String) return UBO.Object;
-- Prepare the generation of the model.
overriding
procedure Prepare (O : in out Operation_Definition);
-- Initialize the operation definition instance.
overriding
procedure Initialize (O : in out Operation_Definition);
-- Add an operation parameter with the given name and type.
procedure Add_Parameter (Into : in out Operation_Definition;
Name : in UString;
Of_Type : in UString;
Parameter : out Parameter_Definition_Access);
-- Get the operation type.
function Get_Type (From : in Operation_Definition) return Operation_Type;
-- Create an operation with the given name.
function Create_Operation (Name : in UString) return Operation_Definition_Access;
private
type Parameter_Definition is new Definition with record
-- The parameter type name.
Type_Name : UString;
end record;
package Parameter_List is new Gen.Model.List (T => Parameter_Definition,
T_Access => Parameter_Definition_Access);
type Operation_Definition is new Definition with record
Parameters : aliased Parameter_List.List_Definition;
Parameters_Bean : UBO.Object;
Return_Type : UString;
Kind : Operation_Type := UNKNOWN;
end record;
end Gen.Model.Operations;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with Ada.Text_IO;
use Ada.Text_IO;
generic
N, H : in Natural;
package Data is
type Vector is array(Integer range <>) of Integer;
Subtype VectorN is Vector(1..N);
Subtype Vector4H is Vector(1..4 * H);
Subtype Vector3H is Vector(1..3 * H);
Subtype Vector2H is Vector(1..2 * H);
Subtype VectorH is Vector(1..H);
type Matrix is array(Integer range <>) of VectorN;
Subtype MatrixN is Matrix(1..N);
Subtype Matrix4H is Matrix(1..4 * H);
Subtype Matrix3H is Matrix(1..3 * H);
Subtype Matrix2H is Matrix(1..2 * H);
Subtype MatrixH is Matrix(1..H);
procedure Input ( V : out Vector; Value : in Integer);
procedure Input ( MA : out Matrix; Value : in Integer);
procedure Output (V : in VectorN);
procedure Output (MA : in Matrix);
procedure FindMinZ (V : in VectorH; minZi : out Integer);
function Min (A, B: Integer) return Integer;
function Calculation (X : in VectorN;
MA : in MatrixN;
MS : in MatrixH;
q : in Integer;
R : in VectorN;
MF: in MatrixH) return VectorH;
end Data;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with AdaBase.Connection.Base.SQLite;
with AdaBase.Bindings.SQLite;
with Ada.Containers.Vectors;
package AdaBase.Statement.Base.SQLite is
package ACS renames AdaBase.Connection.Base.SQLite;
package BND renames AdaBase.Bindings.SQLite;
package AC renames Ada.Containers;
type SQLite_statement (type_of_statement : Stmt_Type;
log_handler : ALF.LogFacility_access;
sqlite_conn : ACS.SQLite_Connection_Access;
initial_sql : SQL_Access;
con_error_mode : Error_Modes;
con_case_mode : Case_Modes;
con_max_blob : BLOB_Maximum)
is new Base_Statement and AIS.iStatement with private;
type SQLite_statement_access is access all SQLite_statement;
overriding
function column_count (Stmt : SQLite_statement) return Natural;
overriding
function last_insert_id (Stmt : SQLite_statement) return Trax_ID;
overriding
function last_sql_state (Stmt : SQLite_statement) return SQL_State;
overriding
function last_driver_code (Stmt : SQLite_statement) return Driver_Codes;
overriding
function last_driver_message (Stmt : SQLite_statement) return String;
overriding
procedure discard_rest (Stmt : out SQLite_statement);
overriding
function execute (Stmt : out SQLite_statement) return Boolean;
overriding
function execute (Stmt : out SQLite_statement; parameters : String;
delimiter : Character := '|') return Boolean;
overriding
function rows_returned (Stmt : SQLite_statement) return Affected_Rows;
overriding
function column_name (Stmt : SQLite_statement; index : Positive)
return String;
overriding
function column_table (Stmt : SQLite_statement; index : Positive)
return String;
overriding
function column_native_type (Stmt : SQLite_statement; index : Positive)
return field_types;
overriding
function fetch_next (Stmt : out SQLite_statement) return ARS.Datarow;
overriding
function fetch_all (Stmt : out SQLite_statement) return ARS.Datarow_Set;
overriding
function fetch_bound (Stmt : out SQLite_statement) return Boolean;
overriding
procedure fetch_next_set (Stmt : out SQLite_statement;
data_present : out Boolean;
data_fetched : out Boolean);
private
type column_info is record
table : CT.Text;
field_name : CT.Text;
field_type : field_types;
null_possible : Boolean;
sqlite_type : BND.enum_field_types;
end record;
type sqlite_canvas is record
buffer_binary : BND.ICS.char_array_access := null;
buffer_text : BND.ICS.chars_ptr := BND.ICS.Null_Ptr;
end record;
type step_result_type is (unset, data_pulled, progam_complete, error_seen);
package VColumns is new AC.Vectors (Index_Type => Positive,
Element_Type => column_info);
package VCanvas is new AC.Vectors (Index_Type => Positive,
Element_Type => sqlite_canvas);
type SQLite_statement (type_of_statement : Stmt_Type;
log_handler : ALF.LogFacility_access;
sqlite_conn : ACS.SQLite_Connection_Access;
initial_sql : SQL_Access;
con_error_mode : Error_Modes;
con_case_mode : Case_Modes;
con_max_blob : BLOB_Maximum)
is new Base_Statement and AIS.iStatement with
record
stmt_handle : aliased BND.sqlite3_stmt_Access := null;
step_result : step_result_type := unset;
assign_counter : Natural := 0;
num_columns : Natural := 0;
column_info : VColumns.Vector;
bind_canvas : VCanvas.Vector;
sql_final : SQL_Access;
end record;
procedure log_problem
(statement : SQLite_statement;
category : Log_Category;
message : String;
pull_codes : Boolean := False;
break : Boolean := False);
procedure initialize (Object : in out SQLite_statement);
procedure Adjust (Object : in out SQLite_statement);
procedure finalize (Object : in out SQLite_statement);
procedure scan_column_information (Stmt : out SQLite_statement);
procedure reclaim_canvas (Stmt : out SQLite_statement);
function seems_like_bit_string (candidate : CT.Text) return Boolean;
function private_execute (Stmt : out SQLite_statement) return Boolean;
function construct_bind_slot (Stmt : SQLite_statement; marker : Positive)
return sqlite_canvas;
procedure free_binary is new Ada.Unchecked_Deallocation
(BND.IC.char_array, BND.ICS.char_array_access);
end AdaBase.Statement.Base.SQLite;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- file COPYING.LIB. If not, write to the Free Software Foundation, 675 --
-- Mass Ave, Cambridge, MA 02139, USA. --
-- --
-----------------------------------------------------------------------------
package Interfaces.C.System_Constants is
pthread_t_size : constant Integer := 1;
pthread_attr_t_size : constant Integer := 13;
pthread_mutexattr_t_size : constant Integer := 3;
pthread_mutex_t_size : constant Integer := 8;
pthread_condattr_t_size : constant Integer := 1;
pthread_cond_t_size : constant Integer := 5;
pthread_key_t_size : constant Integer := 1;
jmp_buf_size : constant Integer := 12;
sigjmp_buf_size : constant Integer := 19;
sigset_t_size : constant Integer := 4;
SIG_BLOCK : constant := 1;
SIG_UNBLOCK : constant := 2;
SIG_SETMASK : constant := 3;
SA_NOCLDSTOP : constant := 131072;
SA_SIGINFO : constant := 8;
SIG_ERR : constant := -1;
SIG_DFL : constant := 0;
SIG_IGN : constant := 1;
SIGNULL : constant := 0;
SIGHUP : constant := 1;
SIGINT : constant := 2;
SIGQUIT : constant := 3;
SIGILL : constant := 4;
SIGABRT : constant := 6;
SIGFPE : constant := 8;
SIGKILL : constant := 9;
SIGSEGV : constant := 11;
SIGPIPE : constant := 13;
SIGALRM : constant := 14;
SIGTERM : constant := 15;
SIGSTOP : constant := 23;
SIGTSTP : constant := 24;
SIGCONT : constant := 25;
SIGCHLD : constant := 18;
SIGTTIN : constant := 26;
SIGTTOU : constant := 27;
SIGUSR1 : constant := 16;
SIGUSR2 : constant := 17;
NSIG : constant := 44;
-- OS specific signals represented as an array
type Sig_Array is array (positive range <>) of integer;
OS_Specific_Sync_Sigs : Sig_Array :=
(NSIG, 5, 7, 10);
OS_Specific_Async_Sigs : Sig_Array :=
(NSIG, 12, 21, 22, 30, 31, 28, 29, 20);
-- End of OS specific signals representation
EPERM : constant := 1;
ENOENT : constant := 2;
ESRCH : constant := 3;
EINTR : constant := 4;
EIO : constant := 5;
ENXIO : constant := 6;
E2BIG : constant := 7;
ENOEXEC : constant := 8;
EBADF : constant := 9;
ECHILD : constant := 10;
EAGAIN : constant := 11;
ENOMEM : constant := 12;
EACCES : constant := 13;
EFAULT : constant := 14;
ENOTBLK : constant := 15;
EBUSY : constant := 16;
EEXIST : constant := 17;
EXDEV : constant := 18;
ENODEV : constant := 19;
ENOTDIR : constant := 20;
EISDIR : constant := 21;
EINVAL : constant := 22;
ENFILE : constant := 23;
EMFILE : constant := 24;
ENOTTY : constant := 25;
ETXTBSY : constant := 26;
EFBIG : constant := 27;
ENOSPC : constant := 28;
ESPIPE : constant := 29;
EROFS : constant := 30;
EMLINK : constant := 31;
EPIPE : constant := 32;
ENAMETOOLONG : constant := 78;
ENOTEMPTY : constant := 93;
EDEADLK : constant := 45;
ENOLCK : constant := 46;
ENOSYS : constant := 89;
ENOTSUP : constant := 48;
NO_PRIO_INHERIT : constant := 0;
PRIO_INHERIT : constant := 1;
PRIO_PROTECT : constant := 2;
Add_Prio : constant Integer := 2;
end Interfaces.C.System_Constants;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
package Pck is
type Rec_Type (C : Character := 'd') is record
case C is
when Character'First => X_First : Integer;
when Character'Val (127) => X_127 : Integer;
when Character'Val (128) => X_128 : Integer;
when Character'Last => X_Last : Integer;
when others => null;
end case;
end record;
type Second_Type (I : Integer) is record
One: Integer;
case I is
when -5 .. 5 =>
X : Integer;
when others =>
Y : Integer;
end case;
end record;
type Nested_And_Variable (One, Two: Integer) is record
Str : String (1 .. One);
case One is
when 0 =>
null;
when others =>
OneValue : Integer;
Str2 : String (1 .. Two);
case Two is
when 0 =>
null;
when others =>
TwoValue : Integer;
end case;
end case;
end record;
end Pck;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-----------------------------------------------------------------------
with Ada.Finalization;
with Util.Strings.Sets;
private with GNAT.Sockets;
package UPnP.SSDP is
type Scanner_Type is limited new Ada.Finalization.Limited_Controlled with private;
-- Find the IPv4 addresses of the network interfaces.
procedure Find_IPv4_Addresses (Scanner : in out Scanner_Type;
IPs : out Util.Strings.Sets.Set);
-- Initialize the SSDP scanner by opening the UDP socket.
procedure Initialize (Scanner : in out Scanner_Type);
-- Send the SSDP discovery UDP packet on the UPnP multicast group 192.168.127.12.
-- Set the "ST" header to the given target. The UDP packet is sent on each interface
-- whose IP address is defined in the set <tt>IPs</tt>.
procedure Send_Discovery (Scanner : in out Scanner_Type;
Target : in String;
IPs : in Util.Strings.Sets.Set);
-- Receive the UPnP SSDP discovery messages for the given target.
-- Call the <tt>Process</tt> procedure for each of them. The <tt>Desc</tt> parameter
-- represents the UPnP location header which gives the UPnP XML root descriptor.
-- Wait at most the given time.
procedure Discover (Scanner : in out Scanner_Type;
Target : in String;
Process : not null access procedure (Desc : in String);
Wait : in Duration);
-- Release the socket.
overriding
procedure Finalize (Scanner : in out Scanner_Type);
private
type Scanner_Type is limited new Ada.Finalization.Limited_Controlled with record
Socket : GNAT.Sockets.Socket_Type := GNAT.Sockets.No_Socket;
end record;
end UPnP.SSDP;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- { dg-do run }
-- { dg-options "-fstack-check" }
-- This test requires architecture- and OS-specific support code for unwinding
-- through signal frames (typically located in *-unwind.h) to pass. Feel free
-- to disable it if this code hasn't been implemented yet.
procedure Stack_Check2 is
function UB return Integer is
begin
return 2048;
end;
type A is Array (Positive range <>) of Integer;
procedure Consume_Stack (N : Integer) is
My_A : A (1..UB); -- 8 KB dynamic
begin
My_A (1) := 0;
if N <= 0 then
return;
end if;
Consume_Stack (N-1);
end;
Task T;
Task body T is
begin
begin
Consume_Stack (Integer'Last);
raise Program_Error;
exception
when Storage_Error => null;
end;
Consume_Stack (128);
end;
begin
null;
end;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- (c). Permission is hereby freely given for any and all use of program
-- and data. You can sell it as your own, but at least tell me.
--
-- This version is distributed without obligation, but the developer
-- would appreciate comments and suggestions.
--
-- All parts of the WORDS system, source code and data files, are made freely
-- available to anyone who wishes to use them, for whatever purpose.
with Text_IO;
with Latin_Utils.Strings_Package; use Latin_Utils.Strings_Package;
-- with Latin_Utils.Latin_File_Names; use Latin_Utils.Latin_File_Names;
with Latin_Utils.Inflections_Package; use Latin_Utils.Inflections_Package;
with Latin_Utils.Dictionary_Package; use Latin_Utils.Dictionary_Package;
-- with line_stuff; use line_stuff;
-- with dictionary_form;
procedure Uniqpage is
-- package Integer_IO is new Text_IO.Integer_IO (Integer);
use Text_IO;
use Dictionary_Entry_IO;
use Part_Entry_IO;
use Kind_Entry_IO;
use Translation_Record_IO;
use Age_Type_IO;
use Area_Type_IO;
use Geo_Type_IO;
use Frequency_Type_IO;
use Source_Type_IO;
Uniques_File, Uniqpage : Text_IO.File_Type;
S : constant String (1 .. 400) := (others => ' ');
Line : String (1 .. 400) := (others => ' ');
Blanks : constant String (1 .. 400) := (others => ' ');
L, Last : Integer := 0;
Stem : Stem_Type := Null_Stem_Type;
Qual : Quality_Record;
Kind : Kind_Entry;
Tran : Translation_Record;
Mean : Meaning_Type;
procedure Get_Line_Unique
(Input : in Text_IO.File_Type;
S : out String;
Last : out Natural)
is
begin
Last := 0;
Text_IO.Get_Line (Input, S, Last);
-- FIXME: this if statement was commented out, because it triggered
-- warning "if statement has no effect". I didn't delete it because quite
-- possibly author wanted it to do something. Question is what?
--if Trim (s (s'First .. last)) /= "" then -- Rejecting blank lines
-- null;
--end if;
end Get_Line_Unique;
begin
Put_Line ("UNIQUES.LAT -> UNIQPAGE.PG");
Put_Line ("Takes UNIQUES form, single lines it, puts # at beginning,");
Put_Line ("producing a .PG file for sorting to produce paper dictionary");
Create (Uniqpage, Out_File, "UNIQPAGE.PG");
Open (Uniques_File, In_File, "UNIQUES.LAT");
Over_Lines :
while not End_Of_File (Uniques_File) loop
Line := Blanks;
Get_Line_Unique (Uniques_File, Line, Last); -- STEM
Stem := Head (Trim (Line (1 .. Last)), Max_Stem_Size);
Line := Blanks;
Get_Line_Unique (Uniques_File, Line, Last); -- QUAL, KIND, TRAN
Quality_Record_IO.Get (Line (1 .. Last), Qual, L);
Get (Line (L + 1 .. Last), Qual.Pofs, Kind, L);
Age_Type_IO.Get (Line (L + 1 .. Last), Tran.Age, L);
Area_Type_IO.Get (Line (L + 1 .. Last), Tran.Area, L);
Geo_Type_IO.Get (Line (L + 1 .. Last), Tran.Geo, L);
Frequency_Type_IO.Get (Line (L + 1 .. Last), Tran.Freq, L);
Source_Type_IO.Get (Line (L + 1 .. Last), Tran.Source, L);
Line := Blanks;
Get_Line_Unique (Uniques_File, Line, L); -- MEAN
Mean := Head (Trim (Line (1 .. L)), Max_Meaning_Size);
-- while not END_OF_FILE (UNIQUES_FILE) loop
-- S := BLANK_LINE;
-- GET_LINE (INPUT, S, LAST);
-- if TRIM (S (1 .. LAST)) /= "" then -- Rejecting blank lines
--
--
Text_IO.Put (Uniqpage, "#" & Stem);
Quality_Record_IO.Put (Uniqpage, Qual);
-- PART := (V, (QUAL.V.CON, KIND.V_KIND));
if (Qual.Pofs = V) and then (Kind.V_Kind in Gen .. Perfdef) then
Text_IO.Put (Uniqpage, " " &
Verb_Kind_Type'Image (Kind.V_Kind) & " ");
end if;
Text_IO.Put (Uniqpage, " [");
Age_Type_IO.Put (Uniqpage, Tran.Age);
Area_Type_IO.Put (Uniqpage, Tran.Area);
Geo_Type_IO.Put (Uniqpage, Tran.Geo);
Frequency_Type_IO.Put (Uniqpage, Tran.Freq);
Source_Type_IO.Put (Uniqpage, Tran.Source);
Text_IO.Put (Uniqpage, "]");
Put (Uniqpage, " :: ");
Put_Line (Uniqpage, Mean);
--end if; -- Rejecting blank lines
end loop Over_Lines;
Close (Uniqpage);
exception
when Text_IO.Data_Error =>
null;
when others =>
Put_Line (S (1 .. Last));
Close (Uniqpage);
end Uniqpage;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-------------------------------------------------------------------------------
package body ZMQ.Pollsets is
------------
-- append --
------------
procedure Append (This : in out Pollset; Item : Pollitem'Class) is
pragma Unreferenced (This, Item);
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "append unimplemented");
raise Program_Error with "Unimplemented procedure append";
end Append;
------------
-- remove --
------------
procedure Remove (This : in out Pollset; Item : Pollitem'Class) is
pragma Unreferenced (This, Item);
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "remove unimplemented");
raise Program_Error with "Unimplemented procedure remove";
end Remove;
----------
-- poll --
----------
procedure Poll
(This : in out Pollset;
Timeout : Duration)
is
pragma Unreferenced (This, Timeout);
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "poll unimplemented");
raise Program_Error with "Unimplemented procedure poll";
end Poll;
end ZMQ.Pollsets;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
end if;
if not spec.post_parse_usergroup_check_passes then
return "The USERGROUP_SPKG definition is required when USERS or GROUPS is set";
end if;
if not spec.post_parse_opt_desc_check_passes then
return "Check above errors to determine which options have no descriptions";
end if;
if not spec.post_parse_option_group_size_passes then
return "check above errors to determine which option groups are too small";
end if;
return "";
end late_validity_check_error;
--------------------------------------------------------------------------------------------
-- determine_target
--------------------------------------------------------------------------------------------
function determine_target
(spec : PSP.Portspecs;
line : String;
last_seen : type_category) return spec_target
is
function active_prefix return String;
function extract_option (prefix, line : String) return String;
lead_pre : Boolean := False;
lead_do : Boolean := False;
lead_post : Boolean := False;
fetch : constant String := "fetch";
extract : constant String := "extract";
patch : constant String := "patch";
configure : constant String := "configure";
build : constant String := "build";
install : constant String := "install";
stage : constant String := "stage";
test : constant String := "test";
opt_on : constant String := "-ON:";
opt_off : constant String := "-OFF:";
pre_pre : constant String := "pre-";
pre_do : constant String := "do-";
pre_post : constant String := "post-";
function active_prefix return String is
begin
if lead_pre then
return pre_pre;
elsif lead_do then
return pre_do;
else
return pre_post;
end if;
end active_prefix;
function extract_option (prefix, line : String) return String
is
function first_set_successful (substring : String) return Boolean;
-- Given: Line terminates in "-ON:" or "-OFF:"
last : Natural;
first : Natural := 0;
function first_set_successful (substring : String) return Boolean is
begin
if HT.leads (line, substring) then
first := line'First + substring'Length;
return True;
else
return False;
end if;
end first_set_successful;
begin
if HT.trails (line, opt_on) then
last := line'Last - opt_on'Length;
else
last := line'Last - opt_off'Length;
end if;
if first_set_successful (prefix & fetch & LAT.Hyphen) or else
first_set_successful (prefix & extract & LAT.Hyphen) or else
first_set_successful (prefix & patch & LAT.Hyphen) or else
first_set_successful (prefix & configure & LAT.Hyphen) or else
first_set_successful (prefix & build & LAT.Hyphen) or else
first_set_successful (prefix & install & LAT.Hyphen) or else
first_set_successful (prefix & stage & LAT.Hyphen) or else
first_set_successful (prefix & test & LAT.Hyphen)
then
return line (first .. last);
else
return "";
end if;
end extract_option;
begin
if last_seen = cat_target then
-- If the line starts with a period or if it has a single tab, then mark it as
-- as a target body and leave. We don't need to check more.
if line (line'First) = LAT.Full_Stop or else
line (line'First) = LAT.HT
then
return target_body;
end if;
end if;
-- Check if line has format of a target (ends in a colon)
if not HT.trails (line, ":") then
return not_target;
end if;
-- From this point forward, we're either a target_title or bad_target
lead_pre := HT.leads (line, pre_pre);
if not lead_pre then
lead_do := HT.leads (line, pre_do);
if not lead_do then
lead_post := HT.leads (line, pre_post);
if not lead_post then
return bad_target;
end if;
end if;
end if;
declare
prefix : constant String := active_prefix;
begin
-- Handle pre-, do-, post- target overrides
if line = prefix & fetch & LAT.Colon or else
line = prefix & fetch & LAT.Colon or else
line = prefix & extract & LAT.Colon or else
line = prefix & patch & LAT.Colon or else
line = prefix & configure & LAT.Colon or else
line = prefix & build & LAT.Colon or else
line = prefix & install & LAT.Colon or else
line = prefix & stage & LAT.Colon or else
line = prefix & test & LAT.Colon
then
return target_title;
end if;
-- Opsys also applies to pre-, do-, and post-
for opsys in supported_opsys'Range loop
declare
lowsys : String := '-' & UTL.lower_opsys (opsys) & LAT.Colon;
begin
if line = prefix & fetch & lowsys or else
line = prefix & extract & lowsys or else
line = prefix & patch & lowsys or else
line = prefix & configure & lowsys or else
line = prefix & build & lowsys or else
line = prefix & install & lowsys or else
line = prefix & install & lowsys or else
line = prefix & test & lowsys
then
return target_title;
end if;
end;
end loop;
-- The only targets left to check are options which end in "-ON:" and "-OFF:".
-- If these suffices aren't found, it's a bad target.
if not HT.trails (line, opt_on) and then
not HT.trails (line, opt_off)
then
return bad_target;
end if;
declare
option_name : String := extract_option (prefix, line);
begin
if spec.option_exists (option_name) then
return target_title;
else
return bad_target;
end if;
end;
end;
end determine_target;
--------------------------------------------------------------------------------------------
-- extract_option_name
--------------------------------------------------------------------------------------------
function extract_option_name
(spec : PSP.Portspecs;
line : String;
last_name : HT.Text) return String
is
-- Already known: first character = "]" and there's "]." present
candidate : String := HT.partial_search (fullstr => line,
offset => 1,
end_marker => "].");
tabs5 : String (1 .. 5) := (others => LAT.HT);
begin
if candidate = "" and then
line'Length > 5 and then
line (line'First .. line'First + 4) = tabs5
then
return HT.USS (last_name);
end if;
if spec.option_exists (candidate) then
return candidate;
else
return "";
end if;
end extract_option_name;
--------------------------------------------------------------------------------------------
-- build_list
--------------------------------------------------------------------------------------------
procedure build_list
(spec : in out PSP.Portspecs;
field : PSP.spec_option;
option : String;
line : String)
is
procedure insert_item (data : String);
arrow : Natural;
word_start : Natural;
strvalue : constant String := retrieve_single_option_value (spec, line);
-- let any exceptions cascade
procedure insert_item (data : String) is
begin
spec.build_option_helper (field => field,
option => option,
value => data);
end insert_item;
use type PSP.spec_option;
begin
if field = PSP.broken_on or else field = PSP.description then
spec.build_option_helper (field => field,
option => option,
value => strvalue);
return;
end if;
-- Handle single item case
if not HT.contains (S => strvalue, fragment => " ") then
insert_item (strvalue);
return;
end if;
declare
mask : constant String := UTL.mask_quoted_string (strvalue);
begin
if HT.contains (S => mask, fragment => " ") or else
mask (mask'First) = LAT.Space
then
raise extra_spaces;
end if;
-- Now we have multiple list items separated by single spaces
-- We know the original line has no trailing spaces too, btw.
word_start := strvalue'First;
arrow := word_start;
loop
exit when arrow > strvalue'Last;
if mask (arrow) = LAT.Space then
insert_item (strvalue (word_start .. arrow - 1));
word_start := arrow + 1;
end if;
arrow := arrow + 1;
end loop;
end;
insert_item (strvalue (word_start .. strvalue'Last));
end build_list;
--------------------------------------------------------------------------------------------
-- retrieve_single_option_value
--------------------------------------------------------------------------------------------
function retrieve_single_option_value (spec : PSP.Portspecs; line : String) return String
is
wrkstr : String (1 .. line'Length) := line;
equals : Natural := AS.Fixed.Index (wrkstr, LAT.Equals_Sign & LAT.HT);
c81624 : Natural := ((equals / 8) + 1) * 8;
tabs5 : String (1 .. 5) := (others => LAT.HT);
-- f(4) = 8 ( 2 .. 7)
-- f(8) = 16; ( 8 .. 15)
-- f(18) = 24; (16 .. 23)
-- We are looking for an exact number of tabs starting at equals + 2:
-- if c81624 = 8, then we need 2 tabs. IF it's 16 then we need 1 tab,
-- if it's 24 then there can be no tabs, and if it's higher, that's a problem.
begin
if equals = 0 then
-- Support quintuple-tab line too.
if wrkstr'Length > 5 and then
wrkstr (wrkstr'First .. wrkstr'First + 4) = tabs5
then
equals := wrkstr'First + 3;
c81624 := 40;
else
raise missing_definition with "No quintuple-tab or equals+tab detected.";
end if;
end if;
if c81624 > 40 then
raise mistabbed_40;
end if;
declare
rest : constant String := wrkstr (equals + 2 .. wrkstr'Last);
contig_tabs : Natural := 0;
arrow : Natural := rest'First;
begin
loop
exit when arrow > rest'Last;
exit when rest (arrow) /= LAT.HT;
contig_tabs := contig_tabs + 1;
arrow := arrow + 1;
end loop;
if ((c81624 = 8) and then (contig_tabs /= 4)) or else
((c81624 = 16) and then (contig_tabs /= 3)) or else
((c81624 = 24) and then (contig_tabs /= 2)) or else
((c81624 = 32) and then (contig_tabs /= 1)) or else
((c81624 = 40) and then (contig_tabs /= 0))
then
raise mistabbed_40;
end if;
return expand_value (spec, rest (rest'First + contig_tabs .. rest'Last));
end;
end retrieve_single_option_value;
--------------------------------------------------------------------------------------------
-- is_file_capsule
--------------------------------------------------------------------------------------------
function is_file_capsule (line : String) return Boolean
is
-- format: [FILE:XXXX:filename]
dummy : Integer;
begin
if line (line'Last) /= LAT.Right_Square_Bracket then
return False;
end if;
if not HT.leads (line, "[FILE:") then
return False;
end if;
if HT.count_char (line, LAT.Colon) /= 2 then
return False;
end if;
dummy := Integer'Value (HT.partial_search (line, 6, ":"));
return True;
exception
when others =>
return False;
end is_file_capsule;
--------------------------------------------------------------------------------------------
-- retrieve_file_size
--------------------------------------------------------------------------------------------
function retrieve_file_size (capsule_label : String) return Natural
is
result : Natural;
begin
result := Integer'Value (HT.partial_search (capsule_label, 6, ":"));
if result > 0 then
return result;
else
return 0;
end if;
exception
when others =>
return 0;
end retrieve_file_size;
--------------------------------------------------------------------------------------------
-- retrieve_file_name
--------------------------------------------------------------------------------------------
function retrieve_file_name (capsule_label : String) return String is
begin
return HT.part_2 (HT.partial_search (capsule_label, 6, "]"), ":");
end retrieve_file_name;
--------------------------------------------------------------------------------------------
-- tranform_filenames
--------------------------------------------------------------------------------------------
function tranform_filename
(filename : String;
match_opsys : String;
match_arch : String) return String
is
pm : constant String := "pkg-message-";
sys : constant String := "opsys";
arc : constant String := "arch";
files : constant String := "files/";
pmlen : constant Natural := pm'Length;
justfile : constant String := HT.part_2 (filename, "/");
begin
if justfile'Length < pmlen + 4 or else
justfile (justfile'First .. justfile'First + pmlen - 1) /= pm
then
return "";
end if;
return HT.USS (HT.replace_substring
(US => HT.replace_substring (HT.SUS (filename), match_opsys, sys),
old_string => match_arch,
new_string => arc));
end tranform_filename;
--------------------------------------------------------------------------------------------
-- valid_conditional_variable
--------------------------------------------------------------------------------------------
function valid_conditional_variable (candidate : String) return Boolean
is
is_namepair : constant Boolean := HT.contains (candidate, "=");
part_name : constant String := HT.part_1 (candidate, "=");
begin
if not is_namepair then
return False;
end if;
declare
possible_singlet : String := part_name & LAT.Equals_Sign & LAT.HT & 'x';
this_singlet : spec_singlet := determine_singlet (possible_singlet);
begin
case this_singlet is
when cflags | cppflags | cxxflags | ldflags | plist_sub |
config_args | config_env | make_args | make_env |
cmake_args | qmake_args =>
null;
when not_singlet =>
if not (part_name = "VAR1" or else
part_name = "VAR2" or else
part_name = "VAR3" or else
part_name = "VAR4" or else
part_name = "MAKEFILE_LINE")
then
return False;
end if;
when others =>
return False;
end case;
declare
payload : String := HT.part_2 (candidate, "=");
mask : String := UTL.mask_quoted_string (payload);
found_spaces : Boolean := HT.contains (payload, " ");
begin
if found_spaces then
return not HT.contains (mask, " ");
else
return True;
end if;
end;
end;
end valid_conditional_variable;
--------------------------------------------------------------------------------------------
-- transform_target_line
--------------------------------------------------------------------------------------------
function transform_target_line
(spec : PSP.Portspecs;
line : String;
skip_transform : Boolean) return String
is
arrow1 : Natural := 0;
arrow2 : Natural := 0;
back_marker : Natural := 0;
canvas : HT.Text := HT.blank;
begin
if skip_transform or else
spec.no_definitions or else
line = ""
then
return line;
end if;
back_marker := line'First;
loop
arrow1 := AS.Fixed.Index (Source => line,
Pattern => "${",
From => back_marker);
if arrow1 = 0 then
HT.SU.Append (canvas, line (back_marker .. line'Last));
exit;
end if;
arrow2 := AS.Fixed.Index (Source => line,
Pattern => "}",
From => arrow1 + 2);
if arrow2 = 0 then
HT.SU.Append (canvas, line (back_marker .. line'Last));
exit;
end if;
-- We've found a candidate. Save the leader and attempt to replace.
if arrow1 > back_marker then
HT.SU.Append (canvas, line (back_marker .. arrow1 - 1));
end if;
back_marker := arrow2 + 1;
if arrow2 - 1 > arrow1 + 2 then
begin
declare
newval : HT.Text := HT.SUS (expand_value (spec, line (arrow1 .. arrow2)));
begin
UTL.apply_cbc_string (newval);
HT.SU.Append (canvas, newval);
end;
exception
when others =>
-- It didn't expand, so keep it.
HT.SU.Append (canvas, line (arrow1 .. arrow2));
end;
else
-- This is "${}", just keep it.
HT.SU.Append (canvas, line (arrow1 .. arrow2));
end if;
exit when back_marker > line'Last;
end loop;
return HT.USS (canvas);
end transform_target_line;
--------------------------------------------------------------------------------------------
-- extract_version
--------------------------------------------------------------------------------------------
function extract_version (varname : String) return String
is
consdir : String := HT.USS (Parameters.configuration.dir_conspiracy);
extmake : String := HT.USS (Parameters.configuration.dir_sysroot) & "/usr/bin/make -m " &
consdir & "/Mk";
command : String := extmake & " -f " & consdir & "/Mk/raven.versions.mk -V " & varname;
status : Integer;
result : HT.Text := Unix.piped_command (command, status);
begin
return HT.first_line (HT.USS (result));
end extract_version;
--------------------------------------------------------------------------------------------
-- extract_information
--------------------------------------------------------------------------------------------
function extract_information (varname : String) return String
is
consdir : String := HT.USS (Parameters.configuration.dir_conspiracy);
extmake : String := HT.USS (Parameters.configuration.dir_sysroot) & "/usr/bin/make -m " &
consdir & "/Mk";
command : String := extmake & " -f " & consdir & "/Mk/raven.information.mk -V " & varname;
status : Integer;
result : HT.Text := Unix.piped_command (command, status);
begin
return HT.first_line (HT.USS (result));
end extract_information;
--------------------------------------------------------------------------------------------
-- verify_extra_file_exists
--------------------------------------------------------------------------------------------
procedure verify_extra_file_exists
(spec : PSP.Portspecs;
specfile : String;
line : String;
is_option : Boolean;
sub_file : Boolean)
is
function get_payload return String;
function get_full_filename (basename : String) return String;
procedure perform_check (filename : String);
arrow : Natural;
word_start : Natural;
filesdir : String := DIR.Containing_Directory (specfile) & "/files";
function get_payload return String is
begin
if is_option then
return retrieve_single_option_value (spec, line);
else
return retrieve_single_value (spec, line);
end if;
end get_payload;
function get_full_filename (basename : String) return String is
begin
if sub_file then
return basename & ".in";
else
return basename;
end if;
end get_full_filename;
procedure perform_check (filename : String)
is
adjusted_filename : String := get_full_filename (filename);
begin
if not DIR.Exists (filesdir & "/" & adjusted_filename) then
raise missing_file with "'" & adjusted_filename & "' is missing from files directory";
end if;
end perform_check;
strvalue : String := get_payload;
begin
-- Handle single item case
if not HT.contains (S => strvalue, fragment => " ") then
perform_check (strvalue);
return;
end if;
declare
mask : constant String := UTL.mask_quoted_string (strvalue);
begin
if HT.contains (S => mask, fragment => " ") or else
mask (mask'First) = LAT.Space
then
raise extra_spaces;
end if;
-- Now we have multiple list items separated by single spaces
-- We know the original line has no trailing spaces too, btw.
word_start := strvalue'First;
arrow := word_start;
loop
exit when arrow > strvalue'Last;
if mask (arrow) = LAT.Space then
perform_check (strvalue (word_start .. arrow - 1));
word_start := arrow + 1;
end if;
arrow := arrow + 1;
end loop;
end;
perform_check (strvalue (word_start .. strvalue'Last));
end verify_extra_file_exists;
--------------------------------------------------------------------------------------------
-- transform_download_sites
--------------------------------------------------------------------------------------------
procedure transform_download_sites (site : in out HT.Text) is
begin
-- special case, GITHUB_PRIVATE (aka GHPRIV).
-- If found, append with site with ":<token>" where <token> is the contents of
-- confdir/tokens/account-project (or ":missing-security-token" if not found)
-- With this case, there is always 4 colons / 5 fields. The 4th (extraction directory)
-- is often blank
if HT.leads (site, "GITHUB_PRIVATE/") or else HT.leads (site, "GHPRIV/") then
declare
notoken : constant String := ":missing-security-token";
triplet : constant String := HT.part_2 (HT.USS (site), "/");
ncolons : constant Natural := HT.count_char (triplet, ':');
begin
if ncolons < 3 then
HT.SU.Append (site, ':');
end if;
if ncolons >= 2 then
declare
account : constant String := HT.specific_field (triplet, 1, ":");
project : constant String := HT.specific_field (triplet, 2, ":");
tfile : constant String := Parameters.raven_confdir &
"/tokens/" & account & '-' & project;
token : constant String := FOP.get_file_contents (tfile);
begin
HT.SU.Append (site, ':' & token);
end;
end if;
exception
when others =>
HT.SU.Append (site, notoken);
end;
end if;
end transform_download_sites;
end Specification_Parser;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
--*
-- OBJECTIVE:
-- CHECK THAT FLOAT I/O GET CAN READ A VALUE FROM A STRING.
-- CHECK THAT END_ERROR IS RAISED WHEN CALLED WITH A NULL STRING
-- OR A STRING CONTAINING SPACES AND/OR HORIZONTAL TABULATION
-- CHARACTERS. CHECK THAT LAST CONTAINS THE INDEX OF THE LAST
-- CHARACTER READ FROM THE STRING.
-- HISTORY:
-- SPS 10/07/82
-- SPS 12/14/82
-- JBG 12/21/82
-- DWC 09/15/87 ADDED CASE TO INCLUDE ONLY TABS IN STRING AND
-- CHECKED THAT END_ERROR IS RAISED.
WITH REPORT; USE REPORT;
WITH TEXT_IO; USE TEXT_IO;
PROCEDURE CE3809A IS
BEGIN
TEST ("CE3809A", "CHECK THAT FLOAT_IO GET " &
"OPERATES CORRECTLY ON STRINGS");
DECLARE
TYPE FL IS DIGITS 4;
PACKAGE FLIO IS NEW FLOAT_IO (FL);
USE FLIO;
X : FL;
STR : STRING (1..10) := " 10.25 ";
L : POSITIVE;
BEGIN
-- LEFT-JUSTIFIED IN STRING, POSITIVE, NO EXPONENT
BEGIN
GET ("896.5 ", X, L);
IF X /= 896.5 THEN
FAILED ("FLOAT VALUE FROM STRING INCORRECT");
END IF;
EXCEPTION
WHEN DATA_ERROR =>
FAILED ("DATA_ERROR RAISED - FLOAT - 1");
WHEN OTHERS =>
FAILED ("UNEXPECTED EXCEPTION RAISED - FLOAT - 1");
END;
IF L /= IDENT_INT (5) THEN
FAILED ("VALUE OF LAST INCORRECT - FLOAT - 1. LAST IS" &
INTEGER'IMAGE(L));
END IF;
-- STRING LITERAL WITH BLANKS
BEGIN
GET (" ", X, L);
FAILED ("END_ERROR NOT RAISED - FLOAT - 2");
EXCEPTION
WHEN END_ERROR =>
IF L /= 5 THEN
FAILED ("AFTER END_ERROR, VALUE OF LAST " &
"INCORRECT - 2. LAST IS" &
INTEGER'IMAGE(L));
END IF;
WHEN DATA_ERROR =>
FAILED ("DATA_ERROR RAISED - FLOAT - 2");
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - FLOAT - 2");
END;
-- NULL STRING LITERAL
BEGIN
GET ("", X, L);
FAILED ("END_ERROR NOT RAISED - FLOAT - 3");
EXCEPTION
WHEN END_ERROR =>
IF L /= 5 THEN
FAILED ("AFTER END_ERROR, VALUE OF LAST " &
"INCORRECT - 3. LAST IS" &
INTEGER'IMAGE(L));
END IF;
WHEN DATA_ERROR =>
FAILED ("DATA_ERROR RAISED - FLOAT - 3");
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - FLOAT - 3");
END;
-- NULL SLICE
BEGIN
GET (STR(5..IDENT_INT(2)), X, L);
FAILED ("END_ERROR NOT RAISED - FLOAT - 4");
EXCEPTION
WHEN END_ERROR =>
IF L /= 5 THEN
FAILED ("AFTER END_ERROR, VALUE OF LAST " &
"INCORRECT - 4. LAST IS" &
INTEGER'IMAGE(L));
END IF;
WHEN DATA_ERROR =>
FAILED ("DATA_ERROR RAISED - FLOAT - 4");
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - FLOAT - 4");
END;
-- SLICE WITH BLANKS
BEGIN
GET (STR(IDENT_INT(9)..10), X, L);
FAILED ("END_ERROR NOT RAISED - FLOAT - 5");
EXCEPTION
WHEN END_ERROR =>
IF L /= IDENT_INT(5) THEN
FAILED ("AFTER END_ERROR, VALUE OF LAST " &
"INCORRECT - 5. LAST IS" &
INTEGER'IMAGE(L));
END IF;
WHEN DATA_ERROR =>
FAILED ("DATA_ERROR RAISED - FLOAT - 5");
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - FLOAT - 5");
END;
-- NON-NULL SLICE
BEGIN
GET (STR(2..IDENT_INT(8)), X, L);
IF X /= 10.25 THEN
FAILED ("FLOAT VALUE INCORRECT - 6");
END IF;
IF L /= 8 THEN
FAILED ("LAST INCORRECT FOR SLICE - 6. LAST IS" &
INTEGER'IMAGE(L));
END IF;
EXCEPTION
WHEN OTHERS =>
FAILED ("EXCEPTION RAISED - 6");
END;
-- LEFT-JUSTIFIED, POSITIVE EXPONENT
BEGIN
GET ("1.34E+02", X, L);
IF X /= 134.0 THEN
FAILED ("FLOAT WITH EXP FROM STRING INCORRECT - 7");
END IF;
IF L /= 8 THEN
FAILED ("VALUE OF LAST INCORRECT - FLOAT - 7. " &
"LAST IS" & INTEGER'IMAGE(L));
END IF;
EXCEPTION
WHEN DATA_ERROR =>
FAILED ("DATA_EROR RAISED - FLOAT - 7");
WHEN OTHERS =>
FAILED ("UNEXPECTED EXCEPTION RAISED - FLOAT - 7");
END;
-- RIGHT-JUSTIFIED, NEGATIVE EXPONENT
BEGIN
GET (" 25.0E-2", X, L);
IF X /= 0.25 THEN
FAILED ("NEG EXPONENT INCORRECT - 8");
END IF;
IF L /= 8 THEN
FAILED ("LAST INCORRECT - 8. LAST IS" &
INTEGER'IMAGE(L));
END IF;
EXCEPTION
WHEN OTHERS =>
FAILED ("EXCEPTION RAISED - 8");
END;
-- RIGHT-JUSTIFIED, NEGATIVE
GET (" -1.50", X, L);
IF X /= -1.5 THEN
FAILED ("FLOAT IN RIGHT JUSTIFIED STRING INCORRECT - 9");
END IF;
IF L /= 7 THEN
FAILED ("LAST INCORRECT - 9. LAST IS" &
INTEGER'IMAGE(L));
END IF;
-- HORIZONTAL TAB WITH BLANKS
BEGIN
GET (" " & ASCII.HT & "2.3E+2", X, L);
IF X /= 230.0 THEN
FAILED ("FLOAT WITH TAB IN STRING INCORRECT - 10");
END IF;
IF L /= 8 THEN
FAILED ("LAST INCORRECT FOR TAB - 10. LAST IS" &
INTEGER'IMAGE(L));
END IF;
EXCEPTION
WHEN DATA_ERROR =>
FAILED ("DATA_ERROR FOR STRING WITH TAB - 10");
WHEN OTHERS =>
FAILED ("SOME EXCEPTION RAISED FOR STRING WITH " &
"TAB - 10");
END;
-- HORIZONTAL TABS ONLY
BEGIN
GET (ASCII.HT & ASCII.HT, X, L);
FAILED ("END_ERROR NOT RAISED - FLOAT - 11");
EXCEPTION
WHEN END_ERROR =>
IF L /= IDENT_INT(8) THEN
FAILED ("AFTER END_ERROR, VALUE OF LAST " &
"INCORRECT - 11. LAST IS" &
INTEGER'IMAGE(L));
END IF;
WHEN DATA_ERROR =>
FAILED ("DATA_ERROR RAISED - FLOAT - 11");
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - FLOAT - 11");
END;
END;
RESULT;
END CE3809A;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with NXP.Device; use NXP.Device;
with System; use System;
with NXP_SVD; use NXP_SVD;
with NXP_SVD.GPIO; use NXP_SVD.GPIO;
with NXP_SVD.IOCON; use NXP_SVD.IOCON;
with NXP_SVD.INPUTMUX; use NXP_SVD.INPUTMUX;
with NXP_SVD.PINT; use NXP_SVD.PINT;
package body NXP.GPIO is
IOCON : aliased IOCON_Peripheral with Import, Address => S_NS_Periph (IOCON_Base);
-------------
-- Any_Set --
-------------
function Any_Set (Pins : GPIO_Points) return Boolean is
begin
for Pin of Pins loop
if Pin.Set then
return True;
end if;
end loop;
return False;
end Any_Set;
----------
-- Mode --
----------
overriding
function Mode (This : GPIO_Point) return HAL.GPIO.GPIO_Mode is
Index : constant GPIO_Pin_Index := GPIO_Pin'Pos (This.Pin);
begin
return HAL.GPIO.Output;
end Mode;
--------------
-- Set_Mode --
--------------
overriding
function Set_Mode
(This : in out GPIO_Point;
Mode : HAL.GPIO.GPIO_Config_Mode)
return Boolean
is
Index : constant GPIO_Pin_Index := GPIO_Pin'Pos (This.Pin);
begin
return True;
end Set_Mode;
-------------------
-- Pull_Resistor --
-------------------
overriding
function Pull_Resistor
(This : GPIO_Point)
return HAL.GPIO.GPIO_Pull_Resistor
is
Index : constant GPIO_Pin_Index := GPIO_Pin'Pos (This.Pin);
begin
return HAL.GPIO.Floating;
end Pull_Resistor;
-----------------------
-- Set_Pull_Resistor --
-----------------------
overriding
function Set_Pull_Resistor
(This : in out GPIO_Point;
Pull : HAL.GPIO.GPIO_Pull_Resistor)
return Boolean
is
Index : constant GPIO_Pin_Index := GPIO_Pin'Pos (This.Pin);
begin
return True;
end Set_Pull_Resistor;
---------
-- Set --
---------
overriding
function Set (This : GPIO_Point) return Boolean
is
Port_Idx : Integer := This.Port'Enum_Rep;
Index : constant GPIO_Pin_Index := GPIO_Pin'Pos (This.Pin);
begin
return This.Periph.B (Port_Idx).B (Index).PBYTE;
end Set;
-------------
-- All_Set --
-------------
function All_Set (Pins : GPIO_Points) return Boolean is
begin
for Pin of Pins loop
if not Pin.Set then
return False;
end if;
end loop;
return True;
end All_Set;
---------
-- Set --
---------
overriding
procedure Set (This : in out GPIO_Point)
is
Port_Idx : Integer := This.Port'Enum_Rep;
Index : constant GPIO_Pin_Index := GPIO_Pin'Pos (This.Pin);
begin
This.Periph.B (Port_Idx).B (Index).PBYTE := True;
end Set;
---------
-- Set --
---------
procedure Set (Pins : in out GPIO_Points) is
begin
for Pin of Pins loop
Pin.Set;
end loop;
end Set;
-----------
-- Clear --
-----------
overriding
procedure Clear (This : in out GPIO_Point)
is
Port_Idx : Integer := This.Port'Enum_Rep;
Index : constant GPIO_Pin_Index := GPIO_Pin'Pos (This.Pin);
begin
This.Periph.B (Port_Idx).B (Index).PBYTE := False;
end Clear;
-----------
-- Clear --
-----------
procedure Clear (Pins : in out GPIO_Points) is
begin
for Pin of Pins loop
Pin.Clear;
end loop;
end Clear;
------------
-- Toggle --
------------
overriding
procedure Toggle (This : in out GPIO_Point)
is
Port_Idx : Integer := This.Port'Enum_Rep;
Index : constant GPIO_Pin_Index := GPIO_Pin'Pos (This.Pin);
Mask : UInt32 := 2 ** Index;
begin
This.Periph.NOT_k (Port_Idx) := Mask;
end Toggle;
------------
-- Toggle --
------------
procedure Toggle (Points : in out GPIO_Points) is
begin
for Point of Points loop
Point.Toggle;
end loop;
end Toggle;
------------------
-- Configure_IO --
------------------
procedure Configure_IO
(This : GPIO_Point;
Config : GPIO_Port_Configuration)
is
Port_Idx : Integer := This.Port'Enum_Rep;
Index : constant GPIO_Pin_Index := GPIO_Pin'Pos (This.Pin);
Mask : UInt32 := 2 ** Index;
begin
case Config.Mode is
when Mode_Out =>
This.Periph.DIR (Port_Idx) := This.Periph.DIR (Port_Idx) or Mask;
IOCON.P (Port_Idx).PIO (Index).CTL.SLEW :=
CTL_SLEW_Field'Enum_Val (Config.Speed'Enum_Rep);
IOCON.P (Port_Idx).PIO (Index).CTL.OD :=
CTL_OD_Field'Enum_Val (Config.Output_Type'Enum_Rep);
when Mode_In =>
This.Periph.DIR (Port_Idx) := This.Periph.DIR (Port_Idx) and not Mask;
IOCON.P (Port_Idx).PIO (Index).CTL.MODE :=
CTL_MODE_Field'Enum_Val (Config.Resistors'Enum_Rep);
IOCON.P (Port_Idx).PIO (Index).CTL.DIGIMODE := Digital;
IOCON.P (Port_Idx).PIO (Index).CTL.INVERT :=
(if Config.Invert then Enabled else Disabled);
when Mode_AF =>
IOCON.P (Port_Idx).PIO (Index).CTL.MODE :=
CTL_MODE_Field'Enum_Val (Config.Resistors'Enum_Rep);
IOCON.P (Port_Idx).PIO (Index).CTL.DIGIMODE := Digital;
IOCON.P (Port_Idx).PIO (Index).CTL.INVERT :=
(if Config.Invert then Enabled else Disabled);
when others =>
null;
end case;
end Configure_IO;
------------------
-- Configure_IO --
------------------
procedure Configure_IO
(Points : GPIO_Points;
Config : GPIO_Port_Configuration)
is
begin
for Point of Points loop
Point.Configure_IO (Config);
end loop;
end Configure_IO;
----------------------------------
-- Configure_Alternate_Function --
----------------------------------
procedure Configure_Alternate_Function
(This : GPIO_Point;
AF : GPIO_Alternate_Function)
is
Port_Idx : Integer := This.Port'Enum_Rep;
Index : constant GPIO_Pin_Index := GPIO_Pin'Pos (This.Pin);
begin
IOCON.P (Port_Idx).PIO (Index).CTL.FUNC := UInt4 (AF);
end Configure_Alternate_Function;
----------------------------------
-- Configure_Alternate_Function --
----------------------------------
procedure Configure_Alternate_Function
(Points : GPIO_Points;
AF : GPIO_Alternate_Function)
is
begin
for Point of Points loop
Point.Configure_Alternate_Function (AF);
end loop;
end Configure_Alternate_Function;
procedure Enable_GPIO_Interrupt (Pin : GPIO_Point; Config : Pint_Configuration)
is
Port_Idx : Integer := Pin.Port'Enum_Rep;
Index : constant GPIO_Pin_Index := GPIO_Pin'Pos (Pin.Pin);
INPUTMUX : aliased INPUTMUX_Peripheral
with Import, Address => S_NS_Periph (INPUTMUX_Base);
PINT : aliased PINT_Peripheral
with Import, Address => S_NS_Periph (PINT_Base);
Slot : Integer := Config.Slot'Enum_Rep;
Mask : UInt8 := (2 ** Slot);
begin
INPUTMUX.PINTSEL (Slot'Enum_Rep).INTPIN := UInt7 ((Port_Idx * 32) + Index);
if Config.Mode = Pint_Edge then
PINT.ISEL.PMODE := PINT.ISEL.PMODE and not Mask;
if Config.Edge = Pint_Rising then
PINT.SIENR.SETENRL := Mask;
else
PINT.SIENF.SETENAF := Mask;
end if;
else -- handle level
PINT.ISEL.PMODE := PINT.ISEL.PMODE or Mask;
if Config.Level = Pint_High then
PINT.SIENR.SETENRL := Mask;
else
PINT.SIENF.SETENAF := Mask;
end if;
end if;
end Enable_GPIO_Interrupt;
end NXP.GPIO;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
------------------------------------------------------------------------------
with Ada.Strings.Fixed;
package body Natools.String_Slices.Slice_Sets is
package Fixed renames Ada.Strings.Fixed;
---------------------------
-- Range_Set subprograms --
---------------------------
function Is_Overlapping (Bounds : String_Range; Set : Range_Set)
return Boolean
is
Cursor : Range_Sets.Cursor := Set.Floor (Bounds);
begin
if Range_Sets.Has_Element (Cursor) then
if Bounds.First <= Last (Range_Sets.Element (Cursor)) then
return True;
end if;
Range_Sets.Next (Cursor);
else
Cursor := Set.First;
end if;
if Range_Sets.Has_Element (Cursor)
and then Range_Sets.Element (Cursor).First <= Last (Bounds)
then
return True;
end if;
return False;
end Is_Overlapping;
function Is_Valid (Set : Range_Set) return Boolean is
Cursor : Range_Sets.Cursor := Set.First;
Prev, Cur : String_Range;
begin
if not Range_Sets.Has_Element (Cursor) then
return True;
end if;
Prev := Range_Sets.Element (Cursor);
if Prev.Length = 0 then
return False;
end if;
Range_Sets.Next (Cursor);
while Range_Sets.Has_Element (Cursor) loop
Cur := Range_Sets.Element (Cursor);
if Cur.Length = 0 then
return False;
end if;
pragma Assert (Prev.First <= Cur.First);
if Is_In (Last (Prev), Cur) then
return False;
end if;
Prev := Cur;
Range_Sets.Next (Cursor);
end loop;
return True;
end Is_Valid;
function Total_Span (Set : Range_Set) return String_Range is
Result : String_Range := (1, 0);
Cursor : Range_Sets.Cursor := Set.First;
begin
if not Range_Sets.Has_Element (Cursor) then
return Result;
end if;
Result.First := Range_Sets.Element (Cursor).First;
Cursor := Set.Last;
Set_Last (Result, Last (Range_Sets.Element (Cursor)));
return Result;
end Total_Span;
procedure Include_Range
(Set : in out Range_Set; Bounds : in String_Range)
is
Cursor : Range_Sets.Cursor := Set.Floor (Bounds);
Next : Range_Sets.Cursor;
Actual : String_Range := Bounds;
R : String_Range;
begin
if Range_Sets.Has_Element (Cursor) then
R := Range_Sets.Element (Cursor);
Next := Range_Sets.Next (Cursor);
-- Do nothing if the given range is already covered
if Is_Subrange (Actual, R) then
return;
end if;
-- Merge with previous range if overlapping
if Is_In (Actual.First, R) then
Set_First (Actual, R.First);
Set.Delete (Cursor);
end if;
else
Next := Set.First;
end if;
while Range_Sets.Has_Element (Next) loop
Cursor := Next;
R := Range_Sets.Element (Cursor);
exit when not Is_In (R.First, Actual);
Next := Range_Sets.Next (Cursor);
if Is_Subrange (R, Actual) then
Set.Delete (Cursor);
else
pragma Assert (Last (R) > Last (Actual));
Set_Last (Actual, Last (R));
Set.Delete (Cursor);
end if;
end loop;
Set.Insert (Actual);
pragma Assert (Is_Valid (Set));
end Include_Range;
procedure Exclude_Range
(Set : in out Range_Set; Bounds : in String_Range)
is
Cursor : Range_Sets.Cursor;
R : String_Range;
begin
if Bounds.Length = 0 then
return;
end if;
Cursor := Set.Floor (Bounds);
if Range_Sets.Has_Element (Cursor) then
R := Range_Sets.Element (Cursor);
if R.First < Bounds.First then
if Is_In (Bounds.First, R) then
if Is_In (Last (Bounds) + 1, R) then
Set.Insert (To_Range (Last (Bounds) + 1, Last (R)));
end if;
Set_Last (R, Bounds.First - 1);
pragma Assert (R.Length > 0);
Set.Replace_Element (Cursor, R);
end if;
Range_Sets.Next (Cursor);
end if;
else
Cursor := Set.First;
end if;
while Range_Sets.Has_Element (Cursor)
and then Is_Subrange (Range_Sets.Element (Cursor), Bounds)
loop
declare
Next : constant Range_Sets.Cursor := Range_Sets.Next (Cursor);
begin
Set.Delete (Cursor);
Cursor := Next;
end;
end loop;
if Range_Sets.Has_Element (Cursor)
and then Is_In (Last (Bounds) + 1, Range_Sets.Element (Cursor))
then
R := Range_Sets.Element (Cursor);
Set_First (R, Last (Bounds) + 1);
Set.Replace_Element (Cursor, R);
end if;
pragma Assert (Is_Valid (Set));
end Exclude_Range;
-------------------------------
-- Public helper subprograms --
-------------------------------
function "<" (Left, Right : String_Range) return Boolean is
begin
return Left.First < Right.First;
end "<";
----------------------------
-- Conversion subprograms --
----------------------------
function To_Slice (S : Slice_Set) return Slice is
use type Ada.Containers.Count_Type;
begin
if S.Ref.Is_Empty then
return Null_Slice;
end if;
if S.Bounds.Is_Empty then
return Slice'(Bounds => (1, 0),
Ref => S.Ref);
elsif S.Bounds.Length = 1 then
return Slice'(Bounds => S.Bounds.First_Element,
Ref => S.Ref);
end if;
return To_Slice (To_String (S));
end To_Slice;
function To_Slice_Set (S : String) return Slice_Set is
function Factory return String;
function Factory return String is
begin
return S;
end Factory;
Result : Slice_Set;
begin
Result.Ref := String_Refs.Create (Factory'Access);
if S'Length > 0 then
Result.Bounds.Insert ((S'First, S'Length));
end if;
return Result;
end To_Slice_Set;
function To_Slice_Set (S : Slice) return Slice_Set is
Result : Slice_Set;
begin
Result.Ref := S.Ref;
if S.Bounds.Length > 0 then
Result.Bounds.Insert (S.Bounds);
end if;
return Result;
end To_Slice_Set;
function To_String (Set : Slice_Set) return String is
Cursor : Range_Sets.Cursor := Set.Bounds.First;
R : String_Range;
I : Positive := 1;
begin
return Result : String (1 .. Set.Total_Length) do
while Range_Sets.Has_Element (Cursor) loop
R := Range_Sets.Element (Cursor);
Result (I .. I + R.Length - 1)
:= Set.Ref.Query.Data.all (R.First .. Last (R));
I := I + R.Length;
Range_Sets.Next (Cursor);
end loop;
pragma Assert (I = Result'Last + 1);
end return;
end To_String;
function To_String (Set : Slice_Set; Subrange : String_Range)
return String is
begin
return Set.Subset (Subrange).To_String;
end To_String;
function To_String (Set : Slice_Set; First : Positive; Last : Natural)
return String is
begin
return Set.Subset (To_Range (First, Last)).To_String;
end To_String;
---------------------------------
-- Basic slice-set subprograms --
---------------------------------
procedure Clear (Set : in out Slice_Set) is
begin
Set.Bounds.Clear;
end Clear;
function Element (Set : Slice_Set; Index : Positive) return Character is
begin
if not Is_In (Set, Index) then
raise Constraint_Error;
end if;
return Set.Ref.Query.Data.all (Index);
end Element;
function First (Set : Slice_Set) return Positive is
Cursor : constant Range_Sets.Cursor := Set.Bounds.First;
begin
if Range_Sets.Has_Element (Cursor) then
return Range_Sets.Element (Cursor).First;
else
return 1;
end if;
end First;
function Is_Empty (Set : Slice_Set) return Boolean is
begin
return Set.Bounds.Is_Empty;
end Is_Empty;
function Is_In (Set : Slice_Set; Index : Natural) return Boolean is
Cursor : Range_Sets.Cursor;
begin
if Index = 0 or else Set.Ref.Is_Empty or else Set.Bounds.Is_Empty then
return False;
end if;
Cursor := Set.Bounds.Floor ((Index, 0));
return Range_Sets.Has_Element (Cursor)
and then Is_In (Index, Range_Sets.Element (Cursor));
end Is_In;
function Is_Null (Set : Slice_Set) return Boolean is
begin
return Set.Ref.Is_Empty;
end Is_Null;
function Is_Valid (Set : Slice_Set) return Boolean is
begin
if Set.Ref.Is_Empty then
return Set.Bounds.Is_Empty;
else
return Is_Subrange (Total_Span (Set.Bounds),
Get_Range (Set.Ref.Query.Data.all))
and then Is_Valid (Set.Bounds);
end if;
end Is_Valid;
function Last (Set : Slice_Set) return Natural is
Cursor : constant Range_Sets.Cursor := Set.Bounds.Last;
begin
if Range_Sets.Has_Element (Cursor) then
return Last (Range_Sets.Element (Cursor));
else
return 0;
end if;
end Last;
-- Multistep version:
-- function Next (Set : Slice_Set; Index : Natural; Steps : Positive := 1)
-- return Natural
-- is
-- Cursor : Range_Sets.Cursor;
-- Target : Positive := Index + Steps;
-- Skipped : Natural;
-- R : String_Range;
-- begin
-- if Index = 0 or else Set.Ref.Is_Empty or else Set.Bounds.Is_Empty then
-- raise Constraint_Error;
-- end if;
--
-- Cursor := Set.Bounds.Floor ((Index, 0));
--
-- if not Range_Sets.Has_Element (Cursor) then
-- raise Constraint_Error with "Next with index out of bounds";
-- end if;
--
-- R := Range_Sets.Element (Cursor);
-- loop
-- if Is_In (Target, R) then
-- return Target;
-- end if;
--
-- Skipped := Last (R) + 1;
-- Range_Sets.Next (Cursor);
-- exit when not Range_Sets.Has_Element (Cursor);
-- R := Range_Sets.Element (Cursor);
-- Skipped := R.First - Skipped;
-- Target := Target + Skipped;
-- end loop;
--
-- return 0;
-- end Next;
function Next (Set : Slice_Set; Index : Natural) return Natural is
Cursor : Range_Sets.Cursor;
begin
if Index = 0 or else Set.Ref.Is_Empty or else Set.Bounds.Is_Empty then
raise Constraint_Error;
end if;
Cursor := Set.Bounds.Floor ((Index, 0));
if not Range_Sets.Has_Element (Cursor) then
raise Constraint_Error with "Next with index out of bounds";
end if;
if Is_In (Index + 1, Range_Sets.Element (Cursor)) then
return Index + 1;
else
Range_Sets.Next (Cursor);
if Range_Sets.Has_Element (Cursor) then
return Range_Sets.Element (Cursor).First;
else
return 0;
end if;
end if;
end Next;
procedure Next (Set : in Slice_Set; Index : in out Natural) is
begin
Index := Next (Set, Index);
end Next;
-- Multistep version:
-- function Previous (Set : Slice_Set; Index : Natural; Steps : Positive := 1)
-- return Natural
-- is
-- Cursor : Range_Sets.Cursor;
-- Target : Positive;
-- Prev_First : Positive;
-- Skipped : Natural;
-- R : String_Range;
-- begin
-- if Index = 0 or else Set.Ref.Is_Empty or else Set.Bounds.Is_Empty then
-- raise Constraint_Error;
-- end if;
--
-- if Steps >= Index then
-- return 0;
-- end if;
-- Target := Index - Steps;
--
-- Cursor := Set.Bounds.Floor ((Index, 0));
-- if not Range_Sets.Has_Element (Cursor) then
-- raise Constraint_Error with "Previous with index out of bounds";
-- end if;
--
-- loop
-- R := Range_Sets.Element (Cursor);
-- if Is_In (Target, R) then
-- return Target;
-- end if;
--
-- Prev_First := R.First;
-- Range_Sets.Previous (Cursor);
-- exit when not Range_Sets.Has_Element (Cursor);
-- R := Range_Sets.Element (Cursor);
--
-- Skipped := Prev_First - (Last (R) + 1);
-- exit when Skipped >= Target;
-- Target := Target - Skipped;
-- end loop;
--
-- return 0;
-- end Previous;
function Previous (Set : Slice_Set; Index : Natural) return Natural is
Cursor : Range_Sets.Cursor;
begin
if Index = 0 or else Set.Ref.Is_Empty or else Set.Bounds.Is_Empty then
raise Constraint_Error;
end if;
Cursor := Set.Bounds.Floor ((Index, 0));
if not Range_Sets.Has_Element (Cursor) then
raise Constraint_Error with "Previous with index out of bounds";
end if;
if Is_In (Index - 1, Range_Sets.Element (Cursor)) then
return Index - 1;
else
Range_Sets.Previous (Cursor);
if Range_Sets.Has_Element (Cursor) then
return Last (Range_Sets.Element (Cursor));
else
return 0;
end if;
end if;
end Previous;
procedure Previous (Set : in Slice_Set; Index : in out Natural) is
begin
Index := Previous (Set, Index);
end Previous;
function Total_Length (Set : Slice_Set) return Natural is
Cursor : Range_Sets.Cursor := Set.Bounds.First;
Result : Natural := 0;
begin
while Range_Sets.Has_Element (Cursor) loop
Result := Result + Range_Sets.Element (Cursor).Length;
Range_Sets.Next (Cursor);
end loop;
return Result;
end Total_Length;
----------------------------
-- Operation on slice set --
----------------------------
procedure Add_Slice (Set : in out Slice_Set; Bounds : in String_Range) is
begin
if Bounds.Length = 0 then
return;
end if;
if Set.Ref.Is_Empty then
raise Constraint_Error with "Cannot add range to null slice set";
end if;
if not Is_Subrange (Bounds, Get_Range (Set.Ref.Query.Data.all)) then
raise Constraint_Error with "Add slice outside of parent";
end if;
if Is_Overlapping (Bounds, Set.Bounds) then
raise Constraint_Error with "Add an overlapping slice to a set";
end if;
Set.Bounds.Insert (Bounds);
end Add_Slice;
procedure Add_Slice (Set : in out Slice_Set; S : in Slice) is
use type String_Refs.Immutable_Reference;
begin
if S.Bounds.Length = 0 then
return;
end if;
if Set.Ref.Is_Empty then
pragma Assert (Set.Bounds.Is_Empty);
Set.Ref := S.Ref;
Set.Bounds.Insert (S.Bounds);
return;
end if;
if Set.Ref /= S.Ref then
raise Constraint_Error with
"Addition of an unrelated slice to a slice set";
end if;
if Is_Overlapping (S.Bounds, Set.Bounds) then
raise Constraint_Error with
"Addition of an overlapping slice to a slice set";
end if;
Set.Bounds.Insert (S.Bounds);
end Add_Slice;
procedure Add_Slice
(Set : in out Slice_Set;
First : in Positive;
Last : in Natural) is
begin
Add_Slice (Set, To_Range (First, Last));
end Add_Slice;
procedure Include_Slice
(Set : in out Slice_Set; Bounds : in String_Range) is
begin
if Bounds.Length = 0 then
return;
end if;
if Set.Ref.Is_Empty then
raise Constraint_Error with "Cannot include range to null slice set";
end if;
if not Is_Subrange (Bounds, Get_Range (Set.Ref.Query.Data.all)) then
raise Constraint_Error with "Include slice outside of parent";
end if;
Include_Range (Set.Bounds, Bounds);
end Include_Slice;
procedure Include_Slice (Set : in out Slice_Set; S : in Slice) is
use type String_Refs.Immutable_Reference;
begin
if S.Bounds.Length = 0 then
return;
end if;
if Set.Ref.Is_Empty then
pragma Assert (Set.Bounds.Is_Empty);
Set.Ref := S.Ref;
Set.Bounds.Insert (S.Bounds);
return;
end if;
if Set.Ref /= S.Ref then
raise Constraint_Error with
"Addition of an unrelated slice to a slice set";
end if;
Include_Range (Set.Bounds, S.Bounds);
end Include_Slice;
procedure Include_Slice
(Set : in out Slice_Set;
First : in Positive;
Last : in Natural) is
begin
Include_Slice (Set, To_Range (First, Last));
end Include_Slice;
procedure Exclude_Slice
(Set : in out Slice_Set; Bounds : in String_Range) is
begin
if Bounds.Length = 0 then
return;
end if;
if Set.Ref.Is_Empty then
raise Constraint_Error with
"Cannot exclude range from null slice set";
end if;
Exclude_Range (Set.Bounds, Bounds);
end Exclude_Slice;
procedure Exclude_Slice
(Set : in out Slice_Set;
First : in Positive;
Last : in Natural) is
begin
Exclude_Slice (Set, To_Range (First, Last));
end Exclude_Slice;
procedure Restrict (Set : in out Slice_Set; Bounds : in String_Range) is
begin
if Set.Ref.Is_Empty then
raise Constraint_Error with "Cannot restrict null slice set";
end if;
if Bounds.Length = 0 then
Set.Bounds.Clear;
else
declare
Set_First : constant Positive := Set.First;
Set_Last : constant Natural := Set.Last;
begin
if Set_First < Bounds.First then
Exclude_Range
(Set.Bounds,
To_Range (Set_First, Bounds.First - 1));
end if;
if Set_Last > Last (Bounds) then
Exclude_Range
(Set.Bounds,
To_Range (Last (Bounds) + 1, Set_Last));
end if;
end;
end if;
end Restrict;
procedure Restrict
(Set : in out Slice_Set;
First : in Positive;
Last : in Natural) is
begin
Restrict (Set, To_Range (First, Last));
end Restrict;
function Subset (Set : Slice_Set; Bounds : String_Range) return Slice_Set is
Result : Slice_Set;
Cursor : Range_Sets.Cursor;
R : String_Range;
begin
if Set.Ref.Is_Empty then
raise Constraint_Error with "Subset of null slice set";
end if;
Result.Ref := Set.Ref;
if Bounds.Length = 0 or else Set.Bounds.Is_Empty then
return Result;
end if;
Cursor := Set.Bounds.Floor (Bounds);
if Range_Sets.Has_Element (Cursor) then
R := Range_Sets.Element (Cursor);
if R.First < Bounds.First then
if Is_In (Bounds.First, R) then
Set_First (R, Bounds.First);
if Is_In (Last (Bounds), R) then
Set_Last (R, Last (Bounds));
end if;
Result.Bounds.Insert (R);
end if;
Range_Sets.Next (Cursor);
end if;
else
Cursor := Set.Bounds.First;
end if;
while Range_Sets.Has_Element (Cursor) loop
R := Range_Sets.Element (Cursor);
if Is_Subrange (R, Bounds) then
Result.Bounds.Insert (R);
else
if Is_In (Last (Bounds), R) then
Set_Last (R, Last (Bounds));
Result.Bounds.Insert (R);
end if;
exit;
end if;
Range_Sets.Next (Cursor);
end loop;
return Result;
end Subset;
function Subset (Set : Slice_Set; First : Positive; Last : Natural)
return Slice_Set is
begin
return Subset (Set, To_Range (First, Last));
end Subset;
procedure Cut_Before (Set : in out Slice_Set; Index : in Positive) is
Cursor : Range_Sets.Cursor;
Lower, Upper : String_Range;
begin
if Set.Ref.Is_Empty or else Set.Bounds.Is_Empty then
raise Constraint_Error;
end if;
Cursor := Set.Bounds.Floor ((Index, 0));
if not Range_Sets.Has_Element (Cursor) then
raise Constraint_Error;
end if;
Lower := Range_Sets.Element (Cursor);
if not Is_In (Index, Lower) then
raise Constraint_Error;
end if;
if Lower.First = Index then
return; -- nothing to do
end if;
Upper := Lower;
Set_Last (Lower, Index - 1);
Set_First (Upper, Index);
Set.Bounds.Delete (Cursor);
Set.Bounds.Insert (Lower);
Set.Bounds.Insert (Upper);
end Cut_Before;
---------------
-- Iterators --
---------------
procedure Trim_Slices
(Set : in out Slice_Set;
Trim : not null access function (Slice : String) return String_Range)
is
Cursor : Range_Sets.Cursor := Set.Bounds.First;
Old_Range, New_Range : String_Range;
begin
while Range_Sets.Has_Element (Cursor) loop
Old_Range := Range_Sets.Element (Cursor);
New_Range := Trim.all
(Set.Ref.Query.Data.all (Old_Range.First .. Last (Old_Range)));
if New_Range.Length = 0 then
declare
Next : constant Range_Sets.Cursor := Range_Sets.Next (Cursor);
begin
Set.Bounds.Delete (Cursor);
Cursor := Next;
end;
else
if not Is_Subrange (New_Range, Old_Range) then
raise Constraint_Error with "Trim not returning a subrange";
end if;
Set.Bounds.Replace_Element (Cursor, New_Range);
Range_Sets.Next (Cursor);
end if;
end loop;
end Trim_Slices;
procedure Query_Slices
(Set : in Slice_Set;
Process : not null access procedure (S : in Slice))
is
Cursor : Range_Sets.Cursor := Set.Bounds.First;
begin
while Range_Sets.Has_Element (Cursor) loop
Process.all (Slice'(Range_Sets.Element (Cursor), Set.Ref));
Range_Sets.Next (Cursor);
end loop;
end Query_Slices;
----------------------
-- Search functions --
----------------------
function Find_Slice
(Set : Slice_Set;
From : Positive;
Test : not null access function (Slice : String) return Boolean;
Going : Ada.Strings.Direction := Ada.Strings.Forward)
return String_Range
is
Cursor : Range_Sets.Cursor;
Update : access procedure (C : in out Range_Sets.Cursor);
R : String_Range;
begin
if Set.Ref.Is_Empty then
raise Constraint_Error with "Find_Slice on null slice set";
end if;
case Going is
when Ada.Strings.Forward => Update := Range_Sets.Next'Access;
when Ada.Strings.Backward => Update := Range_Sets.Previous'Access;
end case;
Cursor := Set.Bounds.Floor ((From, 0));
while Range_Sets.Has_Element (Cursor) loop
R := Range_Sets.Element (Cursor);
if Test.all (Set.Ref.Query.Data.all (R.First .. Last (R))) then
return R;
end if;
Update.all (Cursor);
end loop;
return (1, 0);
end Find_Slice;
function Find_Slice
(Set : Slice_Set;
Test : not null access function (Slice : String) return Boolean;
Going : Ada.Strings.Direction := Ada.Strings.Forward)
return String_Range is
begin
case Going is
when Ada.Strings.Forward =>
return Find_Slice (Set, Set.First, Test, Going);
when Ada.Strings.Backward =>
return Find_Slice (Set, Set.Last, Test, Going);
end case;
end Find_Slice;
function Index
(Source : Slice_Set;
Set : Ada.Strings.Maps.Character_Set;
From : Positive;
Test : Ada.Strings.Membership := Ada.Strings.Inside;
Going : Ada.Strings.Direction := Ada.Strings.Forward)
return Natural
is
Cursor : Range_Sets.Cursor;
Update : access procedure (C : in out Range_Sets.Cursor);
R : String_Range;
Result : Natural := 0;
begin
case Going is
when Ada.Strings.Forward => Update := Range_Sets.Next'Access;
when Ada.Strings.Backward => Update := Range_Sets.Previous'Access;
end case;
Cursor := Source.Bounds.Floor ((From, 0));
if not Range_Sets.Has_Element (Cursor) then
raise Ada.Strings.Index_Error;
end if;
R := Range_Sets.Element (Cursor);
if Is_In (From, R) then
Result := Fixed.Index
(Source.Ref.Query.Data.all (R.First .. Last (R)),
Set,
From,
Test,
Going);
end if;
while Result = 0 loop
Update.all (Cursor);
if not Range_Sets.Has_Element (Cursor) then
return 0;
end if;
R := Range_Sets.Element (Cursor);
Result := Fixed.Index
(Source.Ref.Query.Data.all (R.First .. Last (R)),
Set,
Test,
Going);
end loop;
return Result;
end Index;
function Index
(Source : Slice_Set;
Set : Ada.Strings.Maps.Character_Set;
Test : Ada.Strings.Membership := Ada.Strings.Inside;
Going : Ada.Strings.Direction := Ada.Strings.Forward)
return Natural is
begin
case Going is
when Ada.Strings.Forward =>
return Index (Source, Set, Source.First, Test, Going);
when Ada.Strings.Backward =>
return Index (Source, Set, Source.Last, Test, Going);
end case;
end Index;
end Natools.String_Slices.Slice_Sets;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Defines the MKS dimension system which is the SI system of units
-- Some other prefixes of this system are defined in a child package (see
-- System.Dim.Generic_Mks.Generic_Other_Prefixes) in order to avoid too many
-- constant declarations in this package.
-- The dimension terminology is defined in System.Dim package
with Ada.Numerics;
generic
type Float_Type is digits <>;
package System.Dim.Generic_Mks is
e : constant := Ada.Numerics.e;
Pi : constant := Ada.Numerics.Pi;
-- Dimensioned type Mks_Type
type Mks_Type is new Float_Type
with
Dimension_System => (
(Unit_Name => Meter, Unit_Symbol => 'm', Dim_Symbol => 'L'),
(Unit_Name => Kilogram, Unit_Symbol => "kg", Dim_Symbol => 'M'),
(Unit_Name => Second, Unit_Symbol => 's', Dim_Symbol => 'T'),
(Unit_Name => Ampere, Unit_Symbol => 'A', Dim_Symbol => 'I'),
(Unit_Name => Kelvin, Unit_Symbol => 'K', Dim_Symbol => '@'),
(Unit_Name => Mole, Unit_Symbol => "mol", Dim_Symbol => 'N'),
(Unit_Name => Candela, Unit_Symbol => "cd", Dim_Symbol => 'J'));
-- SI Base dimensioned subtypes
subtype Length is Mks_Type
with
Dimension => (Symbol => 'm',
Meter => 1,
others => 0);
subtype Mass is Mks_Type
with
Dimension => (Symbol => "kg",
Kilogram => 1,
others => 0);
subtype Time is Mks_Type
with
Dimension => (Symbol => 's',
Second => 1,
others => 0);
subtype Electric_Current is Mks_Type
with
Dimension => (Symbol => 'A',
Ampere => 1,
others => 0);
subtype Thermodynamic_Temperature is Mks_Type
with
Dimension => (Symbol => 'K',
Kelvin => 1,
others => 0);
subtype Amount_Of_Substance is Mks_Type
with
Dimension => (Symbol => "mol",
Mole => 1,
others => 0);
subtype Luminous_Intensity is Mks_Type
with
Dimension => (Symbol => "cd",
Candela => 1,
others => 0);
-- Initialize SI Base unit values
-- Turn off the all the dimension warnings for these basic assignments
-- since otherwise we would get complaints about assigning dimensionless
-- values to dimensioned subtypes (we can't assign 1.0*m to m).
pragma Warnings (Off, "*assumed to be*");
m : constant Length := 1.0;
kg : constant Mass := 1.0;
s : constant Time := 1.0;
A : constant Electric_Current := 1.0;
K : constant Thermodynamic_Temperature := 1.0;
mol : constant Amount_Of_Substance := 1.0;
cd : constant Luminous_Intensity := 1.0;
pragma Warnings (On, "*assumed to be*");
-- SI Derived dimensioned subtypes
subtype Absorbed_Dose is Mks_Type
with
Dimension => (Symbol => "Gy",
Meter => 2,
Second => -2,
others => 0);
subtype Angle is Mks_Type
with
Dimension => (Symbol => "rad",
others => 0);
subtype Area is Mks_Type
with
Dimension => (
Meter => 2,
others => 0);
subtype Catalytic_Activity is Mks_Type
with
Dimension => (Symbol => "kat",
Second => -1,
Mole => 1,
others => 0);
subtype Celsius_Temperature is Mks_Type
with
Dimension => (Symbol => "°C",
Kelvin => 1,
others => 0);
subtype Electric_Capacitance is Mks_Type
with
Dimension => (Symbol => 'F',
Meter => -2,
Kilogram => -1,
Second => 4,
Ampere => 2,
others => 0);
subtype Electric_Charge is Mks_Type
with
Dimension => (Symbol => 'C',
Second => 1,
Ampere => 1,
others => 0);
subtype Electric_Conductance is Mks_Type
with
Dimension => (Symbol => 'S',
Meter => -2,
Kilogram => -1,
Second => 3,
Ampere => 2,
others => 0);
subtype Electric_Potential_Difference is Mks_Type
with
Dimension => (Symbol => 'V',
Meter => 2,
Kilogram => 1,
Second => -3,
Ampere => -1,
others => 0);
-- Note the type punning below. The Symbol is a single "ohm" character
-- encoded in UTF-8 (ce a9 in hexadecimal), but this file is not compiled
-- with -gnatW8, so we're treating the string literal as a two-character
-- String.
subtype Electric_Resistance is Mks_Type
with
Dimension => (Symbol => "Ω",
Meter => 2,
Kilogram => 1,
Second => -3,
Ampere => -2,
others => 0);
subtype Energy is Mks_Type
with
Dimension => (Symbol => 'J',
Meter => 2,
Kilogram => 1,
Second => -2,
others => 0);
subtype Equivalent_Dose is Mks_Type
with
Dimension => (Symbol => "Sv",
Meter => 2,
Second => -2,
others => 0);
subtype Force is Mks_Type
with
Dimension => (Symbol => 'N',
Meter => 1,
Kilogram => 1,
Second => -2,
others => 0);
subtype Frequency is Mks_Type
with
Dimension => (Symbol => "Hz",
Second => -1,
others => 0);
subtype Illuminance is Mks_Type
with
Dimension => (Symbol => "lx",
Meter => -2,
Candela => 1,
others => 0);
subtype Inductance is Mks_Type
with
Dimension => (Symbol => 'H',
Meter => 2,
Kilogram => 1,
Second => -2,
Ampere => -2,
others => 0);
subtype Luminous_Flux is Mks_Type
with
Dimension => (Symbol => "lm",
Candela => 1,
others => 0);
subtype Magnetic_Flux is Mks_Type
with
Dimension => (Symbol => "Wb",
Meter => 2,
Kilogram => 1,
Second => -2,
Ampere => -1,
others => 0);
subtype Magnetic_Flux_Density is Mks_Type
with
Dimension => (Symbol => 'T',
Kilogram => 1,
Second => -2,
Ampere => -1,
others => 0);
subtype Power is Mks_Type
with
Dimension => (Symbol => 'W',
Meter => 2,
Kilogram => 1,
Second => -3,
others => 0);
subtype Pressure is Mks_Type
with
Dimension => (Symbol => "Pa",
Meter => -1,
Kilogram => 1,
Second => -2,
others => 0);
subtype Radioactivity is Mks_Type
with
Dimension => (Symbol => "Bq",
Second => -1,
others => 0);
subtype Solid_Angle is Mks_Type
with
Dimension => (Symbol => "sr",
others => 0);
subtype Speed is Mks_Type
with
Dimension => (
Meter => 1,
Second => -1,
others => 0);
subtype Volume is Mks_Type
with
Dimension => (
Meter => 3,
others => 0);
-- Initialize derived dimension values
-- Turn off the all the dimension warnings for these basic assignments
-- since otherwise we would get complaints about assigning dimensionless
-- values to dimensioned subtypes.
pragma Warnings (Off, "*assumed to be*");
rad : constant Angle := 1.0;
sr : constant Solid_Angle := 1.0;
Hz : constant Frequency := 1.0;
N : constant Force := 1.0;
Pa : constant Pressure := 1.0;
J : constant Energy := 1.0;
W : constant Power := 1.0;
C : constant Electric_Charge := 1.0;
V : constant Electric_Potential_Difference := 1.0;
F : constant Electric_Capacitance := 1.0;
Ohm : constant Electric_Resistance := 1.0;
Si : constant Electric_Conductance := 1.0;
Wb : constant Magnetic_Flux := 1.0;
T : constant Magnetic_Flux_Density := 1.0;
H : constant Inductance := 1.0;
dC : constant Celsius_Temperature := 273.15;
lm : constant Luminous_Flux := 1.0;
lx : constant Illuminance := 1.0;
Bq : constant Radioactivity := 1.0;
Gy : constant Absorbed_Dose := 1.0;
Sv : constant Equivalent_Dose := 1.0;
kat : constant Catalytic_Activity := 1.0;
-- SI prefixes for Meter
um : constant Length := 1.0E-06; -- micro (u)
mm : constant Length := 1.0E-03; -- milli
cm : constant Length := 1.0E-02; -- centi
dm : constant Length := 1.0E-01; -- deci
dam : constant Length := 1.0E+01; -- deka
hm : constant Length := 1.0E+02; -- hecto
km : constant Length := 1.0E+03; -- kilo
Mem : constant Length := 1.0E+06; -- mega
-- SI prefixes for Kilogram
ug : constant Mass := 1.0E-09; -- micro (u)
mg : constant Mass := 1.0E-06; -- milli
cg : constant Mass := 1.0E-05; -- centi
dg : constant Mass := 1.0E-04; -- deci
g : constant Mass := 1.0E-03; -- gram
dag : constant Mass := 1.0E-02; -- deka
hg : constant Mass := 1.0E-01; -- hecto
Meg : constant Mass := 1.0E+03; -- mega
-- SI prefixes for Second
us : constant Time := 1.0E-06; -- micro (u)
ms : constant Time := 1.0E-03; -- milli
cs : constant Time := 1.0E-02; -- centi
ds : constant Time := 1.0E-01; -- deci
das : constant Time := 1.0E+01; -- deka
hs : constant Time := 1.0E+02; -- hecto
ks : constant Time := 1.0E+03; -- kilo
Mes : constant Time := 1.0E+06; -- mega
-- Other constants for Second
min : constant Time := 60.0 * s;
hour : constant Time := 60.0 * min;
day : constant Time := 24.0 * hour;
year : constant Time := 365.25 * day;
-- SI prefixes for Ampere
mA : constant Electric_Current := 1.0E-03; -- milli
cA : constant Electric_Current := 1.0E-02; -- centi
dA : constant Electric_Current := 1.0E-01; -- deci
daA : constant Electric_Current := 1.0E+01; -- deka
hA : constant Electric_Current := 1.0E+02; -- hecto
kA : constant Electric_Current := 1.0E+03; -- kilo
MeA : constant Electric_Current := 1.0E+06; -- mega
pragma Warnings (On, "*assumed to be*");
end System.Dim.Generic_Mks;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with
lace.Event,
lace.Observer,
lace.Subject,
lace.Response;
package lace.Event.Logger
--
-- Provides an event logging interface.
--
is
type Item is limited interface;
type View is access all Item'Class;
--------
-- Forge
--
procedure destruct (Self : in out Item) is null;
-------------
-- Operations
--
-- Logging of event configuration.
--
procedure log_Connection (Self : in out Item; From : in Observer.view;
To : in Subject .view;
for_Kind : in Event.Kind) is abstract;
procedure log_Disconnection (Self : in out Item; From : in Observer.view;
To : in Subject .view;
for_Kind : in Event.Kind) is abstract;
procedure log_new_Response (Self : in out Item; the_Response : in Response.view;
of_Observer : in Observer.item'Class;
to_Kind : in Event.Kind;
from_Subject : in subject_Name) is abstract;
procedure log_rid_Response (Self : in out Item; the_Response : in Response.view;
of_Observer : in Observer.item'Class;
to_Kind : in Event.Kind;
from_Subject : in subject_Name) is abstract;
-- Logging of event transmission.
--
procedure log_Emit (Self : in out Item; From : in Subject .view;
To : in Observer.view;
the_Event : in Event.item'Class) is abstract;
procedure log_Relay (Self : in out Item; From : in Observer.view;
To : in Observer.view;
the_Event : in Event.item'Class) is abstract;
procedure log_Response (Self : in out Item; the_Response : in Response.view;
of_Observer : in Observer.view;
to_Event : in Event.item'Class;
from_Subject : in subject_Name) is abstract;
-- Logging of miscellaneous messages.
--
procedure log (Self : in out Item; Message : in String) is abstract;
-- Log filtering.
--
procedure ignore (Self : in out Item; Kind : in Event.Kind) is abstract;
end lace.Event.Logger;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
package body types
with spark_mode => on
is
function to_bit
(u : unsigned_8) return types.bit
is
pragma warnings (off);
function conv is new ada.unchecked_conversion
(unsigned_8, bit);
pragma warnings (on);
begin
if u > 1 then
raise program_error;
end if;
return conv (u);
end to_bit;
function to_bit
(u : unsigned_32) return types.bit
is
pragma warnings (off);
function conv is new ada.unchecked_conversion
(unsigned_32, bit);
pragma warnings (on);
begin
if u > 1 then
raise program_error;
end if;
return conv (u);
end to_bit;
end types;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with impact.d2.Shape.circle,
impact.d2.Shape.polygon,
impact.d2.Collision,
impact.d2.Math;
package impact.d2.Colliders
--
--
--
is
use impact.d2.Shape.circle,
impact.d2.Shape.polygon,
impact.d2.Math;
-- Compute the collision manifold between two circles.
--
procedure b2CollideCircles (manifold : access collision.b2Manifold; circleA : access constant b2CircleShape'Class; xfA : in b2Transform;
circleB : access constant b2CircleShape'Class; xfB : in b2Transform);
-- Compute the collision manifold between a polygon and a circle.
--
procedure b2CollidePolygonAndCircle (manifold : access collision.b2Manifold; polygon : access constant b2PolygonShape'Class; xfA : in b2Transform;
circle : access constant b2CircleShape'Class; xfB : in b2Transform);
-- Compute the collision manifold between two polygons.
--
procedure b2CollidePolygons (manifold : access collision.b2Manifold; polygonA : access constant b2PolygonShape'Class; xfA : in b2Transform;
polygonB : access constant b2PolygonShape'Class; xfB : in b2Transform);
-- void b2CollidePolygons(b2Manifold* manifold,
-- const b2PolygonShape* polygon1, const b2Transform& xf1,
-- const b2PolygonShape* polygon2, const b2Transform& xf2);
-- Determine if two generic shapes overlap.
--
function b2TestOverlap (shapeA, shapeB : in impact.d2.Shape.view;
xfA, xfB : in b2Transform ) return Boolean;
end impact.d2.Colliders;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
TYPE NF IS DELTA 0.1 RANGE 1.0 .. 2.0;
TYPE ARR_F IS ARRAY(1..2) OF FX;
TYPE ACC_F IS ACCESS FX;
TYPE REC_F IS RECORD F : FX; END RECORD;
TYPE D_REC_F(I : INTEGER := 1) IS
RECORD F : FX; END RECORD;
PRIVATE
TYPE FC IS NEW F0;
TYPE F1 IS DELTA 100.0 RANGE -100.0 .. 900.0;
TYPE F2 IS NEW FX RANGE 0.0 .. 0.5;
TYPE F3 IS NEW NF;
TYPE F4 IS ARRAY(1..2) OF FX;
TYPE F5 IS NEW ARR_F;
TYPE F6 IS ACCESS FX;
TYPE F7 IS NEW ACC_F;
TYPE F8 IS RECORD F : FX; END RECORD;
TYPE F9 IS NEW REC_F;
TYPE FA IS ACCESS D_REC_F;
TYPE FB IS ACCESS D_REC_F;
END P1;
BEGIN
NULL;
END;
RESULT;
END A74106C;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Debug; use Debug;
with Get_Targ; use Get_Targ;
with Opt; use Opt;
with Output; use Output;
with System; use System;
with System.OS_Lib; use System.OS_Lib;
with Unchecked_Conversion;
package body Set_Targ is
--------------------------------------------------------
-- Data Used to Read/Write Target Dependent Info File --
--------------------------------------------------------
-- Table of string names written to file
subtype Str is String;
S_Bits_BE : constant Str := "Bits_BE";
S_Bits_Per_Unit : constant Str := "Bits_Per_Unit";
S_Bits_Per_Word : constant Str := "Bits_Per_Word";
S_Bytes_BE : constant Str := "Bytes_BE";
S_Char_Size : constant Str := "Char_Size";
S_Double_Float_Alignment : constant Str := "Double_Float_Alignment";
S_Double_Scalar_Alignment : constant Str := "Double_Scalar_Alignment";
S_Double_Size : constant Str := "Double_Size";
S_Float_Size : constant Str := "Float_Size";
S_Float_Words_BE : constant Str := "Float_Words_BE";
S_Int_Size : constant Str := "Int_Size";
S_Long_Double_Size : constant Str := "Long_Double_Size";
S_Long_Long_Size : constant Str := "Long_Long_Size";
S_Long_Size : constant Str := "Long_Size";
S_Maximum_Alignment : constant Str := "Maximum_Alignment";
S_Max_Unaligned_Field : constant Str := "Max_Unaligned_Field";
S_Pointer_Size : constant Str := "Pointer_Size";
S_Short_Enums : constant Str := "Short_Enums";
S_Short_Size : constant Str := "Short_Size";
S_Strict_Alignment : constant Str := "Strict_Alignment";
S_System_Allocator_Alignment : constant Str := "System_Allocator_Alignment";
S_Wchar_T_Size : constant Str := "Wchar_T_Size";
S_Words_BE : constant Str := "Words_BE";
-- Table of names
type AStr is access all String;
DTN : constant array (Nat range <>) of AStr := (
S_Bits_BE 'Unrestricted_Access,
S_Bits_Per_Unit 'Unrestricted_Access,
S_Bits_Per_Word 'Unrestricted_Access,
S_Bytes_BE 'Unrestricted_Access,
S_Char_Size 'Unrestricted_Access,
S_Double_Float_Alignment 'Unrestricted_Access,
S_Double_Scalar_Alignment 'Unrestricted_Access,
S_Double_Size 'Unrestricted_Access,
S_Float_Size 'Unrestricted_Access,
S_Float_Words_BE 'Unrestricted_Access,
S_Int_Size 'Unrestricted_Access,
S_Long_Double_Size 'Unrestricted_Access,
S_Long_Long_Size 'Unrestricted_Access,
S_Long_Size 'Unrestricted_Access,
S_Maximum_Alignment 'Unrestricted_Access,
S_Max_Unaligned_Field 'Unrestricted_Access,
S_Pointer_Size 'Unrestricted_Access,
S_Short_Enums 'Unrestricted_Access,
S_Short_Size 'Unrestricted_Access,
S_Strict_Alignment 'Unrestricted_Access,
S_System_Allocator_Alignment 'Unrestricted_Access,
S_Wchar_T_Size 'Unrestricted_Access,
S_Words_BE 'Unrestricted_Access);
-- Table of corresponding value pointers
DTV : constant array (Nat range <>) of System.Address := (
Bits_BE 'Address,
Bits_Per_Unit 'Address,
Bits_Per_Word 'Address,
Bytes_BE 'Address,
Char_Size 'Address,
Double_Float_Alignment 'Address,
Double_Scalar_Alignment 'Address,
Double_Size 'Address,
Float_Size 'Address,
Float_Words_BE 'Address,
Int_Size 'Address,
Long_Double_Size 'Address,
Long_Long_Size 'Address,
Long_Size 'Address,
Maximum_Alignment 'Address,
Max_Unaligned_Field 'Address,
Pointer_Size 'Address,
Short_Enums 'Address,
Short_Size 'Address,
Strict_Alignment 'Address,
System_Allocator_Alignment 'Address,
Wchar_T_Size 'Address,
Words_BE 'Address);
DTR : array (Nat range DTV'Range) of Boolean := (others => False);
-- Table of flags used to validate that all values are present in file
-----------------------
-- Local Subprograms --
-----------------------
procedure Read_Target_Dependent_Values (File_Name : String);
-- Read target dependent values from File_Name, and set the target
-- dependent values (global variables) declared in this package.
procedure Fail (E : String);
pragma No_Return (Fail);
-- Terminate program with fatal error message passed as parameter
procedure Register_Float_Type
(Name : C_String;
Digs : Natural;
Complex : Boolean;
Count : Natural;
Float_Rep : Float_Rep_Kind;
Precision : Positive;
Size : Positive;
Alignment : Natural);
pragma Convention (C, Register_Float_Type);
-- Call back to allow the back end to register available types. This call
-- back makes entries in the FPT_Mode_Table for any floating point types
-- reported by the back end. Name is the name of the type as a normal
-- format Null-terminated string. Digs is the number of digits, where 0
-- means it is not a fpt type (ignored during registration). Complex is
-- non-zero if the type has real and imaginary parts (also ignored during
-- registration). Count is the number of elements in a vector type (zero =
-- not a vector, registration ignores vectors). Float_Rep shows the kind of
-- floating-point type, and Precision, Size and Alignment are the precision
-- size and alignment in bits.
--
-- The only types that are actually registered have Digs non-zero, Complex
-- zero (false), and Count zero (not a vector). The Long_Double_Index
-- variable below is updated to indicate the index at which a "long double"
-- type can be found if it gets registered at all.
Long_Double_Index : Integer := -1;
-- Once all the floating point types have been registered, the index in
-- FPT_Mode_Table at which "long double" can be found, if anywhere. A
-- negative value means that no "long double" has been registered. This
-- is useful to know whether we have a "long double" available at all and
-- get at it's characteristics without having to search the FPT_Mode_Table
-- when we need to decide which C type should be used as the basis for
-- Long_Long_Float in Ada.
function FPT_Mode_Index_For (Name : String) return Natural;
-- Return the index in FPT_Mode_Table that designates the entry
-- corresponding to the C type named Name. Raise Program_Error if
-- there is no such entry.
function FPT_Mode_Index_For (T : S_Float_Types) return Natural;
-- Return the index in FPT_Mode_Table that designates the entry for
-- a back-end type suitable as a basis to construct the standard Ada
-- floating point type identified by T.
----------------
-- C_Type_For --
----------------
function C_Type_For (T : S_Float_Types) return String is
-- ??? For now, we don't have a good way to tell the widest float
-- type with hardware support. Basically, GCC knows the size of that
-- type, but on x86-64 there often are two or three 128-bit types,
-- one double extended that has 18 decimal digits, a 128-bit quad
-- precision type with 33 digits and possibly a 128-bit decimal float
-- type with 34 digits. As a workaround, we define Long_Long_Float as
-- C's "long double" if that type exists and has at most 18 digits,
-- or otherwise the same as Long_Float.
Max_HW_Digs : constant := 18;
-- Maximum hardware digits supported
begin
case T is
when S_Float
| S_Short_Float
=>
return "float";
when S_Long_Float =>
return "double";
when S_Long_Long_Float =>
if Long_Double_Index >= 0
and then FPT_Mode_Table (Long_Double_Index).DIGS <= Max_HW_Digs
then
return "long double";
else
return "double";
end if;
end case;
end C_Type_For;
----------
-- Fail --
----------
procedure Fail (E : String) is
E_Fatal : constant := 4;
-- Code for fatal error
begin
Write_Str (E);
Write_Eol;
OS_Exit (E_Fatal);
end Fail;
------------------------
-- FPT_Mode_Index_For --
------------------------
function FPT_Mode_Index_For (Name : String) return Natural is
begin
for J in FPT_Mode_Table'First .. Num_FPT_Modes loop
if FPT_Mode_Table (J).NAME.all = Name then
return J;
end if;
end loop;
raise Program_Error;
end FPT_Mode_Index_For;
function FPT_Mode_Index_For (T : S_Float_Types) return Natural is
begin
return FPT_Mode_Index_For (C_Type_For (T));
end FPT_Mode_Index_For;
-------------------------
-- Register_Float_Type --
-------------------------
procedure Register_Float_Type
(Name : C_String;
Digs : Natural;
Complex : Boolean;
Count : Natural;
Float_Rep : Float_Rep_Kind;
Precision : Positive;
Size : Positive;
Alignment : Natural)
is
T : String (1 .. Name'Length);
Last : Natural := 0;
procedure Dump;
-- Dump information given by the back end for the type to register
----------
-- Dump --
----------
procedure Dump is
begin
Write_Str ("type " & T (1 .. Last) & " is ");
if Count > 0 then
Write_Str ("array (1 .. ");
Write_Int (Int (Count));
if Complex then
Write_Str (", 1 .. 2");
end if;
Write_Str (") of ");
elsif Complex then
Write_Str ("array (1 .. 2) of ");
end if;
if Digs > 0 then
Write_Str ("digits ");
Write_Int (Int (Digs));
Write_Line (";");
Write_Str ("pragma Float_Representation (");
case Float_Rep is
when AAMP => Write_Str ("AAMP");
when IEEE_Binary => Write_Str ("IEEE");
end case;
Write_Line (", " & T (1 .. Last) & ");");
else
Write_Str ("mod 2**");
Write_Int (Int (Precision / Positive'Max (1, Count)));
Write_Line (";");
end if;
if Precision = Size then
Write_Str ("for " & T (1 .. Last) & "'Size use ");
Write_Int (Int (Size));
Write_Line (";");
else
Write_Str ("for " & T (1 .. Last) & "'Value_Size use ");
Write_Int (Int (Precision));
Write_Line (";");
Write_Str ("for " & T (1 .. Last) & "'Object_Size use ");
Write_Int (Int (Size));
Write_Line (";");
end if;
Write_Str ("for " & T (1 .. Last) & "'Alignment use ");
Write_Int (Int (Alignment / 8));
Write_Line (";");
Write_Eol;
end Dump;
-- Start of processing for Register_Float_Type
begin
-- Acquire name
for J in T'Range loop
T (J) := Name (Name'First + J - 1);
if T (J) = ASCII.NUL then
Last := J - 1;
exit;
end if;
end loop;
-- Dump info if debug flag set
if Debug_Flag_Dot_B then
Dump;
end if;
-- Acquire entry if non-vector non-complex fpt type (digits non-zero)
if Digs > 0 and then not Complex and then Count = 0 then
declare
This_Name : constant String := T (1 .. Last);
begin
Num_FPT_Modes := Num_FPT_Modes + 1;
FPT_Mode_Table (Num_FPT_Modes) :=
(NAME => new String'(This_Name),
DIGS => Digs,
FLOAT_REP => Float_Rep,
PRECISION => Precision,
SIZE => Size,
ALIGNMENT => Alignment);
if Long_Double_Index < 0 and then This_Name = "long double" then
Long_Double_Index := Num_FPT_Modes;
end if;
end;
end if;
end Register_Float_Type;
-----------------------------------
-- Write_Target_Dependent_Values --
-----------------------------------
-- We do this at the System.Os_Lib level, since we have to do the read at
-- that level anyway, so it is easier and more consistent to follow the
-- same path for the write.
procedure Write_Target_Dependent_Values is
Fdesc : File_Descriptor;
OK : Boolean;
Buffer : String (1 .. 80);
Buflen : Natural;
-- Buffer used to build line one of file
type ANat is access all Natural;
-- Pointer to Nat or Pos value (it is harmless to treat Pos values and
-- Nat values as Natural via Unchecked_Conversion).
function To_ANat is new Unchecked_Conversion (Address, ANat);
procedure AddC (C : Character);
-- Add one character to buffer
procedure AddN (N : Natural);
-- Add representation of integer N to Buffer, updating Buflen. N
-- must be less than 1000, and output is 3 characters with leading
-- spaces as needed.
procedure Write_Line;
-- Output contents of Buffer (1 .. Buflen) followed by a New_Line,
-- and set Buflen back to zero, ready to write next line.
----------
-- AddC --
----------
procedure AddC (C : Character) is
begin
Buflen := Buflen + 1;
Buffer (Buflen) := C;
end AddC;
----------
-- AddN --
----------
procedure AddN (N : Natural) is
begin
if N > 999 then
raise Program_Error;
end if;
if N > 99 then
AddC (Character'Val (48 + N / 100));
else
AddC (' ');
end if;
if N > 9 then
AddC (Character'Val (48 + N / 10 mod 10));
else
AddC (' ');
end if;
AddC (Character'Val (48 + N mod 10));
end AddN;
----------------
-- Write_Line --
----------------
procedure Write_Line is
begin
AddC (ASCII.LF);
if Buflen /= Write (Fdesc, Buffer'Address, Buflen) then
Delete_File (Target_Dependent_Info_Write_Name.all, OK);
Fail ("disk full writing file "
& Target_Dependent_Info_Write_Name.all);
end if;
Buflen := 0;
end Write_Line;
-- Start of processing for Write_Target_Dependent_Values
begin
Fdesc :=
Create_File (Target_Dependent_Info_Write_Name.all, Text);
if Fdesc = Invalid_FD then
Fail ("cannot create file " & Target_Dependent_Info_Write_Name.all);
end if;
-- Loop through values
for J in DTN'Range loop
-- Output name
Buflen := DTN (J)'Length;
Buffer (1 .. Buflen) := DTN (J).all;
-- Line up values
while Buflen < 26 loop
AddC (' ');
end loop;
AddC (' ');
AddC (' ');
-- Output value and write line
AddN (To_ANat (DTV (J)).all);
Write_Line;
end loop;
-- Blank line to separate sections
Write_Line;
-- Write lines for registered FPT types
for J in 1 .. Num_FPT_Modes loop
declare
E : FPT_Mode_Entry renames FPT_Mode_Table (J);
begin
Buflen := E.NAME'Last;
Buffer (1 .. Buflen) := E.NAME.all;
-- Pad out to line up values
while Buflen < 11 loop
AddC (' ');
end loop;
AddC (' ');
AddC (' ');
AddN (E.DIGS);
AddC (' ');
AddC (' ');
case E.FLOAT_REP is
when AAMP => AddC ('A');
when IEEE_Binary => AddC ('I');
end case;
AddC (' ');
AddN (E.PRECISION);
AddC (' ');
AddN (E.ALIGNMENT);
Write_Line;
end;
end loop;
-- Close file
Close (Fdesc, OK);
if not OK then
Fail ("disk full writing file "
& Target_Dependent_Info_Write_Name.all);
end if;
end Write_Target_Dependent_Values;
----------------------------------
-- Read_Target_Dependent_Values --
----------------------------------
procedure Read_Target_Dependent_Values (File_Name : String) is
File_Desc : File_Descriptor;
N : Natural;
type ANat is access all Natural;
-- Pointer to Nat or Pos value (it is harmless to treat Pos values
-- as Nat via Unchecked_Conversion).
function To_ANat is new Unchecked_Conversion (Address, ANat);
VP : ANat;
Buffer : String (1 .. 2000);
Buflen : Natural;
-- File information and length (2000 easily enough)
Nam_Buf : String (1 .. 40);
Nam_Len : Natural;
procedure Check_Spaces;
-- Checks that we have one or more spaces and skips them
procedure FailN (S : String);
pragma No_Return (FailN);
-- Calls Fail adding " name in file xxx", where name is the currently
-- gathered name in Nam_Buf, surrounded by quotes, and xxx is the
-- name of the file.
procedure Get_Name;
-- Scan out name, leaving it in Nam_Buf with Nam_Len set. Calls
-- Skip_Spaces to skip any following spaces. Note that the name is
-- terminated by a sequence of at least two spaces.
function Get_Nat return Natural;
-- N on entry points to decimal integer, scan out decimal integer
-- and return it, leaving N pointing to following space or LF.
procedure Skip_Spaces;
-- Skip past spaces
------------------
-- Check_Spaces --
------------------
procedure Check_Spaces is
begin
if N > Buflen or else Buffer (N) /= ' ' then
FailN ("missing space for");
end if;
Skip_Spaces;
return;
end Check_Spaces;
-----------
-- FailN --
-----------
procedure FailN (S : String) is
begin
Fail (S & " """ & Nam_Buf (1 .. Nam_Len) & """ in file "
& File_Name);
end FailN;
--------------
-- Get_Name --
--------------
procedure Get_Name is
begin
Nam_Len := 0;
-- Scan out name and put it in Nam_Buf
loop
if N > Buflen or else Buffer (N) = ASCII.LF then
FailN ("incorrectly formatted line for");
end if;
-- Name is terminated by two blanks
exit when N < Buflen and then Buffer (N .. N + 1) = " ";
Nam_Len := Nam_Len + 1;
if Nam_Len > Nam_Buf'Last then
Fail ("name too long");
end if;
Nam_Buf (Nam_Len) := Buffer (N);
N := N + 1;
end loop;
Check_Spaces;
end Get_Name;
-------------
-- Get_Nat --
-------------
function Get_Nat return Natural is
Result : Natural := 0;
begin
loop
if N > Buflen
or else Buffer (N) not in '0' .. '9'
or else Result > 999
then
FailN ("bad value for");
end if;
Result := Result * 10 + (Character'Pos (Buffer (N)) - 48);
N := N + 1;
exit when N <= Buflen
and then (Buffer (N) = ASCII.LF or else Buffer (N) = ' ');
end loop;
return Result;
end Get_Nat;
-----------------
-- Skip_Spaces --
-----------------
procedure Skip_Spaces is
begin
while N <= Buflen and Buffer (N) = ' ' loop
N := N + 1;
end loop;
end Skip_Spaces;
-- Start of processing for Read_Target_Dependent_Values
begin
File_Desc := Open_Read (File_Name, Text);
if File_Desc = Invalid_FD then
Fail ("cannot read file " & File_Name);
end if;
Buflen := Read (File_Desc, Buffer'Address, Buffer'Length);
Close (File_Desc);
if Buflen = Buffer'Length then
Fail ("file is too long: " & File_Name);
end if;
-- Scan through file for properly formatted entries in first section
N := 1;
while N <= Buflen and then Buffer (N) /= ASCII.LF loop
Get_Name;
-- Validate name and get corresponding value pointer
VP := null;
for J in DTN'Range loop
if DTN (J).all = Nam_Buf (1 .. Nam_Len) then
VP := To_ANat (DTV (J));
DTR (J) := True;
exit;
end if;
end loop;
if VP = null then
FailN ("unrecognized name");
end if;
-- Scan out value
VP.all := Get_Nat;
if N > Buflen or else Buffer (N) /= ASCII.LF then
FailN ("misformatted line for");
end if;
N := N + 1; -- skip LF
end loop;
-- Fall through this loop when all lines in first section read.
-- Check that values have been supplied for all entries.
for J in DTR'Range loop
if not DTR (J) then
Fail ("missing entry for " & DTN (J).all & " in file "
& File_Name);
end if;
end loop;
-- Now acquire FPT entries
if N >= Buflen then
Fail ("missing entries for FPT modes in file " & File_Name);
end if;
if Buffer (N) = ASCII.LF then
N := N + 1;
else
Fail ("missing blank line in file " & File_Name);
end if;
Num_FPT_Modes := 0;
while N <= Buflen loop
Get_Name;
Num_FPT_Modes := Num_FPT_Modes + 1;
declare
E : FPT_Mode_Entry renames FPT_Mode_Table (Num_FPT_Modes);
begin
E.NAME := new String'(Nam_Buf (1 .. Nam_Len));
if Long_Double_Index < 0 and then E.NAME.all = "long double" then
Long_Double_Index := Num_FPT_Modes;
end if;
E.DIGS := Get_Nat;
Check_Spaces;
case Buffer (N) is
when 'I' =>
E.FLOAT_REP := IEEE_Binary;
when 'A' =>
E.FLOAT_REP := AAMP;
when others =>
FailN ("bad float rep field for");
end case;
N := N + 1;
Check_Spaces;
E.PRECISION := Get_Nat;
Check_Spaces;
E.ALIGNMENT := Get_Nat;
if Buffer (N) /= ASCII.LF then
FailN ("junk at end of line for");
end if;
-- ??? We do not read E.SIZE, see Write_Target_Dependent_Values
E.SIZE :=
(E.PRECISION + E.ALIGNMENT - 1) / E.ALIGNMENT * E.ALIGNMENT;
N := N + 1;
end;
end loop;
end Read_Target_Dependent_Values;
-- Package Initialization, set target dependent values. This must be done
-- early on, before we start accessing various compiler packages, since
-- these values are used all over the place.
begin
-- First step: see if the -gnateT switch is present. As we have noted,
-- this has to be done very early, so cannot depend on the normal circuit
-- for reading switches and setting switches in Opt. The following code
-- will set Opt.Target_Dependent_Info_Read_Name if the switch -gnateT=name
-- is present in the options string.
declare
type Arg_Array is array (Nat) of Big_String_Ptr;
type Arg_Array_Ptr is access Arg_Array;
-- Types to access compiler arguments
save_argc : Nat;
pragma Import (C, save_argc);
-- Saved value of argc (number of arguments), imported from misc.c
save_argv : Arg_Array_Ptr;
pragma Import (C, save_argv);
-- Saved value of argv (argument pointers), imported from misc.c
gnat_argc : Nat;
gnat_argv : Arg_Array_Ptr;
pragma Import (C, gnat_argc);
pragma Import (C, gnat_argv);
-- If save_argv is not set, default to gnat_argc/argv
argc : Nat;
argv : Arg_Array_Ptr;
function Len_Arg (Arg : Big_String_Ptr) return Nat;
-- Determine length of argument Arg (a nul terminated C string).
-------------
-- Len_Arg --
-------------
function Len_Arg (Arg : Big_String_Ptr) return Nat is
begin
for J in 1 .. Nat'Last loop
if Arg (Natural (J)) = ASCII.NUL then
return J - 1;
end if;
end loop;
raise Program_Error;
end Len_Arg;
begin
if save_argv /= null then
argv := save_argv;
argc := save_argc;
else
-- Case of a non gcc compiler, e.g. gnat2why or gnat2scil
argv := gnat_argv;
argc := gnat_argc;
end if;
-- Loop through arguments looking for -gnateT, also look for -gnatd.b
for Arg in 1 .. argc - 1 loop
declare
Argv_Ptr : constant Big_String_Ptr := argv (Arg);
Argv_Len : constant Nat := Len_Arg (Argv_Ptr);
begin
if Argv_Len > 8
and then Argv_Ptr (1 .. 8) = "-gnateT="
then
Opt.Target_Dependent_Info_Read_Name :=
new String'(Argv_Ptr (9 .. Natural (Argv_Len)));
elsif Argv_Len >= 8
and then Argv_Ptr (1 .. 8) = "-gnatd.b"
then
Debug_Flag_Dot_B := True;
end if;
end;
end loop;
end;
-- Case of reading the target dependent values from file
-- This is bit more complex than might be expected, because it has to be
-- done very early. All kinds of packages depend on these values, and we
-- can't wait till the normal processing of reading command line switches
-- etc to read the file. We do this at the System.OS_Lib level since it is
-- too early to be using Osint directly.
if Opt.Target_Dependent_Info_Read_Name /= null then
Read_Target_Dependent_Values (Target_Dependent_Info_Read_Name.all);
else
-- If the back-end comes with a target config file, then use it
-- to set the values
declare
Back_End_Config_File : constant String_Ptr :=
Get_Back_End_Config_File;
begin
if Back_End_Config_File /= null then
pragma Gnat_Annotate
(CodePeer, Intentional, "test always false",
"some variant body will return non null");
Read_Target_Dependent_Values (Back_End_Config_File.all);
-- Otherwise we get all values from the back end directly
else
Bits_BE := Get_Bits_BE;
Bits_Per_Unit := Get_Bits_Per_Unit;
Bits_Per_Word := Get_Bits_Per_Word;
Bytes_BE := Get_Bytes_BE;
Char_Size := Get_Char_Size;
Double_Float_Alignment := Get_Double_Float_Alignment;
Double_Scalar_Alignment := Get_Double_Scalar_Alignment;
Float_Words_BE := Get_Float_Words_BE;
Int_Size := Get_Int_Size;
Long_Long_Size := Get_Long_Long_Size;
Long_Size := Get_Long_Size;
Maximum_Alignment := Get_Maximum_Alignment;
Max_Unaligned_Field := Get_Max_Unaligned_Field;
Pointer_Size := Get_Pointer_Size;
Short_Enums := Get_Short_Enums;
Short_Size := Get_Short_Size;
Strict_Alignment := Get_Strict_Alignment;
System_Allocator_Alignment := Get_System_Allocator_Alignment;
Wchar_T_Size := Get_Wchar_T_Size;
Words_BE := Get_Words_BE;
-- Let the back-end register its floating point types and compute
-- the sizes of our standard types from there:
Num_FPT_Modes := 0;
Register_Back_End_Types (Register_Float_Type'Access);
declare
T : FPT_Mode_Entry renames
FPT_Mode_Table (FPT_Mode_Index_For (S_Float));
begin
Float_Size := Pos (T.SIZE);
end;
declare
T : FPT_Mode_Entry renames
FPT_Mode_Table (FPT_Mode_Index_For (S_Long_Float));
begin
Double_Size := Pos (T.SIZE);
end;
declare
T : FPT_Mode_Entry renames
FPT_Mode_Table (FPT_Mode_Index_For (S_Long_Long_Float));
begin
Long_Double_Size := Pos (T.SIZE);
end;
end if;
end;
end if;
end Set_Targ;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- implementation unit specialized for Darwin (or Linux, or Windows)
package System.Long_Long_Complex_Types is
pragma Pure;
-- Complex
type Imaginary is new Float;
type Complex is record
Re, Im : Float;
end record;
pragma Complex_Representation (Complex);
-- Long_Complex
type Long_Imaginary is new Long_Float;
type Long_Complex is record
Re, Im : Long_Float;
end record;
pragma Complex_Representation (Long_Complex);
-- Long_Long_Complex
type Long_Long_Imaginary is new Long_Long_Float;
type Long_Long_Complex is record
Re, Im : Long_Long_Float;
end record;
pragma Complex_Representation (Long_Long_Complex);
end System.Long_Long_Complex_Types;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-----------------------------------------------------------------------
with Util.Beans.Objects;
with ASF.Contexts.Faces;
package body ASF.Helpers.Beans is
-- ------------------------------
-- Get a bean instance associated under the given name from the current faces context.
-- A null value is returned if the bean does not exist or is not of the good type.
-- ------------------------------
function Get_Bean (Name : in String) return Element_Access is
use type ASF.Contexts.Faces.Faces_Context_Access;
use type Util.Beans.Basic.Readonly_Bean_Access;
Context : constant ASF.Contexts.Faces.Faces_Context_Access := ASF.Contexts.Faces.Current;
begin
if Context = null then
return null;
end if;
declare
Bean : constant Util.Beans.Basic.Readonly_Bean_Access := Context.Get_Bean (Name);
begin
if Bean = null or else not (Bean.all in Element_Type'Class) then
return null;
else
return Element_Type'Class (Bean.all)'Access;
end if;
end;
end Get_Bean;
-- ------------------------------
-- Get a bean instance associated under the given name from the request.
-- A null value is returned if the bean does not exist or is not of the good type.
-- ------------------------------
function Get_Request_Bean (Request : in ASF.Requests.Request'Class;
Name : in String) return Element_Access is
Value : constant Util.Beans.Objects.Object := Request.Get_Attribute (Name);
Bean : constant access Util.Beans.Basic.Readonly_Bean'Class
:= Util.Beans.Objects.To_Bean (Value);
begin
if Bean = null or else not (Bean.all in Element_Type'Class) then
return null;
else
return Element_Type'Class (Bean.all)'Access;
end if;
end Get_Request_Bean;
end ASF.Helpers.Beans;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This is the Windows NT/95 version
-- Why do we need separate version ???
-- Do we need *this* much code duplication???
with System.OS_Primitives;
-- used for Clock
with System.OS_Interface;
package body Ada.Calendar is
use System.OS_Interface;
------------------------------
-- Use of Pragma Unsuppress --
------------------------------
-- This implementation of Calendar takes advantage of the permission in
-- Ada 95 of using arithmetic overflow checks to check for out of bounds
-- time values. This means that we must catch the constraint error that
-- results from arithmetic overflow, so we use pragma Unsuppress to make
-- sure that overflow is enabled, using software overflow checking if
-- necessary. That way, compiling Calendar with options to suppress this
-- checking will not affect its correctness.
------------------------
-- Local Declarations --
------------------------
Ada_Year_Min : constant := 1901;
Ada_Year_Max : constant := 2099;
-- Win32 time constants
epoch_1970 : constant := 16#19D_B1DE_D53E_8000#; -- win32 UTC epoch
system_time_ns : constant := 100; -- 100 ns per tick
Sec_Unit : constant := 10#1#E9;
---------
-- "+" --
---------
function "+" (Left : Time; Right : Duration) return Time is
pragma Unsuppress (Overflow_Check);
begin
return (Left + Time (Right));
exception
when Constraint_Error =>
raise Time_Error;
end "+";
function "+" (Left : Duration; Right : Time) return Time is
pragma Unsuppress (Overflow_Check);
begin
return (Time (Left) + Right);
exception
when Constraint_Error =>
raise Time_Error;
end "+";
---------
-- "-" --
---------
function "-" (Left : Time; Right : Duration) return Time is
pragma Unsuppress (Overflow_Check);
begin
return Left - Time (Right);
exception
when Constraint_Error =>
raise Time_Error;
end "-";
function "-" (Left : Time; Right : Time) return Duration is
pragma Unsuppress (Overflow_Check);
begin
return Duration (Left) - Duration (Right);
exception
when Constraint_Error =>
raise Time_Error;
end "-";
---------
-- "<" --
---------
function "<" (Left, Right : Time) return Boolean is
begin
return Duration (Left) < Duration (Right);
end "<";
----------
-- "<=" --
----------
function "<=" (Left, Right : Time) return Boolean is
begin
return Duration (Left) <= Duration (Right);
end "<=";
---------
-- ">" --
---------
function ">" (Left, Right : Time) return Boolean is
begin
return Duration (Left) > Duration (Right);
end ">";
----------
-- ">=" --
----------
function ">=" (Left, Right : Time) return Boolean is
begin
return Duration (Left) >= Duration (Right);
end ">=";
-----------
-- Clock --
-----------
-- The Ada.Calendar.Clock function gets the time from the soft links
-- interface which will call the appropriate function depending wether
-- tasking is involved or not.
function Clock return Time is
begin
return Time (System.OS_Primitives.Clock);
end Clock;
---------
-- Day --
---------
function Day (Date : Time) return Day_Number is
DY : Year_Number;
DM : Month_Number;
DD : Day_Number;
DS : Day_Duration;
begin
Split (Date, DY, DM, DD, DS);
return DD;
end Day;
-----------
-- Month --
-----------
function Month (Date : Time) return Month_Number is
DY : Year_Number;
DM : Month_Number;
DD : Day_Number;
DS : Day_Duration;
begin
Split (Date, DY, DM, DD, DS);
return DM;
end Month;
-------------
-- Seconds --
-------------
function Seconds (Date : Time) return Day_Duration is
DY : Year_Number;
DM : Month_Number;
DD : Day_Number;
DS : Day_Duration;
begin
Split (Date, DY, DM, DD, DS);
return DS;
end Seconds;
-----------
-- Split --
-----------
procedure Split
(Date : Time;
Year : out Year_Number;
Month : out Month_Number;
Day : out Day_Number;
Seconds : out Day_Duration)
is
Date_Int : aliased Long_Long_Integer;
Date_Loc : aliased Long_Long_Integer;
Timbuf : aliased SYSTEMTIME;
Int_Date : Long_Long_Integer;
Sub_Seconds : Duration;
begin
-- We take the sub-seconds (decimal part) of Date and this is added
-- to compute the Seconds. This way we keep the precision of the
-- high-precision clock that was lost with the Win32 API calls
-- below.
if Date < 0.0 then
-- this is a Date before Epoch (January 1st, 1970)
Sub_Seconds := Duration (Date) -
Duration (Long_Long_Integer (Date + Duration'(0.5)));
Int_Date := Long_Long_Integer (Date - Sub_Seconds);
-- For Date = -86400.1 we are 2 days before Epoch at 0.1 seconds
-- from day 1 before Epoch. It means that it is 23h 59m 59.9s.
-- here we adjust for that.
if Sub_Seconds < 0.0 then
Int_Date := Int_Date - 1;
Sub_Seconds := 1.0 + Sub_Seconds;
end if;
else
-- this is a Date after Epoch (January 1st, 1970)
Sub_Seconds := Duration (Date) -
Duration (Long_Long_Integer (Date - Duration'(0.5)));
Int_Date := Long_Long_Integer (Date - Sub_Seconds);
end if;
-- Date_Int is the number of seconds from Epoch
Date_Int := Long_Long_Integer
(Int_Date * Sec_Unit / system_time_ns) + epoch_1970;
if not FileTimeToLocalFileTime (Date_Int'Access, Date_Loc'Access) then
raise Time_Error;
end if;
if not FileTimeToSystemTime (Date_Loc'Access, Timbuf'Access) then
raise Time_Error;
end if;
if Timbuf.wYear not in Ada_Year_Min .. Ada_Year_Max then
raise Time_Error;
end if;
Seconds :=
Duration (Timbuf.wHour) * 3_600.0 +
Duration (Timbuf.wMinute) * 60.0 +
Duration (Timbuf.wSecond) +
Sub_Seconds;
Day := Integer (Timbuf.wDay);
Month := Integer (Timbuf.wMonth);
Year := Integer (Timbuf.wYear);
end Split;
-------------
-- Time_Of --
-------------
function Time_Of
(Year : Year_Number;
Month : Month_Number;
Day : Day_Number;
Seconds : Day_Duration := 0.0)
return Time
is
Timbuf : aliased SYSTEMTIME;
Now : aliased Long_Long_Integer;
Loc : aliased Long_Long_Integer;
Int_Secs : Integer;
Secs : Integer;
Add_One_Day : Boolean := False;
Date : Time;
begin
-- The following checks are redundant with respect to the constraint
-- error checks that should normally be made on parameters, but we
-- decide to raise Constraint_Error in any case if bad values come
-- in (as a result of checks being off in the caller, or for other
-- erroneous or bounded error cases).
if not Year 'Valid
or else not Month 'Valid
or else not Day 'Valid
or else not Seconds'Valid
then
raise Constraint_Error;
end if;
if Seconds = 0.0 then
Int_Secs := 0;
else
Int_Secs := Integer (Seconds - 0.5);
end if;
-- Timbuf.wMillisec is to keep the msec. We can't use that because the
-- high-resolution clock has a precision of 1 Microsecond.
-- Anyway the sub-seconds part is not needed to compute the number
-- of seconds in UTC.
if Int_Secs = 86_400 then
Secs := 0;
Add_One_Day := True;
else
Secs := Int_Secs;
end if;
Timbuf.wMilliseconds := 0;
Timbuf.wSecond := WORD (Secs mod 60);
Timbuf.wMinute := WORD ((Secs / 60) mod 60);
Timbuf.wHour := WORD (Secs / 3600);
Timbuf.wDay := WORD (Day);
Timbuf.wMonth := WORD (Month);
Timbuf.wYear := WORD (Year);
if not SystemTimeToFileTime (Timbuf'Access, Loc'Access) then
raise Time_Error;
end if;
if not LocalFileTimeToFileTime (Loc'Access, Now'Access) then
raise Time_Error;
end if;
-- Here we have the UTC now translate UTC to Epoch time (UNIX style
-- time based on 1 january 1970) and add there the sub-seconds part.
declare
Sub_Sec : constant Duration := Seconds - Duration (Int_Secs);
begin
Date := Time ((Now - epoch_1970) * system_time_ns / Sec_Unit) +
Sub_Sec;
end;
if Add_One_Day then
Date := Date + Duration (86400.0);
end if;
return Date;
end Time_Of;
----------
-- Year --
----------
function Year (Date : Time) return Year_Number is
DY : Year_Number;
DM : Month_Number;
DD : Day_Number;
DS : Day_Duration;
begin
Split (Date, DY, DM, DD, DS);
return DY;
end Year;
begin
System.OS_Primitives.Initialize;
end Ada.Calendar;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with Giza.Context;
with Giza.Events; use Giza.Events;
with Giza.Widget.Text;
with Giza.Widget.Button;
use Giza.Widget;
with Screen_Interface; use Screen_Interface;
with Test_Main_Window;
package Timer_Callback is
Main_W : aliased Test_Main_Window.Main_Window;
My_Str : access String := new String'("Gtext");
Str_Button : access String := new String'("Button");
Str_Toggle : access String := new String'("Toggle");
My_Txt : aliased Text.Instance;
My_Button : aliased Button.Instance;
My_Toggle : aliased Button.Instance;
My_Backend : aliased Screen_Interface.GTKada_Backend;
My_Context : aliased Giza.Context.Instance;
function Callback return Boolean;
My_Timer : aliased Basic_Timer_Event :=
(Callback => Callback'Access);
end Timer_Callback;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with
Interfaces.C;
use type
Interfaces.C.int;
package body FLTK.Screen is
function fl_screen_x
return Interfaces.C.int;
pragma Import (C, fl_screen_x, "fl_screen_x");
pragma Inline (fl_screen_x);
function fl_screen_y
return Interfaces.C.int;
pragma Import (C, fl_screen_y, "fl_screen_y");
pragma Inline (fl_screen_y);
function fl_screen_w
return Interfaces.C.int;
pragma Import (C, fl_screen_w, "fl_screen_w");
pragma Inline (fl_screen_w);
function fl_screen_h
return Interfaces.C.int;
pragma Import (C, fl_screen_h, "fl_screen_h");
pragma Inline (fl_screen_h);
function fl_screen_count
return Interfaces.C.int;
pragma Import (C, fl_screen_count, "fl_screen_count");
pragma Inline (fl_screen_count);
procedure fl_screen_dpi
(H, V : out Interfaces.C.C_float;
N : in Interfaces.C.int);
pragma Import (C, fl_screen_dpi, "fl_screen_dpi");
pragma Inline (fl_screen_dpi);
function fl_screen_num
(X, Y : in Interfaces.C.int)
return Interfaces.C.int;
pragma Import (C, fl_screen_num, "fl_screen_num");
pragma Inline (fl_screen_num);
function fl_screen_num2
(X, Y, W, H : in Interfaces.C.int)
return Interfaces.C.int;
pragma Import (C, fl_screen_num2, "fl_screen_num2");
pragma Inline (fl_screen_num2);
procedure fl_screen_work_area
(X, Y, W, H : out Interfaces.C.int;
PX, PY : in Interfaces.C.int);
pragma Import (C, fl_screen_work_area, "fl_screen_work_area");
pragma Inline (fl_screen_work_area);
procedure fl_screen_work_area2
(X, Y, W, H : out Interfaces.C.int;
N : in Interfaces.C.int);
pragma Import (C, fl_screen_work_area2, "fl_screen_work_area2");
pragma Inline (fl_screen_work_area2);
procedure fl_screen_work_area3
(X, Y, W, H : out Interfaces.C.int);
pragma Import (C, fl_screen_work_area3, "fl_screen_work_area3");
pragma Inline (fl_screen_work_area3);
procedure fl_screen_xywh
(X, Y, W, H : out Interfaces.C.int;
PX, PY : in Interfaces.C.int);
pragma Import (C, fl_screen_xywh, "fl_screen_xywh");
pragma Inline (fl_screen_xywh);
procedure fl_screen_xywh2
(X, Y, W, H : out Interfaces.C.int;
N : in Interfaces.C.int);
pragma Import (C, fl_screen_xywh2, "fl_screen_xywh2");
pragma Inline (fl_screen_xywh2);
procedure fl_screen_xywh3
(X, Y, W, H : out Interfaces.C.int);
pragma Import (C, fl_screen_xywh3, "fl_screen_xywh3");
pragma Inline (fl_screen_xywh3);
procedure fl_screen_xywh4
(X, Y, W, H : out Interfaces.C.int;
PX, PY, PW, PH : in Interfaces.C.int);
pragma Import (C, fl_screen_xywh4, "fl_screen_xywh4");
pragma Inline (fl_screen_xywh4);
function Get_X return Integer is
begin
return Integer (fl_screen_x);
end Get_X;
function Get_Y return Integer is
begin
return Integer (fl_screen_y);
end Get_Y;
function Get_W return Integer is
begin
return Integer (fl_screen_w);
end Get_W;
function Get_H return Integer is
begin
return Integer (fl_screen_h);
end Get_H;
function Count return Integer is
begin
return Integer (fl_screen_count);
end Count;
-- Screen numbers in the range 1 .. Get_Count
procedure DPI
(Horizontal, Vertical : out Float;
Screen_Number : in Integer := 1) is
begin
fl_screen_dpi
(Interfaces.C.C_float (Horizontal),
Interfaces.C.C_float (Vertical),
Interfaces.C.int (Screen_Number) - 1);
end DPI;
function Containing
(X, Y : in Integer)
return Integer is
begin
return Integer (fl_screen_num
(Interfaces.C.int (X),
Interfaces.C.int (Y)));
end Containing;
function Containing
(X, Y, W, H : in Integer)
return Integer is
begin
return Integer (fl_screen_num2
(Interfaces.C.int (X),
Interfaces.C.int (Y),
Interfaces.C.int (W),
Interfaces.C.int (H)));
end Containing;
procedure Work_Area
(X, Y, W, H : out Integer;
Pos_X, Pos_Y : in Integer) is
begin
fl_screen_work_area
(Interfaces.C.int (X),
Interfaces.C.int (Y),
Interfaces.C.int (W),
Interfaces.C.int (H),
Interfaces.C.int (Pos_X),
Interfaces.C.int (Pos_Y));
end Work_Area;
procedure Work_Area
(X, Y, W, H : out Integer;
Screen_Num : in Integer) is
begin
fl_screen_work_area2
(Interfaces.C.int (X),
Interfaces.C.int (Y),
Interfaces.C.int (W),
Interfaces.C.int (H),
Interfaces.C.int (Screen_Num));
end Work_Area;
procedure Work_Area
(X, Y, W, H : out Integer) is
begin
fl_screen_work_area3
(Interfaces.C.int (X),
Interfaces.C.int (Y),
Interfaces.C.int (W),
Interfaces.C.int (H));
end Work_Area;
procedure Bounding_Rect
(X, Y, W, H : out Integer;
Pos_X, Pos_Y : in Integer) is
begin
fl_screen_xywh
(Interfaces.C.int (X),
Interfaces.C.int (Y),
Interfaces.C.int (W),
Interfaces.C.int (H),
Interfaces.C.int (Pos_X),
Interfaces.C.int (Pos_Y));
end Bounding_Rect;
procedure Bounding_Rect
(X, Y, W, H : out Integer;
Screen_Num : in Integer) is
begin
fl_screen_xywh2
(Interfaces.C.int (X),
Interfaces.C.int (Y),
Interfaces.C.int (W),
Interfaces.C.int (H),
Interfaces.C.int (Screen_Num));
end Bounding_Rect;
procedure Bounding_Rect
(X, Y, W, H : out Integer) is
begin
fl_screen_xywh3
(Interfaces.C.int (X),
Interfaces.C.int (Y),
Interfaces.C.int (W),
Interfaces.C.int (H));
end Bounding_Rect;
procedure Bounding_Rect
(X, Y, W, H : out Integer;
PX, PY, PW, PH : in Integer) is
begin
fl_screen_xywh4
(Interfaces.C.int (X),
Interfaces.C.int (Y),
Interfaces.C.int (W),
Interfaces.C.int (H),
Interfaces.C.int (PX),
Interfaces.C.int (PY),
Interfaces.C.int (PW),
Interfaces.C.int (PH));
end Bounding_Rect;
end FLTK.Screen;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with Entities; use Entities;
with Vectors2D; use Vectors2D;
with Ada.Containers.Doubly_Linked_Lists;
with Links; use Links;
with Collisions; use Collisions;
package Worlds is
package EntsList is new Ada.Containers.Doubly_Linked_Lists(EntityClassAcc);
type EntsListAcc is access EntsList.List;
package LinksList is new Ada.Containers.Doubly_Linked_Lists(LinkAcc);
type LinksListAcc is access LinksList.List;
type SearchModes is (SM_Entity, SM_Environment, SM_All);
type StepModes is (Step_Normal, Step_LowRAM);
type EntCheckerAcc is access function(E : EntityClassAcc) return Boolean;
type World is tagged record
-- Access to accesses to the entities
Entities : EntsListAcc;
-- Access to accesses to the environments entities
Environments : EntsListAcc;
-- Access to accesses to the links
Links : LinksListAcc;
-- Access to collisions (note this is different from the 3 above)
Cols : ColsListAcc;
-- Entities.len + Environments.len + Links.len < MaxEntities
MaxEntities : Natural;
-- Timestep
dt : Float;
-- Inverse timestep
Invdt : Float;
-- Function called when World checks the validity of its entities
InvalidChecker : EntCheckerAcc;
-- Max speed of entities, 0.0 to disable on an axis
MaxSpeed : Vec2D := (0.0, 0.0);
-- Default static entity, useful for faking collisions
-- Its restitution is LinkTypesFactors(LTRope)
StaticEnt : EntityClassAcc := null;
end record;
pragma Pack (World);
-- init world
procedure Init(This : in out World; dt : in Float; MaxEnts : Natural := 32);
procedure Step(This : in out World; Mode : StepModes := Step_Normal);
-- clear the world (deep free)
procedure Free(This : in out World);
-- Add entity to the world
procedure AddEntity(This : in out World; Ent : not null EntityClassAcc);
-- Add env to the world
procedure AddEnvironment(This : in out World; Ent : not null EntityClassAcc);
-- Add a link between two entities (rope, spring...)
procedure LinkEntities(This : in out World; A, B : EntityClassAcc; LinkType : LinkTypes; Factor : Float := 0.0);
-- Remove all links tied to the passed entity
procedure UnlinkEntity(This : in out World; E : EntityClassAcc);
-- Increases the number of max entities by Count
procedure IncreaseMaxEntities(This : in out World; Count : Positive);
-- Gives the world a function to check if entities are valid or not
procedure SetInvalidChecker(This : in out World; Invalider : EntCheckerAcc);
-- Remove entity from the world
-- Entity is detroyed if Destroy is true
procedure RemoveEntity(This : in out World; Ent : EntityClassAcc; Destroy : Boolean);
-- Remove env from the world
-- Entity is detroyed if Destroy is true
procedure RemoveEnvironment(This : in out World; Ent : not null EntityClassAcc; Destroy : Boolean);
-- Returns the entity in which Pos is
-- If SearchMode = SM_All, searches first entities, then envs (ents are "on top")
function GetClosest(This : in out World; Pos : Vec2D; SearchMode : SearchModes := SM_All) return EntityClassAcc;
-- Get the list of entities
function GetEntities(This : in World) return EntsListAcc;
-- Get the list of envs
function GetEnvironments(This : in World) return EntsListAcc;
-- Get the list of links
function GetLinks(This : in World) return LinksListAcc;
-- Lets you set a maximum speed >= 0
-- If max speed = 0 -> no max speed on that axis
procedure SetMaxSpeed(This : in out World; Speed : Vec2D);
-- Remove invalid entities according to InvalidChecker, if not null
procedure CheckEntities(This : in out World);
end Worlds;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-------------------------------------------------------------------------------
-- with Ada.Text_IO; use Ada.Text_IO;
package body Fixed_Types.Short is
overriding
function "abs" (A : Fixed_Sat_Short) return Fixed_Sat_Short is
begin
if A = Fixed_Sat_Short'First then
return Fixed_Sat_Short'Last;
else
return Fixed_Sat_Short (abs Fixed_Short (A));
end if;
end "abs";
overriding
function "+" (A, B : Fixed_Sat_Short) return Fixed_Sat_Short is
pragma Suppress (Overflow_Check);
C : Fixed_Integer_Short;
Zero : constant Fixed_Integer_Short := 0;
begin
C := To_Fixed_Integer_Short (A) + To_Fixed_Integer_Short (B);
if A > 0.0 and then B > 0.0 and then C < Zero then
return Fixed_Sat_Short'Last;
elsif A < 0.0 and then B < 0.0 and then C > Zero then
return Fixed_Sat_Short'First;
else
return To_Fixed_Sat_Short (C);
end if;
end "+";
overriding
function "-" (A, B : Fixed_Sat_Short) return Fixed_Sat_Short is
pragma Suppress (Overflow_Check);
C : Fixed_Integer_Short;
Zero : constant Fixed_Integer_Short := 0;
begin
C := To_Fixed_Integer_Short (A) - To_Fixed_Integer_Short (B);
if A > 0.0 and then B < 0.0 and then C < Zero then
return Fixed_Sat_Short'Last;
elsif A < 0.0 and then B > 0.0 and then C > Zero then
return Fixed_Sat_Short'First;
else
return To_Fixed_Sat_Short (C);
end if;
end "-";
overriding
function "-" (A : Fixed_Sat_Short) return Fixed_Sat_Short is
pragma Suppress (Overflow_Check);
begin
if A = Fixed_Sat_Short'First then
return Fixed_Sat_Short'Last;
else
return Fixed_Sat_Short (-Fixed_Short (A));
end if;
end "-";
not overriding
function "*" (A, B : Fixed_Sat_Short) return Fixed_Sat_Short is
pragma Suppress (Overflow_Check);
begin
if A = Fixed_Sat_Short'First and then B = Fixed_Sat_Short'First then
return Fixed_Sat_Short'Last;
else
return Fixed_Sat_Short (Fixed_Short (A) * Fixed_Short (B));
end if;
end "*";
overriding
function "*" (A : Fixed_Sat_Short; B : Integer) return Fixed_Sat_Short is
pragma Unsuppress (Overflow_Check);
begin
return Fixed_Sat_Short (Fixed_Short (A) * B);
exception
when Constraint_Error =>
if (A > 0.0 and B > 0) or (A < 0.0 and B < 0) then
return Fixed_Sat_Short'Last;
else
return Fixed_Sat_Short'First;
end if;
end "*";
end Fixed_Types.Short;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
---------------------------------------------------------------------------
with Ada.Real_Time;
with Ada.Task_Identification;
package System.Multiprocessors.Dispatching_Domains is
Dispatching_Domain_Error : exception;
type Dispatching_Domain (<>) is limited private;
System_Dispatching_Domain : constant Dispatching_Domain;
function Create (First : CPU; Last : CPU_Range) return Dispatching_Domain;
function Get_First_CPU (Domain : Dispatching_Domain) return CPU;
function Get_Last_CPU (Domain : Dispatching_Domain) return CPU_Range;
type CPU_Set is array(CPU range <>) of Boolean;
function Create (Set : CPU_Set) return Dispatching_Domain;
function Get_CPU_Set (Domain : Dispatching_Domain) return CPU_Set;
function Get_Dispatching_Domain
(T : Ada.Task_Identification.Task_Id :=
Ada.Task_Identification.Current_Task)
return Dispatching_Domain;
procedure Assign_Task
(Domain : in out Dispatching_Domain;
CPU : in CPU_Range := Not_A_Specific_CPU;
T : in Ada.Task_Identification.Task_Id :=
Ada.Task_Identification.Current_Task);
procedure Set_CPU
(CPU : in CPU_Range;
T : in Ada.Task_Identification.Task_Id :=
Ada.Task_Identification.Current_Task);
function Get_CPU
(T : Ada.Task_Identification.Task_Id :=
Ada.Task_Identification.Current_Task)
return CPU_Range;
procedure Delay_Until_And_Set_CPU
(Delay_Until_Time : in Ada.Real_Time.Time; CPU : in CPU_Range);
private
-- not specified by the language
end System.Multiprocessors.Dispatching_Domains;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-----------------------------------------------------------------------
with Util.Test_Caller;
with AWA.Events;
package body AWA.Mail.Modules.Tests is
package Caller is new Util.Test_Caller (Test, "Mail.Modules");
procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite) is
begin
Caller.Add_Test (Suite, "Test AWA.Mail.Module.Create_Message",
Test_Create_Message'Access);
Caller.Add_Test (Suite, "Test AWA.Mail.Module.Create_Message (CC:)",
Test_Cc_Message'Access);
Caller.Add_Test (Suite, "Test AWA.Mail.Module.Create_Message (BCC:)",
Test_Bcc_Message'Access);
end Add_Tests;
-- ------------------------------
-- Create an email message with the given template and verify its content.
-- ------------------------------
procedure Test_Mail_Message (T : in out Test;
Name : in String) is
use Util.Beans.Objects;
Mail : constant AWA.Mail.Modules.Mail_Module_Access := AWA.Mail.Modules.Get_Mail_Module;
Event : AWA.Events.Module_Event;
Props : Util.Beans.Objects.Maps.Map;
begin
T.Assert (Mail /= null, "There is no current mail module");
Props.Insert ("name", To_Object (String '("joe")));
Props.Insert ("email", To_Object (String '("<EMAIL>")));
Mail.Send_Mail (Template => Name,
Props => Props,
Content => Event);
end Test_Mail_Message;
-- ------------------------------
-- Create an email message and verify its content.
-- ------------------------------
procedure Test_Create_Message (T : in out Test) is
begin
T.Test_Mail_Message ("mail-info.html");
end Test_Create_Message;
-- ------------------------------
-- Create an email message with Cc: and verify its content.
-- ------------------------------
procedure Test_Cc_Message (T : in out Test) is
begin
T.Test_Mail_Message ("mail-cc.html");
end Test_Cc_Message;
-- ------------------------------
-- Create an email message with Bcc: and verify its content.
-- ------------------------------
procedure Test_Bcc_Message (T : in out Test) is
begin
T.Test_Mail_Message ("mail-bcc.html");
end Test_Bcc_Message;
end AWA.Mail.Modules.Tests;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with ada.text_io; use ada.text_io;
with spi; use spi;
with stdint_h; use stdint_h;
with Interfaces.C.Strings; use Interfaces.C.Strings;
with ada.command_line; use ada.command_line;
with ada.exceptions; use ada.exceptions;
procedure Send_Byte is
device : aliased SPI_Device;
tx_buf : aliased uint8_t;
rx_buf : aliased uint8_t;
procedure display_usage is
begin
put_line("Usage: ada_send_byte [DEVICE_PATH] [BYTE]\n");
put_line(" DEVICE_PATH: Full path to SPI device file.\n");
put_line(" BYTE: Byte to send (in hexidecimal)\n");
end display_usage;
begin
-- Validate argument count --
if argument_count < 2 then
display_usage;
return;
end if;
-- Convert byte parameter to binary --
tx_buf := uint8_t'value("16#" & argument(2) & "#");
-- Open the SPI device --
Open(Device => device'access,
Device_Path => New_String(argument(1)),
Mode => 0,
Bits => 8,
Freq => 20000);
-- Transfer one byte over SPI --
Transfer(Device => device'access,
Transmit_Buffer => tx_buf'access,
Receive_Buffer => rx_buf'access,
C_Delay => 0,
Length => 1);
-- Close the SPI device --
Close(Device => device'access);
exception
when error: others =>
put(Exception_Information(error));
end Send_Byte;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Atree; use Atree;
with Csets; use Csets;
with Elists; use Elists;
with Errout; use Errout;
with Lib.Util; use Lib.Util;
with Nlists; use Nlists;
with Opt; use Opt;
with Restrict; use Restrict;
with Rident; use Rident;
with Sem; use Sem;
with Sem_Aux; use Sem_Aux;
with Sem_Prag; use Sem_Prag;
with Sem_Util; use Sem_Util;
with Sem_Warn; use Sem_Warn;
with Sinfo; use Sinfo;
with Sinput; use Sinput;
with Snames; use Snames;
with Stringt; use Stringt;
with Stand; use Stand;
with Table; use Table;
with GNAT.Heap_Sort_G;
with GNAT.HTable;
package body Lib.Xref is
------------------
-- Declarations --
------------------
package Deferred_References is new Table.Table (
Table_Component_Type => Deferred_Reference_Entry,
Table_Index_Type => Int,
Table_Low_Bound => 0,
Table_Initial => 512,
Table_Increment => 200,
Table_Name => "Name_Deferred_References");
-- The Xref table is used to record references. The Loc field is set
-- to No_Location for a definition entry.
subtype Xref_Entry_Number is Int;
type Xref_Key is record
-- These are the components of Xref_Entry that participate in hash
-- lookups.
Ent : Entity_Id;
-- Entity referenced (E parameter to Generate_Reference)
Loc : Source_Ptr;
-- Location of reference (Original_Location (Sloc field of N parameter
-- to Generate_Reference)). Set to No_Location for the case of a
-- defining occurrence.
Typ : Character;
-- Reference type (Typ param to Generate_Reference)
Eun : Unit_Number_Type;
-- Unit number corresponding to Ent
Lun : Unit_Number_Type;
-- Unit number corresponding to Loc. Value is undefined and not
-- referenced if Loc is set to No_Location.
-- The following components are only used for SPARK cross-references
Ref_Scope : Entity_Id;
-- Entity of the closest subprogram or package enclosing the reference
Ent_Scope : Entity_Id;
-- Entity of the closest subprogram or package enclosing the definition,
-- which should be located in the same file as the definition itself.
end record;
type Xref_Entry is record
Key : Xref_Key;
Ent_Scope_File : Unit_Number_Type;
-- File for entity Ent_Scope
Def : Source_Ptr;
-- Original source location for entity being referenced. Note that these
-- values are used only during the output process, they are not set when
-- the entries are originally built. This is because private entities
-- can be swapped when the initial call is made.
HTable_Next : Xref_Entry_Number;
-- For use only by Static_HTable
end record;
package Xrefs is new Table.Table (
Table_Component_Type => Xref_Entry,
Table_Index_Type => Xref_Entry_Number,
Table_Low_Bound => 1,
Table_Initial => Alloc.Xrefs_Initial,
Table_Increment => Alloc.Xrefs_Increment,
Table_Name => "Xrefs");
--------------
-- Xref_Set --
--------------
-- We keep a set of xref entries, in order to avoid inserting duplicate
-- entries into the above Xrefs table. An entry is in Xref_Set if and only
-- if it is in Xrefs.
Num_Buckets : constant := 2**16;
subtype Header_Num is Integer range 0 .. Num_Buckets - 1;
type Null_Type is null record;
pragma Unreferenced (Null_Type);
function Hash (F : Xref_Entry_Number) return Header_Num;
function Equal (F1, F2 : Xref_Entry_Number) return Boolean;
procedure HT_Set_Next (E : Xref_Entry_Number; Next : Xref_Entry_Number);
function HT_Next (E : Xref_Entry_Number) return Xref_Entry_Number;
function Get_Key (E : Xref_Entry_Number) return Xref_Entry_Number;
pragma Inline (Hash, Equal, HT_Set_Next, HT_Next, Get_Key);
package Xref_Set is new GNAT.HTable.Static_HTable (
Header_Num,
Element => Xref_Entry,
Elmt_Ptr => Xref_Entry_Number,
Null_Ptr => 0,
Set_Next => HT_Set_Next,
Next => HT_Next,
Key => Xref_Entry_Number,
Get_Key => Get_Key,
Hash => Hash,
Equal => Equal);
-----------------------------
-- SPARK Xrefs Information --
-----------------------------
package body SPARK_Specific is separate;
------------------------
-- Local Subprograms --
------------------------
procedure Add_Entry (Key : Xref_Key; Ent_Scope_File : Unit_Number_Type);
-- Add an entry to the tables of Xref_Entries, avoiding duplicates
procedure Generate_Prim_Op_References (Typ : Entity_Id);
-- For a tagged type, generate implicit references to its primitive
-- operations, for source navigation. This is done right before emitting
-- cross-reference information rather than at the freeze point of the type
-- in order to handle late bodies that are primitive operations.
function Lt (T1, T2 : Xref_Entry) return Boolean;
-- Order cross-references
---------------
-- Add_Entry --
---------------
procedure Add_Entry (Key : Xref_Key; Ent_Scope_File : Unit_Number_Type) is
begin
Xrefs.Increment_Last; -- tentative
Xrefs.Table (Xrefs.Last).Key := Key;
-- Set the entry in Xref_Set, and if newly set, keep the above
-- tentative increment.
if Xref_Set.Set_If_Not_Present (Xrefs.Last) then
Xrefs.Table (Xrefs.Last).Ent_Scope_File := Ent_Scope_File;
-- Leave Def and HTable_Next uninitialized
Set_Has_Xref_Entry (Key.Ent);
-- It was already in Xref_Set, so throw away the tentatively-added entry
else
Xrefs.Decrement_Last;
end if;
end Add_Entry;
---------------------
-- Defer_Reference --
---------------------
procedure Defer_Reference (Deferred_Reference : Deferred_Reference_Entry) is
begin
-- If Get_Ignore_Errors, then we are in Preanalyze_Without_Errors, and
-- we should not record cross references, because that will cause
-- duplicates when we call Analyze.
if not Get_Ignore_Errors then
Deferred_References.Append (Deferred_Reference);
end if;
end Defer_Reference;
-----------
-- Equal --
-----------
function Equal (F1, F2 : Xref_Entry_Number) return Boolean is
Result : constant Boolean :=
Xrefs.Table (F1).Key = Xrefs.Table (F2).Key;
begin
return Result;
end Equal;
-------------------------
-- Generate_Definition --
-------------------------
procedure Generate_Definition (E : Entity_Id) is
begin
pragma Assert (Nkind (E) in N_Entity);
-- Note that we do not test Xref_Entity_Letters here. It is too early
-- to do so, since we are often called before the entity is fully
-- constructed, so that the Ekind is still E_Void.
if Opt.Xref_Active
-- Definition must come from source
-- We make an exception for subprogram child units that have no spec.
-- For these we generate a subprogram declaration for library use,
-- and the corresponding entity does not come from source.
-- Nevertheless, all references will be attached to it and we have
-- to treat is as coming from user code.
and then (Comes_From_Source (E) or else Is_Child_Unit (E))
-- And must have a reasonable source location that is not
-- within an instance (all entities in instances are ignored)
and then Sloc (E) > No_Location
and then Instantiation_Location (Sloc (E)) = No_Location
-- And must be a non-internal name from the main source unit
and then In_Extended_Main_Source_Unit (E)
and then not Is_Internal_Name (Chars (E))
then
Add_Entry
((Ent => E,
Loc => No_Location,
Typ => ' ',
Eun => Get_Source_Unit (Original_Location (Sloc (E))),
Lun => No_Unit,
Ref_Scope => Empty,
Ent_Scope => Empty),
Ent_Scope_File => No_Unit);
if In_Inlined_Body then
Set_Referenced (E);
end if;
end if;
end Generate_Definition;
---------------------------------
-- Generate_Operator_Reference --
---------------------------------
procedure Generate_Operator_Reference
(N : Node_Id;
T : Entity_Id)
is
begin
if not In_Extended_Main_Source_Unit (N) then
return;
end if;
-- If the operator is not a Standard operator, then we generate a real
-- reference to the user defined operator.
if Sloc (Entity (N)) /= Standard_Location then
Generate_Reference (Entity (N), N);
-- A reference to an implicit inequality operator is also a reference
-- to the user-defined equality.
if Nkind (N) = N_Op_Ne
and then not Comes_From_Source (Entity (N))
and then Present (Corresponding_Equality (Entity (N)))
then
Generate_Reference (Corresponding_Equality (Entity (N)), N);
end if;
-- For the case of Standard operators, we mark the result type as
-- referenced. This ensures that in the case where we are using a
-- derived operator, we mark an entity of the unit that implicitly
-- defines this operator as used. Otherwise we may think that no entity
-- of the unit is used. The actual entity marked as referenced is the
-- first subtype, which is the relevant user defined entity.
-- Note: we only do this for operators that come from source. The
-- generated code sometimes reaches for entities that do not need to be
-- explicitly visible (for example, when we expand the code for
-- comparing two record objects, the fields of the record may not be
-- visible).
elsif Comes_From_Source (N) then
Set_Referenced (First_Subtype (T));
end if;
end Generate_Operator_Reference;
---------------------------------
-- Generate_Prim_Op_References --
---------------------------------
procedure Generate_Prim_Op_References (Typ : Entity_Id) is
Base_T : Entity_Id;
Prim : Elmt_Id;
Prim_List : Elist_Id;
begin
-- Handle subtypes of synchronized types
if Ekind (Typ) = E_Protected_Subtype
or else Ekind (Typ) = E_Task_Subtype
then
Base_T := Etype (Typ);
else
Base_T := Typ;
end if;
-- References to primitive operations are only relevant for tagged types
if not Is_Tagged_Type (Base_T)
or else Is_Class_Wide_Type (Base_T)
then
return;
end if;
-- Ada 2005 (AI-345): For synchronized types generate reference to the
-- wrapper that allow us to dispatch calls through their implemented
-- abstract interface types.
-- The check for Present here is to protect against previously reported
-- critical errors.
Prim_List := Primitive_Operations (Base_T);
if No (Prim_List) then
return;
end if;
Prim := First_Elmt (Prim_List);
while Present (Prim) loop
-- If the operation is derived, get the original for cross-reference
-- reference purposes (it is the original for which we want the xref
-- and for which the comes_from_source test must be performed).
Generate_Reference
(Typ, Ultimate_Alias (Node (Prim)), 'p', Set_Ref => False);
Next_Elmt (Prim);
end loop;
end Generate_Prim_Op_References;
------------------------
-- Generate_Reference --
------------------------
procedure Generate_Reference
(E : Entity_Id;
N : Node_Id;
Typ : Character := 'r';
Set_Ref : Boolean := True;
Force : Boolean := False)
is
Actual_Typ : Character := Typ;
Call : Node_Id;
Def : Source_Ptr;
Ent : Entity_Id;
Ent_Scope : Entity_Id;
Formal : Entity_Id;
Kind : Entity_Kind;
Nod : Node_Id;
Ref : Source_Ptr;
Ref_Scope : Entity_Id;
function Get_Through_Renamings (E : Entity_Id) return Entity_Id;
-- Get the enclosing entity through renamings, which may come from
-- source or from the translation of generic instantiations.
function Is_On_LHS (Node : Node_Id) return Boolean;
-- Used to check if a node is on the left hand side of an assignment.
-- The following cases are handled:
--
-- Variable Node is a direct descendant of left hand side of an
-- assignment statement.
--
-- Prefix Of an indexed or selected component that is present in
-- a subtree rooted by an assignment statement. There is
-- no restriction of nesting of components, thus cases
-- such as A.B (C).D are handled properly. However a prefix
-- of a dereference (either implicit or explicit) is never
-- considered as on a LHS.
--
-- Out param Same as above cases, but OUT parameter
function OK_To_Set_Referenced return Boolean;
-- Returns True if the Referenced flag can be set. There are a few
-- exceptions where we do not want to set this flag, see body for
-- details of these exceptional cases.
---------------------------
-- Get_Through_Renamings --
---------------------------
function Get_Through_Renamings (E : Entity_Id) return Entity_Id is
begin
case Ekind (E) is
-- For subprograms we just need to check once if they are have a
-- Renamed_Entity, because Renamed_Entity is set transitively.
when Subprogram_Kind =>
declare
Renamed : constant Entity_Id := Renamed_Entity (E);
begin
if Present (Renamed) then
return Renamed;
else
return E;
end if;
end;
-- For objects we need to repeatedly call Renamed_Object, because
-- it is not transitive.
when Object_Kind =>
declare
Obj : Entity_Id := E;
begin
loop
pragma Assert (Present (Obj));
declare
Renamed : constant Entity_Id := Renamed_Object (Obj);
begin
if Present (Renamed) then
Obj := Get_Enclosing_Object (Renamed);
-- The renamed expression denotes a non-object,
-- e.g. function call, slicing of a function call,
-- pointer dereference, etc.
if No (Obj) then
return Empty;
end if;
else
return Obj;
end if;
end;
end loop;
end;
when others =>
return E;
end case;
end Get_Through_Renamings;
---------------
-- Is_On_LHS --
---------------
-- ??? There are several routines here and there that perform a similar
-- (but subtly different) computation, which should be factored:
-- Sem_Util.Is_LHS
-- Sem_Util.May_Be_Lvalue
-- Sem_Util.Known_To_Be_Assigned
-- Exp_Ch2.Expand_Entry_Parameter.In_Assignment_Context
-- Exp_Smem.Is_Out_Actual
function Is_On_LHS (Node : Node_Id) return Boolean is
N : Node_Id;
P : Node_Id;
K : Node_Kind;
begin
-- Only identifiers are considered, is this necessary???
if Nkind (Node) /= N_Identifier then
return False;
end if;
-- Immediate return if appeared as OUT parameter
if Kind = E_Out_Parameter then
return True;
end if;
-- Search for assignment statement subtree root
N := Node;
loop
P := Parent (N);
K := Nkind (P);
if K = N_Assignment_Statement then
return Name (P) = N;
-- Check whether the parent is a component and the current node is
-- its prefix, but return False if the current node has an access
-- type, as in that case the selected or indexed component is an
-- implicit dereference, and the LHS is the designated object, not
-- the access object.
-- ??? case of a slice assignment?
elsif (K = N_Selected_Component or else K = N_Indexed_Component)
and then Prefix (P) = N
then
-- Check for access type. First a special test, In some cases
-- this is called too early (see comments in Find_Direct_Name),
-- at a point where the tree is not fully typed yet. In that
-- case we may lack an Etype for N, and we can't check the
-- Etype. For now, we always return False in such a case,
-- but this is clearly not right in all cases ???
if No (Etype (N)) then
return False;
elsif Is_Access_Type (Etype (N)) then
return False;
-- Access type case dealt with, keep going
else
N := P;
end if;
-- All other cases, definitely not on left side
else
return False;
end if;
end loop;
end Is_On_LHS;
---------------------------
-- OK_To_Set_Referenced --
---------------------------
function OK_To_Set_Referenced return Boolean is
P : Node_Id;
begin
-- A reference from a pragma Unreferenced or pragma Unmodified or
-- pragma Warnings does not cause the Referenced flag to be set.
-- This avoids silly warnings about things being referenced and
-- not assigned when the only reference is from the pragma.
if Nkind (N) = N_Identifier then
P := Parent (N);
if Nkind (P) = N_Pragma_Argument_Association then
P := Parent (P);
if Nkind (P) = N_Pragma then
if Pragma_Name_Unmapped (P) in Name_Warnings
| Name_Unmodified
| Name_Unreferenced
then
return False;
end if;
end if;
-- A reference to a formal in a named parameter association does
-- not make the formal referenced. Formals that are unused in the
-- subprogram body are properly flagged as such, even if calls
-- elsewhere use named notation.
elsif Nkind (P) = N_Parameter_Association
and then N = Selector_Name (P)
then
return False;
end if;
end if;
return True;
end OK_To_Set_Referenced;
-- Start of processing for Generate_Reference
begin
-- If Get_Ignore_Errors, then we are in Preanalyze_Without_Errors, and
-- we should not record cross references, because that will cause
-- duplicates when we call Analyze.
if Get_Ignore_Errors then
return;
end if;
-- May happen in case of severe errors
if Nkind (E) not in N_Entity then
return;
end if;
Find_Actual (N, Formal, Call);
if Present (Formal) then
Kind := Ekind (Formal);
else
Kind := E_Void;
end if;
-- Check for obsolescent reference to package ASCII. GNAT treats this
-- element of annex J specially since in practice, programs make a lot
-- of use of this feature, so we don't include it in the set of features
-- diagnosed when Warn_On_Obsolescent_Features mode is set. However we
-- are required to note it as a violation of the RM defined restriction.
if E = Standard_ASCII then
Check_Restriction (No_Obsolescent_Features, N);
end if;
-- Check for reference to entity marked with Is_Obsolescent
-- Note that we always allow obsolescent references in the compiler
-- itself and the run time, since we assume that we know what we are
-- doing in such cases. For example the calls in Ada.Characters.Handling
-- to its own obsolescent subprograms are just fine.
-- In any case we only generate warnings if we are in the extended main
-- source unit, and the entity itself is not in the extended main source
-- unit, since we assume the source unit itself knows what is going on
-- (and for sure we do not want silly warnings, e.g. on the end line of
-- an obsolescent procedure body).
if Is_Obsolescent (E)
and then not GNAT_Mode
and then not In_Extended_Main_Source_Unit (E)
and then In_Extended_Main_Source_Unit (N)
then
Check_Restriction (No_Obsolescent_Features, N);
if Warn_On_Obsolescent_Feature then
Output_Obsolescent_Entity_Warnings (N, E);
end if;
end if;
-- Warn if reference to Ada 2005 entity not in Ada 2005 mode. We only
-- detect real explicit references (modifications and references).
if Comes_From_Source (N)
and then Is_Ada_2005_Only (E)
and then Ada_Version < Ada_2005
and then Warn_On_Ada_2005_Compatibility
and then (Typ = 'm' or else Typ = 'r' or else Typ = 's')
then
Error_Msg_NE ("& is only defined in Ada 2005?y?", N, E);
end if;
-- Warn if reference to Ada 2012 entity not in Ada 2012 mode. We only
-- detect real explicit references (modifications and references).
if Comes_From_Source (N)
and then Is_Ada_2012_Only (E)
and then Ada_Version < Ada_2012
and then Warn_On_Ada_2012_Compatibility
and then (Typ = 'm' or else Typ = 'r')
then
Error_Msg_NE ("& is only defined in Ada 2012?y?", N, E);
end if;
-- Do not generate references if we are within a postcondition sub-
-- program, because the reference does not comes from source, and the
-- preanalysis of the aspect has already created an entry for the ALI
-- file at the proper source location.
if Chars (Current_Scope) = Name_uPostconditions then
return;
end if;
-- Never collect references if not in main source unit. However, we omit
-- this test if Typ is 'e' or 'k', since these entries are structural,
-- and it is useful to have them in units that reference packages as
-- well as units that define packages. We also omit the test for the
-- case of 'p' since we want to include inherited primitive operations
-- from other packages.
-- We also omit this test is this is a body reference for a subprogram
-- instantiation. In this case the reference is to the generic body,
-- which clearly need not be in the main unit containing the instance.
-- For the same reason we accept an implicit reference generated for
-- a default in an instance.
-- We also set the referenced flag in a generic package that is not in
-- then main source unit, when the variable is of a formal private type,
-- to warn in the instance if the corresponding type is not a fully
-- initialized type.
if not In_Extended_Main_Source_Unit (N) then
if Typ = 'e' or else
Typ = 'I' or else
Typ = 'p' or else
Typ = 'i' or else
Typ = 'k'
or else (Typ = 'b' and then Is_Generic_Instance (E))
-- Allow the generation of references to reads, writes and calls
-- in SPARK mode when the related context comes from an instance.
or else
(GNATprove_Mode
and then In_Extended_Main_Code_Unit (N)
and then (Typ = 'm' or else Typ = 'r' or else Typ = 's'))
then
null;
elsif In_Instance_Body
and then In_Extended_Main_Code_Unit (N)
and then Is_Generic_Type (Etype (E))
then
Set_Referenced (E);
return;
elsif Inside_A_Generic
and then Is_Generic_Type (Etype (E))
then
Set_Referenced (E);
return;
else
return;
end if;
end if;
-- For reference type p, the entity must be in main source unit
if Typ = 'p' and then not In_Extended_Main_Source_Unit (E) then
return;
end if;
-- Unless the reference is forced, we ignore references where the
-- reference itself does not come from source.
if not Force and then not Comes_From_Source (N) then
return;
end if;
-- Deal with setting entity as referenced, unless suppressed. Note that
-- we still do Set_Referenced on entities that do not come from source.
-- This situation arises when we have a source reference to a derived
-- operation, where the derived operation itself does not come from
-- source, but we still want to mark it as referenced, since we really
-- are referencing an entity in the corresponding package (this avoids
-- wrong complaints that the package contains no referenced entities).
if Set_Ref then
-- Assignable object appearing on left side of assignment or as
-- an out parameter.
if Is_Assignable (E)
and then Is_On_LHS (N)
and then Ekind (E) /= E_In_Out_Parameter
then
-- For objects that are renamings, just set as simply referenced
-- we do not try to do assignment type tracking in this case.
if Present (Renamed_Object (E)) then
Set_Referenced (E);
-- Out parameter case
elsif Kind = E_Out_Parameter then
-- If warning mode for all out parameters is set, or this is
-- the only warning parameter, then we want to mark this for
-- later warning logic by setting Referenced_As_Out_Parameter
if Warn_On_Modified_As_Out_Parameter (Formal) then
Set_Referenced_As_Out_Parameter (E, True);
Set_Referenced_As_LHS (E, False);
-- For OUT parameter not covered by the above cases, we simply
-- regard it as a normal reference (in this case we do not
-- want any of the warning machinery for out parameters).
else
Set_Referenced (E);
end if;
-- For the left hand of an assignment case, we do nothing here.
-- The processing for Analyze_Assignment_Statement will set the
-- Referenced_As_LHS flag.
else
null;
end if;
-- Check for a reference in a pragma that should not count as a
-- making the variable referenced for warning purposes.
elsif Is_Non_Significant_Pragma_Reference (N) then
null;
-- A reference in an attribute definition clause does not count as a
-- reference except for the case of Address. The reason that 'Address
-- is an exception is that it creates an alias through which the
-- variable may be referenced.
elsif Nkind (Parent (N)) = N_Attribute_Definition_Clause
and then Chars (Parent (N)) /= Name_Address
and then N = Name (Parent (N))
then
null;
-- Constant completion does not count as a reference
elsif Typ = 'c'
and then Ekind (E) = E_Constant
then
null;
-- Record representation clause does not count as a reference
elsif Nkind (N) = N_Identifier
and then Nkind (Parent (N)) = N_Record_Representation_Clause
then
null;
-- Discriminants do not need to produce a reference to record type
elsif Typ = 'd'
and then Nkind (Parent (N)) = N_Discriminant_Specification
then
null;
-- All other cases
else
-- Special processing for IN OUT parameters, where we have an
-- implicit assignment to a simple variable.
if Kind = E_In_Out_Parameter
and then Is_Assignable (E)
then
-- For sure this counts as a normal read reference
Set_Referenced (E);
Set_Last_Assignment (E, Empty);
-- We count it as being referenced as an out parameter if the
-- option is set to warn on all out parameters, except that we
-- have a special exclusion for an intrinsic subprogram, which
-- is most likely an instantiation of Unchecked_Deallocation
-- which we do not want to consider as an assignment since it
-- generates false positives. We also exclude the case of an
-- IN OUT parameter if the name of the procedure is Free,
-- since we suspect similar semantics.
if Warn_On_All_Unread_Out_Parameters
and then Is_Entity_Name (Name (Call))
and then not Is_Intrinsic_Subprogram (Entity (Name (Call)))
and then Chars (Name (Call)) /= Name_Free
then
Set_Referenced_As_Out_Parameter (E, True);
Set_Referenced_As_LHS (E, False);
end if;
-- Don't count a recursive reference within a subprogram as a
-- reference (that allows detection of a recursive subprogram
-- whose only references are recursive calls as unreferenced).
elsif Is_Subprogram (E)
and then E = Nearest_Dynamic_Scope (Current_Scope)
then
null;
-- Any other occurrence counts as referencing the entity
elsif OK_To_Set_Referenced then
Set_Referenced (E);
-- If variable, this is an OK reference after an assignment
-- so we can clear the Last_Assignment indication.
if Is_Assignable (E) then
Set_Last_Assignment (E, Empty);
end if;
end if;
end if;
-- Check for pragma Unreferenced given and reference is within
-- this source unit (occasion for possible warning to be issued).
-- Note that the entity may be marked as unreferenced by pragma
-- Unused.
if Has_Unreferenced (E)
and then In_Same_Extended_Unit (E, N)
then
-- A reference as a named parameter in a call does not count as a
-- violation of pragma Unreferenced for this purpose...
if Nkind (N) = N_Identifier
and then Nkind (Parent (N)) = N_Parameter_Association
and then Selector_Name (Parent (N)) = N
then
null;
-- ... Neither does a reference to a variable on the left side of
-- an assignment.
elsif Is_On_LHS (N) then
null;
-- Do not consider F'Result as a violation of pragma Unreferenced
-- since the attribute acts as an anonymous alias of the function
-- result and not as a real reference to the function.
elsif Ekind (E) in E_Function | E_Generic_Function
and then Is_Entity_Name (N)
and then Is_Attribute_Result (Parent (N))
then
null;
-- No warning if the reference is in a call that does not come
-- from source (e.g. a call to a controlled type primitive).
elsif not Comes_From_Source (Parent (N))
and then Nkind (Parent (N)) = N_Procedure_Call_Statement
then
null;
-- For entry formals, we want to place the warning message on the
-- corresponding entity in the accept statement. The current scope
-- is the body of the accept, so we find the formal whose name
-- matches that of the entry formal (there is no link between the
-- two entities, and the one in the accept statement is only used
-- for conformance checking).
elsif Ekind (Scope (E)) = E_Entry then
declare
BE : Entity_Id;
begin
BE := First_Entity (Current_Scope);
while Present (BE) loop
if Chars (BE) = Chars (E) then
if Has_Pragma_Unused (E) then
Error_Msg_NE -- CODEFIX
("??pragma Unused given for&!", N, BE);
else
Error_Msg_NE -- CODEFIX
("??pragma Unreferenced given for&!", N, BE);
end if;
exit;
end if;
Next_Entity (BE);
end loop;
end;
-- Here we issue the warning, since this is a real reference
elsif Has_Pragma_Unused (E) then
Error_Msg_NE -- CODEFIX
("??pragma Unused given for&!", N, E);
else
Error_Msg_NE -- CODEFIX
("??pragma Unreferenced given for&!", N, E);
end if;
end if;
-- If this is a subprogram instance, mark as well the internal
-- subprogram in the wrapper package, which may be a visible
-- compilation unit.
if Is_Overloadable (E)
and then Is_Generic_Instance (E)
and then Present (Alias (E))
then
Set_Referenced (Alias (E));
end if;
end if;
-- Generate reference if all conditions are met:
if
-- Cross referencing must be active
Opt.Xref_Active
-- The entity must be one for which we collect references
and then Xref_Entity_Letters (Ekind (E)) /= ' '
-- Both Sloc values must be set to something sensible
and then Sloc (E) > No_Location
and then Sloc (N) > No_Location
-- Ignore references from within an instance. The only exceptions to
-- this are default subprograms, for which we generate an implicit
-- reference and compilations in SPARK mode.
and then
(Instantiation_Location (Sloc (N)) = No_Location
or else Typ = 'i'
or else GNATprove_Mode)
-- Ignore dummy references
and then Typ /= ' '
then
if Nkind (N) in N_Identifier
| N_Defining_Identifier
| N_Defining_Operator_Symbol
| N_Operator_Symbol
| N_Defining_Character_Literal
| N_Op
or else (Nkind (N) = N_Character_Literal
and then Sloc (Entity (N)) /= Standard_Location)
then
Nod := N;
elsif Nkind (N) in N_Expanded_Name | N_Selected_Component then
Nod := Selector_Name (N);
else
return;
end if;
-- Normal case of source entity comes from source
if Comes_From_Source (E) then
Ent := E;
-- Because a declaration may be generated for a subprogram body
-- without declaration in GNATprove mode, for inlining, some
-- parameters may end up being marked as not coming from source
-- although they are. Take these into account specially.
elsif GNATprove_Mode and then Is_Formal (E) then
Ent := E;
-- Entity does not come from source, but is a derived subprogram and
-- the derived subprogram comes from source (after one or more
-- derivations) in which case the reference is to parent subprogram.
elsif Is_Overloadable (E)
and then Present (Alias (E))
then
Ent := Alias (E);
while not Comes_From_Source (Ent) loop
if No (Alias (Ent)) then
return;
end if;
Ent := Alias (Ent);
end loop;
-- The internally created defining entity for a child subprogram
-- that has no previous spec has valid references.
elsif Is_Overloadable (E)
and then Is_Child_Unit (E)
then
Ent := E;
-- Ditto for the formals of such a subprogram
elsif Is_Overloadable (Scope (E))
and then Is_Child_Unit (Scope (E))
then
Ent := E;
-- Record components of discriminated subtypes or derived types must
-- be treated as references to the original component.
elsif Ekind (E) = E_Component
and then Comes_From_Source (Original_Record_Component (E))
then
Ent := Original_Record_Component (E);
-- If this is an expanded reference to a discriminant, recover the
-- original discriminant, which gets the reference.
elsif Ekind (E) = E_In_Parameter
and then Present (Discriminal_Link (E))
then
Ent := Discriminal_Link (E);
Set_Referenced (Ent);
-- Ignore reference to any other entity that is not from source
else
return;
end if;
-- In SPARK mode, consider the underlying entity renamed instead of
-- the renaming, which is needed to compute a valid set of effects
-- (reads, writes) for the enclosing subprogram.
if GNATprove_Mode then
Ent := Get_Through_Renamings (Ent);
-- If no enclosing object, then it could be a reference to any
-- location not tracked individually, like heap-allocated data.
-- Conservatively approximate this possibility by generating a
-- dereference, and return.
if No (Ent) then
if Actual_Typ = 'w' then
SPARK_Specific.Generate_Dereference (Nod, 'r');
SPARK_Specific.Generate_Dereference (Nod, 'w');
else
SPARK_Specific.Generate_Dereference (Nod, 'r');
end if;
return;
end if;
end if;
-- Record reference to entity
if Actual_Typ = 'p'
and then Is_Subprogram (Nod)
and then Present (Overridden_Operation (Nod))
then
Actual_Typ := 'P';
end if;
-- Comment needed here for special SPARK code ???
if GNATprove_Mode then
-- Ignore references to an entity which is a Part_Of single
-- concurrent object. Ideally we would prefer to add it as a
-- reference to the corresponding concurrent type, but it is quite
-- difficult (as such references are not currently added even for)
-- reads/writes of private protected components) and not worth the
-- effort.
if Ekind (Ent) in E_Abstract_State | E_Constant | E_Variable
and then Present (Encapsulating_State (Ent))
and then Is_Single_Concurrent_Object (Encapsulating_State (Ent))
then
return;
end if;
Ref := Sloc (Nod);
Def := Sloc (Ent);
Ref_Scope :=
SPARK_Specific.Enclosing_Subprogram_Or_Library_Package (Nod);
Ent_Scope :=
SPARK_Specific.Enclosing_Subprogram_Or_Library_Package (Ent);
-- Since we are reaching through renamings in SPARK mode, we may
-- end up with standard constants. Ignore those.
if Sloc (Ent_Scope) <= Standard_Location
or else Def <= Standard_Location
then
return;
end if;
Add_Entry
((Ent => Ent,
Loc => Ref,
Typ => Actual_Typ,
Eun => Get_Top_Level_Code_Unit (Def),
Lun => Get_Top_Level_Code_Unit (Ref),
Ref_Scope => Ref_Scope,
Ent_Scope => Ent_Scope),
Ent_Scope_File => Get_Top_Level_Code_Unit (Ent));
else
Ref := Original_Location (Sloc (Nod));
Def := Original_Location (Sloc (Ent));
-- If this is an operator symbol, skip the initial quote for
-- navigation purposes. This is not done for the end label,
-- where we want the actual position after the closing quote.
if Typ = 't' then
null;
elsif Nkind (N) = N_Defining_Operator_Symbol
or else Nkind (Nod) = N_Operator_Symbol
then
Ref := Ref + 1;
end if;
Add_Entry
((Ent => Ent,
Loc => Ref,
Typ => Actual_Typ,
Eun => Get_Source_Unit (Def),
Lun => Get_Source_Unit (Ref),
Ref_Scope => Empty,
Ent_Scope => Empty),
Ent_Scope_File => No_Unit);
-- Generate reference to the first private entity
if Typ = 'e'
and then Comes_From_Source (E)
and then Nkind (Ent) = N_Defining_Identifier
and then (Is_Package_Or_Generic_Package (Ent)
or else Is_Concurrent_Type (Ent))
and then Present (First_Private_Entity (E))
and then In_Extended_Main_Source_Unit (N)
then
-- Handle case in which the full-view and partial-view of the
-- first private entity are swapped.
declare
First_Private : Entity_Id := First_Private_Entity (E);
begin
if Is_Private_Type (First_Private)
and then Present (Full_View (First_Private))
then
First_Private := Full_View (First_Private);
end if;
Add_Entry
((Ent => Ent,
Loc => Sloc (First_Private),
Typ => 'E',
Eun => Get_Source_Unit (Def),
Lun => Get_Source_Unit (Ref),
Ref_Scope => Empty,
Ent_Scope => Empty),
Ent_Scope_File => No_Unit);
end;
end if;
end if;
end if;
end Generate_Reference;
-----------------------------------
-- Generate_Reference_To_Formals --
-----------------------------------
procedure Generate_Reference_To_Formals (E : Entity_Id) is
Formal : Entity_Id;
begin
if Is_Generic_Subprogram (E) then
Formal := First_Entity (E);
while Present (Formal)
and then not Is_Formal (Formal)
loop
Next_Entity (Formal);
end loop;
elsif Ekind (E) in Access_Subprogram_Kind then
Formal := First_Formal (Designated_Type (E));
else
Formal := First_Formal (E);
end if;
while Present (Formal) loop
if Ekind (Formal) = E_In_Parameter then
if Nkind (Parameter_Type (Parent (Formal))) = N_Access_Definition
then
Generate_Reference (E, Formal, '^', False);
else
Generate_Reference (E, Formal, '>', False);
end if;
elsif Ekind (Formal) = E_In_Out_Parameter then
Generate_Reference (E, Formal, '=', False);
else
Generate_Reference (E, Formal, '<', False);
end if;
Next_Formal (Formal);
end loop;
end Generate_Reference_To_Formals;
-------------------------------------------
-- Generate_Reference_To_Generic_Formals --
-------------------------------------------
procedure Generate_Reference_To_Generic_Formals (E : Entity_Id) is
Formal : Entity_Id;
begin
Formal := First_Entity (E);
while Present (Formal) loop
if Comes_From_Source (Formal) then
Generate_Reference (E, Formal, 'z', False);
end if;
Next_Entity (Formal);
end loop;
end Generate_Reference_To_Generic_Formals;
-------------
-- Get_Key --
-------------
function Get_Key (E : Xref_Entry_Number) return Xref_Entry_Number is
begin
return E;
end Get_Key;
----------------------------
-- Has_Deferred_Reference --
----------------------------
function Has_Deferred_Reference (Ent : Entity_Id) return Boolean is
begin
for J in Deferred_References.First .. Deferred_References.Last loop
if Deferred_References.Table (J).E = Ent then
return True;
end if;
end loop;
return False;
end Has_Deferred_Reference;
----------
-- Hash --
----------
function Hash (F : Xref_Entry_Number) return Header_Num is
-- It is unlikely to have two references to the same entity at the same
-- source location, so the hash function depends only on the Ent and Loc
-- fields.
XE : Xref_Entry renames Xrefs.Table (F);
type M is mod 2**32;
H : constant M := M (XE.Key.Ent) + 2 ** 7 * M (abs XE.Key.Loc);
-- It would be more natural to write:
--
-- H : constant M := M'Mod (XE.Key.Ent) + 2**7 * M'Mod (XE.Key.Loc);
--
-- But we can't use M'Mod, because it prevents bootstrapping with older
-- compilers. Loc can be negative, so we do "abs" before converting.
-- One day this can be cleaned up ???
begin
return Header_Num (H mod Num_Buckets);
end Hash;
-----------------
-- HT_Set_Next --
-----------------
procedure HT_Set_Next (E : Xref_Entry_Number; Next : Xref_Entry_Number) is
begin
Xrefs.Table (E).HTable_Next := Next;
end HT_Set_Next;
-------------
-- HT_Next --
-------------
function HT_Next (E : Xref_Entry_Number) return Xref_Entry_Number is
begin
return Xrefs.Table (E).HTable_Next;
end HT_Next;
----------------
-- Initialize --
----------------
procedure Initialize is
begin
Xrefs.Init;
end Initialize;
--------
-- Lt --
--------
function Lt (T1, T2 : Xref_Entry) return Boolean is
begin
-- First test: if entity is in different unit, sort by unit
if T1.Key.Eun /= T2.Key.Eun then
return Dependency_Num (T1.Key.Eun) < Dependency_Num (T2.Key.Eun);
-- Second test: within same unit, sort by entity Sloc
elsif T1.Def /= T2.Def then
return T1.Def < T2.Def;
-- Third test: sort definitions ahead of references
elsif T1.Key.Loc = No_Location then
return True;
elsif T2.Key.Loc = No_Location then
return False;
-- Fourth test: for same entity, sort by reference location unit
elsif T1.Key.Lun /= T2.Key.Lun then
return Dependency_Num (T1.Key.Lun) < Dependency_Num (T2.Key.Lun);
-- Fifth test: order of location within referencing unit
elsif T1.Key.Loc /= T2.Key.Loc then
return T1.Key.Loc < T2.Key.Loc;
-- Finally, for two locations at the same address, we prefer
-- the one that does NOT have the type 'r' so that a modification
-- or extension takes preference, when there are more than one
-- reference at the same location. As a result, in the case of
-- entities that are in-out actuals, the read reference follows
-- the modify reference.
else
return T2.Key.Typ = 'r';
end if;
end Lt;
-----------------------
-- Output_References --
-----------------------
procedure Output_References is
procedure Get_Type_Reference
(Ent : Entity_Id;
Tref : out Entity_Id;
Left : out Character;
Right : out Character);
-- Given an Entity_Id Ent, determines whether a type reference is
-- required. If so, Tref is set to the entity for the type reference
-- and Left and Right are set to the left/right brackets to be output
-- for the reference. If no type reference is required, then Tref is
-- set to Empty, and Left/Right are set to space.
procedure Output_Import_Export_Info (Ent : Entity_Id);
-- Output language and external name information for an interfaced
-- entity, using the format <language, external_name>.
------------------------
-- Get_Type_Reference --
------------------------
procedure Get_Type_Reference
(Ent : Entity_Id;
Tref : out Entity_Id;
Left : out Character;
Right : out Character)
is
Sav : Entity_Id;
begin
-- See if we have a type reference
Tref := Ent;
Left := '{';
Right := '}';
loop
Sav := Tref;
-- Processing for types
if Is_Type (Tref) then
-- Case of base type
if Base_Type (Tref) = Tref then
-- If derived, then get first subtype
if Tref /= Etype (Tref) then
Tref := First_Subtype (Etype (Tref));
-- Set brackets for derived type, but don't override
-- pointer case since the fact that something is a
-- pointer is more important.
if Left /= '(' then
Left := '<';
Right := '>';
end if;
-- If the completion of a private type is itself a derived
-- type, we need the parent of the full view.
elsif Is_Private_Type (Tref)
and then Present (Full_View (Tref))
and then Etype (Full_View (Tref)) /= Full_View (Tref)
then
Tref := Etype (Full_View (Tref));
if Left /= '(' then
Left := '<';
Right := '>';
end if;
-- If non-derived pointer, get directly designated type.
-- If the type has a full view, all references are on the
-- partial view that is seen first.
elsif Is_Access_Type (Tref) then
Tref := Directly_Designated_Type (Tref);
Left := '(';
Right := ')';
elsif Is_Private_Type (Tref)
and then Present (Full_View (Tref))
then
if Is_Access_Type (Full_View (Tref)) then
Tref := Directly_Designated_Type (Full_View (Tref));
Left := '(';
Right := ')';
-- If the full view is an array type, we also retrieve
-- the corresponding component type, because the ali
-- entry already indicates that this is an array.
elsif Is_Array_Type (Full_View (Tref)) then
Tref := Component_Type (Full_View (Tref));
Left := '(';
Right := ')';
end if;
-- If non-derived array, get component type. Skip component
-- type for case of String or Wide_String, saves worthwhile
-- space.
elsif Is_Array_Type (Tref)
and then Tref /= Standard_String
and then Tref /= Standard_Wide_String
then
Tref := Component_Type (Tref);
Left := '(';
Right := ')';
-- For other non-derived base types, nothing
else
exit;
end if;
-- For a subtype, go to ancestor subtype
else
Tref := Ancestor_Subtype (Tref);
-- If no ancestor subtype, go to base type
if No (Tref) then
Tref := Base_Type (Sav);
end if;
end if;
-- For objects, functions, enum literals, just get type from
-- Etype field.
elsif Is_Object (Tref)
or else Ekind (Tref) = E_Enumeration_Literal
or else Ekind (Tref) = E_Function
or else Ekind (Tref) = E_Operator
then
Tref := Etype (Tref);
-- Another special case: an object of a classwide type
-- initialized with a tag-indeterminate call gets a subtype
-- of the classwide type during expansion. See if the original
-- type in the declaration is named, and return it instead
-- of going to the root type. The expression may be a class-
-- wide function call whose result is on the secondary stack,
-- which forces the declaration to be rewritten as a renaming,
-- so examine the source declaration.
if Ekind (Tref) = E_Class_Wide_Subtype then
declare
Decl : constant Node_Id := Original_Node (Parent (Ent));
begin
if Nkind (Decl) = N_Object_Declaration
and then Is_Entity_Name
(Original_Node (Object_Definition (Decl)))
then
Tref :=
Entity (Original_Node (Object_Definition (Decl)));
end if;
end;
-- For a function that returns a class-wide type, Tref is
-- already correct.
elsif Is_Overloadable (Ent)
and then Is_Class_Wide_Type (Tref)
then
return;
end if;
-- For anything else, exit
else
exit;
end if;
-- Exit if no type reference, or we are stuck in some loop trying
-- to find the type reference, or if the type is standard void
-- type (the latter is an implementation artifact that should not
-- show up in the generated cross-references).
exit when No (Tref)
or else Tref = Sav
or else Tref = Standard_Void_Type;
-- If we have a usable type reference, return, otherwise keep
-- looking for something useful (we are looking for something
-- that either comes from source or standard)
if Sloc (Tref) = Standard_Location
or else Comes_From_Source (Tref)
then
-- If the reference is a subtype created for a generic actual,
-- go actual directly, the inner subtype is not user visible.
if Nkind (Parent (Tref)) = N_Subtype_Declaration
and then not Comes_From_Source (Parent (Tref))
and then
(Is_Wrapper_Package (Scope (Tref))
or else Is_Generic_Instance (Scope (Tref)))
then
Tref := First_Subtype (Base_Type (Tref));
end if;
return;
end if;
end loop;
-- If we fall through the loop, no type reference
Tref := Empty;
Left := ' ';
Right := ' ';
end Get_Type_Reference;
-------------------------------
-- Output_Import_Export_Info --
-------------------------------
procedure Output_Import_Export_Info (Ent : Entity_Id) is
Language_Name : Name_Id;
Conv : constant Convention_Id := Convention (Ent);
begin
-- Generate language name from convention
if Conv = Convention_C or else Conv in Convention_C_Variadic then
Language_Name := Name_C;
elsif Conv = Convention_CPP then
Language_Name := Name_CPP;
elsif Conv = Convention_Ada then
Language_Name := Name_Ada;
else
-- For the moment we ignore all other cases ???
return;
end if;
Write_Info_Char ('<');
Get_Unqualified_Name_String (Language_Name);
for J in 1 .. Name_Len loop
Write_Info_Char (Name_Buffer (J));
end loop;
if Present (Interface_Name (Ent)) then
Write_Info_Char (',');
String_To_Name_Buffer (Strval (Interface_Name (Ent)));
for J in 1 .. Name_Len loop
Write_Info_Char (Name_Buffer (J));
end loop;
end if;
Write_Info_Char ('>');
end Output_Import_Export_Info;
-- Start of processing for Output_References
begin
-- First we add references to the primitive operations of tagged types
-- declared in the main unit.
Handle_Prim_Ops : declare
Ent : Entity_Id;
begin
for J in 1 .. Xrefs.Last loop
Ent := Xrefs.Table (J).Key.Ent;
if Is_Type (Ent)
and then Is_Tagged_Type (Ent)
and then Is_Base_Type (Ent)
and then In_Extended_Main_Source_Unit (Ent)
then
Generate_Prim_Op_References (Ent);
end if;
end loop;
end Handle_Prim_Ops;
-- Before we go ahead and output the references we have a problem
-- that needs dealing with. So far we have captured things that are
-- definitely referenced by the main unit, or defined in the main
-- unit. That's because we don't want to clutter up the ali file
-- for this unit with definition lines for entities in other units
-- that are not referenced.
-- But there is a glitch. We may reference an entity in another unit,
-- and it may have a type reference to an entity that is not directly
-- referenced in the main unit, which may mean that there is no xref
-- entry for this entity yet in the list of references.
-- If we don't do something about this, we will end with an orphan type
-- reference, i.e. it will point to an entity that does not appear
-- within the generated references in the ali file. That is not good for
-- tools using the xref information.
-- To fix this, we go through the references adding definition entries
-- for any unreferenced entities that can be referenced in a type
-- reference. There is a recursion problem here, and that is dealt with
-- by making sure that this traversal also traverses any entries that
-- get added by the traversal.
Handle_Orphan_Type_References : declare
J : Nat;
Tref : Entity_Id;
Ent : Entity_Id;
L, R : Character;
pragma Warnings (Off, L);
pragma Warnings (Off, R);
procedure New_Entry (E : Entity_Id);
-- Make an additional entry into the Xref table for a type entity
-- that is related to the current entity (parent, type ancestor,
-- progenitor, etc.).
----------------
-- New_Entry --
----------------
procedure New_Entry (E : Entity_Id) is
begin
pragma Assert (Present (E));
if not Has_Xref_Entry (Implementation_Base_Type (E))
and then Sloc (E) > No_Location
then
Add_Entry
((Ent => E,
Loc => No_Location,
Typ => Character'First,
Eun => Get_Source_Unit (Original_Location (Sloc (E))),
Lun => No_Unit,
Ref_Scope => Empty,
Ent_Scope => Empty),
Ent_Scope_File => No_Unit);
end if;
end New_Entry;
-- Start of processing for Handle_Orphan_Type_References
begin
-- Note that this is not a for loop for a very good reason. The
-- processing of items in the table can add new items to the table,
-- and they must be processed as well.
J := 1;
while J <= Xrefs.Last loop
Ent := Xrefs.Table (J).Key.Ent;
-- Do not generate reference information for an ignored Ghost
-- entity because neither the entity nor its references will
-- appear in the final tree.
if Is_Ignored_Ghost_Entity (Ent) then
goto Orphan_Continue;
end if;
Get_Type_Reference (Ent, Tref, L, R);
if Present (Tref)
and then not Has_Xref_Entry (Tref)
and then Sloc (Tref) > No_Location
then
New_Entry (Tref);
if Is_Record_Type (Ent)
and then Present (Interfaces (Ent))
then
-- Add an entry for each one of the given interfaces
-- implemented by type Ent.
declare
Elmt : Elmt_Id := First_Elmt (Interfaces (Ent));
begin
while Present (Elmt) loop
New_Entry (Node (Elmt));
Next_Elmt (Elmt);
end loop;
end;
end if;
end if;
-- Collect inherited primitive operations that may be declared in
-- another unit and have no visible reference in the current one.
if Is_Type (Ent)
and then Is_Tagged_Type (Ent)
and then Is_Derived_Type (Ent)
and then Is_Base_Type (Ent)
and then In_Extended_Main_Source_Unit (Ent)
then
declare
Op_List : constant Elist_Id := Primitive_Operations (Ent);
Op : Elmt_Id;
Prim : Entity_Id;
function Parent_Op (E : Entity_Id) return Entity_Id;
-- Find original operation, which may be inherited through
-- several derivations.
function Parent_Op (E : Entity_Id) return Entity_Id is
Orig_Op : constant Entity_Id := Alias (E);
begin
if No (Orig_Op) then
return Empty;
elsif not Comes_From_Source (E)
and then not Has_Xref_Entry (Orig_Op)
and then Comes_From_Source (Orig_Op)
then
return Orig_Op;
else
return Parent_Op (Orig_Op);
end if;
end Parent_Op;
begin
Op := First_Elmt (Op_List);
while Present (Op) loop
Prim := Parent_Op (Node (Op));
if Present (Prim) then
Add_Entry
((Ent => Prim,
Loc => No_Location,
Typ => Character'First,
Eun => Get_Source_Unit (Sloc (Prim)),
Lun => No_Unit,
Ref_Scope => Empty,
Ent_Scope => Empty),
Ent_Scope_File => No_Unit);
end if;
Next_Elmt (Op);
end loop;
end;
end if;
<<Orphan_Continue>>
J := J + 1;
end loop;
end Handle_Orphan_Type_References;
-- Now we have all the references, including those for any embedded type
-- references, so we can sort them, and output them.
Output_Refs : declare
Nrefs : constant Nat := Xrefs.Last;
-- Number of references in table
Rnums : array (0 .. Nrefs) of Nat;
-- This array contains numbers of references in the Xrefs table.
-- This list is sorted in output order. The extra 0'th entry is
-- convenient for the call to sort. When we sort the table, we
-- move the entries in Rnums around, but we do not move the
-- original table entries.
Curxu : Unit_Number_Type;
-- Current xref unit
Curru : Unit_Number_Type;
-- Current reference unit for one entity
Curent : Entity_Id;
-- Current entity
Curnam : String (1 .. Name_Buffer'Length);
Curlen : Natural;
-- Simple name and length of current entity
Curdef : Source_Ptr;
-- Original source location for current entity
Crloc : Source_Ptr;
-- Current reference location
Ctyp : Character;
-- Entity type character
Prevt : Character;
-- reference kind of previous reference
Tref : Entity_Id;
-- Type reference
Rref : Node_Id;
-- Renaming reference
Trunit : Unit_Number_Type;
-- Unit number for type reference
function Lt (Op1, Op2 : Natural) return Boolean;
-- Comparison function for Sort call
function Name_Change (X : Entity_Id) return Boolean;
-- Determines if entity X has a different simple name from Curent
procedure Move (From : Natural; To : Natural);
-- Move procedure for Sort call
package Sorting is new GNAT.Heap_Sort_G (Move, Lt);
--------
-- Lt --
--------
function Lt (Op1, Op2 : Natural) return Boolean is
T1 : Xref_Entry renames Xrefs.Table (Rnums (Nat (Op1)));
T2 : Xref_Entry renames Xrefs.Table (Rnums (Nat (Op2)));
begin
return Lt (T1, T2);
end Lt;
----------
-- Move --
----------
procedure Move (From : Natural; To : Natural) is
begin
Rnums (Nat (To)) := Rnums (Nat (From));
end Move;
-----------------
-- Name_Change --
-----------------
-- Why a string comparison here??? Why not compare Name_Id values???
function Name_Change (X : Entity_Id) return Boolean is
begin
Get_Unqualified_Name_String (Chars (X));
if Name_Len /= Curlen then
return True;
else
return Name_Buffer (1 .. Curlen) /= Curnam (1 .. Curlen);
end if;
end Name_Change;
-- Start of processing for Output_Refs
begin
-- Capture the definition Sloc values. We delay doing this till now,
-- since at the time the reference or definition is made, private
-- types may be swapped, and the Sloc value may be incorrect. We
-- also set up the pointer vector for the sort.
-- For user-defined operators we need to skip the initial quote and
-- point to the first character of the name, for navigation purposes.
for J in 1 .. Nrefs loop
declare
E : constant Entity_Id := Xrefs.Table (J).Key.Ent;
Loc : constant Source_Ptr := Original_Location (Sloc (E));
begin
Rnums (J) := J;
if Nkind (E) = N_Defining_Operator_Symbol then
Xrefs.Table (J).Def := Loc + 1;
else
Xrefs.Table (J).Def := Loc;
end if;
end;
end loop;
-- Sort the references
Sorting.Sort (Integer (Nrefs));
-- Initialize loop through references
Curxu := No_Unit;
Curent := Empty;
Curdef := No_Location;
Curru := No_Unit;
Crloc := No_Location;
Prevt := 'm';
-- Loop to output references
for Refno in 1 .. Nrefs loop
Output_One_Ref : declare
Ent : Entity_Id;
XE : Xref_Entry renames Xrefs.Table (Rnums (Refno));
-- The current entry to be accessed
Left : Character;
Right : Character;
-- Used for {} or <> or () for type reference
procedure Check_Type_Reference
(Ent : Entity_Id;
List_Interface : Boolean;
Is_Component : Boolean := False);
-- Find whether there is a meaningful type reference for
-- Ent, and display it accordingly. If List_Interface is
-- true, then Ent is a progenitor interface of the current
-- type entity being listed. In that case list it as is,
-- without looking for a type reference for it. Flag is also
-- used for index types of an array type, where the caller
-- supplies the intended type reference. Is_Component serves
-- the same purpose, to display the component type of a
-- derived array type, for which only the parent type has
-- ben displayed so far.
procedure Output_Instantiation_Refs (Loc : Source_Ptr);
-- Recursive procedure to output instantiation references for
-- the given source ptr in [file|line[...]] form. No output
-- if the given location is not a generic template reference.
procedure Output_Overridden_Op (Old_E : Entity_Id);
-- For a subprogram that is overriding, display information
-- about the inherited operation that it overrides.
--------------------------
-- Check_Type_Reference --
--------------------------
procedure Check_Type_Reference
(Ent : Entity_Id;
List_Interface : Boolean;
Is_Component : Boolean := False)
is
begin
if List_Interface then
-- This is a progenitor interface of the type for which
-- xref information is being generated.
Tref := Ent;
Left := '<';
Right := '>';
-- The following is not documented in lib-xref.ads ???
elsif Is_Component then
Tref := Ent;
Left := '(';
Right := ')';
else
Get_Type_Reference (Ent, Tref, Left, Right);
end if;
if Present (Tref) then
-- Case of standard entity, output name
if Sloc (Tref) = Standard_Location then
Write_Info_Char (Left);
Write_Info_Name (Chars (Tref));
Write_Info_Char (Right);
-- Case of source entity, output location
else
Write_Info_Char (Left);
Trunit := Get_Source_Unit (Sloc (Tref));
if Trunit /= Curxu then
Write_Info_Nat (Dependency_Num (Trunit));
Write_Info_Char ('|');
end if;
Write_Info_Nat
(Int (Get_Logical_Line_Number (Sloc (Tref))));
declare
Ent : Entity_Id;
Ctyp : Character;
begin
Ent := Tref;
Ctyp := Xref_Entity_Letters (Ekind (Ent));
if Ctyp = '+'
and then Present (Full_View (Ent))
then
Ent := Underlying_Type (Ent);
if Present (Ent) then
Ctyp := Xref_Entity_Letters (Ekind (Ent));
end if;
end if;
Write_Info_Char (Ctyp);
end;
Write_Info_Nat
(Int (Get_Column_Number (Sloc (Tref))));
-- If the type comes from an instantiation, add the
-- corresponding info.
Output_Instantiation_Refs (Sloc (Tref));
Write_Info_Char (Right);
end if;
end if;
end Check_Type_Reference;
-------------------------------
-- Output_Instantiation_Refs --
-------------------------------
procedure Output_Instantiation_Refs (Loc : Source_Ptr) is
Iloc : constant Source_Ptr := Instantiation_Location (Loc);
Lun : Unit_Number_Type;
Cu : constant Unit_Number_Type := Curru;
begin
-- Nothing to do if this is not an instantiation
if Iloc = No_Location then
return;
end if;
-- Output instantiation reference
Write_Info_Char ('[');
Lun := Get_Source_Unit (Iloc);
if Lun /= Curru then
Curru := Lun;
Write_Info_Nat (Dependency_Num (Curru));
Write_Info_Char ('|');
end if;
Write_Info_Nat (Int (Get_Logical_Line_Number (Iloc)));
-- Recursive call to get nested instantiations
Output_Instantiation_Refs (Iloc);
-- Output final ] after call to get proper nesting
Write_Info_Char (']');
Curru := Cu;
return;
end Output_Instantiation_Refs;
--------------------------
-- Output_Overridden_Op --
--------------------------
procedure Output_Overridden_Op (Old_E : Entity_Id) is
Op : Entity_Id;
begin
-- The overridden operation has an implicit declaration
-- at the point of derivation. What we want to display
-- is the original operation, which has the actual body
-- (or abstract declaration) that is being overridden.
-- The overridden operation is not always set, e.g. when
-- it is a predefined operator.
if No (Old_E) then
return;
-- Follow alias chain if one is present
elsif Present (Alias (Old_E)) then
-- The subprogram may have been implicitly inherited
-- through several levels of derivation, so find the
-- ultimate (source) ancestor.
Op := Ultimate_Alias (Old_E);
-- Normal case of no alias present. We omit generated
-- primitives like tagged equality, that have no source
-- representation.
else
Op := Old_E;
end if;
if Present (Op)
and then Sloc (Op) /= Standard_Location
and then Comes_From_Source (Op)
then
declare
Loc : constant Source_Ptr := Sloc (Op);
Par_Unit : constant Unit_Number_Type :=
Get_Source_Unit (Loc);
begin
Write_Info_Char ('<');
if Par_Unit /= Curxu then
Write_Info_Nat (Dependency_Num (Par_Unit));
Write_Info_Char ('|');
end if;
Write_Info_Nat (Int (Get_Logical_Line_Number (Loc)));
Write_Info_Char ('p');
Write_Info_Nat (Int (Get_Column_Number (Loc)));
Write_Info_Char ('>');
end;
end if;
end Output_Overridden_Op;
-- Start of processing for Output_One_Ref
begin
Ent := XE.Key.Ent;
-- Do not generate reference information for an ignored Ghost
-- entity because neither the entity nor its references will
-- appear in the final tree.
if Is_Ignored_Ghost_Entity (Ent) then
goto Continue;
end if;
Ctyp := Xref_Entity_Letters (Ekind (Ent));
-- Skip reference if it is the only reference to an entity,
-- and it is an END line reference, and the entity is not in
-- the current extended source. This prevents junk entries
-- consisting only of packages with END lines, where no
-- entity from the package is actually referenced.
if XE.Key.Typ = 'e'
and then Ent /= Curent
and then (Refno = Nrefs
or else
Ent /= Xrefs.Table (Rnums (Refno + 1)).Key.Ent)
and then not In_Extended_Main_Source_Unit (Ent)
then
goto Continue;
end if;
-- For private type, get full view type
if Ctyp = '+'
and then Present (Full_View (XE.Key.Ent))
then
Ent := Underlying_Type (Ent);
if Present (Ent) then
Ctyp := Xref_Entity_Letters (Ekind (Ent));
end if;
end if;
-- Special exception for Boolean
if Ctyp = 'E' and then Is_Boolean_Type (Ent) then
Ctyp := 'B';
end if;
-- For variable reference, get corresponding type
if Ctyp = '*' then
Ent := Etype (XE.Key.Ent);
Ctyp := Fold_Lower (Xref_Entity_Letters (Ekind (Ent)));
-- If variable is private type, get full view type
if Ctyp = '+'
and then Present (Full_View (Etype (XE.Key.Ent)))
then
Ent := Underlying_Type (Etype (XE.Key.Ent));
if Present (Ent) then
Ctyp := Fold_Lower (Xref_Entity_Letters (Ekind (Ent)));
end if;
elsif Is_Generic_Type (Ent) then
-- If the type of the entity is a generic private type,
-- there is no usable full view, so retain the indication
-- that this is an object.
Ctyp := '*';
end if;
-- Special handling for access parameters and objects and
-- components of an anonymous access type.
if Ekind (Etype (XE.Key.Ent)) in
E_Anonymous_Access_Type
| E_Anonymous_Access_Subprogram_Type
| E_Anonymous_Access_Protected_Subprogram_Type
then
if Is_Formal (XE.Key.Ent)
or else
Ekind (XE.Key.Ent) in
E_Variable | E_Constant | E_Component
then
Ctyp := 'p';
end if;
-- Special handling for Boolean
elsif Ctyp = 'e' and then Is_Boolean_Type (Ent) then
Ctyp := 'b';
end if;
end if;
-- Special handling for abstract types and operations
if Is_Overloadable (XE.Key.Ent)
and then Is_Abstract_Subprogram (XE.Key.Ent)
then
if Ctyp = 'U' then
Ctyp := 'x'; -- Abstract procedure
elsif Ctyp = 'V' then
Ctyp := 'y'; -- Abstract function
end if;
elsif Is_Type (XE.Key.Ent)
and then Is_Abstract_Type (XE.Key.Ent)
then
if Is_Interface (XE.Key.Ent) then
Ctyp := 'h';
elsif Ctyp = 'R' then
Ctyp := 'H'; -- Abstract type
end if;
end if;
-- Only output reference if interesting type of entity
if Ctyp = ' '
-- Suppress references to object definitions, used for local
-- references.
or else XE.Key.Typ = 'D'
or else XE.Key.Typ = 'I'
-- Suppress self references, except for bodies that act as
-- specs.
or else (XE.Key.Loc = XE.Def
and then
(XE.Key.Typ /= 'b'
or else not Is_Subprogram (XE.Key.Ent)))
-- Also suppress definitions of body formals (we only
-- treat these as references, and the references were
-- separately recorded).
or else (Is_Formal (XE.Key.Ent)
and then Present (Spec_Entity (XE.Key.Ent)))
then
null;
else
-- Start new Xref section if new xref unit
if XE.Key.Eun /= Curxu then
if Write_Info_Col > 1 then
Write_Info_EOL;
end if;
Curxu := XE.Key.Eun;
Write_Info_Initiate ('X');
Write_Info_Char (' ');
Write_Info_Nat (Dependency_Num (XE.Key.Eun));
Write_Info_Char (' ');
Write_Info_Name
(Reference_Name (Source_Index (XE.Key.Eun)));
end if;
-- Start new Entity line if new entity. Note that we
-- consider two entities the same if they have the same
-- name and source location. This causes entities in
-- instantiations to be treated as though they referred
-- to the template.
if No (Curent)
or else
(XE.Key.Ent /= Curent
and then
(Name_Change (XE.Key.Ent) or else XE.Def /= Curdef))
then
Curent := XE.Key.Ent;
Curdef := XE.Def;
Get_Unqualified_Name_String (Chars (XE.Key.Ent));
Curlen := Name_Len;
Curnam (1 .. Curlen) := Name_Buffer (1 .. Curlen);
if Write_Info_Col > 1 then
Write_Info_EOL;
end if;
-- Write column number information
Write_Info_Nat (Int (Get_Logical_Line_Number (XE.Def)));
Write_Info_Char (Ctyp);
Write_Info_Nat (Int (Get_Column_Number (XE.Def)));
-- Write level information
Write_Level_Info : declare
function Is_Visible_Generic_Entity
(E : Entity_Id) return Boolean;
-- Check whether E is declared in the visible part
-- of a generic package. For source navigation
-- purposes, treat this as a visible entity.
function Is_Private_Record_Component
(E : Entity_Id) return Boolean;
-- Check whether E is a non-inherited component of a
-- private extension. Even if the enclosing record is
-- public, we want to treat the component as private
-- for navigation purposes.
---------------------------------
-- Is_Private_Record_Component --
---------------------------------
function Is_Private_Record_Component
(E : Entity_Id) return Boolean
is
S : constant Entity_Id := Scope (E);
begin
return
Ekind (E) = E_Component
and then Nkind (Declaration_Node (S)) =
N_Private_Extension_Declaration
and then Original_Record_Component (E) = E;
end Is_Private_Record_Component;
-------------------------------
-- Is_Visible_Generic_Entity --
-------------------------------
function Is_Visible_Generic_Entity
(E : Entity_Id) return Boolean
is
Par : Node_Id;
begin
-- The Present check here is an error defense
if Present (Scope (E))
and then Ekind (Scope (E)) /= E_Generic_Package
then
return False;
end if;
Par := Parent (E);
while Present (Par) loop
if
Nkind (Par) = N_Generic_Package_Declaration
then
-- Entity is a generic formal
return False;
elsif
Nkind (Parent (Par)) = N_Package_Specification
then
return
Is_List_Member (Par)
and then List_Containing (Par) =
Visible_Declarations (Parent (Par));
else
Par := Parent (Par);
end if;
end loop;
return False;
end Is_Visible_Generic_Entity;
-- Start of processing for Write_Level_Info
begin
if Is_Hidden (Curent)
or else Is_Private_Record_Component (Curent)
then
Write_Info_Char (' ');
elsif
Is_Public (Curent)
or else Is_Visible_Generic_Entity (Curent)
then
Write_Info_Char ('*');
else
Write_Info_Char (' ');
end if;
end Write_Level_Info;
-- Output entity name. We use the occurrence from the
-- actual source program at the definition point.
declare
Ent_Name : constant String :=
Exact_Source_Name (Sloc (XE.Key.Ent));
begin
for C in Ent_Name'Range loop
Write_Info_Char (Ent_Name (C));
end loop;
end;
-- See if we have a renaming reference
if Is_Object (XE.Key.Ent)
and then Present (Renamed_Object (XE.Key.Ent))
then
Rref := Renamed_Object (XE.Key.Ent);
elsif Is_Overloadable (XE.Key.Ent)
and then Nkind (Parent (Declaration_Node (XE.Key.Ent)))
= N_Subprogram_Renaming_Declaration
then
Rref := Name (Parent (Declaration_Node (XE.Key.Ent)));
elsif Ekind (XE.Key.Ent) = E_Package
and then Nkind (Declaration_Node (XE.Key.Ent)) =
N_Package_Renaming_Declaration
then
Rref := Name (Declaration_Node (XE.Key.Ent));
else
Rref := Empty;
end if;
if Present (Rref) then
if Nkind (Rref) = N_Expanded_Name then
Rref := Selector_Name (Rref);
end if;
if Nkind (Rref) = N_Identifier
or else Nkind (Rref) = N_Operator_Symbol
then
null;
-- For renamed array components, use the array name
-- for the renamed entity, which reflect the fact that
-- in general the whole array is aliased.
elsif Nkind (Rref) = N_Indexed_Component then
if Nkind (Prefix (Rref)) = N_Identifier then
Rref := Prefix (Rref);
elsif Nkind (Prefix (Rref)) = N_Expanded_Name then
Rref := Selector_Name (Prefix (Rref));
else
Rref := Empty;
end if;
else
Rref := Empty;
end if;
end if;
-- Write out renaming reference if we have one
if Present (Rref) then
Write_Info_Char ('=');
Write_Info_Nat
(Int (Get_Logical_Line_Number (Sloc (Rref))));
Write_Info_Char (':');
Write_Info_Nat
(Int (Get_Column_Number (Sloc (Rref))));
end if;
-- Indicate that the entity is in the unit of the current
-- xref section.
Curru := Curxu;
-- Write out information about generic parent, if entity
-- is an instance.
if Is_Generic_Instance (XE.Key.Ent) then
declare
Gen_Par : constant Entity_Id :=
Generic_Parent
(Specification
(Unit_Declaration_Node
(XE.Key.Ent)));
Loc : constant Source_Ptr := Sloc (Gen_Par);
Gen_U : constant Unit_Number_Type :=
Get_Source_Unit (Loc);
begin
Write_Info_Char ('[');
if Curru /= Gen_U then
Write_Info_Nat (Dependency_Num (Gen_U));
Write_Info_Char ('|');
end if;
Write_Info_Nat
(Int (Get_Logical_Line_Number (Loc)));
Write_Info_Char (']');
end;
end if;
-- See if we have a type reference and if so output
Check_Type_Reference (XE.Key.Ent, False);
-- Additional information for types with progenitors,
-- including synchronized tagged types.
declare
Typ : constant Entity_Id := XE.Key.Ent;
Elmt : Elmt_Id;
begin
if Is_Record_Type (Typ)
and then Present (Interfaces (Typ))
then
Elmt := First_Elmt (Interfaces (Typ));
elsif Is_Concurrent_Type (Typ)
and then Present (Corresponding_Record_Type (Typ))
and then Present (
Interfaces (Corresponding_Record_Type (Typ)))
then
Elmt :=
First_Elmt (
Interfaces (Corresponding_Record_Type (Typ)));
else
Elmt := No_Elmt;
end if;
while Present (Elmt) loop
Check_Type_Reference (Node (Elmt), True);
Next_Elmt (Elmt);
end loop;
end;
-- For array types, list index types as well. (This is
-- not C, indexes have distinct types).
if Is_Array_Type (XE.Key.Ent) then
declare
A_Typ : constant Entity_Id := XE.Key.Ent;
Indx : Node_Id;
begin
-- If this is a derived array type, we have
-- output the parent type, so add the component
-- type now.
if Is_Derived_Type (A_Typ) then
Check_Type_Reference
(Component_Type (A_Typ), False, True);
end if;
-- Add references to index types.
Indx := First_Index (XE.Key.Ent);
while Present (Indx) loop
Check_Type_Reference
(First_Subtype (Etype (Indx)), True);
Next_Index (Indx);
end loop;
end;
end if;
-- If the entity is an overriding operation, write info
-- on operation that was overridden.
if Is_Subprogram (XE.Key.Ent)
and then Present (Overridden_Operation (XE.Key.Ent))
then
Output_Overridden_Op
(Overridden_Operation (XE.Key.Ent));
end if;
-- End of processing for entity output
Crloc := No_Location;
end if;
-- Output the reference if it is not as the same location
-- as the previous one, or it is a read-reference that
-- indicates that the entity is an in-out actual in a call.
if XE.Key.Loc /= No_Location
and then
(XE.Key.Loc /= Crloc
or else (Prevt = 'm' and then XE.Key.Typ = 'r'))
then
Crloc := XE.Key.Loc;
Prevt := XE.Key.Typ;
-- Start continuation if line full, else blank
if Write_Info_Col > 72 then
Write_Info_EOL;
Write_Info_Initiate ('.');
end if;
Write_Info_Char (' ');
-- Output file number if changed
if XE.Key.Lun /= Curru then
Curru := XE.Key.Lun;
Write_Info_Nat (Dependency_Num (Curru));
Write_Info_Char ('|');
end if;
Write_Info_Nat
(Int (Get_Logical_Line_Number (XE.Key.Loc)));
Write_Info_Char (XE.Key.Typ);
if Is_Overloadable (XE.Key.Ent) then
if (Is_Imported (XE.Key.Ent) and then XE.Key.Typ = 'b')
or else
(Is_Exported (XE.Key.Ent) and then XE.Key.Typ = 'i')
then
Output_Import_Export_Info (XE.Key.Ent);
end if;
end if;
Write_Info_Nat (Int (Get_Column_Number (XE.Key.Loc)));
Output_Instantiation_Refs (Sloc (XE.Key.Ent));
end if;
end if;
end Output_One_Ref;
<<Continue>>
null;
end loop;
Write_Info_EOL;
end Output_Refs;
end Output_References;
---------------------------------
-- Process_Deferred_References --
---------------------------------
procedure Process_Deferred_References is
begin
for J in Deferred_References.First .. Deferred_References.Last loop
declare
D : Deferred_Reference_Entry renames Deferred_References.Table (J);
begin
case Is_LHS (D.N) is
when Yes =>
Generate_Reference (D.E, D.N, 'm');
when No =>
Generate_Reference (D.E, D.N, 'r');
-- Not clear if Unknown can occur at this stage, but if it
-- does we will treat it as a normal reference.
when Unknown =>
Generate_Reference (D.E, D.N, 'r');
end case;
end;
end loop;
-- Clear processed entries from table
Deferred_References.Init;
end Process_Deferred_References;
-- Start of elaboration for Lib.Xref
begin
-- Reset is necessary because Elmt_Ptr does not default to Null_Ptr,
-- because it's not an access type.
Xref_Set.Reset;
end Lib.Xref;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with Ada.Containers;
with Ada.Text_IO;
with WisiToken.Generate;
package body WisiToken.Generate.LR.LR1_Generate is
function LR1_Goto_Transitions
(Set : in LR1_Items.Item_Set;
Symbol : in Token_ID;
Has_Empty_Production : in Token_ID_Set;
First_Terminal_Sequence : in Token_Sequence_Arrays.Vector;
Grammar : in WisiToken.Productions.Prod_Arrays.Vector;
Descriptor : in WisiToken.Descriptor)
return LR1_Items.Item_Set
is
use all type Ada.Containers.Count_Type;
use Token_ID_Arrays;
use LR1_Items;
Goto_Set : Item_Set;
begin
for Item of Set.Set loop
if Item.Dot /= No_Index then
declare
Dot : constant Token_ID_Arrays.Cursor := Productions.Constant_Ref_RHS
(Grammar, Item.Prod).Tokens.To_Cursor (Item.Dot);
begin
if Element (Dot) = Symbol and
-- We don't need a state with dot after EOI in the
-- accept production. EOI should only appear in the
-- accept production.
Symbol /= Descriptor.EOI_ID
then
Goto_Set.Set.Insert
((Item.Prod,
To_Index (Next (Dot)),
new Token_ID_Set'(Item.Lookaheads.all)));
end if;
end;
end if;
end loop;
if Goto_Set.Set.Length > 0 then
return Closure (Goto_Set, Has_Empty_Production, First_Terminal_Sequence, Grammar, Descriptor);
else
return Goto_Set;
end if;
end LR1_Goto_Transitions;
function LR1_Item_Sets
(Has_Empty_Production : in Token_ID_Set;
First_Terminal_Sequence : in Token_Sequence_Arrays.Vector;
Grammar : in WisiToken.Productions.Prod_Arrays.Vector;
Descriptor : in WisiToken.Descriptor)
return LR1_Items.Item_Set_List
is
use all type Ada.Containers.Count_Type;
-- [dragon] algorithm 4.9 pg 231; figure 4.38 pg 232; procedure
-- "items", with some optimizations.
use LR1_Items;
First_State_Index : constant State_Index := 0;
C : LR1_Items.Item_Set_List; -- result
C_Tree : LR1_Items.Item_Set_Trees.Tree; -- for fast find
States_To_Check : State_Index_Queues.Queue;
-- [dragon] specifies 'until no more items can be added', but we use
-- a queue to avoid checking unecessary states. Ada LR1 has over
-- 100,000 states, so this is a significant gain (reduced time from
-- 600 seconds to 40).
I : State_Index;
Dot_IDs : Token_ID_Arrays.Vector;
New_Item_Set : Item_Set := Closure
((Set => Item_Lists.To_List
((Prod => (Grammar.First_Index, 0),
Dot => Grammar (Grammar.First_Index).RHSs (0).Tokens.First_Index,
Lookaheads => new Token_ID_Set'(To_Lookahead (Descriptor.EOI_ID, Descriptor)))),
Goto_List => <>,
Dot_IDs => <>,
State => First_State_Index),
Has_Empty_Production, First_Terminal_Sequence, Grammar, Descriptor);
Found_State : Unknown_State_Index;
begin
C.Set_First_Last (First_State_Index, First_State_Index - 1);
Add (Grammar, New_Item_Set, C, C_Tree, Descriptor, Include_Lookaheads => True);
States_To_Check.Put (First_State_Index);
loop
exit when States_To_Check.Is_Empty;
I := States_To_Check.Get;
if Trace_Generate_Table > Outline then
Ada.Text_IO.Put ("Checking ");
Put (Grammar, Descriptor, C (I), Show_Lookaheads => True, Show_Goto_List => True);
end if;
Dot_IDs := C (I).Dot_IDs;
-- We can't iterate on C (I).Dot_IDs when the loop adds items to C;
-- it might be reallocated to grow.
for Symbol of Dot_IDs loop
-- [dragon] has 'for each grammar symbol X', but LR1_Goto_Transitions
-- rejects Symbol that is not in Dot_IDs, so we iterate over that.
New_Item_Set := LR1_Goto_Transitions
(C (I), Symbol, Has_Empty_Production, First_Terminal_Sequence, Grammar, Descriptor);
if New_Item_Set.Set.Length > 0 then -- 'goto (I, X) not empty'
Found_State := Find (New_Item_Set, C_Tree, Match_Lookaheads => True); -- 'not in C'
if Found_State = Unknown_State then
New_Item_Set.State := C.Last_Index + 1;
States_To_Check.Put (New_Item_Set.State);
Add (Grammar, New_Item_Set, C, C_Tree, Descriptor, Include_Lookaheads => True);
if Trace_Generate_Table > Outline then
Ada.Text_IO.Put_Line
(" adding state" & Unknown_State_Index'Image (C.Last_Index) & ": from state" &
Unknown_State_Index'Image (I) & " on " & Image (Symbol, Descriptor));
Put (Grammar, Descriptor, New_Item_Set, Show_Lookaheads => True);
end if;
C (I).Goto_List.Insert ((Symbol, C.Last_Index));
else
-- If there's not already a goto entry between these two sets, create one.
if not Is_In ((Symbol, Found_State), Goto_List => C (I).Goto_List) then
if Trace_Generate_Table > Outline then
Ada.Text_IO.Put_Line
(" adding goto on " & Image (Symbol, Descriptor) & " to state" &
Unknown_State_Index'Image (Found_State));
end if;
C (I).Goto_List.Insert ((Symbol, Found_State));
end if;
end if;
end if;
end loop;
end loop;
if Trace_Generate_Table > Outline then
Ada.Text_IO.New_Line;
end if;
return C;
end LR1_Item_Sets;
procedure Add_Actions
(Item_Sets : in LR1_Items.Item_Set_List;
Grammar : in WisiToken.Productions.Prod_Arrays.Vector;
Has_Empty_Production : in Token_ID_Set;
First_Nonterm_Set : in Token_Array_Token_Set;
Conflict_Counts : out Conflict_Count_Lists.List;
Conflicts : out Conflict_Lists.List;
Table : in out Parse_Table;
Descriptor : in WisiToken.Descriptor)
is
-- Add actions for all Item_Sets to Table.
begin
for Item_Set of Item_Sets loop
Add_Actions
(Item_Set, Table, Grammar, Has_Empty_Production, First_Nonterm_Set, Conflict_Counts, Conflicts, Descriptor);
end loop;
if Trace_Generate_Table > Outline then
Ada.Text_IO.New_Line;
end if;
end Add_Actions;
function Generate
(Grammar : in out WisiToken.Productions.Prod_Arrays.Vector;
Descriptor : in WisiToken.Descriptor;
Known_Conflicts : in Conflict_Lists.List := Conflict_Lists.Empty_List;
McKenzie_Param : in McKenzie_Param_Type := Default_McKenzie_Param;
Parse_Table_File_Name : in String := "";
Include_Extra : in Boolean := False;
Ignore_Conflicts : in Boolean := False;
Partial_Recursion : in Boolean := True)
return Parse_Table_Ptr
is
use type Ada.Containers.Count_Type;
Ignore_Unused_Tokens : constant Boolean := WisiToken.Trace_Generate_Table > Detail;
Ignore_Unknown_Conflicts : constant Boolean := Ignore_Conflicts or WisiToken.Trace_Generate_Table > Detail;
Unused_Tokens : constant Boolean := WisiToken.Generate.Check_Unused_Tokens (Descriptor, Grammar);
Table : Parse_Table_Ptr;
Nullable : constant Token_Array_Production_ID := WisiToken.Generate.Nullable (Grammar);
Has_Empty_Production : constant Token_ID_Set := WisiToken.Generate.Has_Empty_Production (Nullable);
Recursions : constant WisiToken.Generate.Recursions :=
(if Partial_Recursion
then WisiToken.Generate.Compute_Partial_Recursion (Grammar, Descriptor)
else WisiToken.Generate.Compute_Full_Recursion (Grammar, Descriptor));
Minimal_Terminal_Sequences : constant Minimal_Sequence_Array :=
Compute_Minimal_Terminal_Sequences (Descriptor, Grammar);
Minimal_Terminal_First : constant Token_Array_Token_ID :=
Compute_Minimal_Terminal_First (Descriptor, Minimal_Terminal_Sequences);
First_Nonterm_Set : constant Token_Array_Token_Set := WisiToken.Generate.First
(Grammar, Has_Empty_Production, Descriptor.First_Terminal);
First_Terminal_Sequence : constant Token_Sequence_Arrays.Vector :=
WisiToken.Generate.To_Terminal_Sequence_Array (First_Nonterm_Set, Descriptor);
Item_Sets : constant LR1_Items.Item_Set_List := LR1_Item_Sets
(Has_Empty_Production, First_Terminal_Sequence, Grammar, Descriptor);
Conflict_Counts : Conflict_Count_Lists.List;
Unknown_Conflicts : Conflict_Lists.List;
Known_Conflicts_Edit : Conflict_Lists.List := Known_Conflicts;
begin
if Trace_Generate_Table + Trace_Generate_Minimal_Complete > Outline then
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line ("LR1_Generate:");
if Trace_Generate_Table > Outline then
Ada.Text_IO.Put_Line ("Item_Sets:");
LR1_Items.Put (Grammar, Descriptor, Item_Sets);
end if;
end if;
Table := new Parse_Table
(State_First => Item_Sets.First_Index,
State_Last => Item_Sets.Last_Index,
First_Terminal => Descriptor.First_Terminal,
Last_Terminal => Descriptor.Last_Terminal,
First_Nonterminal => Descriptor.First_Nonterminal,
Last_Nonterminal => Descriptor.Last_Nonterminal);
if McKenzie_Param = Default_McKenzie_Param then
-- Descriminants in Default are wrong
Table.McKenzie_Param :=
(First_Terminal => Descriptor.First_Terminal,
Last_Terminal => Descriptor.Last_Terminal,
First_Nonterminal => Descriptor.First_Nonterminal,
Last_Nonterminal => Descriptor.Last_Nonterminal,
Insert => (others => 0),
Delete => (others => 0),
Push_Back => (others => 0),
Undo_Reduce => (others => 0),
Minimal_Complete_Cost_Delta => Default_McKenzie_Param.Minimal_Complete_Cost_Delta,
Fast_Forward => Default_McKenzie_Param.Fast_Forward,
Matching_Begin => Default_McKenzie_Param.Matching_Begin,
Ignore_Check_Fail => Default_McKenzie_Param.Ignore_Check_Fail,
Task_Count => Default_McKenzie_Param.Task_Count,
Check_Limit => Default_McKenzie_Param.Check_Limit,
Check_Delta_Limit => Default_McKenzie_Param.Check_Delta_Limit,
Enqueue_Limit => Default_McKenzie_Param.Enqueue_Limit);
else
Table.McKenzie_Param := McKenzie_Param;
end if;
Add_Actions
(Item_Sets, Grammar, Has_Empty_Production, First_Nonterm_Set,
Conflict_Counts, Unknown_Conflicts, Table.all, Descriptor);
for State in Table.States'Range loop
if Trace_Generate_Minimal_Complete > Extra then
Ada.Text_IO.Put_Line ("Set_Minimal_Complete_Actions:" & State_Index'Image (State));
end if;
WisiToken.Generate.LR.Set_Minimal_Complete_Actions
(Table.States (State),
LR1_Items.Filter (Item_Sets (State), Grammar, Descriptor, LR1_Items.In_Kernel'Access),
Descriptor, Grammar, Nullable, Minimal_Terminal_Sequences, Minimal_Terminal_First);
end loop;
if Parse_Table_File_Name /= "" then
WisiToken.Generate.LR.Put_Parse_Table
(Table, Parse_Table_File_Name, "LR1", Grammar, Recursions, Item_Sets, Conflict_Counts, Descriptor,
Include_Extra);
end if;
if Trace_Generate_Table > Outline then
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line ("Has_Empty_Production: " & Image (Has_Empty_Production, Descriptor));
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line ("Minimal_Terminal_First:");
for ID in Minimal_Terminal_First'Range loop
Ada.Text_IO.Put_Line
(Image (ID, Descriptor) & " =>" &
(if Minimal_Terminal_First (ID) = Invalid_Token_ID
then ""
else ' ' & Image (Minimal_Terminal_First (ID), Descriptor)));
end loop;
end if;
Delete_Known (Unknown_Conflicts, Known_Conflicts_Edit);
if Unknown_Conflicts.Length > 0 then
Ada.Text_IO.Put_Line (Ada.Text_IO.Current_Error, "unknown conflicts:");
Put (Unknown_Conflicts, Ada.Text_IO.Current_Error, Descriptor);
Ada.Text_IO.New_Line (Ada.Text_IO.Current_Error);
WisiToken.Generate.Error := WisiToken.Generate.Error or not Ignore_Unknown_Conflicts;
end if;
if Known_Conflicts_Edit.Length > 0 then
Ada.Text_IO.Put_Line (Ada.Text_IO.Current_Error, "excess known conflicts:");
Put (Known_Conflicts_Edit, Ada.Text_IO.Current_Error, Descriptor);
Ada.Text_IO.New_Line (Ada.Text_IO.Current_Error);
WisiToken.Generate.Error := WisiToken.Generate.Error or not Ignore_Unknown_Conflicts;
end if;
WisiToken.Generate.Error := WisiToken.Generate.Error or (Unused_Tokens and not Ignore_Unused_Tokens);
return Table;
end Generate;
end WisiToken.Generate.LR.LR1_Generate;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with Gnat.Io; use Gnat.Io;
procedure col is
function collatz(n1: Integer) return Integer is
c: Integer;
n: Integer;
begin
n := n1;
c := 0;
while n /= 1 loop
if n mod 2 = 0 then
n := n / 2;
else
n := n * 3 + 1;
end if;
c := c + 1;
end loop;
return c;
end;
f: Integer;
begin
f := 0;
for j in Integer range 1 .. 100 loop
for i in Integer range 1 .. 100000 loop
f := f + collatz(i);
end loop;
end loop;
Put(f);
New_Line;
end col;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with Cmd_ada;
with Test_Procs;
procedure Example_App is
begin
Cmd_ada.Register_Command
(Command_String => "test1", Command_Cb => Test_Procs.Test1'Access,
Description => "Just a test");
Cmd_ada.Register_Command
(Command_String => "test2", Command_Cb => Test_Procs.Test1'Access,
Description => "Second test");
Cmd_ada.Set_Exit_Command ("exit");
Cmd_ada.Set_Help_Command ("help");
Cmd_ada.Set_Prompt (">> ");
Cmd_ada.Set_Help_Preamble ("Those commands are...");
Cmd_ada.Main_Loop;
end Example_App;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with Matreshka.Internals.Strings;
private package Matreshka.Internals.Text_Codecs.IANA_Registry is
pragma Preelaborate;
type IANA_Record is record
Name : not null Matreshka.Internals.Strings.Shared_String_Access;
MIB : Character_Set;
end record;
N1 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0075#, 16#0073#, 16#0061#, 16#0073#,
16#0063#, 16#0069#, 16#0069#,
others => 16#0000#),
others => <>);
-- usascii
N2 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0036#,
others => 16#0000#),
others => <>);
-- isoir6
N3 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0061#, 16#006E#, 16#0073#, 16#0069#,
16#0078#, 16#0033#, 16#0034#, 16#0031#,
16#0039#, 16#0036#, 16#0038#,
others => 16#0000#),
others => <>);
-- ansix341968
N4 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0061#, 16#006E#, 16#0073#, 16#0069#,
16#0078#, 16#0033#, 16#0034#, 16#0031#,
16#0039#, 16#0038#, 16#0036#,
others => 16#0000#),
others => <>);
-- ansix341986
N5 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#0069#, 16#0072#,
16#0076#, 16#0031#, 16#0039#, 16#0039#,
16#0031#,
others => 16#0000#),
others => <>);
-- iso646irv1991
N6 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#0075#, 16#0073#,
others => 16#0000#),
others => <>);
-- iso646us
N7 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 2,
Length => 2,
Value =>
(16#0075#, 16#0073#,
others => 16#0000#),
others => <>);
-- us
N8 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0033#,
16#0036#, 16#0037#,
others => 16#0000#),
others => <>);
-- ibm367
N9 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0033#, 16#0036#,
16#0037#,
others => 16#0000#),
others => <>);
-- cp367
N10 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0063#, 16#0073#, 16#0061#, 16#0073#,
16#0063#, 16#0069#, 16#0069#,
others => 16#0000#),
others => <>);
-- csascii
N11 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0031#,
16#0031#, 16#0039#, 16#0038#, 16#0037#,
others => 16#0000#),
others => <>);
-- iso885911987
N12 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0030#, 16#0030#,
others => 16#0000#),
others => <>);
-- isoir100
N13 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0031#,
others => 16#0000#),
others => <>);
-- iso88591
N14 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#006C#, 16#0061#, 16#0074#, 16#0069#,
16#006E#, 16#0031#,
others => 16#0000#),
others => <>);
-- latin1
N15 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 2,
Length => 2,
Value =>
(16#006C#, 16#0031#,
others => 16#0000#),
others => <>);
-- l1
N16 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0038#,
16#0031#, 16#0039#,
others => 16#0000#),
others => <>);
-- ibm819
N17 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0038#, 16#0031#,
16#0039#,
others => 16#0000#),
others => <>);
-- cp819
N18 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#006C#, 16#0061#, 16#0074#,
16#0069#, 16#006E#, 16#0031#,
others => 16#0000#),
others => <>);
-- csisolatin1
N19 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0032#,
16#0031#, 16#0039#, 16#0038#, 16#0037#,
others => 16#0000#),
others => <>);
-- iso885921987
N20 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0030#, 16#0031#,
others => 16#0000#),
others => <>);
-- isoir101
N21 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0032#,
others => 16#0000#),
others => <>);
-- iso88592
N22 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#006C#, 16#0061#, 16#0074#, 16#0069#,
16#006E#, 16#0032#,
others => 16#0000#),
others => <>);
-- latin2
N23 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 2,
Length => 2,
Value =>
(16#006C#, 16#0032#,
others => 16#0000#),
others => <>);
-- l2
N24 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#006C#, 16#0061#, 16#0074#,
16#0069#, 16#006E#, 16#0032#,
others => 16#0000#),
others => <>);
-- csisolatin2
N25 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0033#,
16#0031#, 16#0039#, 16#0038#, 16#0038#,
others => 16#0000#),
others => <>);
-- iso885931988
N26 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0030#, 16#0039#,
others => 16#0000#),
others => <>);
-- isoir109
N27 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0033#,
others => 16#0000#),
others => <>);
-- iso88593
N28 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#006C#, 16#0061#, 16#0074#, 16#0069#,
16#006E#, 16#0033#,
others => 16#0000#),
others => <>);
-- latin3
N29 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 2,
Length => 2,
Value =>
(16#006C#, 16#0033#,
others => 16#0000#),
others => <>);
-- l3
N30 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#006C#, 16#0061#, 16#0074#,
16#0069#, 16#006E#, 16#0033#,
others => 16#0000#),
others => <>);
-- csisolatin3
N31 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0034#,
16#0031#, 16#0039#, 16#0038#, 16#0038#,
others => 16#0000#),
others => <>);
-- iso885941988
N32 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0031#, 16#0030#,
others => 16#0000#),
others => <>);
-- isoir110
N33 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0034#,
others => 16#0000#),
others => <>);
-- iso88594
N34 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#006C#, 16#0061#, 16#0074#, 16#0069#,
16#006E#, 16#0034#,
others => 16#0000#),
others => <>);
-- latin4
N35 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 2,
Length => 2,
Value =>
(16#006C#, 16#0034#,
others => 16#0000#),
others => <>);
-- l4
N36 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#006C#, 16#0061#, 16#0074#,
16#0069#, 16#006E#, 16#0034#,
others => 16#0000#),
others => <>);
-- csisolatin4
N37 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0035#,
16#0031#, 16#0039#, 16#0038#, 16#0038#,
others => 16#0000#),
others => <>);
-- iso885951988
N38 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0034#, 16#0034#,
others => 16#0000#),
others => <>);
-- isoir144
N39 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0035#,
others => 16#0000#),
others => <>);
-- iso88595
N40 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0079#, 16#0072#, 16#0069#,
16#006C#, 16#006C#, 16#0069#, 16#0063#,
others => 16#0000#),
others => <>);
-- cyrillic
N41 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 18,
Length => 18,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#006C#, 16#0061#, 16#0074#,
16#0069#, 16#006E#, 16#0063#, 16#0079#,
16#0072#, 16#0069#, 16#006C#, 16#006C#,
16#0069#, 16#0063#,
others => 16#0000#),
others => <>);
-- csisolatincyrillic
N42 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0036#,
16#0031#, 16#0039#, 16#0038#, 16#0037#,
others => 16#0000#),
others => <>);
-- iso885961987
N43 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0032#, 16#0037#,
others => 16#0000#),
others => <>);
-- isoir127
N44 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0036#,
others => 16#0000#),
others => <>);
-- iso88596
N45 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0065#, 16#0063#, 16#006D#, 16#0061#,
16#0031#, 16#0031#, 16#0034#,
others => 16#0000#),
others => <>);
-- ecma114
N46 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0061#, 16#0073#, 16#006D#, 16#006F#,
16#0037#, 16#0030#, 16#0038#,
others => 16#0000#),
others => <>);
-- asmo708
N47 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0061#, 16#0072#, 16#0061#, 16#0062#,
16#0069#, 16#0063#,
others => 16#0000#),
others => <>);
-- arabic
N48 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 16,
Length => 16,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#006C#, 16#0061#, 16#0074#,
16#0069#, 16#006E#, 16#0061#, 16#0072#,
16#0061#, 16#0062#, 16#0069#, 16#0063#,
others => 16#0000#),
others => <>);
-- csisolatinarabic
N49 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0037#,
16#0031#, 16#0039#, 16#0038#, 16#0037#,
others => 16#0000#),
others => <>);
-- iso885971987
N50 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0032#, 16#0036#,
others => 16#0000#),
others => <>);
-- isoir126
N51 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0037#,
others => 16#0000#),
others => <>);
-- iso88597
N52 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0065#, 16#006C#, 16#006F#, 16#0074#,
16#0039#, 16#0032#, 16#0038#,
others => 16#0000#),
others => <>);
-- elot928
N53 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0065#, 16#0063#, 16#006D#, 16#0061#,
16#0031#, 16#0031#, 16#0038#,
others => 16#0000#),
others => <>);
-- ecma118
N54 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0067#, 16#0072#, 16#0065#, 16#0065#,
16#006B#,
others => 16#0000#),
others => <>);
-- greek
N55 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0067#, 16#0072#, 16#0065#, 16#0065#,
16#006B#, 16#0038#,
others => 16#0000#),
others => <>);
-- greek8
N56 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 15,
Length => 15,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#006C#, 16#0061#, 16#0074#,
16#0069#, 16#006E#, 16#0067#, 16#0072#,
16#0065#, 16#0065#, 16#006B#,
others => 16#0000#),
others => <>);
-- csisolatingreek
N57 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0038#,
16#0031#, 16#0039#, 16#0038#, 16#0038#,
others => 16#0000#),
others => <>);
-- iso885981988
N58 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0033#, 16#0038#,
others => 16#0000#),
others => <>);
-- isoir138
N59 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0038#,
others => 16#0000#),
others => <>);
-- iso88598
N60 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0068#, 16#0065#, 16#0062#, 16#0072#,
16#0065#, 16#0077#,
others => 16#0000#),
others => <>);
-- hebrew
N61 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 16,
Length => 16,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#006C#, 16#0061#, 16#0074#,
16#0069#, 16#006E#, 16#0068#, 16#0065#,
16#0062#, 16#0072#, 16#0065#, 16#0077#,
others => 16#0000#),
others => <>);
-- csisolatinhebrew
N62 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0039#,
16#0031#, 16#0039#, 16#0038#, 16#0039#,
others => 16#0000#),
others => <>);
-- iso885991989
N63 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0034#, 16#0038#,
others => 16#0000#),
others => <>);
-- isoir148
N64 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0039#,
others => 16#0000#),
others => <>);
-- iso88599
N65 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#006C#, 16#0061#, 16#0074#, 16#0069#,
16#006E#, 16#0035#,
others => 16#0000#),
others => <>);
-- latin5
N66 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 2,
Length => 2,
Value =>
(16#006C#, 16#0035#,
others => 16#0000#),
others => <>);
-- l5
N67 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#006C#, 16#0061#, 16#0074#,
16#0069#, 16#006E#, 16#0035#,
others => 16#0000#),
others => <>);
-- csisolatin5
N68 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0031#,
16#0030#,
others => 16#0000#),
others => <>);
-- iso885910
N69 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0035#, 16#0037#,
others => 16#0000#),
others => <>);
-- isoir157
N70 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 2,
Length => 2,
Value =>
(16#006C#, 16#0036#,
others => 16#0000#),
others => <>);
-- l6
N71 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0031#,
16#0030#, 16#0031#, 16#0039#, 16#0039#,
16#0032#,
others => 16#0000#),
others => <>);
-- iso8859101992
N72 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#006C#, 16#0061#, 16#0074#,
16#0069#, 16#006E#, 16#0036#,
others => 16#0000#),
others => <>);
-- csisolatin6
N73 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#006C#, 16#0061#, 16#0074#, 16#0069#,
16#006E#, 16#0036#,
others => 16#0000#),
others => <>);
-- latin6
N74 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0039#, 16#0033#, 16#0037#, 16#0032#,
16#0061#, 16#0064#, 16#0064#,
others => 16#0000#),
others => <>);
-- iso69372add
N75 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0034#, 16#0032#,
others => 16#0000#),
others => <>);
-- isoir142
N76 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0074#, 16#0065#, 16#0078#,
16#0074#, 16#0063#, 16#006F#, 16#006D#,
16#006D#,
others => 16#0000#),
others => <>);
-- csisotextcomm
N77 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#006A#, 16#0069#, 16#0073#, 16#0078#,
16#0032#, 16#0030#, 16#0031#,
others => 16#0000#),
others => <>);
-- jisx201
N78 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#0078#, 16#0032#, 16#0030#, 16#0031#,
others => 16#0000#),
others => <>);
-- x201
N79 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 19,
Length => 19,
Value =>
(16#0063#, 16#0073#, 16#0068#, 16#0061#,
16#006C#, 16#0066#, 16#0077#, 16#0069#,
16#0064#, 16#0074#, 16#0068#, 16#006B#,
16#0061#, 16#0074#, 16#0061#, 16#006B#,
16#0061#, 16#006E#, 16#0061#,
others => 16#0000#),
others => <>);
-- cshalfwidthkatakana
N80 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#006A#, 16#0069#, 16#0073#, 16#0065#,
16#006E#, 16#0063#, 16#006F#, 16#0064#,
16#0069#, 16#006E#, 16#0067#,
others => 16#0000#),
others => <>);
-- jisencoding
N81 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#006A#, 16#0069#,
16#0073#, 16#0065#, 16#006E#, 16#0063#,
16#006F#, 16#0064#, 16#0069#, 16#006E#,
16#0067#,
others => 16#0000#),
others => <>);
-- csjisencoding
N82 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0073#, 16#0068#, 16#0069#, 16#0066#,
16#0074#, 16#006A#, 16#0069#, 16#0073#,
others => 16#0000#),
others => <>);
-- shiftjis
N83 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#006D#, 16#0073#, 16#006B#, 16#0061#,
16#006E#, 16#006A#, 16#0069#,
others => 16#0000#),
others => <>);
-- mskanji
N84 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0063#, 16#0073#, 16#0073#, 16#0068#,
16#0069#, 16#0066#, 16#0074#, 16#006A#,
16#0069#, 16#0073#,
others => 16#0000#),
others => <>);
-- csshiftjis
N85 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 47,
Unused => 39,
Length => 39,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0064#, 16#0065#, 16#0064#,
16#0075#, 16#006E#, 16#0069#, 16#0078#,
16#0063#, 16#006F#, 16#0064#, 16#0065#,
16#0070#, 16#0061#, 16#0063#, 16#006B#,
16#0065#, 16#0064#, 16#0066#, 16#006F#,
16#0072#, 16#006D#, 16#0061#, 16#0074#,
16#0066#, 16#006F#, 16#0072#, 16#006A#,
16#0061#, 16#0070#, 16#0061#, 16#006E#,
16#0065#, 16#0073#, 16#0065#,
others => 16#0000#),
others => <>);
-- extendedunixcodepackedformatforjapanese
N86 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 19,
Length => 19,
Value =>
(16#0063#, 16#0073#, 16#0065#, 16#0075#,
16#0063#, 16#0070#, 16#006B#, 16#0064#,
16#0066#, 16#006D#, 16#0074#, 16#006A#,
16#0061#, 16#0070#, 16#0061#, 16#006E#,
16#0065#, 16#0073#, 16#0065#,
others => 16#0000#),
others => <>);
-- cseucpkdfmtjapanese
N87 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0065#, 16#0075#, 16#0063#, 16#006A#,
16#0070#,
others => 16#0000#),
others => <>);
-- eucjp
N88 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 39,
Unused => 37,
Length => 37,
Value =>
(16#0065#, 16#0078#, 16#0074#, 16#0065#,
16#006E#, 16#0064#, 16#0065#, 16#0064#,
16#0075#, 16#006E#, 16#0069#, 16#0078#,
16#0063#, 16#006F#, 16#0064#, 16#0065#,
16#0066#, 16#0069#, 16#0078#, 16#0065#,
16#0064#, 16#0077#, 16#0069#, 16#0064#,
16#0074#, 16#0068#, 16#0066#, 16#006F#,
16#0072#, 16#006A#, 16#0061#, 16#0070#,
16#0061#, 16#006E#, 16#0065#, 16#0073#,
16#0065#,
others => 16#0000#),
others => <>);
-- extendedunixcodefixedwidthforjapanese
N89 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 19,
Length => 19,
Value =>
(16#0063#, 16#0073#, 16#0065#, 16#0075#,
16#0063#, 16#0066#, 16#0069#, 16#0078#,
16#0077#, 16#0069#, 16#0064#, 16#006A#,
16#0061#, 16#0070#, 16#0061#, 16#006E#,
16#0065#, 16#0073#, 16#0065#,
others => 16#0000#),
others => <>);
-- cseucfixwidjapanese
N90 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0062#, 16#0073#, 16#0034#, 16#0037#,
16#0033#, 16#0030#,
others => 16#0000#),
others => <>);
-- bs4730
N91 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0034#,
others => 16#0000#),
others => <>);
-- isoir4
N92 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#0067#, 16#0062#,
others => 16#0000#),
others => <>);
-- iso646gb
N93 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 2,
Length => 2,
Value =>
(16#0067#, 16#0062#,
others => 16#0000#),
others => <>);
-- gb
N94 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 2,
Length => 2,
Value =>
(16#0075#, 16#006B#,
others => 16#0000#),
others => <>);
-- uk
N95 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 19,
Length => 19,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0034#, 16#0075#, 16#006E#,
16#0069#, 16#0074#, 16#0065#, 16#0064#,
16#006B#, 16#0069#, 16#006E#, 16#0067#,
16#0064#, 16#006F#, 16#006D#,
others => 16#0000#),
others => <>);
-- csiso4unitedkingdom
N96 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0073#, 16#0065#, 16#006E#, 16#0038#,
16#0035#, 16#0030#, 16#0032#, 16#0030#,
16#0030#, 16#0063#,
others => 16#0000#),
others => <>);
-- sen850200c
N97 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0031#,
others => 16#0000#),
others => <>);
-- isoir11
N98 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#0073#, 16#0065#,
16#0032#,
others => 16#0000#),
others => <>);
-- iso646se2
N99 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0073#, 16#0065#, 16#0032#,
others => 16#0000#),
others => <>);
-- se2
N100 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 22,
Length => 22,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0031#, 16#0073#,
16#0077#, 16#0065#, 16#0064#, 16#0069#,
16#0073#, 16#0068#, 16#0066#, 16#006F#,
16#0072#, 16#006E#, 16#0061#, 16#006D#,
16#0065#, 16#0073#,
others => 16#0000#),
others => <>);
-- csiso11swedishfornames
N101 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 2,
Length => 2,
Value =>
(16#0069#, 16#0074#,
others => 16#0000#),
others => <>);
-- it
N102 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0035#,
others => 16#0000#),
others => <>);
-- isoir15
N103 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#0069#, 16#0074#,
others => 16#0000#),
others => <>);
-- iso646it
N104 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 14,
Length => 14,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0035#, 16#0069#,
16#0074#, 16#0061#, 16#006C#, 16#0069#,
16#0061#, 16#006E#,
others => 16#0000#),
others => <>);
-- csiso15italian
N105 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 2,
Length => 2,
Value =>
(16#0065#, 16#0073#,
others => 16#0000#),
others => <>);
-- es
N106 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0037#,
others => 16#0000#),
others => <>);
-- isoir17
N107 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#0065#, 16#0073#,
others => 16#0000#),
others => <>);
-- iso646es
N108 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 14,
Length => 14,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0037#, 16#0073#,
16#0070#, 16#0061#, 16#006E#, 16#0069#,
16#0073#, 16#0068#,
others => 16#0000#),
others => <>);
-- csiso17spanish
N109 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0064#, 16#0069#, 16#006E#, 16#0036#,
16#0036#, 16#0030#, 16#0030#, 16#0033#,
others => 16#0000#),
others => <>);
-- din66003
N110 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0032#, 16#0031#,
others => 16#0000#),
others => <>);
-- isoir21
N111 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 2,
Length => 2,
Value =>
(16#0064#, 16#0065#,
others => 16#0000#),
others => <>);
-- de
N112 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#0064#, 16#0065#,
others => 16#0000#),
others => <>);
-- iso646de
N113 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0032#, 16#0031#, 16#0067#,
16#0065#, 16#0072#, 16#006D#, 16#0061#,
16#006E#,
others => 16#0000#),
others => <>);
-- csiso21german
N114 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#006E#, 16#0073#, 16#0034#, 16#0035#,
16#0035#, 16#0031#, 16#0031#,
others => 16#0000#),
others => <>);
-- ns45511
N115 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0036#, 16#0030#,
others => 16#0000#),
others => <>);
-- isoir60
N116 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#006E#, 16#006F#,
others => 16#0000#),
others => <>);
-- iso646no
N117 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 2,
Length => 2,
Value =>
(16#006E#, 16#006F#,
others => 16#0000#),
others => <>);
-- no
N118 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 22,
Length => 22,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0036#, 16#0030#, 16#0064#,
16#0061#, 16#006E#, 16#0069#, 16#0073#,
16#0068#, 16#006E#, 16#006F#, 16#0072#,
16#0077#, 16#0065#, 16#0067#, 16#0069#,
16#0061#, 16#006E#,
others => 16#0000#),
others => <>);
-- csiso60danishnorwegian
N119 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0036#, 16#0030#, 16#006E#,
16#006F#, 16#0072#, 16#0077#, 16#0065#,
16#0067#, 16#0069#, 16#0061#, 16#006E#,
16#0031#,
others => 16#0000#),
others => <>);
-- csiso60norwegian1
N120 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#006E#, 16#0066#, 16#007A#, 16#0036#,
16#0032#, 16#0030#, 16#0031#, 16#0030#,
others => 16#0000#),
others => <>);
-- nfz62010
N121 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0036#, 16#0039#,
others => 16#0000#),
others => <>);
-- isoir69
N122 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#0066#, 16#0072#,
others => 16#0000#),
others => <>);
-- iso646fr
N123 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 2,
Length => 2,
Value =>
(16#0066#, 16#0072#,
others => 16#0000#),
others => <>);
-- fr
N124 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0036#, 16#0039#, 16#0066#,
16#0072#, 16#0065#, 16#006E#, 16#0063#,
16#0068#,
others => 16#0000#),
others => <>);
-- csiso69french
N125 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0031#,
16#0030#, 16#0036#, 16#0034#, 16#0036#,
16#0075#, 16#0074#, 16#0066#, 16#0031#,
others => 16#0000#),
others => <>);
-- iso10646utf1
N126 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 14,
Length => 14,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0030#, 16#0036#,
16#0034#, 16#0036#, 16#0075#, 16#0074#,
16#0066#, 16#0031#,
others => 16#0000#),
others => <>);
-- csiso10646utf1
N127 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 15,
Length => 15,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#0062#, 16#0061#,
16#0073#, 16#0069#, 16#0063#, 16#0031#,
16#0039#, 16#0038#, 16#0033#,
others => 16#0000#),
others => <>);
-- iso646basic1983
N128 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0072#, 16#0065#, 16#0066#,
others => 16#0000#),
others => <>);
-- ref
N129 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0036#, 16#0034#, 16#0036#,
16#0062#, 16#0061#, 16#0073#, 16#0069#,
16#0063#, 16#0031#, 16#0039#, 16#0038#,
16#0033#,
others => 16#0000#),
others => <>);
-- csiso646basic1983
N130 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0069#, 16#006E#, 16#0076#, 16#0061#,
16#0072#, 16#0069#, 16#0061#, 16#006E#,
16#0074#,
others => 16#0000#),
others => <>);
-- invariant
N131 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#006E#,
16#0076#, 16#0061#, 16#0072#, 16#0069#,
16#0061#, 16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- csinvariant
N132 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#0069#, 16#0072#,
16#0076#, 16#0031#, 16#0039#, 16#0038#,
16#0033#,
others => 16#0000#),
others => <>);
-- iso646irv1983
N133 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0032#,
others => 16#0000#),
others => <>);
-- isoir2
N134 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0069#, 16#0072#, 16#0076#,
others => 16#0000#),
others => <>);
-- irv
N135 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 20,
Length => 20,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0032#, 16#0069#, 16#006E#,
16#0074#, 16#006C#, 16#0072#, 16#0065#,
16#0066#, 16#0076#, 16#0065#, 16#0072#,
16#0073#, 16#0069#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- csiso2intlrefversion
N136 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#006E#, 16#0061#, 16#0074#, 16#0073#,
16#0073#, 16#0065#, 16#0066#, 16#0069#,
others => 16#0000#),
others => <>);
-- natssefi
N137 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0038#, 16#0031#,
others => 16#0000#),
others => <>);
-- isoir81
N138 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0063#, 16#0073#, 16#006E#, 16#0061#,
16#0074#, 16#0073#, 16#0073#, 16#0065#,
16#0066#, 16#0069#,
others => 16#0000#),
others => <>);
-- csnatssefi
N139 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#006E#, 16#0061#, 16#0074#, 16#0073#,
16#0073#, 16#0065#, 16#0066#, 16#0069#,
16#0061#, 16#0064#, 16#0064#,
others => 16#0000#),
others => <>);
-- natssefiadd
N140 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0038#, 16#0032#,
others => 16#0000#),
others => <>);
-- isoir82
N141 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#006E#, 16#0061#,
16#0074#, 16#0073#, 16#0073#, 16#0065#,
16#0066#, 16#0069#, 16#0061#, 16#0064#,
16#0064#,
others => 16#0000#),
others => <>);
-- csnatssefiadd
N142 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#006E#, 16#0061#, 16#0074#, 16#0073#,
16#0064#, 16#0061#, 16#006E#, 16#006F#,
others => 16#0000#),
others => <>);
-- natsdano
N143 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0039#, 16#0031#,
others => 16#0000#),
others => <>);
-- isoir91
N144 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0063#, 16#0073#, 16#006E#, 16#0061#,
16#0074#, 16#0073#, 16#0064#, 16#0061#,
16#006E#, 16#006F#,
others => 16#0000#),
others => <>);
-- csnatsdano
N145 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#006E#, 16#0061#, 16#0074#, 16#0073#,
16#0064#, 16#0061#, 16#006E#, 16#006F#,
16#0061#, 16#0064#, 16#0064#,
others => 16#0000#),
others => <>);
-- natsdanoadd
N146 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0039#, 16#0032#,
others => 16#0000#),
others => <>);
-- isoir92
N147 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#006E#, 16#0061#,
16#0074#, 16#0073#, 16#0064#, 16#0061#,
16#006E#, 16#006F#, 16#0061#, 16#0064#,
16#0064#,
others => 16#0000#),
others => <>);
-- csnatsdanoadd
N148 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0073#, 16#0065#, 16#006E#, 16#0038#,
16#0035#, 16#0030#, 16#0032#, 16#0030#,
16#0030#, 16#0062#,
others => 16#0000#),
others => <>);
-- sen850200b
N149 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0030#,
others => 16#0000#),
others => <>);
-- isoir10
N150 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 2,
Length => 2,
Value =>
(16#0066#, 16#0069#,
others => 16#0000#),
others => <>);
-- fi
N151 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#0066#, 16#0069#,
others => 16#0000#),
others => <>);
-- iso646fi
N152 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#0073#, 16#0065#,
others => 16#0000#),
others => <>);
-- iso646se
N153 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 2,
Length => 2,
Value =>
(16#0073#, 16#0065#,
others => 16#0000#),
others => <>);
-- se
N154 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 14,
Length => 14,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0030#, 16#0073#,
16#0077#, 16#0065#, 16#0064#, 16#0069#,
16#0073#, 16#0068#,
others => 16#0000#),
others => <>);
-- csiso10swedish
N155 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#006B#, 16#0073#, 16#0063#, 16#0035#,
16#0036#, 16#0030#, 16#0031#, 16#0031#,
16#0039#, 16#0038#, 16#0037#,
others => 16#0000#),
others => <>);
-- ksc56011987
N156 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0034#, 16#0039#,
others => 16#0000#),
others => <>);
-- isoir149
N157 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#006B#, 16#0073#, 16#0063#, 16#0035#,
16#0036#, 16#0030#, 16#0031#, 16#0031#,
16#0039#, 16#0038#, 16#0039#,
others => 16#0000#),
others => <>);
-- ksc56011989
N158 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#006B#, 16#0073#, 16#0063#, 16#0035#,
16#0036#, 16#0030#, 16#0031#,
others => 16#0000#),
others => <>);
-- ksc5601
N159 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#006B#, 16#006F#, 16#0072#, 16#0065#,
16#0061#, 16#006E#,
others => 16#0000#),
others => <>);
-- korean
N160 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#006B#, 16#0073#,
16#0063#, 16#0035#, 16#0036#, 16#0030#,
16#0031#, 16#0031#, 16#0039#, 16#0038#,
16#0037#,
others => 16#0000#),
others => <>);
-- csksc56011987
N161 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0032#,
16#0030#, 16#0032#, 16#0032#, 16#006B#,
16#0072#,
others => 16#0000#),
others => <>);
-- iso2022kr
N162 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0032#, 16#0030#, 16#0032#,
16#0032#, 16#006B#, 16#0072#,
others => 16#0000#),
others => <>);
-- csiso2022kr
N163 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0065#, 16#0075#, 16#0063#, 16#006B#,
16#0072#,
others => 16#0000#),
others => <>);
-- euckr
N164 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0063#, 16#0073#, 16#0065#, 16#0075#,
16#0063#, 16#006B#, 16#0072#,
others => 16#0000#),
others => <>);
-- cseuckr
N165 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0032#,
16#0030#, 16#0032#, 16#0032#, 16#006A#,
16#0070#,
others => 16#0000#),
others => <>);
-- iso2022jp
N166 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0032#, 16#0030#, 16#0032#,
16#0032#, 16#006A#, 16#0070#,
others => 16#0000#),
others => <>);
-- csiso2022jp
N167 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0032#,
16#0030#, 16#0032#, 16#0032#, 16#006A#,
16#0070#, 16#0032#,
others => 16#0000#),
others => <>);
-- iso2022jp2
N168 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0032#, 16#0030#, 16#0032#,
16#0032#, 16#006A#, 16#0070#, 16#0032#,
others => 16#0000#),
others => <>);
-- csiso2022jp2
N169 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 14,
Length => 14,
Value =>
(16#006A#, 16#0069#, 16#0073#, 16#0063#,
16#0036#, 16#0032#, 16#0032#, 16#0030#,
16#0031#, 16#0039#, 16#0036#, 16#0039#,
16#006A#, 16#0070#,
others => 16#0000#),
others => <>);
-- jisc62201969jp
N170 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#006A#, 16#0069#, 16#0073#, 16#0063#,
16#0036#, 16#0032#, 16#0032#, 16#0030#,
16#0031#, 16#0039#, 16#0036#, 16#0039#,
others => 16#0000#),
others => <>);
-- jisc62201969
N171 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0033#,
others => 16#0000#),
others => <>);
-- isoir13
N172 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#006B#, 16#0061#, 16#0074#, 16#0061#,
16#006B#, 16#0061#, 16#006E#, 16#0061#,
others => 16#0000#),
others => <>);
-- katakana
N173 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0078#, 16#0032#, 16#0030#, 16#0031#,
16#0037#,
others => 16#0000#),
others => <>);
-- x2017
N174 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0033#, 16#006A#,
16#0069#, 16#0073#, 16#0063#, 16#0036#,
16#0032#, 16#0032#, 16#0030#, 16#006A#,
16#0070#,
others => 16#0000#),
others => <>);
-- csiso13jisc6220jp
N175 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 14,
Length => 14,
Value =>
(16#006A#, 16#0069#, 16#0073#, 16#0063#,
16#0036#, 16#0032#, 16#0032#, 16#0030#,
16#0031#, 16#0039#, 16#0036#, 16#0039#,
16#0072#, 16#006F#,
others => 16#0000#),
others => <>);
-- jisc62201969ro
N176 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0034#,
others => 16#0000#),
others => <>);
-- isoir14
N177 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 2,
Length => 2,
Value =>
(16#006A#, 16#0070#,
others => 16#0000#),
others => <>);
-- jp
N178 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#006A#, 16#0070#,
others => 16#0000#),
others => <>);
-- iso646jp
N179 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0034#, 16#006A#,
16#0069#, 16#0073#, 16#0063#, 16#0036#,
16#0032#, 16#0032#, 16#0030#, 16#0072#,
16#006F#,
others => 16#0000#),
others => <>);
-- csiso14jisc6220ro
N180 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 2,
Length => 2,
Value =>
(16#0070#, 16#0074#,
others => 16#0000#),
others => <>);
-- pt
N181 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0036#,
others => 16#0000#),
others => <>);
-- isoir16
N182 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#0070#, 16#0074#,
others => 16#0000#),
others => <>);
-- iso646pt
N183 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0036#, 16#0070#,
16#006F#, 16#0072#, 16#0074#, 16#0075#,
16#0067#, 16#0075#, 16#0065#, 16#0073#,
16#0065#,
others => 16#0000#),
others => <>);
-- csiso16portuguese
N184 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0067#, 16#0072#, 16#0065#, 16#0065#,
16#006B#, 16#0037#, 16#006F#, 16#006C#,
16#0064#,
others => 16#0000#),
others => <>);
-- greek7old
N185 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0038#,
others => 16#0000#),
others => <>);
-- isoir18
N186 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 16,
Length => 16,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0038#, 16#0067#,
16#0072#, 16#0065#, 16#0065#, 16#006B#,
16#0037#, 16#006F#, 16#006C#, 16#0064#,
others => 16#0000#),
others => <>);
-- csiso18greek7old
N187 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#006C#, 16#0061#, 16#0074#, 16#0069#,
16#006E#, 16#0067#, 16#0072#, 16#0065#,
16#0065#, 16#006B#,
others => 16#0000#),
others => <>);
-- latingreek
N188 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0039#,
others => 16#0000#),
others => <>);
-- isoir19
N189 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0039#, 16#006C#,
16#0061#, 16#0074#, 16#0069#, 16#006E#,
16#0067#, 16#0072#, 16#0065#, 16#0065#,
16#006B#,
others => 16#0000#),
others => <>);
-- csiso19latingreek
N190 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#006E#, 16#0066#, 16#007A#, 16#0036#,
16#0032#, 16#0030#, 16#0031#, 16#0030#,
16#0031#, 16#0039#, 16#0037#, 16#0033#,
others => 16#0000#),
others => <>);
-- nfz620101973
N191 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0032#, 16#0035#,
others => 16#0000#),
others => <>);
-- isoir25
N192 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#0066#, 16#0072#,
16#0031#,
others => 16#0000#),
others => <>);
-- iso646fr1
N193 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0032#, 16#0035#, 16#0066#,
16#0072#, 16#0065#, 16#006E#, 16#0063#,
16#0068#,
others => 16#0000#),
others => <>);
-- csiso25french
N194 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#006C#, 16#0061#, 16#0074#, 16#0069#,
16#006E#, 16#0067#, 16#0072#, 16#0065#,
16#0065#, 16#006B#, 16#0031#,
others => 16#0000#),
others => <>);
-- latingreek1
N195 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0032#, 16#0037#,
others => 16#0000#),
others => <>);
-- isoir27
N196 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 18,
Length => 18,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0032#, 16#0037#, 16#006C#,
16#0061#, 16#0074#, 16#0069#, 16#006E#,
16#0067#, 16#0072#, 16#0065#, 16#0065#,
16#006B#, 16#0031#,
others => 16#0000#),
others => <>);
-- csiso27latingreek1
N197 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0035#,
16#0034#, 16#0032#, 16#0037#,
others => 16#0000#),
others => <>);
-- iso5427
N198 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0033#, 16#0037#,
others => 16#0000#),
others => <>);
-- isoir37
N199 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0035#, 16#0034#, 16#0032#,
16#0037#, 16#0063#, 16#0079#, 16#0072#,
16#0069#, 16#006C#, 16#006C#, 16#0069#,
16#0063#,
others => 16#0000#),
others => <>);
-- csiso5427cyrillic
N200 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#006A#, 16#0069#, 16#0073#, 16#0063#,
16#0036#, 16#0032#, 16#0032#, 16#0036#,
16#0031#, 16#0039#, 16#0037#, 16#0038#,
others => 16#0000#),
others => <>);
-- jisc62261978
N201 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0034#, 16#0032#,
others => 16#0000#),
others => <>);
-- isoir42
N202 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 19,
Length => 19,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0034#, 16#0032#, 16#006A#,
16#0069#, 16#0073#, 16#0063#, 16#0036#,
16#0032#, 16#0032#, 16#0036#, 16#0031#,
16#0039#, 16#0037#, 16#0038#,
others => 16#0000#),
others => <>);
-- csiso42jisc62261978
N203 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0062#, 16#0073#, 16#0076#, 16#0069#,
16#0065#, 16#0077#, 16#0064#, 16#0061#,
16#0074#, 16#0061#,
others => 16#0000#),
others => <>);
-- bsviewdata
N204 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0034#, 16#0037#,
others => 16#0000#),
others => <>);
-- isoir47
N205 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0034#, 16#0037#, 16#0062#,
16#0073#, 16#0076#, 16#0069#, 16#0065#,
16#0077#, 16#0064#, 16#0061#, 16#0074#,
16#0061#,
others => 16#0000#),
others => <>);
-- csiso47bsviewdata
N206 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#0069#, 16#006E#, 16#0069#, 16#0073#,
others => 16#0000#),
others => <>);
-- inis
N207 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0034#, 16#0039#,
others => 16#0000#),
others => <>);
-- isoir49
N208 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0034#, 16#0039#, 16#0069#,
16#006E#, 16#0069#, 16#0073#,
others => 16#0000#),
others => <>);
-- csiso49inis
N209 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0069#, 16#006E#, 16#0069#, 16#0073#,
16#0038#,
others => 16#0000#),
others => <>);
-- inis8
N210 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0035#, 16#0030#,
others => 16#0000#),
others => <>);
-- isoir50
N211 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0035#, 16#0030#, 16#0069#,
16#006E#, 16#0069#, 16#0073#, 16#0038#,
others => 16#0000#),
others => <>);
-- csiso50inis8
N212 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0069#, 16#006E#, 16#0069#, 16#0073#,
16#0063#, 16#0079#, 16#0072#, 16#0069#,
16#006C#, 16#006C#, 16#0069#, 16#0063#,
others => 16#0000#),
others => <>);
-- iniscyrillic
N213 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0035#, 16#0031#,
others => 16#0000#),
others => <>);
-- isoir51
N214 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 19,
Length => 19,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0035#, 16#0031#, 16#0069#,
16#006E#, 16#0069#, 16#0073#, 16#0063#,
16#0079#, 16#0072#, 16#0069#, 16#006C#,
16#006C#, 16#0069#, 16#0063#,
others => 16#0000#),
others => <>);
-- csiso51iniscyrillic
N215 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0035#,
16#0034#, 16#0032#, 16#0037#, 16#0031#,
16#0039#, 16#0038#, 16#0031#,
others => 16#0000#),
others => <>);
-- iso54271981
N216 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0035#, 16#0034#,
others => 16#0000#),
others => <>);
-- isoir54
N217 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 19,
Length => 19,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0035#,
16#0034#, 16#0032#, 16#0037#, 16#0063#,
16#0079#, 16#0072#, 16#0069#, 16#006C#,
16#006C#, 16#0069#, 16#0063#, 16#0031#,
16#0039#, 16#0038#, 16#0031#,
others => 16#0000#),
others => <>);
-- iso5427cyrillic1981
N218 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0035#, 16#0034#, 16#0032#,
16#0037#, 16#0031#, 16#0039#, 16#0038#,
16#0031#,
others => 16#0000#),
others => <>);
-- csiso54271981
N219 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0035#,
16#0034#, 16#0032#, 16#0038#, 16#0031#,
16#0039#, 16#0038#, 16#0030#,
others => 16#0000#),
others => <>);
-- iso54281980
N220 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0035#, 16#0035#,
others => 16#0000#),
others => <>);
-- isoir55
N221 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 14,
Length => 14,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0035#, 16#0034#, 16#0032#,
16#0038#, 16#0067#, 16#0072#, 16#0065#,
16#0065#, 16#006B#,
others => 16#0000#),
others => <>);
-- csiso5428greek
N222 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0067#, 16#0062#, 16#0031#, 16#0039#,
16#0038#, 16#0038#, 16#0038#, 16#0030#,
others => 16#0000#),
others => <>);
-- gb198880
N223 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0035#, 16#0037#,
others => 16#0000#),
others => <>);
-- isoir57
N224 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 2,
Length => 2,
Value =>
(16#0063#, 16#006E#,
others => 16#0000#),
others => <>);
-- cn
N225 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#0063#, 16#006E#,
others => 16#0000#),
others => <>);
-- iso646cn
N226 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0035#, 16#0037#, 16#0067#,
16#0062#, 16#0031#, 16#0039#, 16#0038#,
16#0038#,
others => 16#0000#),
others => <>);
-- csiso57gb1988
N227 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0067#, 16#0062#, 16#0032#, 16#0033#,
16#0031#, 16#0032#, 16#0038#, 16#0030#,
others => 16#0000#),
others => <>);
-- gb231280
N228 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0035#, 16#0038#,
others => 16#0000#),
others => <>);
-- isoir58
N229 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0063#, 16#0068#, 16#0069#, 16#006E#,
16#0065#, 16#0073#, 16#0065#,
others => 16#0000#),
others => <>);
-- chinese
N230 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 15,
Length => 15,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0035#, 16#0038#, 16#0067#,
16#0062#, 16#0032#, 16#0033#, 16#0031#,
16#0032#, 16#0038#, 16#0030#,
others => 16#0000#),
others => <>);
-- csiso58gb231280
N231 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#006E#, 16#0073#, 16#0034#, 16#0035#,
16#0035#, 16#0031#, 16#0032#,
others => 16#0000#),
others => <>);
-- ns45512
N232 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#006E#, 16#006F#,
16#0032#,
others => 16#0000#),
others => <>);
-- iso646no2
N233 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0036#, 16#0031#,
others => 16#0000#),
others => <>);
-- isoir61
N234 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#006E#, 16#006F#, 16#0032#,
others => 16#0000#),
others => <>);
-- no2
N235 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0036#, 16#0031#, 16#006E#,
16#006F#, 16#0072#, 16#0077#, 16#0065#,
16#0067#, 16#0069#, 16#0061#, 16#006E#,
16#0032#,
others => 16#0000#),
others => <>);
-- csiso61norwegian2
N236 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0076#, 16#0069#, 16#0064#, 16#0065#,
16#006F#, 16#0074#, 16#0065#, 16#0078#,
16#0073#, 16#0075#, 16#0070#, 16#0070#,
16#006C#,
others => 16#0000#),
others => <>);
-- videotexsuppl
N237 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0037#, 16#0030#,
others => 16#0000#),
others => <>);
-- isoir70
N238 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 20,
Length => 20,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0037#, 16#0030#, 16#0076#,
16#0069#, 16#0064#, 16#0065#, 16#006F#,
16#0074#, 16#0065#, 16#0078#, 16#0073#,
16#0075#, 16#0070#, 16#0070#, 16#0031#,
others => 16#0000#),
others => <>);
-- csiso70videotexsupp1
N239 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0070#, 16#0074#, 16#0032#,
others => 16#0000#),
others => <>);
-- pt2
N240 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0038#, 16#0034#,
others => 16#0000#),
others => <>);
-- isoir84
N241 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#0070#, 16#0074#,
16#0032#,
others => 16#0000#),
others => <>);
-- iso646pt2
N242 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 18,
Length => 18,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0038#, 16#0034#, 16#0070#,
16#006F#, 16#0072#, 16#0074#, 16#0075#,
16#0067#, 16#0075#, 16#0065#, 16#0073#,
16#0065#, 16#0032#,
others => 16#0000#),
others => <>);
-- csiso84portuguese2
N243 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0065#, 16#0073#, 16#0032#,
others => 16#0000#),
others => <>);
-- es2
N244 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0038#, 16#0035#,
others => 16#0000#),
others => <>);
-- isoir85
N245 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#0065#, 16#0073#,
16#0032#,
others => 16#0000#),
others => <>);
-- iso646es2
N246 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 15,
Length => 15,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0038#, 16#0035#, 16#0073#,
16#0070#, 16#0061#, 16#006E#, 16#0069#,
16#0073#, 16#0068#, 16#0032#,
others => 16#0000#),
others => <>);
-- csiso85spanish2
N247 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#006D#, 16#0073#, 16#007A#, 16#0037#,
16#0037#, 16#0039#, 16#0035#, 16#0033#,
others => 16#0000#),
others => <>);
-- msz77953
N248 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0038#, 16#0036#,
others => 16#0000#),
others => <>);
-- isoir86
N249 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#0068#, 16#0075#,
others => 16#0000#),
others => <>);
-- iso646hu
N250 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 2,
Length => 2,
Value =>
(16#0068#, 16#0075#,
others => 16#0000#),
others => <>);
-- hu
N251 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 16,
Length => 16,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0038#, 16#0036#, 16#0068#,
16#0075#, 16#006E#, 16#0067#, 16#0061#,
16#0072#, 16#0069#, 16#0061#, 16#006E#,
others => 16#0000#),
others => <>);
-- csiso86hungarian
N252 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#006A#, 16#0069#, 16#0073#, 16#0063#,
16#0036#, 16#0032#, 16#0032#, 16#0036#,
16#0031#, 16#0039#, 16#0038#, 16#0033#,
others => 16#0000#),
others => <>);
-- jisc62261983
N253 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0038#, 16#0037#,
others => 16#0000#),
others => <>);
-- isoir87
N254 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#0078#, 16#0032#, 16#0030#, 16#0038#,
others => 16#0000#),
others => <>);
-- x208
N255 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#006A#, 16#0069#, 16#0073#, 16#0078#,
16#0032#, 16#0030#, 16#0038#, 16#0031#,
16#0039#, 16#0038#, 16#0033#,
others => 16#0000#),
others => <>);
-- jisx2081983
N256 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 14,
Length => 14,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0038#, 16#0037#, 16#006A#,
16#0069#, 16#0073#, 16#0078#, 16#0032#,
16#0030#, 16#0038#,
others => 16#0000#),
others => <>);
-- csiso87jisx208
N257 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0067#, 16#0072#, 16#0065#, 16#0065#,
16#006B#, 16#0037#,
others => 16#0000#),
others => <>);
-- greek7
N258 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0038#, 16#0038#,
others => 16#0000#),
others => <>);
-- isoir88
N259 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0038#, 16#0038#, 16#0067#,
16#0072#, 16#0065#, 16#0065#, 16#006B#,
16#0037#,
others => 16#0000#),
others => <>);
-- csiso88greek7
N260 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0061#, 16#0073#, 16#006D#, 16#006F#,
16#0034#, 16#0034#, 16#0039#,
others => 16#0000#),
others => <>);
-- asmo449
N261 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0039#,
16#0030#, 16#0033#, 16#0036#,
others => 16#0000#),
others => <>);
-- iso9036
N262 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0061#, 16#0072#, 16#0061#, 16#0062#,
16#0069#, 16#0063#, 16#0037#,
others => 16#0000#),
others => <>);
-- arabic7
N263 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0038#, 16#0039#,
others => 16#0000#),
others => <>);
-- isoir89
N264 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 14,
Length => 14,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0038#, 16#0039#, 16#0061#,
16#0073#, 16#006D#, 16#006F#, 16#0034#,
16#0034#, 16#0039#,
others => 16#0000#),
others => <>);
-- csiso89asmo449
N265 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0039#, 16#0030#,
others => 16#0000#),
others => <>);
-- isoir90
N266 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0039#, 16#0030#,
others => 16#0000#),
others => <>);
-- csiso90
N267 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#006A#, 16#0069#, 16#0073#, 16#0063#,
16#0036#, 16#0032#, 16#0032#, 16#0039#,
16#0031#, 16#0039#, 16#0038#, 16#0034#,
16#0061#,
others => 16#0000#),
others => <>);
-- jisc62291984a
N268 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#006A#, 16#0070#, 16#006F#, 16#0063#,
16#0072#, 16#0061#,
others => 16#0000#),
others => <>);
-- jpocra
N269 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 20,
Length => 20,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0039#, 16#0031#, 16#006A#,
16#0069#, 16#0073#, 16#0063#, 16#0036#,
16#0032#, 16#0032#, 16#0039#, 16#0031#,
16#0039#, 16#0038#, 16#0034#, 16#0061#,
others => 16#0000#),
others => <>);
-- csiso91jisc62291984a
N270 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#006A#, 16#0069#, 16#0073#, 16#0063#,
16#0036#, 16#0032#, 16#0032#, 16#0039#,
16#0031#, 16#0039#, 16#0038#, 16#0034#,
16#0062#,
others => 16#0000#),
others => <>);
-- jisc62291984b
N271 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#006A#, 16#0070#,
16#006F#, 16#0063#, 16#0072#, 16#0062#,
others => 16#0000#),
others => <>);
-- iso646jpocrb
N272 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#006A#, 16#0070#, 16#006F#, 16#0063#,
16#0072#, 16#0062#,
others => 16#0000#),
others => <>);
-- jpocrb
N273 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 20,
Length => 20,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0039#, 16#0032#, 16#006A#,
16#0069#, 16#0073#, 16#0063#, 16#0036#,
16#0032#, 16#0039#, 16#0039#, 16#0031#,
16#0039#, 16#0038#, 16#0034#, 16#0062#,
others => 16#0000#),
others => <>);
-- csiso92jisc62991984b
N274 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 16,
Length => 16,
Value =>
(16#006A#, 16#0069#, 16#0073#, 16#0063#,
16#0036#, 16#0032#, 16#0032#, 16#0039#,
16#0031#, 16#0039#, 16#0038#, 16#0034#,
16#0062#, 16#0061#, 16#0064#, 16#0064#,
others => 16#0000#),
others => <>);
-- jisc62291984badd
N275 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0039#, 16#0033#,
others => 16#0000#),
others => <>);
-- isoir93
N276 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#006A#, 16#0070#, 16#006F#, 16#0063#,
16#0072#, 16#0062#, 16#0061#, 16#0064#,
16#0064#,
others => 16#0000#),
others => <>);
-- jpocrbadd
N277 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 22,
Length => 22,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0039#, 16#0033#, 16#006A#,
16#0069#, 16#0073#, 16#0036#, 16#0032#,
16#0032#, 16#0039#, 16#0031#, 16#0039#,
16#0038#, 16#0034#, 16#0062#, 16#0061#,
16#0064#, 16#0064#,
others => 16#0000#),
others => <>);
-- csiso93jis62291984badd
N278 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 16,
Length => 16,
Value =>
(16#006A#, 16#0069#, 16#0073#, 16#0063#,
16#0036#, 16#0032#, 16#0032#, 16#0039#,
16#0031#, 16#0039#, 16#0038#, 16#0034#,
16#0068#, 16#0061#, 16#006E#, 16#0064#,
others => 16#0000#),
others => <>);
-- jisc62291984hand
N279 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0039#, 16#0034#,
others => 16#0000#),
others => <>);
-- isoir94
N280 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#006A#, 16#0070#, 16#006F#, 16#0063#,
16#0072#, 16#0068#, 16#0061#, 16#006E#,
16#0064#,
others => 16#0000#),
others => <>);
-- jpocrhand
N281 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 22,
Length => 22,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0039#, 16#0034#, 16#006A#,
16#0069#, 16#0073#, 16#0036#, 16#0032#,
16#0032#, 16#0039#, 16#0031#, 16#0039#,
16#0038#, 16#0034#, 16#0068#, 16#0061#,
16#006E#, 16#0064#,
others => 16#0000#),
others => <>);
-- csiso94jis62291984hand
N282 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 19,
Length => 19,
Value =>
(16#006A#, 16#0069#, 16#0073#, 16#0063#,
16#0036#, 16#0032#, 16#0032#, 16#0039#,
16#0031#, 16#0039#, 16#0038#, 16#0034#,
16#0068#, 16#0061#, 16#006E#, 16#0064#,
16#0061#, 16#0064#, 16#0064#,
others => 16#0000#),
others => <>);
-- jisc62291984handadd
N283 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0039#, 16#0035#,
others => 16#0000#),
others => <>);
-- isoir95
N284 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#006A#, 16#0070#, 16#006F#, 16#0063#,
16#0072#, 16#0068#, 16#0061#, 16#006E#,
16#0064#, 16#0061#, 16#0064#, 16#0064#,
others => 16#0000#),
others => <>);
-- jpocrhandadd
N285 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 25,
Length => 25,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0039#, 16#0035#, 16#006A#,
16#0069#, 16#0073#, 16#0036#, 16#0032#,
16#0032#, 16#0039#, 16#0031#, 16#0039#,
16#0038#, 16#0034#, 16#0068#, 16#0061#,
16#006E#, 16#0064#, 16#0061#, 16#0064#,
16#0064#,
others => 16#0000#),
others => <>);
-- csiso95jis62291984handadd
N286 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 16,
Length => 16,
Value =>
(16#006A#, 16#0069#, 16#0073#, 16#0063#,
16#0036#, 16#0032#, 16#0032#, 16#0039#,
16#0031#, 16#0039#, 16#0038#, 16#0034#,
16#006B#, 16#0061#, 16#006E#, 16#0061#,
others => 16#0000#),
others => <>);
-- jisc62291984kana
N287 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0039#, 16#0036#,
others => 16#0000#),
others => <>);
-- isoir96
N288 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 23,
Length => 23,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0039#, 16#0036#, 16#006A#,
16#0069#, 16#0073#, 16#0063#, 16#0036#,
16#0032#, 16#0032#, 16#0039#, 16#0031#,
16#0039#, 16#0038#, 16#0034#, 16#006B#,
16#0061#, 16#006E#, 16#0061#,
others => 16#0000#),
others => <>);
-- csiso96jisc62291984kana
N289 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0032#,
16#0030#, 16#0033#, 16#0033#, 16#0031#,
16#0039#, 16#0038#, 16#0033#,
others => 16#0000#),
others => <>);
-- iso20331983
N290 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0039#, 16#0038#,
others => 16#0000#),
others => <>);
-- isoir98
N291 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#0065#, 16#0031#, 16#0033#, 16#0062#,
others => 16#0000#),
others => <>);
-- e13b
N292 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0032#, 16#0030#, 16#0033#,
16#0033#,
others => 16#0000#),
others => <>);
-- csiso2033
N293 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0061#, 16#006E#, 16#0073#, 16#0069#,
16#0078#, 16#0033#, 16#0031#, 16#0031#,
16#0030#, 16#0031#, 16#0039#, 16#0038#,
16#0033#,
others => 16#0000#),
others => <>);
-- ansix31101983
N294 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0039#, 16#0039#,
others => 16#0000#),
others => <>);
-- isoir99
N295 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0061#, 16#0074#,
16#0035#, 16#0030#, 16#0030#, 16#0031#,
16#0039#, 16#0038#, 16#0033#,
others => 16#0000#),
others => <>);
-- csat5001983
N296 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#006E#, 16#0061#, 16#0070#, 16#006C#,
16#0070#, 16#0073#,
others => 16#0000#),
others => <>);
-- naplps
N297 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0039#, 16#0039#, 16#006E#,
16#0061#, 16#0070#, 16#006C#, 16#0070#,
16#0073#,
others => 16#0000#),
others => <>);
-- csiso99naplps
N298 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0074#, 16#0036#, 16#0031#, 16#0037#,
16#0062#, 16#0069#, 16#0074#,
others => 16#0000#),
others => <>);
-- t617bit
N299 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0030#, 16#0032#,
others => 16#0000#),
others => <>);
-- isoir102
N300 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 15,
Length => 15,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0030#, 16#0032#,
16#0074#, 16#0036#, 16#0031#, 16#0037#,
16#0062#, 16#0069#, 16#0074#,
others => 16#0000#),
others => <>);
-- csiso102t617bit
N301 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0074#, 16#0036#, 16#0031#, 16#0038#,
16#0062#, 16#0069#, 16#0074#,
others => 16#0000#),
others => <>);
-- t618bit
N302 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0074#, 16#0036#, 16#0031#,
others => 16#0000#),
others => <>);
-- t61
N303 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0030#, 16#0033#,
others => 16#0000#),
others => <>);
-- isoir103
N304 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 15,
Length => 15,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0030#, 16#0033#,
16#0074#, 16#0036#, 16#0031#, 16#0038#,
16#0062#, 16#0069#, 16#0074#,
others => 16#0000#),
others => <>);
-- csiso103t618bit
N305 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0065#, 16#0063#, 16#006D#, 16#0061#,
16#0063#, 16#0079#, 16#0072#, 16#0069#,
16#006C#, 16#006C#, 16#0069#, 16#0063#,
others => 16#0000#),
others => <>);
-- ecmacyrillic
N306 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0031#, 16#0031#,
others => 16#0000#),
others => <>);
-- isoir111
N307 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#006B#, 16#006F#, 16#0069#, 16#0038#,
16#0065#,
others => 16#0000#),
others => <>);
-- koi8e
N308 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 20,
Length => 20,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0031#, 16#0031#,
16#0065#, 16#0063#, 16#006D#, 16#0061#,
16#0063#, 16#0079#, 16#0072#, 16#0069#,
16#006C#, 16#006C#, 16#0069#, 16#0063#,
others => 16#0000#),
others => <>);
-- csiso111ecmacyrillic
N309 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0061#, 16#007A#,
16#0032#, 16#0034#, 16#0033#, 16#0034#,
16#0031#, 16#0039#, 16#0038#, 16#0035#,
16#0031#,
others => 16#0000#),
others => <>);
-- csaz243419851
N310 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0032#, 16#0031#,
others => 16#0000#),
others => <>);
-- isoir121
N311 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#0063#, 16#0061#,
others => 16#0000#),
others => <>);
-- iso646ca
N312 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0073#, 16#0061#, 16#0037#,
16#0031#,
others => 16#0000#),
others => <>);
-- csa71
N313 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 2,
Length => 2,
Value =>
(16#0063#, 16#0061#,
others => 16#0000#),
others => <>);
-- ca
N314 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0032#, 16#0031#,
16#0063#, 16#0061#, 16#006E#, 16#0061#,
16#0064#, 16#0069#, 16#0061#, 16#006E#,
16#0031#,
others => 16#0000#),
others => <>);
-- csiso121canadian1
N315 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0061#, 16#007A#,
16#0032#, 16#0034#, 16#0033#, 16#0034#,
16#0031#, 16#0039#, 16#0038#, 16#0035#,
16#0032#,
others => 16#0000#),
others => <>);
-- csaz243419852
N316 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0032#, 16#0032#,
others => 16#0000#),
others => <>);
-- isoir122
N317 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#0063#, 16#0061#,
16#0032#,
others => 16#0000#),
others => <>);
-- iso646ca2
N318 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0073#, 16#0061#, 16#0037#,
16#0032#,
others => 16#0000#),
others => <>);
-- csa72
N319 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0032#, 16#0032#,
16#0063#, 16#0061#, 16#006E#, 16#0061#,
16#0064#, 16#0069#, 16#0061#, 16#006E#,
16#0032#,
others => 16#0000#),
others => <>);
-- csiso122canadian2
N320 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 14,
Length => 14,
Value =>
(16#0063#, 16#0073#, 16#0061#, 16#007A#,
16#0032#, 16#0034#, 16#0033#, 16#0034#,
16#0031#, 16#0039#, 16#0038#, 16#0035#,
16#0067#, 16#0072#,
others => 16#0000#),
others => <>);
-- csaz24341985gr
N321 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0032#, 16#0033#,
others => 16#0000#),
others => <>);
-- isoir123
N322 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 22,
Length => 22,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0032#, 16#0033#,
16#0063#, 16#0073#, 16#0061#, 16#007A#,
16#0032#, 16#0034#, 16#0033#, 16#0034#,
16#0031#, 16#0039#, 16#0038#, 16#0035#,
16#0067#, 16#0072#,
others => 16#0000#),
others => <>);
-- csiso123csaz24341985gr
N323 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0036#,
16#0065#,
others => 16#0000#),
others => <>);
-- iso88596e
N324 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0038#, 16#0038#, 16#0035#,
16#0039#, 16#0036#, 16#0065#,
others => 16#0000#),
others => <>);
-- csiso88596e
N325 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0036#,
16#0069#,
others => 16#0000#),
others => <>);
-- iso88596i
N326 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0038#, 16#0038#, 16#0035#,
16#0039#, 16#0036#, 16#0069#,
others => 16#0000#),
others => <>);
-- csiso88596i
N327 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0074#, 16#0031#, 16#0030#, 16#0031#,
16#0067#, 16#0032#,
others => 16#0000#),
others => <>);
-- t101g2
N328 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0032#, 16#0038#,
others => 16#0000#),
others => <>);
-- isoir128
N329 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 14,
Length => 14,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0032#, 16#0038#,
16#0074#, 16#0031#, 16#0030#, 16#0031#,
16#0067#, 16#0032#,
others => 16#0000#),
others => <>);
-- csiso128t101g2
N330 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0038#,
16#0065#,
others => 16#0000#),
others => <>);
-- iso88598e
N331 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0038#, 16#0038#, 16#0035#,
16#0039#, 16#0038#, 16#0065#,
others => 16#0000#),
others => <>);
-- csiso88598e
N332 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0038#,
16#0069#,
others => 16#0000#),
others => <>);
-- iso88598i
N333 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0038#, 16#0038#, 16#0035#,
16#0039#, 16#0038#, 16#0069#,
others => 16#0000#),
others => <>);
-- csiso88598i
N334 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#006E#, 16#0033#,
16#0036#, 16#0039#, 16#0031#, 16#0030#,
16#0033#,
others => 16#0000#),
others => <>);
-- csn369103
N335 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0033#, 16#0039#,
others => 16#0000#),
others => <>);
-- isoir139
N336 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0033#, 16#0039#,
16#0063#, 16#0073#, 16#006E#, 16#0033#,
16#0036#, 16#0039#, 16#0031#, 16#0030#,
16#0033#,
others => 16#0000#),
others => <>);
-- csiso139csn369103
N337 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#006A#, 16#0075#, 16#0073#, 16#0069#,
16#0062#, 16#0031#, 16#0030#, 16#0030#,
16#0032#,
others => 16#0000#),
others => <>);
-- jusib1002
N338 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0034#, 16#0031#,
others => 16#0000#),
others => <>);
-- isoir141
N339 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#0079#, 16#0075#,
others => 16#0000#),
others => <>);
-- iso646yu
N340 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 2,
Length => 2,
Value =>
(16#006A#, 16#0073#,
others => 16#0000#),
others => <>);
-- js
N341 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 2,
Length => 2,
Value =>
(16#0079#, 16#0075#,
others => 16#0000#),
others => <>);
-- yu
N342 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0034#, 16#0031#,
16#006A#, 16#0075#, 16#0073#, 16#0069#,
16#0062#, 16#0031#, 16#0030#, 16#0030#,
16#0032#,
others => 16#0000#),
others => <>);
-- csiso141jusib1002
N343 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0065#, 16#0063#, 16#0070#,
16#0032#, 16#0037#, 16#0031#,
others => 16#0000#),
others => <>);
-- iecp271
N344 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0034#, 16#0033#,
others => 16#0000#),
others => <>);
-- isoir143
N345 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 15,
Length => 15,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0034#, 16#0033#,
16#0069#, 16#0065#, 16#0063#, 16#0070#,
16#0032#, 16#0037#, 16#0031#,
others => 16#0000#),
others => <>);
-- csiso143iecp271
N346 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#006A#, 16#0075#, 16#0073#, 16#0069#,
16#0062#, 16#0031#, 16#0030#, 16#0030#,
16#0033#, 16#0073#, 16#0065#, 16#0072#,
16#0062#,
others => 16#0000#),
others => <>);
-- jusib1003serb
N347 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0034#, 16#0036#,
others => 16#0000#),
others => <>);
-- isoir146
N348 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0073#, 16#0065#, 16#0072#, 16#0062#,
16#0069#, 16#0061#, 16#006E#,
others => 16#0000#),
others => <>);
-- serbian
N349 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 15,
Length => 15,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0034#, 16#0036#,
16#0073#, 16#0065#, 16#0072#, 16#0062#,
16#0069#, 16#0061#, 16#006E#,
others => 16#0000#),
others => <>);
-- csiso146serbian
N350 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#006A#, 16#0075#, 16#0073#, 16#0069#,
16#0062#, 16#0031#, 16#0030#, 16#0030#,
16#0033#, 16#006D#, 16#0061#, 16#0063#,
others => 16#0000#),
others => <>);
-- jusib1003mac
N351 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#006D#, 16#0061#, 16#0063#, 16#0065#,
16#0064#, 16#006F#, 16#006E#, 16#0069#,
16#0061#, 16#006E#,
others => 16#0000#),
others => <>);
-- macedonian
N352 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0034#, 16#0037#,
others => 16#0000#),
others => <>);
-- isoir147
N353 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 18,
Length => 18,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0034#, 16#0037#,
16#006D#, 16#0061#, 16#0063#, 16#0065#,
16#0064#, 16#006F#, 16#006E#, 16#0069#,
16#0061#, 16#006E#,
others => 16#0000#),
others => <>);
-- csiso147macedonian
N354 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0067#, 16#0072#, 16#0065#, 16#0065#,
16#006B#, 16#0063#, 16#0063#, 16#0069#,
16#0074#, 16#0074#,
others => 16#0000#),
others => <>);
-- greekccitt
N355 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0035#, 16#0030#,
others => 16#0000#),
others => <>);
-- isoir150
N356 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0035#, 16#0030#,
others => 16#0000#),
others => <>);
-- csiso150
N357 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 18,
Length => 18,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0035#, 16#0030#,
16#0067#, 16#0072#, 16#0065#, 16#0065#,
16#006B#, 16#0063#, 16#0063#, 16#0069#,
16#0074#, 16#0074#,
others => 16#0000#),
others => <>);
-- csiso150greekccitt
N358 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#006E#, 16#0063#, 16#006E#, 16#0063#,
16#0031#, 16#0030#, 16#0038#, 16#0031#,
others => 16#0000#),
others => <>);
-- ncnc1081
N359 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#0063#, 16#0075#, 16#0062#, 16#0061#,
others => 16#0000#),
others => <>);
-- cuba
N360 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0035#, 16#0031#,
others => 16#0000#),
others => <>);
-- isoir151
N361 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#0063#, 16#0075#,
others => 16#0000#),
others => <>);
-- iso646cu
N362 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0035#, 16#0031#,
16#0063#, 16#0075#, 16#0062#, 16#0061#,
others => 16#0000#),
others => <>);
-- csiso151cuba
N363 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0039#, 16#0033#, 16#0037#, 16#0032#,
16#0032#, 16#0035#,
others => 16#0000#),
others => <>);
-- iso6937225
N364 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0035#, 16#0032#,
others => 16#0000#),
others => <>);
-- isoir152
N365 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0036#, 16#0039#, 16#0033#,
16#0037#, 16#0061#, 16#0064#, 16#0064#,
others => 16#0000#),
others => <>);
-- csiso6937add
N366 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0067#, 16#006F#, 16#0073#, 16#0074#,
16#0031#, 16#0039#, 16#0037#, 16#0036#,
16#0038#, 16#0037#, 16#0034#,
others => 16#0000#),
others => <>);
-- gost1976874
N367 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0073#, 16#0074#, 16#0073#, 16#0065#,
16#0076#, 16#0033#, 16#0035#, 16#0038#,
16#0038#, 16#0038#,
others => 16#0000#),
others => <>);
-- stsev35888
N368 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0035#, 16#0033#,
others => 16#0000#),
others => <>);
-- isoir153
N369 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 19,
Length => 19,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0035#, 16#0033#,
16#0067#, 16#006F#, 16#0073#, 16#0074#,
16#0031#, 16#0039#, 16#0037#, 16#0036#,
16#0038#, 16#0037#, 16#0034#,
others => 16#0000#),
others => <>);
-- csiso153gost1976874
N370 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0073#,
16#0075#, 16#0070#, 16#0070#,
others => 16#0000#),
others => <>);
-- iso8859supp
N371 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0035#, 16#0034#,
others => 16#0000#),
others => <>);
-- isoir154
N372 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#006C#, 16#0061#, 16#0074#, 16#0069#,
16#006E#, 16#0031#, 16#0032#, 16#0035#,
others => 16#0000#),
others => <>);
-- latin125
N373 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0038#, 16#0038#, 16#0035#,
16#0039#, 16#0073#, 16#0075#, 16#0070#,
16#0070#,
others => 16#0000#),
others => <>);
-- csiso8859supp
N374 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0031#,
16#0030#, 16#0033#, 16#0036#, 16#0037#,
16#0062#, 16#006F#, 16#0078#,
others => 16#0000#),
others => <>);
-- iso10367box
N375 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0035#, 16#0035#,
others => 16#0000#),
others => <>);
-- isoir155
N376 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0030#, 16#0033#,
16#0036#, 16#0037#, 16#0062#, 16#006F#,
16#0078#,
others => 16#0000#),
others => <>);
-- csiso10367box
N377 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#006C#, 16#0061#, 16#0074#, 16#0069#,
16#006E#, 16#006C#, 16#0061#, 16#0070#,
others => 16#0000#),
others => <>);
-- latinlap
N378 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#006C#, 16#0061#, 16#0070#,
others => 16#0000#),
others => <>);
-- lap
N379 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0035#, 16#0038#,
others => 16#0000#),
others => <>);
-- isoir158
N380 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0035#, 16#0038#,
16#006C#, 16#0061#, 16#0070#,
others => 16#0000#),
others => <>);
-- csiso158lap
N381 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#006A#, 16#0069#, 16#0073#, 16#0078#,
16#0032#, 16#0031#, 16#0032#, 16#0031#,
16#0039#, 16#0039#, 16#0030#,
others => 16#0000#),
others => <>);
-- jisx2121990
N382 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#0078#, 16#0032#, 16#0031#, 16#0032#,
others => 16#0000#),
others => <>);
-- x212
N383 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0035#, 16#0039#,
others => 16#0000#),
others => <>);
-- isoir159
N384 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 19,
Length => 19,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0035#, 16#0039#,
16#006A#, 16#0069#, 16#0073#, 16#0078#,
16#0032#, 16#0031#, 16#0032#, 16#0031#,
16#0039#, 16#0039#, 16#0030#,
others => 16#0000#),
others => <>);
-- csiso159jisx2121990
N385 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0064#, 16#0073#, 16#0032#, 16#0030#,
16#0038#, 16#0039#,
others => 16#0000#),
others => <>);
-- ds2089
N386 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#0064#, 16#006B#,
others => 16#0000#),
others => <>);
-- iso646dk
N387 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 2,
Length => 2,
Value =>
(16#0064#, 16#006B#,
others => 16#0000#),
others => <>);
-- dk
N388 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 14,
Length => 14,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0036#, 16#0034#, 16#0036#,
16#0064#, 16#0061#, 16#006E#, 16#0069#,
16#0073#, 16#0068#,
others => 16#0000#),
others => <>);
-- csiso646danish
N389 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#0075#, 16#0073#, 16#0064#, 16#006B#,
others => 16#0000#),
others => <>);
-- usdk
N390 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0063#, 16#0073#, 16#0075#, 16#0073#,
16#0064#, 16#006B#,
others => 16#0000#),
others => <>);
-- csusdk
N391 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#0064#, 16#006B#, 16#0075#, 16#0073#,
others => 16#0000#),
others => <>);
-- dkus
N392 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0063#, 16#0073#, 16#0064#, 16#006B#,
16#0075#, 16#0073#,
others => 16#0000#),
others => <>);
-- csdkus
N393 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#006B#, 16#0073#, 16#0063#, 16#0035#,
16#0036#, 16#0033#, 16#0036#,
others => 16#0000#),
others => <>);
-- ksc5636
N394 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0036#,
16#0034#, 16#0036#, 16#006B#, 16#0072#,
others => 16#0000#),
others => <>);
-- iso646kr
N395 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#006B#, 16#0073#,
16#0063#, 16#0035#, 16#0036#, 16#0033#,
16#0036#,
others => 16#0000#),
others => <>);
-- csksc5636
N396 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0075#, 16#006E#, 16#0069#, 16#0063#,
16#006F#, 16#0064#, 16#0065#, 16#0031#,
16#0031#, 16#0075#, 16#0074#, 16#0066#,
16#0037#,
others => 16#0000#),
others => <>);
-- unicode11utf7
N397 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 15,
Length => 15,
Value =>
(16#0063#, 16#0073#, 16#0075#, 16#006E#,
16#0069#, 16#0063#, 16#006F#, 16#0064#,
16#0065#, 16#0031#, 16#0031#, 16#0075#,
16#0074#, 16#0066#, 16#0037#,
others => 16#0000#),
others => <>);
-- csunicode11utf7
N398 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0032#,
16#0030#, 16#0032#, 16#0032#, 16#0063#,
16#006E#,
others => 16#0000#),
others => <>);
-- iso2022cn
N399 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0032#, 16#0030#, 16#0032#,
16#0032#, 16#0063#, 16#006E#,
others => 16#0000#),
others => <>);
-- csiso2022cn
N400 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0032#,
16#0030#, 16#0032#, 16#0032#, 16#0063#,
16#006E#, 16#0065#, 16#0078#, 16#0074#,
others => 16#0000#),
others => <>);
-- iso2022cnext
N401 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 14,
Length => 14,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0032#, 16#0030#, 16#0032#,
16#0032#, 16#0063#, 16#006E#, 16#0065#,
16#0078#, 16#0074#,
others => 16#0000#),
others => <>);
-- csiso2022cnext
N402 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#0075#, 16#0074#, 16#0066#, 16#0038#,
others => 16#0000#),
others => <>);
-- utf8
N403 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0063#, 16#0073#, 16#0075#, 16#0074#,
16#0066#, 16#0038#,
others => 16#0000#),
others => <>);
-- csutf8
N404 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0031#,
16#0033#,
others => 16#0000#),
others => <>);
-- iso885913
N405 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0038#, 16#0038#, 16#0035#,
16#0039#, 16#0031#, 16#0033#,
others => 16#0000#),
others => <>);
-- csiso885913
N406 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0031#,
16#0034#,
others => 16#0000#),
others => <>);
-- iso885914
N407 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0031#, 16#0039#, 16#0039#,
others => 16#0000#),
others => <>);
-- isoir199
N408 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0031#,
16#0034#, 16#0031#, 16#0039#, 16#0039#,
16#0038#,
others => 16#0000#),
others => <>);
-- iso8859141998
N409 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#006C#, 16#0061#, 16#0074#, 16#0069#,
16#006E#, 16#0038#,
others => 16#0000#),
others => <>);
-- latin8
N410 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0063#,
16#0065#, 16#006C#, 16#0074#, 16#0069#,
16#0063#,
others => 16#0000#),
others => <>);
-- isoceltic
N411 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 2,
Length => 2,
Value =>
(16#006C#, 16#0038#,
others => 16#0000#),
others => <>);
-- l8
N412 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0038#, 16#0038#, 16#0035#,
16#0039#, 16#0031#, 16#0034#,
others => 16#0000#),
others => <>);
-- csiso885914
N413 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0031#,
16#0035#,
others => 16#0000#),
others => <>);
-- iso885915
N414 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#006C#, 16#0061#, 16#0074#, 16#0069#,
16#006E#, 16#0039#,
others => 16#0000#),
others => <>);
-- latin9
N415 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0038#, 16#0038#, 16#0035#,
16#0039#, 16#0031#, 16#0035#,
others => 16#0000#),
others => <>);
-- csiso885915
N416 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0031#,
16#0036#,
others => 16#0000#),
others => <>);
-- iso885916
N417 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0069#,
16#0072#, 16#0032#, 16#0032#, 16#0036#,
others => 16#0000#),
others => <>);
-- isoir226
N418 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0031#,
16#0036#, 16#0032#, 16#0030#, 16#0030#,
16#0031#,
others => 16#0000#),
others => <>);
-- iso8859162001
N419 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#006C#, 16#0061#, 16#0074#, 16#0069#,
16#006E#, 16#0031#, 16#0030#,
others => 16#0000#),
others => <>);
-- latin10
N420 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#006C#, 16#0031#, 16#0030#,
others => 16#0000#),
others => <>);
-- l10
N421 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0038#, 16#0038#, 16#0035#,
16#0039#, 16#0031#, 16#0036#,
others => 16#0000#),
others => <>);
-- csiso885916
N422 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0067#, 16#0062#, 16#006B#,
others => 16#0000#),
others => <>);
-- gbk
N423 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0039#, 16#0033#,
16#0036#,
others => 16#0000#),
others => <>);
-- cp936
N424 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#006D#, 16#0073#, 16#0039#, 16#0033#,
16#0036#,
others => 16#0000#),
others => <>);
-- ms936
N425 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0077#, 16#0069#, 16#006E#, 16#0064#,
16#006F#, 16#0077#, 16#0073#, 16#0039#,
16#0033#, 16#0036#,
others => 16#0000#),
others => <>);
-- windows936
N426 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0073#, 16#0067#, 16#0062#,
16#006B#,
others => 16#0000#),
others => <>);
-- csgbk
N427 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0067#, 16#0062#, 16#0031#, 16#0038#,
16#0030#, 16#0033#, 16#0030#,
others => 16#0000#),
others => <>);
-- gb18030
N428 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#0067#, 16#0062#,
16#0031#, 16#0038#, 16#0030#, 16#0033#,
16#0030#,
others => 16#0000#),
others => <>);
-- csgb18030
N429 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 14,
Length => 14,
Value =>
(16#006F#, 16#0073#, 16#0064#, 16#0065#,
16#0062#, 16#0063#, 16#0064#, 16#0069#,
16#0063#, 16#0064#, 16#0066#, 16#0034#,
16#0031#, 16#0035#,
others => 16#0000#),
others => <>);
-- osdebcdicdf415
N430 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 16,
Length => 16,
Value =>
(16#0063#, 16#0073#, 16#006F#, 16#0073#,
16#0064#, 16#0065#, 16#0062#, 16#0063#,
16#0064#, 16#0069#, 16#0063#, 16#0064#,
16#0066#, 16#0034#, 16#0031#, 16#0035#,
others => 16#0000#),
others => <>);
-- csosdebcdicdf415
N431 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 15,
Length => 15,
Value =>
(16#006F#, 16#0073#, 16#0064#, 16#0065#,
16#0062#, 16#0063#, 16#0064#, 16#0069#,
16#0063#, 16#0064#, 16#0066#, 16#0033#,
16#0069#, 16#0072#, 16#0076#,
others => 16#0000#),
others => <>);
-- osdebcdicdf3irv
N432 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0063#, 16#0073#, 16#006F#, 16#0073#,
16#0064#, 16#0065#, 16#0062#, 16#0063#,
16#0064#, 16#0069#, 16#0063#, 16#0064#,
16#0066#, 16#0033#, 16#0069#, 16#0072#,
16#0076#,
others => 16#0000#),
others => <>);
-- csosdebcdicdf3irv
N433 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#006F#, 16#0073#, 16#0064#, 16#0065#,
16#0062#, 16#0063#, 16#0064#, 16#0069#,
16#0063#, 16#0064#, 16#0066#, 16#0034#,
16#0031#,
others => 16#0000#),
others => <>);
-- osdebcdicdf41
N434 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 15,
Length => 15,
Value =>
(16#0063#, 16#0073#, 16#006F#, 16#0073#,
16#0064#, 16#0065#, 16#0062#, 16#0063#,
16#0064#, 16#0069#, 16#0063#, 16#0064#,
16#0066#, 16#0034#, 16#0031#,
others => 16#0000#),
others => <>);
-- csosdebcdicdf41
N435 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0031#,
16#0031#, 16#0035#, 16#0034#, 16#0038#,
16#0031#,
others => 16#0000#),
others => <>);
-- iso115481
N436 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0074#,
16#0072#, 16#0031#, 16#0031#, 16#0035#,
16#0034#, 16#0038#, 16#0031#,
others => 16#0000#),
others => <>);
-- isotr115481
N437 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0073#,
16#006F#, 16#0031#, 16#0031#, 16#0035#,
16#0034#, 16#0038#, 16#0031#,
others => 16#0000#),
others => <>);
-- csiso115481
N438 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#006B#, 16#007A#, 16#0031#, 16#0030#,
16#0034#, 16#0038#,
others => 16#0000#),
others => <>);
-- kz1048
N439 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0073#, 16#0074#, 16#0072#, 16#006B#,
16#0031#, 16#0030#, 16#0034#, 16#0038#,
16#0032#, 16#0030#, 16#0030#, 16#0032#,
others => 16#0000#),
others => <>);
-- strk10482002
N440 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0072#, 16#006B#, 16#0031#, 16#0030#,
16#0034#, 16#0038#,
others => 16#0000#),
others => <>);
-- rk1048
N441 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#006B#, 16#007A#,
16#0031#, 16#0030#, 16#0034#, 16#0038#,
others => 16#0000#),
others => <>);
-- cskz1048
N442 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0031#,
16#0030#, 16#0036#, 16#0034#, 16#0036#,
16#0075#, 16#0063#, 16#0073#, 16#0032#,
others => 16#0000#),
others => <>);
-- iso10646ucs2
N443 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#0075#, 16#006E#,
16#0069#, 16#0063#, 16#006F#, 16#0064#,
16#0065#,
others => 16#0000#),
others => <>);
-- csunicode
N444 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0031#,
16#0030#, 16#0036#, 16#0034#, 16#0036#,
16#0075#, 16#0063#, 16#0073#, 16#0034#,
others => 16#0000#),
others => <>);
-- iso10646ucs4
N445 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0063#, 16#0073#, 16#0075#, 16#0063#,
16#0073#, 16#0034#,
others => 16#0000#),
others => <>);
-- csucs4
N446 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 16,
Length => 16,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0031#,
16#0030#, 16#0036#, 16#0034#, 16#0036#,
16#0075#, 16#0063#, 16#0073#, 16#0062#,
16#0061#, 16#0073#, 16#0069#, 16#0063#,
others => 16#0000#),
others => <>);
-- iso10646ucsbasic
N447 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 14,
Length => 14,
Value =>
(16#0063#, 16#0073#, 16#0075#, 16#006E#,
16#0069#, 16#0063#, 16#006F#, 16#0064#,
16#0065#, 16#0061#, 16#0073#, 16#0063#,
16#0069#, 16#0069#,
others => 16#0000#),
others => <>);
-- csunicodeascii
N448 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 21,
Length => 21,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0031#,
16#0030#, 16#0036#, 16#0034#, 16#0036#,
16#0075#, 16#006E#, 16#0069#, 16#0063#,
16#006F#, 16#0064#, 16#0065#, 16#006C#,
16#0061#, 16#0074#, 16#0069#, 16#006E#,
16#0031#,
others => 16#0000#),
others => <>);
-- iso10646unicodelatin1
N449 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 15,
Length => 15,
Value =>
(16#0063#, 16#0073#, 16#0075#, 16#006E#,
16#0069#, 16#0063#, 16#006F#, 16#0064#,
16#0065#, 16#006C#, 16#0061#, 16#0074#,
16#0069#, 16#006E#, 16#0031#,
others => 16#0000#),
others => <>);
-- csunicodelatin1
N450 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0031#,
16#0030#, 16#0036#, 16#0034#, 16#0036#,
others => 16#0000#),
others => <>);
-- iso10646
N451 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0031#,
16#0030#, 16#0036#, 16#0034#, 16#0036#,
16#006A#, 16#0031#,
others => 16#0000#),
others => <>);
-- iso10646j1
N452 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0063#, 16#0073#, 16#0075#, 16#006E#,
16#0069#, 16#0063#, 16#006F#, 16#0064#,
16#0065#, 16#006A#, 16#0061#, 16#0070#,
16#0061#, 16#006E#, 16#0065#, 16#0073#,
16#0065#,
others => 16#0000#),
others => <>);
-- csunicodejapanese
N453 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0075#,
16#006E#, 16#0069#, 16#0063#, 16#006F#,
16#0064#, 16#0065#, 16#0069#, 16#0062#,
16#006D#, 16#0031#, 16#0032#, 16#0036#,
16#0031#,
others => 16#0000#),
others => <>);
-- isounicodeibm1261
N454 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 16,
Length => 16,
Value =>
(16#0063#, 16#0073#, 16#0075#, 16#006E#,
16#0069#, 16#0063#, 16#006F#, 16#0064#,
16#0065#, 16#0069#, 16#0062#, 16#006D#,
16#0031#, 16#0032#, 16#0036#, 16#0031#,
others => 16#0000#),
others => <>);
-- csunicodeibm1261
N455 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0075#,
16#006E#, 16#0069#, 16#0063#, 16#006F#,
16#0064#, 16#0065#, 16#0069#, 16#0062#,
16#006D#, 16#0031#, 16#0032#, 16#0036#,
16#0038#,
others => 16#0000#),
others => <>);
-- isounicodeibm1268
N456 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 16,
Length => 16,
Value =>
(16#0063#, 16#0073#, 16#0075#, 16#006E#,
16#0069#, 16#0063#, 16#006F#, 16#0064#,
16#0065#, 16#0069#, 16#0062#, 16#006D#,
16#0031#, 16#0032#, 16#0036#, 16#0038#,
others => 16#0000#),
others => <>);
-- csunicodeibm1268
N457 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0075#,
16#006E#, 16#0069#, 16#0063#, 16#006F#,
16#0064#, 16#0065#, 16#0069#, 16#0062#,
16#006D#, 16#0031#, 16#0032#, 16#0037#,
16#0036#,
others => 16#0000#),
others => <>);
-- isounicodeibm1276
N458 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 16,
Length => 16,
Value =>
(16#0063#, 16#0073#, 16#0075#, 16#006E#,
16#0069#, 16#0063#, 16#006F#, 16#0064#,
16#0065#, 16#0069#, 16#0062#, 16#006D#,
16#0031#, 16#0032#, 16#0037#, 16#0036#,
others => 16#0000#),
others => <>);
-- csunicodeibm1276
N459 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0075#,
16#006E#, 16#0069#, 16#0063#, 16#006F#,
16#0064#, 16#0065#, 16#0069#, 16#0062#,
16#006D#, 16#0031#, 16#0032#, 16#0036#,
16#0034#,
others => 16#0000#),
others => <>);
-- isounicodeibm1264
N460 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 16,
Length => 16,
Value =>
(16#0063#, 16#0073#, 16#0075#, 16#006E#,
16#0069#, 16#0063#, 16#006F#, 16#0064#,
16#0065#, 16#0069#, 16#0062#, 16#006D#,
16#0031#, 16#0032#, 16#0036#, 16#0034#,
others => 16#0000#),
others => <>);
-- csunicodeibm1264
N461 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0075#,
16#006E#, 16#0069#, 16#0063#, 16#006F#,
16#0064#, 16#0065#, 16#0069#, 16#0062#,
16#006D#, 16#0031#, 16#0032#, 16#0036#,
16#0035#,
others => 16#0000#),
others => <>);
-- isounicodeibm1265
N462 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 16,
Length => 16,
Value =>
(16#0063#, 16#0073#, 16#0075#, 16#006E#,
16#0069#, 16#0063#, 16#006F#, 16#0064#,
16#0065#, 16#0069#, 16#0062#, 16#006D#,
16#0031#, 16#0032#, 16#0036#, 16#0035#,
others => 16#0000#),
others => <>);
-- csunicodeibm1265
N463 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0075#, 16#006E#, 16#0069#, 16#0063#,
16#006F#, 16#0064#, 16#0065#, 16#0031#,
16#0031#,
others => 16#0000#),
others => <>);
-- unicode11
N464 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0075#, 16#006E#,
16#0069#, 16#0063#, 16#006F#, 16#0064#,
16#0065#, 16#0031#, 16#0031#,
others => 16#0000#),
others => <>);
-- csunicode11
N465 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#0073#, 16#0063#, 16#0073#, 16#0075#,
others => 16#0000#),
others => <>);
-- scsu
N466 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0063#, 16#0073#, 16#0073#, 16#0063#,
16#0073#, 16#0075#,
others => 16#0000#),
others => <>);
-- csscsu
N467 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#0075#, 16#0074#, 16#0066#, 16#0037#,
others => 16#0000#),
others => <>);
-- utf7
N468 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0063#, 16#0073#, 16#0075#, 16#0074#,
16#0066#, 16#0037#,
others => 16#0000#),
others => <>);
-- csutf7
N469 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0075#, 16#0074#, 16#0066#, 16#0031#,
16#0036#, 16#0062#, 16#0065#,
others => 16#0000#),
others => <>);
-- utf16be
N470 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#0075#, 16#0074#,
16#0066#, 16#0031#, 16#0036#, 16#0062#,
16#0065#,
others => 16#0000#),
others => <>);
-- csutf16be
N471 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0075#, 16#0074#, 16#0066#, 16#0031#,
16#0036#, 16#006C#, 16#0065#,
others => 16#0000#),
others => <>);
-- utf16le
N472 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#0075#, 16#0074#,
16#0066#, 16#0031#, 16#0036#, 16#006C#,
16#0065#,
others => 16#0000#),
others => <>);
-- csutf16le
N473 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0075#, 16#0074#, 16#0066#, 16#0031#,
16#0036#,
others => 16#0000#),
others => <>);
-- utf16
N474 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0063#, 16#0073#, 16#0075#, 16#0074#,
16#0066#, 16#0031#, 16#0036#,
others => 16#0000#),
others => <>);
-- csutf16
N475 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0065#, 16#0073#, 16#0075#,
16#0038#,
others => 16#0000#),
others => <>);
-- cesu8
N476 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0063#, 16#0073#, 16#0063#, 16#0065#,
16#0073#, 16#0075#, 16#0038#,
others => 16#0000#),
others => <>);
-- cscesu8
N477 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0075#, 16#0074#, 16#0066#, 16#0033#,
16#0032#,
others => 16#0000#),
others => <>);
-- utf32
N478 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0063#, 16#0073#, 16#0075#, 16#0074#,
16#0066#, 16#0033#, 16#0032#,
others => 16#0000#),
others => <>);
-- csutf32
N479 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0075#, 16#0074#, 16#0066#, 16#0033#,
16#0032#, 16#0062#, 16#0065#,
others => 16#0000#),
others => <>);
-- utf32be
N480 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#0075#, 16#0074#,
16#0066#, 16#0033#, 16#0032#, 16#0062#,
16#0065#,
others => 16#0000#),
others => <>);
-- csutf32be
N481 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0075#, 16#0074#, 16#0066#, 16#0033#,
16#0032#, 16#006C#, 16#0065#,
others => 16#0000#),
others => <>);
-- utf32le
N482 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#0075#, 16#0074#,
16#0066#, 16#0033#, 16#0032#, 16#006C#,
16#0065#,
others => 16#0000#),
others => <>);
-- csutf32le
N483 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0062#, 16#006F#, 16#0063#, 16#0075#,
16#0031#,
others => 16#0000#),
others => <>);
-- bocu1
N484 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0063#, 16#0073#, 16#0062#, 16#006F#,
16#0063#, 16#0075#, 16#0031#,
others => 16#0000#),
others => <>);
-- csbocu1
N485 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 23,
Length => 23,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0031#,
16#0077#, 16#0069#, 16#006E#, 16#0064#,
16#006F#, 16#0077#, 16#0073#, 16#0033#,
16#0030#, 16#006C#, 16#0061#, 16#0074#,
16#0069#, 16#006E#, 16#0031#,
others => 16#0000#),
others => <>);
-- iso88591windows30latin1
N486 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0063#, 16#0073#, 16#0077#, 16#0069#,
16#006E#, 16#0064#, 16#006F#, 16#0077#,
16#0073#, 16#0033#, 16#0030#, 16#006C#,
16#0061#, 16#0074#, 16#0069#, 16#006E#,
16#0031#,
others => 16#0000#),
others => <>);
-- cswindows30latin1
N487 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 23,
Length => 23,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0031#,
16#0077#, 16#0069#, 16#006E#, 16#0064#,
16#006F#, 16#0077#, 16#0073#, 16#0033#,
16#0031#, 16#006C#, 16#0061#, 16#0074#,
16#0069#, 16#006E#, 16#0031#,
others => 16#0000#),
others => <>);
-- iso88591windows31latin1
N488 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0063#, 16#0073#, 16#0077#, 16#0069#,
16#006E#, 16#0064#, 16#006F#, 16#0077#,
16#0073#, 16#0033#, 16#0031#, 16#006C#,
16#0061#, 16#0074#, 16#0069#, 16#006E#,
16#0031#,
others => 16#0000#),
others => <>);
-- cswindows31latin1
N489 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 21,
Length => 21,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0032#,
16#0077#, 16#0069#, 16#006E#, 16#0064#,
16#006F#, 16#0077#, 16#0073#, 16#006C#,
16#0061#, 16#0074#, 16#0069#, 16#006E#,
16#0032#,
others => 16#0000#),
others => <>);
-- iso88592windowslatin2
N490 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0063#, 16#0073#, 16#0077#, 16#0069#,
16#006E#, 16#0064#, 16#006F#, 16#0077#,
16#0073#, 16#0033#, 16#0031#, 16#006C#,
16#0061#, 16#0074#, 16#0069#, 16#006E#,
16#0032#,
others => 16#0000#),
others => <>);
-- cswindows31latin2
N491 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 21,
Length => 21,
Value =>
(16#0069#, 16#0073#, 16#006F#, 16#0038#,
16#0038#, 16#0035#, 16#0039#, 16#0039#,
16#0077#, 16#0069#, 16#006E#, 16#0064#,
16#006F#, 16#0077#, 16#0073#, 16#006C#,
16#0061#, 16#0074#, 16#0069#, 16#006E#,
16#0035#,
others => 16#0000#),
others => <>);
-- iso88599windowslatin5
N492 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0063#, 16#0073#, 16#0077#, 16#0069#,
16#006E#, 16#0064#, 16#006F#, 16#0077#,
16#0073#, 16#0033#, 16#0031#, 16#006C#,
16#0061#, 16#0074#, 16#0069#, 16#006E#,
16#0035#,
others => 16#0000#),
others => <>);
-- cswindows31latin5
N493 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0068#, 16#0070#, 16#0072#, 16#006F#,
16#006D#, 16#0061#, 16#006E#, 16#0038#,
others => 16#0000#),
others => <>);
-- hproman8
N494 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0072#, 16#006F#, 16#006D#, 16#0061#,
16#006E#, 16#0038#,
others => 16#0000#),
others => <>);
-- roman8
N495 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 2,
Length => 2,
Value =>
(16#0072#, 16#0038#,
others => 16#0000#),
others => <>);
-- r8
N496 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0063#, 16#0073#, 16#0068#, 16#0070#,
16#0072#, 16#006F#, 16#006D#, 16#0061#,
16#006E#, 16#0038#,
others => 16#0000#),
others => <>);
-- cshproman8
N497 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 21,
Length => 21,
Value =>
(16#0061#, 16#0064#, 16#006F#, 16#0062#,
16#0065#, 16#0073#, 16#0074#, 16#0061#,
16#006E#, 16#0064#, 16#0061#, 16#0072#,
16#0064#, 16#0065#, 16#006E#, 16#0063#,
16#006F#, 16#0064#, 16#0069#, 16#006E#,
16#0067#,
others => 16#0000#),
others => <>);
-- adobestandardencoding
N498 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 23,
Length => 23,
Value =>
(16#0063#, 16#0073#, 16#0061#, 16#0064#,
16#006F#, 16#0062#, 16#0065#, 16#0073#,
16#0074#, 16#0061#, 16#006E#, 16#0064#,
16#0061#, 16#0072#, 16#0064#, 16#0065#,
16#006E#, 16#0063#, 16#006F#, 16#0064#,
16#0069#, 16#006E#, 16#0067#,
others => 16#0000#),
others => <>);
-- csadobestandardencoding
N499 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0076#, 16#0065#, 16#006E#, 16#0074#,
16#0075#, 16#0072#, 16#0061#, 16#0075#,
16#0073#,
others => 16#0000#),
others => <>);
-- venturaus
N500 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0076#, 16#0065#,
16#006E#, 16#0074#, 16#0075#, 16#0072#,
16#0061#, 16#0075#, 16#0073#,
others => 16#0000#),
others => <>);
-- csventuraus
N501 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 20,
Length => 20,
Value =>
(16#0076#, 16#0065#, 16#006E#, 16#0074#,
16#0075#, 16#0072#, 16#0061#, 16#0069#,
16#006E#, 16#0074#, 16#0065#, 16#0072#,
16#006E#, 16#0061#, 16#0074#, 16#0069#,
16#006F#, 16#006E#, 16#0061#, 16#006C#,
others => 16#0000#),
others => <>);
-- venturainternational
N502 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 22,
Length => 22,
Value =>
(16#0063#, 16#0073#, 16#0076#, 16#0065#,
16#006E#, 16#0074#, 16#0075#, 16#0072#,
16#0061#, 16#0069#, 16#006E#, 16#0074#,
16#0065#, 16#0072#, 16#006E#, 16#0061#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
16#0061#, 16#006C#,
others => 16#0000#),
others => <>);
-- csventurainternational
N503 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0064#, 16#0065#, 16#0063#, 16#006D#,
16#0063#, 16#0073#,
others => 16#0000#),
others => <>);
-- decmcs
N504 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0064#, 16#0065#, 16#0063#,
others => 16#0000#),
others => <>);
-- dec
N505 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0064#, 16#0065#,
16#0063#, 16#006D#, 16#0063#, 16#0073#,
others => 16#0000#),
others => <>);
-- csdecmcs
N506 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0038#,
16#0035#, 16#0030#,
others => 16#0000#),
others => <>);
-- ibm850
N507 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0038#, 16#0035#,
16#0030#,
others => 16#0000#),
others => <>);
-- cp850
N508 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0038#, 16#0035#, 16#0030#,
others => 16#0000#),
others => <>);
-- 850
N509 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 19,
Length => 19,
Value =>
(16#0063#, 16#0073#, 16#0070#, 16#0063#,
16#0038#, 16#0035#, 16#0030#, 16#006D#,
16#0075#, 16#006C#, 16#0074#, 16#0069#,
16#006C#, 16#0069#, 16#006E#, 16#0067#,
16#0075#, 16#0061#, 16#006C#,
others => 16#0000#),
others => <>);
-- cspc850multilingual
N510 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 18,
Length => 18,
Value =>
(16#0070#, 16#0063#, 16#0038#, 16#0064#,
16#0061#, 16#006E#, 16#0069#, 16#0073#,
16#0068#, 16#006E#, 16#006F#, 16#0072#,
16#0077#, 16#0065#, 16#0067#, 16#0069#,
16#0061#, 16#006E#,
others => 16#0000#),
others => <>);
-- pc8danishnorwegian
N511 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 20,
Length => 20,
Value =>
(16#0063#, 16#0073#, 16#0070#, 16#0063#,
16#0038#, 16#0064#, 16#0061#, 16#006E#,
16#0069#, 16#0073#, 16#0068#, 16#006E#,
16#006F#, 16#0072#, 16#0077#, 16#0065#,
16#0067#, 16#0069#, 16#0061#, 16#006E#,
others => 16#0000#),
others => <>);
-- cspc8danishnorwegian
N512 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0038#,
16#0036#, 16#0032#,
others => 16#0000#),
others => <>);
-- ibm862
N513 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0038#, 16#0036#,
16#0032#,
others => 16#0000#),
others => <>);
-- cp862
N514 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0038#, 16#0036#, 16#0032#,
others => 16#0000#),
others => <>);
-- 862
N515 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 18,
Length => 18,
Value =>
(16#0063#, 16#0073#, 16#0070#, 16#0063#,
16#0038#, 16#0036#, 16#0032#, 16#006C#,
16#0061#, 16#0074#, 16#0069#, 16#006E#,
16#0068#, 16#0065#, 16#0062#, 16#0072#,
16#0065#, 16#0077#,
others => 16#0000#),
others => <>);
-- cspc862latinhebrew
N516 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0070#, 16#0063#, 16#0038#, 16#0074#,
16#0075#, 16#0072#, 16#006B#, 16#0069#,
16#0073#, 16#0068#,
others => 16#0000#),
others => <>);
-- pc8turkish
N517 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0063#, 16#0073#, 16#0070#, 16#0063#,
16#0038#, 16#0074#, 16#0075#, 16#0072#,
16#006B#, 16#0069#, 16#0073#, 16#0068#,
others => 16#0000#),
others => <>);
-- cspc8turkish
N518 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0073#,
16#0079#, 16#006D#, 16#0062#, 16#006F#,
16#006C#, 16#0073#,
others => 16#0000#),
others => <>);
-- ibmsymbols
N519 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0073#, 16#0079#, 16#006D#,
16#0062#, 16#006F#, 16#006C#, 16#0073#,
others => 16#0000#),
others => <>);
-- csibmsymbols
N520 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0074#,
16#0068#, 16#0061#, 16#0069#,
others => 16#0000#),
others => <>);
-- ibmthai
N521 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0074#, 16#0068#, 16#0061#,
16#0069#,
others => 16#0000#),
others => <>);
-- csibmthai
N522 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0068#, 16#0070#, 16#006C#, 16#0065#,
16#0067#, 16#0061#, 16#006C#,
others => 16#0000#),
others => <>);
-- hplegal
N523 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#0068#, 16#0070#,
16#006C#, 16#0065#, 16#0067#, 16#0061#,
16#006C#,
others => 16#0000#),
others => <>);
-- cshplegal
N524 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0068#, 16#0070#, 16#0070#, 16#0069#,
16#0066#, 16#006F#, 16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- hppifont
N525 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0063#, 16#0073#, 16#0068#, 16#0070#,
16#0070#, 16#0069#, 16#0066#, 16#006F#,
16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- cshppifont
N526 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0068#, 16#0070#, 16#006D#, 16#0061#,
16#0074#, 16#0068#, 16#0038#,
others => 16#0000#),
others => <>);
-- hpmath8
N527 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#0068#, 16#0070#,
16#006D#, 16#0061#, 16#0074#, 16#0068#,
16#0038#,
others => 16#0000#),
others => <>);
-- cshpmath8
N528 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 19,
Length => 19,
Value =>
(16#0061#, 16#0064#, 16#006F#, 16#0062#,
16#0065#, 16#0073#, 16#0079#, 16#006D#,
16#0062#, 16#006F#, 16#006C#, 16#0065#,
16#006E#, 16#0063#, 16#006F#, 16#0064#,
16#0069#, 16#006E#, 16#0067#,
others => 16#0000#),
others => <>);
-- adobesymbolencoding
N529 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0063#, 16#0073#, 16#0068#, 16#0070#,
16#0070#, 16#0073#, 16#006D#, 16#0061#,
16#0074#, 16#0068#,
others => 16#0000#),
others => <>);
-- cshppsmath
N530 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0068#, 16#0070#, 16#0064#, 16#0065#,
16#0073#, 16#006B#, 16#0074#, 16#006F#,
16#0070#,
others => 16#0000#),
others => <>);
-- hpdesktop
N531 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0068#, 16#0070#,
16#0064#, 16#0065#, 16#0073#, 16#006B#,
16#0074#, 16#006F#, 16#0070#,
others => 16#0000#),
others => <>);
-- cshpdesktop
N532 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0076#, 16#0065#, 16#006E#, 16#0074#,
16#0075#, 16#0072#, 16#0061#, 16#006D#,
16#0061#, 16#0074#, 16#0068#,
others => 16#0000#),
others => <>);
-- venturamath
N533 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0076#, 16#0065#,
16#006E#, 16#0074#, 16#0075#, 16#0072#,
16#0061#, 16#006D#, 16#0061#, 16#0074#,
16#0068#,
others => 16#0000#),
others => <>);
-- csventuramath
N534 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 19,
Length => 19,
Value =>
(16#006D#, 16#0069#, 16#0063#, 16#0072#,
16#006F#, 16#0073#, 16#006F#, 16#0066#,
16#0074#, 16#0070#, 16#0075#, 16#0062#,
16#006C#, 16#0069#, 16#0073#, 16#0068#,
16#0069#, 16#006E#, 16#0067#,
others => 16#0000#),
others => <>);
-- microsoftpublishing
N535 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 21,
Length => 21,
Value =>
(16#0063#, 16#0073#, 16#006D#, 16#0069#,
16#0063#, 16#0072#, 16#006F#, 16#0073#,
16#006F#, 16#0066#, 16#0074#, 16#0070#,
16#0075#, 16#0062#, 16#006C#, 16#0069#,
16#0073#, 16#0068#, 16#0069#, 16#006E#,
16#0067#,
others => 16#0000#),
others => <>);
-- csmicrosoftpublishing
N536 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0077#, 16#0069#, 16#006E#, 16#0064#,
16#006F#, 16#0077#, 16#0073#, 16#0033#,
16#0031#, 16#006A#,
others => 16#0000#),
others => <>);
-- windows31j
N537 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0063#, 16#0073#, 16#0077#, 16#0069#,
16#006E#, 16#0064#, 16#006F#, 16#0077#,
16#0073#, 16#0033#, 16#0031#, 16#006A#,
others => 16#0000#),
others => <>);
-- cswindows31j
N538 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0067#, 16#0062#, 16#0032#, 16#0033#,
16#0031#, 16#0032#,
others => 16#0000#),
others => <>);
-- gb2312
N539 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0067#, 16#0062#,
16#0032#, 16#0033#, 16#0031#, 16#0032#,
others => 16#0000#),
others => <>);
-- csgb2312
N540 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#0062#, 16#0069#, 16#0067#, 16#0035#,
others => 16#0000#),
others => <>);
-- big5
N541 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0063#, 16#0073#, 16#0062#, 16#0069#,
16#0067#, 16#0035#,
others => 16#0000#),
others => <>);
-- csbig5
N542 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#006D#, 16#0061#, 16#0063#, 16#0069#,
16#006E#, 16#0074#, 16#006F#, 16#0073#,
16#0068#,
others => 16#0000#),
others => <>);
-- macintosh
N543 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#006D#, 16#0061#, 16#0063#,
others => 16#0000#),
others => <>);
-- mac
N544 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#006D#, 16#0061#,
16#0063#, 16#0069#, 16#006E#, 16#0074#,
16#006F#, 16#0073#, 16#0068#,
others => 16#0000#),
others => <>);
-- csmacintosh
N545 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0033#,
16#0037#,
others => 16#0000#),
others => <>);
-- ibm37
N546 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#0063#, 16#0070#, 16#0033#, 16#0037#,
others => 16#0000#),
others => <>);
-- cp37
N547 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0063#, 16#0070#,
16#0075#, 16#0073#,
others => 16#0000#),
others => <>);
-- ebcdiccpus
N548 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0063#, 16#0070#,
16#0063#, 16#0061#,
others => 16#0000#),
others => <>);
-- ebcdiccpca
N549 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0063#, 16#0070#,
16#0077#, 16#0074#,
others => 16#0000#),
others => <>);
-- ebcdiccpwt
N550 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0063#, 16#0070#,
16#006E#, 16#006C#,
others => 16#0000#),
others => <>);
-- ebcdiccpnl
N551 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0033#, 16#0037#,
others => 16#0000#),
others => <>);
-- csibm37
N552 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0033#,
16#0038#,
others => 16#0000#),
others => <>);
-- ibm38
N553 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0069#, 16#006E#,
16#0074#,
others => 16#0000#),
others => <>);
-- ebcdicint
N554 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#0063#, 16#0070#, 16#0033#, 16#0038#,
others => 16#0000#),
others => <>);
-- cp38
N555 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0033#, 16#0038#,
others => 16#0000#),
others => <>);
-- csibm38
N556 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0032#,
16#0037#, 16#0033#,
others => 16#0000#),
others => <>);
-- ibm273
N557 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0032#, 16#0037#,
16#0033#,
others => 16#0000#),
others => <>);
-- cp273
N558 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0032#, 16#0037#, 16#0033#,
others => 16#0000#),
others => <>);
-- csibm273
N559 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0032#,
16#0037#, 16#0034#,
others => 16#0000#),
others => <>);
-- ibm274
N560 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0062#, 16#0065#,
others => 16#0000#),
others => <>);
-- ebcdicbe
N561 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0032#, 16#0037#,
16#0034#,
others => 16#0000#),
others => <>);
-- cp274
N562 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0032#, 16#0037#, 16#0034#,
others => 16#0000#),
others => <>);
-- csibm274
N563 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0032#,
16#0037#, 16#0035#,
others => 16#0000#),
others => <>);
-- ibm275
N564 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0062#, 16#0072#,
others => 16#0000#),
others => <>);
-- ebcdicbr
N565 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0032#, 16#0037#,
16#0035#,
others => 16#0000#),
others => <>);
-- cp275
N566 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0032#, 16#0037#, 16#0035#,
others => 16#0000#),
others => <>);
-- csibm275
N567 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0032#,
16#0037#, 16#0037#,
others => 16#0000#),
others => <>);
-- ibm277
N568 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0063#, 16#0070#,
16#0064#, 16#006B#,
others => 16#0000#),
others => <>);
-- ebcdiccpdk
N569 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0063#, 16#0070#,
16#006E#, 16#006F#,
others => 16#0000#),
others => <>);
-- ebcdiccpno
N570 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0032#, 16#0037#, 16#0037#,
others => 16#0000#),
others => <>);
-- csibm277
N571 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0032#,
16#0037#, 16#0038#,
others => 16#0000#),
others => <>);
-- ibm278
N572 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0032#, 16#0037#,
16#0038#,
others => 16#0000#),
others => <>);
-- cp278
N573 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0063#, 16#0070#,
16#0066#, 16#0069#,
others => 16#0000#),
others => <>);
-- ebcdiccpfi
N574 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0063#, 16#0070#,
16#0073#, 16#0065#,
others => 16#0000#),
others => <>);
-- ebcdiccpse
N575 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0032#, 16#0037#, 16#0038#,
others => 16#0000#),
others => <>);
-- csibm278
N576 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0032#,
16#0038#, 16#0030#,
others => 16#0000#),
others => <>);
-- ibm280
N577 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0032#, 16#0038#,
16#0030#,
others => 16#0000#),
others => <>);
-- cp280
N578 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0063#, 16#0070#,
16#0069#, 16#0074#,
others => 16#0000#),
others => <>);
-- ebcdiccpit
N579 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0032#, 16#0038#, 16#0030#,
others => 16#0000#),
others => <>);
-- csibm280
N580 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0032#,
16#0038#, 16#0031#,
others => 16#0000#),
others => <>);
-- ibm281
N581 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#006A#, 16#0070#,
16#0065#,
others => 16#0000#),
others => <>);
-- ebcdicjpe
N582 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0032#, 16#0038#,
16#0031#,
others => 16#0000#),
others => <>);
-- cp281
N583 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0032#, 16#0038#, 16#0031#,
others => 16#0000#),
others => <>);
-- csibm281
N584 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0032#,
16#0038#, 16#0034#,
others => 16#0000#),
others => <>);
-- ibm284
N585 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0032#, 16#0038#,
16#0034#,
others => 16#0000#),
others => <>);
-- cp284
N586 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0063#, 16#0070#,
16#0065#, 16#0073#,
others => 16#0000#),
others => <>);
-- ebcdiccpes
N587 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0032#, 16#0038#, 16#0034#,
others => 16#0000#),
others => <>);
-- csibm284
N588 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0032#,
16#0038#, 16#0035#,
others => 16#0000#),
others => <>);
-- ibm285
N589 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0032#, 16#0038#,
16#0035#,
others => 16#0000#),
others => <>);
-- cp285
N590 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0063#, 16#0070#,
16#0067#, 16#0062#,
others => 16#0000#),
others => <>);
-- ebcdiccpgb
N591 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0032#, 16#0038#, 16#0035#,
others => 16#0000#),
others => <>);
-- csibm285
N592 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0032#,
16#0039#, 16#0030#,
others => 16#0000#),
others => <>);
-- ibm290
N593 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0032#, 16#0039#,
16#0030#,
others => 16#0000#),
others => <>);
-- cp290
N594 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#006A#, 16#0070#,
16#006B#, 16#0061#, 16#006E#, 16#0061#,
others => 16#0000#),
others => <>);
-- ebcdicjpkana
N595 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0032#, 16#0039#, 16#0030#,
others => 16#0000#),
others => <>);
-- csibm290
N596 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0032#,
16#0039#, 16#0037#,
others => 16#0000#),
others => <>);
-- ibm297
N597 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0032#, 16#0039#,
16#0037#,
others => 16#0000#),
others => <>);
-- cp297
N598 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0063#, 16#0070#,
16#0066#, 16#0072#,
others => 16#0000#),
others => <>);
-- ebcdiccpfr
N599 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0032#, 16#0039#, 16#0037#,
others => 16#0000#),
others => <>);
-- csibm297
N600 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0034#,
16#0032#, 16#0030#,
others => 16#0000#),
others => <>);
-- ibm420
N601 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0034#, 16#0032#,
16#0030#,
others => 16#0000#),
others => <>);
-- cp420
N602 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0063#, 16#0070#,
16#0061#, 16#0072#, 16#0031#,
others => 16#0000#),
others => <>);
-- ebcdiccpar1
N603 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0034#, 16#0032#, 16#0030#,
others => 16#0000#),
others => <>);
-- csibm420
N604 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0034#,
16#0032#, 16#0033#,
others => 16#0000#),
others => <>);
-- ibm423
N605 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0034#, 16#0032#,
16#0033#,
others => 16#0000#),
others => <>);
-- cp423
N606 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0063#, 16#0070#,
16#0067#, 16#0072#,
others => 16#0000#),
others => <>);
-- ebcdiccpgr
N607 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0034#, 16#0032#, 16#0033#,
others => 16#0000#),
others => <>);
-- csibm423
N608 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0034#,
16#0032#, 16#0034#,
others => 16#0000#),
others => <>);
-- ibm424
N609 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0034#, 16#0032#,
16#0034#,
others => 16#0000#),
others => <>);
-- cp424
N610 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0063#, 16#0070#,
16#0068#, 16#0065#,
others => 16#0000#),
others => <>);
-- ebcdiccphe
N611 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0034#, 16#0032#, 16#0034#,
others => 16#0000#),
others => <>);
-- csibm424
N612 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0034#,
16#0033#, 16#0037#,
others => 16#0000#),
others => <>);
-- ibm437
N613 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0034#, 16#0033#,
16#0037#,
others => 16#0000#),
others => <>);
-- cp437
N614 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0034#, 16#0033#, 16#0037#,
others => 16#0000#),
others => <>);
-- 437
N615 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 16,
Length => 16,
Value =>
(16#0063#, 16#0073#, 16#0070#, 16#0063#,
16#0038#, 16#0063#, 16#006F#, 16#0064#,
16#0065#, 16#0070#, 16#0061#, 16#0067#,
16#0065#, 16#0034#, 16#0033#, 16#0037#,
others => 16#0000#),
others => <>);
-- cspc8codepage437
N616 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0035#,
16#0030#, 16#0030#,
others => 16#0000#),
others => <>);
-- ibm500
N617 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0035#, 16#0030#,
16#0030#,
others => 16#0000#),
others => <>);
-- cp500
N618 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0063#, 16#0070#,
16#0062#, 16#0065#,
others => 16#0000#),
others => <>);
-- ebcdiccpbe
N619 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0063#, 16#0070#,
16#0063#, 16#0068#,
others => 16#0000#),
others => <>);
-- ebcdiccpch
N620 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0035#, 16#0030#, 16#0030#,
others => 16#0000#),
others => <>);
-- csibm500
N621 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0038#,
16#0035#, 16#0031#,
others => 16#0000#),
others => <>);
-- ibm851
N622 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0038#, 16#0035#,
16#0031#,
others => 16#0000#),
others => <>);
-- cp851
N623 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0038#, 16#0035#, 16#0031#,
others => 16#0000#),
others => <>);
-- 851
N624 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0038#, 16#0035#, 16#0031#,
others => 16#0000#),
others => <>);
-- csibm851
N625 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0038#,
16#0035#, 16#0032#,
others => 16#0000#),
others => <>);
-- ibm852
N626 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0038#, 16#0035#,
16#0032#,
others => 16#0000#),
others => <>);
-- cp852
N627 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0038#, 16#0035#, 16#0032#,
others => 16#0000#),
others => <>);
-- 852
N628 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0070#, 16#0063#,
16#0070#, 16#0038#, 16#0035#, 16#0032#,
others => 16#0000#),
others => <>);
-- cspcp852
N629 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0038#,
16#0035#, 16#0035#,
others => 16#0000#),
others => <>);
-- ibm855
N630 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0038#, 16#0035#,
16#0035#,
others => 16#0000#),
others => <>);
-- cp855
N631 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0038#, 16#0035#, 16#0035#,
others => 16#0000#),
others => <>);
-- 855
N632 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0038#, 16#0035#, 16#0035#,
others => 16#0000#),
others => <>);
-- csibm855
N633 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0038#,
16#0035#, 16#0037#,
others => 16#0000#),
others => <>);
-- ibm857
N634 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0038#, 16#0035#,
16#0037#,
others => 16#0000#),
others => <>);
-- cp857
N635 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0038#, 16#0035#, 16#0037#,
others => 16#0000#),
others => <>);
-- 857
N636 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0038#, 16#0035#, 16#0037#,
others => 16#0000#),
others => <>);
-- csibm857
N637 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0038#,
16#0036#, 16#0030#,
others => 16#0000#),
others => <>);
-- ibm860
N638 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0038#, 16#0036#,
16#0030#,
others => 16#0000#),
others => <>);
-- cp860
N639 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0038#, 16#0036#, 16#0030#,
others => 16#0000#),
others => <>);
-- 860
N640 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0038#, 16#0036#, 16#0030#,
others => 16#0000#),
others => <>);
-- csibm860
N641 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0038#,
16#0036#, 16#0031#,
others => 16#0000#),
others => <>);
-- ibm861
N642 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0038#, 16#0036#,
16#0031#,
others => 16#0000#),
others => <>);
-- cp861
N643 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0038#, 16#0036#, 16#0031#,
others => 16#0000#),
others => <>);
-- 861
N644 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#0063#, 16#0070#, 16#0069#, 16#0073#,
others => 16#0000#),
others => <>);
-- cpis
N645 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0038#, 16#0036#, 16#0031#,
others => 16#0000#),
others => <>);
-- csibm861
N646 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0038#,
16#0036#, 16#0033#,
others => 16#0000#),
others => <>);
-- ibm863
N647 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0038#, 16#0036#,
16#0033#,
others => 16#0000#),
others => <>);
-- cp863
N648 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0038#, 16#0036#, 16#0033#,
others => 16#0000#),
others => <>);
-- 863
N649 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0038#, 16#0036#, 16#0033#,
others => 16#0000#),
others => <>);
-- csibm863
N650 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0038#,
16#0036#, 16#0034#,
others => 16#0000#),
others => <>);
-- ibm864
N651 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0038#, 16#0036#,
16#0034#,
others => 16#0000#),
others => <>);
-- cp864
N652 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0038#, 16#0036#, 16#0034#,
others => 16#0000#),
others => <>);
-- csibm864
N653 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0038#,
16#0036#, 16#0035#,
others => 16#0000#),
others => <>);
-- ibm865
N654 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0038#, 16#0036#,
16#0035#,
others => 16#0000#),
others => <>);
-- cp865
N655 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0038#, 16#0036#, 16#0035#,
others => 16#0000#),
others => <>);
-- 865
N656 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0038#, 16#0036#, 16#0035#,
others => 16#0000#),
others => <>);
-- csibm865
N657 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0038#,
16#0036#, 16#0038#,
others => 16#0000#),
others => <>);
-- ibm868
N658 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0038#, 16#0036#,
16#0038#,
others => 16#0000#),
others => <>);
-- cp868
N659 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#0063#, 16#0070#, 16#0061#, 16#0072#,
others => 16#0000#),
others => <>);
-- cpar
N660 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0038#, 16#0036#, 16#0038#,
others => 16#0000#),
others => <>);
-- csibm868
N661 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0038#,
16#0036#, 16#0039#,
others => 16#0000#),
others => <>);
-- ibm869
N662 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0038#, 16#0036#,
16#0039#,
others => 16#0000#),
others => <>);
-- cp869
N663 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0038#, 16#0036#, 16#0039#,
others => 16#0000#),
others => <>);
-- 869
N664 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#0063#, 16#0070#, 16#0067#, 16#0072#,
others => 16#0000#),
others => <>);
-- cpgr
N665 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0038#, 16#0036#, 16#0039#,
others => 16#0000#),
others => <>);
-- csibm869
N666 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0038#,
16#0037#, 16#0030#,
others => 16#0000#),
others => <>);
-- ibm870
N667 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0038#, 16#0037#,
16#0030#,
others => 16#0000#),
others => <>);
-- cp870
N668 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0063#, 16#0070#,
16#0072#, 16#006F#, 16#0065#, 16#0063#,
16#0065#,
others => 16#0000#),
others => <>);
-- ebcdiccproece
N669 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0063#, 16#0070#,
16#0079#, 16#0075#,
others => 16#0000#),
others => <>);
-- ebcdiccpyu
N670 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0038#, 16#0037#, 16#0030#,
others => 16#0000#),
others => <>);
-- csibm870
N671 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0038#,
16#0037#, 16#0031#,
others => 16#0000#),
others => <>);
-- ibm871
N672 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0038#, 16#0037#,
16#0031#,
others => 16#0000#),
others => <>);
-- cp871
N673 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0063#, 16#0070#,
16#0069#, 16#0073#,
others => 16#0000#),
others => <>);
-- ebcdiccpis
N674 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0038#, 16#0037#, 16#0031#,
others => 16#0000#),
others => <>);
-- csibm871
N675 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0038#,
16#0038#, 16#0030#,
others => 16#0000#),
others => <>);
-- ibm880
N676 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0038#, 16#0038#,
16#0030#,
others => 16#0000#),
others => <>);
-- cp880
N677 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 14,
Length => 14,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0063#, 16#0079#,
16#0072#, 16#0069#, 16#006C#, 16#006C#,
16#0069#, 16#0063#,
others => 16#0000#),
others => <>);
-- ebcdiccyrillic
N678 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0038#, 16#0038#, 16#0030#,
others => 16#0000#),
others => <>);
-- csibm880
N679 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0038#,
16#0039#, 16#0031#,
others => 16#0000#),
others => <>);
-- ibm891
N680 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0038#, 16#0039#,
16#0031#,
others => 16#0000#),
others => <>);
-- cp891
N681 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0038#, 16#0039#, 16#0031#,
others => 16#0000#),
others => <>);
-- csibm891
N682 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0039#,
16#0030#, 16#0033#,
others => 16#0000#),
others => <>);
-- ibm903
N683 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0039#, 16#0030#,
16#0033#,
others => 16#0000#),
others => <>);
-- cp903
N684 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0039#, 16#0030#, 16#0033#,
others => 16#0000#),
others => <>);
-- csibm903
N685 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0039#,
16#0030#, 16#0034#,
others => 16#0000#),
others => <>);
-- ibm904
N686 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0039#, 16#0030#,
16#0034#,
others => 16#0000#),
others => <>);
-- cp904
N687 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0039#, 16#0030#, 16#0034#,
others => 16#0000#),
others => <>);
-- 904
N688 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#0062#, 16#006D#, 16#0039#, 16#0030#,
16#0034#,
others => 16#0000#),
others => <>);
-- csibbm904
N689 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0039#,
16#0030#, 16#0035#,
others => 16#0000#),
others => <>);
-- ibm905
N690 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0039#, 16#0030#,
16#0035#,
others => 16#0000#),
others => <>);
-- cp905
N691 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0063#, 16#0070#,
16#0074#, 16#0072#,
others => 16#0000#),
others => <>);
-- ebcdiccptr
N692 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0039#, 16#0030#, 16#0035#,
others => 16#0000#),
others => <>);
-- csibm905
N693 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0039#,
16#0031#, 16#0038#,
others => 16#0000#),
others => <>);
-- ibm918
N694 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0039#, 16#0031#,
16#0038#,
others => 16#0000#),
others => <>);
-- cp918
N695 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0063#, 16#0070#,
16#0061#, 16#0072#, 16#0032#,
others => 16#0000#),
others => <>);
-- ebcdiccpar2
N696 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0039#, 16#0031#, 16#0038#,
others => 16#0000#),
others => <>);
-- csibm918
N697 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0031#,
16#0030#, 16#0032#, 16#0036#,
others => 16#0000#),
others => <>);
-- ibm1026
N698 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0063#, 16#0070#, 16#0031#, 16#0030#,
16#0032#, 16#0036#,
others => 16#0000#),
others => <>);
-- cp1026
N699 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0031#, 16#0030#, 16#0032#,
16#0036#,
others => 16#0000#),
others => <>);
-- csibm1026
N700 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0061#, 16#0074#,
16#0064#, 16#0065#,
others => 16#0000#),
others => <>);
-- ebcdicatde
N701 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 15,
Length => 15,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0065#, 16#0062#, 16#0063#,
16#0064#, 16#0069#, 16#0063#, 16#0061#,
16#0074#, 16#0064#, 16#0065#,
others => 16#0000#),
others => <>);
-- csibmebcdicatde
N702 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0061#, 16#0074#,
16#0064#, 16#0065#, 16#0061#,
others => 16#0000#),
others => <>);
-- ebcdicatdea
N703 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0065#, 16#0062#,
16#0063#, 16#0064#, 16#0069#, 16#0063#,
16#0061#, 16#0074#, 16#0064#, 16#0065#,
16#0061#,
others => 16#0000#),
others => <>);
-- csebcdicatdea
N704 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0063#, 16#0061#,
16#0066#, 16#0072#,
others => 16#0000#),
others => <>);
-- ebcdiccafr
N705 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0063#, 16#0073#, 16#0065#, 16#0062#,
16#0063#, 16#0064#, 16#0069#, 16#0063#,
16#0063#, 16#0061#, 16#0066#, 16#0072#,
others => 16#0000#),
others => <>);
-- csebcdiccafr
N706 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0064#, 16#006B#,
16#006E#, 16#006F#,
others => 16#0000#),
others => <>);
-- ebcdicdkno
N707 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0063#, 16#0073#, 16#0065#, 16#0062#,
16#0063#, 16#0064#, 16#0069#, 16#0063#,
16#0064#, 16#006B#, 16#006E#, 16#006F#,
others => 16#0000#),
others => <>);
-- csebcdicdkno
N708 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0064#, 16#006B#,
16#006E#, 16#006F#, 16#0061#,
others => 16#0000#),
others => <>);
-- ebcdicdknoa
N709 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0065#, 16#0062#,
16#0063#, 16#0064#, 16#0069#, 16#0063#,
16#0064#, 16#006B#, 16#006E#, 16#006F#,
16#0061#,
others => 16#0000#),
others => <>);
-- csebcdicdknoa
N710 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0066#, 16#0069#,
16#0073#, 16#0065#,
others => 16#0000#),
others => <>);
-- ebcdicfise
N711 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0063#, 16#0073#, 16#0065#, 16#0062#,
16#0063#, 16#0064#, 16#0069#, 16#0063#,
16#0066#, 16#0069#, 16#0073#, 16#0065#,
others => 16#0000#),
others => <>);
-- csebcdicfise
N712 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0066#, 16#0069#,
16#0073#, 16#0065#, 16#0061#,
others => 16#0000#),
others => <>);
-- ebcdicfisea
N713 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0065#, 16#0062#,
16#0063#, 16#0064#, 16#0069#, 16#0063#,
16#0066#, 16#0069#, 16#0073#, 16#0065#,
16#0061#,
others => 16#0000#),
others => <>);
-- csebcdicfisea
N714 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0066#, 16#0072#,
others => 16#0000#),
others => <>);
-- ebcdicfr
N715 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0063#, 16#0073#, 16#0065#, 16#0062#,
16#0063#, 16#0064#, 16#0069#, 16#0063#,
16#0066#, 16#0072#,
others => 16#0000#),
others => <>);
-- csebcdicfr
N716 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0069#, 16#0074#,
others => 16#0000#),
others => <>);
-- ebcdicit
N717 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0063#, 16#0073#, 16#0065#, 16#0062#,
16#0063#, 16#0064#, 16#0069#, 16#0063#,
16#0069#, 16#0074#,
others => 16#0000#),
others => <>);
-- csebcdicit
N718 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0070#, 16#0074#,
others => 16#0000#),
others => <>);
-- ebcdicpt
N719 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0063#, 16#0073#, 16#0065#, 16#0062#,
16#0063#, 16#0064#, 16#0069#, 16#0063#,
16#0070#, 16#0074#,
others => 16#0000#),
others => <>);
-- csebcdicpt
N720 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0065#, 16#0073#,
others => 16#0000#),
others => <>);
-- ebcdices
N721 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0063#, 16#0073#, 16#0065#, 16#0062#,
16#0063#, 16#0064#, 16#0069#, 16#0063#,
16#0065#, 16#0073#,
others => 16#0000#),
others => <>);
-- csebcdices
N722 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0065#, 16#0073#,
16#0061#,
others => 16#0000#),
others => <>);
-- ebcdicesa
N723 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0065#, 16#0062#,
16#0063#, 16#0064#, 16#0069#, 16#0063#,
16#0065#, 16#0073#, 16#0061#,
others => 16#0000#),
others => <>);
-- csebcdicesa
N724 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0065#, 16#0073#,
16#0073#,
others => 16#0000#),
others => <>);
-- ebcdicess
N725 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0065#, 16#0062#,
16#0063#, 16#0064#, 16#0069#, 16#0063#,
16#0065#, 16#0073#, 16#0073#,
others => 16#0000#),
others => <>);
-- csebcdicess
N726 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0075#, 16#006B#,
others => 16#0000#),
others => <>);
-- ebcdicuk
N727 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0063#, 16#0073#, 16#0065#, 16#0062#,
16#0063#, 16#0064#, 16#0069#, 16#0063#,
16#0075#, 16#006B#,
others => 16#0000#),
others => <>);
-- csebcdicuk
N728 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0075#, 16#0073#,
others => 16#0000#),
others => <>);
-- ebcdicus
N729 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0063#, 16#0073#, 16#0065#, 16#0062#,
16#0063#, 16#0064#, 16#0069#, 16#0063#,
16#0075#, 16#0073#,
others => 16#0000#),
others => <>);
-- csebcdicus
N730 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0075#, 16#006E#, 16#006B#, 16#006E#,
16#006F#, 16#0077#, 16#006E#, 16#0038#,
16#0062#, 16#0069#, 16#0074#,
others => 16#0000#),
others => <>);
-- unknown8bit
N731 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0075#, 16#006E#,
16#006B#, 16#006E#, 16#006F#, 16#0077#,
16#006E#, 16#0038#, 16#0062#, 16#0069#,
16#0074#,
others => 16#0000#),
others => <>);
-- csunknown8bit
N732 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#006D#, 16#006E#, 16#0065#, 16#006D#,
16#006F#, 16#006E#, 16#0069#, 16#0063#,
others => 16#0000#),
others => <>);
-- mnemonic
N733 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0063#, 16#0073#, 16#006D#, 16#006E#,
16#0065#, 16#006D#, 16#006F#, 16#006E#,
16#0069#, 16#0063#,
others => 16#0000#),
others => <>);
-- csmnemonic
N734 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#006D#, 16#006E#, 16#0065#, 16#006D#,
others => 16#0000#),
others => <>);
-- mnem
N735 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0063#, 16#0073#, 16#006D#, 16#006E#,
16#0065#, 16#006D#,
others => 16#0000#),
others => <>);
-- csmnem
N736 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0076#, 16#0069#, 16#0073#, 16#0063#,
16#0069#, 16#0069#,
others => 16#0000#),
others => <>);
-- viscii
N737 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0076#, 16#0069#,
16#0073#, 16#0063#, 16#0069#, 16#0069#,
others => 16#0000#),
others => <>);
-- csviscii
N738 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#0076#, 16#0069#, 16#0071#, 16#0072#,
others => 16#0000#),
others => <>);
-- viqr
N739 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0063#, 16#0073#, 16#0076#, 16#0069#,
16#0071#, 16#0072#,
others => 16#0000#),
others => <>);
-- csviqr
N740 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#006B#, 16#006F#, 16#0069#, 16#0038#,
16#0072#,
others => 16#0000#),
others => <>);
-- koi8r
N741 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0063#, 16#0073#, 16#006B#, 16#006F#,
16#0069#, 16#0038#, 16#0072#,
others => 16#0000#),
others => <>);
-- cskoi8r
N742 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0068#, 16#007A#, 16#0067#, 16#0062#,
16#0032#, 16#0033#, 16#0031#, 16#0032#,
others => 16#0000#),
others => <>);
-- hzgb2312
N743 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0038#,
16#0036#, 16#0036#,
others => 16#0000#),
others => <>);
-- ibm866
N744 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0038#, 16#0036#,
16#0036#,
others => 16#0000#),
others => <>);
-- cp866
N745 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0038#, 16#0036#, 16#0036#,
others => 16#0000#),
others => <>);
-- 866
N746 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0038#, 16#0036#, 16#0036#,
others => 16#0000#),
others => <>);
-- csibm866
N747 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0037#,
16#0037#, 16#0035#,
others => 16#0000#),
others => <>);
-- ibm775
N748 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0037#, 16#0037#,
16#0035#,
others => 16#0000#),
others => <>);
-- cp775
N749 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0070#, 16#0063#,
16#0037#, 16#0037#, 16#0035#, 16#0062#,
16#0061#, 16#006C#, 16#0074#, 16#0069#,
16#0063#,
others => 16#0000#),
others => <>);
-- cspc775baltic
N750 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#006B#, 16#006F#, 16#0069#, 16#0038#,
16#0075#,
others => 16#0000#),
others => <>);
-- koi8u
N751 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0063#, 16#0073#, 16#006B#, 16#006F#,
16#0069#, 16#0038#, 16#0075#,
others => 16#0000#),
others => <>);
-- cskoi8u
N752 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0038#,
16#0035#, 16#0038#,
others => 16#0000#),
others => <>);
-- ibm858
N753 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0063#, 16#0073#, 16#0069#,
16#0064#, 16#0038#, 16#0035#, 16#0038#,
others => 16#0000#),
others => <>);
-- ccsid858
N754 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0038#, 16#0035#,
16#0038#,
others => 16#0000#),
others => <>);
-- cp858
N755 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 21,
Length => 21,
Value =>
(16#0070#, 16#0063#, 16#006D#, 16#0075#,
16#006C#, 16#0074#, 16#0069#, 16#006C#,
16#0069#, 16#006E#, 16#0067#, 16#0075#,
16#0061#, 16#006C#, 16#0038#, 16#0035#,
16#0030#, 16#0065#, 16#0075#, 16#0072#,
16#006F#,
others => 16#0000#),
others => <>);
-- pcmultilingual850euro
N756 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0038#, 16#0035#, 16#0038#,
others => 16#0000#),
others => <>);
-- csibm858
N757 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0039#,
16#0032#, 16#0034#,
others => 16#0000#),
others => <>);
-- ibm924
N758 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0063#, 16#0073#, 16#0069#,
16#0064#, 16#0039#, 16#0032#, 16#0034#,
others => 16#0000#),
others => <>);
-- ccsid924
N759 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0039#, 16#0032#,
16#0034#,
others => 16#0000#),
others => <>);
-- cp924
N760 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 16,
Length => 16,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#006C#, 16#0061#,
16#0074#, 16#0069#, 16#006E#, 16#0039#,
16#0065#, 16#0075#, 16#0072#, 16#006F#,
others => 16#0000#),
others => <>);
-- ebcdiclatin9euro
N761 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0039#, 16#0032#, 16#0034#,
others => 16#0000#),
others => <>);
-- csibm924
N762 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0031#,
16#0031#, 16#0034#, 16#0030#,
others => 16#0000#),
others => <>);
-- ibm1140
N763 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0063#, 16#0073#, 16#0069#,
16#0064#, 16#0031#, 16#0031#, 16#0034#,
16#0030#,
others => 16#0000#),
others => <>);
-- ccsid1140
N764 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0063#, 16#0070#, 16#0031#, 16#0031#,
16#0034#, 16#0030#,
others => 16#0000#),
others => <>);
-- cp1140
N765 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 14,
Length => 14,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0075#, 16#0073#,
16#0033#, 16#0037#, 16#0065#, 16#0075#,
16#0072#, 16#006F#,
others => 16#0000#),
others => <>);
-- ebcdicus37euro
N766 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0031#, 16#0031#, 16#0034#,
16#0030#,
others => 16#0000#),
others => <>);
-- csibm1140
N767 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0031#,
16#0031#, 16#0034#, 16#0031#,
others => 16#0000#),
others => <>);
-- ibm1141
N768 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0063#, 16#0073#, 16#0069#,
16#0064#, 16#0031#, 16#0031#, 16#0034#,
16#0031#,
others => 16#0000#),
others => <>);
-- ccsid1141
N769 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0063#, 16#0070#, 16#0031#, 16#0031#,
16#0034#, 16#0031#,
others => 16#0000#),
others => <>);
-- cp1141
N770 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 15,
Length => 15,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0064#, 16#0065#,
16#0032#, 16#0037#, 16#0033#, 16#0065#,
16#0075#, 16#0072#, 16#006F#,
others => 16#0000#),
others => <>);
-- ebcdicde273euro
N771 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0031#, 16#0031#, 16#0034#,
16#0031#,
others => 16#0000#),
others => <>);
-- csibm1141
N772 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0031#,
16#0031#, 16#0034#, 16#0032#,
others => 16#0000#),
others => <>);
-- ibm1142
N773 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0063#, 16#0073#, 16#0069#,
16#0064#, 16#0031#, 16#0031#, 16#0034#,
16#0032#,
others => 16#0000#),
others => <>);
-- ccsid1142
N774 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0063#, 16#0070#, 16#0031#, 16#0031#,
16#0034#, 16#0032#,
others => 16#0000#),
others => <>);
-- cp1142
N775 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 15,
Length => 15,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0064#, 16#006B#,
16#0032#, 16#0037#, 16#0037#, 16#0065#,
16#0075#, 16#0072#, 16#006F#,
others => 16#0000#),
others => <>);
-- ebcdicdk277euro
N776 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 15,
Length => 15,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#006E#, 16#006F#,
16#0032#, 16#0037#, 16#0037#, 16#0065#,
16#0075#, 16#0072#, 16#006F#,
others => 16#0000#),
others => <>);
-- ebcdicno277euro
N777 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0031#, 16#0031#, 16#0034#,
16#0032#,
others => 16#0000#),
others => <>);
-- csibm1142
N778 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0031#,
16#0031#, 16#0034#, 16#0033#,
others => 16#0000#),
others => <>);
-- ibm1143
N779 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0063#, 16#0073#, 16#0069#,
16#0064#, 16#0031#, 16#0031#, 16#0034#,
16#0033#,
others => 16#0000#),
others => <>);
-- ccsid1143
N780 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0063#, 16#0070#, 16#0031#, 16#0031#,
16#0034#, 16#0033#,
others => 16#0000#),
others => <>);
-- cp1143
N781 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 15,
Length => 15,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0066#, 16#0069#,
16#0032#, 16#0037#, 16#0038#, 16#0065#,
16#0075#, 16#0072#, 16#006F#,
others => 16#0000#),
others => <>);
-- ebcdicfi278euro
N782 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 15,
Length => 15,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0073#, 16#0065#,
16#0032#, 16#0037#, 16#0038#, 16#0065#,
16#0075#, 16#0072#, 16#006F#,
others => 16#0000#),
others => <>);
-- ebcdicse278euro
N783 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0031#, 16#0031#, 16#0034#,
16#0033#,
others => 16#0000#),
others => <>);
-- csibm1143
N784 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0031#,
16#0031#, 16#0034#, 16#0034#,
others => 16#0000#),
others => <>);
-- ibm1144
N785 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0063#, 16#0073#, 16#0069#,
16#0064#, 16#0031#, 16#0031#, 16#0034#,
16#0034#,
others => 16#0000#),
others => <>);
-- ccsid1144
N786 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0063#, 16#0070#, 16#0031#, 16#0031#,
16#0034#, 16#0034#,
others => 16#0000#),
others => <>);
-- cp1144
N787 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 15,
Length => 15,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0069#, 16#0074#,
16#0032#, 16#0038#, 16#0030#, 16#0065#,
16#0075#, 16#0072#, 16#006F#,
others => 16#0000#),
others => <>);
-- ebcdicit280euro
N788 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0031#, 16#0031#, 16#0034#,
16#0034#,
others => 16#0000#),
others => <>);
-- csibm1144
N789 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0031#,
16#0031#, 16#0034#, 16#0035#,
others => 16#0000#),
others => <>);
-- ibm1145
N790 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0063#, 16#0073#, 16#0069#,
16#0064#, 16#0031#, 16#0031#, 16#0034#,
16#0035#,
others => 16#0000#),
others => <>);
-- ccsid1145
N791 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0063#, 16#0070#, 16#0031#, 16#0031#,
16#0034#, 16#0035#,
others => 16#0000#),
others => <>);
-- cp1145
N792 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 15,
Length => 15,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0065#, 16#0073#,
16#0032#, 16#0038#, 16#0034#, 16#0065#,
16#0075#, 16#0072#, 16#006F#,
others => 16#0000#),
others => <>);
-- ebcdices284euro
N793 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0031#, 16#0031#, 16#0034#,
16#0035#,
others => 16#0000#),
others => <>);
-- csibm1145
N794 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0031#,
16#0031#, 16#0034#, 16#0036#,
others => 16#0000#),
others => <>);
-- ibm1146
N795 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0063#, 16#0073#, 16#0069#,
16#0064#, 16#0031#, 16#0031#, 16#0034#,
16#0036#,
others => 16#0000#),
others => <>);
-- ccsid1146
N796 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0063#, 16#0070#, 16#0031#, 16#0031#,
16#0034#, 16#0036#,
others => 16#0000#),
others => <>);
-- cp1146
N797 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 15,
Length => 15,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0067#, 16#0062#,
16#0032#, 16#0038#, 16#0035#, 16#0065#,
16#0075#, 16#0072#, 16#006F#,
others => 16#0000#),
others => <>);
-- ebcdicgb285euro
N798 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0031#, 16#0031#, 16#0034#,
16#0036#,
others => 16#0000#),
others => <>);
-- csibm1146
N799 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0031#,
16#0031#, 16#0034#, 16#0037#,
others => 16#0000#),
others => <>);
-- ibm1147
N800 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0063#, 16#0073#, 16#0069#,
16#0064#, 16#0031#, 16#0031#, 16#0034#,
16#0037#,
others => 16#0000#),
others => <>);
-- ccsid1147
N801 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0063#, 16#0070#, 16#0031#, 16#0031#,
16#0034#, 16#0037#,
others => 16#0000#),
others => <>);
-- cp1147
N802 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 15,
Length => 15,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0066#, 16#0072#,
16#0032#, 16#0039#, 16#0037#, 16#0065#,
16#0075#, 16#0072#, 16#006F#,
others => 16#0000#),
others => <>);
-- ebcdicfr297euro
N803 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0031#, 16#0031#, 16#0034#,
16#0037#,
others => 16#0000#),
others => <>);
-- csibm1147
N804 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0031#,
16#0031#, 16#0034#, 16#0038#,
others => 16#0000#),
others => <>);
-- ibm1148
N805 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0063#, 16#0073#, 16#0069#,
16#0064#, 16#0031#, 16#0031#, 16#0034#,
16#0038#,
others => 16#0000#),
others => <>);
-- ccsid1148
N806 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0063#, 16#0070#, 16#0031#, 16#0031#,
16#0034#, 16#0038#,
others => 16#0000#),
others => <>);
-- cp1148
N807 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 26,
Length => 26,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0069#, 16#006E#,
16#0074#, 16#0065#, 16#0072#, 16#006E#,
16#0061#, 16#0074#, 16#0069#, 16#006F#,
16#006E#, 16#0061#, 16#006C#, 16#0035#,
16#0030#, 16#0030#, 16#0065#, 16#0075#,
16#0072#, 16#006F#,
others => 16#0000#),
others => <>);
-- ebcdicinternational500euro
N808 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0031#, 16#0031#, 16#0034#,
16#0038#,
others => 16#0000#),
others => <>);
-- csibm1148
N809 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0031#,
16#0031#, 16#0034#, 16#0039#,
others => 16#0000#),
others => <>);
-- ibm1149
N810 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0063#, 16#0073#, 16#0069#,
16#0064#, 16#0031#, 16#0031#, 16#0034#,
16#0039#,
others => 16#0000#),
others => <>);
-- ccsid1149
N811 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0063#, 16#0070#, 16#0031#, 16#0031#,
16#0034#, 16#0039#,
others => 16#0000#),
others => <>);
-- cp1149
N812 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 15,
Length => 15,
Value =>
(16#0065#, 16#0062#, 16#0063#, 16#0064#,
16#0069#, 16#0063#, 16#0069#, 16#0073#,
16#0038#, 16#0037#, 16#0031#, 16#0065#,
16#0075#, 16#0072#, 16#006F#,
others => 16#0000#),
others => <>);
-- ebcdicis871euro
N813 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0031#, 16#0031#, 16#0034#,
16#0039#,
others => 16#0000#),
others => <>);
-- csibm1149
N814 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0062#, 16#0069#, 16#0067#, 16#0035#,
16#0068#, 16#006B#, 16#0073#, 16#0063#,
16#0073#,
others => 16#0000#),
others => <>);
-- big5hkscs
N815 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0062#, 16#0069#,
16#0067#, 16#0035#, 16#0068#, 16#006B#,
16#0073#, 16#0063#, 16#0073#,
others => 16#0000#),
others => <>);
-- csbig5hkscs
N816 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0062#, 16#006D#, 16#0031#,
16#0030#, 16#0034#, 16#0037#,
others => 16#0000#),
others => <>);
-- ibm1047
N817 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#0069#, 16#0062#,
16#006D#, 16#0031#, 16#0030#, 16#0034#,
16#0037#,
others => 16#0000#),
others => <>);
-- csibm1047
N818 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0070#, 16#0074#, 16#0063#, 16#0070#,
16#0031#, 16#0035#, 16#0034#,
others => 16#0000#),
others => <>);
-- ptcp154
N819 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#0070#, 16#0074#,
16#0063#, 16#0070#, 16#0031#, 16#0035#,
16#0034#,
others => 16#0000#),
others => <>);
-- csptcp154
N820 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0070#, 16#0074#, 16#0031#, 16#0035#,
16#0034#,
others => 16#0000#),
others => <>);
-- pt154
N821 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0070#, 16#0031#, 16#0035#,
16#0034#,
others => 16#0000#),
others => <>);
-- cp154
N822 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0079#, 16#0072#, 16#0069#,
16#006C#, 16#006C#, 16#0069#, 16#0063#,
16#0061#, 16#0073#, 16#0069#, 16#0061#,
16#006E#,
others => 16#0000#),
others => <>);
-- cyrillicasian
N823 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0061#, 16#006D#, 16#0069#, 16#0067#,
16#0061#, 16#0031#, 16#0032#, 16#0035#,
16#0031#,
others => 16#0000#),
others => <>);
-- amiga1251
N824 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0061#, 16#006D#, 16#0069#, 16#0031#,
16#0032#, 16#0035#, 16#0031#,
others => 16#0000#),
others => <>);
-- ami1251
N825 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#0073#, 16#0061#, 16#006D#,
16#0069#, 16#0067#, 16#0061#, 16#0031#,
16#0032#, 16#0035#, 16#0031#,
others => 16#0000#),
others => <>);
-- csamiga1251
N826 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#006B#, 16#006F#, 16#0069#, 16#0037#,
16#0073#, 16#0077#, 16#0069#, 16#0074#,
16#0063#, 16#0068#, 16#0065#, 16#0064#,
others => 16#0000#),
others => <>);
-- koi7switched
N827 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 14,
Length => 14,
Value =>
(16#0063#, 16#0073#, 16#006B#, 16#006F#,
16#0069#, 16#0037#, 16#0073#, 16#0077#,
16#0069#, 16#0074#, 16#0063#, 16#0068#,
16#0065#, 16#0064#,
others => 16#0000#),
others => <>);
-- cskoi7switched
N828 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0062#, 16#0072#, 16#0066#,
others => 16#0000#),
others => <>);
-- brf
N829 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0063#, 16#0073#, 16#0062#, 16#0072#,
16#0066#,
others => 16#0000#),
others => <>);
-- csbrf
N830 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0074#, 16#0073#, 16#0063#, 16#0069#,
16#0069#,
others => 16#0000#),
others => <>);
-- tscii
N831 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0063#, 16#0073#, 16#0074#, 16#0073#,
16#0063#, 16#0069#, 16#0069#,
others => 16#0000#),
others => <>);
-- cstscii
N832 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0063#, 16#0070#, 16#0035#, 16#0031#,
16#0039#, 16#0033#, 16#0032#,
others => 16#0000#),
others => <>);
-- cp51932
N833 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#0063#, 16#0070#,
16#0035#, 16#0031#, 16#0039#, 16#0033#,
16#0032#,
others => 16#0000#),
others => <>);
-- cscp51932
N834 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0077#, 16#0069#, 16#006E#, 16#0064#,
16#006F#, 16#0077#, 16#0073#, 16#0038#,
16#0037#, 16#0034#,
others => 16#0000#),
others => <>);
-- windows874
N835 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0063#, 16#0073#, 16#0077#, 16#0069#,
16#006E#, 16#0064#, 16#006F#, 16#0077#,
16#0073#, 16#0038#, 16#0037#, 16#0034#,
others => 16#0000#),
others => <>);
-- cswindows874
N836 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0077#, 16#0069#, 16#006E#, 16#0064#,
16#006F#, 16#0077#, 16#0073#, 16#0031#,
16#0032#, 16#0035#, 16#0030#,
others => 16#0000#),
others => <>);
-- windows1250
N837 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0077#, 16#0069#,
16#006E#, 16#0064#, 16#006F#, 16#0077#,
16#0073#, 16#0031#, 16#0032#, 16#0035#,
16#0030#,
others => 16#0000#),
others => <>);
-- cswindows1250
N838 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0077#, 16#0069#, 16#006E#, 16#0064#,
16#006F#, 16#0077#, 16#0073#, 16#0031#,
16#0032#, 16#0035#, 16#0031#,
others => 16#0000#),
others => <>);
-- windows1251
N839 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0077#, 16#0069#,
16#006E#, 16#0064#, 16#006F#, 16#0077#,
16#0073#, 16#0031#, 16#0032#, 16#0035#,
16#0031#,
others => 16#0000#),
others => <>);
-- cswindows1251
N840 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0063#, 16#0070#, 16#0031#, 16#0032#,
16#0035#, 16#0031#,
others => 16#0000#),
others => <>);
-- cp1251
N841 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0077#, 16#0069#, 16#006E#, 16#0064#,
16#006F#, 16#0077#, 16#0073#, 16#0031#,
16#0032#, 16#0035#, 16#0032#,
others => 16#0000#),
others => <>);
-- windows1252
N842 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0077#, 16#0069#,
16#006E#, 16#0064#, 16#006F#, 16#0077#,
16#0073#, 16#0031#, 16#0032#, 16#0035#,
16#0032#,
others => 16#0000#),
others => <>);
-- cswindows1252
N843 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0077#, 16#0069#, 16#006E#, 16#0064#,
16#006F#, 16#0077#, 16#0073#, 16#0031#,
16#0032#, 16#0035#, 16#0033#,
others => 16#0000#),
others => <>);
-- windows1253
N844 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0077#, 16#0069#,
16#006E#, 16#0064#, 16#006F#, 16#0077#,
16#0073#, 16#0031#, 16#0032#, 16#0035#,
16#0033#,
others => 16#0000#),
others => <>);
-- cswindows1253
N845 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0077#, 16#0069#, 16#006E#, 16#0064#,
16#006F#, 16#0077#, 16#0073#, 16#0031#,
16#0032#, 16#0035#, 16#0034#,
others => 16#0000#),
others => <>);
-- windows1254
N846 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0077#, 16#0069#,
16#006E#, 16#0064#, 16#006F#, 16#0077#,
16#0073#, 16#0031#, 16#0032#, 16#0035#,
16#0034#,
others => 16#0000#),
others => <>);
-- cswindows1254
N847 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0077#, 16#0069#, 16#006E#, 16#0064#,
16#006F#, 16#0077#, 16#0073#, 16#0031#,
16#0032#, 16#0035#, 16#0035#,
others => 16#0000#),
others => <>);
-- windows1255
N848 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0077#, 16#0069#,
16#006E#, 16#0064#, 16#006F#, 16#0077#,
16#0073#, 16#0031#, 16#0032#, 16#0035#,
16#0035#,
others => 16#0000#),
others => <>);
-- cswindows1255
N849 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0077#, 16#0069#, 16#006E#, 16#0064#,
16#006F#, 16#0077#, 16#0073#, 16#0031#,
16#0032#, 16#0035#, 16#0036#,
others => 16#0000#),
others => <>);
-- windows1256
N850 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0077#, 16#0069#,
16#006E#, 16#0064#, 16#006F#, 16#0077#,
16#0073#, 16#0031#, 16#0032#, 16#0035#,
16#0036#,
others => 16#0000#),
others => <>);
-- cswindows1256
N851 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0077#, 16#0069#, 16#006E#, 16#0064#,
16#006F#, 16#0077#, 16#0073#, 16#0031#,
16#0032#, 16#0035#, 16#0037#,
others => 16#0000#),
others => <>);
-- windows1257
N852 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0077#, 16#0069#,
16#006E#, 16#0064#, 16#006F#, 16#0077#,
16#0073#, 16#0031#, 16#0032#, 16#0035#,
16#0037#,
others => 16#0000#),
others => <>);
-- cswindows1257
N853 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0077#, 16#0069#, 16#006E#, 16#0064#,
16#006F#, 16#0077#, 16#0073#, 16#0031#,
16#0032#, 16#0035#, 16#0038#,
others => 16#0000#),
others => <>);
-- windows1258
N854 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#0073#, 16#0077#, 16#0069#,
16#006E#, 16#0064#, 16#006F#, 16#0077#,
16#0073#, 16#0031#, 16#0032#, 16#0035#,
16#0038#,
others => 16#0000#),
others => <>);
-- cswindows1258
N855 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0074#, 16#0069#, 16#0073#, 16#0036#,
16#0032#, 16#0030#,
others => 16#0000#),
others => <>);
-- tis620
N856 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0063#, 16#0073#, 16#0074#, 16#0069#,
16#0073#, 16#0036#, 16#0032#, 16#0030#,
others => 16#0000#),
others => <>);
-- cstis620
N857 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 7,
Length => 7,
Value =>
(16#0063#, 16#0070#, 16#0035#, 16#0030#,
16#0032#, 16#0032#, 16#0030#,
others => 16#0000#),
others => <>);
-- cp50220
N858 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0063#, 16#0073#, 16#0063#, 16#0070#,
16#0035#, 16#0030#, 16#0032#, 16#0032#,
16#0030#,
others => 16#0000#),
others => <>);
-- cscp50220
To_MIB : constant array (Positive range <>) of IANA_Record
:= ((N1'Access, 3),
(N2'Access, 3),
(N3'Access, 3),
(N4'Access, 3),
(N5'Access, 3),
(N6'Access, 3),
(N7'Access, 3),
(N8'Access, 3),
(N9'Access, 3),
(N10'Access, 3),
(N11'Access, 4),
(N12'Access, 4),
(N13'Access, 4),
(N14'Access, 4),
(N15'Access, 4),
(N16'Access, 4),
(N17'Access, 4),
(N18'Access, 4),
(N19'Access, 5),
(N20'Access, 5),
(N21'Access, 5),
(N22'Access, 5),
(N23'Access, 5),
(N24'Access, 5),
(N25'Access, 6),
(N26'Access, 6),
(N27'Access, 6),
(N28'Access, 6),
(N29'Access, 6),
(N30'Access, 6),
(N31'Access, 7),
(N32'Access, 7),
(N33'Access, 7),
(N34'Access, 7),
(N35'Access, 7),
(N36'Access, 7),
(N37'Access, 8),
(N38'Access, 8),
(N39'Access, 8),
(N40'Access, 8),
(N41'Access, 8),
(N42'Access, 9),
(N43'Access, 9),
(N44'Access, 9),
(N45'Access, 9),
(N46'Access, 9),
(N47'Access, 9),
(N48'Access, 9),
(N49'Access, 10),
(N50'Access, 10),
(N51'Access, 10),
(N52'Access, 10),
(N53'Access, 10),
(N54'Access, 10),
(N55'Access, 10),
(N56'Access, 10),
(N57'Access, 11),
(N58'Access, 11),
(N59'Access, 11),
(N60'Access, 11),
(N61'Access, 11),
(N62'Access, 12),
(N63'Access, 12),
(N64'Access, 12),
(N65'Access, 12),
(N66'Access, 12),
(N67'Access, 12),
(N68'Access, 13),
(N69'Access, 13),
(N70'Access, 13),
(N71'Access, 13),
(N72'Access, 13),
(N73'Access, 13),
(N74'Access, 14),
(N75'Access, 14),
(N76'Access, 14),
(N77'Access, 15),
(N78'Access, 15),
(N79'Access, 15),
(N80'Access, 16),
(N81'Access, 16),
(N82'Access, 17),
(N83'Access, 17),
(N84'Access, 17),
(N85'Access, 18),
(N86'Access, 18),
(N87'Access, 18),
(N88'Access, 19),
(N89'Access, 19),
(N90'Access, 20),
(N91'Access, 20),
(N92'Access, 20),
(N93'Access, 20),
(N94'Access, 20),
(N95'Access, 20),
(N96'Access, 21),
(N97'Access, 21),
(N98'Access, 21),
(N99'Access, 21),
(N100'Access, 21),
(N101'Access, 22),
(N102'Access, 22),
(N103'Access, 22),
(N104'Access, 22),
(N105'Access, 23),
(N106'Access, 23),
(N107'Access, 23),
(N108'Access, 23),
(N109'Access, 24),
(N110'Access, 24),
(N111'Access, 24),
(N112'Access, 24),
(N113'Access, 24),
(N114'Access, 25),
(N115'Access, 25),
(N116'Access, 25),
(N117'Access, 25),
(N118'Access, 25),
(N119'Access, 25),
(N120'Access, 26),
(N121'Access, 26),
(N122'Access, 26),
(N123'Access, 26),
(N124'Access, 26),
(N125'Access, 27),
(N126'Access, 27),
(N127'Access, 28),
(N128'Access, 28),
(N129'Access, 28),
(N130'Access, 29),
(N131'Access, 29),
(N132'Access, 30),
(N133'Access, 30),
(N134'Access, 30),
(N135'Access, 30),
(N136'Access, 31),
(N137'Access, 31),
(N138'Access, 31),
(N139'Access, 32),
(N140'Access, 32),
(N141'Access, 32),
(N142'Access, 33),
(N143'Access, 33),
(N144'Access, 33),
(N145'Access, 34),
(N146'Access, 34),
(N147'Access, 34),
(N148'Access, 35),
(N149'Access, 35),
(N150'Access, 35),
(N151'Access, 35),
(N152'Access, 35),
(N153'Access, 35),
(N154'Access, 35),
(N155'Access, 36),
(N156'Access, 36),
(N157'Access, 36),
(N158'Access, 36),
(N159'Access, 36),
(N160'Access, 36),
(N161'Access, 37),
(N162'Access, 37),
(N163'Access, 38),
(N164'Access, 38),
(N165'Access, 39),
(N166'Access, 39),
(N167'Access, 40),
(N168'Access, 40),
(N169'Access, 41),
(N170'Access, 41),
(N171'Access, 41),
(N172'Access, 41),
(N173'Access, 41),
(N174'Access, 41),
(N175'Access, 42),
(N176'Access, 42),
(N177'Access, 42),
(N178'Access, 42),
(N179'Access, 42),
(N180'Access, 43),
(N181'Access, 43),
(N182'Access, 43),
(N183'Access, 43),
(N184'Access, 44),
(N185'Access, 44),
(N186'Access, 44),
(N187'Access, 45),
(N188'Access, 45),
(N189'Access, 45),
(N190'Access, 46),
(N191'Access, 46),
(N192'Access, 46),
(N193'Access, 46),
(N194'Access, 47),
(N195'Access, 47),
(N196'Access, 47),
(N197'Access, 48),
(N198'Access, 48),
(N199'Access, 48),
(N200'Access, 49),
(N201'Access, 49),
(N202'Access, 49),
(N203'Access, 50),
(N204'Access, 50),
(N205'Access, 50),
(N206'Access, 51),
(N207'Access, 51),
(N208'Access, 51),
(N209'Access, 52),
(N210'Access, 52),
(N211'Access, 52),
(N212'Access, 53),
(N213'Access, 53),
(N214'Access, 53),
(N215'Access, 54),
(N216'Access, 54),
(N217'Access, 54),
(N218'Access, 54),
(N219'Access, 55),
(N220'Access, 55),
(N221'Access, 55),
(N222'Access, 56),
(N223'Access, 56),
(N224'Access, 56),
(N225'Access, 56),
(N226'Access, 56),
(N227'Access, 57),
(N228'Access, 57),
(N229'Access, 57),
(N230'Access, 57),
(N231'Access, 58),
(N232'Access, 58),
(N233'Access, 58),
(N234'Access, 58),
(N235'Access, 58),
(N236'Access, 59),
(N237'Access, 59),
(N238'Access, 59),
(N239'Access, 60),
(N240'Access, 60),
(N241'Access, 60),
(N242'Access, 60),
(N243'Access, 61),
(N244'Access, 61),
(N245'Access, 61),
(N246'Access, 61),
(N247'Access, 62),
(N248'Access, 62),
(N249'Access, 62),
(N250'Access, 62),
(N251'Access, 62),
(N252'Access, 63),
(N253'Access, 63),
(N254'Access, 63),
(N255'Access, 63),
(N256'Access, 63),
(N257'Access, 64),
(N258'Access, 64),
(N259'Access, 64),
(N260'Access, 65),
(N261'Access, 65),
(N262'Access, 65),
(N263'Access, 65),
(N264'Access, 65),
(N265'Access, 66),
(N266'Access, 66),
(N267'Access, 67),
(N268'Access, 67),
(N269'Access, 67),
(N270'Access, 68),
(N271'Access, 68),
(N272'Access, 68),
(N273'Access, 68),
(N274'Access, 69),
(N275'Access, 69),
(N276'Access, 69),
(N277'Access, 69),
(N278'Access, 70),
(N279'Access, 70),
(N280'Access, 70),
(N281'Access, 70),
(N282'Access, 71),
(N283'Access, 71),
(N284'Access, 71),
(N285'Access, 71),
(N286'Access, 72),
(N287'Access, 72),
(N288'Access, 72),
(N289'Access, 73),
(N290'Access, 73),
(N291'Access, 73),
(N292'Access, 73),
(N293'Access, 74),
(N294'Access, 74),
(N295'Access, 74),
(N296'Access, 74),
(N297'Access, 74),
(N298'Access, 75),
(N299'Access, 75),
(N300'Access, 75),
(N301'Access, 76),
(N302'Access, 76),
(N303'Access, 76),
(N304'Access, 76),
(N305'Access, 77),
(N306'Access, 77),
(N307'Access, 77),
(N308'Access, 77),
(N309'Access, 78),
(N310'Access, 78),
(N311'Access, 78),
(N312'Access, 78),
(N313'Access, 78),
(N314'Access, 78),
(N315'Access, 79),
(N316'Access, 79),
(N317'Access, 79),
(N318'Access, 79),
(N319'Access, 79),
(N320'Access, 80),
(N321'Access, 80),
(N322'Access, 80),
(N323'Access, 81),
(N324'Access, 81),
(N325'Access, 82),
(N326'Access, 82),
(N327'Access, 83),
(N328'Access, 83),
(N329'Access, 83),
(N330'Access, 84),
(N331'Access, 84),
(N332'Access, 85),
(N333'Access, 85),
(N334'Access, 86),
(N335'Access, 86),
(N336'Access, 86),
(N337'Access, 87),
(N338'Access, 87),
(N339'Access, 87),
(N340'Access, 87),
(N341'Access, 87),
(N342'Access, 87),
(N343'Access, 88),
(N344'Access, 88),
(N345'Access, 88),
(N346'Access, 89),
(N347'Access, 89),
(N348'Access, 89),
(N349'Access, 89),
(N350'Access, 90),
(N351'Access, 90),
(N352'Access, 90),
(N353'Access, 90),
(N354'Access, 91),
(N355'Access, 91),
(N356'Access, 91),
(N357'Access, 91),
(N358'Access, 92),
(N359'Access, 92),
(N360'Access, 92),
(N361'Access, 92),
(N362'Access, 92),
(N363'Access, 93),
(N364'Access, 93),
(N365'Access, 93),
(N366'Access, 94),
(N367'Access, 94),
(N368'Access, 94),
(N369'Access, 94),
(N370'Access, 95),
(N371'Access, 95),
(N372'Access, 95),
(N373'Access, 95),
(N374'Access, 96),
(N375'Access, 96),
(N376'Access, 96),
(N377'Access, 97),
(N378'Access, 97),
(N379'Access, 97),
(N380'Access, 97),
(N381'Access, 98),
(N382'Access, 98),
(N383'Access, 98),
(N384'Access, 98),
(N385'Access, 99),
(N386'Access, 99),
(N387'Access, 99),
(N388'Access, 99),
(N389'Access, 100),
(N390'Access, 100),
(N391'Access, 101),
(N392'Access, 101),
(N393'Access, 102),
(N394'Access, 102),
(N395'Access, 102),
(N396'Access, 103),
(N397'Access, 103),
(N398'Access, 104),
(N399'Access, 104),
(N400'Access, 105),
(N401'Access, 105),
(N402'Access, 106),
(N403'Access, 106),
(N404'Access, 109),
(N405'Access, 109),
(N406'Access, 110),
(N407'Access, 110),
(N408'Access, 110),
(N409'Access, 110),
(N410'Access, 110),
(N411'Access, 110),
(N412'Access, 110),
(N413'Access, 111),
(N414'Access, 111),
(N415'Access, 111),
(N416'Access, 112),
(N417'Access, 112),
(N418'Access, 112),
(N419'Access, 112),
(N420'Access, 112),
(N421'Access, 112),
(N422'Access, 113),
(N423'Access, 113),
(N424'Access, 113),
(N425'Access, 113),
(N426'Access, 113),
(N427'Access, 114),
(N428'Access, 114),
(N429'Access, 115),
(N430'Access, 115),
(N431'Access, 116),
(N432'Access, 116),
(N433'Access, 117),
(N434'Access, 117),
(N435'Access, 118),
(N436'Access, 118),
(N437'Access, 118),
(N438'Access, 119),
(N439'Access, 119),
(N440'Access, 119),
(N441'Access, 119),
(N442'Access, 1000),
(N443'Access, 1000),
(N444'Access, 1001),
(N445'Access, 1001),
(N446'Access, 1002),
(N447'Access, 1002),
(N448'Access, 1003),
(N449'Access, 1003),
(N450'Access, 1003),
(N451'Access, 1004),
(N452'Access, 1004),
(N453'Access, 1005),
(N454'Access, 1005),
(N455'Access, 1006),
(N456'Access, 1006),
(N457'Access, 1007),
(N458'Access, 1007),
(N459'Access, 1008),
(N460'Access, 1008),
(N461'Access, 1009),
(N462'Access, 1009),
(N463'Access, 1010),
(N464'Access, 1010),
(N465'Access, 1011),
(N466'Access, 1011),
(N467'Access, 1012),
(N468'Access, 1012),
(N469'Access, 1013),
(N470'Access, 1013),
(N471'Access, 1014),
(N472'Access, 1014),
(N473'Access, 1015),
(N474'Access, 1015),
(N475'Access, 1016),
(N476'Access, 1016),
(N477'Access, 1017),
(N478'Access, 1017),
(N479'Access, 1018),
(N480'Access, 1018),
(N481'Access, 1019),
(N482'Access, 1019),
(N483'Access, 1020),
(N484'Access, 1020),
(N485'Access, 2000),
(N486'Access, 2000),
(N487'Access, 2001),
(N488'Access, 2001),
(N489'Access, 2002),
(N490'Access, 2002),
(N491'Access, 2003),
(N492'Access, 2003),
(N493'Access, 2004),
(N494'Access, 2004),
(N495'Access, 2004),
(N496'Access, 2004),
(N497'Access, 2005),
(N498'Access, 2005),
(N499'Access, 2006),
(N500'Access, 2006),
(N501'Access, 2007),
(N502'Access, 2007),
(N503'Access, 2008),
(N504'Access, 2008),
(N505'Access, 2008),
(N506'Access, 2009),
(N507'Access, 2009),
(N508'Access, 2009),
(N509'Access, 2009),
(N510'Access, 2012),
(N511'Access, 2012),
(N512'Access, 2013),
(N513'Access, 2013),
(N514'Access, 2013),
(N515'Access, 2013),
(N516'Access, 2014),
(N517'Access, 2014),
(N518'Access, 2015),
(N519'Access, 2015),
(N520'Access, 2016),
(N521'Access, 2016),
(N522'Access, 2017),
(N523'Access, 2017),
(N524'Access, 2018),
(N525'Access, 2018),
(N526'Access, 2019),
(N527'Access, 2019),
(N528'Access, 2020),
(N529'Access, 2020),
(N530'Access, 2021),
(N531'Access, 2021),
(N532'Access, 2022),
(N533'Access, 2022),
(N534'Access, 2023),
(N535'Access, 2023),
(N536'Access, 2024),
(N537'Access, 2024),
(N538'Access, 2025),
(N539'Access, 2025),
(N540'Access, 2026),
(N541'Access, 2026),
(N542'Access, 2027),
(N543'Access, 2027),
(N544'Access, 2027),
(N545'Access, 2028),
(N546'Access, 2028),
(N547'Access, 2028),
(N548'Access, 2028),
(N549'Access, 2028),
(N550'Access, 2028),
(N551'Access, 2028),
(N552'Access, 2029),
(N553'Access, 2029),
(N554'Access, 2029),
(N555'Access, 2029),
(N556'Access, 2030),
(N557'Access, 2030),
(N558'Access, 2030),
(N559'Access, 2031),
(N560'Access, 2031),
(N561'Access, 2031),
(N562'Access, 2031),
(N563'Access, 2032),
(N564'Access, 2032),
(N565'Access, 2032),
(N566'Access, 2032),
(N567'Access, 2033),
(N568'Access, 2033),
(N569'Access, 2033),
(N570'Access, 2033),
(N571'Access, 2034),
(N572'Access, 2034),
(N573'Access, 2034),
(N574'Access, 2034),
(N575'Access, 2034),
(N576'Access, 2035),
(N577'Access, 2035),
(N578'Access, 2035),
(N579'Access, 2035),
(N580'Access, 2036),
(N581'Access, 2036),
(N582'Access, 2036),
(N583'Access, 2036),
(N584'Access, 2037),
(N585'Access, 2037),
(N586'Access, 2037),
(N587'Access, 2037),
(N588'Access, 2038),
(N589'Access, 2038),
(N590'Access, 2038),
(N591'Access, 2038),
(N592'Access, 2039),
(N593'Access, 2039),
(N594'Access, 2039),
(N595'Access, 2039),
(N596'Access, 2040),
(N597'Access, 2040),
(N598'Access, 2040),
(N599'Access, 2040),
(N600'Access, 2041),
(N601'Access, 2041),
(N602'Access, 2041),
(N603'Access, 2041),
(N604'Access, 2042),
(N605'Access, 2042),
(N606'Access, 2042),
(N607'Access, 2042),
(N608'Access, 2043),
(N609'Access, 2043),
(N610'Access, 2043),
(N611'Access, 2043),
(N612'Access, 2011),
(N613'Access, 2011),
(N614'Access, 2011),
(N615'Access, 2011),
(N616'Access, 2044),
(N617'Access, 2044),
(N618'Access, 2044),
(N619'Access, 2044),
(N620'Access, 2044),
(N621'Access, 2045),
(N622'Access, 2045),
(N623'Access, 2045),
(N624'Access, 2045),
(N625'Access, 2010),
(N626'Access, 2010),
(N627'Access, 2010),
(N628'Access, 2010),
(N629'Access, 2046),
(N630'Access, 2046),
(N631'Access, 2046),
(N632'Access, 2046),
(N633'Access, 2047),
(N634'Access, 2047),
(N635'Access, 2047),
(N636'Access, 2047),
(N637'Access, 2048),
(N638'Access, 2048),
(N639'Access, 2048),
(N640'Access, 2048),
(N641'Access, 2049),
(N642'Access, 2049),
(N643'Access, 2049),
(N644'Access, 2049),
(N645'Access, 2049),
(N646'Access, 2050),
(N647'Access, 2050),
(N648'Access, 2050),
(N649'Access, 2050),
(N650'Access, 2051),
(N651'Access, 2051),
(N652'Access, 2051),
(N653'Access, 2052),
(N654'Access, 2052),
(N655'Access, 2052),
(N656'Access, 2052),
(N657'Access, 2053),
(N658'Access, 2053),
(N659'Access, 2053),
(N660'Access, 2053),
(N661'Access, 2054),
(N662'Access, 2054),
(N663'Access, 2054),
(N664'Access, 2054),
(N665'Access, 2054),
(N666'Access, 2055),
(N667'Access, 2055),
(N668'Access, 2055),
(N669'Access, 2055),
(N670'Access, 2055),
(N671'Access, 2056),
(N672'Access, 2056),
(N673'Access, 2056),
(N674'Access, 2056),
(N675'Access, 2057),
(N676'Access, 2057),
(N677'Access, 2057),
(N678'Access, 2057),
(N679'Access, 2058),
(N680'Access, 2058),
(N681'Access, 2058),
(N682'Access, 2059),
(N683'Access, 2059),
(N684'Access, 2059),
(N685'Access, 2060),
(N686'Access, 2060),
(N687'Access, 2060),
(N688'Access, 2060),
(N689'Access, 2061),
(N690'Access, 2061),
(N691'Access, 2061),
(N692'Access, 2061),
(N693'Access, 2062),
(N694'Access, 2062),
(N695'Access, 2062),
(N696'Access, 2062),
(N697'Access, 2063),
(N698'Access, 2063),
(N699'Access, 2063),
(N700'Access, 2064),
(N701'Access, 2064),
(N702'Access, 2065),
(N703'Access, 2065),
(N704'Access, 2066),
(N705'Access, 2066),
(N706'Access, 2067),
(N707'Access, 2067),
(N708'Access, 2068),
(N709'Access, 2068),
(N710'Access, 2069),
(N711'Access, 2069),
(N712'Access, 2070),
(N713'Access, 2070),
(N714'Access, 2071),
(N715'Access, 2071),
(N716'Access, 2072),
(N717'Access, 2072),
(N718'Access, 2073),
(N719'Access, 2073),
(N720'Access, 2074),
(N721'Access, 2074),
(N722'Access, 2075),
(N723'Access, 2075),
(N724'Access, 2076),
(N725'Access, 2076),
(N726'Access, 2077),
(N727'Access, 2077),
(N728'Access, 2078),
(N729'Access, 2078),
(N730'Access, 2079),
(N731'Access, 2079),
(N732'Access, 2080),
(N733'Access, 2080),
(N734'Access, 2081),
(N735'Access, 2081),
(N736'Access, 2082),
(N737'Access, 2082),
(N738'Access, 2083),
(N739'Access, 2083),
(N740'Access, 2084),
(N741'Access, 2084),
(N742'Access, 2085),
(N743'Access, 2086),
(N744'Access, 2086),
(N745'Access, 2086),
(N746'Access, 2086),
(N747'Access, 2087),
(N748'Access, 2087),
(N749'Access, 2087),
(N750'Access, 2088),
(N751'Access, 2088),
(N752'Access, 2089),
(N753'Access, 2089),
(N754'Access, 2089),
(N755'Access, 2089),
(N756'Access, 2089),
(N757'Access, 2090),
(N758'Access, 2090),
(N759'Access, 2090),
(N760'Access, 2090),
(N761'Access, 2090),
(N762'Access, 2091),
(N763'Access, 2091),
(N764'Access, 2091),
(N765'Access, 2091),
(N766'Access, 2091),
(N767'Access, 2092),
(N768'Access, 2092),
(N769'Access, 2092),
(N770'Access, 2092),
(N771'Access, 2092),
(N772'Access, 2093),
(N773'Access, 2093),
(N774'Access, 2093),
(N775'Access, 2093),
(N776'Access, 2093),
(N777'Access, 2093),
(N778'Access, 2094),
(N779'Access, 2094),
(N780'Access, 2094),
(N781'Access, 2094),
(N782'Access, 2094),
(N783'Access, 2094),
(N784'Access, 2095),
(N785'Access, 2095),
(N786'Access, 2095),
(N787'Access, 2095),
(N788'Access, 2095),
(N789'Access, 2096),
(N790'Access, 2096),
(N791'Access, 2096),
(N792'Access, 2096),
(N793'Access, 2096),
(N794'Access, 2097),
(N795'Access, 2097),
(N796'Access, 2097),
(N797'Access, 2097),
(N798'Access, 2097),
(N799'Access, 2098),
(N800'Access, 2098),
(N801'Access, 2098),
(N802'Access, 2098),
(N803'Access, 2098),
(N804'Access, 2099),
(N805'Access, 2099),
(N806'Access, 2099),
(N807'Access, 2099),
(N808'Access, 2099),
(N809'Access, 2100),
(N810'Access, 2100),
(N811'Access, 2100),
(N812'Access, 2100),
(N813'Access, 2100),
(N814'Access, 2101),
(N815'Access, 2101),
(N816'Access, 2102),
(N817'Access, 2102),
(N818'Access, 2103),
(N819'Access, 2103),
(N820'Access, 2103),
(N821'Access, 2103),
(N822'Access, 2103),
(N823'Access, 2104),
(N824'Access, 2104),
(N825'Access, 2104),
(N826'Access, 2105),
(N827'Access, 2105),
(N828'Access, 2106),
(N829'Access, 2106),
(N830'Access, 2107),
(N831'Access, 2107),
(N832'Access, 2108),
(N833'Access, 2108),
(N834'Access, 2109),
(N835'Access, 2109),
(N836'Access, 2250),
(N837'Access, 2250),
(N838'Access, 2251),
(N839'Access, 2251),
(N840'Access, 2251),
(N841'Access, 2252),
(N842'Access, 2252),
(N843'Access, 2253),
(N844'Access, 2253),
(N845'Access, 2254),
(N846'Access, 2254),
(N847'Access, 2255),
(N848'Access, 2255),
(N849'Access, 2256),
(N850'Access, 2256),
(N851'Access, 2257),
(N852'Access, 2257),
(N853'Access, 2258),
(N854'Access, 2258),
(N855'Access, 2259),
(N856'Access, 2259),
(N857'Access, 2260),
(N858'Access, 2260));
end Matreshka.Internals.Text_Codecs.IANA_Registry;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- package Mes_Tasches_P is
package Input_1 is
task Ma_Tasche is
entry Accepter
(Continuer : Boolean);
end Ma_Tasche;
task Mon_Autre_Tasche;
task type Tasche_Type_1_T;
Une_Tasche : Tasche_Type_1_T;
task type Tasche_Type_2_T is
entry Start;
entry Lire
(Donnee : out Integer);
end Tasche_Type_2_T;
-- Task type with discriminant.
task type Tasche_Type_3_T
-- We could have any number of arguments in discriminant
-- Work exactly like argument in procedure/function/entry/accept
(Taille : Integer)
is
entry Start;
end Tasche_Type_3_T;
-- protected objects.
protected Objet_Protege is
entry Demarrer;
procedure Faire;
function Tester return Boolean;
private
Variable : Boolean := True;
end Objet_Protege;
protected type Type_Protege is
entry Demarrer;
procedure Faire;
function Tester return Boolean;
private
Variable : Boolean := True;
end Type_Protege;
protected type Discriminant_Protege
(Priorite : Natural)
is
entry Demarrer;
procedure Faire;
function Tester return Boolean;
private
Variable : Boolean := True;
end Discriminant_Protege;
end Input_1;
-- end Mes_Tasches_P;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with ada.text_io, ada.Integer_text_IO, Ada.Text_IO.Text_Streams, Ada.Strings.Fixed, Interfaces.C;
use ada.text_io, ada.Integer_text_IO, Ada.Strings, Ada.Strings.Fixed, Interfaces.C;
procedure euler34 is
type stringptr is access all char_array;
procedure PString(s : stringptr) is
begin
String'Write (Text_Streams.Stream (Current_Output), To_Ada(s.all));
end;
procedure PInt(i : in Integer) is
begin
String'Write (Text_Streams.Stream (Current_Output), Trim(Integer'Image(i), Left));
end;
type h is Array (Integer range <>) of Integer;
type h_PTR is access h;
sum : Integer;
out0 : Integer;
num : Integer;
f : h_PTR;
begin
f := new h (0..9);
for j in integer range 0..9 loop
f(j) := 1;
end loop;
for i in integer range 1..9 loop
f(i) := f(i) * i * f(i - 1);
PInt(f(i));
PString(new char_array'( To_C(" ")));
end loop;
out0 := 0;
PString(new char_array'( To_C("" & Character'Val(10))));
for a in integer range 0..9 loop
for b in integer range 0..9 loop
for c in integer range 0..9 loop
for d in integer range 0..9 loop
for e in integer range 0..9 loop
for g in integer range 0..9 loop
sum := f(a) + f(b) + f(c) + f(d) + f(e) + f(g);
num := ((((a * 10 + b) * 10 + c) * 10 + d) * 10 + e) * 10 + g;
if a = 0
then
sum := sum - 1;
if b = 0
then
sum := sum - 1;
if c = 0
then
sum := sum - 1;
if d = 0
then
sum := sum - 1;
end if;
end if;
end if;
end if;
if (sum = num and then sum /= 1) and then sum /= 2
then
out0 := out0 + num;
PInt(num);
PString(new char_array'( To_C(" ")));
end if;
end loop;
end loop;
end loop;
end loop;
end loop;
end loop;
PString(new char_array'( To_C("" & Character'Val(10))));
PInt(out0);
PString(new char_array'( To_C("" & Character'Val(10))));
end;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
------------------------------------------------------------------------------
-- This spec is derived from package Ada.Containers.Bounded_Vectors in the Ada
-- 2012 RM. The modifications are meant to facilitate formal proofs by making
-- it easier to express properties, and by making the specification of this
-- unit compatible with SPARK 2014. Note that the API of this unit may be
-- subject to incompatible changes as SPARK 2014 evolves.
with Ada.Containers.Functional_Vectors;
generic
type Index_Type is range <>;
type Element_Type is private;
with function "=" (Left, Right : Element_Type) return Boolean is <>;
package Ada.Containers.Formal_Vectors with
SPARK_Mode
is
-- Contracts in this unit are meant for analysis only, not for run-time
-- checking.
pragma Assertion_Policy (Pre => Ignore);
pragma Assertion_Policy (Post => Ignore);
pragma Annotate (CodePeer, Skip_Analysis);
subtype Extended_Index is Index_Type'Base
range Index_Type'First - 1 ..
Index_Type'Min (Index_Type'Base'Last - 1, Index_Type'Last) + 1;
No_Index : constant Extended_Index := Extended_Index'First;
Last_Count : constant Count_Type :=
(if Index_Type'Last < Index_Type'First then
0
elsif Index_Type'Last < -1
or else Index_Type'Pos (Index_Type'First) >
Index_Type'Pos (Index_Type'Last) - Count_Type'Last
then
Index_Type'Pos (Index_Type'Last) -
Index_Type'Pos (Index_Type'First) + 1
else
Count_Type'Last);
-- Maximal capacity of any vector. It is the minimum of the size of the
-- index range and the last possible Count_Type.
subtype Capacity_Range is Count_Type range 0 .. Last_Count;
type Vector (Capacity : Capacity_Range) is private with
Default_Initial_Condition => Is_Empty (Vector),
Iterable => (First => Iter_First,
Has_Element => Iter_Has_Element,
Next => Iter_Next,
Element => Element);
function Length (Container : Vector) return Capacity_Range with
Global => null,
Post => Length'Result <= Capacity (Container);
pragma Unevaluated_Use_Of_Old (Allow);
package Formal_Model with Ghost is
package M is new Ada.Containers.Functional_Vectors
(Index_Type => Index_Type,
Element_Type => Element_Type);
function "="
(Left : M.Sequence;
Right : M.Sequence) return Boolean renames M."=";
function "<"
(Left : M.Sequence;
Right : M.Sequence) return Boolean renames M."<";
function "<="
(Left : M.Sequence;
Right : M.Sequence) return Boolean renames M."<=";
function M_Elements_In_Union
(Container : M.Sequence;
Left : M.Sequence;
Right : M.Sequence) return Boolean
-- The elements of Container are contained in either Left or Right
with
Global => null,
Post =>
M_Elements_In_Union'Result =
(for all I in Index_Type'First .. M.Last (Container) =>
(for some J in Index_Type'First .. M.Last (Left) =>
Element (Container, I) = Element (Left, J))
or (for some J in Index_Type'First .. M.Last (Right) =>
Element (Container, I) = Element (Right, J)));
pragma Annotate (GNATprove, Inline_For_Proof, M_Elements_In_Union);
function M_Elements_Included
(Left : M.Sequence;
L_Fst : Index_Type := Index_Type'First;
L_Lst : Extended_Index;
Right : M.Sequence;
R_Fst : Index_Type := Index_Type'First;
R_Lst : Extended_Index) return Boolean
-- The elements of the slice from L_Fst to L_Lst in Left are contained
-- in the slide from R_Fst to R_Lst in Right.
with
Global => null,
Pre => L_Lst <= M.Last (Left) and R_Lst <= M.Last (Right),
Post =>
M_Elements_Included'Result =
(for all I in L_Fst .. L_Lst =>
(for some J in R_Fst .. R_Lst =>
Element (Left, I) = Element (Right, J)));
pragma Annotate (GNATprove, Inline_For_Proof, M_Elements_Included);
function M_Elements_Reversed
(Left : M.Sequence;
Right : M.Sequence) return Boolean
-- Right is Left in reverse order
with
Global => null,
Post =>
M_Elements_Reversed'Result =
(M.Length (Left) = M.Length (Right)
and (for all I in Index_Type'First .. M.Last (Left) =>
Element (Left, I) =
Element (Right, M.Last (Left) - I + 1))
and (for all I in Index_Type'First .. M.Last (Right) =>
Element (Right, I) =
Element (Left, M.Last (Left) - I + 1)));
pragma Annotate (GNATprove, Inline_For_Proof, M_Elements_Reversed);
function M_Elements_Swapped
(Left : M.Sequence;
Right : M.Sequence;
X : Index_Type;
Y : Index_Type) return Boolean
-- Elements stored at X and Y are reversed in Left and Right
with
Global => null,
Pre => X <= M.Last (Left) and Y <= M.Last (Left),
Post =>
M_Elements_Swapped'Result =
(M.Length (Left) = M.Length (Right)
and Element (Left, X) = Element (Right, Y)
and Element (Left, Y) = Element (Right, X)
and M.Equal_Except (Left, Right, X, Y));
pragma Annotate (GNATprove, Inline_For_Proof, M_Elements_Swapped);
function Model (Container : Vector) return M.Sequence with
-- The high-level model of a vector is a sequence of elements. The
-- sequence really is similar to the vector itself. However, it is not
-- limited which allows usage of 'Old and 'Loop_Entry attributes.
Ghost,
Global => null,
Post => M.Length (Model'Result) = Length (Container);
pragma Annotate (GNATprove, Iterable_For_Proof, "Model", Model);
function Element
(S : M.Sequence;
I : Index_Type) return Element_Type renames M.Get;
-- To improve readability of contracts, we rename the function used to
-- access an element in the model to Element.
end Formal_Model;
use Formal_Model;
function Empty_Vector return Vector with
Global => null,
Post => Length (Empty_Vector'Result) = 0;
function "=" (Left, Right : Vector) return Boolean with
Global => null,
Post => "="'Result = (Model (Left) = Model (Right));
function To_Vector
(New_Item : Element_Type;
Length : Capacity_Range) return Vector
with
Global => null,
Post =>
Formal_Vectors.Length (To_Vector'Result) = Length
and M.Constant_Range
(Container => Model (To_Vector'Result),
Fst => Index_Type'First,
Lst => Last_Index (To_Vector'Result),
Item => New_Item);
function Capacity (Container : Vector) return Capacity_Range with
Global => null,
Post =>
Capacity'Result = Container.Capacity;
pragma Annotate (GNATprove, Inline_For_Proof, Capacity);
procedure Reserve_Capacity
(Container : in out Vector;
Capacity : Capacity_Range)
with
Global => null,
Pre => Capacity <= Container.Capacity,
Post => Model (Container) = Model (Container)'Old;
function Is_Empty (Container : Vector) return Boolean with
Global => null,
Post => Is_Empty'Result = (Length (Container) = 0);
procedure Clear (Container : in out Vector) with
Global => null,
Post => Length (Container) = 0;
procedure Assign (Target : in out Vector; Source : Vector) with
Global => null,
Pre => Length (Source) <= Target.Capacity,
Post => Model (Target) = Model (Source);
function Copy
(Source : Vector;
Capacity : Capacity_Range := 0) return Vector
with
Global => null,
Pre => (Capacity = 0 or Length (Source) <= Capacity),
Post =>
Model (Copy'Result) = Model (Source)
and (if Capacity = 0 then
Copy'Result.Capacity = Length (Source)
else
Copy'Result.Capacity = Capacity);
procedure Move (Target : in out Vector; Source : in out Vector)
with
Global => null,
Pre => Length (Source) <= Capacity (Target),
Post => Model (Target) = Model (Source)'Old and Length (Source) = 0;
function Element
(Container : Vector;
Index : Index_Type) return Element_Type
with
Global => null,
Pre => Index in First_Index (Container) .. Last_Index (Container),
Post => Element'Result = Element (Model (Container), Index);
pragma Annotate (GNATprove, Inline_For_Proof, Element);
procedure Replace_Element
(Container : in out Vector;
Index : Index_Type;
New_Item : Element_Type)
with
Global => null,
Pre => Index in First_Index (Container) .. Last_Index (Container),
Post =>
Length (Container) = Length (Container)'Old
-- Container now has New_Item at index Index
and Element (Model (Container), Index) = New_Item
-- All other elements are preserved
and M.Equal_Except
(Left => Model (Container)'Old,
Right => Model (Container),
Position => Index);
function At_End (E : access constant Vector) return access constant Vector
is (E)
with Ghost,
Annotate => (GNATprove, At_End_Borrow);
function At_End
(E : access constant Element_Type) return access constant Element_Type
is (E)
with Ghost,
Annotate => (GNATprove, At_End_Borrow);
function Constant_Reference
(Container : aliased Vector;
Index : Index_Type) return not null access constant Element_Type
with
Global => null,
Pre => Index in First_Index (Container) .. Last_Index (Container),
Post =>
Constant_Reference'Result.all = Element (Model (Container), Index);
function Reference
(Container : not null access Vector;
Index : Index_Type) return not null access Element_Type
with
Global => null,
Pre =>
Index in First_Index (Container.all) .. Last_Index (Container.all),
Post =>
Length (Container.all) = Length (At_End (Container).all)
-- Container will have Result.all at index Index
and At_End (Reference'Result).all =
Element (Model (At_End (Container).all), Index)
-- All other elements are preserved
and M.Equal_Except
(Left => Model (Container.all),
Right => Model (At_End (Container).all),
Position => Index);
procedure Insert
(Container : in out Vector;
Before : Extended_Index;
New_Item : Vector)
with
Global => null,
Pre =>
Length (Container) <= Capacity (Container) - Length (New_Item)
and (Before in Index_Type'First .. Last_Index (Container)
or (Before /= No_Index
and then Before - 1 = Last_Index (Container))),
Post =>
Length (Container) = Length (Container)'Old + Length (New_Item)
-- Elements located before Before in Container are preserved
and M.Range_Equal
(Left => Model (Container)'Old,
Right => Model (Container),
Fst => Index_Type'First,
Lst => Before - 1)
-- Elements of New_Item are inserted at position Before
and (if Length (New_Item) > 0 then
M.Range_Shifted
(Left => Model (New_Item),
Right => Model (Container),
Fst => Index_Type'First,
Lst => Last_Index (New_Item),
Offset => Count_Type (Before - Index_Type'First)))
-- Elements located after Before in Container are shifted
and M.Range_Shifted
(Left => Model (Container)'Old,
Right => Model (Container),
Fst => Before,
Lst => Last_Index (Container)'Old,
Offset => Length (New_Item));
procedure Insert
(Container : in out Vector;
Before : Extended_Index;
New_Item : Element_Type)
with
Global => null,
Pre =>
Length (Container) < Capacity (Container)
and then (Before in Index_Type'First .. Last_Index (Container) + 1),
Post =>
Length (Container) = Length (Container)'Old + 1
-- Elements located before Before in Container are preserved
and M.Range_Equal
(Left => Model (Container)'Old,
Right => Model (Container),
Fst => Index_Type'First,
Lst => Before - 1)
-- Container now has New_Item at index Before
and Element (Model (Container), Before) = New_Item
-- Elements located after Before in Container are shifted by 1
and M.Range_Shifted
(Left => Model (Container)'Old,
Right => Model (Container),
Fst => Before,
Lst => Last_Index (Container)'Old,
Offset => 1);
procedure Insert
(Container : in out Vector;
Before : Extended_Index;
New_Item : Element_Type;
Count : Count_Type)
with
Global => null,
Pre =>
Length (Container) <= Capacity (Container) - Count
and (Before in Index_Type'First .. Last_Index (Container)
or (Before /= No_Index
and then Before - 1 = Last_Index (Container))),
Post =>
Length (Container) = Length (Container)'Old + Count
-- Elements located before Before in Container are preserved
and M.Range_Equal
(Left => Model (Container)'Old,
Right => Model (Container),
Fst => Index_Type'First,
Lst => Before - 1)
-- New_Item is inserted Count times at position Before
and (if Count > 0 then
M.Constant_Range
(Container => Model (Container),
Fst => Before,
Lst => Before + Index_Type'Base (Count - 1),
Item => New_Item))
-- Elements located after Before in Container are shifted
and M.Range_Shifted
(Left => Model (Container)'Old,
Right => Model (Container),
Fst => Before,
Lst => Last_Index (Container)'Old,
Offset => Count);
procedure Prepend (Container : in out Vector; New_Item : Vector) with
Global => null,
Pre => Length (Container) <= Capacity (Container) - Length (New_Item),
Post =>
Length (Container) = Length (Container)'Old + Length (New_Item)
-- Elements of New_Item are inserted at the beginning of Container
and M.Range_Equal
(Left => Model (New_Item),
Right => Model (Container),
Fst => Index_Type'First,
Lst => Last_Index (New_Item))
-- Elements of Container are shifted
and M.Range_Shifted
(Left => Model (Container)'Old,
Right => Model (Container),
Fst => Index_Type'First,
Lst => Last_Index (Container)'Old,
Offset => Length (New_Item));
procedure Prepend (Container : in out Vector; New_Item : Element_Type) with
Global => null,
Pre => Length (Container) < Capacity (Container),
Post =>
Length (Container) = Length (Container)'Old + 1
-- Container now has New_Item at Index_Type'First
and Element (Model (Container), Index_Type'First) = New_Item
-- Elements of Container are shifted by 1
and M.Range_Shifted
(Left => Model (Container)'Old,
Right => Model (Container),
Fst => Index_Type'First,
Lst => Last_Index (Container)'Old,
Offset => 1);
procedure Prepend
(Container : in out Vector;
New_Item : Element_Type;
Count : Count_Type)
with
Global => null,
Pre => Length (Container) <= Capacity (Container) - Count,
Post =>
Length (Container) = Length (Container)'Old + Count
-- New_Item is inserted Count times at the beginning of Container
and M.Constant_Range
(Container => Model (Container),
Fst => Index_Type'First,
Lst => Index_Type'First + Index_Type'Base (Count - 1),
Item => New_Item)
-- Elements of Container are shifted
and M.Range_Shifted
(Left => Model (Container)'Old,
Right => Model (Container),
Fst => Index_Type'First,
Lst => Last_Index (Container)'Old,
Offset => Count);
procedure Append (Container : in out Vector; New_Item : Vector) with
Global => null,
Pre =>
Length (Container) <= Capacity (Container) - Length (New_Item),
Post =>
Length (Container) = Length (Container)'Old + Length (New_Item)
-- The elements of Container are preserved
and Model (Container)'Old <= Model (Container)
-- Elements of New_Item are inserted at the end of Container
and (if Length (New_Item) > 0 then
M.Range_Shifted
(Left => Model (New_Item),
Right => Model (Container),
Fst => Index_Type'First,
Lst => Last_Index (New_Item),
Offset =>
Count_Type
(Last_Index (Container)'Old - Index_Type'First + 1)));
procedure Append (Container : in out Vector; New_Item : Element_Type) with
Global => null,
Pre => Length (Container) < Capacity (Container),
Post =>
Length (Container) = Length (Container)'Old + 1
-- Elements of Container are preserved
and Model (Container)'Old < Model (Container)
-- Container now has New_Item at the end of Container
and Element
(Model (Container), Last_Index (Container)'Old + 1) = New_Item;
procedure Append
(Container : in out Vector;
New_Item : Element_Type;
Count : Count_Type)
with
Global => null,
Pre => Length (Container) <= Capacity (Container) - Count,
Post =>
Length (Container) = Length (Container)'Old + Count
-- Elements of Container are preserved
and Model (Container)'Old <= Model (Container)
-- New_Item is inserted Count times at the end of Container
and (if Count > 0 then
M.Constant_Range
(Container => Model (Container),
Fst => Last_Index (Container)'Old + 1,
Lst =>
Last_Index (Container)'Old + Index_Type'Base (Count),
Item => New_Item));
procedure Delete (Container : in out Vector; Index : Extended_Index) with
Global => null,
Pre => Index in First_Index (Container) .. Last_Index (Container),
Post =>
Length (Container) = Length (Container)'Old - 1
-- Elements located before Index in Container are preserved
and M.Range_Equal
(Left => Model (Container)'Old,
Right => Model (Container),
Fst => Index_Type'First,
Lst => Index - 1)
-- Elements located after Index in Container are shifted by 1
and M.Range_Shifted
(Left => Model (Container),
Right => Model (Container)'Old,
Fst => Index,
Lst => Last_Index (Container),
Offset => 1);
procedure Delete
(Container : in out Vector;
Index : Extended_Index;
Count : Count_Type)
with
Global => null,
Pre =>
Index in First_Index (Container) .. Last_Index (Container),
Post =>
Length (Container) in
Length (Container)'Old - Count .. Length (Container)'Old
-- The elements of Container located before Index are preserved.
and M.Range_Equal
(Left => Model (Container)'Old,
Right => Model (Container),
Fst => Index_Type'First,
Lst => Index - 1),
Contract_Cases =>
-- All the elements after Position have been erased
(Length (Container) - Count <= Count_Type (Index - Index_Type'First) =>
Length (Container) = Count_Type (Index - Index_Type'First),
others =>
Length (Container) = Length (Container)'Old - Count
-- Other elements are shifted by Count
and M.Range_Shifted
(Left => Model (Container),
Right => Model (Container)'Old,
Fst => Index,
Lst => Last_Index (Container),
Offset => Count));
procedure Delete_First (Container : in out Vector) with
Global => null,
Pre => Length (Container) > 0,
Post =>
Length (Container) = Length (Container)'Old - 1
-- Elements of Container are shifted by 1
and M.Range_Shifted
(Left => Model (Container),
Right => Model (Container)'Old,
Fst => Index_Type'First,
Lst => Last_Index (Container),
Offset => 1);
procedure Delete_First (Container : in out Vector; Count : Count_Type) with
Global => null,
Contract_Cases =>
-- All the elements of Container have been erased
(Length (Container) <= Count => Length (Container) = 0,
others =>
Length (Container) = Length (Container)'Old - Count
-- Elements of Container are shifted by Count
and M.Range_Shifted
(Left => Model (Container),
Right => Model (Container)'Old,
Fst => Index_Type'First,
Lst => Last_Index (Container),
Offset => Count));
procedure Delete_Last (Container : in out Vector) with
Global => null,
Pre => Length (Container) > 0,
Post =>
Length (Container) = Length (Container)'Old - 1
-- Elements of Container are preserved
and Model (Container) < Model (Container)'Old;
procedure Delete_Last (Container : in out Vector; Count : Count_Type) with
Global => null,
Contract_Cases =>
-- All the elements after Position have been erased
(Length (Container) <= Count => Length (Container) = 0,
others =>
Length (Container) = Length (Container)'Old - Count
-- The elements of Container are preserved
and Model (Container) <= Model (Container)'Old);
procedure Reverse_Elements (Container : in out Vector) with
Global => null,
Post => M_Elements_Reversed (Model (Container)'Old, Model (Container));
procedure Swap
(Container : in out Vector;
I : Index_Type;
J : Index_Type)
with
Global => null,
Pre =>
I in First_Index (Container) .. Last_Index (Container)
and then J in First_Index (Container) .. Last_Index (Container),
Post =>
M_Elements_Swapped (Model (Container)'Old, Model (Container), I, J);
function First_Index (Container : Vector) return Index_Type with
Global => null,
Post => First_Index'Result = Index_Type'First;
pragma Annotate (GNATprove, Inline_For_Proof, First_Index);
function First_Element (Container : Vector) return Element_Type with
Global => null,
Pre => not Is_Empty (Container),
Post =>
First_Element'Result = Element (Model (Container), Index_Type'First);
pragma Annotate (GNATprove, Inline_For_Proof, First_Element);
function Last_Index (Container : Vector) return Extended_Index with
Global => null,
Post => Last_Index'Result = M.Last (Model (Container));
pragma Annotate (GNATprove, Inline_For_Proof, Last_Index);
function Last_Element (Container : Vector) return Element_Type with
Global => null,
Pre => not Is_Empty (Container),
Post =>
Last_Element'Result =
Element (Model (Container), Last_Index (Container));
pragma Annotate (GNATprove, Inline_For_Proof, Last_Element);
function Find_Index
(Container : Vector;
Item : Element_Type;
Index : Index_Type := Index_Type'First) return Extended_Index
with
Global => null,
Contract_Cases =>
-- If Item is not contained in Container after Index, Find_Index
-- returns No_Index.
(Index > Last_Index (Container)
or else not M.Contains
(Container => Model (Container),
Fst => Index,
Lst => Last_Index (Container),
Item => Item)
=>
Find_Index'Result = No_Index,
-- Otherwise, Find_Index returns a valid index greater than Index
others =>
Find_Index'Result in Index .. Last_Index (Container)
-- The element at this index in Container is Item
and Element (Model (Container), Find_Index'Result) = Item
-- It is the first occurrence of Item after Index in Container
and not M.Contains
(Container => Model (Container),
Fst => Index,
Lst => Find_Index'Result - 1,
Item => Item));
function Reverse_Find_Index
(Container : Vector;
Item : Element_Type;
Index : Index_Type := Index_Type'Last) return Extended_Index
with
Global => null,
Contract_Cases =>
-- If Item is not contained in Container before Index,
-- Reverse_Find_Index returns No_Index.
(not M.Contains
(Container => Model (Container),
Fst => Index_Type'First,
Lst => (if Index <= Last_Index (Container) then Index
else Last_Index (Container)),
Item => Item)
=>
Reverse_Find_Index'Result = No_Index,
-- Otherwise, Reverse_Find_Index returns a valid index smaller than
-- Index
others =>
Reverse_Find_Index'Result in Index_Type'First .. Index
and Reverse_Find_Index'Result <= Last_Index (Container)
-- The element at this index in Container is Item
and Element (Model (Container), Reverse_Find_Index'Result) = Item
-- It is the last occurrence of Item before Index in Container
and not M.Contains
(Container => Model (Container),
Fst => Reverse_Find_Index'Result + 1,
Lst =>
(if Index <= Last_Index (Container) then
Index
else
Last_Index (Container)),
Item => Item));
function Contains
(Container : Vector;
Item : Element_Type) return Boolean
with
Global => null,
Post =>
Contains'Result =
M.Contains
(Container => Model (Container),
Fst => Index_Type'First,
Lst => Last_Index (Container),
Item => Item);
function Has_Element
(Container : Vector;
Position : Extended_Index) return Boolean
with
Global => null,
Post =>
Has_Element'Result =
(Position in Index_Type'First .. Last_Index (Container));
pragma Annotate (GNATprove, Inline_For_Proof, Has_Element);
generic
with function "<" (Left, Right : Element_Type) return Boolean is <>;
package Generic_Sorting with SPARK_Mode is
package Formal_Model with Ghost is
function M_Elements_Sorted (Container : M.Sequence) return Boolean
with
Global => null,
Post =>
M_Elements_Sorted'Result =
(for all I in Index_Type'First .. M.Last (Container) =>
(for all J in I .. M.Last (Container) =>
Element (Container, I) = Element (Container, J)
or Element (Container, I) < Element (Container, J)));
pragma Annotate (GNATprove, Inline_For_Proof, M_Elements_Sorted);
end Formal_Model;
use Formal_Model;
function Is_Sorted (Container : Vector) return Boolean with
Global => null,
Post => Is_Sorted'Result = M_Elements_Sorted (Model (Container));
procedure Sort (Container : in out Vector) with
Global => null,
Post =>
Length (Container) = Length (Container)'Old
and M_Elements_Sorted (Model (Container))
and M_Elements_Included
(Left => Model (Container)'Old,
L_Lst => Last_Index (Container),
Right => Model (Container),
R_Lst => Last_Index (Container))
and M_Elements_Included
(Left => Model (Container),
L_Lst => Last_Index (Container),
Right => Model (Container)'Old,
R_Lst => Last_Index (Container));
procedure Merge (Target : in out Vector; Source : in out Vector) with
-- Target and Source should not be aliased
Global => null,
Pre => Length (Source) <= Capacity (Target) - Length (Target),
Post =>
Length (Target) = Length (Target)'Old + Length (Source)'Old
and Length (Source) = 0
and (if M_Elements_Sorted (Model (Target)'Old)
and M_Elements_Sorted (Model (Source)'Old)
then
M_Elements_Sorted (Model (Target)))
and M_Elements_Included
(Left => Model (Target)'Old,
L_Lst => Last_Index (Target)'Old,
Right => Model (Target),
R_Lst => Last_Index (Target))
and M_Elements_Included
(Left => Model (Source)'Old,
L_Lst => Last_Index (Source)'Old,
Right => Model (Target),
R_Lst => Last_Index (Target))
and M_Elements_In_Union
(Model (Target),
Model (Source)'Old,
Model (Target)'Old);
end Generic_Sorting;
---------------------------
-- Iteration Primitives --
---------------------------
function Iter_First (Container : Vector) return Extended_Index with
Global => null;
function Iter_Has_Element
(Container : Vector;
Position : Extended_Index) return Boolean
with
Global => null,
Post =>
Iter_Has_Element'Result =
(Position in Index_Type'First .. Last_Index (Container));
pragma Annotate (GNATprove, Inline_For_Proof, Iter_Has_Element);
function Iter_Next
(Container : Vector;
Position : Extended_Index) return Extended_Index
with
Global => null,
Pre => Iter_Has_Element (Container, Position);
private
pragma SPARK_Mode (Off);
pragma Inline (First_Index);
pragma Inline (Last_Index);
pragma Inline (Element);
pragma Inline (First_Element);
pragma Inline (Last_Element);
pragma Inline (Replace_Element);
pragma Inline (Contains);
subtype Array_Index is Capacity_Range range 1 .. Capacity_Range'Last;
type Elements_Array is array (Array_Index range <>) of aliased Element_Type;
function "=" (L, R : Elements_Array) return Boolean is abstract;
type Vector (Capacity : Capacity_Range) is record
Last : Extended_Index := No_Index;
Elements : Elements_Array (1 .. Capacity);
end record;
function Empty_Vector return Vector is
((Capacity => 0, others => <>));
function Iter_First (Container : Vector) return Extended_Index is
(Index_Type'First);
function Iter_Next
(Container : Vector;
Position : Extended_Index) return Extended_Index
is
(if Position = Extended_Index'Last then
Extended_Index'First
else
Extended_Index'Succ (Position));
function Iter_Has_Element
(Container : Vector;
Position : Extended_Index) return Boolean
is
(Position in Index_Type'First .. Container.Last);
end Ada.Containers.Formal_Vectors;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
------------------------------------------------------------------------------
-- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $
with System;
package Ada.Interrupts is
type Interrupt_ID is (Implementation_Defined);
type Parameterless_Handler is access protected procedure;
function Is_Reserved (Interrupt : in Interrupt_ID) return Boolean;
function Is_Attached (Interrupt : in Interrupt_ID) return Boolean;
function Current_Handler (Interrupt : in Interrupt_ID)
return Parameterless_Handler;
procedure Attach_Handler (New_Handler : in Parameterless_Handler;
Interrupt : in Interrupt_ID);
procedure Exchange_Handler (Old_Handler : out Parameterless_Handler;
New_Handler : in Parameterless_Handler;
Interrupt : in Interrupt_ID);
procedure Detach_Handler (Interrupt : in Interrupt_ID);
function Reference (Interrupt : in Interrupt_ID) return System.Address;
private
end Ada.Interrupts;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- SOFTWARE.
-----------------------------------------------------------------------
with Ada.Command_Line;
with Ada.Text_IO;
with Ada.Streams;
with Ada.Streams.Stream_IO;
with Interfaces.C;
with Lzma;
with Lzma.Base;
with Lzma.Container;
procedure Decompress is
use type Interfaces.C.size_t;
use type Lzma.Base.lzma_ret;
procedure Init_Decoder;
procedure Decompress (Source : in String;
Dest : in String);
BUFSIZE : constant Ada.Streams.Stream_Element_Offset := 4096;
Stream : aliased Lzma.Base.lzma_stream := Lzma.Base.LZMA_STREAM_INIT;
procedure Init_Decoder is
Result : Lzma.Base.lzma_ret;
begin
Result := Lzma.Container.lzma_stream_decoder (Stream'Unchecked_Access,
Long_Long_Integer'Last,
Lzma.Container.LZMA_CONCATENATED);
if Result /= Lzma.Base.LZMA_OK then
Ada.Text_IO.Put_Line ("Error initializing the decoder: "
& Lzma.Base.lzma_ret'Image (Result));
end if;
end Init_Decoder;
-- ------------------------------
-- Open the source file for reading, decompress that file and write the decompressed
-- output in the destination file.
-- ------------------------------
procedure Decompress (Source : in String;
Dest : in String) is
Infile : Ada.Streams.Stream_IO.File_Type;
Outfile : Ada.Streams.Stream_IO.File_Type;
Sbuf : aliased Ada.Streams.Stream_Element_Array (1 .. BUFSIZE);
Dbuf : aliased Ada.Streams.Stream_Element_Array (1 .. BUFSIZE);
Action : Lzma.Base.lzma_action := Lzma.Base.LZMA_RUN;
Last : Ada.Streams.Stream_Element_Offset;
Result : Lzma.Base.lzma_ret;
begin
Ada.Streams.Stream_IO.Open (Infile, Ada.Streams.Stream_IO.In_File, Source);
Ada.Streams.Stream_IO.Create (Outfile, Ada.Streams.Stream_IO.Out_File, Dest);
Stream.next_out := Dbuf (Dbuf'First)'Unchecked_Access;
Stream.avail_out := Dbuf'Length;
loop
-- Read a block of data from the source file.
if Stream.avail_in = 0 and not Ada.Streams.Stream_IO.End_Of_File (Infile) then
Stream.next_in := Sbuf (Sbuf'First)'Unchecked_Access;
Ada.Streams.Stream_IO.Read (Infile, Sbuf, Last);
Stream.avail_in := Interfaces.C.size_t (Last);
if Ada.Streams.Stream_IO.End_Of_File (Infile) then
Action := Lzma.Base.LZMA_FINISH;
end if;
end if;
Result := Lzma.Base.lzma_code (Stream'Unchecked_Access, Action);
-- Write the output data when the buffer is full or we reached the end of stream.
if Stream.avail_out = 0 or Result = Lzma.Base.LZMA_STREAM_END then
Last := Ada.Streams.Stream_Element_Offset (Dbuf'Length - Stream.avail_out);
Ada.Streams.Stream_IO.Write (Outfile, Item => Dbuf (Dbuf'First .. Last));
Stream.next_out := Dbuf (Dbuf'First)'Unchecked_Access;
Stream.avail_out := Dbuf'Length;
end if;
exit when Result /= Lzma.Base.LZMA_OK;
end loop;
Ada.Streams.Stream_IO.Close (Infile);
Ada.Streams.Stream_IO.Close (Outfile);
if Result /= Lzma.Base.LZMA_STREAM_END then
Ada.Text_IO.Put_Line ("Error while decompressing the input stream: "
& Lzma.Base.lzma_ret'Image (Result));
end if;
end Decompress;
begin
if Ada.Command_Line.Argument_Count /= 2 then
Ada.Text_IO.Put_Line ("Usage: decompress input output.xz");
return;
end if;
Init_Decoder;
Decompress (Ada.Command_Line.Argument (1), Ada.Command_Line.Argument (2));
Lzma.Base.lzma_end (Stream'Unchecked_Access);
end Decompress;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- with Ada.Text_IO; use Ada.Text_IO;
package body Iface_Lists is
function Has_Element (Position : Cursor) return Boolean is
-- Ada's stock ACV checks for Position = No_Element here,
-- which requires much more bookkeeping, possibly type specific.
-- Here we deal with type hierarchy, with possibly different iteration implementation deltails
-- for each derived type. It makes way more sense to let the container handle this itself.
-- So we just redispatch here..
begin
-- Put("Cursor.Has_Element (" & Position.Index'Img & "); ");
return Position.Container.Has_Element(Position.Index);
end Has_Element;
end Iface_Lists;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with Tkmrpc.Types;
with Tkmrpc.Operations.Ike;
package Tkmrpc.Response.Ike.Isa_Sign is
Data_Size : constant := 388;
type Data_Type is record
Signature : Types.Signature_Type;
end record;
for Data_Type use record
Signature at 0 range 0 .. (388 * 8) - 1;
end record;
for Data_Type'Size use Data_Size * 8;
Padding_Size : constant := Response.Body_Size - Data_Size;
subtype Padding_Range is Natural range 1 .. Padding_Size;
subtype Padding_Type is Types.Byte_Sequence (Padding_Range);
type Response_Type is record
Header : Response.Header_Type;
Data : Data_Type;
Padding : Padding_Type;
end record;
for Response_Type use record
Header at 0 range 0 .. (Response.Header_Size * 8) - 1;
Data at Response.Header_Size range 0 .. (Data_Size * 8) - 1;
Padding at Response.Header_Size + Data_Size range
0 .. (Padding_Size * 8) - 1;
end record;
for Response_Type'Size use Response.Response_Size * 8;
Null_Response : constant Response_Type :=
Response_Type'
(Header =>
Response.Header_Type'(Operation => Operations.Ike.Isa_Sign,
Result => Results.Invalid_Operation,
Request_Id => 0),
Data => Data_Type'(Signature => Types.Null_Signature_Type),
Padding => Padding_Type'(others => 0));
end Tkmrpc.Response.Ike.Isa_Sign;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with Extraction.Node_Edge_Types;
with Extraction.Utilities;
package body Extraction.Decls is
use type LALCO.Ada_Node_Kind_Type;
function Is_Standard_Package_Decl(Node : LAL.Ada_Node'Class) return Boolean is
Standard_Unit : constant LAL.Compilation_Unit := Node.P_Standard_Unit.Root.As_Compilation_Unit;
Standard_Pkg_Decl : constant LAL.Basic_Decl := Standard_Unit.F_Body.As_Library_Item.F_Item;
begin
return Node.Kind = LALCO.Ada_Package_Decl
and then Node = Standard_Pkg_Decl;
end Is_Standard_Package_Decl;
procedure Extract_Nodes
(Node : LAL.Ada_Node'Class;
Graph : Graph_Operations.Graph_Context)
is
begin
if Utilities.Is_Relevant_Basic_Decl(Node) then
declare
Basic_Decl : constant LAL.Basic_Decl := Node.As_Basic_Decl;
begin
for Defining_Name of Basic_Decl.P_Defining_Names loop
Graph.Write_Node(Defining_Name, Basic_Decl);
end loop;
end;
end if;
end Extract_Nodes;
procedure Extract_Edges
(Node : LAL.Ada_Node'Class;
Graph : Graph_Operations.Graph_Context)
is
begin
if Utilities.Is_Relevant_Basic_Decl(Node)
and then not Is_Standard_Package_Decl(Node)
then
declare
Basic_Decl : constant LAL.Basic_Decl := Node.As_Basic_Decl;
Parent : constant LAL.Basic_Decl := Utilities.Get_Parent_Basic_Decl(Basic_Decl);
begin
for Defining_Name of Basic_Decl.P_Defining_Names loop
Graph.Write_Edge(Defining_Name, Basic_Decl, Basic_Decl.Unit, Node_Edge_Types.Edge_Type_Source);
if not Basic_Decl.P_Is_Compilation_Unit_Root
or else Basic_Decl.Parent.Kind = LALCO.Ada_Subunit
then
Graph.Write_Edge(Parent, Defining_Name, Basic_Decl, Node_Edge_Types.Edge_Type_Contains);
elsif Parent.P_Body_Part_For_Decl /= Basic_Decl
and then not Is_Standard_Package_Decl(Parent)
then
Graph.Write_Edge(Parent, Defining_Name, Basic_Decl, Node_Edge_Types.Edge_Type_Is_Parent_Of);
end if;
end loop;
end;
end if;
end Extract_Edges;
end Extraction.Decls;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- Created On : Thu Jun 14 12:09:31 2012
-- Licence : See LICENCE in the root directory.
-------------------------------------------------------------------------------
package body VGA_Console is
procedure Put
(Char : Character;
X : Screen_Width_Range;
Y : Screen_Height_Range;
Foreground : Foreground_Colour := White;
Background : Background_Colour := Black) is
begin
Video_Memory (Y)(X).Char := Char;
Video_Memory (Y)(X).Colour.Foreground := Foreground;
Video_Memory (Y)(X).Colour.Background := Background;
end Put;
procedure Put
(Str : String;
X : Screen_Width_Range;
Y : Screen_Height_Range;
Foreground : Foreground_Colour := White;
Background : Background_Colour := Black) is
begin
for Index in Str'First .. Str'Last loop
Put (Str (Index),
X + Screen_Width_Range (Index) - 1,
Y,
Foreground,
Background);
end loop;
end Put;
-- procedure Put
-- (Data : in Natural;
-- X : in Screen_Width_Range;
-- Y : in Screen_Height_Range;
-- Foreground : in Foreground_Colour := White;
-- Background : in Background_Colour := Black) is
-- type Numbers_Type is array (0 .. 9) of Character;
-- Numbers : constant Numbers_Type :=
-- ('0', '1', '2', '3', '4', '5', '6', '7', '8', '9');
-- Str : String (1 .. 20);
-- Value : Natural := Data;
-- Length : Natural := 1;
-- Mask : Natural := 16#0000_000F#;
-- procedure PutStringBackwards
-- (Str : in String;
-- Length : in Natural;
-- X : in Screen_Width_Range;
-- Y : in Screen_Height_Range;
-- Foreground : in Foreground_Colour := White;
-- Background : in Background_Colour := Black);
-- procedure PutStringBackwards
-- (Str : in String;
-- Length : in Natural;
-- X : in Screen_Width_Range;
-- Y : in Screen_Height_Range;
-- Foreground : in Foreground_Colour := White;
-- Background : in Background_Colour := Black) is
-- begin
-- for Index in reverse Integer (Str'First) .. Integer (Length) loop
-- Put (Str (Index),
-- X + Screen_Width_Range (Index) - 1,
-- Y,
-- Foreground,
-- Background);
-- end loop;
-- end PutStringBackwards;
-- begin
-- -- Find how many digits we need for this value.
-- while Value /= 0 loop
-- Str (Integer (Length)) := Numbers (Integer (Value and Mask));
-- Value := Value / 10;
-- Length := Length + 1;
-- end loop;
-- PutStringBackwards (Str, Length, X, Y, Foreground, Background);
-- end Put;
procedure Clear (Background : Background_Colour := Black) is
begin
for X in Screen_Width_Range'First .. Screen_Width_Range'Last loop
for Y in Screen_Height_Range'First .. Screen_Height_Range'Last loop
Put (' ', X, Y, Background => Background);
end loop;
end loop;
end Clear;
end VGA_Console;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- Natools.Getopt_Long is a native Ada implementation of getopt_long() --
-- processor for command line arguments. --
-- --
-- This package is generic, and its only formal parameter is a descrete --
-- type supposed to cover all command-line options. --
-- --
-- Configuration objects hold the list of recognized options and parameters --
-- about how to process them. Options can have a single-character short --
-- name or a multiple-character long name. Moreover, there is no limit to --
-- the number of flag names referring to the same Option_Id value. --
-- --
-- Once the Configuration object has been filled with flags recognized --
-- by the client, the actual command-line arguments can be processed, --
-- using the handler callbacks from a Handlers.Callback'Class object. --
-- --
-- Callback subprograms for normal operation are Option, for command-line --
-- flags identified by their Option_Id, and Argument, for top-level command --
-- line arguments. There are also callbacks for error conditions (missing --
-- or unexpected argument, unknown option), whose implementation in --
-- Handlers.Callback are simply to raise Option_Error with an appropriate --
-- message. --
------------------------------------------------------------------------------
with Ada.Command_Line;
private with Ada.Containers.Indefinite_Ordered_Maps;
generic
type Option_Id is (<>);
package Natools.Getopt_Long is
pragma Preelaborate (Getopt_Long);
Null_Long_Name : constant String := "";
Null_Short_Name : constant Character := Character'Val (0);
------------------------------------------
-- Holder for both short and long names --
------------------------------------------
type Name_Style is (Long, Short);
type Any_Name (Style : Name_Style; Size : Positive) is record
case Style is
when Short =>
Short : Character;
when Long =>
Long : String (1 .. Size);
end case;
end record;
function To_Name (Long_Name : String) return Any_Name;
function To_Name (Short_Name : Character) return Any_Name;
function Image (Name : Any_Name) return String;
------------------------
-- Callback interface --
------------------------
Option_Error : exception;
package Handlers is
type Callback is abstract tagged null record;
procedure Option
(Handler : in out Callback;
Id : Option_Id;
Argument : String)
is abstract;
-- Callback for successfully-parsed options.
procedure Argument
(Handler : in out Callback;
Argument : String)
is abstract;
-- Callback for non-flag arguments.
procedure Missing_Argument
(Handler : in out Callback;
Id : Option_Id;
Name : Any_Name);
-- Raise Option_Error (default error handler).
procedure Unexpected_Argument
(Handler : in out Callback;
Id : Option_Id;
Name : Any_Name;
Argument : String);
-- Raise Option_Error (default error handler).
procedure Unknown_Option
(Handler : in out Callback;
Name : Any_Name);
-- Raise Option_Error (default error handler).
end Handlers;
----------------------------
-- Configuration database --
----------------------------
type Argument_Requirement is
(No_Argument, Required_Argument, Optional_Argument);
type Configuration is tagged private;
-- Simple parameters --
function Posixly_Correct (Config : Configuration) return Boolean;
procedure Posixly_Correct
(Config : in out Configuration;
To : Boolean := True);
function Long_Only (Config : Configuration) return Boolean;
procedure Use_Long_Only
(Config : in out Configuration;
Value : Boolean := True);
-- Option list management --
procedure Add_Option
(Config : in out Configuration;
Long_Name : String;
Short_Name : Character;
Has_Arg : Argument_Requirement;
Id : Option_Id);
-- Add an option with both a short and a long name to the database.
procedure Add_Option
(Config : in out Configuration;
Long_Name : String;
Has_Arg : Argument_Requirement;
Id : Option_Id);
-- Add an option with only a long name to the database.
procedure Add_Option
(Config : in out Configuration;
Short_Name : Character;
Has_Arg : Argument_Requirement;
Id : Option_Id);
-- Add an option with only a short name to the database.
procedure Del_Option
(Config : in out Configuration;
Id : Option_Id);
-- Remove from the database an option identified by its id.
procedure Del_Option
(Config : in out Configuration;
Long_Name : String);
-- Remove from the database an option identified by its long name.
procedure Del_Option
(Config : in out Configuration;
Short_Name : Character);
-- Remove from the database an option identified by its short name.
-- Formatting subprograms --
function Format_Long_Names
(Config : Configuration;
Id : Option_Id;
Separator : String := ", ";
Name_Prefix : String := "--")
return String;
-- Return a human-readable list of long names for the given option.
function Format_Names
(Config : Configuration;
Id : Option_Id;
Separator : String := ", ";
Long_Name_Prefix : String := "--";
Short_Name_Prefix : String := "-";
Short_First : Boolean := True)
return String;
-- Return a human-readable list of all names for the given option.
function Format_Short_Names
(Config : Configuration;
Id : Option_Id;
Separator : String := ", ";
Name_Prefix : String := "-")
return String;
-- Return a human-readable list of short names for the given option.
function Get_Long_Name
(Config : Configuration;
Id : Option_Id;
Index : Positive := 1)
return String;
-- Return the "Index"th long name for the given option id.
-- Raise Constraint_Error when Index is not
-- in range 1 .. Get_Long_Name_Count (Config, Id)
function Get_Long_Name_Count
(Config : Configuration;
Id : Option_Id)
return Natural;
-- Return the number of long names for the given option id.
function Get_Short_Name_Count
(Config : Configuration;
Id : Option_Id)
return Natural;
-- Return the number of short names for the given option id.
function Get_Short_Names
(Config : Configuration;
Id : Option_Id)
return String;
-- Return a string containing the characters for short names for
-- the given option id.
procedure Iterate
(Config : Configuration;
Process : not null access procedure (Id : Option_Id;
Long_Name : String;
Short_Name : Character;
Has_Arg : Argument_Requirement));
-- Iterate over all options, starting with options having a short name,
-- followed by options having only a long name, sorted respectively by
-- short and long name.
-- Process is called for each option; for options lacking a long name,
-- Long_Name is "", and for options lacking a short name, Short_Name
-- is Character'Val (0).
--------------------------------------
-- Command line argument processing --
--------------------------------------
procedure Process
(Config : Configuration;
Handler : in out Handlers.Callback'Class;
Argument_Count : not null access function return Natural
:= Ada.Command_Line.Argument_Count'Access;
Argument : not null access function (Number : Positive) return String
:= Ada.Command_Line.Argument'Access);
-- Process system command line argument list, using the provided option
-- definitions and handler callbacks.
private
type Option (Long_Name_Length : Natural) is record
Id : Option_Id;
Has_Arg : Argument_Requirement;
Long_Name : String (1 .. Long_Name_Length);
Short_Name : Character;
end record;
package Long_Option_Maps is
new Ada.Containers.Indefinite_Ordered_Maps (String, Option);
package Short_Option_Maps is
new Ada.Containers.Indefinite_Ordered_Maps (Character, Option);
type Configuration is tagged record
By_Long_Name : Long_Option_Maps.Map;
By_Short_Name : Short_Option_Maps.Map;
Posixly_Correct : Boolean := True;
Long_Only : Boolean := False;
end record;
end Natools.Getopt_Long;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with Ada.Exceptions; use Ada.Exceptions;
with Ada.Unchecked_Conversion;
with Ada.Unchecked_Deallocation;
with kv.avm.Log; use kv.avm.Log;
with kv.avm.references; use kv.avm.references;
with kv.avm.Actor_References;
with kv.avm.actor_pool;
with kv.avm.Methods;
package body kv.avm.Instances is
use kv.avm.Instructions;
use kv.avm.Registers;
use kv.avm.Frames;
type Constant_Access is access constant kv.avm.Memories.Register_Set_Type;
function Convert is new Ada.Unchecked_Conversion
(Source => Constant_Access,
Target => kv.avm.Memories.Register_Set_Access);
Fake_Name : aliased constant String := "Subroutine";
-----------------------------------------------------------------------------
function "+"(RHS : Instance_Access) return kv.avm.Executables.Executable_Access is
begin
return kv.avm.Executables.Executable_Access(RHS);
end "+";
-----------------------------------------------------------------------------
procedure Initialize
(Self : access Instance_Type;
Actor : in kv.avm.Actors.Actor_Access;
Memory : in kv.avm.Memories.Memory_Type;
Myself : in kv.avm.Actor_References.Actor_Reference_Type) is
use kv.avm.control;
use kv.avm.Memories;
begin
Self.Alive := True;
Self.Actor := Actor;
Self.Memory := Memory;
Self.Myself := Myself;
if not Memory.Get(Attribute).Is_Set then
Self.Attributes.Allocate(64);
else
Self.Attributes := Register_Array_Type(Memory.Get(Attribute)); -- Use the test set
end if;
if not Memory.Get(Fixed).Is_Set then
Self.Constants := Actor.Get_Constants;
else
Self.Constants := Register_Array_Type(Memory.Get(Fixed)); -- Use the test set
end if;
end Initialize;
-----------------------------------------------------------------------------
function Get_Frame(Self : Instance_Type) return kv.avm.Frames.Frame_Access is
begin
return Self.Frame;
end Get_Frame;
-----------------------------------------------------------------------------
procedure Process_Message
(Self : in out Instance_Type;
Message : in kv.avm.Messages.Message_Type) is
Ref : kv.avm.Actor_References.Actor_Reference_Type;
Current_Frame : kv.avm.Frames.Frame_Access;
Memories : kv.avm.Memories.Memory_Type;
Registers : kv.avm.Memories.Register_Array_Type;
function Log_Entry return String is
begin
return Self.Image&".Process_Message "&Message.Get_Name&
", Invoker="&Message.Get_Source.Image&
", Future="&Interfaces.Unsigned_32'IMAGE(Message.Get_Future);
end Log_Entry;
use kv.avm.Registers;
use kv.avm.Memories;
begin
Log_If(Log_Entry'ACCESS);
Current_Frame := Self.Frame;
Self.Frame := new kv.avm.Frames.Frame_Type;
Registers := Register_Array_Type(Self.Memory.Get(Local)); --!@#$ copy test set
Memories.Set(Local, Registers);
Memories.Set(Attribute, Self.Attributes);
Memories.Set(Fixed, Self.Constants);
Registers.Set(Convert(Constant_Access(Message.Get_Data.Unfolded)));
Memories.Set(Input, Registers);
if not Memories.Get(Local).Is_Set then
Registers.Allocate(64);
Memories.Set(Local, Registers);
end if;
Self.Frame.Initialize
(Instance => Self.Myself,
Name => +Message.Get_Name,
Invoker => Message.Get_Reply_To, -- Replies go back to the invoker
Future => Message.Get_Future,
Code => Self.Actor.Get_Method(Message.Get_Name).Get_Code,
Memory => Memories,
Next => Current_Frame);
exception
when Error: others =>
Put_Error("EXCEPTION (in Process_Message): " & Exception_Information(Error));
raise;
end Process_Message;
-----------------------------------------------------------------------------
procedure Process_Gosub
(Self : access Instance_Type;
Tailcall : in Boolean;
Supercall : in Boolean;
Reply_To : in kv.avm.Actor_References.Actor_Reference_Type;
Method : in kv.avm.Registers.String_Type;
Data : access constant kv.avm.Memories.Register_Set_Type;
Future : in Interfaces.Unsigned_32) is
Current_Frame : kv.avm.Frames.Frame_Access;
Memories : kv.avm.Memories.Memory_Type;
Registers : kv.avm.Memories.Register_Array_Type;
Method_Object : kv.avm.Methods.Method_Access;
function Log_Entry return String is
Is_Tail : String := " Tail";
Is_Super : String := " Super";
begin
if not Tailcall then
Is_Tail := " Push";
end if;
if not Supercall then
Is_Super := " Self ";
end if;
return Self.Image & ".Process_Gosub " & (+Method) & Is_Tail & Is_Super;
end Log_Entry;
use kv.avm.Registers;
use kv.avm.Memories;
begin
--Put_Line(Self.Image & ".Process_Gosub " & (+Method));
Log_If(Log_Entry'ACCESS);
Registers := Register_Array_Type(Self.Memory.Get(Local)); --!@#$ copy test set
Memories.Set(Local, Registers);
Memories.Set(Attribute, Self.Attributes);
Memories.Set(Fixed, Self.Constants);
Registers.Set(Convert(Constant_Access(Data)));
Memories.Set(Input, Registers);
if not Memories.Get(Local).Is_Set then
Registers.Allocate(64);
Memories.Set(Local, Registers);
end if;
if Tailcall then
-- Reuse the frame.
Current_Frame := Self.Frame.Get_Next; -- Keep the current parent frame.
else
-- Allocate a new frame.
Current_Frame := Self.Frame;
Self.Frame := new kv.avm.Frames.Frame_Type; --!@#$ leak
end if;
if Supercall then
Method_Object := Self.Actor.Get_Parent.Get_Method(+Method);
else
Method_Object := Self.Actor.Get_Method(+Method);
end if;
Self.Frame.Initialize
(Instance => Self.Myself,
Name => Method,
Invoker => Reply_To, -- Replies go back to the invoker
Future => Future,
Code => Method_Object.Get_Code,
Memory => Memories,
Next => Current_Frame);
exception
when Error: others =>
Put_Error("EXCEPTION (in Process_Gosub): " & Exception_Information(Error));
raise;
end Process_Gosub;
-----------------------------------------------------------------------------
function Can_Accept_Message_Now(Self : Instance_Type; Message : kv.avm.Messages.Message_Type) return Boolean is
Method : kv.avm.Methods.Method_Access;
Predicate : kv.avm.References.Offset_Type;
Register : kv.avm.Registers.Register_Type;
use kv.avm.Methods;
begin
if Self.Frame = null then
Method := Self.Actor.Get_Method(Message.Get_Name); -- Recurs up inheritance chain
if Method = null then
Put_Line("Could not find message " & Message.Get_Name);
return False;
else
if Method.Has_Predicate then
Predicate := Method.Get_Predicate;
Register := Self.Attributes.Read(Predicate);
Put_Line("Machine Predicate check for " & Message.Get_Name & ", accapt: " & Boolean'IMAGE(Register.Bit));
return Register.Bit;
else
return True;
end if;
end if;
end if;
Put_Line("Can't accept message " & Message.Get_Name & " because frame " & Self.Frame.Image & " is running.");
return False;
end Can_Accept_Message_Now;
-----------------------------------------------------------------------------
function Program_Counter
(Self : in Instance_Type) return Interfaces.Unsigned_32 is
begin
if Self.Frame = null then
return 0;
end if;
return Self.Frame.Program_Counter;
end Program_Counter;
-----------------------------------------------------------------------------
function Is_Running
(Self : in Instance_Type) return Boolean is
begin
if not Self.Alive then
return False;
end if;
if Self.Frame = null then
return False;
end if;
--!@#$ what about blocked and deferred?
--!@#$ Machine, which is the only thing that checks this, uses it in both senses. :-(
return True; -- We are not dead or idle so we are running.
end Is_Running;
-----------------------------------------------------------------------------
procedure Free is new Ada.Unchecked_Deallocation(kv.avm.Frames.Frame_Type, kv.avm.Frames.Frame_Access);
-----------------------------------------------------------------------------
procedure Step
(Self : access Instance_Type;
Processor : access kv.avm.Processors.Processor_Type;
Status : out kv.avm.Control.Status_Type) is
Done_Frame : kv.avm.Frames.Frame_Access;
Message : kv.avm.Messages.Message_Type;
begin
--Put_Line("kv.avm.instance.Step "&Self.Image);
Processor.Step(Self.Frame, Status);
if Self.Frame.Is_Done then
--Put_Line("Frame " & Self.Image & "@" & Self.Frame.Image & " has completed processing, removing it from the stack.");
Put_Line("Frame " & Self.Frame.Image & " has completed processing, removing it from the stack.");
-- This frame is done and needs to be deleted.
Done_Frame := Self.Frame;
Self.Frame := Self.Frame.Get_Next;
-- Free the frame
Done_Frame.Prepare_For_Deletion;
Free(Done_Frame);
if Self.Frame /= null then
--Put_Line("Frame " & Self.Image & "@" & Self.Frame.Image & " has resumed.");
Put_Line("Frame " & Self.Frame.Image & " has resumed.");
end if;
--TODO: figure out why this breaks the unit tests
--if Self.Frame = null then
-- Status := kv.avm.Control.Idle;
--end if;
end if;
exception
when Error: others =>
Put_Error("EXCEPTION (in Step): " & Exception_Information(Error));
raise;
end Step;
-----------------------------------------------------------------------------
procedure Process_Internal_Response
(Self : in out Instance_Type;
Answer : in kv.avm.Tuples.Tuple_Type) is
Done_Frame : kv.avm.Frames.Frame_Access;
begin
--Put_Line("kv.avm.instance.Process_Response");
Done_Frame := Self.Frame;
Self.Frame := Self.Frame.Get_Next;
Free(Done_Frame);
-- Call it's Process_Response to fill in the answer
Self.Frame.Process_Gosub_Response(Answer);
exception
when Error: others =>
Put_Error("EXCEPTION (in Process_Internal_Response): " & Exception_Information(Error));
raise;
end Process_Internal_Response;
-----------------------------------------------------------------------------
procedure Resolve_Future
(Self : in out Instance_Type;
Answer : in kv.avm.Tuples.Tuple_Type;
Future : in Interfaces.Unsigned_32) is
Index : kv.avm.References.Offset_Type;
Found : Boolean;
begin
--!@#$ this future could be in any local register in any frame or in an instance register
Self.Attributes.Find_Future(Future, Found, Index);
if Found then
Self.Attributes.Write(Index, (Format => kv.avm.Registers.Tuple, folded_tuple => Answer));
if Self.Frame /= null then
Self.Frame.Set_Blocked(False);
end if;
return;
end if;
Put_Line("Future "&Interfaces.Unsigned_32'IMAGE(Future)&" not in an attribute, searching frames.");
if Self.Frame = null then
raise kv.avm.Executables.Corrupt_Executable_Error;
else
Self.Frame.Resolve_Future(Answer, Future);
end if;
exception
when Error: others =>
Put_Error("EXCEPTION (in Resolve_Future): " & Exception_Information(Error));
raise;
end Resolve_Future;
-----------------------------------------------------------------------------
function Alive(Self : Instance_Type) return Boolean is
begin
return Self.Alive;
end Alive;
-----------------------------------------------------------------------------
procedure Halt_Actor
(Self : in out Instance_Type) is
begin
Self.Alive := False;
end Halt_Actor;
-----------------------------------------------------------------------------
function Reachable(Self : Instance_Type) return kv.avm.Actor_References.Sets.Set is
Can_Reach : kv.avm.Actor_References.Sets.Set := kv.avm.Actor_References.Sets.Empty_Set;
begin
Can_Reach.Include(Self.Myself);
Can_Reach.Union(Self.Attributes.Reachable);
Can_Reach.Union(Self.Constants.Reachable);
if Self.Frame /= null then
Can_Reach.Union(Self.Frame.Reachable);
end if;
return Can_Reach;
end Reachable;
-----------------------------------------------------------------------------
function Image(Self : Instance_Type) return String is
begin
return Self.Actor.Image & Self.Myself.Image;
end Image;
-----------------------------------------------------------------------------
function Debug_Info(Self : Instance_Type) return String is
begin
if Self.Frame = null then
return Self.Actor.Image & Self.Myself.Image & " (no frame)";
else
return Self.Actor.Image & Self.Myself.Image & ", Frame:" & Self.Frame.Debug_Info;
end if;
end Debug_Info;
-----------------------------------------------------------------------------
procedure New_Executable
(Self : in out Instance_Factory;
Actor : in kv.avm.Actors.Actor_Access;
Machine : in kv.avm.Control.Control_Access;
Executable : out kv.avm.Executables.Executable_Access;
Reference : out kv.avm.Actor_References.Actor_Reference_Type) is
use kv.avm.Control;
Empty : kv.avm.Memories.Memory_Type;
Instance : Instance_Access;
begin
if Machine = null then
Put_Error("WARNING: kv.avm.Instances.New_Executable called with Machine = null!");
end if;
Instance := new Instance_Type;
kv.avm.Actor_Pool.Add(+Instance, Reference);
Instance.Initialize(Actor, Empty, Reference);
Executable := kv.avm.Executables.Executable_Access(Instance);
exception
when Error: others =>
Put_Error("EXCEPTION (in New_Executable): " & Exception_Information(Error));
raise;
end New_Executable;
end kv.avm.Instances;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-----------------------------------------------------------------------
with Ada.Strings.Unbounded;
with Util.Test_Caller;
with Gen.Configs;
with Gen.Generator;
package body Gen.Artifacts.XMI.Tests is
use Ada.Strings.Unbounded;
package Caller is new Util.Test_Caller (Test, "Gen.XMI");
procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite) is
begin
Caller.Add_Test (Suite, "Test Gen.XMI.Read_UML_Configuration",
Test_Read_XMI'Access);
Caller.Add_Test (Suite, "Test Gen.XMI.Find_Element",
Test_Find_Element'Access);
Caller.Add_Test (Suite, "Test Gen.XMI.Find_Element",
Test_Find_Tag_Definition'Access);
end Add_Tests;
-- ------------------------------
-- Test reading the XMI files defines in the Dynamo UML configuration repository.
-- ------------------------------
procedure Test_Read_XMI (T : in out Test) is
procedure Check (Namespace : in String;
Name : in String;
Id : in String);
A : Artifact;
G : Gen.Generator.Handler;
C : constant String := Util.Tests.Get_Parameter ("config_dir", "config");
use type Gen.Model.XMI.Model_Element_Access;
procedure Check (Namespace : in String;
Name : in String;
Id : in String) is
Empty : Gen.Model.XMI.Model_Map.Map;
XMI_Id : constant Unbounded_String := To_Unbounded_String (Namespace & "#" & Id);
N : constant Gen.Model.XMI.Model_Element_Access := Gen.Model.XMI.Find (A.Nodes,
Empty,
XMI_Id);
begin
T.Assert (N /= null, "Cannot find UML element " & To_String (XMI_Id));
Util.Tests.Assert_Equals (T, Name, To_String (N.Name), "Invalid element name");
end Check;
begin
Gen.Generator.Initialize (G, Ada.Strings.Unbounded.To_Unbounded_String (C), False);
A.Read_Model (G.Get_Parameter (Gen.Configs.GEN_UML_DIR) & "/Dynamo.xmi", G);
-- ArgoUML Integer DataType
Check ("default-uml14.xmi", "Integer",
"-84-17--56-5-43645a83:11466542d86:-8000:000000000000087C");
-- ArgoUML String DataType
Check ("default-uml14.xmi", "String",
"-84-17--56-5-43645a83:11466542d86:-8000:000000000000087E");
-- ArgoUML documentation TagDefinition
Check ("default-uml14.xmi", "documentation",
".:000000000000087C");
-- ArgoUML type Stereotype
Check ("default-uml14.xmi", "type",
".:0000000000000842");
-- Persistence Table Stereotype
Check ("Dynamo.xmi", "Table",
"127-0-1-1--44304ba0:139c0f2a59c:-8000:0000000000001D4F");
Check ("Dynamo.xmi", "PK",
"127-0-1-1--44304ba0:139c0f2a59c:-8000:0000000000001D50");
Check ("Dynamo.xmi", "FK",
"127-0-1-1--44304ba0:139c0f2a59c:-8000:0000000000001F70");
Check ("Dynamo.xmi", "Bean",
"127-0-1-1--44304ba0:139c0f2a59c:-8000:0000000000001F72");
end Test_Read_XMI;
-- ------------------------------
-- Test searching an XMI element by using a qualified name.
-- ------------------------------
procedure Test_Find_Element (T : in out Test) is
A : Artifact;
G : Gen.Generator.Handler;
C : constant String := Util.Tests.Get_Parameter ("config_dir", "config");
use Gen.Model.XMI;
function Find_Stereotype is
new Gen.Model.XMI.Find_Element (Element_Type => Stereotype_Element,
Element_Type_Access => Stereotype_Element_Access);
begin
Gen.Generator.Initialize (G, Ada.Strings.Unbounded.To_Unbounded_String (C), False);
A.Read_Model (G.Get_Parameter (Gen.Configs.GEN_UML_DIR) & "/Dynamo.xmi", G);
declare
S : Gen.Model.XMI.Stereotype_Element_Access;
begin
S := Find_Stereotype (A.Nodes, "Dynamo.xmi", "ADO.Table", Gen.Model.XMI.BY_NAME);
T.Assert (S /= null, "Stereotype not found");
S := Find_Stereotype (A.Nodes, "Dynamo.xmi", "ADO.PK", Gen.Model.XMI.BY_NAME);
T.Assert (S /= null, "Stereotype not found");
S := Find_Stereotype (A.Nodes, "Dynamo.xmi", "ADO.FK", Gen.Model.XMI.BY_NAME);
T.Assert (S /= null, "Stereotype not found");
S := Find_Stereotype (A.Nodes, "Dynamo.xmi", "ADO.DataModel", Gen.Model.XMI.BY_NAME);
T.Assert (S /= null, "Stereotype not found");
S := Find_Stereotype (A.Nodes, "Dynamo.xmi", "AWA.Bean", Gen.Model.XMI.BY_NAME);
T.Assert (S /= null, "Stereotype not found");
end;
end Test_Find_Element;
-- Test searching an XMI Tag definition element by using its name.
procedure Test_Find_Tag_Definition (T : in out Test) is
A : Artifact;
G : Gen.Generator.Handler;
C : constant String := Util.Tests.Get_Parameter ("config_dir", "config");
use Gen.Model.XMI;
function Find_Tag_Definition is
new Gen.Model.XMI.Find_Element (Element_Type => Tag_Definition_Element,
Element_Type_Access => Tag_Definition_Element_Access);
begin
Gen.Generator.Initialize (G, Ada.Strings.Unbounded.To_Unbounded_String (C), False);
A.Read_Model (G.Get_Parameter (Gen.Configs.GEN_UML_DIR) & "/Dynamo.xmi", G);
declare
Tag : Tag_Definition_Element_Access;
begin
Tag := Find_Tag_Definition (A.Nodes, "Dynamo.xmi", "[email protected]",
Gen.Model.XMI.BY_NAME);
T.Assert (Tag /= null, "Tag definition not found");
end;
end Test_Find_Tag_Definition;
end Gen.Artifacts.XMI.Tests;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
package body StbiWrapper is
function load(filename: C.Strings.chars_ptr; x: IntPtr.Pointer; y: IntPtr.Pointer; channels_in_file: IntPtr.Pointer; desired_channels: C.int) return UCharPtr.Pointer
with
import => True,
Convention => C,
External_Name => "stbi_load";
procedure free(ptr: UCharPtr.Pointer)
with
Import => True,
Convention => C,
External_Name => "stbi_image_free";
function load(filename: C.Strings.chars_ptr; desired_channels: C.int := 3) return ImageData
is
result: ImageData;
x, y, channels: aliased C.int;
begin
result.pixels := load(filename, x'Unchecked_Access, y'Unchecked_Access, channels'Unchecked_Access, desired_channels);
result.width := x;
result.height := y;
result.nChannels := channels;
return result;
end load;
procedure free(data: ImageData) is
begin
free(data.pixels);
end free;
function check(data: ImageData) return Boolean
is
begin
return data.width > 0 and data.height > 0 and data.nChannels in 1 .. 4;
end check;
end StbiWrapper;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-----------------------------------------------------------------------
with Ada.Text_IO;
with Ada.Command_Line;
with Util.Serialize.IO.CSV;
with Util.Serialize.Mappers;
-- This example shows how to read a CSV file. Unlike <b>csv_city</b>, the CSV cells
-- are collected directly by overriding the <b>Set_Cell</b> parser procedure.
procedure CSV_Reader is
use Ada.Text_IO;
use Util.Serialize.IO.CSV;
Prev_Row : Row_Type;
type CSV_Parser is new Util.Serialize.IO.CSV.Parser with null record;
overriding
procedure Set_Cell (Parser : in out CSV_Parser;
Value : in String;
Row : in Util.Serialize.IO.CSV.Row_Type;
Column : in Util.Serialize.IO.CSV.Column_Type);
overriding
procedure Set_Cell (Parser : in out CSV_Parser;
Value : in String;
Row : in Util.Serialize.IO.CSV.Row_Type;
Column : in Util.Serialize.IO.CSV.Column_Type) is
pragma Unreferenced (Parser, Column);
begin
if Prev_Row /= Row then
Ada.Text_IO.New_Line;
Prev_Row := Row;
else
Put (" ");
end if;
Ada.Text_IO.Put (Value);
end Set_Cell;
Parser : CSV_Parser;
Count : constant Natural := Ada.Command_Line.Argument_Count;
begin
if Count = 0 then
Ada.Text_IO.Put_Line ("Usage: csv_reader file...");
return;
end if;
for I in 1 .. Count loop
declare
File : constant String := Ada.Command_Line.Argument (I);
Mapper : Util.Serialize.Mappers.Processing;
begin
Prev_Row := Row_Type'Last;
Parser.Parse (File, Mapper);
end;
end loop;
end CSV_Reader;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
package body Orka.SIMD.SSE.Singles.Swizzle is
Mask_1_0_1_0 : constant Unsigned_32 := 1 * 64 or 0 * 16 or 1 * 4 or 0;
Mask_3_2_3_2 : constant Unsigned_32 := 3 * 64 or 2 * 16 or 3 * 4 or 2;
Mask_2_0_2_0 : constant Unsigned_32 := 2 * 64 or 0 * 16 or 2 * 4 or 0;
Mask_3_1_3_1 : constant Unsigned_32 := 3 * 64 or 1 * 16 or 3 * 4 or 1;
procedure Transpose (Matrix : in out m128_Array) is
M0 : constant m128 := Unpack_Low (Matrix (X), Matrix (Y));
M1 : constant m128 := Unpack_Low (Matrix (Z), Matrix (W));
M2 : constant m128 := Unpack_High (Matrix (X), Matrix (Y));
M3 : constant m128 := Unpack_High (Matrix (Z), Matrix (W));
begin
Matrix (X) := Move_LH (M0, M1);
Matrix (Y) := Move_HL (M1, M0);
Matrix (Z) := Move_LH (M2, M3);
Matrix (W) := Move_HL (M3, M2);
end Transpose;
function Transpose (Matrix : m128_Array) return m128_Array is
Result : m128_Array;
M0 : constant m128 := Shuffle (Matrix (X), Matrix (Y), Mask_1_0_1_0);
M1 : constant m128 := Shuffle (Matrix (Z), Matrix (W), Mask_1_0_1_0);
M2 : constant m128 := Shuffle (Matrix (X), Matrix (Y), Mask_3_2_3_2);
M3 : constant m128 := Shuffle (Matrix (Z), Matrix (W), Mask_3_2_3_2);
begin
Result (X) := Shuffle (M0, M1, Mask_2_0_2_0);
Result (Y) := Shuffle (M0, M1, Mask_3_1_3_1);
Result (Z) := Shuffle (M2, M3, Mask_2_0_2_0);
Result (W) := Shuffle (M2, M3, Mask_3_1_3_1);
return Result;
end Transpose;
end Orka.SIMD.SSE.Singles.Swizzle;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with SPARKNaCl; use SPARKNaCl;
with SPARKNaCl.Debug; use SPARKNaCl.Debug;
with SPARKNaCl.Scalar; use SPARKNaCl.Scalar;
procedure Scalarmult6
is
BobSK : constant Bytes_32 :=
(16#5d#, 16#ab#, 16#08#, 16#7e#, 16#62#, 16#4a#, 16#8a#, 16#4b#,
16#79#, 16#e1#, 16#7f#, 16#8b#, 16#83#, 16#80#, 16#0e#, 16#e6#,
16#6f#, 16#3b#, 16#b1#, 16#29#, 16#26#, 16#18#, 16#b6#, 16#fd#,
16#1c#, 16#2f#, 16#8b#, 16#27#, 16#ff#, 16#88#, 16#e0#, 16#eb#);
AlicePK : constant Bytes_32 :=
(16#85#, 16#20#, 16#f0#, 16#09#, 16#89#, 16#30#, 16#a7#, 16#54#,
16#74#, 16#8b#, 16#7d#, 16#dc#, 16#b4#, 16#3e#, 16#f7#, 16#5a#,
16#0d#, 16#bf#, 16#3a#, 16#0d#, 16#26#, 16#38#, 16#1a#, 16#f4#,
16#eb#, 16#a4#, 16#a9#, 16#8e#, 16#aa#, 16#9b#, 16#4e#, 16#6a#);
K : Bytes_32;
begin
K := Mult (BobSK, AlicePK);
DH ("K is", K);
end Scalarmult6;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
--------------------------------------------------------------------------------
-- --
-- C S V _ L O G S --
-- --
-- Spec --
-- --
-- This package provides simple logging support for an arbitrary number of --
-- Float data values. Data may be logged to the standard output, for visual --
-- inspection, or to a specified output file in CSV format, to facilitate --
-- further analysis of the logged data on a spreadsheet. --
-- --
-- Logging is unprotected, use at most from one task. --
-- --
-- Author: <NAME> --
-- February, 2021 --
-- --
--------------------------------------------------------------------------------
package CSV_Logs is
--
-- A Log session is an interval of time during which data of a particular
-- experiment may be written to a given file or to the standard output.
-- The logged data type is an unconstrained array of Floats. In addition,
-- arbitrary text lines can also be logged to the output CSV file, such
-- as column headings.
-- A log session must be opened with Open_Log_Session and it remains open
-- until closed with Close_Log_Session.
--
-- For example, the code:
--
-- Open_Log_Session (File_Name => "kk.csv");
-- Log_Text ("Data_1, Data_2, Data_3");
-- Log_Data (( 0.0, 0.0, 0.0));
-- Log_Data ((-1.0, -1.0, -1.0));
-- Log_Data (( 2.0, 2.0, 2.0));
-- Close_Log_Session;
--
-- produces the file "data.csv" with the following contents:
--
-- Data_1, Data_2, Data_3
-- 0.00000, 0.00000, 0.00000
-- -1.00000, -1.00000, -1.00000
-- 2.00000, 2.00000, 2.00000
--
procedure Open_Log_Session (File_Name : String := "");
-- Start a log session. Set File_Name as the output file for the Log.
-- If File_Name = "", the output file is Standard_Output.
procedure Close_Log_Session;
-- Close the log session. A new log session can be opened afterwards
type Float_Array is array (Positive range <>) of Float;
-- Data that can be logged
procedure Log_Data (Data_Set : Float_Array);
-- Log the values in Data_Set, separated with commas, to the output file
-- set for the current session. No action if there is no log session open.
procedure Log_Text (Text_Line : String);
-- Log the given Text_Line (verbatim) to the output file set for the curent
-- session, if one is open. No action if there is no log session open.
end CSV_Logs;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-----------------------------------------------------------------------
with Ada.Strings.Unbounded;
with Ada.Calendar;
with Util.Properties;
with Util.Http.Clients;
package Bbox.API is
type Client_Type is tagged limited private;
-- Set the server IP address.
procedure Set_Server (Client : in out Client_Type;
Server : in String);
-- Login to the server Bbox API with the password.
procedure Login (Client : in out Client_Type;
Password : in String);
-- Execute a GET operation on the Bbox API to retrieve the result into the property list.
procedure Get (Client : in out Client_Type;
Operation : in String;
Result : in out Util.Properties.Manager);
-- Execute a PUT operation on the Bbox API to change some parameter.
procedure Put (Client : in out Client_Type;
Operation : in String;
Params : in String);
-- Execute a POST operation on the Bbox API to change some parameter.
procedure Post (Client : in out Client_Type;
Operation : in String;
Params : in String);
-- Execute a GET operation on the Bbox API to retrieve the JSON result and return it.
function Get (Client : in out Client_Type;
Operation : in String) return String;
-- Iterate over a JSON array flattened in the properties.
procedure Iterate (Props : in Util.Properties.Manager;
Name : in String;
Process : access procedure (P : in Util.Properties.Manager;
Base : in String));
private
-- Internal operation to get the URI based on the operation being called.
function Get_URI (Client : in Client_Type;
Operation : in String) return String;
type Client_Type is tagged limited record
Password : Ada.Strings.Unbounded.Unbounded_String;
Server : Ada.Strings.Unbounded.Unbounded_String;
Auth : Ada.Strings.Unbounded.Unbounded_String;
Is_Logged : Boolean := False;
Http : Util.Http.Clients.Client;
Token : Ada.Strings.Unbounded.Unbounded_String;
Expires : Ada.Calendar.Time;
end record;
procedure Refresh_Token (Client : in out Client_Type);
end Bbox.API;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- { dg-do compile }
with Interfaces; use Interfaces;
package Alignment2 is
pragma Warnings (Off, "*size*");
-- warning
type R1 is record
A, B, C, D : Integer_8;
end record;
for R1'Size use 32;
for R1'Alignment use 32; -- { dg-warning "suspiciously large alignment" }
-- warning
type R2 is record
A, B, C, D : Integer_8;
end record;
for R2'Alignment use 32; -- { dg-warning "suspiciously large alignment" }
-- OK, big size
type R3 is record
A, B, C, D : Integer_8;
end record;
for R3'Size use 32 * 8;
for R3'Alignment use 32;
-- OK, big size
type R4 is record
A, B, C, D, E, F, G, H : Integer_32;
end record;
for R4'Alignment use 32;
-- warning
type I1 is new Integer_32;
for I1'Size use 32;
for I1'Alignment use 32; -- { dg-warning "suspiciously large alignment" }
-- warning
type I2 is new Integer_32;
for I2'Alignment use 32; -- { dg-warning "suspiciously large alignment" }
-- OK, big size
type I3 is new Integer_32;
for I3'Size use 32 * 8; -- { dg-warning "unused" }
for I3'Alignment use 32;
end Alignment2;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- SOFTWARE.
--------------------------------------------------------------------------------
with Interfaces.C;
with Ada.Numerics;
with Ada.Unchecked_Conversion;
with Ada.Numerics.Generic_Elementary_Functions;
--------------------------------------------------------------------------------
--< @group Vulkan Math Basic Types
--------------------------------------------------------------------------------
package Vulkan.Math is
pragma Preelaborate;
pragma Pure;
----------------------------------------------------------------------------
-- Math Constants
----------------------------------------------------------------------------
--< A constant value representing PI.
PI : constant := Ada.Numerics.Pi;
--< A constant value representing Euler's number e.
E : constant := Ada.Numerics.e;
--< The constant natural logarithm of 2 value. This constant is used in the
--< implementation of Exp2().
LN2 : constant := 0.69314_71805_59945_30941_72321_21458_18;
----------------------------------------------------------------------------
-- Math Scalar Types
----------------------------------------------------------------------------
--< A value that can either be true or false. This type has the same size
--< as a boolean value in C.
type Vkm_Bool is new Boolean;
for Vkm_Bool use (False => 0,
True => 1);
for Vkm_Bool'Size use Interfaces.C.unsigned_char'Size;
--< A 32-bit unsigned integer type.
type Vkm_Uint is new Interfaces.C.unsigned;
--< A 32-bit 2's complement signed integer type.
type Vkm_Int is new Interfaces.C.int;
--< A 32-bit single precision signed floating point number.
type Vkm_Float is new Interfaces.C.C_Float;
--< A 64-bit double precision signed floating point number.
type Vkm_Double is new Interfaces.C.double;
--< The maximum dmmension for a vector or a row or column of a matrix.
type Vkm_Length is new Integer range 1 .. 4;
--< The set of indices allowed for use with any vector or matrix.
type Vkm_Indices is new Integer range 0 .. 3;
--< @private
--< Instantiation of Generic Elementary Functions for Float.
package VKM_FLT_NEF is new
Ada.Numerics.Generic_Elementary_Functions(Float_Type => Vkm_Float);
--< @private
--< Instantiation of Generic Elemantry Functions for Double.
package VKM_DBL_NEF is new
Ada.Numerics.Generic_Elementary_Functions(Float_Type => Vkm_Double);
----------------------------------------------------------------------------
-- Conversion Functions
----------------------------------------------------------------------------
--< @summary
--< Convert to Vkm_Indices.
--<
--< @description
--< Convert a value of type Vkm_Length to a value of type Vkm_Indices.
--<
--< @param length The length value to convert to indices.
--<
--< @return The length converted to an index.
----------------------------------------------------------------------------
function To_Vkm_Indices (length : in Vkm_Length) return Vkm_Indices is
(Vkm_Indices(Vkm_Length'Base(length) - 1)) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Convert to Vkm_Length.
--<
--< @description
--< Convert a value of type Vkm_Indices to a value of type Vkm_Length.
--<
--< @param last_index
--< The index value to convert to a vector length.
--<
--< @return
--< The result of the conversion.
----------------------------------------------------------------------------
function To_Vkm_Length (last_index : in Vkm_Indices) return Vkm_Length is
(Vkm_Length(Vkm_Indices'Base(last_index) + 1)) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Convert to Vkm_Bool.
--<
--< @description
--< Convert a vulkan math type to the Vkm_Bool type.
--
--< If the value is not equal to zero, returns true; Otherwise returns false.
--
--< @param value The value to convert to Vkm_Bool.
--
--< @return The conversion to Vkm_Bool.
----------------------------------------------------------------------------
function To_Vkm_Bool (value : in Vkm_Uint ) return Vkm_Bool is
(Vkm_Bool(value /= 0)) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Convert to Vkm_Bool.
--<
--< @description
--< Convert a vulkan math type to the Vkm_Bool type.
--
--< If the value is not equal to zero, returns true; Otherwise returns false.
--
--< @param value The value to convert to Vkm_Bool.
--
--< @return The conversion to Vkm_Bool.
----------------------------------------------------------------------------
function To_Vkm_Bool (value : in Vkm_Int ) return Vkm_Bool is
(Vkm_Bool(value /= 0)) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Convert to Vkm_Bool.
--<
--< @description
--< Convert a vulkan math type to the Vkm_Bool type.
--
--< If the value is not equal to zero, returns true; Otherwise returns false.
--
--< @param value The value to convert to Vkm_Bool.
--
--< @return The conversion to Vkm_Bool.
----------------------------------------------------------------------------
function To_Vkm_Bool (value : in Vkm_Float ) return Vkm_Bool is
(Vkm_Bool(value /= 0.0)) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Convert to Vkm_Bool.
--<
--< @description
--< Convert a vulkan math type to the Vkm_Bool type.
--
--< If the value is not equal to zero, returns true; Otherwise returns false.
--
--< @param value The value to convert to Vkm_Bool.
--
--< @return The conversion to Vkm_Bool.
----------------------------------------------------------------------------
function To_Vkm_Bool (value : in Vkm_Double) return Vkm_Bool is
(Vkm_Bool(value /= 0.0)) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Convert to Vkm_Uint.
--<
--< @description
--< Convert a vulkan math type to the Vkm_Uint type.
--
--< If value is true returns 1; Otherwise returns 0.
--
--< @param value The value to convert
--
--< @return The conversion to Vkm_Uint.
----------------------------------------------------------------------------
function To_Vkm_Uint (value : in Vkm_Bool ) return Vkm_Uint is
(if value then 1 else 0) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Convert to Vkm_Uint.
--<
--< @description
--< Convert a vulkan math type to the Vkm_Uint type.
--
--< Conversion from Vkm_Int preserves the bit pattern of the argument, modifying
--< the value of negative arguments.
--
--< @return The conversion to Vkm_Uint.
----------------------------------------------------------------------------
function To_Vkm_Uint is new Ada.Unchecked_Conversion(Source => Vkm_Int, Target => Vkm_Uint);
----------------------------------------------------------------------------
--< @summary
--< Convert to Vkm_Uint.
--<
--< @description
--< Convert a vulkan math type to the Vkm_Uint type.
--
--< @param value The value to convert to Vkm_Uint.
--
--< @return The conversion to Vkm_Uint.
----------------------------------------------------------------------------
function To_Vkm_Uint (value : in Vkm_Float ) return Vkm_Uint is
(Vkm_Uint(Vkm_Float'Base(value))) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Convert to Vkm_Uint.
--<
--< @description
--< Convert a vulkan math type to the Vkm_Uint type.
--
--< @param value The value to convert to Vkm_Uint.
--
--< @return The conversion to Vkm_Uint.
----------------------------------------------------------------------------
function To_Vkm_Uint (value : in Vkm_Double) return Vkm_Uint is
(Vkm_Uint(Vkm_Double'Base(value))) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Convert to Vkm_Int.
--<
--< @description
--< Convert various VKM Math types to the Vkm_Int type.
--
--< @param value The value to convert to Vkm_Int.
--
--< @return The conversion to Vkm_Int.
----------------------------------------------------------------------------
function To_Vkm_Int (value : in Vkm_Bool ) return Vkm_Int is
(if value then 1 else 0) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Convert to Vkm_Int.
--<
--< @description
--< The following operations convert various VKM Math types to Vkm_Int
--< math types.
--
--< Conversion from Vkm_Uint preserves the bit pattern of the argument,
--< causing the values of very large unsigned integer to change due to the
--< sign bit being set.
--
--< @return The conversion to Vkm_Int.
----------------------------------------------------------------------------
function To_Vkm_Int is new Ada.Unchecked_Conversion(Source => Vkm_Uint, Target => Vkm_Int);
----------------------------------------------------------------------------
--< @summary
--< Convert to Vkm_Int.
--<
--< @description
--< Convert various VKM Math types to the Vkm_Int type.
--
--< @param value The value to convert to Vkm_Int.
--
--< @return The conversion to Vkm_Int.
----------------------------------------------------------------------------
function To_Vkm_Int (value : in Vkm_Float ) return Vkm_Int is
(Vkm_Int(Vkm_Float'Base(value))) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Convert to Vkm_Int.
--<
--< @description
--< Convert various VKM Math types to the Vkm_Int type.
--
--< @param value The value to convert to Vkm_Int.
--
--< @return The conversion to Vkm_Int.
----------------------------------------------------------------------------
function To_Vkm_Int (value : in Vkm_Double) return Vkm_Int is
(Vkm_Int(Vkm_Double'Base(value))) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Convert to Vkm_Float.
--<
--< @description
--< The following operations convert various VKM Math types to Vkm_Float
--< math types.
--
--< @param value The value to convert to Vkm_Float.
--
--< @return The conversion to Vkm_Float.
----------------------------------------------------------------------------
function To_Vkm_Float (value : in Vkm_Bool ) return Vkm_Float is
(if value then 1.0 else 0.0) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Convert to Vkm_Float.
--<
--< @description
--< The following operations convert various VKM Math types to Vkm_Float
--< math types.
--
--< @param value The value to convert to Vkm_Float.
--
--< @return The conversion to Vkm_Float.
----------------------------------------------------------------------------
function To_Vkm_Float (value : in Vkm_Uint ) return Vkm_Float is
(Vkm_Float(Vkm_Uint'Base(value))) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Convert to Vkm_Float.
--<
--< @description
--< The following operations convert various VKM Math types to Vkm_Float
--< math types.
--
--< @param value The value to convert to Vkm_Float.
--
--< @return The conversion to Vkm_Float.
----------------------------------------------------------------------------
function To_Vkm_Float (value : in Vkm_Int ) return Vkm_Float is
(Vkm_Float(Vkm_Int'Base(value))) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Convert to Vkm_Float.
--<
--< @description
--< The following operations convert various VKM Math types to Vkm_Float
--< math types.
--
--< @param value The value to convert to Vkm_Float.
--
--< @return The conversion to Vkm_Float.
----------------------------------------------------------------------------
function To_Vkm_Float (value : in Vkm_Double) return Vkm_Float is
(Vkm_Float(Vkm_Double'Base(value))) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Convert to Vkm_Float.
--<
--< @description
--< The following operations convert various VKM Math types to Vkm_Double
--< math types.
--
--< @param value The value to convert to Vkm_Double.
--
--< @return The conversion to Vkm_Double.
----------------------------------------------------------------------------
function To_Vkm_Double (value : in Vkm_Bool ) return Vkm_Double is
(if value then 1.0 else 0.0) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Convert to Vkm_Double.
--<
--< @description
--< The following operations convert various VKM Math types to Vkm_Double
--< math types.
--
--< @param value The value to convert to Vkm_Double.
--
--< @return The conversion to Vkm_Double.
----------------------------------------------------------------------------
function To_Vkm_Double (value : in Vkm_Uint ) return Vkm_Double is
(Vkm_Double(Vkm_Uint'Base(value))) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Convert to Vkm_Double.
--<
--< @description
--< The following operations convert various VKM Math types to Vkm_Double
--< math types.
--
--< @param value The value to convert to Vkm_Double.
--
--< @return The conversion to Vkm_Double.
----------------------------------------------------------------------------
function To_Vkm_Double (value : in Vkm_Int ) return Vkm_Double is
(Vkm_Double(Vkm_Int'Base(value))) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Convert to Vkm_Double.
--<
--< @description
--< The following operations convert various VKM Math types to Vkm_Double
--< math types.
--
--< @param value The value to convert to Vkm_Double.
--
--< @return The conversion to Vkm_Double.
----------------------------------------------------------------------------
function To_Vkm_Double (value : in Vkm_Float) return Vkm_Double is
(Vkm_Double(Vkm_Float'Base(value))) with Inline;
----------------------------------------------------------------------------
-- Operator override definitions
----------------------------------------------------------------------------
function "-" (instance : in Vkm_Bool) return Vkm_Bool is
(not instance) with inline;
function "+" (left, right : in Vkm_Bool) return Vkm_Bool is
(left xor right) with inline;
function "-" (left, right : in Vkm_Bool) return Vkm_Bool is
(left xor right) with inline;
function "*" (left, right : in Vkm_Bool) return Vkm_Bool is
(left and right) with inline;
----------------------------------------------------------------------------
function "abs" (x : in Vkm_Float ) return Vkm_Float is
(if x >= 0.0 then x else -x) with Inline;
function Floor (x : in Vkm_Float) return Vkm_Float renames Vkm_Float'Floor;
function "mod" (x, y : in Vkm_Float) return Vkm_Float is
(x - y * Floor(x / y)) with Inline;
function Exp (x : in Vkm_Float) return Vkm_Float
renames VKM_FLT_NEF.Exp;
function "**" (x, y : in Vkm_Float) return Vkm_Float
renames VKM_FLT_NEF."**";
----------------------------------------------------------------------------
function "abs" (x : in Vkm_Double ) return Vkm_Double is
(if x >= 0.0 then x else -x) with Inline;
function Floor (x : in Vkm_Double) return Vkm_Double renames Vkm_Double'Floor;
function "mod" (x, y : in Vkm_Double) return Vkm_Double is
(x - y * Floor(x / y)) with Inline;
function Exp (x : in Vkm_Double) return Vkm_Double
renames VKM_DBL_NEF.Exp;
function "**" (x, y : in Vkm_Double) return Vkm_Double
renames VKM_DBL_NEF."**";
end Vulkan.Math;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- It is now maintained by Ada Core Technologies Inc (http://www.gnat.com). --
-- --
------------------------------------------------------------------------------
-- This is the bare board version of this package for ARM EABI targets, using
-- unwind tables.
with Ada.Unchecked_Conversion;
package body System.Traceback is
use System.Traceback_Entries;
type Unwind_Reason_Code is
(URC_OK,
URC_FOREIGN_EXCEPTION_CAUGHT,
URC_END_OF_STACK,
URC_HANDLER_FOUND,
URC_INSTALL_CONTEXT,
URC_CONTINUE_UNWIND,
URC_FAILURE);
pragma Convention (C, Unwind_Reason_Code);
-- The _Unwind_Reason_Code enum defined by ARM EHABI document
pragma Unreferenced (URC_FOREIGN_EXCEPTION_CAUGHT,
URC_END_OF_STACK,
URC_HANDLER_FOUND,
URC_INSTALL_CONTEXT,
URC_CONTINUE_UNWIND);
type Unwind_Context_Type is null record;
type Unwind_Context_Acc is access Unwind_Context_Type;
pragma Convention (C, Unwind_Context_Acc);
-- Access to the opaque _Unwind_Context type
type Unwind_Trace_Fn is access
function (UC : Unwind_Context_Acc; Data : System.Address)
return Unwind_Reason_Code;
pragma Convention (C, Unwind_Trace_Fn);
-- The _Unwind_Trace_Fn function (used for the callback)
function Unwind_Backtrace
(Func : Unwind_Trace_Fn;
Data : System.Address) return Unwind_Reason_Code;
pragma Import (C, Unwind_Backtrace, "_Unwind_Backtrace");
-- The _Unwind_Backtrace function that calls Func with Data for each frame
function Unwind_VRS_Get
(UC : Unwind_Context_Acc;
Reg_Class : Integer;
Reg_Num : Integer;
Data_Rep : Integer;
Addr : System.Address) return Integer;
pragma Import (C, Unwind_VRS_Get, "_Unwind_VRS_Get");
-- The _Unwind_VRS_Get function to extract a register from the unwind
-- context UC.
UVRSR_OK : constant Integer := 0;
-- Success return status for Unwind_VRS_Get
UVRSC_CORE : constant Integer := 0;
-- Core register class for Unwind_VRS_Get
UVRSD_UINT32 : constant Integer := 0;
-- Unsigned int 32 data representation for Unwind_VRS_Get
type Tracebacks_Array_Ptr is access Tracebacks_Array (Positive);
type Callback_Params_Type is record
Tracebacks : Tracebacks_Array_Ptr;
Max_Len : Natural;
Len : Natural;
Exclude_Min : System.Address;
Exclude_Max : System.Address;
Skip_Frames : Natural;
end record;
-- This record contains the parameters for Call_Chain to be passed to
-- the callback. We could have used a nested subprogram, but as we are
-- interfacing with C (in bare board context), we prefer to use an
-- explicit mechanism.
type Callback_Params_Acc is access all Callback_Params_Type;
function Backtrace_Callback
(UC : Unwind_Context_Acc;
Data : System.Address) return Unwind_Reason_Code;
pragma Convention (C, Backtrace_Callback);
-- The callback for _Unwind_Backtrace, which is called for each frame
------------------------
-- Backtrace_Callback --
------------------------
function Backtrace_Callback
(UC : Unwind_Context_Acc;
Data : System.Address) return Unwind_Reason_Code
is
function To_Callback_Params is new Ada.Unchecked_Conversion
(System.Address, Callback_Params_Acc);
Params : constant Callback_Params_Acc := To_Callback_Params (Data);
-- The parameters of Call_Chain
PC : System.Address;
begin
-- Exclude Skip_Frames frames from the traceback.
if Params.Skip_Frames > 0 then
Params.Skip_Frames := Params.Skip_Frames - 1;
return URC_OK;
end if;
-- If the backtrace is full, simply discard new entries
if Params.Len >= Params.Max_Len then
return URC_OK;
end if;
-- Extract the PC (register 15)
if Unwind_VRS_Get (UC, UVRSC_CORE, 15, UVRSD_UINT32, PC'Address) /=
UVRSR_OK
then
return URC_FAILURE;
end if;
-- Discard exluded values
if PC in Params.Exclude_Min .. Params.Exclude_Max then
return URC_OK;
end if;
-- Append an entry
Params.Len := Params.Len + 1;
Params.Tracebacks (Params.Len) := PC;
return URC_OK;
end Backtrace_Callback;
----------------
-- Call_Chain --
----------------
procedure Call_Chain
(Traceback : in out System.Traceback_Entries.Tracebacks_Array;
Max_Len : Natural;
Len : out Natural;
Exclude_Min : System.Address := System.Null_Address;
Exclude_Max : System.Address := System.Null_Address;
Skip_Frames : Natural := 1)
is
function To_Tracebacks_Array_Ptr is new Ada.Unchecked_Conversion
(System.Address, Tracebacks_Array_Ptr);
Params : aliased Callback_Params_Type;
Res : Unwind_Reason_Code;
pragma Unreferenced (Res);
begin
-- Copy parameters; add 1 to Skip_Frames to ignore the caller of
-- Call_Chain.
Params := (Tracebacks => To_Tracebacks_Array_Ptr (Traceback'Address),
Len => 0,
Max_Len => Max_Len,
Exclude_Min => Exclude_Min,
Exclude_Max => Exclude_Max,
Skip_Frames => Skip_Frames + 1);
-- Call the unwinder
Res := Unwind_Backtrace (Backtrace_Callback'Access, Params'Address);
-- Copy the result
Len := Params.Len;
end Call_Chain;
end System.Traceback;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- copy and modify this specification, provided that if you redistribute a --
-- modified version, any changes that you have made are clearly indicated. --
-- --
------------------------------------------------------------------------------
-- The implementation of this package is as defined in the Ada 2012 RM, but
-- it is available in Ada 95 and Ada 2005 modes as well.
package Ada.Environment_Variables is
pragma Preelaborate (Environment_Variables);
function Value (Name : String) return String;
-- If the external execution environment supports environment variables,
-- then Value returns the value of the environment variable with the given
-- name. If no environment variable with the given name exists, then
-- Constraint_Error is propagated. If the execution environment does not
-- support environment variables, then Program_Error is propagated.
function Value (Name : String; Default : String) return String;
-- If the external execution environment supports environment variables and
-- an environment variable with the given name currently exists, then Value
-- returns its value; otherwise, it returns Default.
function Exists (Name : String) return Boolean;
-- If the external execution environment supports environment variables and
-- an environment variable with the given name currently exists, then
-- Exists returns True; otherwise it returns False.
procedure Set (Name : String; Value : String);
-- If the external execution environment supports environment variables,
-- then Set first clears any existing environment variable with the given
-- name, and then defines a single new environment variable with the given
-- name and value. Otherwise Program_Error is propagated.
--
-- If implementation-defined circumstances prohibit the definition of an
-- environment variable with the given name and value, then exception
-- Constraint_Error is propagated.
--
-- It is implementation defined whether there exist values for which the
-- call Set (Name, Value) has the same effect as Clear (Name).
procedure Clear (Name : String);
-- If the external execution environment supports environment variables,
-- then Clear deletes all existing environment variables with the given
-- name. Otherwise Program_Error is propagated.
procedure Clear;
-- If the external execution environment supports environment variables,
-- then Clear deletes all existing environment variables. Otherwise
-- Program_Error is propagated.
procedure Iterate
(Process : not null access procedure (Name, Value : String));
-- If the external execution environment supports environment variables,
-- then Iterate calls the subprogram designated by Process for each
-- existing environment variable, passing the name and value of that
-- environment variable. Otherwise Program_Error is propagated.
end Ada.Environment_Variables;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
private with GL.Low_Level;
package GL.Objects.Shaders is
pragma Preelaborate;
type Shader_Type is (Fragment_Shader, Vertex_Shader, Geometry_Shader,
Tess_Evaluation_Shader, Tess_Control_Shader,
Compute_Shader);
type Shader (Kind : Shader_Type) is new GL_Object with private;
procedure Set_Source (Subject : Shader; Source : String);
function Source (Subject : Shader) return String;
procedure Compile (Subject : Shader);
function Compile_Status (Subject : Shader) return Boolean;
function Info_Log (Subject : Shader) return String;
overriding
procedure Initialize_Id (Object : in out Shader);
overriding
procedure Delete_Id (Object : in out Shader);
overriding
function Identifier (Object : Shader) return Types.Debug.Identifier is
(Types.Debug.Shader);
private
type Shader (Kind : Shader_Type) is new GL_Object with null record;
for Shader_Type use (Fragment_Shader => 16#8B30#,
Vertex_Shader => 16#8B31#,
Geometry_Shader => 16#8DD9#,
Tess_Evaluation_Shader => 16#8E87#,
Tess_Control_Shader => 16#8E88#,
Compute_Shader => 16#91B9#);
for Shader_Type'Size use Low_Level.Enum'Size;
end GL.Objects.Shaders;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- --
------------------------------------------------------------------------------
with HAL; use HAL;
package body Hex_Dump is
procedure Hex_Dump (Data : HAL.UInt8_Array;
Put_Line : Put_Line_Procedure;
Base_Addr : HAL.UInt64 := 0)
is
function UInt8_To_Char (Val : UInt8) return Character;
procedure Start_New_Line;
-- Hexdump format:
-- 0000_0000_0000_0000: 57 69 6B 69 70 65 64 69 61 2C 20 74 68 65 20 66 Wikipedia, the f
-- Addr : ^^^^^^^^^^^^^^^^^^^^
-- Hex : ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
-- ASCII: ^^^^^^^^^^^^^^^^^
Addr_Len : constant := 16 + 3 + 1;
Hex_Len : constant := 3 * 16;
ASCII_Len : constant := 1 + 16;
Str : String (1 .. Addr_Len + Hex_Len + ASCII_Len) := (others => ' ');
UInt4_To_Char : constant array (UInt4) of Character
:= (0 => '0',
1 => '1',
2 => '2',
3 => '3',
4 => '4',
5 => '5',
6 => '6',
7 => '7',
8 => '8',
9 => '9',
10 => 'A',
11 => 'B',
12 => 'C',
13 => 'D',
14 => 'E',
15 => 'F');
-------------------
-- UInt8_To_Char --
-------------------
function UInt8_To_Char (Val : UInt8) return Character is
begin
case Val is
when 0 .. 31 | 127 .. 255 =>
return '.';
when others =>
return Character'Val (Val);
end case;
end UInt8_To_Char;
Index : Natural;
Cnt : Natural;
Addr : Natural := 0;
--------------------
-- Start_New_Line --
--------------------
procedure Start_New_Line is
Addr_Val : UInt64 := UInt64 (Addr) + Base_Addr;
begin
-- Address
for X in reverse 1 .. 19 loop
if X in 5 | 10 | 15 then
Str (X) := '_';
else
Str (X) := UInt4_To_Char (UInt4 (Addr_Val and 16#0F#));
Addr_Val := Shift_Right (Addr_Val, 4);
end if;
end loop;
Str (20) := ':';
Str (21 .. Str'Last) := (others => ' ');
Cnt := 0;
Index := Str'First + Addr_Len;
end Start_New_Line;
begin
Start_New_Line;
for Elt of Data loop
-- Hex
Str (Index + 1) := UInt4_To_Char (UInt4 (Shift_Right (Elt, 4)));
Str (Index + 2) := UInt4_To_Char (UInt4 (Elt and 16#0F#));
-- ASCII
Str (Str'Last - (15 - Cnt)) := UInt8_To_Char (Elt);
Index := Index + 3;
Cnt := Cnt + 1;
Addr := Addr + 1;
if Cnt = 16 then
Put_Line (Str);
Start_New_Line;
end if;
end loop;
if Cnt /= 0 then
Put_Line (Str (Str'First .. Str'Last - (16 - Cnt)));
end if;
end Hex_Dump;
end Hex_Dump;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with System.Native_Time;
with C.sys.resource;
with C.sys.time;
package body System.Native_Execution_Time is
use type C.signed_int;
function To_Duration (D : C.sys.time.struct_timeval) return Duration;
function To_Duration (D : C.sys.time.struct_timeval) return Duration is
begin
return Native_Time.To_Duration (Native_Time.To_timespec (D));
end To_Duration;
-- implementation
function Clock return CPU_Time is
rusage : aliased C.sys.resource.struct_rusage;
begin
if C.sys.resource.getrusage (
C.sys.resource.RUSAGE_SELF,
rusage'Access) < 0
then
raise Program_Error; -- ???
else
return To_Duration (rusage.ru_utime);
end if;
end Clock;
end System.Native_Execution_Time;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with Interfaces;
package ACO.OD_Types is
pragma Preelaborate;
subtype Object_Index is Interfaces.Unsigned_16;
subtype Object_Subindex is Interfaces.Unsigned_8;
type Entry_Index is record
Object : Object_Index;
Sub : Object_Subindex;
end record;
type Byte_Array is array (Natural range <>) of Interfaces.Unsigned_8;
Empty : Byte_Array (1 .. 0);
type Access_Mode is (RW, RO, WO);
type Entry_Base is abstract tagged record
Accessability : Access_Mode := RW;
end record;
function Is_Readable (This : Entry_Base) return Boolean is
(case This.Accessability is
when RW | RO => True,
when WO => False);
function Is_Writable (This : Entry_Base) return Boolean is
(case This.Accessability is
when RW | WO => True,
when RO => False);
function Data_Length (This : Entry_Base) return Natural is abstract;
function Read (This : Entry_Base) return Byte_Array is abstract;
procedure Write (This : in out Entry_Base;
Bytes : in Byte_Array) is abstract;
type Entry_Ref is not null access all Entry_Base'Class;
type Entry_Array is array (Object_Subindex range <>) of Entry_Ref;
type Object_Base (Entries : not null access Entry_Array) is tagged null record;
type Object_Ref is access all Object_Base'Class;
No_Object : constant Object_Ref := null;
subtype Index_Type is Integer range -1 .. Integer'Last;
No_Index : constant := Index_Type'First;
subtype Profile_Index_Type is Index_Type range 0 .. Index_Type'Last;
type Profile_Objects is array (Profile_Index_Type range <>) of Object_Ref;
type Profile_Objects_Ref is access all Profile_Objects;
end ACO.OD_Types;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with HIL.Devices;
-- @summary
-- Target-independent specification for HIL of GPIO
package HIL.GPIO with SPARK_Mode is
type GPIO_Signal_Type is(
HIGH, LOW);
type GPIO_Point_Type is new HIL.Devices.Device_Type_GPIO;
subtype Point_Out_Type is GPIO_Point_Type;
--subtype Ponit_In_Type is GPIO_Point_Type;
--function init return Boolean;
procedure configure;
-- precondition that Point is Output
procedure write (Point : in GPIO_Point_Type; Signal : in GPIO_Signal_Type);
procedure read (Point : in GPIO_Point_Type; Signal : out GPIO_Signal_Type);
procedure All_LEDs_Off;
procedure All_LEDs_On;
end HIL.GPIO;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- Objectif : Test du module Arbre_Binaire.
-- Créé : <NAME> 25 2019
--------------------------------------------------------------------------------
with Ada.Text_IO; use Ada.Text_IO;
with Arbre_Binaire;
procedure Test_Arbre_Binaire is
-- Instantiation du package Arbre_Binaire avec T_DATA comme Entier.
package AB_Entier is
New Arbre_Binaire (T_DATA => Integer);
use AB_Entier;
-- gt est la fonction > qui compare deux DATAs.
--
-- Param DATA1|2 : Est l'DATA qu'on va comparer.
--
-- Return Boolean : retourne True si DATA1 > DATA2, sinon False.
function gt (DATA1, DATA2: in Integer) return Boolean is
begin
return (DATA1 > DATA2);
end gt;
procedure Insert is new AB_Entier.Insert (gt);
-- Initialisation des variables.
Nb_Donnees : constant Integer := 10; -- Height du tableau DATAs.
DATAs : constant array (1..Nb_Donnees) of Integer -- DATAs est un tableau
:= (56, 78, 76, 27, 90, 23, 12, 43, 24, 39); -- contenant des DATAs.
-- Initialize un ABR avec 5 puis 3 et 6 ajoutés dans un Tree vDATAe.
procedure Init (Tree : out T_BT) is
begin
Initialize (Tree); -- Créer un Tree vDATAe.
Insert (Tree, 5); -- Ajouter 5 à Tree.
Insert (Tree, 3); -- Ajouter 3 à Tree.
Insert (Tree, 6); -- Ajouter 6 à Tree.
end Init;
-- Tester la fonction Is_Empty avec différents arbres.
procedure Tester_Is_Empty is
Tree1, Tree2 : T_BT;
begin
Initialize (Tree1);
pragma Assert (Is_Empty (Tree1)); -- Tree1 est vDATAe.
Insert (Tree1, 12);
pragma Assert (not Is_Empty (Tree1)); -- Tree1 n'est pas vDATAe.
Destruct (Tree1); -- Libérer la mémoire.
Init (Tree2);
pragma Assert (not Is_Empty (Tree2)); -- Tree2 n'est pas vDATAe.
Destruct (Tree2); -- Libérer la mémoire.
Put_line("Fonction Tester_Is_Empty est exécutée avec succès.");
New_Line;
end Tester_Is_Empty;
-- Tester la procédure Height avec deux arbres différents.
procedure Tester_Height is
Tree1, Tree2 : T_BT;
begin
Initialize (Tree1);
pragma assert (Height (Tree1) = 0); -- Height = 0.
Insert (Tree1, 99);
pragma assert (Height ( Tree1) /= 0); -- Height = 1.
Destruct (Tree1); -- Libérer la mémoire.
Init (Tree2);
pragma Assert (Height (Tree2) = 3); -- Height = 3.
Insert (Tree2, 33);
pragma Assert (Height (Tree2) /= 3); -- Height = 4.
Destruct (Tree2); -- Libérer la mémoire.
Put_line("Fonction Tester_Height est exécutée avec succès.");
New_Line;
end Tester_Height;
-- Tester la procédure Insert.
procedure Tester_Insert is
Tree : T_BT;
begin
Init (Tree);
pragma Assert (not Is_Empty (Tree)); -- Tree n'est pas vDATAe.
Insert (Tree, 16);
pragma Assert (not Is_Empty (Tree)); -- Tree n'est pas vDATAe.
Destruct (Tree); -- Libérer la mémoire.
Put_Line ("Procédure Tester_Insert est exécutée avec succès.");
New_Line;
end Tester_Insert;
-- Initialise l'ABR Tree comme un ABR vDATAe dans lequel ont été insérées
-- les cles DATAs ci-dessus.
procedure Construire_Exemple_Arbre (Annuaire : out T_BT) is
begin
Initialize (Annuaire);
pragma Assert (Is_Empty (Annuaire));
pragma Assert (Height (Annuaire) = 0);
for i in 1..Nb_Donnees loop
Insert (Annuaire, DATAs (i));
pragma Assert (not Is_Empty (Annuaire));
pragma Assert (Height (Annuaire) = i);
end loop;
Destruct (Annuaire);
pragma Assert (Is_Empty (Annuaire));
pragma Assert (Height (Annuaire) = 0);
end Construire_Exemple_Arbre;
procedure Tester_Exemple_Arbre is
Annuaire : T_BT;
begin
Construire_Exemple_Arbre (Annuaire);
Destruct (Annuaire);
pragma Assert (Is_Empty (Annuaire));
pragma Assert (Height (Annuaire) = 0);
Put_Line ("Procédure Tester_Exemple_Arbre est exécutée avec succès.");
New_Line;
end Tester_Exemple_Arbre;
begin
New_Line;
Put_Line("*************************** Début ****************************");
New_Line;
-- Tester la fonction Is_Empty.
Tester_Is_Empty;
-- Tester la fonction Height.
Tester_Height;
-- Tester la procédure Insert.
Tester_Insert;
-- Tester la procédure Tester_Exemple_Arbre.
Tester_Exemple_Arbre;
New_Line;
Put_Line("***************************** Fin ****************************");
New_Line;
end Test_Arbre_Binaire;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with Ada.Command_Line;
with Ada.Directories;
with Ada.Integer_Wide_Text_IO;
with Ada.Strings.Wide_Unbounded.Wide_Text_IO;
with Ada.Wide_Text_IO;
with Token_Extractor;
package body Token_Generator is
use Ada.Integer_Wide_Text_IO;
use Ada.Strings.Wide_Unbounded.Wide_Text_IO;
use Ada.Wide_Text_IO;
use Token_Extractor;
function Tokens_File_Name return String;
-- Returns file name of the output file.
function Tokens_Template_File_Name return String;
-- Returns file name of the input template file.
----------------------------
-- Generate_Parser_Tokens --
----------------------------
procedure Generate_Parser_Tokens is
Input : File_Type;
Output : File_Type;
Buffer : Wide_String (1 .. 1024);
Last : Natural;
begin
Open (Input, In_File, Tokens_Template_File_Name, "wcem=8");
Create (Output, Out_File, Tokens_File_Name, "wcem=8");
while not End_Of_File (Input) loop
Get_Line (Input, Buffer, Last);
if Buffer (1 .. Last) = "%%" then
Put_Line (Output, " type Token is");
for J in 1 .. Natural (Tokens.Length) loop
if J = 1 then
Put (Output, " (");
else
Put_Line (Output, ",");
Put (Output, " ");
end if;
Put (Output, Tokens.Element (J));
end loop;
Put_Line (Output, ");");
else
Put_Line (Output, Buffer (1 .. Last));
end if;
end loop;
Close (Output);
Close (Input);
end Generate_Parser_Tokens;
----------------------
-- Tokens_File_Name --
----------------------
function Tokens_File_Name return String is
Template : constant String
:= Ada.Directories.Simple_Name (Tokens_Template_File_Name);
begin
return Template (Template'First .. Template'Last - 3);
end Tokens_File_Name;
-------------------------------
-- Tokens_Template_File_Name --
-------------------------------
function Tokens_Template_File_Name return String is
begin
return Ada.Command_Line.Argument (3);
end Tokens_Template_File_Name;
end Token_Generator;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
with Ada.Numerics.Elementary_Functions;
use Ada.Numerics.Elementary_Functions;
package MathArray with SPARK_Mode => On is
type vec is array(Natural range <>) of Integer;
type vecFloat is array(Natural range <>) of Float;
function midpoint (point1 : vec; point2 : vec) return vec with
Global => null,
Depends => (midpoint'Result => (point1, point2)),
Pre => (point1'First = point2'First) and then (point1'Last = point2'Last) and then (point1'Length=3 or point1'Length=2)
and then (for all i in point1'Range =>
(if point1(i) > 0 and point2(i) > 0 then
point1(i) <= Integer'Last - point2(i))
and (if point1(i) < 0 and point2(i) < 0 then
point1(i) >= Integer'First - point2(i))),
Post=>(for all i in midpoint'Result'Range =>
midpoint'Result(i)=(point1(i)+point2(i))/2);
--Return vector midpoint of both parameters. (Parameters must have length = 2 or length = 3 and must cover same range).
procedure module (vec1 : vecFloat; res : out Float) with
Global => null,
Depends => (res => vec1),
Pre=>(vec1'length=3 or vec1'Length=2) and then
(for all i in vec1'Range =>
(vec1(i)/Float'Last)*vec1(i) <= 1.0) and then
(if vec1'Length = 2 then
((vec1(vec1'First)*vec1(vec1'First))/2.0)+((vec1(vec1'Last)*vec1(vec1'Last))/2.0)<=Float'Last/2.0
else
Float'Last-abs((vec1(vec1'first+1))*(vec1(vec1'first+1))) <= abs(vec1(vec1'First)*vec1(vec1'First))-abs(vec1(vec1'Last)*vec1(vec1'Last)) and then
Float'Last-abs((vec1(vec1'Last))*(vec1(vec1'Last))) <= abs(vec1(vec1'First+1)*vec1(vec1'First+1))-abs(vec1(vec1'First)*vec1(vec1'First)) and then
Float'Last-abs((vec1(vec1'first))*(vec1(vec1'first))) <= abs(vec1(vec1'last)*vec1(vec1'last))-abs(vec1(vec1'first+1)*vec1(vec1'first+1)) and then
Float'Last-abs((vec1(vec1'first+1))*(vec1(vec1'first+1))) <= abs(vec1(vec1'Last)*vec1(vec1'Last))-abs(vec1(vec1'First)*vec1(vec1'First)) and then
Float'Last-abs((vec1(vec1'last))*(vec1(vec1'last))) <= abs(vec1(vec1'First)*vec1(vec1'First))-abs(vec1(vec1'first + 1)*vec1(vec1'first + 1)) and then
Float'Last-abs((vec1(vec1'first))*(vec1(vec1'first))) <= abs(vec1(vec1'First+1)*vec1(vec1'First+1))-abs(vec1(vec1'Last)*vec1(vec1'Last))
),
Post=>(if vec1'Length = 2 then
res=Ada.Numerics.Elementary_Functions.Sqrt(abs(vec1(vec1'First)*vec1(vec1'First)) + abs(vec1(vec1'Last)*vec1(vec1'Last)))
else
res=Ada.Numerics.Elementary_Functions.Sqrt(abs(vec1(vec1'First)*vec1(vec1'First)) + abs(vec1(vec1'First+1)*vec1(vec1'First+1)) + abs(vec1(vec1'Last)*vec1(vec1'Last))));
--Return res, which is the module of a vector with length = 2 or length = 3.
function derivative (vec1 : vecFloat) return vecFloat with
Global => null,
Depends => (derivative'Result => (vec1)),
Pre => vec1'Length > 0 and then vec1'Length <= 1000000 and then (for all i in vec1'Range =>
(vec1(i)/Float'Last)*Float(vec1'Length - (i - vec1'First + 1)) <= 1.0 and then (vec1(i)/Float'First)*Float(vec1'Length - (i - vec1'First + 1)) >= 1.0),
Post =>(derivative'Result'Length = vec1'Length and then (for all i in derivative'Result'Range =>
derivative'Result(i) = vec1(i)*Float(derivative'Result'Length - (i - derivative'Result'First + 1))));
--Return a derivative polynomial vec. (Vector must have length <= 1000000 and >0).
procedure get(a:in out vec; x:Integer; bool:out Boolean) with
Global => null,
Depends => (a => (a,x) , bool => (a,x)),
Pre => x /= 0 and then a'Length > 0,
Post => (if bool then (for some k in a'Range => a'Old(k) = x and then a(k) = 0)
else (for all k in a'Range => a(k) /= x));
--Search for x in the array and replace it with zero (x can't be zero).
--In bool it is stored true if the operation was successful, if not false.
function perpendicular_vec (vec1 : vec; vec2 : vec) return Boolean with
Global => null,
Depends => (perpendicular_vec'Result => (vec1, vec2)),
Pre => vec1'Length=2 and then vec2'Length = vec1'Length and then
(for all x in vec1'Range => vec1(x) < 46340 and then vec1(x) > -46340)
and then (for all x in vec2'Range => vec2(x) < 46340 and then vec2(x) > -46340)
and then ((if (vec1(vec1'First)*vec2(vec2'First)) > 0 and (vec1(vec1'Last)*vec2(vec2'Last)) > 0 then
(vec1(vec1'First)*vec2(vec2'First)) <= Integer'Last - (vec1(vec1'Last)*vec2(vec2'Last)))
and (if (vec1(vec1'First)*vec2(vec2'First)) < 0 and (vec1(vec1'Last)*vec2(vec2'Last)) < 0 then
(vec1(vec1'First)*vec2(vec2'First)) >= Integer'First - (vec1(vec1'Last)*vec2(vec2'Last)))),
Post => (if perpendicular_vec'Result then
(vec1(vec1'First)*vec2(vec2'First))+(vec1(vec1'Last)*vec2(vec2'Last)) = 0
else
(vec1(vec1'First)*vec2(vec2'First))+(vec1(vec1'Last)*vec2(vec2'Last)) /= 0);
--Return true if vectors (with elements < 46340 and length = 2) are perpendicular between them.
end MathArray;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
-------------------------------------------------------------
with Program.Elements.Type_Definitions;
with Program.Lexical_Elements;
with Program.Elements.Expressions;
with Program.Elements.Real_Range_Specifications;
package Program.Elements.Decimal_Fixed_Point_Types is
pragma Pure (Program.Elements.Decimal_Fixed_Point_Types);
type Decimal_Fixed_Point_Type is
limited interface and Program.Elements.Type_Definitions.Type_Definition;
type Decimal_Fixed_Point_Type_Access is
access all Decimal_Fixed_Point_Type'Class with Storage_Size => 0;
not overriding function Delta_Expression
(Self : Decimal_Fixed_Point_Type)
return not null Program.Elements.Expressions.Expression_Access
is abstract;
not overriding function Digits_Expression
(Self : Decimal_Fixed_Point_Type)
return not null Program.Elements.Expressions.Expression_Access
is abstract;
not overriding function Real_Range
(Self : Decimal_Fixed_Point_Type)
return Program.Elements.Real_Range_Specifications
.Real_Range_Specification_Access is abstract;
type Decimal_Fixed_Point_Type_Text is limited interface;
type Decimal_Fixed_Point_Type_Text_Access is
access all Decimal_Fixed_Point_Type_Text'Class with Storage_Size => 0;
not overriding function To_Decimal_Fixed_Point_Type_Text
(Self : aliased in out Decimal_Fixed_Point_Type)
return Decimal_Fixed_Point_Type_Text_Access is abstract;
not overriding function Delta_Token
(Self : Decimal_Fixed_Point_Type_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Digits_Token
(Self : Decimal_Fixed_Point_Type_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
end Program.Elements.Decimal_Fixed_Point_Types;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- Natools.S_Expressions.Generic_Caches provides a simple memory container --
-- for S-expressions. The container is append-only, and provides cursors to --
-- replay it from start. --
-- This is a generic package that allow client-selected storage pools. An --
-- instance with default storage pools is provided in --
-- Natools.S_Expressions.Caches. --
-- The intended usage is efficient caching of S-expressions in memory. For --
-- more flexible in-memory S-expression objects, --
-- see Natools.S_Expressions.Holders. --
------------------------------------------------------------------------------
with System.Storage_Pools;
with Natools.S_Expressions.Lockable;
with Natools.S_Expressions.Printers;
with Natools.S_Expressions.Replayable;
private with Ada.Finalization;
private with Ada.Unchecked_Deallocation;
private with Natools.References;
generic
Atom_Pool : in out System.Storage_Pools.Root_Storage_Pool'Class;
Counter_Pool : in out System.Storage_Pools.Root_Storage_Pool'Class;
Structure_Pool : in out System.Storage_Pools.Root_Storage_Pool'Class;
package Natools.S_Expressions.Generic_Caches is
pragma Preelaborate (Generic_Caches);
type Reference is new Printers.Printer with private;
pragma Preelaborable_Initialization (Reference);
overriding procedure Open_List (Output : in out Reference);
overriding procedure Append_Atom
(Output : in out Reference; Data : in Atom);
overriding procedure Close_List (Output : in out Reference);
function Duplicate (Cache : Reference) return Reference;
-- Create a new copy of the S-expression held in Cache and return it
function Move (Source : in out S_Expressions.Descriptor'Class)
return Reference;
-- Build a new cache by (destructively) reading Original
type Cursor is new Lockable.Descriptor and Replayable.Descriptor
with private;
pragma Preelaborable_Initialization (Cursor);
overriding function Current_Event (Object : in Cursor) return Events.Event;
overriding function Current_Atom (Object : in Cursor) return Atom;
overriding function Current_Level (Object : in Cursor) return Natural;
overriding procedure Query_Atom
(Object : in Cursor;
Process : not null access procedure (Data : in Atom));
overriding procedure Read_Atom
(Object : in Cursor;
Data : out Atom;
Length : out Count);
overriding procedure Next
(Object : in out Cursor;
Event : out Events.Event);
overriding procedure Lock
(Object : in out Cursor;
State : out Lockable.Lock_State);
overriding procedure Unlock
(Object : in out Cursor;
State : in out Lockable.Lock_State;
Finish : in Boolean := True);
overriding function Duplicate (Object : Cursor) return Cursor;
function First (Cache : Reference'Class) return Cursor;
-- Create a new Cursor pointing at the beginning of Cache
function Move (Source : in out S_Expressions.Descriptor'Class) return Cursor
is (Move (Source).First);
-- Return a cursor holding a copy of Original (which is
-- destructively read)
function Conditional_Move
(Source : in out S_Expressions.Descriptor'Class)
return Cursor
is (if Source in Cursor then Cursor (Source) else Move (Source).First);
-- Return a copy of Source, with cheap copy if possible,
-- otherwise with destructive Move
private
type Atom_Access is access Atom;
for Atom_Access'Storage_Pool use Atom_Pool;
procedure Unchecked_Free is new Ada.Unchecked_Deallocation
(Atom, Atom_Access);
type Node;
type Node_Access is access Node;
for Node_Access'Storage_Pool use Structure_Pool;
type Node_Kind is (Atom_Node, List_Node);
type Node (Kind : Node_Kind) is record
Parent : Node_Access;
Next : Node_Access;
case Kind is
when Atom_Node => Data : Atom_Access;
when List_Node => Child : Node_Access;
end case;
end record;
procedure Unchecked_Free is new Ada.Unchecked_Deallocation
(Node, Node_Access);
type Tree is new Ada.Finalization.Limited_Controlled with record
Root : Node_Access := null;
Last : Node_Access := null;
Opening : Boolean := False;
end record;
procedure Append
(Exp : in out Tree;
Kind : in Node_Kind;
Data : in Atom_Access := null);
-- Append a new node of the given Kind to Exp
procedure Close_List (Exp : in out Tree);
-- Close innermost list
function Create_Tree return Tree;
-- Create a new empty Tree
function Duplicate (Source : Tree) return Tree;
-- Deep copy of a Tree object
overriding procedure Finalize (Object : in out Tree);
-- Release all nodes contained in Object
package Trees is new References (Tree, Structure_Pool, Counter_Pool);
type Reference is new Printers.Printer with record
Exp : Trees.Reference;
end record;
type Cursor is new Lockable.Descriptor and Replayable.Descriptor with record
Exp : Trees.Reference;
Position : Node_Access := null;
Opening : Boolean := False;
Stack : Lockable.Lock_Stack;
Locked : Boolean := False;
end record;
function Absolute_Level (Object : Cursor) return Natural;
end Natools.S_Expressions.Generic_Caches;
|
{
"source": "starcoderdata",
"programming_language": "ada"
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.