id
int64 0
30.9k
| extension
stringclasses 1
value | max_stars_count
int64 0
17k
| max_stars_repo_name
stringlengths 7
106
| max_stars_repo_path
stringlengths 5
136
| text
stringlengths 9
1M
|
|---|---|---|---|---|---|
200
|
ada
| 15
|
mgrojo/adalib
|
system-multiprocessors-dispatching_domains.ads
|
-- Standard Ada library specification
-- Copyright (c) 2004-2016 AXE Consultants
-- Copyright (c) 2004, 2005, 2006 Ada-Europe
-- Copyright (c) 2000 The MITRE Corporation, Inc.
-- Copyright (c) 1992, 1993, 1994, 1995 Intermetrics, Inc.
-- SPDX-License-Identifier: BSD-3-Clause and LicenseRef-AdaReferenceManual
---------------------------------------------------------------------------
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;
|
201
|
ada
| 0
|
twdroeger/ada-awa
|
awa/regtests/awa-mail-modules-tests.adb
|
-----------------------------------------------------------------------
-- awa-mail-module-tests -- Unit tests for Mail module
-- Copyright (C) 2012, 2017 <NAME>
-- Written by <NAME> (<EMAIL>)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
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;
|
202
|
ada
| 0
|
0xA1/pi-spi
|
example/send_byte.adb
|
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;
|
203
|
ada
| 0
|
persan/dds-requestreply
|
src/dds-request_reply.ads
|
package DDS.Request_Reply is
type Ref is limited interface;
type Ref_Access is access all Ref'Class;
procedure Log_Exception (Self : not null access Ref; Log : Standard.String) is null;
end DDS.Request_Reply;
|
204
|
ada
| 0
|
djamal2727/Main-Bearing-Analytical-Model
|
Validation/pyFrame3DD-master/gcc-master/gcc/ada/lib-xref.adb
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- L I B . X R E F --
-- --
-- B o d y --
-- --
-- Copyright (C) 1998-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- 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;
|
205
|
ada
| 0
|
caqg/linux-home
|
.emacs.d/elpa/wisi-3.1.3/wisitoken-generate-lr-lr1_generate.adb
|
-- Abstract :
--
-- See spec.
--
-- Copyright (C) 2017 - 2020 Free Software Foundation, Inc.
--
-- This file is part of the WisiToken package.
--
-- The WisiToken package is free software; you can redistribute it
-- and/or modify it under terms of the GNU General Public License as
-- published by the Free Software Foundation; either version 3, or
-- (at your option) any later version. This library is distributed in
-- the hope that it will be useful, but WITHOUT ANY WARRANTY; without
-- even the implied warranty of MERCHAN- TABILITY or FITNESS FOR A
-- PARTICULAR PURPOSE.
--
-- As a special exception under Section 7 of GPL version 3, you are granted
-- additional permissions described in the GCC Runtime Library Exception,
-- version 3.1, as published by the Free Software Foundation.
pragma License (Modified_GPL);
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;
|
206
|
ada
| 0
|
vonNiklasson/KTH-programming-benchmark
|
src/Ada/collatz/col.adb
|
<gh_stars>0
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;
|
207
|
ada
| 2
|
heharkon/cmd_ada
|
example_app/src/example_app.adb
|
<filename>example_app/src/example_app.adb
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;
|
208
|
ada
| 24
|
svn2github/matreshka
|
source/league/iana/matreshka-internals-text_codecs-iana_registry.ads
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2010-2013, <NAME> <<EMAIL>> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $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;
|
209
|
ada
| 1
|
f110/wing
|
third_party/universal-ctags/ctags/Units/parser-ada.r/ada-entry.d/input_1.ads
|
<reponame>f110/wing<filename>third_party/universal-ctags/ctags/Units/parser-ada.r/ada-entry.d/input_1.ads<gh_stars>1-10
-- 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;
|
210
|
ada
| 22
|
Melyodas/metalang
|
out/euler34.adb
|
<gh_stars>10-100
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;
|
211
|
ada
| 80
|
thindil/steamsky
|
tests/game-test_data-tests.adb
|
-- This package has been generated automatically by GNATtest.
-- You are allowed to add your code to the bodies of test routines.
-- Such changes will be kept during further regeneration of this file.
-- All code placed outside of test routine bodies will be lost. The
-- code intended to set up and tear down the test environment should be
-- placed into Game.Test_Data.
with AUnit.Assertions; use AUnit.Assertions;
with System.Assertions;
-- begin read only
-- id:2.2/00/
--
-- This section can be used to add with clauses if necessary.
--
-- end read only
with Messages; use Messages;
with Config; use Config;
-- begin read only
-- end read only
package body Game.Test_Data.Tests is
-- begin read only
-- id:2.2/01/
--
-- This section can be used to add global variables and other elements.
--
-- end read only
-- begin read only
-- end read only
-- begin read only
procedure Wrap_Test_Update_Game_25a566_5306b6
(Minutes: Positive; In_Combat: Boolean := False) is
begin
GNATtest_Generated.GNATtest_Standard.Game.Update_Game
(Minutes, In_Combat);
end Wrap_Test_Update_Game_25a566_5306b6;
-- end read only
-- begin read only
procedure Test_Update_Game_test_updategame(Gnattest_T: in out Test);
procedure Test_Update_Game_25a566_5306b6(Gnattest_T: in out Test) renames
Test_Update_Game_test_updategame;
-- id:2.2/25a566d308fb13f6/Update_Game/1/0/test_updategame/
procedure Test_Update_Game_test_updategame(Gnattest_T: in out Test) is
procedure Update_Game
(Minutes: Positive; In_Combat: Boolean := False) renames
Wrap_Test_Update_Game_25a566_5306b6;
-- end read only
pragma Unreferenced(Gnattest_T);
Minutes: constant Natural := Game_Date.Minutes;
begin
Update_Game(1);
Assert(Minutes + 1 = Game_Date.Minutes, "Failed to update game time.");
-- begin read only
end Test_Update_Game_test_updategame;
-- end read only
-- begin read only
procedure Wrap_Test_End_Game_29871f_745ef4(Save: Boolean) is
begin
GNATtest_Generated.GNATtest_Standard.Game.End_Game(Save);
end Wrap_Test_End_Game_29871f_745ef4;
-- end read only
-- begin read only
procedure Test_End_Game_test_endgame(Gnattest_T: in out Test);
procedure Test_End_Game_29871f_745ef4(Gnattest_T: in out Test) renames
Test_End_Game_test_endgame;
-- id:2.2/29871f76a299de21/End_Game/1/0/test_endgame/
procedure Test_End_Game_test_endgame(Gnattest_T: in out Test) is
procedure End_Game(Save: Boolean) renames
Wrap_Test_End_Game_29871f_745ef4;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
End_Game(False);
Assert(Messages_List.Length = 0, "Failed to clear old game data.");
New_Game_Settings.Player_Faction := To_Unbounded_String("POLEIS");
New_Game_Settings.Player_Career := To_Unbounded_String("general");
New_Game_Settings.Starting_Base := To_Unbounded_String("1");
New_Game;
-- begin read only
end Test_End_Game_test_endgame;
-- end read only
-- begin read only
function Wrap_Test_Find_Skill_Index_800ce5_5e7804
(Skill_Name: String) return Natural is
begin
begin
pragma Assert(Skill_Name'Length > 0);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(game.ads:0):Test_FindSkillIndex test requirement violated");
end;
declare
Test_Find_Skill_Index_800ce5_5e7804_Result: constant Natural :=
GNATtest_Generated.GNATtest_Standard.Game.Find_Skill_Index
(Skill_Name);
begin
begin
pragma Assert
(Test_Find_Skill_Index_800ce5_5e7804_Result <=
Natural(SkillsData_Container.Length(Container => Skills_List)));
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(game.ads:0:):Test_FindSkillIndex test commitment violated");
end;
return Test_Find_Skill_Index_800ce5_5e7804_Result;
end;
end Wrap_Test_Find_Skill_Index_800ce5_5e7804;
-- end read only
-- begin read only
procedure Test_Find_Skill_Index_test_findskillindex
(Gnattest_T: in out Test);
procedure Test_Find_Skill_Index_800ce5_5e7804
(Gnattest_T: in out Test) renames
Test_Find_Skill_Index_test_findskillindex;
-- id:2.2/800ce528dff2e51d/Find_Skill_Index/1/0/test_findskillindex/
procedure Test_Find_Skill_Index_test_findskillindex
(Gnattest_T: in out Test) is
function Find_Skill_Index(Skill_Name: String) return Natural renames
Wrap_Test_Find_Skill_Index_800ce5_5e7804;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
Assert
(Find_Skill_Index("Piloting") = 1, "Failed to find existing skill.");
Assert
(Find_Skill_Index("sdljfskfhsf") = 0,
"Failed to not find non exisiting skill.");
-- begin read only
end Test_Find_Skill_Index_test_findskillindex;
-- end read only
-- begin read only
-- id:2.2/02/
--
-- This section can be used to add elaboration code for the global state.
--
begin
-- end read only
null;
-- begin read only
-- end read only
end Game.Test_Data.Tests;
|
212
|
ada
| 0
|
JCGobbi/Nucleo-STM32G474RE
|
bb-runtimes/runtimes/ravenscar-full-stm32g474/gnat/a-cofove.ads
|
<reponame>JCGobbi/Nucleo-STM32G474RE
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- A D A . C O N T A I N E R S . F O R M A L _ V E C T O R S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2004-2021, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
------------------------------------------------------------------------------
-- 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;
|
213
|
ada
| 4
|
faelys/gela-asis
|
source/asis/spec/annex_c/ada-interrupts.ads
|
------------------------------------------------------------------------------
-- A d a r u n - t i m e s p e c i f i c a t i o n --
-- ASIS implementation for Gela project, a portable Ada compiler --
-- http://gela.ada-ru.org --
-- - - - - - - - - - - - - - - - --
-- Read copyright and license at the end of ada.ads file --
------------------------------------------------------------------------------
-- $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;
|
214
|
ada
| 4
|
stcarrez/ada-lzma
|
samples/decompress.adb
|
-----------------------------------------------------------------------
-- decompress - Decompress example based on the 02_decompress.c example
-- The MIT License (MIT)
--
-- Copyright (c) 2015 <NAME>
--
-- Permission is hereby granted, free of charge, to any person obtaining a copy
-- of this software and associated documentation files (the "Software"), to deal
-- in the Software without restriction, including without limitation the rights
-- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-- copies of the Software, and to permit persons to whom the Software is
-- furnished to do so, subject to the following conditions:
--
-- The above copyright notice and this permission notice shall be included in all
-- copies or substantial portions of the Software.
--
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-- 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;
|
215
|
ada
| 6
|
gerr135/ada_gems
|
ada_lists/src/iface_lists.adb
|
<filename>ada_lists/src/iface_lists.adb<gh_stars>1-10
-- 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;
|
216
|
ada
| 0
|
DrenfongWong/tkm-rpc
|
specs/ada/common/tkmrpc-response-ike-isa_sign.ads
|
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;
|
217
|
ada
| 1
|
selroc/Renaissance-Ada
|
src/tools/Dependency_Graph_Extractor/src/extraction-decls.adb
|
<filename>src/tools/Dependency_Graph_Extractor/src/extraction-decls.adb
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;
|
218
|
ada
| 70
|
Lucretia/bare_bones
|
src/vga_console.adb
|
-- -*- Mode: Ada -*-
-- Filename : vga_console.adb
-- Description : Implementation of a console for PC using VGA text mode.
-- Author : <NAME>
-- 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;
|
219
|
ada
| 0
|
faelys/natools
|
src/natools-getopt_long.ads
|
<filename>src/natools-getopt_long.ads
------------------------------------------------------------------------------
-- Copyright (c) 2011, <NAME> --
-- --
-- Permission to use, copy, modify, and distribute this software for any --
-- purpose with or without fee is hereby granted, provided that the above --
-- copyright notice and this permission notice appear in all copies. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES --
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF --
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR --
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES --
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN --
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF --
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. --
------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- 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;
|
220
|
ada
| 4
|
davidkristola/vole
|
kv-avm-instances.adb
|
<reponame>davidkristola/vole
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;
|
221
|
ada
| 0
|
My-Colaborations/dynamo
|
regtests/gen-artifacts-xmi-tests.adb
|
-----------------------------------------------------------------------
-- gen-xmi-tests -- Tests for xmi
-- Copyright (C) 2012 <NAME>
-- Written by <NAME> (<EMAIL>)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
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", "ADO.Table.@dynamo.table.hasList",
Gen.Model.XMI.BY_NAME);
T.Assert (Tag /= null, "Tag definition not found");
end;
end Test_Find_Tag_Definition;
end Gen.Artifacts.XMI.Tests;
|
222
|
ada
| 0
|
sebsgit/textproc
|
src/stbiwrapper.adb
|
<reponame>sebsgit/textproc<gh_stars>0
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;
|
223
|
ada
| 0
|
charlesincharge/EmbeddedAda
|
hello_world.adb
|
-- Lines starting with `--` are treated as comments.
-- Compile with `gnatmake hello_world.adb`, then run the executable with
-- `./hello_world`
-- Import the Ada.Text_IO package
with Ada.Text_IO;
-- `procedure` indicates the start of the subprogram
procedure Hello_World is
-- Declare variables here
begin
-- Function body here
Ada.Text_IO.Put_Line("Hello, World!");
end Hello_World;
|
224
|
ada
| 60
|
RREE/ada-util
|
samples/csv_reader.adb
|
-----------------------------------------------------------------------
-- csv_reader -- Read CSV file
-- Copyright (C) 2011, 2017 <NAME>
-- Written by <NAME> (<EMAIL>)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
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;
|
225
|
ada
| 52
|
onox/orka
|
orka_simd/src/x86/generic/orka-simd-sse-singles-swizzle.adb
|
-- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2016 onox <<EMAIL>>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
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;
|
226
|
ada
| 1
|
mullikine/RosettaCodeData
|
Task/Prime-decomposition/Ada/prime-decomposition-3.ada
|
with Prime_Numbers, Ada.Text_IO;
procedure Test_Prime is
package Integer_Numbers is new
Prime_Numbers (Natural, 0, 1, 2);
use Integer_Numbers;
procedure Put (List : Number_List) is
begin
for Index in List'Range loop
Ada.Text_IO.Put (Positive'Image (List (Index)));
end loop;
end Put;
begin
Put (Decompose (12));
end Test_Prime;
|
227
|
ada
| 0
|
iyan22/AprendeAda
|
ejercicios1/grafico.adb
|
with ada.text_io, ada.integer_text_io;
use ada.text_io, ada.integer_text_io;
procedure grafico (n1: in Integer) is
begin
for filas in 1..n1 loop
for columnas in 1..n1 loop
if filas>=columnas then
put('*');
else
put('0');
end if;
end loop;
new_line;
end loop;
new_line;
end grafico;
|
228
|
ada
| 76
|
yannickmoy/SPARKNaCl
|
tests/scalarmult6.adb
|
<reponame>yannickmoy/SPARKNaCl<filename>tests/scalarmult6.adb
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;
|
229
|
ada
| 1
|
io7m/coreland-openal-ada
|
openal-list.ads
|
with Ada.Containers.Indefinite_Vectors;
with System;
package OpenAL.List is
package String_Vectors is new Ada.Containers.Indefinite_Vectors
(Index_Type => Positive,
Element_Type => String);
subtype String_Vector_t is String_Vectors.Vector;
procedure Address_To_Vector
(Address : in System.Address;
List : out String_Vector_t);
end OpenAL.List;
|
230
|
ada
| 0
|
ekoeppen/MSP430_Generic_Ada_Drivers
|
boards/msp_exp430g2/mspgd-board.adb
|
with System;
with Startup;
package body MSPGD.Board is
procedure Init is
begin
Clock.Init;
LED_RED.Init;
LED_GREEN.Init;
RX.Init;
TX.Init;
BUTTON.Init;
UART.Init;
end Init;
end MSPGD.Board;
|
231
|
ada
| 4
|
jorge-real/Ball-On-Beam
|
utils/csv_logs.ads
|
<reponame>jorge-real/Ball-On-Beam<filename>utils/csv_logs.ads<gh_stars>1-10
--------------------------------------------------------------------------------
-- --
-- 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;
|
232
|
ada
| 1
|
mullikine/RosettaCodeData
|
Task/Assertions/Ada/assertions-2.ada
|
with Ada.Assertions; use Ada.Assertions;
...
Assert (A = 42, "Oops!");
|
233
|
ada
| 2
|
stcarrez/bbox-ada-api
|
src/bbox-api.ads
|
-----------------------------------------------------------------------
-- bbox -- Bbox API
-- Copyright (C) 2017 <NAME>
-- Written by <NAME> (<EMAIL>)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
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;
|
234
|
ada
| 7
|
best08618/asylo
|
gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/specs/alignment2.ads
|
<gh_stars>1-10
-- { 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;
|
235
|
ada
| 0
|
hergin/ada2fuml
|
test-resources/ExamplesFromRoy/md_example4.ads
|
<reponame>hergin/ada2fuml
with Globals_Example1;
package Md_Example4 is
type T is tagged record
Attribute : Globals_Example1.Itype;
end record;
-- Ada Rules state that all tagged operations must be defined here
function Unrelated (The_I : Globals_Example1.Itype)
return Globals_Example1.Itype;
-- No tagged operations can be defined here because the previous
-- function dosn't involve the tagged type.
end Md_Example4;
|
236
|
ada
| 1
|
zrmyers/VulkanAda
|
src/vulkan-math/vulkan-math.ads
|
--------------------------------------------------------------------------------
-- MIT License
--
-- Copyright (c) 2020 <NAME>
--
-- Permission is hereby granted, free of charge, to any person obtaining a copy
-- of this software and associated documentation files (the "Software"), to deal
-- in the Software without restriction, including without limitation the rights
-- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-- copies of the Software, and to permit persons to whom the Software is
-- furnished to do so, subject to the following conditions:
--
-- The above copyright notice and this permission notice shall be included in all
-- copies or substantial portions of the Software.
--
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-- 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;
|
237
|
ada
| 0
|
JCGobbi/Nucleo-STM32G474RE
|
bb-runtimes/runtimes/ravenscar-full-stm32g474/gnat/s-traceb.adb
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . T R A C E B A C K --
-- --
-- B o d y --
-- --
-- Copyright (C) 1999-2021, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- 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;
|
238
|
ada
| 7
|
best08618/asylo
|
gcc-gcc-7_3_0-release/gcc/ada/a-envvar.ads
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . E N V I R O N M E N T _ V A R I A B L E S --
-- --
-- S p e c --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. In accordance with the copyright of that document, you can freely --
-- 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;
|
239
|
ada
| 52
|
onox/orka
|
orka/src/gl/interface/gl-objects-shaders.ads
|
-- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2013 <NAME> <<EMAIL>>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
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;
|
240
|
ada
| 0
|
JeremyGrosser/usb_embedded
|
tests/support/hex_dump.adb
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2017, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
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;
|
241
|
ada
| 33
|
ytomino/drake
|
source/calendar/machine-apple-darwin/s-naexti.adb
|
<filename>source/calendar/machine-apple-darwin/s-naexti.adb
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;
|
242
|
ada
| 6
|
osannolik/ada-canopen
|
src/aco-od_types.ads
|
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;
|
243
|
ada
| 12
|
TUM-EI-RCS/StratoX
|
software/hal/boards/common/hil/hil-gpio.ads
|
<filename>software/hal/boards/common/hil/hil-gpio.ads<gh_stars>10-100
-- Institution: Technische Universität München
-- Department: Realtime Computer Systems (RCS)
-- Project: StratoX
--
-- Authors: <NAME> (<EMAIL>)
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;
|
244
|
ada
| 4
|
MOUDDENEHamza/ENSEEIHT
|
1A/S5/PIM/projet/src/test_arbre_binaire.adb
|
<filename>1A/S5/PIM/projet/src/test_arbre_binaire.adb<gh_stars>1-10
--------------------------------------------------------------------------------
-- Fichier : arbre_binaire.ads
-- Auteur : <NAME> & <NAME>
-- 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;
|
245
|
ada
| 1
|
skill-lang/skillAdaTestSuite
|
test/unknown/test_unknown-read.ads
|
with Ada.Characters.Handling;
with Ada.Strings.Fixed;
with Ada.Tags;
with Ahven.Framework;
with Unknown.Api;
package Test_Unknown.Read is
package Skill renames Unknown.Api;
use Unknown;
use Unknown.Api;
type Test is new Ahven.Framework.Test_Case with null record;
procedure Initialize (T : in out Test);
procedure Check_Types;
procedure Check_Fields_A;
procedure Check_Fields_C;
end Test_Unknown.Read;
|
246
|
ada
| 24
|
svn2github/matreshka
|
tools/token_transformer/token_generator.adb
|
<filename>tools/token_transformer/token_generator.adb<gh_stars>10-100
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Tools Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2010, <NAME> <<EMAIL>> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $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;
|
247
|
ada
| 2
|
kevinrosalesdev/MathArray-FormalVerification
|
src/matharray.ads
|
<filename>src/matharray.ads
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;
|
248
|
ada
| 0
|
optikos/oasis
|
source/oasis/program-elements-decimal_fixed_point_types.ads
|
-- Copyright (c) 2019 <NAME> <<EMAIL>>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
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;
|
249
|
ada
| 5
|
JeremyGrosser/notcursesada
|
src/notcurses.ads
|
<filename>src/notcurses.ads<gh_stars>1-10
--
-- Copyright 2021 (C) <NAME> <<EMAIL>>
--
-- SPDX-License-Identifier: Apache-2.0
--
with Ada.Unchecked_Conversion;
with Interfaces;
with Interfaces.C.Strings;
with Interfaces.C_Streams;
with Interfaces.C;
with Notcurses_Thin;
package Notcurses is
type Notcurses_Context is private;
type Notcurses_Plane is private;
type Notcurses_Input is record
Id : Wide_Wide_Character;
Y : Interfaces.C.int;
X : Interfaces.C.int;
Alt : Boolean;
Shift : Boolean;
Ctrl : Boolean;
Seqnum : Interfaces.Unsigned_64;
end record;
type Coordinate is record
Y, X : Integer;
end record;
function "+" (Left, Right : Coordinate) return Coordinate;
function "-" (Left, Right : Coordinate) return Coordinate;
Notcurses_Error : exception;
function Version
return String;
private
package Thin renames Notcurses_Thin;
type Notcurses_Context is access all Thin.notcurses;
type Notcurses_Plane is access all Thin.ncplane;
Default_Options : aliased Thin.notcurses_options :=
(termtype => Interfaces.C.Strings.Null_Ptr,
renderfp => Interfaces.C_Streams.NULL_Stream,
loglevel => Thin.NCLOGLEVEL_ERROR,
flags => 0,
others => 0);
Default_Context : Notcurses_Context := null;
function To_Ada is new Ada.Unchecked_Conversion
(Source => Thin.ncinput,
Target => Notcurses_Input);
function To_C is new Ada.Unchecked_Conversion
(Source => Notcurses_Input,
Target => Thin.ncinput);
end Notcurses;
|
250
|
ada
| 2
|
charlie5/cBound
|
tier-2/festival/source/thin/festival-pointer_pointers.ads
|
<reponame>charlie5/cBound<filename>tier-2/festival/source/thin/festival-pointer_pointers.ads
-- This file is generated by SWIG. Please do *not* modify by hand.
--
with festival.Pointers;
with interfaces.C;
package festival.pointer_Pointers is
-- FILE_Pointer_Pointer
--
type FILE_Pointer_Pointer is access all festival.Pointers.FILE_Pointer;
-- ostream_Pointer_Pointer
--
type ostream_Pointer_Pointer is access all festival.Pointers.ostream_Pointer;
-- ModuleDescription_Pointer_Pointer
--
type ModuleDescription_Pointer_Pointer is access all festival.Pointers.ModuleDescription_Pointer;
end festival.pointer_Pointers;
|
251
|
ada
| 1
|
io7m/coreland-opengl-ada
|
opengl-view.adb
|
<filename>opengl-view.adb
with OpenGL.Thin;
package body OpenGL.View is
--
-- Viewport specification.
--
procedure Depth_Range
(Near : in OpenGL.Types.Clamped_Double_t;
Far : in OpenGL.Types.Clamped_Double_t) is
begin
Thin.Depth_Range
(Near_Value => Thin.Double_t (Near),
Far_Value => Thin.Double_t (Far));
end Depth_Range;
procedure Viewport
(Left : in Natural;
Bottom : in Natural;
Width : in Positive;
Height : in Positive) is
begin
Thin.Viewport
(X => Thin.Integer_t (Left),
Y => Thin.Integer_t (Bottom),
Width => Thin.Size_t (Width),
Height => Thin.Size_t (Height));
end Viewport;
end OpenGL.View;
|
252
|
ada
| 15
|
AdaCore/training_material
|
extern/game_support/stm32f4/src/stm32f4-spi.ads
|
------------------------------------------------------------------------------
-- --
-- Hardware Abstraction Layer for STM32 Targets --
-- --
-- Copyright (C) 2014, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This file provides definitions for the STM32F4 (ARM Cortex M4F
-- from ST Microelectronics) Serial Peripheral Interface (SPI) facility.
package STM32F4.SPI is
type SPI_Port is limited private;
type SPI_Data_Direction is
(D2Lines_FullDuplex, D2Lines_RxOnly, D1Line_Rx, D1Line_Tx);
type SPI_Data_Size is (Data_16, Data_8);
type SPI_Mode is (Master, Slave);
type SPI_CLock_Polarity is (High, Low);
type SPI_CLock_Phase is (P1Edge, P2Edge);
type SPI_Slave_Management is (Soft, Hard);
type SPI_Baud_Rate_Prescaler is
(BRP_2, BRP_4, BRP_8, BRP_16, BRP_32, BRP_64, BRP_128, BRP_256);
type SPI_First_Bit is (MSB, LSB);
type SPI_Configuration is record
Direction : SPI_Data_Direction;
Mode : SPI_Mode;
Data_Size : SPI_Data_Size;
Clock_Polarity : SPI_Clock_Polarity;
Clock_Phase : SPI_Clock_Phase;
Slave_Management : SPI_Slave_Management;
Baud_Rate_Prescaler : SPI_Baud_Rate_Prescaler;
First_Bit : SPI_First_Bit;
CRC_Poly : Half_Word;
end record;
procedure Configure (Port : in out SPI_Port; Conf : SPI_Configuration);
procedure Enable (Port : in out SPI_Port);
procedure Disable (Port : in out SPI_Port);
function Enabled (Port : SPI_Port) return Boolean;
procedure Send (Port : in out SPI_Port; Data : Half_Word);
function Data (Port : SPI_Port) return Half_Word
with Inline;
procedure Send (Port : in out SPI_Port; Data : Byte);
function Data (Port : SPI_Port) return Byte
with Inline;
function Rx_Is_Empty (Port : SPI_Port) return Boolean
with Inline;
function Tx_Is_Empty (Port : SPI_Port) return Boolean
with Inline;
function Busy (Port : SPI_Port) return Boolean
with Inline;
function Channel_Side_Indicated (Port : SPI_Port) return Boolean
with Inline;
function Underrun_Indicated (Port : SPI_Port) return Boolean
with Inline;
function CRC_Error_Indicated (Port : SPI_Port) return Boolean
with Inline;
function Mode_Fault_Indicated (Port : SPI_Port) return Boolean
with Inline;
function Overrun_Indicated (Port : SPI_Port) return Boolean
with Inline;
function Frame_Fmt_Error_Indicated (Port : SPI_Port) return Boolean
with Inline;
private
type SPI_Control_Register is record
Clock_Phase : Bits_1;
Clock_Polarity : Bits_1;
Master_Select : Bits_1;
Baud_Rate_Ctrl : Bits_3;
SPI_Enable : Bits_1;
LSB_First : Bits_1; -- Frame Format
Slave_Select : Bits_1;
Soft_Slave_Mgt : Bits_1; -- Software Slave Management
RXOnly : Bits_1;
Data_Frame_Fmt : Bits_1; -- 1=16-bit 0=8-bit
CRC_Next : Bits_1; -- 1=CRC Phase 0=No CRC Phase
CRC_Enable : Bits_1;
Output_BiDir : Bits_1; -- Output enable in bidirectional mode
BiDir_Mode : Bits_1; -- Bidirectional data mode enable
end record with Pack, Volatile, Size => 16;
type SPI_Control_Register2 is record
RX_DMA_Enable : Bits_1;
TX_DMA_Enable : Bits_1;
SS_Out_Enable : Bits_1;
Reserved_1 : Bits_1;
Frame_Fmt : Bits_1; -- 0=Motorola Mode 1=TI Mode
Err_Int_Enable : Bits_1;
RX_Not_Empty_Int_Enable : Bits_1;
TX_Empty_Int_Enable : Bits_1;
Reserved_2 : Bits_8;
end record with Pack, Volatile, Size => 16;
type SPI_I2S_Config_Register is record
Channel_Length : Bits_1;
Data_Length : Bits_2;
Clock_Polarity : Bits_1;
I2S_Standard : Bits_2; -- 00==Philips 01=MSB (L) 10=LSB (R) 11=PCM
Reserved_1 : Bits_1;
PCM_Frame_Sync : Bits_1; -- 0=Short 1=Long
Config_Mode : Bits_2; -- 00=SlaveTX 01=SlaveRX 10=MasterTX11=MasterRX
Enable : Bits_1;
Mode_Select : Bits_1; -- 0=SPI Mode 1=I2S Mode
Reserved_2 : Bits_4;
end record with Pack, Volatile, Size => 16;
type SPI_I2S_Prescale_Register is record
Linear_Prescler : Bits_8;
Odd_Factor : Bits_1;
Master_CLK_Out_Enable : Bits_1;
Reserved : Bits_6;
end record with Pack, Volatile, Size => 16;
type SPI_Status_Register is record
RX_Buffer_Not_Empty : Boolean;
TX_Buffer_Empty : Boolean;
Channel_Side : Boolean;
Underrun_Flag : Boolean;
CRC_Error_Flag : Boolean;
Mode_Fault : Boolean;
Overrun_Flag : Boolean;
Busy_Flag : Boolean;
Frame_Fmt_Error : Boolean;
Reserved : Bits_7;
end record with Pack, Volatile, Size => 16;
type SPI_Port is record
CTRL1 : SPI_Control_Register;
Reserved_1 : Half_Word;
CTRL2 : SPI_Control_Register2;
Reserved_2 : Half_Word;
Status : SPI_Status_Register;
Reserved_3 : Half_Word;
Data : Half_Word;
Reserved_4 : Half_Word;
CRC_Poly : Half_Word; -- Default = 16#0007#
Reserved_5 : Half_Word;
RX_CRC : Half_Word;
Reserved_6 : Half_Word;
TX_CRC : Half_Word;
Reserved_7 : Half_Word;
I2S_Conf : SPI_I2S_Config_Register;
Reserved_8 : Half_Word;
I2S_PreScal : SPI_I2S_Prescale_Register;
Reserved_9 : Half_Word;
end record with Pack, Volatile, Size => 9 * 32;
end STM32F4.SPI;
|
253
|
ada
| 0
|
zdimension/tdinfo302
|
src/tp3_niget.adb
|
<reponame>zdimension/tdinfo302
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Integer_Text_IO; use Ada.Integer_Text_IO;
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Ada.Strings.Maps.Constants;
-- NIGET TOM PEIP2-B2
-- IMPORTANT !
-- Si vous utilisez GNAT ou une vieille version d'Ada pas aux normes,
-- décommentez la ligne ci-dessous et commentez celle juste après
--with Ada.Strings.Unbounded_Text_IO; use Ada.Strings.Unbounded_Text_IO;
with Ada.Text_IO.Unbounded_IO; use Ada.Text_IO.Unbounded_IO;
procedure tp3_niget is
type T_Couleur_Vin is (Rouge, Blanc, Rose);
-- pour l'affichage
Couleur_Vin_Aff : array (T_Couleur_Vin) of Unbounded_String :=
(
To_Unbounded_String("rouge"),
To_Unbounded_String("blanc"),
To_Unbounded_String("rosé")
);
type T_Région is
(
Alsace, Beaujolais, Bordeaux, Bourgogne, Chablis, Champagne,
Corse, Jura, Languedoc_Roussillon, Loire, Provence, Rhone,
Savoie, Sud_Ouest
);
-- pour l'affichage
Région_Aff : array (T_Région) of Unbounded_String :=
(
To_Unbounded_String("Alsace"), To_Unbounded_String("Beaujolais"),
To_Unbounded_String("Bordeaux"), To_Unbounded_String("Bourgogne"),
To_Unbounded_String("Chablis"), To_Unbounded_String("Champagne"),
To_Unbounded_String("Corse"), To_Unbounded_String("Jura"),
To_Unbounded_String("Languedoc-Roussillon"), To_Unbounded_String("Loire"),
To_Unbounded_String("Provence"), To_Unbounded_String("Rhône"),
To_Unbounded_String("Savoie"), To_Unbounded_String("Sud-Ouest")
);
type T_Vin is
record
Nom : Unbounded_String;
Région : T_Région;
Couleur : T_Couleur_Vin;
Millésime : Integer;
Quantité : Natural;
end record;
TAILLE_CAVE : constant Positive := 40;
Cave : array (1..TAILLE_CAVE) of T_Vin;
subtype Pos_Vin is Integer range Cave'Range;
-- nombre de cases occupées de Cave
Cave_NB : Natural range 0..TAILLE_CAVE := 0;
-- pose une question fermée
function Choix(Msg : Unbounded_String) return Boolean is
Rep : Character;
begin
Put(Msg & " [O/N] ");
Get(Rep);
return Rep = 'O' or Rep = 'o';
end Choix;
-- a < b : -1
-- a = b : 0
-- a > b : 1
subtype Comparaison is Integer range -1..1;
-- compare deux chaînes sans se préoccuper de la casse
function Compare_Chaines(A, B : Unbounded_String) return Comparaison is
X : Unbounded_String := A;
Y : Unbounded_String := B;
begin
-- passage en minuscule pour mettre X et Y sur un pied d'égalité
-- pour éviter les 'z' > 'A' et autres loufoqueries des comparateurs d'Ada
Ada.Strings.Unbounded.Translate(X, Ada.Strings.Maps.Constants.Lower_Case_Map);
Ada.Strings.Unbounded.Translate(Y, Ada.Strings.Maps.Constants.Lower_Case_Map);
if X > Y then
return 1;
elsif X < Y then
return -1;
else
return 0;
end if;
end Compare_Chaines;
-- détermine l'emplacement où insérer un nouveau vin
-- par recherche dichotomique
function Indice_Correct(Q : Unbounded_String) return Pos_Vin is
-- bornes
A : Pos_Vin := 1;
B : Pos_Vin;
-- milieu de l'intervalle
Mid : Pos_Vin;
-- valeur à comparer
Val : Unbounded_String;
-- résultat de comparaison
Comp : Comparaison;
begin
-- si la cave est vide, on insère au début
if Cave_NB = 0 then
return 1;
else
B := Cave_NB;
end if;
while A < B loop
Mid := (A + B) / 2;
Val := Cave(Mid).Nom;
Comp := Compare_Chaines(Q, Val);
if Comp = 0 then
return Mid + 1; -- +1 pour ajouter à la fin d'une suite d'éléments équivalents et non au début
elsif Comp = -1 then
B := Mid;
elsif Comp = 1 then
if A = Mid then
return B + 1;
end if;
A := Mid;
end if;
end loop;
return B;
end Indice_Correct;
-- vérifie si la cave est vide, affiche une erreur le cas échéant
function Verif_Vide return Boolean is
begin
if Cave_NB = 0 then
Put_Line("*** La cave est vide ! ***");
return True;
end if;
return False;
end Verif_Vide;
-- affiche les caractéristiques d'un vin
procedure Aff_Vin(Vin : T_Vin) is
begin
Put_Line(Vin.Nom
& " - vin " & Couleur_Vin_Aff(Vin.Couleur)
& " d'origine " & Région_Aff(Vin.Région)
& ", millésime" & Integer'Image(Vin.Millésime)
& ", stock :" & Integer'Image(Vin.Quantité));
end Aff_Vin;
-- liste les vins
procedure A_Liste_Vins is
begin
if Verif_Vide then return; end if;
Put_Line("Il y a" & Integer'Image(Cave_NB) & " vins :");
for i in 1..Cave_NB loop
Put(Integer'Image(i) & "- ");
Aff_Vin(Cave(i));
end loop;
end A_Liste_Vins;
-- demande à l'utilisateur de choisir un vin
function Choisir_Vin return Pos_Vin is
N_Vin : Integer;
begin
A_Liste_Vins;
loop
Put_Line("Veuillez saisir le numéro du vin.");
Put("> ");
Get(N_Vin);
exit when N_Vin in 1..Cave_NB;
Put_Line("*** Numéro de vin incorrect ! ***");
end loop;
return N_Vin;
end Choisir_Vin;
-- insère un vin à la position spécifiée
-- pour cela, décale vers la droite celles qui sont dans le chemin
procedure Insérer_Vin(Vin : T_Vin; Pos : Pos_Vin) is
begin
for i in reverse Pos..Cave_NB loop
Cave(i + 1) := Cave(i);
end loop;
Cave(Pos) := Vin;
Cave_NB := Cave_NB + 1;
end Insérer_Vin;
-- supprime le vin à la position spécifiée
procedure A_Suppr_Vin(N : Integer := -1) is
N_Vin : Pos_Vin;
begin
if N not in Pos_Vin'Range then
N_Vin := Choisir_Vin;
else
N_Vin := N;
end if;
if not Choix(To_Unbounded_String("*** Cette action est irréversible ! Êtes-vous sûr(e) ? ***")) then
return;
end if;
Put_Line("*** Suppression de " & Cave(N_Vin).Nom & " ***");
for i in N_Vin..Cave_NB loop
Cave(i) := Cave(i + 1);
end loop;
Cave_NB := Cave_NB - 1;
end A_Suppr_Vin;
procedure A_Ajout_Bouteille(N : Integer := -1) is
N_Vin : Pos_Vin;
Quant : Positive;
begin
if Verif_Vide then return; end if;
if N not in Pos_Vin'Range then
N_Vin := Choisir_Vin;
else
N_Vin := N;
end if;
Put("Nombre de bouteilles à ajouter au stock : ");
Get(Quant);
Cave(N_Vin).Quantité := Cave(N_Vin).Quantité + Quant;
end A_Ajout_Bouteille;
-- lit et ajoute un ou plusieurs vins
procedure A_Ajout_Vin is
Vin : T_Vin;
Ent : Integer;
Existe : Boolean := False;
begin
loop
if Cave_NB = TAILLE_CAVE then
Put_Line("*** La cave est pleine ! ***");
exit;
end if;
-- efface le buffer d'entrée pour éviter de
-- relire le retour chariot précédemment entré
-- lors du choix de l'opération
Skip_Line;
Put_Line("Veuillez saisir les informations du vin.");
Put("Nom : ");
Vin.Nom := Get_Line;
Existe := False;
for i in Cave'Range loop
if Compare_Chaines(Cave(i).Nom, Vin.Nom) = 0 then
Put_Line("*** Le vin est déjà présent dans la base, entrée en mode ajout de bouteille ***");
A_Ajout_Bouteille(i);
Existe := True;
end if;
end loop;
if not Existe then
for r in T_Région'Range loop
Put_Line(Integer'Image(T_Région'Pos(r) + 1) & "- " & Région_Aff(r));
end loop;
loop
Put("Région : ");
Get(Ent);
exit when Ent in 1..(T_Région'Pos(T_Région'Last) + 1);
Put_Line("*** Numéro de région incorrect ! ***");
end loop;
Vin.Région := T_Région'Val(Ent - 1);
for r in T_Couleur_Vin'Range loop
Put_Line(Integer'Image(T_Couleur_Vin'Pos(r) + 1) & "- " & Couleur_Vin_Aff(r));
end loop;
loop
Put("Couleur : ");
Get(Ent);
exit when Ent in 1..(T_Couleur_Vin'Pos(T_Couleur_Vin'Last) + 1);
Put_Line("*** Numéro de couleur incorrect ! ***");
end loop;
Vin.Couleur := T_Couleur_Vin'Val(Ent - 1);
Put("Millésime : ");
Get(Vin.Millésime);
Put("Quantité : ");
Get(Vin.Quantité);
Insérer_Vin(Vin, Indice_Correct(Vin.Nom));
end if;
exit when not Choix(To_Unbounded_String("Voulez-vous ajouter un autre vin ?"));
end loop;
end A_Ajout_Vin;
-- lit et sort une ou plusieures bouteilles
procedure A_Sortir_Bouteille is
N_Vin : Integer;
N_Quant : Integer;
begin
loop
if Verif_Vide then return; end if;
N_Vin := Choisir_Vin;
loop
Put_Line("Combien de bouteilles voulez-vous sortir ?");
Put("> ");
Get(N_Quant);
exit when N_Quant in 1..Cave(N_Vin).Quantité;
Put_Line("*** La quantité doit être entre 1 et " & Integer'Image(Cave(N_Vin).Quantité) & " ! ***");
end loop;
Cave(N_Vin).Quantité := Cave(N_Vin).Quantité - N_Quant;
if Cave(N_Vin).Quantité = 0 then
Put_Line("*** Le vin est en rupture de stock ***");
if Choix(To_Unbounded_String("*** Voulez-vous le supprimer de la base ? ***")) then
A_Suppr_Vin(N_Vin);
end if;
end if;
A_Liste_Vins;
exit when not Choix(To_Unbounded_String("Voulez-vous sortir une autre bouteille ?"));
end loop;
end A_Sortir_Bouteille;
Action : Character;
begin
-- mettre à True pour charger des données d'exemple
-- pour ne pas avoir à tout saisir à la main
if True then
Cave
:= (
(To_Unbounded_String("Beaujolais AOC"),Beaujolais,Rouge,2000,7),
(To_Unbounded_String("Chablis AOC"),Bourgogne,Blanc,2017,11),
(To_Unbounded_String("Côtes de Provence"),Provence,Rose,1999,11),
(To_Unbounded_String("Saint-Emilion"),Bordeaux,Rouge,2003,3),
others => <>
);
Cave_NB := 4;
end if;
loop
-- affichage du menu
Put_Line("Choisissez une opération à effectuer :");
Put_Line(" 1- Ajouter un vin");
Put_Line(" 2- Supprimer un vin");
Put_Line(" 3- Ajouter une bouteille");
Put_Line(" 4- Sortir une bouteille");
Put_Line(" 5- Afficher la liste des vins");
Put_Line(" 6- Quitter");
Put("> ");
Get(Action);
New_Line;
case Action is
when '1' => A_Ajout_Vin;
when '2' => A_Suppr_Vin;
when '3' => A_Ajout_Bouteille;
when '4' => A_Sortir_Bouteille;
when '5' => A_Liste_Vins;
when '6' => exit;
when others => Put_Line("*** Numéro d'opération incorrect ! ***");
end case;
New_Line;
end loop;
end tp3_niget;
|
254
|
ada
| 1
|
TamaMcGlinn/ada_raspio
|
src/raspio.ads
|
<reponame>TamaMcGlinn/ada_raspio
package Raspio is
Initialization_Error : exception;
procedure Initialize;
end Raspio;
|
255
|
ada
| 12
|
TUM-EI-RCS/StratoX
|
software/unittest/estimator/src/fakedev/nvram.ads
|
<filename>software/unittest/estimator/src/fakedev/nvram.ads
-- Institution: Technische Universität München
-- Department: Real-Time Computer Systems (RCS)
-- Project: StratoX
-- Authors: <NAME> (<EMAIL>)
with Interfaces; use Interfaces;
with HIL;
-- @summary
-- read/write from/to a non-volatile location. Every "variable"
-- has one byte. When the compilation date/time changed, all
-- variables are reset to their respective defaults. Otherwise
-- NVRAM keeps values across reboot/loss of power.
package NVRAM with SPARK_Mode,
Abstract_State => Memory_State
is
procedure Init;
-- initialize this module and possibly underlying hardware
procedure Self_Check (Status : out Boolean);
-- check whether initialization was successful
-- List of all variables stored in NVRAM. Add new ones when needed.
type Variable_Name is (VAR_MISSIONSTATE,
VAR_BOOTCOUNTER,
VAR_EXCEPTION_LINE_L,
VAR_EXCEPTION_LINE_H,
VAR_START_TIME_A,
VAR_START_TIME_B,
VAR_START_TIME_C,
VAR_START_TIME_D,
VAR_HOME_HEIGHT_L,
VAR_HOME_HEIGHT_H,
VAR_GPS_TARGET_LONG_A,
VAR_GPS_TARGET_LONG_B,
VAR_GPS_TARGET_LONG_C,
VAR_GPS_TARGET_LONG_D,
VAR_GPS_TARGET_LAT_A,
VAR_GPS_TARGET_LAT_B,
VAR_GPS_TARGET_LAT_C,
VAR_GPS_TARGET_LAT_D,
VAR_GPS_TARGET_ALT_A,
VAR_GPS_TARGET_ALT_B,
VAR_GPS_TARGET_ALT_C,
VAR_GPS_TARGET_ALT_D,
VAR_GPS_LAST_LONG_A,
VAR_GPS_LAST_LONG_B,
VAR_GPS_LAST_LONG_C,
VAR_GPS_LAST_LONG_D,
VAR_GPS_LAST_LAT_A,
VAR_GPS_LAST_LAT_B,
VAR_GPS_LAST_LAT_C,
VAR_GPS_LAST_LAT_D,
VAR_GPS_LAST_ALT_A,
VAR_GPS_LAST_ALT_B,
VAR_GPS_LAST_ALT_C,
VAR_GPS_LAST_ALT_D,
VAR_GYRO_BIAS_X,
VAR_GYRO_BIAS_Y,
VAR_GYRO_BIAS_Z
);
-- Default values for all variables (obligatory)
type Defaults_Table is array (Variable_Name'Range) of HIL.Byte;
Variable_Defaults : constant Defaults_Table :=
(VAR_MISSIONSTATE => 0,
VAR_BOOTCOUNTER => 0,
VAR_EXCEPTION_LINE_L => 0,
VAR_EXCEPTION_LINE_H => 0,
VAR_START_TIME_A => 0,
VAR_START_TIME_B => 0,
VAR_START_TIME_C => 0,
VAR_START_TIME_D => 0,
VAR_HOME_HEIGHT_L => 0,
VAR_HOME_HEIGHT_H => 0,
VAR_GPS_TARGET_LONG_A => 0,
VAR_GPS_TARGET_LONG_B => 0,
VAR_GPS_TARGET_LONG_C => 0,
VAR_GPS_TARGET_LONG_D => 0,
VAR_GPS_TARGET_LAT_A => 0,
VAR_GPS_TARGET_LAT_B => 0,
VAR_GPS_TARGET_LAT_C => 0,
VAR_GPS_TARGET_LAT_D => 0,
VAR_GPS_TARGET_ALT_A => 0,
VAR_GPS_TARGET_ALT_B => 0,
VAR_GPS_TARGET_ALT_C => 0,
VAR_GPS_TARGET_ALT_D => 0,
VAR_GPS_LAST_LONG_A => 0,
VAR_GPS_LAST_LONG_B => 0,
VAR_GPS_LAST_LONG_C => 0,
VAR_GPS_LAST_LONG_D => 0,
VAR_GPS_LAST_LAT_A => 0,
VAR_GPS_LAST_LAT_B => 0,
VAR_GPS_LAST_LAT_C => 0,
VAR_GPS_LAST_LAT_D => 0,
VAR_GPS_LAST_ALT_A => 0,
VAR_GPS_LAST_ALT_B => 0,
VAR_GPS_LAST_ALT_C => 0,
VAR_GPS_LAST_ALT_D => 0,
VAR_GYRO_BIAS_X => 20, -- Bias in deci degree
VAR_GYRO_BIAS_Y => 26,
VAR_GYRO_BIAS_Z => 128-3+128 -- most evil hack ever
);
procedure Load (variable : in Variable_Name; data : out HIL.Byte);
-- read variable with given name from NVRAM and return value
procedure Load (variable : in Variable_Name; data : out Float)
with Pre => Variable_Name'Pos (variable) < Variable_Name'Pos (Variable_Name'Last) - 3;
-- same, but with Float convenience conversion. Point to first variable of the quadrupel.
procedure Store (variable : in Variable_Name; data : in HIL.Byte);
-- write variable with given name to NVRAM.
procedure Store (variable : in Variable_Name; data : in Float)
with Pre => Variable_Name'Pos (variable) < Variable_Name'Pos (Variable_Name'Last) - 3;
-- same, but with Float convenience conversion. Point to first variable of the quadrupel.
procedure Reset;
-- explicit reset of NVRAM to defaults; same effect as re-compiling.
end NVRAM;
|
256
|
ada
| 0
|
TNO/Dependency_Graph_Extractor-Ada
|
src/extraction.adb
|
<gh_stars>0
with Ada.Exceptions;
with Ada.Strings.Equal_Case_Insensitive;
with Ada.Text_IO;
with Extraction.Bodies_For_Decls;
with Extraction.Bodies_For_Entries;
with Extraction.Decls;
with Extraction.Deferred_Constants;
with Extraction.Derived_Type_Defs;
with Extraction.Direct_Calls;
with Extraction.File_System;
with Extraction.Generic_Instantiations;
with Extraction.Graph_Operations;
with Extraction.Node_Edge_Types;
with Extraction.Primitive_Subps;
with Extraction.Project_Files;
with Extraction.References_Of_Decls;
with Extraction.Renamings;
with Extraction.Source_Files_From_Projects;
with Extraction.Subp_Overrides;
with Extraction.Decl_Types;
with Extraction.Utilities;
with Extraction.With_Clauses;
package body Extraction is
-- TODO: Improve node naming such that line numbers are not needed
-- TODO: Relate arguments in generic instantiations with formal parameters
-- of generics
use type VFS.Filesystem_String;
use type VFS.Virtual_File;
function Node_Attributes return GW.Attribute_Definition_Sets.Map renames
Node_Edge_Types.Node_Attributes;
function Edge_Attributes return GW.Attribute_Definition_Sets.Map renames
Node_Edge_Types.Edge_Attributes;
procedure Extract_Dependency_Graph
(Project_Filename : String; Recurse_Projects : Boolean;
Directory_Prefix : VFS.Virtual_File; Graph_File : in out GW.GraphML_File)
is
Context : constant Utilities.Project_Context :=
Utilities.Open_Project (Project_Filename);
Projects : constant Utilities.Project_Vectors.Vector :=
Utilities.Get_Projects (Context, Recurse_Projects);
Units : constant Utilities.Analysis_Unit_Vectors.Vector :=
Utilities.Open_Analysis_Units (Context, Recurse_Projects);
Graph : constant Graph_Operations.Graph_Context :=
Graph_Operations.Create_Graph_Context
(Graph_File'Unchecked_Access, Directory_Prefix, Context);
procedure Handle_Exception
(E : Ada.Exceptions.Exception_Occurrence; Node : LAL.Ada_Node'Class);
procedure Handle_Exception
(E : Ada.Exceptions.Exception_Occurrence; Node : LAL.Ada_Node'Class)
is
Message : constant String := Ada.Exceptions.Exception_Message (E);
begin
if not Ada.Strings.Equal_Case_Insensitive (Message, "memoized error")
then
Ada.Text_IO.Put_Line
("Encountered Libadalang problem: " & Message);
Node.Print;
end if;
end Handle_Exception;
function Node_Visitor
(Node : LAL.Ada_Node'Class) return LALCO.Visit_Status;
function Node_Visitor
(Node : LAL.Ada_Node'Class) return LALCO.Visit_Status
is
begin
-- TODO: Remove exception block once all libadalang problems
-- have been fixed.
begin
Decls.Extract_Nodes (Node, Graph);
Subp_Overrides.Extract_Nodes (Node, Graph);
Primitive_Subps.Extract_Nodes (Node, Graph);
References_Of_Decls.Extract_Nodes (Node, Graph);
exception
when E : LALCO.Property_Error =>
Handle_Exception (E, Node);
end;
return LALCO.Into;
end Node_Visitor;
function Edge_Visitor
(Node : LAL.Ada_Node'Class) return LALCO.Visit_Status;
function Edge_Visitor
(Node : LAL.Ada_Node'Class) return LALCO.Visit_Status
is
begin
-- TODO: Remove exception block once all libadalang problems
-- have been fixed.
begin
Decls.Extract_Edges (Node, Graph);
Subp_Overrides.Extract_Edges (Node, Graph);
Primitive_Subps.Extract_Edges (Node, Graph);
Generic_Instantiations.Extract_Edges (Node, Graph);
References_Of_Decls.Extract_Edges (Node, Graph);
Bodies_For_Decls.Extract_Edges (Node, Graph);
Bodies_For_Entries.Extract_Edges (Node, Graph);
Renamings.Extract_Edges (Node, Graph);
Direct_Calls.Extract_Edges (Node, Graph);
With_Clauses.Extract_Edges (Node, Graph);
Derived_Type_Defs.Extract_Edges (Node, Graph);
Decl_Types.Extract_Edges (Node, Graph);
Deferred_Constants.Extract_Edges (Node, Graph);
exception
when E : LALCO.Property_Error =>
Handle_Exception (E, Node);
end;
return LALCO.Into;
end Edge_Visitor;
begin
-- Node extraction
-- File_System.Extract_Nodes should occur before the extraction of any
-- other kind of node (see also the implementation of
-- Get_Node_Attributes in Extraction.Node_Edge_Types).
if Directory_Prefix /= VFS.No_File then
File_System.Extract_Nodes (Directory_Prefix, Graph);
end if;
for Project of Projects loop
Ada.Text_IO.Put_Line
("-- " & (+Project.Project_Path.Full_Name) & " --");
Project_Files.Extract_Nodes (Project, Graph);
Source_Files_From_Projects.Extract_Nodes (Project, Graph);
end loop;
for Unit of Units loop
Ada.Text_IO.Put_Line ("-- " & Unit.Get_Filename & " --");
Unit.Root.Traverse (Node_Visitor'Access);
end loop;
-- Edge extraction.
if Directory_Prefix /= VFS.No_File then
File_System.Extract_Edges (Directory_Prefix, Graph);
end if;
for Project of Projects loop
Ada.Text_IO.Put_Line
("== " & (+Project.Project_Path.Full_Name) & " ==");
Project_Files.Extract_Edges (Project, Recurse_Projects, Graph);
Source_Files_From_Projects.Extract_Edges
(Project, Context, Recurse_Projects, Graph);
end loop;
for Unit of Units loop
Ada.Text_IO.Put_Line ("== " & Unit.Get_Filename & " ==");
Unit.Root.Traverse (Edge_Visitor'Access);
end loop;
end Extract_Dependency_Graph;
end Extraction;
|
257
|
ada
| 0
|
djamal2727/Main-Bearing-Analytical-Model
|
Validation/pyFrame3DD-master/gcc-master/gcc/ada/sem_dim.adb
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S E M _ D I M --
-- --
-- B o d y --
-- --
-- Copyright (C) 2011-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Aspects; use Aspects;
with Atree; use Atree;
with Einfo; use Einfo;
with Errout; use Errout;
with Exp_Util; use Exp_Util;
with Lib; use Lib;
with Namet; use Namet;
with Nlists; use Nlists;
with Nmake; use Nmake;
with Opt; use Opt;
with Rtsfind; use Rtsfind;
with Sem; use Sem;
with Sem_Aux; use Sem_Aux;
with Sem_Eval; use Sem_Eval;
with Sem_Res; use Sem_Res;
with Sem_Util; use Sem_Util;
with Sinfo; use Sinfo;
with Snames; use Snames;
with Stand; use Stand;
with Stringt; use Stringt;
with Table;
with Tbuild; use Tbuild;
with Uintp; use Uintp;
with Urealp; use Urealp;
with GNAT.HTable;
package body Sem_Dim is
-------------------------
-- Rational Arithmetic --
-------------------------
type Whole is new Int;
subtype Positive_Whole is Whole range 1 .. Whole'Last;
type Rational is record
Numerator : Whole;
Denominator : Positive_Whole;
end record;
Zero : constant Rational := Rational'(Numerator => 0,
Denominator => 1);
No_Rational : constant Rational := Rational'(Numerator => 0,
Denominator => 2);
-- Used to indicate an expression that cannot be interpreted as a rational
-- Returned value of the Create_Rational_From routine when parameter Expr
-- is not a static representation of a rational.
-- Rational constructors
function "+" (Right : Whole) return Rational;
function GCD (Left, Right : Whole) return Int;
function Reduce (X : Rational) return Rational;
-- Unary operator for Rational
function "-" (Right : Rational) return Rational;
function "abs" (Right : Rational) return Rational;
-- Rational operations for Rationals
function "+" (Left, Right : Rational) return Rational;
function "-" (Left, Right : Rational) return Rational;
function "*" (Left, Right : Rational) return Rational;
function "/" (Left, Right : Rational) return Rational;
------------------
-- System Types --
------------------
Max_Number_Of_Dimensions : constant := 7;
-- Maximum number of dimensions in a dimension system
High_Position_Bound : constant := Max_Number_Of_Dimensions;
Invalid_Position : constant := 0;
Low_Position_Bound : constant := 1;
subtype Dimension_Position is
Nat range Invalid_Position .. High_Position_Bound;
type Name_Array is
array (Dimension_Position range
Low_Position_Bound .. High_Position_Bound) of Name_Id;
-- Store the names of all units within a system
No_Names : constant Name_Array := (others => No_Name);
type Symbol_Array is
array (Dimension_Position range
Low_Position_Bound .. High_Position_Bound) of String_Id;
-- Store the symbols of all units within a system
No_Symbols : constant Symbol_Array := (others => No_String);
-- The following record should be documented field by field
type System_Type is record
Type_Decl : Node_Id;
Unit_Names : Name_Array;
Unit_Symbols : Symbol_Array;
Dim_Symbols : Symbol_Array;
Count : Dimension_Position;
end record;
Null_System : constant System_Type :=
(Empty, No_Names, No_Symbols, No_Symbols, Invalid_Position);
subtype System_Id is Nat;
-- The following table maps types to systems
package System_Table is new Table.Table (
Table_Component_Type => System_Type,
Table_Index_Type => System_Id,
Table_Low_Bound => 1,
Table_Initial => 5,
Table_Increment => 5,
Table_Name => "System_Table");
--------------------
-- Dimension Type --
--------------------
type Dimension_Type is
array (Dimension_Position range
Low_Position_Bound .. High_Position_Bound) of Rational;
Null_Dimension : constant Dimension_Type := (others => Zero);
type Dimension_Table_Range is range 0 .. 510;
function Dimension_Table_Hash (Key : Node_Id) return Dimension_Table_Range;
-- The following table associates nodes with dimensions
package Dimension_Table is new
GNAT.HTable.Simple_HTable
(Header_Num => Dimension_Table_Range,
Element => Dimension_Type,
No_Element => Null_Dimension,
Key => Node_Id,
Hash => Dimension_Table_Hash,
Equal => "=");
------------------
-- Symbol Types --
------------------
type Symbol_Table_Range is range 0 .. 510;
function Symbol_Table_Hash (Key : Entity_Id) return Symbol_Table_Range;
-- Each subtype with a dimension has a symbolic representation of the
-- related unit. This table establishes a relation between the subtype
-- and the symbol.
package Symbol_Table is new
GNAT.HTable.Simple_HTable
(Header_Num => Symbol_Table_Range,
Element => String_Id,
No_Element => No_String,
Key => Entity_Id,
Hash => Symbol_Table_Hash,
Equal => "=");
-- The following array enumerates all contexts which may contain or
-- produce a dimension.
OK_For_Dimension : constant array (Node_Kind) of Boolean :=
(N_Attribute_Reference => True,
N_Case_Expression => True,
N_Expanded_Name => True,
N_Explicit_Dereference => True,
N_Defining_Identifier => True,
N_Function_Call => True,
N_Identifier => True,
N_If_Expression => True,
N_Indexed_Component => True,
N_Integer_Literal => True,
N_Op_Abs => True,
N_Op_Add => True,
N_Op_Divide => True,
N_Op_Expon => True,
N_Op_Minus => True,
N_Op_Mod => True,
N_Op_Multiply => True,
N_Op_Plus => True,
N_Op_Rem => True,
N_Op_Subtract => True,
N_Qualified_Expression => True,
N_Real_Literal => True,
N_Selected_Component => True,
N_Slice => True,
N_Type_Conversion => True,
N_Unchecked_Type_Conversion => True,
others => False);
-----------------------
-- Local Subprograms --
-----------------------
procedure Analyze_Dimension_Assignment_Statement (N : Node_Id);
-- Subroutine of Analyze_Dimension for assignment statement. Check that the
-- dimensions of the left-hand side and the right-hand side of N match.
procedure Analyze_Dimension_Binary_Op (N : Node_Id);
-- Subroutine of Analyze_Dimension for binary operators. Check the
-- dimensions of the right and the left operand permit the operation.
-- Then, evaluate the resulting dimensions for each binary operator.
procedure Analyze_Dimension_Component_Declaration (N : Node_Id);
-- Subroutine of Analyze_Dimension for component declaration. Check that
-- the dimensions of the type of N and of the expression match.
procedure Analyze_Dimension_Extended_Return_Statement (N : Node_Id);
-- Subroutine of Analyze_Dimension for extended return statement. Check
-- that the dimensions of the returned type and of the returned object
-- match.
procedure Analyze_Dimension_Has_Etype (N : Node_Id);
-- Subroutine of Analyze_Dimension for a subset of N_Has_Etype denoted by
-- the list below:
-- N_Attribute_Reference
-- N_Identifier
-- N_Indexed_Component
-- N_Qualified_Expression
-- N_Selected_Component
-- N_Slice
-- N_Type_Conversion
-- N_Unchecked_Type_Conversion
procedure Analyze_Dimension_Case_Expression (N : Node_Id);
-- Verify that all alternatives have the same dimension
procedure Analyze_Dimension_If_Expression (N : Node_Id);
-- Verify that all alternatives have the same dimension
procedure Analyze_Dimension_Number_Declaration (N : Node_Id);
-- Procedure to analyze dimension of expression in a number declaration.
-- This allows a named number to have nontrivial dimensions, while by
-- default a named number is dimensionless.
procedure Analyze_Dimension_Object_Declaration (N : Node_Id);
-- Subroutine of Analyze_Dimension for object declaration. Check that
-- the dimensions of the object type and the dimensions of the expression
-- (if expression is present) match. Note that when the expression is
-- a literal, no error is returned. This special case allows object
-- declaration such as: m : constant Length := 1.0;
procedure Analyze_Dimension_Object_Renaming_Declaration (N : Node_Id);
-- Subroutine of Analyze_Dimension for object renaming declaration. Check
-- the dimensions of the type and of the renamed object name of N match.
procedure Analyze_Dimension_Simple_Return_Statement (N : Node_Id);
-- Subroutine of Analyze_Dimension for simple return statement
-- Check that the dimensions of the returned type and of the returned
-- expression match.
procedure Analyze_Dimension_Subtype_Declaration (N : Node_Id);
-- Subroutine of Analyze_Dimension for subtype declaration. Propagate the
-- dimensions from the parent type to the identifier of N. Note that if
-- both the identifier and the parent type of N are not dimensionless,
-- return an error.
procedure Analyze_Dimension_Type_Conversion (N : Node_Id);
-- Type conversions handle conversions between literals and dimensioned
-- types, from dimensioned types to their base type, and between different
-- dimensioned systems. Dimensions of the conversion are obtained either
-- from those of the expression, or from the target type, and dimensional
-- consistency must be checked when converting between values belonging
-- to different dimensioned systems.
procedure Analyze_Dimension_Unary_Op (N : Node_Id);
-- Subroutine of Analyze_Dimension for unary operators. For Plus, Minus and
-- Abs operators, propagate the dimensions from the operand to N.
function Create_Rational_From
(Expr : Node_Id;
Complain : Boolean) return Rational;
-- Given an arbitrary expression Expr, return a valid rational if Expr can
-- be interpreted as a rational. Otherwise return No_Rational and also an
-- error message if Complain is set to True.
function Dimensions_Of (N : Node_Id) return Dimension_Type;
-- Return the dimension vector of node N
function Dimensions_Msg_Of
(N : Node_Id;
Description_Needed : Boolean := False) return String;
-- Given a node N, return the dimension symbols of N, preceded by "has
-- dimension" if Description_Needed. if N is dimensionless, return "'[']",
-- or "is dimensionless" if Description_Needed.
function Dimension_System_Root (T : Entity_Id) return Entity_Id;
-- Given a type that has dimension information, return the type that is the
-- root of its dimension system, e.g. Mks_Type. If T is not a dimensioned
-- type, i.e. a standard numeric type, return Empty.
procedure Dim_Warning_For_Numeric_Literal (N : Node_Id; Typ : Entity_Id);
-- Issue a warning on the given numeric literal N to indicate that the
-- compiler made the assumption that the literal is not dimensionless
-- but has the dimension of Typ.
procedure Eval_Op_Expon_With_Rational_Exponent
(N : Node_Id;
Exponent_Value : Rational);
-- Evaluate the exponent it is a rational and the operand has a dimension
function Exists (Dim : Dimension_Type) return Boolean;
-- Returns True iff Dim does not denote the null dimension
function Exists (Str : String_Id) return Boolean;
-- Returns True iff Str does not denote No_String
function Exists (Sys : System_Type) return Boolean;
-- Returns True iff Sys does not denote the null system
function From_Dim_To_Str_Of_Dim_Symbols
(Dims : Dimension_Type;
System : System_Type;
In_Error_Msg : Boolean := False) return String_Id;
-- Given a dimension vector and a dimension system, return the proper
-- string of dimension symbols. If In_Error_Msg is True (i.e. the String_Id
-- will be used to issue an error message) then this routine has a special
-- handling for the insertion characters * or [ which must be preceded by
-- a quote ' to be placed literally into the message.
function From_Dim_To_Str_Of_Unit_Symbols
(Dims : Dimension_Type;
System : System_Type) return String_Id;
-- Given a dimension vector and a dimension system, return the proper
-- string of unit symbols.
function Is_Dim_IO_Package_Entity (E : Entity_Id) return Boolean;
-- Return True if E is the package entity of System.Dim.Float_IO or
-- System.Dim.Integer_IO.
function Is_Invalid (Position : Dimension_Position) return Boolean;
-- Return True if Pos denotes the invalid position
procedure Move_Dimensions (From : Node_Id; To : Node_Id);
-- Copy dimension vector of From to To and delete dimension vector of From
procedure Remove_Dimensions (N : Node_Id);
-- Remove the dimension vector of node N
procedure Set_Dimensions (N : Node_Id; Val : Dimension_Type);
-- Associate a dimension vector with a node
procedure Set_Symbol (E : Entity_Id; Val : String_Id);
-- Associate a symbol representation of a dimension vector with a subtype
function Symbol_Of (E : Entity_Id) return String_Id;
-- E denotes a subtype with a dimension. Return the symbol representation
-- of the dimension vector.
function System_Of (E : Entity_Id) return System_Type;
-- E denotes a type, return associated system of the type if it has one
---------
-- "+" --
---------
function "+" (Right : Whole) return Rational is
begin
return Rational'(Numerator => Right, Denominator => 1);
end "+";
function "+" (Left, Right : Rational) return Rational is
R : constant Rational :=
Rational'(Numerator => Left.Numerator * Right.Denominator +
Left.Denominator * Right.Numerator,
Denominator => Left.Denominator * Right.Denominator);
begin
return Reduce (R);
end "+";
---------
-- "-" --
---------
function "-" (Right : Rational) return Rational is
begin
return Rational'(Numerator => -Right.Numerator,
Denominator => Right.Denominator);
end "-";
function "-" (Left, Right : Rational) return Rational is
R : constant Rational :=
Rational'(Numerator => Left.Numerator * Right.Denominator -
Left.Denominator * Right.Numerator,
Denominator => Left.Denominator * Right.Denominator);
begin
return Reduce (R);
end "-";
---------
-- "*" --
---------
function "*" (Left, Right : Rational) return Rational is
R : constant Rational :=
Rational'(Numerator => Left.Numerator * Right.Numerator,
Denominator => Left.Denominator * Right.Denominator);
begin
return Reduce (R);
end "*";
---------
-- "/" --
---------
function "/" (Left, Right : Rational) return Rational is
R : constant Rational := abs Right;
L : Rational := Left;
begin
if Right.Numerator < 0 then
L.Numerator := Whole (-Integer (L.Numerator));
end if;
return Reduce (Rational'(Numerator => L.Numerator * R.Denominator,
Denominator => L.Denominator * R.Numerator));
end "/";
-----------
-- "abs" --
-----------
function "abs" (Right : Rational) return Rational is
begin
return Rational'(Numerator => abs Right.Numerator,
Denominator => Right.Denominator);
end "abs";
------------------------------
-- Analyze_Aspect_Dimension --
------------------------------
-- with Dimension =>
-- ([Symbol =>] SYMBOL, DIMENSION_VALUE {, DIMENSION_Value})
--
-- SYMBOL ::= STRING_LITERAL | CHARACTER_LITERAL
-- DIMENSION_VALUE ::=
-- RATIONAL
-- | others => RATIONAL
-- | DISCRETE_CHOICE_LIST => RATIONAL
-- RATIONAL ::= [-] NUMERIC_LITERAL [/ NUMERIC_LITERAL]
-- Note that when the dimensioned type is an integer type, then any
-- dimension value must be an integer literal.
procedure Analyze_Aspect_Dimension
(N : Node_Id;
Id : Entity_Id;
Aggr : Node_Id)
is
Def_Id : constant Entity_Id := Defining_Identifier (N);
Processed : array (Dimension_Type'Range) of Boolean := (others => False);
-- This array is used when processing ranges or Others_Choice as part of
-- the dimension aggregate.
Dimensions : Dimension_Type := Null_Dimension;
procedure Extract_Power
(Expr : Node_Id;
Position : Dimension_Position);
-- Given an expression with denotes a rational number, read the number
-- and associate it with Position in Dimensions.
function Position_In_System
(Id : Node_Id;
System : System_Type) return Dimension_Position;
-- Given an identifier which denotes a dimension, return the position of
-- that dimension within System.
-------------------
-- Extract_Power --
-------------------
procedure Extract_Power
(Expr : Node_Id;
Position : Dimension_Position)
is
begin
Dimensions (Position) := Create_Rational_From (Expr, True);
Processed (Position) := True;
-- If the dimensioned root type is an integer type, it is not
-- particularly useful, and fractional dimensions do not make
-- much sense for such types, so previously we used to reject
-- dimensions of integer types that were not integer literals.
-- However, the manipulation of dimensions does not depend on
-- the kind of root type, so we can accept this usage for rare
-- cases where dimensions are specified for integer values.
end Extract_Power;
------------------------
-- Position_In_System --
------------------------
function Position_In_System
(Id : Node_Id;
System : System_Type) return Dimension_Position
is
Dimension_Name : constant Name_Id := Chars (Id);
begin
for Position in System.Unit_Names'Range loop
if Dimension_Name = System.Unit_Names (Position) then
return Position;
end if;
end loop;
return Invalid_Position;
end Position_In_System;
-- Local variables
Assoc : Node_Id;
Choice : Node_Id;
Expr : Node_Id;
Num_Choices : Nat := 0;
Num_Dimensions : Nat := 0;
Others_Seen : Boolean := False;
Position : Nat := 0;
Sub_Ind : Node_Id;
Symbol : String_Id := No_String;
Symbol_Expr : Node_Id;
System : System_Type;
Typ : Entity_Id;
Errors_Count : Nat;
-- Errors_Count is a count of errors detected by the compiler so far
-- just before the extraction of symbol, names and values in the
-- aggregate (Step 2).
--
-- At the end of the analysis, there is a check to verify that this
-- count equals to Serious_Errors_Detected i.e. no erros have been
-- encountered during the process. Otherwise the Dimension_Table is
-- not filled.
-- Start of processing for Analyze_Aspect_Dimension
begin
-- STEP 1: Legality of aspect
if Nkind (N) /= N_Subtype_Declaration then
Error_Msg_NE ("aspect& must apply to subtype declaration", N, Id);
return;
end if;
Sub_Ind := Subtype_Indication (N);
Typ := Etype (Sub_Ind);
System := System_Of (Typ);
if Nkind (Sub_Ind) = N_Subtype_Indication then
Error_Msg_NE
("constraint not allowed with aspect&", Constraint (Sub_Ind), Id);
return;
end if;
-- The dimension declarations are useless if the parent type does not
-- declare a valid system.
if not Exists (System) then
Error_Msg_NE
("parent type of& lacks dimension system", Sub_Ind, Def_Id);
return;
end if;
if Nkind (Aggr) /= N_Aggregate then
Error_Msg_N ("aggregate expected", Aggr);
return;
end if;
-- STEP 2: Symbol, Names and values extraction
-- Get the number of errors detected by the compiler so far
Errors_Count := Serious_Errors_Detected;
-- STEP 2a: Symbol extraction
-- The first entry in the aggregate may be the symbolic representation
-- of the quantity.
-- Positional symbol argument
Symbol_Expr := First (Expressions (Aggr));
-- Named symbol argument
if No (Symbol_Expr)
or else Nkind (Symbol_Expr) not in
N_Character_Literal | N_String_Literal
then
Symbol_Expr := Empty;
-- Component associations present
if Present (Component_Associations (Aggr)) then
Assoc := First (Component_Associations (Aggr));
Choice := First (Choices (Assoc));
if No (Next (Choice)) and then Nkind (Choice) = N_Identifier then
-- Symbol component association is present
if Chars (Choice) = Name_Symbol then
Num_Choices := Num_Choices + 1;
Symbol_Expr := Expression (Assoc);
-- Verify symbol expression is a string or a character
if Nkind (Symbol_Expr) not in
N_Character_Literal | N_String_Literal
then
Symbol_Expr := Empty;
Error_Msg_N
("symbol expression must be character or string",
Symbol_Expr);
end if;
-- Special error if no Symbol choice but expression is string
-- or character.
elsif Nkind (Expression (Assoc)) in
N_Character_Literal | N_String_Literal
then
Num_Choices := Num_Choices + 1;
Error_Msg_N
("optional component Symbol expected, found&", Choice);
end if;
end if;
end if;
end if;
-- STEP 2b: Names and values extraction
-- Positional elements
Expr := First (Expressions (Aggr));
-- Skip the symbol expression when present
if Present (Symbol_Expr) and then Num_Choices = 0 then
Next (Expr);
end if;
Position := Low_Position_Bound;
while Present (Expr) loop
if Position > High_Position_Bound then
Error_Msg_N
("type& has more dimensions than system allows", Def_Id);
exit;
end if;
Extract_Power (Expr, Position);
Position := Position + 1;
Num_Dimensions := Num_Dimensions + 1;
Next (Expr);
end loop;
-- Named elements
Assoc := First (Component_Associations (Aggr));
-- Skip the symbol association when present
if Num_Choices = 1 then
Next (Assoc);
end if;
while Present (Assoc) loop
Expr := Expression (Assoc);
Choice := First (Choices (Assoc));
while Present (Choice) loop
-- Identifier case: NAME => EXPRESSION
if Nkind (Choice) = N_Identifier then
Position := Position_In_System (Choice, System);
if Is_Invalid (Position) then
Error_Msg_N ("dimension name& not part of system", Choice);
else
Extract_Power (Expr, Position);
end if;
-- Range case: NAME .. NAME => EXPRESSION
elsif Nkind (Choice) = N_Range then
declare
Low : constant Node_Id := Low_Bound (Choice);
High : constant Node_Id := High_Bound (Choice);
Low_Pos : Dimension_Position;
High_Pos : Dimension_Position;
begin
if Nkind (Low) /= N_Identifier then
Error_Msg_N ("bound must denote a dimension name", Low);
elsif Nkind (High) /= N_Identifier then
Error_Msg_N ("bound must denote a dimension name", High);
else
Low_Pos := Position_In_System (Low, System);
High_Pos := Position_In_System (High, System);
if Is_Invalid (Low_Pos) then
Error_Msg_N ("dimension name& not part of system",
Low);
elsif Is_Invalid (High_Pos) then
Error_Msg_N ("dimension name& not part of system",
High);
elsif Low_Pos > High_Pos then
Error_Msg_N ("expected low to high range", Choice);
else
for Position in Low_Pos .. High_Pos loop
Extract_Power (Expr, Position);
end loop;
end if;
end if;
end;
-- Others case: OTHERS => EXPRESSION
elsif Nkind (Choice) = N_Others_Choice then
if Present (Next (Choice)) or else Present (Prev (Choice)) then
Error_Msg_N
("OTHERS must appear alone in a choice list", Choice);
elsif Present (Next (Assoc)) then
Error_Msg_N
("OTHERS must appear last in an aggregate", Choice);
elsif Others_Seen then
Error_Msg_N ("multiple OTHERS not allowed", Choice);
else
-- Fill the non-processed dimensions with the default value
-- supplied by others.
for Position in Processed'Range loop
if not Processed (Position) then
Extract_Power (Expr, Position);
end if;
end loop;
end if;
Others_Seen := True;
-- All other cases are illegal declarations of dimension names
else
Error_Msg_NE ("wrong syntax for aspect&", Choice, Id);
end if;
Num_Choices := Num_Choices + 1;
Next (Choice);
end loop;
Num_Dimensions := Num_Dimensions + 1;
Next (Assoc);
end loop;
-- STEP 3: Consistency of system and dimensions
if Present (First (Expressions (Aggr)))
and then (First (Expressions (Aggr)) /= Symbol_Expr
or else Present (Next (Symbol_Expr)))
and then (Num_Choices > 1
or else (Num_Choices = 1 and then not Others_Seen))
then
Error_Msg_N
("named associations cannot follow positional associations", Aggr);
end if;
if Num_Dimensions > System.Count then
Error_Msg_N ("type& has more dimensions than system allows", Def_Id);
elsif Num_Dimensions < System.Count and then not Others_Seen then
Error_Msg_N ("type& has less dimensions than system allows", Def_Id);
end if;
-- STEP 4: Dimension symbol extraction
if Present (Symbol_Expr) then
if Nkind (Symbol_Expr) = N_Character_Literal then
Start_String;
Store_String_Char (UI_To_CC (Char_Literal_Value (Symbol_Expr)));
Symbol := End_String;
else
Symbol := Strval (Symbol_Expr);
end if;
if String_Length (Symbol) = 0 then
Error_Msg_N ("empty string not allowed here", Symbol_Expr);
end if;
end if;
-- STEP 5: Storage of extracted values
-- Check that no errors have been detected during the analysis
if Errors_Count = Serious_Errors_Detected then
-- Check for useless declaration
if Symbol = No_String and then not Exists (Dimensions) then
Error_Msg_N ("useless dimension declaration", Aggr);
end if;
if Symbol /= No_String then
Set_Symbol (Def_Id, Symbol);
end if;
if Exists (Dimensions) then
Set_Dimensions (Def_Id, Dimensions);
end if;
end if;
end Analyze_Aspect_Dimension;
-------------------------------------
-- Analyze_Aspect_Dimension_System --
-------------------------------------
-- with Dimension_System => (DIMENSION {, DIMENSION});
-- DIMENSION ::= (
-- [Unit_Name =>] IDENTIFIER,
-- [Unit_Symbol =>] SYMBOL,
-- [Dim_Symbol =>] SYMBOL)
procedure Analyze_Aspect_Dimension_System
(N : Node_Id;
Id : Entity_Id;
Aggr : Node_Id)
is
function Is_Derived_Numeric_Type (N : Node_Id) return Boolean;
-- Determine whether type declaration N denotes a numeric derived type
-------------------------------
-- Is_Derived_Numeric_Type --
-------------------------------
function Is_Derived_Numeric_Type (N : Node_Id) return Boolean is
begin
return
Nkind (N) = N_Full_Type_Declaration
and then Nkind (Type_Definition (N)) = N_Derived_Type_Definition
and then Is_Numeric_Type
(Entity (Subtype_Indication (Type_Definition (N))));
end Is_Derived_Numeric_Type;
-- Local variables
Assoc : Node_Id;
Choice : Node_Id;
Dim_Aggr : Node_Id;
Dim_Symbol : Node_Id;
Dim_Symbols : Symbol_Array := No_Symbols;
Dim_System : System_Type := Null_System;
Position : Dimension_Position := Invalid_Position;
Unit_Name : Node_Id;
Unit_Names : Name_Array := No_Names;
Unit_Symbol : Node_Id;
Unit_Symbols : Symbol_Array := No_Symbols;
Errors_Count : Nat;
-- Errors_Count is a count of errors detected by the compiler so far
-- just before the extraction of names and symbols in the aggregate
-- (Step 3).
--
-- At the end of the analysis, there is a check to verify that this
-- count equals Serious_Errors_Detected i.e. no errors have been
-- encountered during the process. Otherwise the System_Table is
-- not filled.
-- Start of processing for Analyze_Aspect_Dimension_System
begin
-- STEP 1: Legality of aspect
if not Is_Derived_Numeric_Type (N) then
Error_Msg_NE
("aspect& must apply to numeric derived type declaration", N, Id);
return;
end if;
if Nkind (Aggr) /= N_Aggregate then
Error_Msg_N ("aggregate expected", Aggr);
return;
end if;
-- STEP 2: Structural verification of the dimension aggregate
if Present (Component_Associations (Aggr)) then
Error_Msg_N ("expected positional aggregate", Aggr);
return;
end if;
-- STEP 3: Name and Symbol extraction
Dim_Aggr := First (Expressions (Aggr));
Errors_Count := Serious_Errors_Detected;
while Present (Dim_Aggr) loop
if Position = High_Position_Bound then
Error_Msg_N ("too many dimensions in system", Aggr);
exit;
end if;
Position := Position + 1;
if Nkind (Dim_Aggr) /= N_Aggregate then
Error_Msg_N ("aggregate expected", Dim_Aggr);
else
if Present (Component_Associations (Dim_Aggr))
and then Present (Expressions (Dim_Aggr))
then
Error_Msg_N
("mixed positional/named aggregate not allowed here",
Dim_Aggr);
-- Verify each dimension aggregate has three arguments
elsif List_Length (Component_Associations (Dim_Aggr)) /= 3
and then List_Length (Expressions (Dim_Aggr)) /= 3
then
Error_Msg_N
("three components expected in aggregate", Dim_Aggr);
else
-- Named dimension aggregate
if Present (Component_Associations (Dim_Aggr)) then
-- Check first argument denotes the unit name
Assoc := First (Component_Associations (Dim_Aggr));
Choice := First (Choices (Assoc));
Unit_Name := Expression (Assoc);
if Present (Next (Choice))
or else Nkind (Choice) /= N_Identifier
then
Error_Msg_NE ("wrong syntax for aspect&", Choice, Id);
elsif Chars (Choice) /= Name_Unit_Name then
Error_Msg_N ("expected Unit_Name, found&", Choice);
end if;
-- Check the second argument denotes the unit symbol
Next (Assoc);
Choice := First (Choices (Assoc));
Unit_Symbol := Expression (Assoc);
if Present (Next (Choice))
or else Nkind (Choice) /= N_Identifier
then
Error_Msg_NE ("wrong syntax for aspect&", Choice, Id);
elsif Chars (Choice) /= Name_Unit_Symbol then
Error_Msg_N ("expected Unit_Symbol, found&", Choice);
end if;
-- Check the third argument denotes the dimension symbol
Next (Assoc);
Choice := First (Choices (Assoc));
Dim_Symbol := Expression (Assoc);
if Present (Next (Choice))
or else Nkind (Choice) /= N_Identifier
then
Error_Msg_NE ("wrong syntax for aspect&", Choice, Id);
elsif Chars (Choice) /= Name_Dim_Symbol then
Error_Msg_N ("expected Dim_Symbol, found&", Choice);
end if;
-- Positional dimension aggregate
else
Unit_Name := First (Expressions (Dim_Aggr));
Unit_Symbol := Next (Unit_Name);
Dim_Symbol := Next (Unit_Symbol);
end if;
-- Check the first argument for each dimension aggregate is
-- a name.
if Nkind (Unit_Name) = N_Identifier then
Unit_Names (Position) := Chars (Unit_Name);
else
Error_Msg_N ("expected unit name", Unit_Name);
end if;
-- Check the second argument for each dimension aggregate is
-- a string or a character.
if Nkind (Unit_Symbol) not in
N_String_Literal | N_Character_Literal
then
Error_Msg_N
("expected unit symbol (string or character)",
Unit_Symbol);
else
-- String case
if Nkind (Unit_Symbol) = N_String_Literal then
Unit_Symbols (Position) := Strval (Unit_Symbol);
-- Character case
else
Start_String;
Store_String_Char
(UI_To_CC (Char_Literal_Value (Unit_Symbol)));
Unit_Symbols (Position) := End_String;
end if;
-- Verify that the string is not empty
if String_Length (Unit_Symbols (Position)) = 0 then
Error_Msg_N
("empty string not allowed here", Unit_Symbol);
end if;
end if;
-- Check the third argument for each dimension aggregate is
-- a string or a character.
if Nkind (Dim_Symbol) not in
N_String_Literal | N_Character_Literal
then
Error_Msg_N
("expected dimension symbol (string or character)",
Dim_Symbol);
else
-- String case
if Nkind (Dim_Symbol) = N_String_Literal then
Dim_Symbols (Position) := Strval (Dim_Symbol);
-- Character case
else
Start_String;
Store_String_Char
(UI_To_CC (Char_Literal_Value (Dim_Symbol)));
Dim_Symbols (Position) := End_String;
end if;
-- Verify that the string is not empty
if String_Length (Dim_Symbols (Position)) = 0 then
Error_Msg_N ("empty string not allowed here", Dim_Symbol);
end if;
end if;
end if;
end if;
Next (Dim_Aggr);
end loop;
-- STEP 4: Storage of extracted values
-- Check that no errors have been detected during the analysis
if Errors_Count = Serious_Errors_Detected then
Dim_System.Type_Decl := N;
Dim_System.Unit_Names := Unit_Names;
Dim_System.Unit_Symbols := Unit_Symbols;
Dim_System.Dim_Symbols := Dim_Symbols;
Dim_System.Count := Position;
System_Table.Append (Dim_System);
end if;
end Analyze_Aspect_Dimension_System;
-----------------------
-- Analyze_Dimension --
-----------------------
-- This dispatch routine propagates dimensions for each node
procedure Analyze_Dimension (N : Node_Id) is
begin
-- Aspect is an Ada 2012 feature. Note that there is no need to check
-- dimensions for nodes that don't come from source, except for subtype
-- declarations where the dimensions are inherited from the base type,
-- for explicit dereferences generated when expanding iterators, and
-- for object declarations generated for inlining.
if Ada_Version < Ada_2012 then
return;
-- Inlined bodies have already been checked for dimensionality
elsif In_Inlined_Body then
return;
elsif not Comes_From_Source (N) then
if Nkind (N) not in N_Explicit_Dereference
| N_Identifier
| N_Object_Declaration
| N_Subtype_Declaration
then
return;
end if;
end if;
case Nkind (N) is
when N_Assignment_Statement =>
Analyze_Dimension_Assignment_Statement (N);
when N_Binary_Op =>
Analyze_Dimension_Binary_Op (N);
when N_Case_Expression =>
Analyze_Dimension_Case_Expression (N);
when N_Component_Declaration =>
Analyze_Dimension_Component_Declaration (N);
when N_Extended_Return_Statement =>
Analyze_Dimension_Extended_Return_Statement (N);
when N_Attribute_Reference
| N_Expanded_Name
| N_Explicit_Dereference
| N_Function_Call
| N_Indexed_Component
| N_Qualified_Expression
| N_Selected_Component
| N_Slice
| N_Unchecked_Type_Conversion
=>
Analyze_Dimension_Has_Etype (N);
-- In the presence of a repaired syntax error, an identifier may be
-- introduced without a usable type.
when N_Identifier =>
if Present (Etype (N)) then
Analyze_Dimension_Has_Etype (N);
end if;
when N_If_Expression =>
Analyze_Dimension_If_Expression (N);
when N_Number_Declaration =>
Analyze_Dimension_Number_Declaration (N);
when N_Object_Declaration =>
Analyze_Dimension_Object_Declaration (N);
when N_Object_Renaming_Declaration =>
Analyze_Dimension_Object_Renaming_Declaration (N);
when N_Simple_Return_Statement =>
if not Comes_From_Extended_Return_Statement (N) then
Analyze_Dimension_Simple_Return_Statement (N);
end if;
when N_Subtype_Declaration =>
Analyze_Dimension_Subtype_Declaration (N);
when N_Type_Conversion =>
Analyze_Dimension_Type_Conversion (N);
when N_Unary_Op =>
Analyze_Dimension_Unary_Op (N);
when others =>
null;
end case;
end Analyze_Dimension;
---------------------------------------
-- Analyze_Dimension_Array_Aggregate --
---------------------------------------
procedure Analyze_Dimension_Array_Aggregate
(N : Node_Id;
Comp_Typ : Entity_Id)
is
Comp_Ass : constant List_Id := Component_Associations (N);
Dims_Of_Comp_Typ : constant Dimension_Type := Dimensions_Of (Comp_Typ);
Exps : constant List_Id := Expressions (N);
Comp : Node_Id;
Dims_Of_Expr : Dimension_Type;
Expr : Node_Id;
Error_Detected : Boolean := False;
-- This flag is used in order to indicate if an error has been detected
-- so far by the compiler in this routine.
begin
-- Aspect is an Ada 2012 feature. Nothing to do here if the component
-- base type is not a dimensioned type.
-- Inlined bodies have already been checked for dimensionality.
-- Note that here the original node must come from source since the
-- original array aggregate may not have been entirely decorated.
if Ada_Version < Ada_2012
or else In_Inlined_Body
or else not Comes_From_Source (Original_Node (N))
or else not Has_Dimension_System (Base_Type (Comp_Typ))
then
return;
end if;
-- Check whether there is any positional component association
if Is_Empty_List (Exps) then
Comp := First (Comp_Ass);
else
Comp := First (Exps);
end if;
while Present (Comp) loop
-- Get the expression from the component
if Nkind (Comp) = N_Component_Association then
Expr := Expression (Comp);
else
Expr := Comp;
end if;
-- Issue an error if the dimensions of the component type and the
-- dimensions of the component mismatch.
-- Note that we must ensure the expression has been fully analyzed
-- since it may not be decorated at this point. We also don't want to
-- issue the same error message multiple times on the same expression
-- (may happen when an aggregate is converted into a positional
-- aggregate). We also must verify that this is a scalar component,
-- and not a subaggregate of a multidimensional aggregate.
-- The expression may be an identifier that has been copied several
-- times during expansion, its dimensions are those of its type.
if Is_Entity_Name (Expr) then
Dims_Of_Expr := Dimensions_Of (Etype (Expr));
else
Dims_Of_Expr := Dimensions_Of (Expr);
end if;
if Comes_From_Source (Original_Node (Expr))
and then Present (Etype (Expr))
and then Is_Numeric_Type (Etype (Expr))
and then Dims_Of_Expr /= Dims_Of_Comp_Typ
and then Sloc (Comp) /= Sloc (Prev (Comp))
then
-- Check if an error has already been encountered so far
if not Error_Detected then
Error_Msg_N ("dimensions mismatch in array aggregate", N);
Error_Detected := True;
end if;
Error_Msg_N
("\expected dimension " & Dimensions_Msg_Of (Comp_Typ)
& ", found " & Dimensions_Msg_Of (Expr), Expr);
end if;
-- Look at the named components right after the positional components
if not Present (Next (Comp))
and then List_Containing (Comp) = Exps
then
Comp := First (Comp_Ass);
else
Next (Comp);
end if;
end loop;
end Analyze_Dimension_Array_Aggregate;
--------------------------------------------
-- Analyze_Dimension_Assignment_Statement --
--------------------------------------------
procedure Analyze_Dimension_Assignment_Statement (N : Node_Id) is
Lhs : constant Node_Id := Name (N);
Dims_Of_Lhs : constant Dimension_Type := Dimensions_Of (Lhs);
Rhs : constant Node_Id := Expression (N);
Dims_Of_Rhs : constant Dimension_Type := Dimensions_Of (Rhs);
procedure Error_Dim_Msg_For_Assignment_Statement
(N : Node_Id;
Lhs : Node_Id;
Rhs : Node_Id);
-- Error using Error_Msg_N at node N. Output the dimensions of left
-- and right hand sides.
--------------------------------------------
-- Error_Dim_Msg_For_Assignment_Statement --
--------------------------------------------
procedure Error_Dim_Msg_For_Assignment_Statement
(N : Node_Id;
Lhs : Node_Id;
Rhs : Node_Id)
is
begin
Error_Msg_N ("dimensions mismatch in assignment", N);
Error_Msg_N ("\left-hand side " & Dimensions_Msg_Of (Lhs, True), N);
Error_Msg_N ("\right-hand side " & Dimensions_Msg_Of (Rhs, True), N);
end Error_Dim_Msg_For_Assignment_Statement;
-- Start of processing for Analyze_Dimension_Assignment
begin
if Dims_Of_Lhs /= Dims_Of_Rhs then
Error_Dim_Msg_For_Assignment_Statement (N, Lhs, Rhs);
end if;
end Analyze_Dimension_Assignment_Statement;
---------------------------------
-- Analyze_Dimension_Binary_Op --
---------------------------------
-- Check and propagate the dimensions for binary operators
-- Note that when the dimensions mismatch, no dimension is propagated to N.
procedure Analyze_Dimension_Binary_Op (N : Node_Id) is
N_Kind : constant Node_Kind := Nkind (N);
function Dimensions_Of_Operand (N : Node_Id) return Dimension_Type;
-- If the operand is a numeric literal that comes from a declared
-- constant, use the dimensions of the constant which were computed
-- from the expression of the constant declaration. Otherwise the
-- dimensions are those of the operand, or the type of the operand.
-- This takes care of node rewritings from validity checks, where the
-- dimensions of the operand itself may not be preserved, while the
-- type comes from context and must have dimension information.
procedure Error_Dim_Msg_For_Binary_Op (N, L, R : Node_Id);
-- Error using Error_Msg_NE and Error_Msg_N at node N. Output the
-- dimensions of both operands.
---------------------------
-- Dimensions_Of_Operand --
---------------------------
function Dimensions_Of_Operand (N : Node_Id) return Dimension_Type is
Dims : constant Dimension_Type := Dimensions_Of (N);
begin
if Exists (Dims) then
return Dims;
elsif Is_Entity_Name (N) then
return Dimensions_Of (Etype (Entity (N)));
elsif Nkind (N) = N_Real_Literal then
if Present (Original_Entity (N)) then
return Dimensions_Of (Original_Entity (N));
else
return Dimensions_Of (Etype (N));
end if;
-- Otherwise return the default dimensions
else
return Dims;
end if;
end Dimensions_Of_Operand;
---------------------------------
-- Error_Dim_Msg_For_Binary_Op --
---------------------------------
procedure Error_Dim_Msg_For_Binary_Op (N, L, R : Node_Id) is
begin
Error_Msg_NE
("both operands for operation& must have same dimensions",
N, Entity (N));
Error_Msg_N ("\left operand " & Dimensions_Msg_Of (L, True), N);
Error_Msg_N ("\right operand " & Dimensions_Msg_Of (R, True), N);
end Error_Dim_Msg_For_Binary_Op;
-- Start of processing for Analyze_Dimension_Binary_Op
begin
-- If the node is already analyzed, do not examine the operands. At the
-- end of the analysis their dimensions have been removed, and the node
-- itself may have been rewritten.
if Analyzed (N) then
return;
end if;
if N_Kind in N_Op_Add | N_Op_Expon | N_Op_Subtract
| N_Multiplying_Operator | N_Op_Compare
then
declare
L : constant Node_Id := Left_Opnd (N);
Dims_Of_L : constant Dimension_Type :=
Dimensions_Of_Operand (L);
L_Has_Dimensions : constant Boolean := Exists (Dims_Of_L);
R : constant Node_Id := Right_Opnd (N);
Dims_Of_R : constant Dimension_Type :=
Dimensions_Of_Operand (R);
R_Has_Dimensions : constant Boolean := Exists (Dims_Of_R);
Dims_Of_N : Dimension_Type := Null_Dimension;
begin
-- N_Op_Add, N_Op_Mod, N_Op_Rem or N_Op_Subtract case
if N_Kind in N_Op_Add | N_Op_Mod | N_Op_Rem | N_Op_Subtract then
-- Check both operands have same dimension
if Dims_Of_L /= Dims_Of_R then
Error_Dim_Msg_For_Binary_Op (N, L, R);
else
-- Check both operands are not dimensionless
if Exists (Dims_Of_L) then
Set_Dimensions (N, Dims_Of_L);
end if;
end if;
-- N_Op_Multiply or N_Op_Divide case
elsif N_Kind in N_Op_Multiply | N_Op_Divide then
-- Check at least one operand is not dimensionless
if L_Has_Dimensions or R_Has_Dimensions then
-- Multiplication case
-- Get both operands dimensions and add them
if N_Kind = N_Op_Multiply then
for Position in Dimension_Type'Range loop
Dims_Of_N (Position) :=
Dims_Of_L (Position) + Dims_Of_R (Position);
end loop;
-- Division case
-- Get both operands dimensions and subtract them
else
for Position in Dimension_Type'Range loop
Dims_Of_N (Position) :=
Dims_Of_L (Position) - Dims_Of_R (Position);
end loop;
end if;
if Exists (Dims_Of_N) then
Set_Dimensions (N, Dims_Of_N);
end if;
end if;
-- Exponentiation case
-- Note: a rational exponent is allowed for dimensioned operand
elsif N_Kind = N_Op_Expon then
-- Check the left operand is not dimensionless. Note that the
-- value of the exponent must be known compile time. Otherwise,
-- the exponentiation evaluation will return an error message.
if L_Has_Dimensions then
if not Compile_Time_Known_Value (R) then
Error_Msg_N
("exponent of dimensioned operand must be "
& "known at compile time", N);
end if;
declare
Exponent_Value : Rational := Zero;
begin
-- Real operand case
if Is_Real_Type (Etype (L)) then
-- Define the exponent as a Rational number
Exponent_Value := Create_Rational_From (R, False);
-- Verify that the exponent cannot be interpreted
-- as a rational, otherwise interpret the exponent
-- as an integer.
if Exponent_Value = No_Rational then
Exponent_Value :=
+Whole (UI_To_Int (Expr_Value (R)));
end if;
-- Integer operand case.
-- For integer operand, the exponent cannot be
-- interpreted as a rational.
else
Exponent_Value := +Whole (UI_To_Int (Expr_Value (R)));
end if;
for Position in Dimension_Type'Range loop
Dims_Of_N (Position) :=
Dims_Of_L (Position) * Exponent_Value;
end loop;
if Exists (Dims_Of_N) then
Set_Dimensions (N, Dims_Of_N);
end if;
end;
end if;
-- Comparison cases
-- For relational operations, only dimension checking is
-- performed (no propagation). If one operand is the result
-- of constant folding the dimensions may have been lost
-- in a tree copy, so assume that preanalysis has verified
-- that dimensions are correct.
elsif N_Kind in N_Op_Compare then
if (L_Has_Dimensions or R_Has_Dimensions)
and then Dims_Of_L /= Dims_Of_R
then
if Nkind (L) = N_Real_Literal
and then not (Comes_From_Source (L))
and then Expander_Active
then
null;
elsif Nkind (R) = N_Real_Literal
and then not (Comes_From_Source (R))
and then Expander_Active
then
null;
-- Numeric literal case. Issue a warning to indicate the
-- literal is treated as if its dimension matches the type
-- dimension.
elsif Nkind (Original_Node (L)) in
N_Integer_Literal | N_Real_Literal
then
Dim_Warning_For_Numeric_Literal (L, Etype (R));
elsif Nkind (Original_Node (R)) in
N_Integer_Literal | N_Real_Literal
then
Dim_Warning_For_Numeric_Literal (R, Etype (L));
else
Error_Dim_Msg_For_Binary_Op (N, L, R);
end if;
end if;
end if;
-- If expander is active, remove dimension information from each
-- operand, as only dimensions of result are relevant.
if Expander_Active then
Remove_Dimensions (L);
Remove_Dimensions (R);
end if;
end;
end if;
end Analyze_Dimension_Binary_Op;
----------------------------
-- Analyze_Dimension_Call --
----------------------------
procedure Analyze_Dimension_Call (N : Node_Id; Nam : Entity_Id) is
Actuals : constant List_Id := Parameter_Associations (N);
Actual : Node_Id;
Dims_Of_Formal : Dimension_Type;
Formal : Node_Id;
Formal_Typ : Entity_Id;
Error_Detected : Boolean := False;
-- This flag is used in order to indicate if an error has been detected
-- so far by the compiler in this routine.
begin
-- Aspect is an Ada 2012 feature. Note that there is no need to check
-- dimensions for calls in inlined bodies, or calls that don't come
-- from source, or those that may have semantic errors.
if Ada_Version < Ada_2012
or else In_Inlined_Body
or else not Comes_From_Source (N)
or else Error_Posted (N)
then
return;
end if;
-- Check the dimensions of the actuals, if any
if not Is_Empty_List (Actuals) then
-- Special processing for elementary functions
-- For Sqrt call, the resulting dimensions equal to half the
-- dimensions of the actual. For all other elementary calls, this
-- routine check that every actual is dimensionless.
if Nkind (N) = N_Function_Call then
Elementary_Function_Calls : declare
Dims_Of_Call : Dimension_Type;
Ent : Entity_Id := Nam;
function Is_Elementary_Function_Entity
(Sub_Id : Entity_Id) return Boolean;
-- Given Sub_Id, the original subprogram entity, return True
-- if call is to an elementary function (see Ada.Numerics.
-- Generic_Elementary_Functions).
-----------------------------------
-- Is_Elementary_Function_Entity --
-----------------------------------
function Is_Elementary_Function_Entity
(Sub_Id : Entity_Id) return Boolean
is
Loc : constant Source_Ptr := Sloc (Sub_Id);
begin
-- Is entity in Ada.Numerics.Generic_Elementary_Functions?
return
Loc > No_Location
and then
Is_RTU
(Cunit_Entity (Get_Source_Unit (Loc)),
Ada_Numerics_Generic_Elementary_Functions);
end Is_Elementary_Function_Entity;
-- Start of processing for Elementary_Function_Calls
begin
-- Get original subprogram entity following the renaming chain
if Present (Alias (Ent)) then
Ent := Alias (Ent);
end if;
-- Check the call is an Elementary function call
if Is_Elementary_Function_Entity (Ent) then
-- Sqrt function call case
if Chars (Ent) = Name_Sqrt then
Dims_Of_Call := Dimensions_Of (First_Actual (N));
-- Evaluates the resulting dimensions (i.e. half the
-- dimensions of the actual).
if Exists (Dims_Of_Call) then
for Position in Dims_Of_Call'Range loop
Dims_Of_Call (Position) :=
Dims_Of_Call (Position) *
Rational'(Numerator => 1, Denominator => 2);
end loop;
Set_Dimensions (N, Dims_Of_Call);
end if;
-- All other elementary functions case. Note that every
-- actual here should be dimensionless.
else
Actual := First_Actual (N);
while Present (Actual) loop
if Exists (Dimensions_Of (Actual)) then
-- Check if error has already been encountered
if not Error_Detected then
Error_Msg_NE
("dimensions mismatch in call of&",
N, Name (N));
Error_Detected := True;
end if;
Error_Msg_N
("\expected dimension '['], found "
& Dimensions_Msg_Of (Actual), Actual);
end if;
Next_Actual (Actual);
end loop;
end if;
-- Nothing more to do for elementary functions
return;
end if;
end Elementary_Function_Calls;
end if;
-- General case. Check, for each parameter, the dimensions of the
-- actual and its corresponding formal match. Otherwise, complain.
Actual := First_Actual (N);
Formal := First_Formal (Nam);
while Present (Formal) loop
-- A missing corresponding actual indicates that the analysis of
-- the call was aborted due to a previous error.
if No (Actual) then
Check_Error_Detected;
return;
end if;
Formal_Typ := Etype (Formal);
Dims_Of_Formal := Dimensions_Of (Formal_Typ);
-- If the formal is not dimensionless, check dimensions of formal
-- and actual match. Otherwise, complain.
if Exists (Dims_Of_Formal)
and then Dimensions_Of (Actual) /= Dims_Of_Formal
then
-- Check if an error has already been encountered so far
if not Error_Detected then
Error_Msg_NE ("dimensions mismatch in& call", N, Name (N));
Error_Detected := True;
end if;
Error_Msg_N
("\expected dimension " & Dimensions_Msg_Of (Formal_Typ)
& ", found " & Dimensions_Msg_Of (Actual), Actual);
end if;
Next_Actual (Actual);
Next_Formal (Formal);
end loop;
end if;
-- For function calls, propagate the dimensions from the returned type
if Nkind (N) = N_Function_Call then
Analyze_Dimension_Has_Etype (N);
end if;
end Analyze_Dimension_Call;
---------------------------------------
-- Analyze_Dimension_Case_Expression --
---------------------------------------
procedure Analyze_Dimension_Case_Expression (N : Node_Id) is
Frst : constant Node_Id := First (Alternatives (N));
Frst_Expr : constant Node_Id := Expression (Frst);
Dims : constant Dimension_Type := Dimensions_Of (Frst_Expr);
Alt : Node_Id;
begin
Alt := Next (Frst);
while Present (Alt) loop
if Dimensions_Of (Expression (Alt)) /= Dims then
Error_Msg_N ("dimension mismatch in case expression", Alt);
exit;
end if;
Next (Alt);
end loop;
Copy_Dimensions (Frst_Expr, N);
end Analyze_Dimension_Case_Expression;
---------------------------------------------
-- Analyze_Dimension_Component_Declaration --
---------------------------------------------
procedure Analyze_Dimension_Component_Declaration (N : Node_Id) is
Expr : constant Node_Id := Expression (N);
Id : constant Entity_Id := Defining_Identifier (N);
Etyp : constant Entity_Id := Etype (Id);
Dims_Of_Etyp : constant Dimension_Type := Dimensions_Of (Etyp);
Dims_Of_Expr : Dimension_Type;
procedure Error_Dim_Msg_For_Component_Declaration
(N : Node_Id;
Etyp : Entity_Id;
Expr : Node_Id);
-- Error using Error_Msg_N at node N. Output the dimensions of the
-- type Etyp and the expression Expr of N.
---------------------------------------------
-- Error_Dim_Msg_For_Component_Declaration --
---------------------------------------------
procedure Error_Dim_Msg_For_Component_Declaration
(N : Node_Id;
Etyp : Entity_Id;
Expr : Node_Id) is
begin
Error_Msg_N ("dimensions mismatch in component declaration", N);
Error_Msg_N
("\expected dimension " & Dimensions_Msg_Of (Etyp) & ", found "
& Dimensions_Msg_Of (Expr), Expr);
end Error_Dim_Msg_For_Component_Declaration;
-- Start of processing for Analyze_Dimension_Component_Declaration
begin
-- Expression is present
if Present (Expr) then
Dims_Of_Expr := Dimensions_Of (Expr);
-- Check dimensions match
if Dims_Of_Etyp /= Dims_Of_Expr then
-- Numeric literal case. Issue a warning if the object type is not
-- dimensionless to indicate the literal is treated as if its
-- dimension matches the type dimension.
if Nkind (Original_Node (Expr)) in
N_Real_Literal | N_Integer_Literal
then
Dim_Warning_For_Numeric_Literal (Expr, Etyp);
-- Issue a dimension mismatch error for all other cases
else
Error_Dim_Msg_For_Component_Declaration (N, Etyp, Expr);
end if;
end if;
end if;
end Analyze_Dimension_Component_Declaration;
-------------------------------------------------
-- Analyze_Dimension_Extended_Return_Statement --
-------------------------------------------------
procedure Analyze_Dimension_Extended_Return_Statement (N : Node_Id) is
Return_Ent : constant Entity_Id := Return_Statement_Entity (N);
Return_Etyp : constant Entity_Id :=
Etype (Return_Applies_To (Return_Ent));
Return_Obj_Decls : constant List_Id := Return_Object_Declarations (N);
Return_Obj_Decl : Node_Id;
Return_Obj_Id : Entity_Id;
Return_Obj_Typ : Entity_Id;
procedure Error_Dim_Msg_For_Extended_Return_Statement
(N : Node_Id;
Return_Etyp : Entity_Id;
Return_Obj_Typ : Entity_Id);
-- Error using Error_Msg_N at node N. Output dimensions of the returned
-- type Return_Etyp and the returned object type Return_Obj_Typ of N.
-------------------------------------------------
-- Error_Dim_Msg_For_Extended_Return_Statement --
-------------------------------------------------
procedure Error_Dim_Msg_For_Extended_Return_Statement
(N : Node_Id;
Return_Etyp : Entity_Id;
Return_Obj_Typ : Entity_Id)
is
begin
Error_Msg_N ("dimensions mismatch in extended return statement", N);
Error_Msg_N
("\expected dimension " & Dimensions_Msg_Of (Return_Etyp)
& ", found " & Dimensions_Msg_Of (Return_Obj_Typ), N);
end Error_Dim_Msg_For_Extended_Return_Statement;
-- Start of processing for Analyze_Dimension_Extended_Return_Statement
begin
if Present (Return_Obj_Decls) then
Return_Obj_Decl := First (Return_Obj_Decls);
while Present (Return_Obj_Decl) loop
if Nkind (Return_Obj_Decl) = N_Object_Declaration then
Return_Obj_Id := Defining_Identifier (Return_Obj_Decl);
if Is_Return_Object (Return_Obj_Id) then
Return_Obj_Typ := Etype (Return_Obj_Id);
-- Issue an error message if dimensions mismatch
if Dimensions_Of (Return_Etyp) /=
Dimensions_Of (Return_Obj_Typ)
then
Error_Dim_Msg_For_Extended_Return_Statement
(N, Return_Etyp, Return_Obj_Typ);
return;
end if;
end if;
end if;
Next (Return_Obj_Decl);
end loop;
end if;
end Analyze_Dimension_Extended_Return_Statement;
-----------------------------------------------------
-- Analyze_Dimension_Extension_Or_Record_Aggregate --
-----------------------------------------------------
procedure Analyze_Dimension_Extension_Or_Record_Aggregate (N : Node_Id) is
Comp : Node_Id;
Comp_Id : Entity_Id;
Comp_Typ : Entity_Id;
Expr : Node_Id;
Error_Detected : Boolean := False;
-- This flag is used in order to indicate if an error has been detected
-- so far by the compiler in this routine.
begin
-- Aspect is an Ada 2012 feature. Note that there is no need to check
-- dimensions in inlined bodies, or for aggregates that don't come
-- from source, or if we are within an initialization procedure, whose
-- expressions have been checked at the point of record declaration.
if Ada_Version < Ada_2012
or else In_Inlined_Body
or else not Comes_From_Source (N)
or else Inside_Init_Proc
then
return;
end if;
Comp := First (Component_Associations (N));
while Present (Comp) loop
Comp_Id := Entity (First (Choices (Comp)));
Comp_Typ := Etype (Comp_Id);
-- Check the component type is either a dimensioned type or a
-- dimensioned subtype.
if Has_Dimension_System (Base_Type (Comp_Typ)) then
Expr := Expression (Comp);
-- A box-initialized component needs no checking.
if No (Expr) and then Box_Present (Comp) then
null;
-- Issue an error if the dimensions of the component type and the
-- dimensions of the component mismatch.
elsif Dimensions_Of (Expr) /= Dimensions_Of (Comp_Typ) then
-- Check if an error has already been encountered so far
if not Error_Detected then
-- Extension aggregate case
if Nkind (N) = N_Extension_Aggregate then
Error_Msg_N
("dimensions mismatch in extension aggregate", N);
-- Record aggregate case
else
Error_Msg_N
("dimensions mismatch in record aggregate", N);
end if;
Error_Detected := True;
end if;
Error_Msg_N
("\expected dimension " & Dimensions_Msg_Of (Comp_Typ)
& ", found " & Dimensions_Msg_Of (Expr), Comp);
end if;
end if;
Next (Comp);
end loop;
end Analyze_Dimension_Extension_Or_Record_Aggregate;
-------------------------------
-- Analyze_Dimension_Formals --
-------------------------------
procedure Analyze_Dimension_Formals (N : Node_Id; Formals : List_Id) is
Dims_Of_Typ : Dimension_Type;
Formal : Node_Id;
Typ : Entity_Id;
begin
-- Aspect is an Ada 2012 feature. Note that there is no need to check
-- dimensions for sub specs that don't come from source.
if Ada_Version < Ada_2012 or else not Comes_From_Source (N) then
return;
end if;
Formal := First (Formals);
while Present (Formal) loop
Typ := Parameter_Type (Formal);
Dims_Of_Typ := Dimensions_Of (Typ);
if Exists (Dims_Of_Typ) then
declare
Expr : constant Node_Id := Expression (Formal);
begin
-- Issue a warning if Expr is a numeric literal and if its
-- dimensions differ with the dimensions of the formal type.
if Present (Expr)
and then Dims_Of_Typ /= Dimensions_Of (Expr)
and then Nkind (Original_Node (Expr)) in
N_Real_Literal | N_Integer_Literal
then
Dim_Warning_For_Numeric_Literal (Expr, Etype (Typ));
end if;
end;
end if;
Next (Formal);
end loop;
end Analyze_Dimension_Formals;
---------------------------------
-- Analyze_Dimension_Has_Etype --
---------------------------------
procedure Analyze_Dimension_Has_Etype (N : Node_Id) is
Etyp : constant Entity_Id := Etype (N);
Dims_Of_Etyp : Dimension_Type := Dimensions_Of (Etyp);
begin
-- General case. Propagation of the dimensions from the type
if Exists (Dims_Of_Etyp) then
Set_Dimensions (N, Dims_Of_Etyp);
-- Identifier case. Propagate the dimensions from the entity for
-- identifier whose entity is a non-dimensionless constant.
elsif Nkind (N) = N_Identifier then
Analyze_Dimension_Identifier : declare
Id : constant Entity_Id := Entity (N);
begin
-- If Id is missing, abnormal tree, assume previous error
if No (Id) then
Check_Error_Detected;
return;
elsif Ekind (Id) in E_Constant | E_Named_Real
and then Exists (Dimensions_Of (Id))
then
Set_Dimensions (N, Dimensions_Of (Id));
end if;
end Analyze_Dimension_Identifier;
-- Attribute reference case. Propagate the dimensions from the prefix.
elsif Nkind (N) = N_Attribute_Reference
and then Has_Dimension_System (Base_Type (Etyp))
then
Dims_Of_Etyp := Dimensions_Of (Prefix (N));
-- Check the prefix is not dimensionless
if Exists (Dims_Of_Etyp) then
Set_Dimensions (N, Dims_Of_Etyp);
end if;
end if;
-- Remove dimensions from inner expressions, to prevent dimensions
-- table from growing uselessly.
case Nkind (N) is
when N_Attribute_Reference
| N_Indexed_Component
=>
declare
Exprs : constant List_Id := Expressions (N);
Expr : Node_Id;
begin
if Present (Exprs) then
Expr := First (Exprs);
while Present (Expr) loop
Remove_Dimensions (Expr);
Next (Expr);
end loop;
end if;
end;
when N_Qualified_Expression
| N_Type_Conversion
| N_Unchecked_Type_Conversion
=>
Remove_Dimensions (Expression (N));
when N_Selected_Component =>
Remove_Dimensions (Selector_Name (N));
when others =>
null;
end case;
end Analyze_Dimension_Has_Etype;
-------------------------------------
-- Analyze_Dimension_If_Expression --
-------------------------------------
procedure Analyze_Dimension_If_Expression (N : Node_Id) is
Then_Expr : constant Node_Id := Next (First (Expressions (N)));
Else_Expr : constant Node_Id := Next (Then_Expr);
begin
if Dimensions_Of (Then_Expr) /= Dimensions_Of (Else_Expr) then
Error_Msg_N ("dimensions mismatch in conditional expression", N);
else
Copy_Dimensions (Then_Expr, N);
end if;
end Analyze_Dimension_If_Expression;
------------------------------------------
-- Analyze_Dimension_Number_Declaration --
------------------------------------------
procedure Analyze_Dimension_Number_Declaration (N : Node_Id) is
Expr : constant Node_Id := Expression (N);
Id : constant Entity_Id := Defining_Identifier (N);
Dim_Of_Expr : constant Dimension_Type := Dimensions_Of (Expr);
begin
if Exists (Dim_Of_Expr) then
Set_Dimensions (Id, Dim_Of_Expr);
Set_Etype (Id, Etype (Expr));
end if;
end Analyze_Dimension_Number_Declaration;
------------------------------------------
-- Analyze_Dimension_Object_Declaration --
------------------------------------------
procedure Analyze_Dimension_Object_Declaration (N : Node_Id) is
Expr : constant Node_Id := Expression (N);
Id : constant Entity_Id := Defining_Identifier (N);
Etyp : constant Entity_Id := Etype (Id);
Dim_Of_Etyp : constant Dimension_Type := Dimensions_Of (Etyp);
Dim_Of_Expr : Dimension_Type;
procedure Error_Dim_Msg_For_Object_Declaration
(N : Node_Id;
Etyp : Entity_Id;
Expr : Node_Id);
-- Error using Error_Msg_N at node N. Output the dimensions of the
-- type Etyp and of the expression Expr.
------------------------------------------
-- Error_Dim_Msg_For_Object_Declaration --
------------------------------------------
procedure Error_Dim_Msg_For_Object_Declaration
(N : Node_Id;
Etyp : Entity_Id;
Expr : Node_Id) is
begin
Error_Msg_N ("dimensions mismatch in object declaration", N);
Error_Msg_N
("\expected dimension " & Dimensions_Msg_Of (Etyp) & ", found "
& Dimensions_Msg_Of (Expr), Expr);
end Error_Dim_Msg_For_Object_Declaration;
-- Start of processing for Analyze_Dimension_Object_Declaration
begin
-- Expression is present
if Present (Expr) then
Dim_Of_Expr := Dimensions_Of (Expr);
-- Check dimensions match
if Dim_Of_Expr /= Dim_Of_Etyp then
-- Numeric literal case. Issue a warning if the object type is
-- not dimensionless to indicate the literal is treated as if
-- its dimension matches the type dimension.
if Nkind (Original_Node (Expr)) in
N_Real_Literal | N_Integer_Literal
then
Dim_Warning_For_Numeric_Literal (Expr, Etyp);
-- Case of object is a constant whose type is a dimensioned type
elsif Constant_Present (N) and then not Exists (Dim_Of_Etyp) then
-- Propagate dimension from expression to object entity
Set_Dimensions (Id, Dim_Of_Expr);
-- Expression may have been constant-folded. If nominal type has
-- dimensions, verify that expression has same type.
elsif Exists (Dim_Of_Etyp) and then Etype (Expr) = Etyp then
null;
-- For all other cases, issue an error message
else
Error_Dim_Msg_For_Object_Declaration (N, Etyp, Expr);
end if;
end if;
-- Remove dimensions in expression after checking consistency with
-- given type.
Remove_Dimensions (Expr);
end if;
end Analyze_Dimension_Object_Declaration;
---------------------------------------------------
-- Analyze_Dimension_Object_Renaming_Declaration --
---------------------------------------------------
procedure Analyze_Dimension_Object_Renaming_Declaration (N : Node_Id) is
Renamed_Name : constant Node_Id := Name (N);
Sub_Mark : constant Node_Id := Subtype_Mark (N);
procedure Error_Dim_Msg_For_Object_Renaming_Declaration
(N : Node_Id;
Sub_Mark : Node_Id;
Renamed_Name : Node_Id);
-- Error using Error_Msg_N at node N. Output the dimensions of
-- Sub_Mark and of Renamed_Name.
---------------------------------------------------
-- Error_Dim_Msg_For_Object_Renaming_Declaration --
---------------------------------------------------
procedure Error_Dim_Msg_For_Object_Renaming_Declaration
(N : Node_Id;
Sub_Mark : Node_Id;
Renamed_Name : Node_Id) is
begin
Error_Msg_N ("dimensions mismatch in object renaming declaration", N);
Error_Msg_N
("\expected dimension " & Dimensions_Msg_Of (Sub_Mark) & ", found "
& Dimensions_Msg_Of (Renamed_Name), Renamed_Name);
end Error_Dim_Msg_For_Object_Renaming_Declaration;
-- Start of processing for Analyze_Dimension_Object_Renaming_Declaration
begin
if Dimensions_Of (Renamed_Name) /= Dimensions_Of (Sub_Mark) then
Error_Dim_Msg_For_Object_Renaming_Declaration
(N, Sub_Mark, Renamed_Name);
end if;
end Analyze_Dimension_Object_Renaming_Declaration;
-----------------------------------------------
-- Analyze_Dimension_Simple_Return_Statement --
-----------------------------------------------
procedure Analyze_Dimension_Simple_Return_Statement (N : Node_Id) is
Expr : constant Node_Id := Expression (N);
Return_Ent : constant Entity_Id := Return_Statement_Entity (N);
Return_Etyp : constant Entity_Id :=
Etype (Return_Applies_To (Return_Ent));
Dims_Of_Return_Etyp : constant Dimension_Type :=
Dimensions_Of (Return_Etyp);
procedure Error_Dim_Msg_For_Simple_Return_Statement
(N : Node_Id;
Return_Etyp : Entity_Id;
Expr : Node_Id);
-- Error using Error_Msg_N at node N. Output the dimensions of the
-- returned type Return_Etyp and the returned expression Expr of N.
-----------------------------------------------
-- Error_Dim_Msg_For_Simple_Return_Statement --
-----------------------------------------------
procedure Error_Dim_Msg_For_Simple_Return_Statement
(N : Node_Id;
Return_Etyp : Entity_Id;
Expr : Node_Id)
is
begin
Error_Msg_N ("dimensions mismatch in return statement", N);
Error_Msg_N
("\expected dimension " & Dimensions_Msg_Of (Return_Etyp)
& ", found " & Dimensions_Msg_Of (Expr), Expr);
end Error_Dim_Msg_For_Simple_Return_Statement;
-- Start of processing for Analyze_Dimension_Simple_Return_Statement
begin
if Dims_Of_Return_Etyp /= Dimensions_Of (Expr) then
Error_Dim_Msg_For_Simple_Return_Statement (N, Return_Etyp, Expr);
Remove_Dimensions (Expr);
end if;
end Analyze_Dimension_Simple_Return_Statement;
-------------------------------------------
-- Analyze_Dimension_Subtype_Declaration --
-------------------------------------------
procedure Analyze_Dimension_Subtype_Declaration (N : Node_Id) is
Id : constant Entity_Id := Defining_Identifier (N);
Dims_Of_Id : constant Dimension_Type := Dimensions_Of (Id);
Dims_Of_Etyp : Dimension_Type;
Etyp : Node_Id;
begin
-- No constraint case in subtype declaration
if Nkind (Subtype_Indication (N)) /= N_Subtype_Indication then
Etyp := Etype (Subtype_Indication (N));
Dims_Of_Etyp := Dimensions_Of (Etyp);
if Exists (Dims_Of_Etyp) then
-- If subtype already has a dimension (from Aspect_Dimension), it
-- cannot inherit different dimensions from its subtype.
if Exists (Dims_Of_Id) and then Dims_Of_Etyp /= Dims_Of_Id then
Error_Msg_NE
("subtype& already " & Dimensions_Msg_Of (Id, True), N, Id);
else
Set_Dimensions (Id, Dims_Of_Etyp);
Set_Symbol (Id, Symbol_Of (Etyp));
end if;
end if;
-- Constraint present in subtype declaration
else
Etyp := Etype (Subtype_Mark (Subtype_Indication (N)));
Dims_Of_Etyp := Dimensions_Of (Etyp);
if Exists (Dims_Of_Etyp) then
Set_Dimensions (Id, Dims_Of_Etyp);
Set_Symbol (Id, Symbol_Of (Etyp));
end if;
end if;
end Analyze_Dimension_Subtype_Declaration;
---------------------------------------
-- Analyze_Dimension_Type_Conversion --
---------------------------------------
procedure Analyze_Dimension_Type_Conversion (N : Node_Id) is
Expr_Root : constant Entity_Id :=
Dimension_System_Root (Etype (Expression (N)));
Target_Root : constant Entity_Id :=
Dimension_System_Root (Etype (N));
begin
-- If the expression has dimensions and the target type has dimensions,
-- the conversion has the dimensions of the expression. Consistency is
-- checked below. Converting to a non-dimensioned type such as Float
-- ignores the dimensions of the expression.
if Exists (Dimensions_Of (Expression (N)))
and then Present (Target_Root)
then
Set_Dimensions (N, Dimensions_Of (Expression (N)));
-- Otherwise the dimensions are those of the target type.
else
Analyze_Dimension_Has_Etype (N);
end if;
-- A conversion between types in different dimension systems (e.g. MKS
-- and British units) must respect the dimensions of expression and
-- type, It is up to the user to provide proper conversion factors.
-- Upward conversions to root type of a dimensioned system are legal,
-- and correspond to "view conversions", i.e. preserve the dimensions
-- of the expression; otherwise conversion must be between types with
-- then same dimensions. Conversions to a non-dimensioned type such as
-- Float lose the dimensions of the expression.
if Present (Expr_Root)
and then Present (Target_Root)
and then Etype (N) /= Target_Root
and then Dimensions_Of (Expression (N)) /= Dimensions_Of (Etype (N))
then
Error_Msg_N ("dimensions mismatch in conversion", N);
Error_Msg_N
("\expression " & Dimensions_Msg_Of (Expression (N), True), N);
Error_Msg_N
("\target type " & Dimensions_Msg_Of (Etype (N), True), N);
end if;
end Analyze_Dimension_Type_Conversion;
--------------------------------
-- Analyze_Dimension_Unary_Op --
--------------------------------
procedure Analyze_Dimension_Unary_Op (N : Node_Id) is
begin
case Nkind (N) is
-- Propagate the dimension if the operand is not dimensionless
when N_Op_Abs
| N_Op_Minus
| N_Op_Plus
=>
declare
R : constant Node_Id := Right_Opnd (N);
begin
Move_Dimensions (R, N);
end;
when others =>
null;
end case;
end Analyze_Dimension_Unary_Op;
---------------------------------
-- Check_Expression_Dimensions --
---------------------------------
procedure Check_Expression_Dimensions
(Expr : Node_Id;
Typ : Entity_Id)
is
begin
if Is_Floating_Point_Type (Etype (Expr)) then
Analyze_Dimension (Expr);
if Dimensions_Of (Expr) /= Dimensions_Of (Typ) then
Error_Msg_N ("dimensions mismatch in array aggregate", Expr);
Error_Msg_N
("\expected dimension " & Dimensions_Msg_Of (Typ)
& ", found " & Dimensions_Msg_Of (Expr), Expr);
end if;
end if;
end Check_Expression_Dimensions;
---------------------
-- Copy_Dimensions --
---------------------
procedure Copy_Dimensions (From : Node_Id; To : Node_Id) is
Dims_Of_From : constant Dimension_Type := Dimensions_Of (From);
begin
-- Ignore if not Ada 2012 or beyond
if Ada_Version < Ada_2012 then
return;
-- For Ada 2012, Copy the dimension of 'From to 'To'
elsif Exists (Dims_Of_From) then
Set_Dimensions (To, Dims_Of_From);
end if;
end Copy_Dimensions;
-----------------------------------
-- Copy_Dimensions_Of_Components --
-----------------------------------
procedure Copy_Dimensions_Of_Components (Rec : Entity_Id) is
C : Entity_Id;
begin
C := First_Component (Rec);
while Present (C) loop
if Nkind (Parent (C)) = N_Component_Declaration then
Copy_Dimensions
(Expression (Parent (Corresponding_Record_Component (C))),
Expression (Parent (C)));
end if;
Next_Component (C);
end loop;
end Copy_Dimensions_Of_Components;
--------------------------
-- Create_Rational_From --
--------------------------
-- RATIONAL ::= [-] NUMERAL [/ NUMERAL]
-- A rational number is a number that can be expressed as the quotient or
-- fraction a/b of two integers, where b is non-zero positive.
function Create_Rational_From
(Expr : Node_Id;
Complain : Boolean) return Rational
is
Or_Node_Of_Expr : constant Node_Id := Original_Node (Expr);
Result : Rational := No_Rational;
function Process_Minus (N : Node_Id) return Rational;
-- Create a rational from a N_Op_Minus node
function Process_Divide (N : Node_Id) return Rational;
-- Create a rational from a N_Op_Divide node
function Process_Literal (N : Node_Id) return Rational;
-- Create a rational from a N_Integer_Literal node
-------------------
-- Process_Minus --
-------------------
function Process_Minus (N : Node_Id) return Rational is
Right : constant Node_Id := Original_Node (Right_Opnd (N));
Result : Rational;
begin
-- Operand is an integer literal
if Nkind (Right) = N_Integer_Literal then
Result := -Process_Literal (Right);
-- Operand is a divide operator
elsif Nkind (Right) = N_Op_Divide then
Result := -Process_Divide (Right);
else
Result := No_Rational;
end if;
return Result;
end Process_Minus;
--------------------
-- Process_Divide --
--------------------
function Process_Divide (N : Node_Id) return Rational is
Left : constant Node_Id := Original_Node (Left_Opnd (N));
Right : constant Node_Id := Original_Node (Right_Opnd (N));
Left_Rat : Rational;
Result : Rational := No_Rational;
Right_Rat : Rational;
begin
-- Both left and right operands are integer literals
if Nkind (Left) = N_Integer_Literal
and then
Nkind (Right) = N_Integer_Literal
then
Left_Rat := Process_Literal (Left);
Right_Rat := Process_Literal (Right);
Result := Left_Rat / Right_Rat;
end if;
return Result;
end Process_Divide;
---------------------
-- Process_Literal --
---------------------
function Process_Literal (N : Node_Id) return Rational is
begin
return +Whole (UI_To_Int (Intval (N)));
end Process_Literal;
-- Start of processing for Create_Rational_From
begin
-- Check the expression is either a division of two integers or an
-- integer itself. Note that the check applies to the original node
-- since the node could have already been rewritten.
-- Integer literal case
if Nkind (Or_Node_Of_Expr) = N_Integer_Literal then
Result := Process_Literal (Or_Node_Of_Expr);
-- Divide operator case
elsif Nkind (Or_Node_Of_Expr) = N_Op_Divide then
Result := Process_Divide (Or_Node_Of_Expr);
-- Minus operator case
elsif Nkind (Or_Node_Of_Expr) = N_Op_Minus then
Result := Process_Minus (Or_Node_Of_Expr);
end if;
-- When Expr cannot be interpreted as a rational and Complain is true,
-- generate an error message.
if Complain and then Result = No_Rational then
Error_Msg_N ("rational expected", Expr);
end if;
return Result;
end Create_Rational_From;
-------------------
-- Dimensions_Of --
-------------------
function Dimensions_Of (N : Node_Id) return Dimension_Type is
begin
return Dimension_Table.Get (N);
end Dimensions_Of;
-----------------------
-- Dimensions_Msg_Of --
-----------------------
function Dimensions_Msg_Of
(N : Node_Id;
Description_Needed : Boolean := False) return String
is
Dims_Of_N : constant Dimension_Type := Dimensions_Of (N);
Dimensions_Msg : Name_Id;
System : System_Type;
begin
-- Initialization of Name_Buffer
Name_Len := 0;
-- N is not dimensionless
if Exists (Dims_Of_N) then
System := System_Of (Base_Type (Etype (N)));
-- When Description_Needed, add to string "has dimension " before the
-- actual dimension.
if Description_Needed then
Add_Str_To_Name_Buffer ("has dimension ");
end if;
Append
(Global_Name_Buffer,
From_Dim_To_Str_Of_Dim_Symbols (Dims_Of_N, System, True));
-- N is dimensionless
-- When Description_Needed, return "is dimensionless"
elsif Description_Needed then
Add_Str_To_Name_Buffer ("is dimensionless");
-- Otherwise, return "'[']"
else
Add_Str_To_Name_Buffer ("'[']");
end if;
Dimensions_Msg := Name_Find;
return Get_Name_String (Dimensions_Msg);
end Dimensions_Msg_Of;
--------------------------
-- Dimension_Table_Hash --
--------------------------
function Dimension_Table_Hash
(Key : Node_Id) return Dimension_Table_Range
is
begin
return Dimension_Table_Range (Key mod 511);
end Dimension_Table_Hash;
-------------------------------------
-- Dim_Warning_For_Numeric_Literal --
-------------------------------------
procedure Dim_Warning_For_Numeric_Literal (N : Node_Id; Typ : Entity_Id) is
begin
-- Consider the literal zero (integer 0 or real 0.0) to be of any
-- dimension.
case Nkind (Original_Node (N)) is
when N_Real_Literal =>
if Expr_Value_R (N) = Ureal_0 then
return;
end if;
when N_Integer_Literal =>
if Expr_Value (N) = Uint_0 then
return;
end if;
when others =>
null;
end case;
-- Initialize name buffer
Name_Len := 0;
Append (Global_Name_Buffer, String_From_Numeric_Literal (N));
-- Insert a blank between the literal and the symbol
Add_Str_To_Name_Buffer (" ");
Append (Global_Name_Buffer, Symbol_Of (Typ));
Error_Msg_Name_1 := Name_Find;
Error_Msg_N ("assumed to be%%??", N);
end Dim_Warning_For_Numeric_Literal;
----------------------
-- Dimensions_Match --
----------------------
function Dimensions_Match (T1 : Entity_Id; T2 : Entity_Id) return Boolean is
begin
return
not Has_Dimension_System (Base_Type (T1))
or else Dimensions_Of (T1) = Dimensions_Of (T2);
end Dimensions_Match;
---------------------------
-- Dimension_System_Root --
---------------------------
function Dimension_System_Root (T : Entity_Id) return Entity_Id is
Root : Entity_Id;
begin
Root := Base_Type (T);
if Has_Dimension_System (Root) then
return First_Subtype (Root); -- for example Dim_Mks
else
return Empty;
end if;
end Dimension_System_Root;
----------------------------------------
-- Eval_Op_Expon_For_Dimensioned_Type --
----------------------------------------
-- Evaluate the expon operator for real dimensioned type.
-- Note that if the exponent is an integer (denominator = 1) the node is
-- evaluated by the regular Eval_Op_Expon routine (see Sem_Eval).
procedure Eval_Op_Expon_For_Dimensioned_Type
(N : Node_Id;
Btyp : Entity_Id)
is
R : constant Node_Id := Right_Opnd (N);
R_Value : Rational := No_Rational;
begin
if Is_Real_Type (Btyp) then
R_Value := Create_Rational_From (R, False);
end if;
-- Check that the exponent is not an integer
if R_Value /= No_Rational and then R_Value.Denominator /= 1 then
Eval_Op_Expon_With_Rational_Exponent (N, R_Value);
else
Eval_Op_Expon (N);
end if;
end Eval_Op_Expon_For_Dimensioned_Type;
------------------------------------------
-- Eval_Op_Expon_With_Rational_Exponent --
------------------------------------------
-- For dimensioned operand in exponentiation, exponent is allowed to be a
-- Rational and not only an Integer like for dimensionless operands. For
-- that particular case, the left operand is rewritten as a function call
-- using the function Expon_LLF from s-llflex.ads.
procedure Eval_Op_Expon_With_Rational_Exponent
(N : Node_Id;
Exponent_Value : Rational)
is
Loc : constant Source_Ptr := Sloc (N);
Dims_Of_N : constant Dimension_Type := Dimensions_Of (N);
L : constant Node_Id := Left_Opnd (N);
Etyp_Of_L : constant Entity_Id := Etype (L);
Btyp_Of_L : constant Entity_Id := Base_Type (Etyp_Of_L);
Actual_1 : Node_Id;
Actual_2 : Node_Id;
Dim_Power : Rational;
List_Of_Dims : List_Id;
New_Aspect : Node_Id;
New_Aspects : List_Id;
New_Id : Entity_Id;
New_N : Node_Id;
New_Subtyp_Decl_For_L : Node_Id;
System : System_Type;
begin
-- Case when the operand is not dimensionless
if Exists (Dims_Of_N) then
-- Get the corresponding System_Type to know the exact number of
-- dimensions in the system.
System := System_Of (Btyp_Of_L);
-- Generation of a new subtype with the proper dimensions
-- In order to rewrite the operator as a type conversion, a new
-- dimensioned subtype with the resulting dimensions of the
-- exponentiation must be created.
-- Generate:
-- Btyp_Of_L : constant Entity_Id := Base_Type (Etyp_Of_L);
-- System : constant System_Id :=
-- Get_Dimension_System_Id (Btyp_Of_L);
-- Num_Of_Dims : constant Number_Of_Dimensions :=
-- Dimension_Systems.Table (System).Dimension_Count;
-- subtype T is Btyp_Of_L
-- with
-- Dimension => (
-- Dims_Of_N (1).Numerator / Dims_Of_N (1).Denominator,
-- Dims_Of_N (2).Numerator / Dims_Of_N (2).Denominator,
-- ...
-- Dims_Of_N (Num_Of_Dims).Numerator /
-- Dims_Of_N (Num_Of_Dims).Denominator);
-- Step 1: Generate the new aggregate for the aspect Dimension
New_Aspects := Empty_List;
List_Of_Dims := New_List;
for Position in Dims_Of_N'First .. System.Count loop
Dim_Power := Dims_Of_N (Position);
Append_To (List_Of_Dims,
Make_Op_Divide (Loc,
Left_Opnd =>
Make_Integer_Literal (Loc, Int (Dim_Power.Numerator)),
Right_Opnd =>
Make_Integer_Literal (Loc, Int (Dim_Power.Denominator))));
end loop;
-- Step 2: Create the new Aspect Specification for Aspect Dimension
New_Aspect :=
Make_Aspect_Specification (Loc,
Identifier => Make_Identifier (Loc, Name_Dimension),
Expression => Make_Aggregate (Loc, Expressions => List_Of_Dims));
-- Step 3: Make a temporary identifier for the new subtype
New_Id := Make_Temporary (Loc, 'T');
Set_Is_Internal (New_Id);
-- Step 4: Declaration of the new subtype
New_Subtyp_Decl_For_L :=
Make_Subtype_Declaration (Loc,
Defining_Identifier => New_Id,
Subtype_Indication => New_Occurrence_Of (Btyp_Of_L, Loc));
Append (New_Aspect, New_Aspects);
Set_Parent (New_Aspects, New_Subtyp_Decl_For_L);
Set_Aspect_Specifications (New_Subtyp_Decl_For_L, New_Aspects);
Analyze (New_Subtyp_Decl_For_L);
-- Case where the operand is dimensionless
else
New_Id := Btyp_Of_L;
end if;
-- Replacement of N by New_N
-- Generate:
-- Actual_1 := Long_Long_Float (L),
-- Actual_2 := Long_Long_Float (Exponent_Value.Numerator) /
-- Long_Long_Float (Exponent_Value.Denominator);
-- (T (Expon_LLF (Actual_1, Actual_2)));
-- where T is the subtype declared in step 1
-- The node is rewritten as a type conversion
-- Step 1: Creation of the two parameters of Expon_LLF function call
Actual_1 :=
Make_Type_Conversion (Loc,
Subtype_Mark => New_Occurrence_Of (Standard_Long_Long_Float, Loc),
Expression => Relocate_Node (L));
Actual_2 :=
Make_Op_Divide (Loc,
Left_Opnd =>
Make_Real_Literal (Loc,
UR_From_Uint (UI_From_Int (Int (Exponent_Value.Numerator)))),
Right_Opnd =>
Make_Real_Literal (Loc,
UR_From_Uint (UI_From_Int (Int (Exponent_Value.Denominator)))));
-- Step 2: Creation of New_N
New_N :=
Make_Type_Conversion (Loc,
Subtype_Mark => New_Occurrence_Of (New_Id, Loc),
Expression =>
Make_Function_Call (Loc,
Name => New_Occurrence_Of (RTE (RE_Expon_LLF), Loc),
Parameter_Associations => New_List (
Actual_1, Actual_2)));
-- Step 3: Rewrite N with the result
Rewrite (N, New_N);
Set_Etype (N, New_Id);
Analyze_And_Resolve (N, New_Id);
end Eval_Op_Expon_With_Rational_Exponent;
------------
-- Exists --
------------
function Exists (Dim : Dimension_Type) return Boolean is
begin
return Dim /= Null_Dimension;
end Exists;
function Exists (Str : String_Id) return Boolean is
begin
return Str /= No_String;
end Exists;
function Exists (Sys : System_Type) return Boolean is
begin
return Sys /= Null_System;
end Exists;
---------------------------------
-- Expand_Put_Call_With_Symbol --
---------------------------------
-- For procedure Put (resp. Put_Dim_Of) and function Image, defined in
-- System.Dim.Float_IO or System.Dim.Integer_IO, the default string
-- parameter is rewritten to include the unit symbol (or the dimension
-- symbols if not a defined quantity) in the output of a dimensioned
-- object. If a value is already supplied by the user for the parameter
-- Symbol, it is used as is.
-- Case 1. Item is dimensionless
-- * Put : Item appears without a suffix
-- * Put_Dim_Of : the output is []
-- Obj : Mks_Type := 2.6;
-- Put (Obj, 1, 1, 0);
-- Put_Dim_Of (Obj);
-- The corresponding outputs are:
-- $2.6
-- $[]
-- Case 2. Item has a dimension
-- * Put : If the type of Item is a dimensioned subtype whose
-- symbol is not empty, then the symbol appears as a
-- suffix. Otherwise, a new string is created and appears
-- as a suffix of Item. This string results in the
-- successive concatanations between each unit symbol
-- raised by its corresponding dimension power from the
-- dimensions of Item.
-- * Put_Dim_Of : The output is a new string resulting in the successive
-- concatanations between each dimension symbol raised by
-- its corresponding dimension power from the dimensions of
-- Item.
-- subtype Random is Mks_Type
-- with
-- Dimension => (
-- Meter => 3,
-- Candela => -1,
-- others => 0);
-- Obj : Random := 5.0;
-- Put (Obj);
-- Put_Dim_Of (Obj);
-- The corresponding outputs are:
-- $5.0 m**3.cd**(-1)
-- $[l**3.J**(-1)]
-- The function Image returns the string identical to that produced by
-- a call to Put whose first parameter is a string.
procedure Expand_Put_Call_With_Symbol (N : Node_Id) is
Actuals : constant List_Id := Parameter_Associations (N);
Loc : constant Source_Ptr := Sloc (N);
Name_Call : constant Node_Id := Name (N);
New_Actuals : constant List_Id := New_List;
Actual : Node_Id;
Dims_Of_Actual : Dimension_Type;
Etyp : Entity_Id;
New_Str_Lit : Node_Id := Empty;
Symbols : String_Id;
Is_Put_Dim_Of : Boolean := False;
-- This flag is used in order to differentiate routines Put and
-- Put_Dim_Of. Set to True if the procedure is one of the Put_Dim_Of
-- defined in System.Dim.Float_IO or System.Dim.Integer_IO.
function Has_Symbols return Boolean;
-- Return True if the current Put call already has a parameter
-- association for parameter "Symbols" with the correct string of
-- symbols.
function Is_Procedure_Put_Call return Boolean;
-- Return True if the current call is a call of an instantiation of a
-- procedure Put defined in the package System.Dim.Float_IO and
-- System.Dim.Integer_IO.
function Item_Actual return Node_Id;
-- Return the item actual parameter node in the output call
-----------------
-- Has_Symbols --
-----------------
function Has_Symbols return Boolean is
Actual : Node_Id;
Actual_Str : Node_Id;
begin
-- Look for a symbols parameter association in the list of actuals
Actual := First (Actuals);
while Present (Actual) loop
-- Positional parameter association case when the actual is a
-- string literal.
if Nkind (Actual) = N_String_Literal then
Actual_Str := Actual;
-- Named parameter association case when selector name is Symbol
elsif Nkind (Actual) = N_Parameter_Association
and then Chars (Selector_Name (Actual)) = Name_Symbol
then
Actual_Str := Explicit_Actual_Parameter (Actual);
-- Ignore all other cases
else
Actual_Str := Empty;
end if;
if Present (Actual_Str) then
-- Return True if the actual comes from source or if the string
-- of symbols doesn't have the default value (i.e. it is ""),
-- in which case it is used as suffix of the generated string.
if Comes_From_Source (Actual)
or else String_Length (Strval (Actual_Str)) /= 0
then
return True;
else
return False;
end if;
end if;
Next (Actual);
end loop;
-- At this point, the call has no parameter association. Look to the
-- last actual since the symbols parameter is the last one.
return Nkind (Last (Actuals)) = N_String_Literal;
end Has_Symbols;
---------------------------
-- Is_Procedure_Put_Call --
---------------------------
function Is_Procedure_Put_Call return Boolean is
Ent : Entity_Id;
Loc : Source_Ptr;
begin
-- There are three different Put (resp. Put_Dim_Of) routines in each
-- generic dim IO package. Verify the current procedure call is one
-- of them.
if Is_Entity_Name (Name_Call) then
Ent := Entity (Name_Call);
-- Get the original subprogram entity following the renaming chain
if Present (Alias (Ent)) then
Ent := Alias (Ent);
end if;
Loc := Sloc (Ent);
-- Check the name of the entity subprogram is Put (resp.
-- Put_Dim_Of) and verify this entity is located in either
-- System.Dim.Float_IO or System.Dim.Integer_IO.
if Loc > No_Location
and then Is_Dim_IO_Package_Entity
(Cunit_Entity (Get_Source_Unit (Loc)))
then
if Chars (Ent) = Name_Put_Dim_Of then
Is_Put_Dim_Of := True;
return True;
elsif Chars (Ent) = Name_Put
or else Chars (Ent) = Name_Image
then
return True;
end if;
end if;
end if;
return False;
end Is_Procedure_Put_Call;
-----------------
-- Item_Actual --
-----------------
function Item_Actual return Node_Id is
Actual : Node_Id;
begin
-- Look for the item actual as a parameter association
Actual := First (Actuals);
while Present (Actual) loop
if Nkind (Actual) = N_Parameter_Association
and then Chars (Selector_Name (Actual)) = Name_Item
then
return Explicit_Actual_Parameter (Actual);
end if;
Next (Actual);
end loop;
-- Case where the item has been defined without an association
Actual := First (Actuals);
-- Depending on the procedure Put, Item actual could be first or
-- second in the list of actuals.
if Has_Dimension_System (Base_Type (Etype (Actual))) then
return Actual;
else
return Next (Actual);
end if;
end Item_Actual;
-- Start of processing for Expand_Put_Call_With_Symbol
begin
if Is_Procedure_Put_Call and then not Has_Symbols then
Actual := Item_Actual;
Dims_Of_Actual := Dimensions_Of (Actual);
Etyp := Etype (Actual);
-- Put_Dim_Of case
if Is_Put_Dim_Of then
-- Check that the item is not dimensionless
-- Create the new String_Literal with the new String_Id generated
-- by the routine From_Dim_To_Str_Of_Dim_Symbols.
if Exists (Dims_Of_Actual) then
New_Str_Lit :=
Make_String_Literal (Loc,
From_Dim_To_Str_Of_Dim_Symbols
(Dims_Of_Actual, System_Of (Base_Type (Etyp))));
-- If dimensionless, the output is []
else
New_Str_Lit :=
Make_String_Literal (Loc, "[]");
end if;
-- Put case
else
-- Add the symbol as a suffix of the value if the subtype has a
-- unit symbol or if the parameter is not dimensionless.
if Exists (Symbol_Of (Etyp)) then
Symbols := Symbol_Of (Etyp);
else
Symbols := From_Dim_To_Str_Of_Unit_Symbols
(Dims_Of_Actual, System_Of (Base_Type (Etyp)));
end if;
-- Check Symbols exists
if Exists (Symbols) then
Start_String;
-- Put a space between the value and the dimension
Store_String_Char (' ');
Store_String_Chars (Symbols);
New_Str_Lit := Make_String_Literal (Loc, End_String);
end if;
end if;
if Present (New_Str_Lit) then
-- Insert all actuals in New_Actuals
Actual := First (Actuals);
while Present (Actual) loop
-- Copy every actuals in New_Actuals except the Symbols
-- parameter association.
if Nkind (Actual) = N_Parameter_Association
and then Chars (Selector_Name (Actual)) /= Name_Symbol
then
Append_To (New_Actuals,
Make_Parameter_Association (Loc,
Selector_Name => New_Copy (Selector_Name (Actual)),
Explicit_Actual_Parameter =>
New_Copy (Explicit_Actual_Parameter (Actual))));
elsif Nkind (Actual) /= N_Parameter_Association then
Append_To (New_Actuals, New_Copy (Actual));
end if;
Next (Actual);
end loop;
-- Create new Symbols param association and append to New_Actuals
Append_To (New_Actuals,
Make_Parameter_Association (Loc,
Selector_Name => Make_Identifier (Loc, Name_Symbol),
Explicit_Actual_Parameter => New_Str_Lit));
-- Rewrite and analyze the procedure call
if Chars (Name_Call) = Name_Image then
Rewrite (N,
Make_Function_Call (Loc,
Name => New_Copy (Name_Call),
Parameter_Associations => New_Actuals));
Analyze_And_Resolve (N);
else
Rewrite (N,
Make_Procedure_Call_Statement (Loc,
Name => New_Copy (Name_Call),
Parameter_Associations => New_Actuals));
Analyze (N);
end if;
end if;
end if;
end Expand_Put_Call_With_Symbol;
------------------------------------
-- From_Dim_To_Str_Of_Dim_Symbols --
------------------------------------
-- Given a dimension vector and the corresponding dimension system, create
-- a String_Id to output dimension symbols corresponding to the dimensions
-- Dims. If In_Error_Msg is True, there is a special handling for character
-- asterisk * which is an insertion character in error messages.
function From_Dim_To_Str_Of_Dim_Symbols
(Dims : Dimension_Type;
System : System_Type;
In_Error_Msg : Boolean := False) return String_Id
is
Dim_Power : Rational;
First_Dim : Boolean := True;
procedure Store_String_Oexpon;
-- Store the expon operator symbol "**" in the string. In error
-- messages, asterisk * is a special character and must be quoted
-- to be placed literally into the message.
-------------------------
-- Store_String_Oexpon --
-------------------------
procedure Store_String_Oexpon is
begin
if In_Error_Msg then
Store_String_Chars ("'*'*");
else
Store_String_Chars ("**");
end if;
end Store_String_Oexpon;
-- Start of processing for From_Dim_To_Str_Of_Dim_Symbols
begin
-- Initialization of the new String_Id
Start_String;
-- Store the dimension symbols inside boxes
if In_Error_Msg then
Store_String_Chars ("'[");
else
Store_String_Char ('[');
end if;
for Position in Dimension_Type'Range loop
Dim_Power := Dims (Position);
if Dim_Power /= Zero then
if First_Dim then
First_Dim := False;
else
Store_String_Char ('.');
end if;
Store_String_Chars (System.Dim_Symbols (Position));
-- Positive dimension case
if Dim_Power.Numerator > 0 then
-- Integer case
if Dim_Power.Denominator = 1 then
if Dim_Power.Numerator /= 1 then
Store_String_Oexpon;
Store_String_Int (Int (Dim_Power.Numerator));
end if;
-- Rational case when denominator /= 1
else
Store_String_Oexpon;
Store_String_Char ('(');
Store_String_Int (Int (Dim_Power.Numerator));
Store_String_Char ('/');
Store_String_Int (Int (Dim_Power.Denominator));
Store_String_Char (')');
end if;
-- Negative dimension case
else
Store_String_Oexpon;
Store_String_Char ('(');
Store_String_Char ('-');
Store_String_Int (Int (-Dim_Power.Numerator));
-- Integer case
if Dim_Power.Denominator = 1 then
Store_String_Char (')');
-- Rational case when denominator /= 1
else
Store_String_Char ('/');
Store_String_Int (Int (Dim_Power.Denominator));
Store_String_Char (')');
end if;
end if;
end if;
end loop;
if In_Error_Msg then
Store_String_Chars ("']");
else
Store_String_Char (']');
end if;
return End_String;
end From_Dim_To_Str_Of_Dim_Symbols;
-------------------------------------
-- From_Dim_To_Str_Of_Unit_Symbols --
-------------------------------------
-- Given a dimension vector and the corresponding dimension system,
-- create a String_Id to output the unit symbols corresponding to the
-- dimensions Dims.
function From_Dim_To_Str_Of_Unit_Symbols
(Dims : Dimension_Type;
System : System_Type) return String_Id
is
Dim_Power : Rational;
First_Dim : Boolean := True;
begin
-- Return No_String if dimensionless
if not Exists (Dims) then
return No_String;
end if;
-- Initialization of the new String_Id
Start_String;
for Position in Dimension_Type'Range loop
Dim_Power := Dims (Position);
if Dim_Power /= Zero then
if First_Dim then
First_Dim := False;
else
Store_String_Char ('.');
end if;
Store_String_Chars (System.Unit_Symbols (Position));
-- Positive dimension case
if Dim_Power.Numerator > 0 then
-- Integer case
if Dim_Power.Denominator = 1 then
if Dim_Power.Numerator /= 1 then
Store_String_Chars ("**");
Store_String_Int (Int (Dim_Power.Numerator));
end if;
-- Rational case when denominator /= 1
else
Store_String_Chars ("**");
Store_String_Char ('(');
Store_String_Int (Int (Dim_Power.Numerator));
Store_String_Char ('/');
Store_String_Int (Int (Dim_Power.Denominator));
Store_String_Char (')');
end if;
-- Negative dimension case
else
Store_String_Chars ("**");
Store_String_Char ('(');
Store_String_Char ('-');
Store_String_Int (Int (-Dim_Power.Numerator));
-- Integer case
if Dim_Power.Denominator = 1 then
Store_String_Char (')');
-- Rational case when denominator /= 1
else
Store_String_Char ('/');
Store_String_Int (Int (Dim_Power.Denominator));
Store_String_Char (')');
end if;
end if;
end if;
end loop;
return End_String;
end From_Dim_To_Str_Of_Unit_Symbols;
---------
-- GCD --
---------
function GCD (Left, Right : Whole) return Int is
L : Whole;
R : Whole;
begin
L := Left;
R := Right;
while R /= 0 loop
L := L mod R;
if L = 0 then
return Int (R);
end if;
R := R mod L;
end loop;
return Int (L);
end GCD;
--------------------------
-- Has_Dimension_System --
--------------------------
function Has_Dimension_System (Typ : Entity_Id) return Boolean is
begin
return Exists (System_Of (Typ));
end Has_Dimension_System;
------------------------------
-- Is_Dim_IO_Package_Entity --
------------------------------
function Is_Dim_IO_Package_Entity (E : Entity_Id) return Boolean is
begin
-- Check the package entity corresponds to System.Dim.Float_IO or
-- System.Dim.Integer_IO.
return
Is_RTU (E, System_Dim_Float_IO)
or else
Is_RTU (E, System_Dim_Integer_IO);
end Is_Dim_IO_Package_Entity;
-------------------------------------
-- Is_Dim_IO_Package_Instantiation --
-------------------------------------
function Is_Dim_IO_Package_Instantiation (N : Node_Id) return Boolean is
Gen_Id : constant Node_Id := Name (N);
begin
-- Check that the instantiated package is either System.Dim.Float_IO
-- or System.Dim.Integer_IO.
return
Is_Entity_Name (Gen_Id)
and then Is_Dim_IO_Package_Entity (Entity (Gen_Id));
end Is_Dim_IO_Package_Instantiation;
----------------
-- Is_Invalid --
----------------
function Is_Invalid (Position : Dimension_Position) return Boolean is
begin
return Position = Invalid_Position;
end Is_Invalid;
---------------------
-- Move_Dimensions --
---------------------
procedure Move_Dimensions (From, To : Node_Id) is
begin
if Ada_Version < Ada_2012 then
return;
end if;
-- Copy the dimension of 'From to 'To' and remove dimension of 'From'
Copy_Dimensions (From, To);
Remove_Dimensions (From);
end Move_Dimensions;
---------------------------------------
-- New_Copy_Tree_And_Copy_Dimensions --
---------------------------------------
function New_Copy_Tree_And_Copy_Dimensions
(Source : Node_Id;
Map : Elist_Id := No_Elist;
New_Sloc : Source_Ptr := No_Location;
New_Scope : Entity_Id := Empty) return Node_Id
is
New_Copy : constant Node_Id :=
New_Copy_Tree (Source, Map, New_Sloc, New_Scope);
begin
-- Move the dimensions of Source to New_Copy
Copy_Dimensions (Source, New_Copy);
return New_Copy;
end New_Copy_Tree_And_Copy_Dimensions;
------------
-- Reduce --
------------
function Reduce (X : Rational) return Rational is
begin
if X.Numerator = 0 then
return Zero;
end if;
declare
G : constant Int := GCD (X.Numerator, X.Denominator);
begin
return Rational'(Numerator => Whole (Int (X.Numerator) / G),
Denominator => Whole (Int (X.Denominator) / G));
end;
end Reduce;
-----------------------
-- Remove_Dimensions --
-----------------------
procedure Remove_Dimensions (N : Node_Id) is
Dims_Of_N : constant Dimension_Type := Dimensions_Of (N);
begin
if Exists (Dims_Of_N) then
Dimension_Table.Remove (N);
end if;
end Remove_Dimensions;
-----------------------------------
-- Remove_Dimension_In_Statement --
-----------------------------------
-- Removal of dimension in statement as part of the Analyze_Statements
-- routine (see package Sem_Ch5).
procedure Remove_Dimension_In_Statement (Stmt : Node_Id) is
begin
if Ada_Version < Ada_2012 then
return;
end if;
-- Remove dimension in parameter specifications for accept statement
if Nkind (Stmt) = N_Accept_Statement then
declare
Param : Node_Id := First (Parameter_Specifications (Stmt));
begin
while Present (Param) loop
Remove_Dimensions (Param);
Next (Param);
end loop;
end;
-- Remove dimension of name and expression in assignments
elsif Nkind (Stmt) = N_Assignment_Statement then
Remove_Dimensions (Expression (Stmt));
Remove_Dimensions (Name (Stmt));
end if;
end Remove_Dimension_In_Statement;
--------------------
-- Set_Dimensions --
--------------------
procedure Set_Dimensions (N : Node_Id; Val : Dimension_Type) is
begin
pragma Assert (OK_For_Dimension (Nkind (N)));
pragma Assert (Exists (Val));
Dimension_Table.Set (N, Val);
end Set_Dimensions;
----------------
-- Set_Symbol --
----------------
procedure Set_Symbol (E : Entity_Id; Val : String_Id) is
begin
Symbol_Table.Set (E, Val);
end Set_Symbol;
---------------
-- Symbol_Of --
---------------
function Symbol_Of (E : Entity_Id) return String_Id is
Subtype_Symbol : constant String_Id := Symbol_Table.Get (E);
begin
if Subtype_Symbol /= No_String then
return Subtype_Symbol;
else
return From_Dim_To_Str_Of_Unit_Symbols
(Dimensions_Of (E), System_Of (Base_Type (E)));
end if;
end Symbol_Of;
-----------------------
-- Symbol_Table_Hash --
-----------------------
function Symbol_Table_Hash (Key : Entity_Id) return Symbol_Table_Range is
begin
return Symbol_Table_Range (Key mod 511);
end Symbol_Table_Hash;
---------------
-- System_Of --
---------------
function System_Of (E : Entity_Id) return System_Type is
Type_Decl : constant Node_Id := Parent (E);
begin
-- Look for Type_Decl in System_Table
for Dim_Sys in 1 .. System_Table.Last loop
if Type_Decl = System_Table.Table (Dim_Sys).Type_Decl then
return System_Table.Table (Dim_Sys);
end if;
end loop;
return Null_System;
end System_Of;
end Sem_Dim;
|
258
|
ada
| 80
|
thindil/steamsky
|
src/bases-trade.ads
|
-- Copyright 2017-2021 <NAME>
--
-- This file is part of Steam Sky.
--
-- Steam Sky is free software: you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation, either version 3 of the License, or
-- (at your option) any later version.
--
-- Steam Sky is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with Steam Sky. If not, see <http://www.gnu.org/licenses/>.
-- ****h* Bases/BTrade
-- FUNCTION
-- Provide code for hiring recruits, buying recipes, heal and train crew
-- members in bases.
-- SOURCE
package Bases.Trade is
-- ****
-- ****e* BTrade/BTrade.Trade_Already_Known
-- FUNCTION
-- Raised when player known selected recipe
-- SOURCE
Trade_Already_Known: exception;
-- ****
-- ****e* BTrade/BTrade.Trade_Cant_Heal
-- FUNCTION
-- Raised when no crew members are wounded
-- SOURCE
Trade_Cant_Heal: exception;
-- ****
-- ****f* BTrade/BTrade.HireRecruit
-- FUNCTION
-- Hire selected recruit from bases and add him/her to player ship crew
-- PARAMETERS
-- RecruitIndex - Index of recruit, from base recruits list to hire
-- Cost - Cost of hire of selected recruit
-- DailyPayment - Daily payment of selected recruit
-- TradePayment - Percent of earnings from each trade which this recruit
-- will take
-- ContractLength - Length of the contract with this recruit in days. 0
-- means infinite contract
-- SOURCE
procedure HireRecruit
(RecruitIndex: Recruit_Container.Extended_Index; Cost: Positive;
DailyPayment, TradePayment: Natural; ContractLenght: Integer) with
Test_Case => (Name => "Test_HireRecruit", Mode => Robustness);
-- ****
-- ****f* BTrade/BTrade.BuyRecipe
-- FUNCTION
-- Buy new crafting recipe
-- PARAMETERS
-- RecipeIndex - Index of the recipe from base recipes list to buy
-- SOURCE
procedure BuyRecipe(RecipeIndex: Unbounded_String) with
Pre => (RecipeIndex /= Null_Unbounded_String),
Test_Case => (Name => "Test_BuyRecipe", Mode => Nominal);
-- ****
-- ****f* BTrade/BTrade.HealWounded
-- FUNCTION
-- Heals wounded crew members in bases
-- PARAMETERS
-- MemberIndex - Index of player ship crew member to heal or 0 for heal
-- all wounded crew members
-- SOURCE
procedure HealWounded(MemberIndex: Crew_Container.Extended_Index) with
Pre => (MemberIndex <= Player_Ship.Crew.Last_Index),
Test_Case => (Name => "Test_HealWounded", Mode => Nominal);
-- ****
-- ****f* BTrade/BTrade.HealCost
-- FUNCTION
-- Count cost of healing action
-- PARAMETERS
-- Cost - Overall cost of heal wounded player ship crew member(s)
-- Time - Time needed to heal wounded player ship crew member(s)
-- MemberIndex - Index of player ship crew member to heal or 0 for heal
-- all wounded crew members
-- RESULT
-- Parameters Cost and Time
-- SOURCE
procedure HealCost
(Cost, Time: in out Natural;
MemberIndex: Crew_Container.Extended_Index) with
Pre => MemberIndex <= Player_Ship.Crew.Last_Index,
Post => Cost > 0 and Time > 0,
Test_Case => (Name => "Test_HealCost", Mode => Nominal);
-- ****
-- ****f* BTrade/BTrade.TrainCost
-- FUNCTION
-- Count cost of training action
-- PARAMETERS
-- MemberIndex - Index of player ship crew member which will be training
-- SkillIndex - Index of skill of selected crew member which will be
-- training
-- RESULT
-- Overall cost of training selected skill by selected crew member.
-- Return 0 if the skill can't be trained because is maxed.
-- SOURCE
function TrainCost
(MemberIndex: Crew_Container.Extended_Index;
SkillIndex: Skills_Container.Extended_Index) return Natural with
Pre => MemberIndex in
Player_Ship.Crew.First_Index .. Player_Ship.Crew.Last_Index and
SkillIndex in 1 .. Skills_Amount,
Test_Case => (Name => "Test_TrainCost", Mode => Nominal);
-- ****
-- ****f* BTrade/BTrade.TrainSkill
-- FUNCTION
-- Train selected skill
-- PARAMETERS
-- MemberIndex - Index of Player_Ship crew member which train
-- SkillIndex - Index of skill of selected crew member to train
-- Amount - How many times train or how many money spend on training
-- Is_Amount - If true, Amount variable is how many times train,
-- otherwise it is amount of money to spend
-- SOURCE
procedure TrainSkill
(MemberIndex: Crew_Container.Extended_Index;
SkillIndex: Skills_Container.Extended_Index; Amount: Positive;
Is_Amount: Boolean := True) with
Pre => MemberIndex in
Player_Ship.Crew.First_Index .. Player_Ship.Crew.Last_Index and
SkillIndex in 1 .. Skills_Amount,
Test_Case => (Name => "Test_TrainSkill", Mode => Nominal);
-- ****
end Bases.Trade;
|
259
|
ada
| 8
|
pvrego/adaino
|
examples/usart_interruptive_echo_issue_dbg/src/test.adb
|
<reponame>pvrego/adaino
with AVR;
with AVR.USART;
package body Test is
procedure Handle_Interrupt_USART1_RX is
Curr_Buffer : AVR.Byte_Type;
begin
Curr_Buffer := AVR.USART.Reg_USART1.UDR;
AVR.USART.Reg_USART1.UDR := Curr_Buffer;
end Handle_Interrupt_USART1_RX;
end Test;
|
260
|
ada
| 1
|
mapcode-foundation/mapcode-ada
|
src/mapcodes-languages.ads
|
<reponame>mapcode-foundation/mapcode-ada<gh_stars>1-10
-- -----------------------------------------------------------------------------
-- Copyright (C) 2003-2019 Stichting Mapcode Foundation (http://www.mapcode.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-- -----------------------------------------------------------------------------
with Language_Defs, Language_Utils;
package Mapcodes.Languages is
-- The supported languages
-- The language names in Roman are the Mixed_Str images of these enums
type Language_List is new Language_Defs.Language_List;
-- Roman, Greek, Cyrillic, Hebrew, Devanagari, Malayalam, Georgian, Katakana,
-- Thai, Lao, Armenian, Bengali, Gurmukhi, Tibetan, Arabic, Korean, Burmese,
-- Khmer, Sinhalese, Thaana, Chinese, Tifinagh, Tamil, Amharic, Telugu, Odia,
-- Kannada, Gujarati
-- The unicode sequence to provide a language name in its language
subtype Unicode_Sequence is Language_Utils.Unicode_Sequence;
-- Get the Language from its name in its language
-- Raises, if the output language is not known:
Unknown_Language : exception;
function Get_Language (Name : Unicode_Sequence) return Language_List;
-- Get the language of a text (territory name or mapcode)
-- All the characters must be of the same language, otherwise raises
Invalid_Text : exception;
function Get_Language (Input : Wide_String) return Language_List;
-- The default language
Default_Language : constant Language_List := Roman;
-- Conversion of a text (territory name or mapcode) into a given language
-- The language of the input is detected automatically
-- Raises Invalid_Text if the input is not valid
function Convert (Input : Wide_String;
Output_Language : Language_List := Default_Language)
return Wide_String;
end Mapcodes.Languages;
|
261
|
ada
| 1
|
gregorymorrison/euler1
|
ada/euler1_3.adb
|
<gh_stars>1-10
-- Euler1 in Ada
with Ada.Integer_Text_IO;
procedure Euler1_3 is
function Euler(n : in Integer; acc : in Integer := 0) return Integer is
begin
if n = 0 then
return acc;
elsif n mod 3 = 0 or n mod 5 = 0 then
return Euler(n-1, acc+n);
else
return Euler(n-1, acc);
end if;
end Euler;
begin
Ada.Integer_Text_IO.Put (Integer( Euler(n => 999) ));
end Euler1_3;
|
262
|
ada
| 12
|
TUM-EI-RCS/StratoX
|
bug-reports/incorrect-pre-proof/src/main.adb
|
<reponame>TUM-EI-RCS/StratoX
with foo; use foo;
with Interfaces; use Interfaces;
-- GNATprove GPL 2016 seems to miss a failed precondition check
-- in the call at line 18. Reason is insufficient knowledge on
-- others=>, causing a false negative there, which in turn hides
-- a serious bug.
-- Fixed in GNATprove Pro 18 (and presumably later in GPL 2017)
procedure main with SPARK_Mode is
-- inlined callee
procedure bar (d : out Data_Type)
is begin
--pragma Assert (d'Length > 0);
d := (others => 0); -- with this, GNATprove does not find violation in line 18
pragma Annotate (GNATprove, False_Positive, "length check might fail", "insufficient solver knowledge");
pragma Assert_And_Cut (d'Length >= 0);
--d (d'First) := 0; -- with this, GNATprove indeed finds a violation in line 18
end bar;
arr : Data_Type (0 .. 91) := (others => 0);
i32 : Integer_32;
begin
bar (arr); -- essential
i32 := foo.toInteger_32 (arr (60 .. 64)); -- length check proved, but actually exception
end main;
|
263
|
ada
| 0
|
50m-regent/HelloWorldExibition
|
showroom/ada.adb
|
<gh_stars>0
with Ada.Text_IO;
procedure Prologue is
begin
Ada.Text_IO.Put("Hello World!");
end Prologue;
|
264
|
ada
| 9
|
AntonMeep/parse_args
|
src/parse_args-integer_array_options.ads
|
-- parse_args-integer_array_options.ads
-- A simple command line option parser
-- Copyright (c) 2015, <NAME>
--
-- Permission to use, copy, modify, and/or distribute this software for any
-- purpose with or without fee is hereby granted, provided that the above
-- copyright notice and this permission notice appear in all copies.
--
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
-- REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
-- AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
-- INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
-- LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
-- OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
-- PERFORMANCE OF THIS SOFTWARE.
with Parse_Args.Generic_Discrete_Array_Options;
package Parse_Args.Integer_Array_Options is
type Integer_Array is array (Integer range <>) of Integer;
type Integer_Array_Access is access Integer_Array;
package Inner is new Generic_Discrete_Array_Options(Element => Integer,
Element_Array => Integer_Array,
Element_Array_Access => Integer_Array_Access
);
subtype Element_Array_Option is Inner.Element_Array_Option;
function Image (O : in Element_Array_Option) return String renames Inner.Image;
function Value (O : in Element_Array_Option) return Integer_Array_Access renames Inner.Value;
function Value(A : in Argument_Parser; Name : in String) return Integer_Array_Access renames Inner.Value;
function Make_Option return Option_Ptr renames Inner.Make_Option;
end Parse_Args.Integer_Array_Options;
|
265
|
ada
| 4
|
carter-e-veldhuizen/RACK
|
ada/examples/regression/regression_library.adb
|
<filename>ada/examples/regression/regression_library.adb
package body Regression_Library is
function LibraryFun (Input : Boolean) return Boolean is
begin
return False;
end;
end Regression_Library;
|
266
|
ada
| 3
|
stcarrez/ada-stemmer
|
src/lang/stemmer-turkish.adb
|
<reponame>stcarrez/ada-stemmer
-- Generated by Snowball 2.2.0 - https://snowballstem.org/
package body Stemmer.Turkish is
pragma Style_Checks ("-mr");
pragma Warnings (Off, "*variable*is never read and never assigned*");
pragma Warnings (Off, "*mode could be*instead of*");
pragma Warnings (Off, "*formal parameter.*is not modified*");
pragma Warnings (Off, "*this line is too long*");
pragma Warnings (Off, "*is not referenced*");
procedure R_Stem_suffix_chain_before_ki (Z : in out Context_Type; Result : out Boolean);
procedure R_Stem_noun_suffixes (Z : in out Context_Type; Result : out Boolean);
procedure R_Stem_nominal_verb_suffixes (Z : in out Context_Type; Result : out Boolean);
procedure R_Postlude (Z : in out Context_Type; Result : out Boolean);
procedure R_Post_process_last_consonants (Z : in out Context_Type; Result : out Boolean);
procedure R_More_than_one_syllable_word (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_suffix_with_optional_s_consonant (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_suffix_with_optional_n_consonant (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_suffix_with_optional_U_vowel (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_suffix_with_optional_y_consonant (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_ysA (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_ymUs_E (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_yken (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_yDU (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_yUz (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_yUm (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_yU (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_ylA (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_yA (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_possessives (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_sUnUz (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_sUn (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_sU (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_nUz (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_nUn (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_nU (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_ndAn (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_ndA (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_ncA (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_nA (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_lArI (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_lAr (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_ki (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_DUr (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_DAn (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_DA (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_cAsInA (Z : in out Context_Type; Result : out Boolean);
procedure R_Is_reserved_word (Z : in out Context_Type; Result : out Boolean);
procedure R_Check_vowel_harmony (Z : in out Context_Type; Result : out Boolean);
procedure R_Append_U_to_stems_ending_with_d_or_g (Z : in out Context_Type; Result : out Boolean);
G_Vowel : constant Grouping_Array (0 .. 215) := (
True, False, False, False, True, False, False, False,
True, False, False, False, False, False, True, False,
False, False, False, False, True, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, True, False, False,
False, False, False, True, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
True, False, False, False, False, False, False, False
);
G_U : constant Grouping_Array (0 .. 207) := (
True, False, False, False, False, False, False, False,
False, False, False, False, True, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, True, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
True, False, False, False, False, False, False, False
);
G_Vowel1 : constant Grouping_Array (0 .. 215) := (
True, False, False, False, False, False, False, False,
False, False, False, False, False, False, True, False,
False, False, False, False, True, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
True, False, False, False, False, False, False, False
);
G_Vowel2 : constant Grouping_Array (0 .. 151) := (
True, False, False, False, True, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, True, False, False, False, False, False, True
);
G_Vowel3 : constant Grouping_Array (0 .. 215) := (
True, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
True, False, False, False, False, False, False, False
);
G_Vowel4 : constant Grouping_Array (0 .. 7) := (
True, False, False, False, True, False, False, False
);
G_Vowel5 : constant Grouping_Array (0 .. 7) := (
True, False, False, False, False, False, True, False
);
G_Vowel6 : constant Grouping_Array (0 .. 7) := (
True, False, False, False, False, False, True, False
);
Among_String : constant String := "m" & "n" & "miz" & "niz" & "muz"
& "nuz" & "mız" & "nız" & "müz" & "nüz" & "leri" & "ları" & "ni" & "nu"
& "nı" & "nü" & "in" & "un" & "ın" & "ün" & "a" & "e" & "na" & "ne" & "da"
& "ta" & "de" & "te" & "nda" & "nde" & "dan" & "tan" & "den" & "ten" & "ndan"
& "nden" & "la" & "le" & "ca" & "ce" & "im" & "um" & "ım" & "üm" & "sin"
& "sun" & "sın" & "sün" & "iz" & "uz" & "ız" & "üz" & "siniz" & "sunuz"
& "sınız" & "sünüz" & "lar" & "ler" & "niz" & "nuz" & "nız" & "nüz" & "dir"
& "tir" & "dur" & "tur" & "dır" & "tır" & "dür" & "tür" & "casına"
& "cesine" & "di" & "ti" & "dik" & "tik" & "duk" & "tuk" & "dık" & "tık"
& "dük" & "tük" & "dim" & "tim" & "dum" & "tum" & "dım" & "tım" & "düm"
& "tüm" & "din" & "tin" & "dun" & "tun" & "dın" & "tın" & "dün" & "tün"
& "du" & "tu" & "dı" & "tı" & "dü" & "tü" & "sa" & "se" & "sak" & "sek"
& "sam" & "sem" & "san" & "sen" & "miş" & "muş" & "mış" & "müş" & "b" & "c"
& "d" & "ğ";
A_0 : constant Among_Array_Type (0 .. 9) := (
(1, 1, -1, -1, 0),
(2, 2, -1, -1, 0),
(3, 5, -1, -1, 0),
(6, 8, -1, -1, 0),
(9, 11, -1, -1, 0),
(12, 14, -1, -1, 0),
(15, 18, -1, -1, 0),
(19, 22, -1, -1, 0),
(23, 26, -1, -1, 0),
(27, 30, -1, -1, 0));
A_1 : constant Among_Array_Type (0 .. 1) := (
(31, 34, -1, -1, 0),
(35, 39, -1, -1, 0));
A_2 : constant Among_Array_Type (0 .. 3) := (
(40, 41, -1, -1, 0),
(42, 43, -1, -1, 0),
(44, 46, -1, -1, 0),
(47, 49, -1, -1, 0));
A_3 : constant Among_Array_Type (0 .. 3) := (
(50, 51, -1, -1, 0),
(52, 53, -1, -1, 0),
(54, 56, -1, -1, 0),
(57, 59, -1, -1, 0));
A_4 : constant Among_Array_Type (0 .. 1) := (
(60, 60, -1, -1, 0),
(61, 61, -1, -1, 0));
A_5 : constant Among_Array_Type (0 .. 1) := (
(62, 63, -1, -1, 0),
(64, 65, -1, -1, 0));
A_6 : constant Among_Array_Type (0 .. 3) := (
(66, 67, -1, -1, 0),
(68, 69, -1, -1, 0),
(70, 71, -1, -1, 0),
(72, 73, -1, -1, 0));
A_7 : constant Among_Array_Type (0 .. 1) := (
(74, 76, -1, -1, 0),
(77, 79, -1, -1, 0));
A_8 : constant Among_Array_Type (0 .. 3) := (
(80, 82, -1, -1, 0),
(83, 85, -1, -1, 0),
(86, 88, -1, -1, 0),
(89, 91, -1, -1, 0));
A_9 : constant Among_Array_Type (0 .. 1) := (
(92, 95, -1, -1, 0),
(96, 99, -1, -1, 0));
A_10 : constant Among_Array_Type (0 .. 1) := (
(100, 101, -1, -1, 0),
(102, 103, -1, -1, 0));
A_11 : constant Among_Array_Type (0 .. 1) := (
(104, 105, -1, -1, 0),
(106, 107, -1, -1, 0));
A_12 : constant Among_Array_Type (0 .. 3) := (
(108, 109, -1, -1, 0),
(110, 111, -1, -1, 0),
(112, 114, -1, -1, 0),
(115, 117, -1, -1, 0));
A_13 : constant Among_Array_Type (0 .. 3) := (
(118, 120, -1, -1, 0),
(121, 123, -1, -1, 0),
(124, 127, -1, -1, 0),
(128, 131, -1, -1, 0));
A_14 : constant Among_Array_Type (0 .. 3) := (
(132, 133, -1, -1, 0),
(134, 135, -1, -1, 0),
(136, 138, -1, -1, 0),
(139, 141, -1, -1, 0));
A_15 : constant Among_Array_Type (0 .. 3) := (
(142, 146, -1, -1, 0),
(147, 151, -1, -1, 0),
(152, 158, -1, -1, 0),
(159, 165, -1, -1, 0));
A_16 : constant Among_Array_Type (0 .. 1) := (
(166, 168, -1, -1, 0),
(169, 171, -1, -1, 0));
A_17 : constant Among_Array_Type (0 .. 3) := (
(172, 174, -1, -1, 0),
(175, 177, -1, -1, 0),
(178, 181, -1, -1, 0),
(182, 185, -1, -1, 0));
A_18 : constant Among_Array_Type (0 .. 7) := (
(186, 188, -1, -1, 0),
(189, 191, -1, -1, 0),
(192, 194, -1, -1, 0),
(195, 197, -1, -1, 0),
(198, 201, -1, -1, 0),
(202, 205, -1, -1, 0),
(206, 209, -1, -1, 0),
(210, 213, -1, -1, 0));
A_19 : constant Among_Array_Type (0 .. 1) := (
(214, 220, -1, -1, 0),
(221, 226, -1, -1, 0));
A_20 : constant Among_Array_Type (0 .. 31) := (
(227, 228, -1, -1, 0),
(229, 230, -1, -1, 0),
(231, 233, -1, -1, 0),
(234, 236, -1, -1, 0),
(237, 239, -1, -1, 0),
(240, 242, -1, -1, 0),
(243, 246, -1, -1, 0),
(247, 250, -1, -1, 0),
(251, 254, -1, -1, 0),
(255, 258, -1, -1, 0),
(259, 261, -1, -1, 0),
(262, 264, -1, -1, 0),
(265, 267, -1, -1, 0),
(268, 270, -1, -1, 0),
(271, 274, -1, -1, 0),
(275, 278, -1, -1, 0),
(279, 282, -1, -1, 0),
(283, 286, -1, -1, 0),
(287, 289, -1, -1, 0),
(290, 292, -1, -1, 0),
(293, 295, -1, -1, 0),
(296, 298, -1, -1, 0),
(299, 302, -1, -1, 0),
(303, 306, -1, -1, 0),
(307, 310, -1, -1, 0),
(311, 314, -1, -1, 0),
(315, 316, -1, -1, 0),
(317, 318, -1, -1, 0),
(319, 321, -1, -1, 0),
(322, 324, -1, -1, 0),
(325, 327, -1, -1, 0),
(328, 330, -1, -1, 0));
A_21 : constant Among_Array_Type (0 .. 7) := (
(331, 332, -1, -1, 0),
(333, 334, -1, -1, 0),
(335, 337, -1, -1, 0),
(338, 340, -1, -1, 0),
(341, 343, -1, -1, 0),
(344, 346, -1, -1, 0),
(347, 349, -1, -1, 0),
(350, 352, -1, -1, 0));
A_22 : constant Among_Array_Type (0 .. 3) := (
(353, 356, -1, -1, 0),
(357, 360, -1, -1, 0),
(361, 365, -1, -1, 0),
(366, 370, -1, -1, 0));
A_23 : constant Among_Array_Type (0 .. 3) := (
(371, 371, -1, 1, 0),
(372, 372, -1, 2, 0),
(373, 373, -1, 3, 0),
(374, 375, -1, 4, 0));
procedure R_Check_vowel_harmony (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
v_1 : Char_Index;
v_2 : Char_Index;
begin
-- test, line 110
v_1 := Z.L - Z.C;
-- (, line 111
-- goto, line 112
Out_Grouping_Backward (Z, G_Vowel, 97, 305, True, C); if C < 0 then
Result := False;
return;
end if;
-- or, line 114
v_2 := Z.L - Z.C;
-- (, line 114
-- literal, line 114
C := Eq_S_Backward (Z, "a");
if C = 0 then
goto lab2;
end if;
Z.C := Z.C - C;
-- goto, line 114
Out_Grouping_Backward (Z, G_Vowel1, 97, 305, True, C); if C < 0 then
goto lab2;
end if;
goto lab1;
<<lab2>>
Z.C := Z.L - v_2;
-- (, line 115
-- literal, line 115
C := Eq_S_Backward (Z, "e");
if C = 0 then
goto lab4;
end if;
Z.C := Z.C - C;
-- goto, line 115
Out_Grouping_Backward (Z, G_Vowel2, 101, 252, True, C); if C < 0 then
goto lab4;
end if;
goto lab1;
<<lab4>>
Z.C := Z.L - v_2;
-- (, line 116
-- literal, line 116
C := Eq_S_Backward (Z, "ı");
if C = 0 then
goto lab6;
end if;
Z.C := Z.C - C;
-- goto, line 116
Out_Grouping_Backward (Z, G_Vowel3, 97, 305, True, C); if C < 0 then
goto lab6;
end if;
goto lab1;
<<lab6>>
Z.C := Z.L - v_2;
-- (, line 117
-- literal, line 117
C := Eq_S_Backward (Z, "i");
if C = 0 then
goto lab8;
end if;
Z.C := Z.C - C;
-- goto, line 117
Out_Grouping_Backward (Z, G_Vowel4, 101, 105, True, C); if C < 0 then
goto lab8;
end if;
goto lab1;
<<lab8>>
Z.C := Z.L - v_2;
-- (, line 118
-- literal, line 118
C := Eq_S_Backward (Z, "o");
if C = 0 then
goto lab10;
end if;
Z.C := Z.C - C;
-- goto, line 118
Out_Grouping_Backward (Z, G_Vowel5, 111, 117, True, C); if C < 0 then
goto lab10;
end if;
goto lab1;
<<lab10>>
Z.C := Z.L - v_2;
-- (, line 119
-- literal, line 119
C := Eq_S_Backward (Z, "ö");
if C = 0 then
goto lab12;
end if;
Z.C := Z.C - C;
-- goto, line 119
Out_Grouping_Backward (Z, G_Vowel6, 246, 252, True, C); if C < 0 then
goto lab12;
end if;
goto lab1;
<<lab12>>
Z.C := Z.L - v_2;
-- (, line 120
-- literal, line 120
C := Eq_S_Backward (Z, "u");
if C = 0 then
goto lab14;
end if;
Z.C := Z.C - C;
-- goto, line 120
Out_Grouping_Backward (Z, G_Vowel5, 111, 117, True, C); if C < 0 then
goto lab14;
end if;
goto lab1;
<<lab14>>
Z.C := Z.L - v_2;
-- (, line 121
-- literal, line 121
C := Eq_S_Backward (Z, "ü");
if C = 0 then
Result := False;
return;
end if;
Z.C := Z.C - C;
-- goto, line 121
Out_Grouping_Backward (Z, G_Vowel6, 246, 252, True, C); if C < 0 then
Result := False;
return;
end if;
<<lab1>>
Z.C := Z.L - v_1;
Result := True;
end R_Check_vowel_harmony;
procedure R_Mark_suffix_with_optional_n_consonant (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
v_1 : Char_Index;
v_2 : Char_Index;
v_3 : Char_Index;
v_4 : Char_Index;
v_5 : Char_Index;
begin
-- or, line 132
v_1 := Z.L - Z.C;
-- (, line 131
-- literal, line 131
C := Eq_S_Backward (Z, "n");
if C = 0 then
goto lab1;
end if;
Z.C := Z.C - C;
-- test, line 131
v_2 := Z.L - Z.C;
In_Grouping_Backward (Z, G_Vowel, 97, 305, False, C);
if C /= 0 then
goto lab1;
end if;
Z.C := Z.L - v_2;
goto lab0;
<<lab1>>
Z.C := Z.L - v_1;
-- (, line 133
-- not, line 133
v_3 := Z.L - Z.C;
-- test, line 133
v_4 := Z.L - Z.C;
-- literal, line 133
C := Eq_S_Backward (Z, "n");
if C = 0 then
goto lab2;
end if;
Z.C := Z.C - C;
Z.C := Z.L - v_4;
Result := False;
return;
<<lab2>>
Z.C := Z.L - v_3;
-- test, line 133
v_5 := Z.L - Z.C;
-- (, line 133
-- next, line 133
C := Skip_Utf8_Backward (Z);
if C < 0 then
Result := False;
return;
end if;
Z.C := C;
In_Grouping_Backward (Z, G_Vowel, 97, 305, False, C);
if C /= 0 then
Result := False;
return;
end if;
Z.C := Z.L - v_5;
<<lab0>>
Result := True;
end R_Mark_suffix_with_optional_n_consonant;
procedure R_Mark_suffix_with_optional_s_consonant (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
v_1 : Char_Index;
v_2 : Char_Index;
v_3 : Char_Index;
v_4 : Char_Index;
v_5 : Char_Index;
begin
-- or, line 143
v_1 := Z.L - Z.C;
-- (, line 142
-- literal, line 142
C := Eq_S_Backward (Z, "s");
if C = 0 then
goto lab1;
end if;
Z.C := Z.C - C;
-- test, line 142
v_2 := Z.L - Z.C;
In_Grouping_Backward (Z, G_Vowel, 97, 305, False, C);
if C /= 0 then
goto lab1;
end if;
Z.C := Z.L - v_2;
goto lab0;
<<lab1>>
Z.C := Z.L - v_1;
-- (, line 144
-- not, line 144
v_3 := Z.L - Z.C;
-- test, line 144
v_4 := Z.L - Z.C;
-- literal, line 144
C := Eq_S_Backward (Z, "s");
if C = 0 then
goto lab2;
end if;
Z.C := Z.C - C;
Z.C := Z.L - v_4;
Result := False;
return;
<<lab2>>
Z.C := Z.L - v_3;
-- test, line 144
v_5 := Z.L - Z.C;
-- (, line 144
-- next, line 144
C := Skip_Utf8_Backward (Z);
if C < 0 then
Result := False;
return;
end if;
Z.C := C;
In_Grouping_Backward (Z, G_Vowel, 97, 305, False, C);
if C /= 0 then
Result := False;
return;
end if;
Z.C := Z.L - v_5;
<<lab0>>
Result := True;
end R_Mark_suffix_with_optional_s_consonant;
procedure R_Mark_suffix_with_optional_y_consonant (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
v_1 : Char_Index;
v_2 : Char_Index;
v_3 : Char_Index;
v_4 : Char_Index;
v_5 : Char_Index;
begin
-- or, line 153
v_1 := Z.L - Z.C;
-- (, line 152
-- literal, line 152
C := Eq_S_Backward (Z, "y");
if C = 0 then
goto lab1;
end if;
Z.C := Z.C - C;
-- test, line 152
v_2 := Z.L - Z.C;
In_Grouping_Backward (Z, G_Vowel, 97, 305, False, C);
if C /= 0 then
goto lab1;
end if;
Z.C := Z.L - v_2;
goto lab0;
<<lab1>>
Z.C := Z.L - v_1;
-- (, line 154
-- not, line 154
v_3 := Z.L - Z.C;
-- test, line 154
v_4 := Z.L - Z.C;
-- literal, line 154
C := Eq_S_Backward (Z, "y");
if C = 0 then
goto lab2;
end if;
Z.C := Z.C - C;
Z.C := Z.L - v_4;
Result := False;
return;
<<lab2>>
Z.C := Z.L - v_3;
-- test, line 154
v_5 := Z.L - Z.C;
-- (, line 154
-- next, line 154
C := Skip_Utf8_Backward (Z);
if C < 0 then
Result := False;
return;
end if;
Z.C := C;
In_Grouping_Backward (Z, G_Vowel, 97, 305, False, C);
if C /= 0 then
Result := False;
return;
end if;
Z.C := Z.L - v_5;
<<lab0>>
Result := True;
end R_Mark_suffix_with_optional_y_consonant;
procedure R_Mark_suffix_with_optional_U_vowel (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
v_1 : Char_Index;
v_2 : Char_Index;
v_3 : Char_Index;
v_4 : Char_Index;
v_5 : Char_Index;
begin
-- or, line 159
v_1 := Z.L - Z.C;
-- (, line 158
In_Grouping_Backward (Z, G_U, 105, 305, False, C);
if C /= 0 then
goto lab1;
end if;
-- test, line 158
v_2 := Z.L - Z.C;
Out_Grouping_Backward (Z, G_Vowel, 97, 305, False, C);
if C /= 0 then
goto lab1;
end if;
Z.C := Z.L - v_2;
goto lab0;
<<lab1>>
Z.C := Z.L - v_1;
-- (, line 160
-- not, line 160
v_3 := Z.L - Z.C;
-- test, line 160
v_4 := Z.L - Z.C;
In_Grouping_Backward (Z, G_U, 105, 305, False, C);
if C /= 0 then
goto lab2;
end if;
Z.C := Z.L - v_4;
Result := False;
return;
<<lab2>>
Z.C := Z.L - v_3;
-- test, line 160
v_5 := Z.L - Z.C;
-- (, line 160
-- next, line 160
C := Skip_Utf8_Backward (Z);
if C < 0 then
Result := False;
return;
end if;
Z.C := C;
Out_Grouping_Backward (Z, G_Vowel, 97, 305, False, C);
if C /= 0 then
Result := False;
return;
end if;
Z.C := Z.L - v_5;
<<lab0>>
Result := True;
end R_Mark_suffix_with_optional_U_vowel;
procedure R_Mark_possessives (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- (, line 164
-- among, line 165
if Z.C <= Z.Lb or else Check_Among (Z, Z.C - 1, 3, 16#4006000#) then
Result := False;
return;
-- among, line 165
end if;
Find_Among_Backward (Z, A_0, Among_String, null, A);
if A = 0 then
Result := False;
return;
end if;
-- call mark_suffix_with_optional_U_vowel, line 167
R_Mark_suffix_with_optional_U_vowel (Z, Result);
if not Result then
Result := False;
return;
end if;
Result := True;
end R_Mark_possessives;
procedure R_Mark_sU (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- (, line 170
-- call check_vowel_harmony, line 171
R_Check_vowel_harmony (Z, Result);
if not Result then
Result := False;
return;
end if;
In_Grouping_Backward (Z, G_U, 105, 305, False, C);
if C /= 0 then
Result := False;
return;
end if;
-- call mark_suffix_with_optional_s_consonant, line 173
R_Mark_suffix_with_optional_s_consonant (Z, Result);
if not Result then
Result := False;
return;
end if;
Result := True;
end R_Mark_sU;
procedure R_Mark_lArI (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- among, line 177
if Z.C - 3 <= Z.Lb or else (Character'Pos (Z.P (Z.C)) /= 105 and then Character'Pos (Z.P (Z.C)) /= 177) then
Result := False;
return;
-- among, line 177
end if;
Find_Among_Backward (Z, A_1, Among_String, null, A);
if A = 0 then
Result := False;
return;
end if;
Result := True;
end R_Mark_lArI;
procedure R_Mark_yU (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- (, line 180
-- call check_vowel_harmony, line 181
R_Check_vowel_harmony (Z, Result);
if not Result then
Result := False;
return;
end if;
In_Grouping_Backward (Z, G_U, 105, 305, False, C);
if C /= 0 then
Result := False;
return;
end if;
-- call mark_suffix_with_optional_y_consonant, line 183
R_Mark_suffix_with_optional_y_consonant (Z, Result);
if not Result then
Result := False;
return;
end if;
Result := True;
end R_Mark_yU;
procedure R_Mark_nU (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- (, line 186
-- call check_vowel_harmony, line 187
R_Check_vowel_harmony (Z, Result);
if not Result then
Result := False;
return;
end if;
-- among, line 188
Find_Among_Backward (Z, A_2, Among_String, null, A);
if A = 0 then
Result := False;
return;
end if;
Result := True;
end R_Mark_nU;
procedure R_Mark_nUn (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- (, line 191
-- call check_vowel_harmony, line 192
R_Check_vowel_harmony (Z, Result);
if not Result then
Result := False;
return;
end if;
-- among, line 193
if Z.C - 1 <= Z.Lb or else Character'Pos (Z.P (Z.C)) /= 110 then
Result := False;
return;
-- among, line 193
end if;
Find_Among_Backward (Z, A_3, Among_String, null, A);
if A = 0 then
Result := False;
return;
end if;
-- call mark_suffix_with_optional_n_consonant, line 194
R_Mark_suffix_with_optional_n_consonant (Z, Result);
if not Result then
Result := False;
return;
end if;
Result := True;
end R_Mark_nUn;
procedure R_Mark_yA (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- (, line 197
-- call check_vowel_harmony, line 198
R_Check_vowel_harmony (Z, Result);
if not Result then
Result := False;
return;
end if;
-- among, line 199
if Z.C <= Z.Lb or else (Character'Pos (Z.P (Z.C)) /= 97 and then Character'Pos (Z.P (Z.C)) /= 101) then
Result := False;
return;
-- among, line 199
end if;
Find_Among_Backward (Z, A_4, Among_String, null, A);
if A = 0 then
Result := False;
return;
end if;
-- call mark_suffix_with_optional_y_consonant, line 200
R_Mark_suffix_with_optional_y_consonant (Z, Result);
if not Result then
Result := False;
return;
end if;
Result := True;
end R_Mark_yA;
procedure R_Mark_nA (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- (, line 203
-- call check_vowel_harmony, line 204
R_Check_vowel_harmony (Z, Result);
if not Result then
Result := False;
return;
end if;
-- among, line 205
if Z.C - 1 <= Z.Lb or else (Character'Pos (Z.P (Z.C)) /= 97 and then Character'Pos (Z.P (Z.C)) /= 101) then
Result := False;
return;
-- among, line 205
end if;
Find_Among_Backward (Z, A_5, Among_String, null, A);
if A = 0 then
Result := False;
return;
end if;
Result := True;
end R_Mark_nA;
procedure R_Mark_DA (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- (, line 208
-- call check_vowel_harmony, line 209
R_Check_vowel_harmony (Z, Result);
if not Result then
Result := False;
return;
end if;
-- among, line 210
if Z.C - 1 <= Z.Lb or else (Character'Pos (Z.P (Z.C)) /= 97 and then Character'Pos (Z.P (Z.C)) /= 101) then
Result := False;
return;
-- among, line 210
end if;
Find_Among_Backward (Z, A_6, Among_String, null, A);
if A = 0 then
Result := False;
return;
end if;
Result := True;
end R_Mark_DA;
procedure R_Mark_ndA (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- (, line 213
-- call check_vowel_harmony, line 214
R_Check_vowel_harmony (Z, Result);
if not Result then
Result := False;
return;
end if;
-- among, line 215
if Z.C - 2 <= Z.Lb or else (Character'Pos (Z.P (Z.C)) /= 97 and then Character'Pos (Z.P (Z.C)) /= 101) then
Result := False;
return;
-- among, line 215
end if;
Find_Among_Backward (Z, A_7, Among_String, null, A);
if A = 0 then
Result := False;
return;
end if;
Result := True;
end R_Mark_ndA;
procedure R_Mark_DAn (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- (, line 218
-- call check_vowel_harmony, line 219
R_Check_vowel_harmony (Z, Result);
if not Result then
Result := False;
return;
end if;
-- among, line 220
if Z.C - 2 <= Z.Lb or else Character'Pos (Z.P (Z.C)) /= 110 then
Result := False;
return;
-- among, line 220
end if;
Find_Among_Backward (Z, A_8, Among_String, null, A);
if A = 0 then
Result := False;
return;
end if;
Result := True;
end R_Mark_DAn;
procedure R_Mark_ndAn (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- (, line 223
-- call check_vowel_harmony, line 224
R_Check_vowel_harmony (Z, Result);
if not Result then
Result := False;
return;
end if;
-- among, line 225
if Z.C - 3 <= Z.Lb or else Character'Pos (Z.P (Z.C)) /= 110 then
Result := False;
return;
-- among, line 225
end if;
Find_Among_Backward (Z, A_9, Among_String, null, A);
if A = 0 then
Result := False;
return;
end if;
Result := True;
end R_Mark_ndAn;
procedure R_Mark_ylA (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- (, line 228
-- call check_vowel_harmony, line 229
R_Check_vowel_harmony (Z, Result);
if not Result then
Result := False;
return;
end if;
-- among, line 230
if Z.C - 1 <= Z.Lb or else (Character'Pos (Z.P (Z.C)) /= 97 and then Character'Pos (Z.P (Z.C)) /= 101) then
Result := False;
return;
-- among, line 230
end if;
Find_Among_Backward (Z, A_10, Among_String, null, A);
if A = 0 then
Result := False;
return;
end if;
-- call mark_suffix_with_optional_y_consonant, line 231
R_Mark_suffix_with_optional_y_consonant (Z, Result);
if not Result then
Result := False;
return;
end if;
Result := True;
end R_Mark_ylA;
procedure R_Mark_ki (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- literal, line 235
C := Eq_S_Backward (Z, "ki");
if C = 0 then
Result := False;
return;
end if;
Z.C := Z.C - C;
Result := True;
end R_Mark_ki;
procedure R_Mark_ncA (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- (, line 238
-- call check_vowel_harmony, line 239
R_Check_vowel_harmony (Z, Result);
if not Result then
Result := False;
return;
end if;
-- among, line 240
if Z.C - 1 <= Z.Lb or else (Character'Pos (Z.P (Z.C)) /= 97 and then Character'Pos (Z.P (Z.C)) /= 101) then
Result := False;
return;
-- among, line 240
end if;
Find_Among_Backward (Z, A_11, Among_String, null, A);
if A = 0 then
Result := False;
return;
end if;
-- call mark_suffix_with_optional_n_consonant, line 241
R_Mark_suffix_with_optional_n_consonant (Z, Result);
if not Result then
Result := False;
return;
end if;
Result := True;
end R_Mark_ncA;
procedure R_Mark_yUm (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- (, line 244
-- call check_vowel_harmony, line 245
R_Check_vowel_harmony (Z, Result);
if not Result then
Result := False;
return;
end if;
-- among, line 246
if Z.C - 1 <= Z.Lb or else Character'Pos (Z.P (Z.C)) /= 109 then
Result := False;
return;
-- among, line 246
end if;
Find_Among_Backward (Z, A_12, Among_String, null, A);
if A = 0 then
Result := False;
return;
end if;
-- call mark_suffix_with_optional_y_consonant, line 247
R_Mark_suffix_with_optional_y_consonant (Z, Result);
if not Result then
Result := False;
return;
end if;
Result := True;
end R_Mark_yUm;
procedure R_Mark_sUn (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- (, line 250
-- call check_vowel_harmony, line 251
R_Check_vowel_harmony (Z, Result);
if not Result then
Result := False;
return;
end if;
-- among, line 252
if Z.C - 2 <= Z.Lb or else Character'Pos (Z.P (Z.C)) /= 110 then
Result := False;
return;
-- among, line 252
end if;
Find_Among_Backward (Z, A_13, Among_String, null, A);
if A = 0 then
Result := False;
return;
end if;
Result := True;
end R_Mark_sUn;
procedure R_Mark_yUz (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- (, line 255
-- call check_vowel_harmony, line 256
R_Check_vowel_harmony (Z, Result);
if not Result then
Result := False;
return;
end if;
-- among, line 257
if Z.C - 1 <= Z.Lb or else Character'Pos (Z.P (Z.C)) /= 122 then
Result := False;
return;
-- among, line 257
end if;
Find_Among_Backward (Z, A_14, Among_String, null, A);
if A = 0 then
Result := False;
return;
end if;
-- call mark_suffix_with_optional_y_consonant, line 258
R_Mark_suffix_with_optional_y_consonant (Z, Result);
if not Result then
Result := False;
return;
end if;
Result := True;
end R_Mark_yUz;
procedure R_Mark_sUnUz (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- among, line 262
if Z.C - 4 <= Z.Lb or else Character'Pos (Z.P (Z.C)) /= 122 then
Result := False;
return;
-- among, line 262
end if;
Find_Among_Backward (Z, A_15, Among_String, null, A);
if A = 0 then
Result := False;
return;
end if;
Result := True;
end R_Mark_sUnUz;
procedure R_Mark_lAr (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- (, line 265
-- call check_vowel_harmony, line 266
R_Check_vowel_harmony (Z, Result);
if not Result then
Result := False;
return;
end if;
-- among, line 267
if Z.C - 2 <= Z.Lb or else Character'Pos (Z.P (Z.C)) /= 114 then
Result := False;
return;
-- among, line 267
end if;
Find_Among_Backward (Z, A_16, Among_String, null, A);
if A = 0 then
Result := False;
return;
end if;
Result := True;
end R_Mark_lAr;
procedure R_Mark_nUz (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- (, line 270
-- call check_vowel_harmony, line 271
R_Check_vowel_harmony (Z, Result);
if not Result then
Result := False;
return;
end if;
-- among, line 272
if Z.C - 2 <= Z.Lb or else Character'Pos (Z.P (Z.C)) /= 122 then
Result := False;
return;
-- among, line 272
end if;
Find_Among_Backward (Z, A_17, Among_String, null, A);
if A = 0 then
Result := False;
return;
end if;
Result := True;
end R_Mark_nUz;
procedure R_Mark_DUr (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- (, line 275
-- call check_vowel_harmony, line 276
R_Check_vowel_harmony (Z, Result);
if not Result then
Result := False;
return;
end if;
-- among, line 277
if Z.C - 2 <= Z.Lb or else Character'Pos (Z.P (Z.C)) /= 114 then
Result := False;
return;
-- among, line 277
end if;
Find_Among_Backward (Z, A_18, Among_String, null, A);
if A = 0 then
Result := False;
return;
end if;
Result := True;
end R_Mark_DUr;
procedure R_Mark_cAsInA (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- among, line 281
if Z.C - 5 <= Z.Lb or else (Character'Pos (Z.P (Z.C)) /= 97 and then Character'Pos (Z.P (Z.C)) /= 101) then
Result := False;
return;
-- among, line 281
end if;
Find_Among_Backward (Z, A_19, Among_String, null, A);
if A = 0 then
Result := False;
return;
end if;
Result := True;
end R_Mark_cAsInA;
procedure R_Mark_yDU (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- (, line 284
-- call check_vowel_harmony, line 285
R_Check_vowel_harmony (Z, Result);
if not Result then
Result := False;
return;
end if;
-- among, line 286
Find_Among_Backward (Z, A_20, Among_String, null, A);
if A = 0 then
Result := False;
return;
end if;
-- call mark_suffix_with_optional_y_consonant, line 290
R_Mark_suffix_with_optional_y_consonant (Z, Result);
if not Result then
Result := False;
return;
end if;
Result := True;
end R_Mark_yDU;
procedure R_Mark_ysA (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- (, line 294
-- among, line 295
if Z.C - 1 <= Z.Lb or else Check_Among (Z, Z.C - 1, 3, 16#6822#) then
Result := False;
return;
-- among, line 295
end if;
Find_Among_Backward (Z, A_21, Among_String, null, A);
if A = 0 then
Result := False;
return;
end if;
-- call mark_suffix_with_optional_y_consonant, line 296
R_Mark_suffix_with_optional_y_consonant (Z, Result);
if not Result then
Result := False;
return;
end if;
Result := True;
end R_Mark_ysA;
procedure R_Mark_ymUs_E (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- (, line 299
-- call check_vowel_harmony, line 300
R_Check_vowel_harmony (Z, Result);
if not Result then
Result := False;
return;
end if;
-- among, line 301
if Z.C - 3 <= Z.Lb or else Character'Pos (Z.P (Z.C)) /= 159 then
Result := False;
return;
-- among, line 301
end if;
Find_Among_Backward (Z, A_22, Among_String, null, A);
if A = 0 then
Result := False;
return;
end if;
-- call mark_suffix_with_optional_y_consonant, line 302
R_Mark_suffix_with_optional_y_consonant (Z, Result);
if not Result then
Result := False;
return;
end if;
Result := True;
end R_Mark_ymUs_E;
procedure R_Mark_yken (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- (, line 305
-- literal, line 306
C := Eq_S_Backward (Z, "ken");
if C = 0 then
Result := False;
return;
end if;
Z.C := Z.C - C;
-- call mark_suffix_with_optional_y_consonant, line 306
R_Mark_suffix_with_optional_y_consonant (Z, Result);
if not Result then
Result := False;
return;
end if;
Result := True;
end R_Mark_yken;
procedure R_Stem_nominal_verb_suffixes (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
v_1 : Char_Index;
v_2 : Char_Index;
v_3 : Char_Index;
v_4 : Char_Index;
v_5 : Char_Index;
v_6 : Char_Index;
v_7 : Char_Index;
v_8 : Char_Index;
v_9 : Char_Index;
v_10 : Char_Index;
begin
-- (, line 309
Z.Ket := Z.C; -- [, line 310
-- set continue_stemming_noun_suffixes, line 311
Z.B_Continue_stemming_noun_suffixes := True;
-- or, line 313
v_1 := Z.L - Z.C;
-- or, line 312
v_2 := Z.L - Z.C;
-- call mark_ymUs_, line 312
R_Mark_ymUs_E (Z, Result);
if not Result then
goto lab3;
end if;
goto lab2;
<<lab3>>
Z.C := Z.L - v_2;
-- call mark_yDU, line 312
R_Mark_yDU (Z, Result);
if not Result then
goto lab4;
end if;
goto lab2;
<<lab4>>
Z.C := Z.L - v_2;
-- call mark_ysA, line 312
R_Mark_ysA (Z, Result);
if not Result then
goto lab5;
end if;
goto lab2;
<<lab5>>
Z.C := Z.L - v_2;
-- call mark_yken, line 312
R_Mark_yken (Z, Result);
if not Result then
goto lab1;
end if;
<<lab2>>
goto lab0;
<<lab1>>
Z.C := Z.L - v_1;
-- (, line 314
-- call mark_cAsInA, line 314
R_Mark_cAsInA (Z, Result);
if not Result then
goto lab6;
end if;
-- or, line 314
v_3 := Z.L - Z.C;
-- call mark_sUnUz, line 314
R_Mark_sUnUz (Z, Result);
if not Result then
goto lab8;
end if;
goto lab7;
<<lab8>>
Z.C := Z.L - v_3;
-- call mark_lAr, line 314
R_Mark_lAr (Z, Result);
if not Result then
goto lab9;
end if;
goto lab7;
<<lab9>>
Z.C := Z.L - v_3;
-- call mark_yUm, line 314
R_Mark_yUm (Z, Result);
if not Result then
goto lab10;
end if;
goto lab7;
<<lab10>>
Z.C := Z.L - v_3;
-- call mark_sUn, line 314
R_Mark_sUn (Z, Result);
if not Result then
goto lab11;
end if;
goto lab7;
<<lab11>>
Z.C := Z.L - v_3;
-- call mark_yUz, line 314
R_Mark_yUz (Z, Result);
if not Result then
goto lab12;
end if;
goto lab7;
<<lab12>>
Z.C := Z.L - v_3;
<<lab7>>
-- call mark_ymUs_, line 314
R_Mark_ymUs_E (Z, Result);
if not Result then
goto lab6;
end if;
goto lab0;
<<lab6>>
Z.C := Z.L - v_1;
-- (, line 316
-- call mark_lAr, line 317
R_Mark_lAr (Z, Result);
if not Result then
goto lab13;
end if;
Z.Bra := Z.C; -- ], line 317
-- delete, line 317
Slice_Del (Z);
-- try, line 317
v_4 := Z.L - Z.C;
-- (, line 317
Z.Ket := Z.C; -- [, line 317
-- or, line 317
v_5 := Z.L - Z.C;
-- call mark_DUr, line 317
R_Mark_DUr (Z, Result);
if not Result then
goto lab16;
end if;
goto lab15;
<<lab16>>
Z.C := Z.L - v_5;
-- call mark_yDU, line 317
R_Mark_yDU (Z, Result);
if not Result then
goto lab17;
end if;
goto lab15;
<<lab17>>
Z.C := Z.L - v_5;
-- call mark_ysA, line 317
R_Mark_ysA (Z, Result);
if not Result then
goto lab18;
end if;
goto lab15;
<<lab18>>
Z.C := Z.L - v_5;
-- call mark_ymUs_, line 317
R_Mark_ymUs_E (Z, Result);
if not Result then
Z.C := Z.L - v_4;
goto lab14;
end if;
<<lab15>>
<<lab14>>
-- unset continue_stemming_noun_suffixes, line 318
Z.B_Continue_stemming_noun_suffixes := False;
goto lab0;
<<lab13>>
Z.C := Z.L - v_1;
-- (, line 321
-- call mark_nUz, line 321
R_Mark_nUz (Z, Result);
if not Result then
goto lab19;
end if;
-- or, line 321
v_6 := Z.L - Z.C;
-- call mark_yDU, line 321
R_Mark_yDU (Z, Result);
if not Result then
goto lab21;
end if;
goto lab20;
<<lab21>>
Z.C := Z.L - v_6;
-- call mark_ysA, line 321
R_Mark_ysA (Z, Result);
if not Result then
goto lab19;
end if;
<<lab20>>
goto lab0;
<<lab19>>
Z.C := Z.L - v_1;
-- (, line 323
-- or, line 323
v_7 := Z.L - Z.C;
-- call mark_sUnUz, line 323
R_Mark_sUnUz (Z, Result);
if not Result then
goto lab24;
end if;
goto lab23;
<<lab24>>
Z.C := Z.L - v_7;
-- call mark_yUz, line 323
R_Mark_yUz (Z, Result);
if not Result then
goto lab25;
end if;
goto lab23;
<<lab25>>
Z.C := Z.L - v_7;
-- call mark_sUn, line 323
R_Mark_sUn (Z, Result);
if not Result then
goto lab26;
end if;
goto lab23;
<<lab26>>
Z.C := Z.L - v_7;
-- call mark_yUm, line 323
R_Mark_yUm (Z, Result);
if not Result then
goto lab22;
end if;
<<lab23>>
Z.Bra := Z.C; -- ], line 323
-- delete, line 323
Slice_Del (Z);
-- try, line 323
v_8 := Z.L - Z.C;
-- (, line 323
Z.Ket := Z.C; -- [, line 323
-- call mark_ymUs_, line 323
R_Mark_ymUs_E (Z, Result);
if not Result then
Z.C := Z.L - v_8;
goto lab27;
end if;
<<lab27>>
goto lab0;
<<lab22>>
Z.C := Z.L - v_1;
-- (, line 325
-- call mark_DUr, line 325
R_Mark_DUr (Z, Result);
if not Result then
Result := False;
return;
end if;
Z.Bra := Z.C; -- ], line 325
-- delete, line 325
Slice_Del (Z);
-- try, line 325
v_9 := Z.L - Z.C;
-- (, line 325
Z.Ket := Z.C; -- [, line 325
-- or, line 325
v_10 := Z.L - Z.C;
-- call mark_sUnUz, line 325
R_Mark_sUnUz (Z, Result);
if not Result then
goto lab30;
end if;
goto lab29;
<<lab30>>
Z.C := Z.L - v_10;
-- call mark_lAr, line 325
R_Mark_lAr (Z, Result);
if not Result then
goto lab31;
end if;
goto lab29;
<<lab31>>
Z.C := Z.L - v_10;
-- call mark_yUm, line 325
R_Mark_yUm (Z, Result);
if not Result then
goto lab32;
end if;
goto lab29;
<<lab32>>
Z.C := Z.L - v_10;
-- call mark_sUn, line 325
R_Mark_sUn (Z, Result);
if not Result then
goto lab33;
end if;
goto lab29;
<<lab33>>
Z.C := Z.L - v_10;
-- call mark_yUz, line 325
R_Mark_yUz (Z, Result);
if not Result then
goto lab34;
end if;
goto lab29;
<<lab34>>
Z.C := Z.L - v_10;
<<lab29>>
-- call mark_ymUs_, line 325
R_Mark_ymUs_E (Z, Result);
if not Result then
Z.C := Z.L - v_9;
goto lab28;
end if;
<<lab28>>
<<lab0>>
Z.Bra := Z.C; -- ], line 326
-- delete, line 326
Slice_Del (Z);
Result := True;
end R_Stem_nominal_verb_suffixes;
procedure R_Stem_suffix_chain_before_ki (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
v_1 : Char_Index;
v_2 : Char_Index;
v_3 : Char_Index;
v_4 : Char_Index;
v_5 : Char_Index;
v_6 : Char_Index;
v_7 : Char_Index;
v_8 : Char_Index;
v_9 : Char_Index;
v_10 : Char_Index;
v_11 : Char_Index;
begin
-- (, line 330
Z.Ket := Z.C; -- [, line 331
-- call mark_ki, line 332
R_Mark_ki (Z, Result);
if not Result then
Result := False;
return;
end if;
-- or, line 340
v_1 := Z.L - Z.C;
-- (, line 334
-- call mark_DA, line 334
R_Mark_DA (Z, Result);
if not Result then
goto lab1;
end if;
Z.Bra := Z.C; -- ], line 334
-- delete, line 334
Slice_Del (Z);
-- try, line 334
v_2 := Z.L - Z.C;
-- (, line 334
Z.Ket := Z.C; -- [, line 334
-- or, line 336
v_3 := Z.L - Z.C;
-- (, line 335
-- call mark_lAr, line 335
R_Mark_lAr (Z, Result);
if not Result then
goto lab4;
end if;
Z.Bra := Z.C; -- ], line 335
-- delete, line 335
Slice_Del (Z);
-- try, line 335
v_4 := Z.L - Z.C;
-- call stem_suffix_chain_before_ki, line 335
R_Stem_suffix_chain_before_ki (Z, Result);
if not Result then
Z.C := Z.L - v_4;
goto lab5;
end if;
<<lab5>>
goto lab3;
<<lab4>>
Z.C := Z.L - v_3;
-- (, line 337
-- call mark_possessives, line 337
R_Mark_possessives (Z, Result);
if not Result then
Z.C := Z.L - v_2;
goto lab2;
end if;
Z.Bra := Z.C; -- ], line 337
-- delete, line 337
Slice_Del (Z);
-- try, line 337
v_5 := Z.L - Z.C;
-- (, line 337
Z.Ket := Z.C; -- [, line 337
-- call mark_lAr, line 337
R_Mark_lAr (Z, Result);
if not Result then
Z.C := Z.L - v_5;
goto lab6;
end if;
Z.Bra := Z.C; -- ], line 337
-- delete, line 337
Slice_Del (Z);
-- call stem_suffix_chain_before_ki, line 337
R_Stem_suffix_chain_before_ki (Z, Result);
if not Result then
Z.C := Z.L - v_5;
goto lab6;
end if;
<<lab6>>
<<lab3>>
<<lab2>>
goto lab0;
<<lab1>>
Z.C := Z.L - v_1;
-- (, line 341
-- call mark_nUn, line 341
R_Mark_nUn (Z, Result);
if not Result then
goto lab7;
end if;
Z.Bra := Z.C; -- ], line 341
-- delete, line 341
Slice_Del (Z);
-- try, line 341
v_6 := Z.L - Z.C;
-- (, line 341
Z.Ket := Z.C; -- [, line 341
-- or, line 343
v_7 := Z.L - Z.C;
-- (, line 342
-- call mark_lArI, line 342
R_Mark_lArI (Z, Result);
if not Result then
goto lab10;
end if;
Z.Bra := Z.C; -- ], line 342
-- delete, line 342
Slice_Del (Z);
goto lab9;
<<lab10>>
Z.C := Z.L - v_7;
-- (, line 344
Z.Ket := Z.C; -- [, line 344
-- or, line 344
v_8 := Z.L - Z.C;
-- call mark_possessives, line 344
R_Mark_possessives (Z, Result);
if not Result then
goto lab13;
end if;
goto lab12;
<<lab13>>
Z.C := Z.L - v_8;
-- call mark_sU, line 344
R_Mark_sU (Z, Result);
if not Result then
goto lab11;
end if;
<<lab12>>
Z.Bra := Z.C; -- ], line 344
-- delete, line 344
Slice_Del (Z);
-- try, line 344
v_9 := Z.L - Z.C;
-- (, line 344
Z.Ket := Z.C; -- [, line 344
-- call mark_lAr, line 344
R_Mark_lAr (Z, Result);
if not Result then
Z.C := Z.L - v_9;
goto lab14;
end if;
Z.Bra := Z.C; -- ], line 344
-- delete, line 344
Slice_Del (Z);
-- call stem_suffix_chain_before_ki, line 344
R_Stem_suffix_chain_before_ki (Z, Result);
if not Result then
Z.C := Z.L - v_9;
goto lab14;
end if;
<<lab14>>
goto lab9;
<<lab11>>
Z.C := Z.L - v_7;
-- call stem_suffix_chain_before_ki, line 346
R_Stem_suffix_chain_before_ki (Z, Result);
if not Result then
Z.C := Z.L - v_6;
goto lab8;
end if;
<<lab9>>
<<lab8>>
goto lab0;
<<lab7>>
Z.C := Z.L - v_1;
-- (, line 349
-- call mark_ndA, line 349
R_Mark_ndA (Z, Result);
if not Result then
Result := False;
return;
end if;
-- or, line 351
v_10 := Z.L - Z.C;
-- (, line 350
-- call mark_lArI, line 350
R_Mark_lArI (Z, Result);
if not Result then
goto lab16;
end if;
Z.Bra := Z.C; -- ], line 350
-- delete, line 350
Slice_Del (Z);
goto lab15;
<<lab16>>
Z.C := Z.L - v_10;
-- (, line 352
-- call mark_sU, line 352
R_Mark_sU (Z, Result);
if not Result then
goto lab17;
end if;
Z.Bra := Z.C; -- ], line 352
-- delete, line 352
Slice_Del (Z);
-- try, line 352
v_11 := Z.L - Z.C;
-- (, line 352
Z.Ket := Z.C; -- [, line 352
-- call mark_lAr, line 352
R_Mark_lAr (Z, Result);
if not Result then
Z.C := Z.L - v_11;
goto lab18;
end if;
Z.Bra := Z.C; -- ], line 352
-- delete, line 352
Slice_Del (Z);
-- call stem_suffix_chain_before_ki, line 352
R_Stem_suffix_chain_before_ki (Z, Result);
if not Result then
Z.C := Z.L - v_11;
goto lab18;
end if;
<<lab18>>
goto lab15;
<<lab17>>
Z.C := Z.L - v_10;
-- call stem_suffix_chain_before_ki, line 354
R_Stem_suffix_chain_before_ki (Z, Result);
if not Result then
Result := False;
return;
end if;
<<lab15>>
<<lab0>>
Result := True;
end R_Stem_suffix_chain_before_ki;
procedure R_Stem_noun_suffixes (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
v_1 : Char_Index;
v_2 : Char_Index;
v_3 : Char_Index;
v_4 : Char_Index;
v_5 : Char_Index;
v_6 : Char_Index;
v_7 : Char_Index;
v_8 : Char_Index;
v_9 : Char_Index;
v_10 : Char_Index;
v_11 : Char_Index;
v_12 : Char_Index;
v_13 : Char_Index;
v_14 : Char_Index;
v_15 : Char_Index;
v_16 : Char_Index;
v_17 : Char_Index;
v_18 : Char_Index;
v_19 : Char_Index;
v_20 : Char_Index;
v_21 : Char_Index;
v_22 : Char_Index;
v_23 : Char_Index;
v_24 : Char_Index;
v_25 : Char_Index;
v_26 : Char_Index;
v_27 : Char_Index;
begin
-- or, line 361
v_1 := Z.L - Z.C;
-- (, line 360
Z.Ket := Z.C; -- [, line 360
-- call mark_lAr, line 360
R_Mark_lAr (Z, Result);
if not Result then
goto lab1;
end if;
Z.Bra := Z.C; -- ], line 360
-- delete, line 360
Slice_Del (Z);
-- try, line 360
v_2 := Z.L - Z.C;
-- call stem_suffix_chain_before_ki, line 360
R_Stem_suffix_chain_before_ki (Z, Result);
if not Result then
Z.C := Z.L - v_2;
goto lab2;
end if;
<<lab2>>
goto lab0;
<<lab1>>
Z.C := Z.L - v_1;
-- (, line 362
Z.Ket := Z.C; -- [, line 362
-- call mark_ncA, line 362
R_Mark_ncA (Z, Result);
if not Result then
goto lab3;
end if;
Z.Bra := Z.C; -- ], line 362
-- delete, line 362
Slice_Del (Z);
-- try, line 363
v_3 := Z.L - Z.C;
-- or, line 365
v_4 := Z.L - Z.C;
-- (, line 364
Z.Ket := Z.C; -- [, line 364
-- call mark_lArI, line 364
R_Mark_lArI (Z, Result);
if not Result then
goto lab6;
end if;
Z.Bra := Z.C; -- ], line 364
-- delete, line 364
Slice_Del (Z);
goto lab5;
<<lab6>>
Z.C := Z.L - v_4;
-- (, line 366
Z.Ket := Z.C; -- [, line 366
-- or, line 366
v_5 := Z.L - Z.C;
-- call mark_possessives, line 366
R_Mark_possessives (Z, Result);
if not Result then
goto lab9;
end if;
goto lab8;
<<lab9>>
Z.C := Z.L - v_5;
-- call mark_sU, line 366
R_Mark_sU (Z, Result);
if not Result then
goto lab7;
end if;
<<lab8>>
Z.Bra := Z.C; -- ], line 366
-- delete, line 366
Slice_Del (Z);
-- try, line 366
v_6 := Z.L - Z.C;
-- (, line 366
Z.Ket := Z.C; -- [, line 366
-- call mark_lAr, line 366
R_Mark_lAr (Z, Result);
if not Result then
Z.C := Z.L - v_6;
goto lab10;
end if;
Z.Bra := Z.C; -- ], line 366
-- delete, line 366
Slice_Del (Z);
-- call stem_suffix_chain_before_ki, line 366
R_Stem_suffix_chain_before_ki (Z, Result);
if not Result then
Z.C := Z.L - v_6;
goto lab10;
end if;
<<lab10>>
goto lab5;
<<lab7>>
Z.C := Z.L - v_4;
-- (, line 368
Z.Ket := Z.C; -- [, line 368
-- call mark_lAr, line 368
R_Mark_lAr (Z, Result);
if not Result then
Z.C := Z.L - v_3;
goto lab4;
end if;
Z.Bra := Z.C; -- ], line 368
-- delete, line 368
Slice_Del (Z);
-- call stem_suffix_chain_before_ki, line 368
R_Stem_suffix_chain_before_ki (Z, Result);
if not Result then
Z.C := Z.L - v_3;
goto lab4;
end if;
<<lab5>>
<<lab4>>
goto lab0;
<<lab3>>
Z.C := Z.L - v_1;
-- (, line 372
Z.Ket := Z.C; -- [, line 372
-- or, line 372
v_7 := Z.L - Z.C;
-- call mark_ndA, line 372
R_Mark_ndA (Z, Result);
if not Result then
goto lab13;
end if;
goto lab12;
<<lab13>>
Z.C := Z.L - v_7;
-- call mark_nA, line 372
R_Mark_nA (Z, Result);
if not Result then
goto lab11;
end if;
<<lab12>>
-- or, line 375
v_8 := Z.L - Z.C;
-- (, line 374
-- call mark_lArI, line 374
R_Mark_lArI (Z, Result);
if not Result then
goto lab15;
end if;
Z.Bra := Z.C; -- ], line 374
-- delete, line 374
Slice_Del (Z);
goto lab14;
<<lab15>>
Z.C := Z.L - v_8;
-- (, line 376
-- call mark_sU, line 376
R_Mark_sU (Z, Result);
if not Result then
goto lab16;
end if;
Z.Bra := Z.C; -- ], line 376
-- delete, line 376
Slice_Del (Z);
-- try, line 376
v_9 := Z.L - Z.C;
-- (, line 376
Z.Ket := Z.C; -- [, line 376
-- call mark_lAr, line 376
R_Mark_lAr (Z, Result);
if not Result then
Z.C := Z.L - v_9;
goto lab17;
end if;
Z.Bra := Z.C; -- ], line 376
-- delete, line 376
Slice_Del (Z);
-- call stem_suffix_chain_before_ki, line 376
R_Stem_suffix_chain_before_ki (Z, Result);
if not Result then
Z.C := Z.L - v_9;
goto lab17;
end if;
<<lab17>>
goto lab14;
<<lab16>>
Z.C := Z.L - v_8;
-- call stem_suffix_chain_before_ki, line 378
R_Stem_suffix_chain_before_ki (Z, Result);
if not Result then
goto lab11;
end if;
<<lab14>>
goto lab0;
<<lab11>>
Z.C := Z.L - v_1;
-- (, line 382
Z.Ket := Z.C; -- [, line 382
-- or, line 382
v_10 := Z.L - Z.C;
-- call mark_ndAn, line 382
R_Mark_ndAn (Z, Result);
if not Result then
goto lab20;
end if;
goto lab19;
<<lab20>>
Z.C := Z.L - v_10;
-- call mark_nU, line 382
R_Mark_nU (Z, Result);
if not Result then
goto lab18;
end if;
<<lab19>>
-- or, line 382
v_11 := Z.L - Z.C;
-- (, line 382
-- call mark_sU, line 382
R_Mark_sU (Z, Result);
if not Result then
goto lab22;
end if;
Z.Bra := Z.C; -- ], line 382
-- delete, line 382
Slice_Del (Z);
-- try, line 382
v_12 := Z.L - Z.C;
-- (, line 382
Z.Ket := Z.C; -- [, line 382
-- call mark_lAr, line 382
R_Mark_lAr (Z, Result);
if not Result then
Z.C := Z.L - v_12;
goto lab23;
end if;
Z.Bra := Z.C; -- ], line 382
-- delete, line 382
Slice_Del (Z);
-- call stem_suffix_chain_before_ki, line 382
R_Stem_suffix_chain_before_ki (Z, Result);
if not Result then
Z.C := Z.L - v_12;
goto lab23;
end if;
<<lab23>>
goto lab21;
<<lab22>>
Z.C := Z.L - v_11;
-- call mark_lArI, line 382
R_Mark_lArI (Z, Result);
if not Result then
goto lab18;
end if;
<<lab21>>
goto lab0;
<<lab18>>
Z.C := Z.L - v_1;
-- (, line 384
Z.Ket := Z.C; -- [, line 384
-- call mark_DAn, line 384
R_Mark_DAn (Z, Result);
if not Result then
goto lab24;
end if;
Z.Bra := Z.C; -- ], line 384
-- delete, line 384
Slice_Del (Z);
-- try, line 384
v_13 := Z.L - Z.C;
-- (, line 384
Z.Ket := Z.C; -- [, line 384
-- or, line 387
v_14 := Z.L - Z.C;
-- (, line 386
-- call mark_possessives, line 386
R_Mark_possessives (Z, Result);
if not Result then
goto lab27;
end if;
Z.Bra := Z.C; -- ], line 386
-- delete, line 386
Slice_Del (Z);
-- try, line 386
v_15 := Z.L - Z.C;
-- (, line 386
Z.Ket := Z.C; -- [, line 386
-- call mark_lAr, line 386
R_Mark_lAr (Z, Result);
if not Result then
Z.C := Z.L - v_15;
goto lab28;
end if;
Z.Bra := Z.C; -- ], line 386
-- delete, line 386
Slice_Del (Z);
-- call stem_suffix_chain_before_ki, line 386
R_Stem_suffix_chain_before_ki (Z, Result);
if not Result then
Z.C := Z.L - v_15;
goto lab28;
end if;
<<lab28>>
goto lab26;
<<lab27>>
Z.C := Z.L - v_14;
-- (, line 388
-- call mark_lAr, line 388
R_Mark_lAr (Z, Result);
if not Result then
goto lab29;
end if;
Z.Bra := Z.C; -- ], line 388
-- delete, line 388
Slice_Del (Z);
-- try, line 388
v_16 := Z.L - Z.C;
-- call stem_suffix_chain_before_ki, line 388
R_Stem_suffix_chain_before_ki (Z, Result);
if not Result then
Z.C := Z.L - v_16;
goto lab30;
end if;
<<lab30>>
goto lab26;
<<lab29>>
Z.C := Z.L - v_14;
-- call stem_suffix_chain_before_ki, line 390
R_Stem_suffix_chain_before_ki (Z, Result);
if not Result then
Z.C := Z.L - v_13;
goto lab25;
end if;
<<lab26>>
<<lab25>>
goto lab0;
<<lab24>>
Z.C := Z.L - v_1;
-- (, line 394
Z.Ket := Z.C; -- [, line 394
-- or, line 394
v_17 := Z.L - Z.C;
-- call mark_nUn, line 394
R_Mark_nUn (Z, Result);
if not Result then
goto lab33;
end if;
goto lab32;
<<lab33>>
Z.C := Z.L - v_17;
-- call mark_ylA, line 394
R_Mark_ylA (Z, Result);
if not Result then
goto lab31;
end if;
<<lab32>>
Z.Bra := Z.C; -- ], line 394
-- delete, line 394
Slice_Del (Z);
-- try, line 395
v_18 := Z.L - Z.C;
-- or, line 397
v_19 := Z.L - Z.C;
-- (, line 396
Z.Ket := Z.C; -- [, line 396
-- call mark_lAr, line 396
R_Mark_lAr (Z, Result);
if not Result then
goto lab36;
end if;
Z.Bra := Z.C; -- ], line 396
-- delete, line 396
Slice_Del (Z);
-- call stem_suffix_chain_before_ki, line 396
R_Stem_suffix_chain_before_ki (Z, Result);
if not Result then
goto lab36;
end if;
goto lab35;
<<lab36>>
Z.C := Z.L - v_19;
-- (, line 398
Z.Ket := Z.C; -- [, line 398
-- or, line 398
v_20 := Z.L - Z.C;
-- call mark_possessives, line 398
R_Mark_possessives (Z, Result);
if not Result then
goto lab39;
end if;
goto lab38;
<<lab39>>
Z.C := Z.L - v_20;
-- call mark_sU, line 398
R_Mark_sU (Z, Result);
if not Result then
goto lab37;
end if;
<<lab38>>
Z.Bra := Z.C; -- ], line 398
-- delete, line 398
Slice_Del (Z);
-- try, line 398
v_21 := Z.L - Z.C;
-- (, line 398
Z.Ket := Z.C; -- [, line 398
-- call mark_lAr, line 398
R_Mark_lAr (Z, Result);
if not Result then
Z.C := Z.L - v_21;
goto lab40;
end if;
Z.Bra := Z.C; -- ], line 398
-- delete, line 398
Slice_Del (Z);
-- call stem_suffix_chain_before_ki, line 398
R_Stem_suffix_chain_before_ki (Z, Result);
if not Result then
Z.C := Z.L - v_21;
goto lab40;
end if;
<<lab40>>
goto lab35;
<<lab37>>
Z.C := Z.L - v_19;
-- call stem_suffix_chain_before_ki, line 400
R_Stem_suffix_chain_before_ki (Z, Result);
if not Result then
Z.C := Z.L - v_18;
goto lab34;
end if;
<<lab35>>
<<lab34>>
goto lab0;
<<lab31>>
Z.C := Z.L - v_1;
-- (, line 404
Z.Ket := Z.C; -- [, line 404
-- call mark_lArI, line 404
R_Mark_lArI (Z, Result);
if not Result then
goto lab41;
end if;
Z.Bra := Z.C; -- ], line 404
-- delete, line 404
Slice_Del (Z);
goto lab0;
<<lab41>>
Z.C := Z.L - v_1;
-- call stem_suffix_chain_before_ki, line 406
R_Stem_suffix_chain_before_ki (Z, Result);
if not Result then
goto lab42;
end if;
goto lab0;
<<lab42>>
Z.C := Z.L - v_1;
-- (, line 408
Z.Ket := Z.C; -- [, line 408
-- or, line 408
v_22 := Z.L - Z.C;
-- call mark_DA, line 408
R_Mark_DA (Z, Result);
if not Result then
goto lab45;
end if;
goto lab44;
<<lab45>>
Z.C := Z.L - v_22;
-- call mark_yU, line 408
R_Mark_yU (Z, Result);
if not Result then
goto lab46;
end if;
goto lab44;
<<lab46>>
Z.C := Z.L - v_22;
-- call mark_yA, line 408
R_Mark_yA (Z, Result);
if not Result then
goto lab43;
end if;
<<lab44>>
Z.Bra := Z.C; -- ], line 408
-- delete, line 408
Slice_Del (Z);
-- try, line 408
v_23 := Z.L - Z.C;
-- (, line 408
Z.Ket := Z.C; -- [, line 408
-- or, line 408
v_24 := Z.L - Z.C;
-- (, line 408
-- call mark_possessives, line 408
R_Mark_possessives (Z, Result);
if not Result then
goto lab49;
end if;
Z.Bra := Z.C; -- ], line 408
-- delete, line 408
Slice_Del (Z);
-- try, line 408
v_25 := Z.L - Z.C;
-- (, line 408
Z.Ket := Z.C; -- [, line 408
-- call mark_lAr, line 408
R_Mark_lAr (Z, Result);
if not Result then
Z.C := Z.L - v_25;
goto lab50;
end if;
<<lab50>>
goto lab48;
<<lab49>>
Z.C := Z.L - v_24;
-- call mark_lAr, line 408
R_Mark_lAr (Z, Result);
if not Result then
Z.C := Z.L - v_23;
goto lab47;
end if;
<<lab48>>
Z.Bra := Z.C; -- ], line 408
-- delete, line 408
Slice_Del (Z);
Z.Ket := Z.C; -- [, line 408
-- call stem_suffix_chain_before_ki, line 408
R_Stem_suffix_chain_before_ki (Z, Result);
if not Result then
Z.C := Z.L - v_23;
goto lab47;
end if;
<<lab47>>
goto lab0;
<<lab43>>
Z.C := Z.L - v_1;
-- (, line 410
Z.Ket := Z.C; -- [, line 410
-- or, line 410
v_26 := Z.L - Z.C;
-- call mark_possessives, line 410
R_Mark_possessives (Z, Result);
if not Result then
goto lab52;
end if;
goto lab51;
<<lab52>>
Z.C := Z.L - v_26;
-- call mark_sU, line 410
R_Mark_sU (Z, Result);
if not Result then
Result := False;
return;
end if;
<<lab51>>
Z.Bra := Z.C; -- ], line 410
-- delete, line 410
Slice_Del (Z);
-- try, line 410
v_27 := Z.L - Z.C;
-- (, line 410
Z.Ket := Z.C; -- [, line 410
-- call mark_lAr, line 410
R_Mark_lAr (Z, Result);
if not Result then
Z.C := Z.L - v_27;
goto lab53;
end if;
Z.Bra := Z.C; -- ], line 410
-- delete, line 410
Slice_Del (Z);
-- call stem_suffix_chain_before_ki, line 410
R_Stem_suffix_chain_before_ki (Z, Result);
if not Result then
Z.C := Z.L - v_27;
goto lab53;
end if;
<<lab53>>
<<lab0>>
Result := True;
end R_Stem_noun_suffixes;
procedure R_Post_process_last_consonants (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
begin
-- (, line 413
Z.Ket := Z.C; -- [, line 414
-- substring, line 414
Find_Among_Backward (Z, A_23, Among_String, null, A);
if A = 0 then
Result := False;
return;
end if;
Z.Bra := Z.C; -- ], line 414
-- among, line 414
case A is
when 1 =>
-- (, line 415
-- <-, line 415
Slice_From (Z, "p");
when 2 =>
-- (, line 416
-- <-, line 416
Slice_From (Z, "ç");
when 3 =>
-- (, line 417
-- <-, line 417
Slice_From (Z, "t");
when 4 =>
-- (, line 418
-- <-, line 418
Slice_From (Z, "k");
when others =>
null;
end case;
Result := True;
end R_Post_process_last_consonants;
procedure R_Append_U_to_stems_ending_with_d_or_g (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
v_1 : Char_Index;
v_2 : Char_Index;
v_3 : Char_Index;
v_4 : Char_Index;
v_5 : Char_Index;
v_6 : Char_Index;
v_7 : Char_Index;
v_8 : Char_Index;
v_9 : Char_Index;
v_10 : Char_Index;
v_11 : Char_Index;
begin
-- (, line 428
-- test, line 429
v_1 := Z.L - Z.C;
-- or, line 429
v_2 := Z.L - Z.C;
-- literal, line 429
C := Eq_S_Backward (Z, "d");
if C = 0 then
goto lab1;
end if;
Z.C := Z.C - C;
goto lab0;
<<lab1>>
Z.C := Z.L - v_2;
-- literal, line 429
C := Eq_S_Backward (Z, "g");
if C = 0 then
Result := False;
return;
end if;
Z.C := Z.C - C;
<<lab0>>
Z.C := Z.L - v_1;
-- or, line 431
v_3 := Z.L - Z.C;
-- (, line 430
-- test, line 430
v_4 := Z.L - Z.C;
-- (, line 430
-- goto, line 430
Out_Grouping_Backward (Z, G_Vowel, 97, 305, True, C); if C < 0 then
goto lab3;
end if;
-- or, line 430
v_5 := Z.L - Z.C;
-- literal, line 430
C := Eq_S_Backward (Z, "a");
if C = 0 then
goto lab6;
end if;
Z.C := Z.C - C;
goto lab5;
<<lab6>>
Z.C := Z.L - v_5;
-- literal, line 430
C := Eq_S_Backward (Z, "ı");
if C = 0 then
goto lab3;
end if;
Z.C := Z.C - C;
<<lab5>>
Z.C := Z.L - v_4;
-- <+, line 430
C := Z.C;
Insert (Z, Z.C, Z.C, "ı");
Z.C := C;
goto lab2;
<<lab3>>
Z.C := Z.L - v_3;
-- (, line 432
-- test, line 432
v_6 := Z.L - Z.C;
-- (, line 432
-- goto, line 432
Out_Grouping_Backward (Z, G_Vowel, 97, 305, True, C); if C < 0 then
goto lab7;
end if;
-- or, line 432
v_7 := Z.L - Z.C;
-- literal, line 432
C := Eq_S_Backward (Z, "e");
if C = 0 then
goto lab10;
end if;
Z.C := Z.C - C;
goto lab9;
<<lab10>>
Z.C := Z.L - v_7;
-- literal, line 432
C := Eq_S_Backward (Z, "i");
if C = 0 then
goto lab7;
end if;
Z.C := Z.C - C;
<<lab9>>
Z.C := Z.L - v_6;
-- <+, line 432
C := Z.C;
Insert (Z, Z.C, Z.C, "i");
Z.C := C;
goto lab2;
<<lab7>>
Z.C := Z.L - v_3;
-- (, line 434
-- test, line 434
v_8 := Z.L - Z.C;
-- (, line 434
-- goto, line 434
Out_Grouping_Backward (Z, G_Vowel, 97, 305, True, C); if C < 0 then
goto lab11;
end if;
-- or, line 434
v_9 := Z.L - Z.C;
-- literal, line 434
C := Eq_S_Backward (Z, "o");
if C = 0 then
goto lab14;
end if;
Z.C := Z.C - C;
goto lab13;
<<lab14>>
Z.C := Z.L - v_9;
-- literal, line 434
C := Eq_S_Backward (Z, "u");
if C = 0 then
goto lab11;
end if;
Z.C := Z.C - C;
<<lab13>>
Z.C := Z.L - v_8;
-- <+, line 434
C := Z.C;
Insert (Z, Z.C, Z.C, "u");
Z.C := C;
goto lab2;
<<lab11>>
Z.C := Z.L - v_3;
-- (, line 436
-- test, line 436
v_10 := Z.L - Z.C;
-- (, line 436
-- goto, line 436
Out_Grouping_Backward (Z, G_Vowel, 97, 305, True, C); if C < 0 then
Result := False;
return;
end if;
-- or, line 436
v_11 := Z.L - Z.C;
-- literal, line 436
C := Eq_S_Backward (Z, "ö");
if C = 0 then
goto lab17;
end if;
Z.C := Z.C - C;
goto lab16;
<<lab17>>
Z.C := Z.L - v_11;
-- literal, line 436
C := Eq_S_Backward (Z, "ü");
if C = 0 then
Result := False;
return;
end if;
Z.C := Z.C - C;
<<lab16>>
Z.C := Z.L - v_10;
-- <+, line 436
C := Z.C;
Insert (Z, Z.C, Z.C, "ü");
Z.C := C;
<<lab2>>
Result := True;
end R_Append_U_to_stems_ending_with_d_or_g;
procedure R_Is_reserved_word (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
v_1 : Char_Index;
begin
-- (, line 439
-- literal, line 440
C := Eq_S_Backward (Z, "ad");
if C = 0 then
Result := False;
return;
end if;
Z.C := Z.C - C;
-- try, line 440
v_1 := Z.L - Z.C;
-- literal, line 440
C := Eq_S_Backward (Z, "soy");
if C = 0 then
Z.C := Z.L - v_1;
goto lab0;
end if;
Z.C := Z.C - C;
<<lab0>>
-- atlimit, line 440
if Z.C > Z.Lb then
Result := False;
return;
end if;
Result := True;
end R_Is_reserved_word;
procedure R_More_than_one_syllable_word (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
v_1 : Char_Index;
v_2 : Integer;
v_3 : Char_Index;
begin
-- test, line 447
v_1 := Z.C;
-- atleast, line 447
begin
v_2 := 2;
<<lab0>>
loop
v_3 := Z.C;
-- gopast, line 447
-- grouping vowel, line 447
Out_Grouping (Z, G_Vowel, 97, 305, True, C);
if C < 0 then
goto lab1;
end if;
Z.C := Z.C + C;
v_2 := v_2 - 1;
goto lab0;
<<lab1>>
Z.C := v_3;
exit;
end loop;
if v_2 > 0 then
Result := False;
return;
end if;
end;
Z.C := v_1;
Result := True;
end R_More_than_one_syllable_word;
procedure R_Postlude (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
v_1 : Char_Index;
v_2 : Char_Index;
v_3 : Char_Index;
begin
Z.Lb := Z.C; Z.C := Z.L; -- backwards, line 451
-- (, line 451
-- not, line 452
v_1 := Z.L - Z.C;
-- call is_reserved_word, line 452
R_Is_reserved_word (Z, Result);
if not Result then
goto lab0;
end if;
Result := False;
return;
<<lab0>>
Z.C := Z.L - v_1;
-- do, line 453
v_2 := Z.L - Z.C;
-- call append_U_to_stems_ending_with_d_or_g, line 453
R_Append_U_to_stems_ending_with_d_or_g (Z, Result);
Z.C := Z.L - v_2;
-- do, line 454
v_3 := Z.L - Z.C;
-- call post_process_last_consonants, line 454
R_Post_process_last_consonants (Z, Result);
Z.C := Z.L - v_3;
Z.C := Z.Lb;
Result := True;
end R_Postlude;
procedure Stem (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
v_1 : Char_Index;
v_2 : Char_Index;
begin
-- (, line 459
-- call more_than_one_syllable_word, line 460
R_More_than_one_syllable_word (Z, Result);
if not Result then
Result := False;
return;
end if;
-- (, line 461
Z.Lb := Z.C; Z.C := Z.L; -- backwards, line 462
-- (, line 462
-- do, line 463
v_1 := Z.L - Z.C;
-- call stem_nominal_verb_suffixes, line 463
R_Stem_nominal_verb_suffixes (Z, Result);
Z.C := Z.L - v_1;
-- Boolean test continue_stemming_noun_suffixes, line 464
if not Z.B_Continue_stemming_noun_suffixes then
Result := False;
return;
end if;
-- do, line 465
v_2 := Z.L - Z.C;
-- call stem_noun_suffixes, line 465
R_Stem_noun_suffixes (Z, Result);
Z.C := Z.L - v_2;
Z.C := Z.Lb;
-- call postlude, line 468
R_Postlude (Z, Result);
if not Result then
Result := False;
return;
end if;
Result := True;
end Stem;
end Stemmer.Turkish;
|
267
|
ada
| 3
|
rogermc2/GA_Ada
|
ga_lib/src/svd.ads
|
with Ada.Numerics.Generic_Real_Arrays;
with GA_Maths;
package SVD is
type Real is digits 18;
package Real_Arrays is new Ada.Numerics.Generic_Real_Arrays (Real);
type SVD (Num_Rows, Num_Cols, Num_Singular, Work_Vector_Rows : Natural) is private;
SVD_Exception : Exception;
function Condition_Number (aMatrix : GA_Maths.Float_Matrix) return Float;
function Singular_Value_Decomposition (aMatrix : Real_Arrays.Real_Matrix)
return SVD;
function Singular_Value_Decomposition (aMatrix : GA_Maths.Float_Matrix)
return SVD;
private
type SVD (Num_Rows, Num_Cols, Num_Singular, Work_Vector_Rows : Natural) is record
Matrix_U : Real_Arrays.Real_Matrix
(1 .. Num_Rows, 1 .. Num_Cols) := (others => (others => 0.0));
Matrix_V : Real_Arrays.Real_Matrix
(1 .. Num_Rows, 1 .. Num_Cols) := (others => (others => 0.0));
Matrix_W : Real_Arrays.Real_Vector
(1 .. Work_Vector_Rows) :=(others => 0.0);
Sorted_Singular_Values : Real_Arrays.Real_Vector (1 .. Num_Singular);
end record;
end SVD;
|
268
|
ada
| 0
|
joewing/arbitrary
|
arbitrary-const.ads
|
<reponame>joewing/arbitrary
--------------------------------------------------------------------------
-- Arbitrary Precision Math Library: Constants
-- <NAME> 20020320 <> 20020327
--------------------------------------------------------------------------
package Arbitrary.Const is
function Pi(precision : integer) return Arbitrary_Type;
function Golden_Ratio(precision : integer) return Arbitrary_Type;
end Arbitrary.Const;
|
269
|
ada
| 1
|
alvaromb/Compilemon
|
lib/aflexnat/tblcmp.ads
|
-- Copyright (c) 1990 Regents of the University of California.
-- All rights reserved.
--
-- This software was developed by <NAME> of the Arcadia project
-- at the University of California, Irvine.
--
-- Redistribution and use in source and binary forms are permitted
-- provided that the above copyright notice and this paragraph are
-- duplicated in all such forms and that any documentation,
-- advertising materials, and other materials related to such
-- distribution and use acknowledge that the software was developed
-- by the University of California, Irvine. The name of the
-- University may not be used to endorse or promote products derived
-- from this software without specific prior written permission.
-- THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
-- IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
-- WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
-- TITLE table compression routines
-- AUTHOR: <NAME> (UCI)
-- DESCRIPTION used for compressed tables only
-- NOTES somewhat complicated but works fast and generates efficient scanners
-- $Header: /co/ua/self/arcadia/aflex/ada/src/RCS/tblcmpS.a,v 1.3 90/01/12 15:20:47 self Exp Locker: self $
with misc_defs; use misc_defs;
package tblcmp is
-- bldtbl - build table entries for dfa state
procedure BLDTBL(STATE : in
UNBOUNDED_INT_ARRAY;
STATENUM, TOTALTRANS, COMSTATE, COMFREQ : in INTEGER);
procedure CMPTMPS;
-- expand_nxt_chk - expand the next check arrays
procedure EXPAND_NXT_CHK;
-- find_table_space - finds a space in the table for a state to be placed
function FIND_TABLE_SPACE(STATE : in UNBOUNDED_INT_ARRAY;
NUMTRANS : in INTEGER) return INTEGER;
-- inittbl - initialize transition tables
procedure INITTBL;
-- mkdeftbl - make the default, "jam" table entries
procedure MKDEFTBL;
-- mkentry - create base/def and nxt/chk entries for transition array
procedure MKENTRY(STATE : in
UNBOUNDED_INT_ARRAY;
NUMCHARS, STATENUM, DEFLINK, TOTALTRANS : in INTEGER);
-- mk1tbl - create table entries for a state (or state fragment) which
-- has only one out-transition
procedure MK1TBL(STATE, SYM, ONENXT, ONEDEF : in INTEGER);
-- mkprot - create new proto entry
procedure MKPROT(STATE : in UNBOUNDED_INT_ARRAY;
STATENUM, COMSTATE : in INTEGER);
-- mktemplate - create a template entry based on a state, and connect the state
-- to it
procedure MKTEMPLATE(STATE : in UNBOUNDED_INT_ARRAY;
STATENUM, COMSTATE : in INTEGER);
-- mv2front - move proto queue element to front of queue
procedure MV2FRONT(QELM : in INTEGER);
-- place_state - place a state into full speed transition table
procedure PLACE_STATE(STATE : in UNBOUNDED_INT_ARRAY;
STATENUM, TRANSNUM : in INTEGER);
-- stack1 - save states with only one out-transition to be processed later
procedure STACK1(STATENUM, SYM, NEXTSTATE, DEFLINK : in INTEGER);
-- tbldiff - compute differences between two state tables
procedure TBLDIFF(STATE : in UNBOUNDED_INT_ARRAY;
PR : in INTEGER;
EXT : out UNBOUNDED_INT_ARRAY;
RESULT : out INTEGER);
end tblcmp;
|
270
|
ada
| 0
|
reznikmm/declarative-regions
|
source/regions/regions-shared_lists.adb
|
with Ada.Unchecked_Deallocation;
package body Regions.Shared_Lists is
procedure Reference (Self : not null List_Node_Access) with Inline;
procedure Unreference (Self : in out List_Node_Access) with Inline;
procedure Free is new Ada.Unchecked_Deallocation
(List_Node, List_Node_Access);
---------
-- "=" --
---------
function "=" (Left, Right : List) return Boolean is
function Compare (L, R : List_Node_Access) return Boolean;
-- Compare item in node chains
function Compare (L, R : List_Node_Access) return Boolean is
begin
if L = R then
return True;
elsif L.Next = null then
return L.Data = R.Data;
elsif L.Data = R.Data then
return Compare (L.Next, R.Next);
else
return False;
end if;
end Compare;
begin
return Left.Length = Right.Length
and then Compare (Left.Head, Right.Head);
end "=";
------------
-- Adjust --
------------
overriding procedure Adjust (Self : in out List) is
begin
if Self.Head /= null then
Reference (Self.Head);
end if;
end Adjust;
-----------------------
-- Constant_Indexing --
-----------------------
function Constant_Indexing
(Self : List;
Position : Cursor) return Element_Type
is
pragma Unreferenced (Self);
begin
return Position.Item.Data;
end Constant_Indexing;
----------------
-- Empty_List --
----------------
function Empty_List return List is
begin
return (Ada.Finalization.Controlled with Head => null, Length => 0);
end Empty_List;
--------------
-- Finalize --
--------------
overriding procedure Finalize (Self : in out List) is
begin
Unreference (Self.Head);
Self.Length := 0;
end Finalize;
-----------
-- First --
-----------
overriding function First (Self : Forward_Iterator) return Cursor is
begin
return Self.First;
end First;
-------------------
-- First_Element --
-------------------
function First_Element (Self : List) return Element_Type is
begin
return Self.Head.Data;
end First_Element;
-----------------
-- Has_Element --
-----------------
function Has_Element (Self : Cursor) return Boolean is
begin
return Self.Item /= null;
end Has_Element;
--------------
-- Is_Empty --
--------------
function Is_Empty (Self : List) return Boolean is
begin
return Self.Head = null;
end Is_Empty;
-------------
-- Iterate --
-------------
function Iterate (Self : List'Class) return Forward_Iterator is
begin
return (First => (Item => Self.Head));
end Iterate;
------------
-- Length --
------------
function Length (Self : List) return Natural is
begin
return Self.Length;
end Length;
----------
-- Next --
----------
overriding function Next
(Self : Forward_Iterator;
Position : Cursor) return Cursor
is
pragma Unreferenced (Self);
begin
if Position.Item = null then
return Position;
else
return (Item => Position.Item.Next);
end if;
end Next;
-------------
-- Prepend --
-------------
procedure Prepend (Self : in out List; Item : Element_Type) is
begin
Self.Head := new List_Node'(Self.Head, 1, Item);
Self.Length := Self.Length + 1;
end Prepend;
---------------
-- Reference --
---------------
procedure Reference (Self : not null List_Node_Access) is
begin
Self.Counter := Self.Counter + 1;
end Reference;
-----------------
-- Unreference --
-----------------
procedure Unreference (Self : in out List_Node_Access) is
begin
if Self /= null then
Self.Counter := Self.Counter - 1;
if Self.Counter = 0 then
Destroy (Self.Data);
Unreference (Self.Next);
Free (Self);
else
Self := null;
end if;
end if;
end Unreference;
end Regions.Shared_Lists;
|
271
|
ada
| 4
|
faelys/gela-asis
|
.build/ada/asis-gela-elements-defs.ads
|
------------------------------------------------------------------------------
-- Copyright (c) 2006-2013, <NAME>
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- * Redistributions of source code must retain the above copyright notice,
-- this list of conditions and the following disclaimer.
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
-- * Neither the name of the Maxim Reznik, IE nor the names of its
-- contributors may be used to endorse or promote products derived from
-- this software without specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
-- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-- POSSIBILITY OF SUCH DAMAGE.
------------------------------------------------------------------------------
package Asis.Gela.Elements.Defs is
--------------------------
-- Type_Definition_Node --
--------------------------
type Type_Definition_Node is abstract
new Definition_Node with private;
type Type_Definition_Ptr is
access all Type_Definition_Node;
for Type_Definition_Ptr'Storage_Pool use Lists.Pool;
function Corresponding_Type_Operators
(Element : Type_Definition_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List;
procedure Add_To_Corresponding_Type_Operators
(Element : in out Type_Definition_Node;
Item : in Asis.Element);
function Definition_Kind (Element : Type_Definition_Node)
return Asis.Definition_Kinds;
-----------------------------
-- Subtype_Indication_Node --
-----------------------------
type Subtype_Indication_Node is
new Definition_Node with private;
type Subtype_Indication_Ptr is
access all Subtype_Indication_Node;
for Subtype_Indication_Ptr'Storage_Pool use Lists.Pool;
function New_Subtype_Indication_Node
(The_Context : ASIS.Context)
return Subtype_Indication_Ptr;
function Get_Subtype_Mark
(Element : Subtype_Indication_Node) return Asis.Expression;
procedure Set_Subtype_Mark
(Element : in out Subtype_Indication_Node;
Value : in Asis.Expression);
function Subtype_Constraint
(Element : Subtype_Indication_Node) return Asis.Constraint;
procedure Set_Subtype_Constraint
(Element : in out Subtype_Indication_Node;
Value : in Asis.Constraint);
function Has_Null_Exclusion
(Element : Subtype_Indication_Node) return Boolean;
procedure Set_Has_Null_Exclusion
(Element : in out Subtype_Indication_Node;
Value : in Boolean);
function Definition_Kind (Element : Subtype_Indication_Node)
return Asis.Definition_Kinds;
function Children (Element : access Subtype_Indication_Node)
return Traverse_List;
function Clone
(Element : Subtype_Indication_Node;
Parent : Asis.Element)
return Asis.Element;
procedure Copy
(Source : in Asis.Element;
Target : access Subtype_Indication_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element);
---------------------
-- Constraint_Node --
---------------------
type Constraint_Node is abstract
new Definition_Node with private;
type Constraint_Ptr is
access all Constraint_Node;
for Constraint_Ptr'Storage_Pool use Lists.Pool;
function Definition_Kind (Element : Constraint_Node)
return Asis.Definition_Kinds;
-------------------------------
-- Component_Definition_Node --
-------------------------------
type Component_Definition_Node is
new Definition_Node with private;
type Component_Definition_Ptr is
access all Component_Definition_Node;
for Component_Definition_Ptr'Storage_Pool use Lists.Pool;
function New_Component_Definition_Node
(The_Context : ASIS.Context)
return Component_Definition_Ptr;
function Component_Subtype_Indication
(Element : Component_Definition_Node) return Asis.Subtype_Indication;
procedure Set_Component_Subtype_Indication
(Element : in out Component_Definition_Node;
Value : in Asis.Subtype_Indication);
function Trait_Kind
(Element : Component_Definition_Node) return Asis.Trait_Kinds;
procedure Set_Trait_Kind
(Element : in out Component_Definition_Node;
Value : in Asis.Trait_Kinds);
function Definition_Kind (Element : Component_Definition_Node)
return Asis.Definition_Kinds;
function Children (Element : access Component_Definition_Node)
return Traverse_List;
function Clone
(Element : Component_Definition_Node;
Parent : Asis.Element)
return Asis.Element;
procedure Copy
(Source : in Asis.Element;
Target : access Component_Definition_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element);
--------------------------------------
-- Discrete_Subtype_Definition_Node --
--------------------------------------
type Discrete_Subtype_Definition_Node is abstract
new Definition_Node with private;
type Discrete_Subtype_Definition_Ptr is
access all Discrete_Subtype_Definition_Node;
for Discrete_Subtype_Definition_Ptr'Storage_Pool use Lists.Pool;
function Definition_Kind (Element : Discrete_Subtype_Definition_Node)
return Asis.Definition_Kinds;
-------------------------
-- Discrete_Range_Node --
-------------------------
type Discrete_Range_Node is abstract
new Definition_Node with private;
type Discrete_Range_Ptr is
access all Discrete_Range_Node;
for Discrete_Range_Ptr'Storage_Pool use Lists.Pool;
function Definition_Kind (Element : Discrete_Range_Node)
return Asis.Definition_Kinds;
------------------------------------
-- Unknown_Discriminant_Part_Node --
------------------------------------
type Unknown_Discriminant_Part_Node is
new Definition_Node with private;
type Unknown_Discriminant_Part_Ptr is
access all Unknown_Discriminant_Part_Node;
for Unknown_Discriminant_Part_Ptr'Storage_Pool use Lists.Pool;
function New_Unknown_Discriminant_Part_Node
(The_Context : ASIS.Context)
return Unknown_Discriminant_Part_Ptr;
function Definition_Kind (Element : Unknown_Discriminant_Part_Node)
return Asis.Definition_Kinds;
function Clone
(Element : Unknown_Discriminant_Part_Node;
Parent : Asis.Element)
return Asis.Element;
----------------------------------
-- Known_Discriminant_Part_Node --
----------------------------------
type Known_Discriminant_Part_Node is
new Definition_Node with private;
type Known_Discriminant_Part_Ptr is
access all Known_Discriminant_Part_Node;
for Known_Discriminant_Part_Ptr'Storage_Pool use Lists.Pool;
function New_Known_Discriminant_Part_Node
(The_Context : ASIS.Context)
return Known_Discriminant_Part_Ptr;
function Discriminants
(Element : Known_Discriminant_Part_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List;
procedure Set_Discriminants
(Element : in out Known_Discriminant_Part_Node;
Value : in Asis.Element);
function Discriminants_List
(Element : Known_Discriminant_Part_Node) return Asis.Element;
function Definition_Kind (Element : Known_Discriminant_Part_Node)
return Asis.Definition_Kinds;
function Children (Element : access Known_Discriminant_Part_Node)
return Traverse_List;
function Clone
(Element : Known_Discriminant_Part_Node;
Parent : Asis.Element)
return Asis.Element;
procedure Copy
(Source : in Asis.Element;
Target : access Known_Discriminant_Part_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element);
----------------------------
-- Record_Definition_Node --
----------------------------
type Record_Definition_Node is
new Definition_Node with private;
type Record_Definition_Ptr is
access all Record_Definition_Node;
for Record_Definition_Ptr'Storage_Pool use Lists.Pool;
function New_Record_Definition_Node
(The_Context : ASIS.Context)
return Record_Definition_Ptr;
function Record_Components
(Element : Record_Definition_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List;
procedure Set_Record_Components
(Element : in out Record_Definition_Node;
Value : in Asis.Element);
function Record_Components_List
(Element : Record_Definition_Node) return Asis.Element;
function Implicit_Components
(Element : Record_Definition_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List;
procedure Add_To_Implicit_Components
(Element : in out Record_Definition_Node;
Item : in Asis.Element);
function Definition_Kind (Element : Record_Definition_Node)
return Asis.Definition_Kinds;
function Children (Element : access Record_Definition_Node)
return Traverse_List;
function Clone
(Element : Record_Definition_Node;
Parent : Asis.Element)
return Asis.Element;
procedure Copy
(Source : in Asis.Element;
Target : access Record_Definition_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element);
---------------------------------
-- Null_Record_Definition_Node --
---------------------------------
type Null_Record_Definition_Node is
new Definition_Node with private;
type Null_Record_Definition_Ptr is
access all Null_Record_Definition_Node;
for Null_Record_Definition_Ptr'Storage_Pool use Lists.Pool;
function New_Null_Record_Definition_Node
(The_Context : ASIS.Context)
return Null_Record_Definition_Ptr;
function Definition_Kind (Element : Null_Record_Definition_Node)
return Asis.Definition_Kinds;
function Clone
(Element : Null_Record_Definition_Node;
Parent : Asis.Element)
return Asis.Element;
-------------------------
-- Null_Component_Node --
-------------------------
type Null_Component_Node is
new Definition_Node with private;
type Null_Component_Ptr is
access all Null_Component_Node;
for Null_Component_Ptr'Storage_Pool use Lists.Pool;
function New_Null_Component_Node
(The_Context : ASIS.Context)
return Null_Component_Ptr;
function Pragmas
(Element : Null_Component_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List;
procedure Set_Pragmas
(Element : in out Null_Component_Node;
Value : in Asis.Element);
function Pragmas_List
(Element : Null_Component_Node) return Asis.Element;
function Definition_Kind (Element : Null_Component_Node)
return Asis.Definition_Kinds;
function Clone
(Element : Null_Component_Node;
Parent : Asis.Element)
return Asis.Element;
-----------------------
-- Variant_Part_Node --
-----------------------
type Variant_Part_Node is
new Definition_Node with private;
type Variant_Part_Ptr is
access all Variant_Part_Node;
for Variant_Part_Ptr'Storage_Pool use Lists.Pool;
function New_Variant_Part_Node
(The_Context : ASIS.Context)
return Variant_Part_Ptr;
function Discriminant_Direct_Name
(Element : Variant_Part_Node) return Asis.Name;
procedure Set_Discriminant_Direct_Name
(Element : in out Variant_Part_Node;
Value : in Asis.Name);
function Variants
(Element : Variant_Part_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List;
procedure Set_Variants
(Element : in out Variant_Part_Node;
Value : in Asis.Element);
function Variants_List
(Element : Variant_Part_Node) return Asis.Element;
function Pragmas
(Element : Variant_Part_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List;
procedure Set_Pragmas
(Element : in out Variant_Part_Node;
Value : in Asis.Element);
function Pragmas_List
(Element : Variant_Part_Node) return Asis.Element;
function End_Pragmas
(Element : Variant_Part_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List;
procedure Set_End_Pragmas
(Element : in out Variant_Part_Node;
Value : in Asis.Element);
function End_Pragmas_List
(Element : Variant_Part_Node) return Asis.Element;
function Definition_Kind (Element : Variant_Part_Node)
return Asis.Definition_Kinds;
function Children (Element : access Variant_Part_Node)
return Traverse_List;
function Clone
(Element : Variant_Part_Node;
Parent : Asis.Element)
return Asis.Element;
procedure Copy
(Source : in Asis.Element;
Target : access Variant_Part_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element);
------------------
-- Variant_Node --
------------------
type Variant_Node is
new Definition_Node with private;
type Variant_Ptr is
access all Variant_Node;
for Variant_Ptr'Storage_Pool use Lists.Pool;
function New_Variant_Node
(The_Context : ASIS.Context)
return Variant_Ptr;
function Record_Components
(Element : Variant_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List;
procedure Set_Record_Components
(Element : in out Variant_Node;
Value : in Asis.Element);
function Record_Components_List
(Element : Variant_Node) return Asis.Element;
function Implicit_Components
(Element : Variant_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List;
procedure Add_To_Implicit_Components
(Element : in out Variant_Node;
Item : in Asis.Element);
function Variant_Choices
(Element : Variant_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List;
procedure Set_Variant_Choices
(Element : in out Variant_Node;
Value : in Asis.Element);
function Variant_Choices_List
(Element : Variant_Node) return Asis.Element;
function Definition_Kind (Element : Variant_Node)
return Asis.Definition_Kinds;
function Children (Element : access Variant_Node)
return Traverse_List;
function Clone
(Element : Variant_Node;
Parent : Asis.Element)
return Asis.Element;
procedure Copy
(Source : in Asis.Element;
Target : access Variant_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element);
------------------------
-- Others_Choice_Node --
------------------------
type Others_Choice_Node is
new Definition_Node with private;
type Others_Choice_Ptr is
access all Others_Choice_Node;
for Others_Choice_Ptr'Storage_Pool use Lists.Pool;
function New_Others_Choice_Node
(The_Context : ASIS.Context)
return Others_Choice_Ptr;
function Definition_Kind (Element : Others_Choice_Node)
return Asis.Definition_Kinds;
function Clone
(Element : Others_Choice_Node;
Parent : Asis.Element)
return Asis.Element;
----------------------------
-- Access_Definition_Node --
----------------------------
type Access_Definition_Node is abstract
new Definition_Node with private;
type Access_Definition_Ptr is
access all Access_Definition_Node;
for Access_Definition_Ptr'Storage_Pool use Lists.Pool;
function Has_Null_Exclusion
(Element : Access_Definition_Node) return Boolean;
procedure Set_Has_Null_Exclusion
(Element : in out Access_Definition_Node;
Value : in Boolean);
function Definition_Kind (Element : Access_Definition_Node)
return Asis.Definition_Kinds;
-------------------------------------
-- Incomplete_Type_Definition_Node --
-------------------------------------
type Incomplete_Type_Definition_Node is
new Definition_Node with private;
type Incomplete_Type_Definition_Ptr is
access all Incomplete_Type_Definition_Node;
for Incomplete_Type_Definition_Ptr'Storage_Pool use Lists.Pool;
function New_Incomplete_Type_Definition_Node
(The_Context : ASIS.Context)
return Incomplete_Type_Definition_Ptr;
function Definition_Kind (Element : Incomplete_Type_Definition_Node)
return Asis.Definition_Kinds;
function Clone
(Element : Incomplete_Type_Definition_Node;
Parent : Asis.Element)
return Asis.Element;
--------------------------------------------
-- Tagged_Incomplete_Type_Definition_Node --
--------------------------------------------
type Tagged_Incomplete_Type_Definition_Node is
new Incomplete_Type_Definition_Node with private;
type Tagged_Incomplete_Type_Definition_Ptr is
access all Tagged_Incomplete_Type_Definition_Node;
for Tagged_Incomplete_Type_Definition_Ptr'Storage_Pool use Lists.Pool;
function New_Tagged_Incomplete_Type_Definition_Node
(The_Context : ASIS.Context)
return Tagged_Incomplete_Type_Definition_Ptr;
function Has_Tagged
(Element : Tagged_Incomplete_Type_Definition_Node) return Boolean;
procedure Set_Has_Tagged
(Element : in out Tagged_Incomplete_Type_Definition_Node;
Value : in Boolean);
function Definition_Kind (Element : Tagged_Incomplete_Type_Definition_Node)
return Asis.Definition_Kinds;
function Clone
(Element : Tagged_Incomplete_Type_Definition_Node;
Parent : Asis.Element)
return Asis.Element;
----------------------------------
-- Private_Type_Definition_Node --
----------------------------------
type Private_Type_Definition_Node is
new Definition_Node with private;
type Private_Type_Definition_Ptr is
access all Private_Type_Definition_Node;
for Private_Type_Definition_Ptr'Storage_Pool use Lists.Pool;
function New_Private_Type_Definition_Node
(The_Context : ASIS.Context)
return Private_Type_Definition_Ptr;
function Trait_Kind
(Element : Private_Type_Definition_Node) return Asis.Trait_Kinds;
procedure Set_Trait_Kind
(Element : in out Private_Type_Definition_Node;
Value : in Asis.Trait_Kinds);
function Corresponding_Type_Operators
(Element : Private_Type_Definition_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List;
procedure Add_To_Corresponding_Type_Operators
(Element : in out Private_Type_Definition_Node;
Item : in Asis.Element);
function Has_Limited
(Element : Private_Type_Definition_Node) return Boolean;
procedure Set_Has_Limited
(Element : in out Private_Type_Definition_Node;
Value : in Boolean);
function Has_Private
(Element : Private_Type_Definition_Node) return Boolean;
procedure Set_Has_Private
(Element : in out Private_Type_Definition_Node;
Value : in Boolean);
function Definition_Kind (Element : Private_Type_Definition_Node)
return Asis.Definition_Kinds;
function Clone
(Element : Private_Type_Definition_Node;
Parent : Asis.Element)
return Asis.Element;
-----------------------------------------
-- Tagged_Private_Type_Definition_Node --
-----------------------------------------
type Tagged_Private_Type_Definition_Node is
new Private_Type_Definition_Node with private;
type Tagged_Private_Type_Definition_Ptr is
access all Tagged_Private_Type_Definition_Node;
for Tagged_Private_Type_Definition_Ptr'Storage_Pool use Lists.Pool;
function New_Tagged_Private_Type_Definition_Node
(The_Context : ASIS.Context)
return Tagged_Private_Type_Definition_Ptr;
function Has_Abstract
(Element : Tagged_Private_Type_Definition_Node) return Boolean;
procedure Set_Has_Abstract
(Element : in out Tagged_Private_Type_Definition_Node;
Value : in Boolean);
function Has_Tagged
(Element : Tagged_Private_Type_Definition_Node) return Boolean;
procedure Set_Has_Tagged
(Element : in out Tagged_Private_Type_Definition_Node;
Value : in Boolean);
function Definition_Kind (Element : Tagged_Private_Type_Definition_Node)
return Asis.Definition_Kinds;
function Clone
(Element : Tagged_Private_Type_Definition_Node;
Parent : Asis.Element)
return Asis.Element;
---------------------------------------
-- Private_Extension_Definition_Node --
---------------------------------------
type Private_Extension_Definition_Node is
new Private_Type_Definition_Node with private;
type Private_Extension_Definition_Ptr is
access all Private_Extension_Definition_Node;
for Private_Extension_Definition_Ptr'Storage_Pool use Lists.Pool;
function New_Private_Extension_Definition_Node
(The_Context : ASIS.Context)
return Private_Extension_Definition_Ptr;
function Ancestor_Subtype_Indication
(Element : Private_Extension_Definition_Node) return Asis.Subtype_Indication;
procedure Set_Ancestor_Subtype_Indication
(Element : in out Private_Extension_Definition_Node;
Value : in Asis.Subtype_Indication);
function Implicit_Inherited_Declarations
(Element : Private_Extension_Definition_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List;
procedure Add_To_Implicit_Inherited_Declarations
(Element : in out Private_Extension_Definition_Node;
Item : in Asis.Element);
function Implicit_Inherited_Subprograms
(Element : Private_Extension_Definition_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List;
procedure Add_To_Implicit_Inherited_Subprograms
(Element : in out Private_Extension_Definition_Node;
Item : in Asis.Element);
function Has_Synchronized
(Element : Private_Extension_Definition_Node) return Boolean;
procedure Set_Has_Synchronized
(Element : in out Private_Extension_Definition_Node;
Value : in Boolean);
function Has_Abstract
(Element : Private_Extension_Definition_Node) return Boolean;
procedure Set_Has_Abstract
(Element : in out Private_Extension_Definition_Node;
Value : in Boolean);
function Definition_Kind (Element : Private_Extension_Definition_Node)
return Asis.Definition_Kinds;
function Children (Element : access Private_Extension_Definition_Node)
return Traverse_List;
function Clone
(Element : Private_Extension_Definition_Node;
Parent : Asis.Element)
return Asis.Element;
procedure Copy
(Source : in Asis.Element;
Target : access Private_Extension_Definition_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element);
-------------------------------
-- Protected_Definition_Node --
-------------------------------
type Protected_Definition_Node is
new Definition_Node with private;
type Protected_Definition_Ptr is
access all Protected_Definition_Node;
for Protected_Definition_Ptr'Storage_Pool use Lists.Pool;
function New_Protected_Definition_Node
(The_Context : ASIS.Context)
return Protected_Definition_Ptr;
function Is_Private_Present
(Element : Protected_Definition_Node) return Boolean;
procedure Set_Is_Private_Present
(Element : in out Protected_Definition_Node;
Value : in Boolean);
function Visible_Part_Items
(Element : Protected_Definition_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List;
procedure Set_Visible_Part_Items
(Element : in out Protected_Definition_Node;
Value : in Asis.Element);
function Visible_Part_Items_List
(Element : Protected_Definition_Node) return Asis.Element;
function Private_Part_Items
(Element : Protected_Definition_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List;
procedure Set_Private_Part_Items
(Element : in out Protected_Definition_Node;
Value : in Asis.Element);
function Private_Part_Items_List
(Element : Protected_Definition_Node) return Asis.Element;
function Get_Identifier
(Element : Protected_Definition_Node) return Asis.Element;
procedure Set_Identifier
(Element : in out Protected_Definition_Node;
Value : in Asis.Element);
function Corresponding_Type_Operators
(Element : Protected_Definition_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List;
procedure Add_To_Corresponding_Type_Operators
(Element : in out Protected_Definition_Node;
Item : in Asis.Element);
function Definition_Kind (Element : Protected_Definition_Node)
return Asis.Definition_Kinds;
function Children (Element : access Protected_Definition_Node)
return Traverse_List;
function Clone
(Element : Protected_Definition_Node;
Parent : Asis.Element)
return Asis.Element;
procedure Copy
(Source : in Asis.Element;
Target : access Protected_Definition_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element);
--------------------------
-- Task_Definition_Node --
--------------------------
type Task_Definition_Node is
new Protected_Definition_Node with private;
type Task_Definition_Ptr is
access all Task_Definition_Node;
for Task_Definition_Ptr'Storage_Pool use Lists.Pool;
function New_Task_Definition_Node
(The_Context : ASIS.Context)
return Task_Definition_Ptr;
function Is_Task_Definition_Present
(Element : Task_Definition_Node) return Boolean;
procedure Set_Is_Task_Definition_Present
(Element : in out Task_Definition_Node;
Value : in Boolean);
function Definition_Kind (Element : Task_Definition_Node)
return Asis.Definition_Kinds;
function Clone
(Element : Task_Definition_Node;
Parent : Asis.Element)
return Asis.Element;
procedure Copy
(Source : in Asis.Element;
Target : access Task_Definition_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element);
---------------------------------
-- Formal_Type_Definition_Node --
---------------------------------
type Formal_Type_Definition_Node is abstract
new Definition_Node with private;
type Formal_Type_Definition_Ptr is
access all Formal_Type_Definition_Node;
for Formal_Type_Definition_Ptr'Storage_Pool use Lists.Pool;
function Corresponding_Type_Operators
(Element : Formal_Type_Definition_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List;
procedure Add_To_Corresponding_Type_Operators
(Element : in out Formal_Type_Definition_Node;
Item : in Asis.Element);
function Definition_Kind (Element : Formal_Type_Definition_Node)
return Asis.Definition_Kinds;
private
type Type_Definition_Node is abstract
new Definition_Node with
record
Corresponding_Type_Operators : aliased Secondary_Declaration_Lists.List_Node;
end record;
type Subtype_Indication_Node is
new Definition_Node with
record
Subtype_Mark : aliased Asis.Expression;
Subtype_Constraint : aliased Asis.Constraint;
Has_Null_Exclusion : aliased Boolean := False;
end record;
type Constraint_Node is abstract
new Definition_Node with
record
null;
end record;
type Component_Definition_Node is
new Definition_Node with
record
Component_Subtype_Indication : aliased Asis.Subtype_Indication;
Trait_Kind : aliased Asis.Trait_Kinds := An_Ordinary_Trait;
end record;
type Discrete_Subtype_Definition_Node is abstract
new Definition_Node with
record
null;
end record;
type Discrete_Range_Node is abstract
new Definition_Node with
record
null;
end record;
type Unknown_Discriminant_Part_Node is
new Definition_Node with
record
null;
end record;
type Known_Discriminant_Part_Node is
new Definition_Node with
record
Discriminants : aliased Primary_Declaration_Lists.List;
end record;
type Record_Definition_Node is
new Definition_Node with
record
Record_Components : aliased Primary_Declaration_Lists.List;
Implicit_Components : aliased Secondary_Declaration_Lists.List_Node;
end record;
type Null_Record_Definition_Node is
new Definition_Node with
record
null;
end record;
type Null_Component_Node is
new Definition_Node with
record
Pragmas : aliased Primary_Pragma_Lists.List;
end record;
type Variant_Part_Node is
new Definition_Node with
record
Discriminant_Direct_Name : aliased Asis.Name;
Variants : aliased Primary_Variant_Lists.List;
Pragmas : aliased Primary_Pragma_Lists.List;
End_Pragmas : aliased Primary_Pragma_Lists.List;
end record;
type Variant_Node is
new Definition_Node with
record
Record_Components : aliased Primary_Declaration_Lists.List;
Implicit_Components : aliased Secondary_Declaration_Lists.List_Node;
Variant_Choices : aliased Primary_Choise_Lists.List;
end record;
type Others_Choice_Node is
new Definition_Node with
record
null;
end record;
type Access_Definition_Node is abstract
new Definition_Node with
record
Has_Null_Exclusion : aliased Boolean := False;
end record;
type Incomplete_Type_Definition_Node is
new Definition_Node with
record
null;
end record;
type Tagged_Incomplete_Type_Definition_Node is
new Incomplete_Type_Definition_Node with
record
Has_Tagged : aliased Boolean := False;
end record;
type Private_Type_Definition_Node is
new Definition_Node with
record
Trait_Kind : aliased Asis.Trait_Kinds := An_Ordinary_Trait;
Corresponding_Type_Operators : aliased Secondary_Declaration_Lists.List_Node;
Has_Limited : aliased Boolean := False;
Has_Private : aliased Boolean := False;
end record;
type Tagged_Private_Type_Definition_Node is
new Private_Type_Definition_Node with
record
Has_Abstract : aliased Boolean := False;
Has_Tagged : aliased Boolean := False;
end record;
type Private_Extension_Definition_Node is
new Private_Type_Definition_Node with
record
Ancestor_Subtype_Indication : aliased Asis.Subtype_Indication;
Implicit_Inherited_Declarations : aliased Secondary_Declaration_Lists.List_Node;
Implicit_Inherited_Subprograms : aliased Secondary_Declaration_Lists.List_Node;
Has_Synchronized : aliased Boolean := False;
Has_Abstract : aliased Boolean := False;
end record;
type Protected_Definition_Node is
new Definition_Node with
record
Is_Private_Present : aliased Boolean := False;
Visible_Part_Items : aliased Primary_Declaration_Lists.List;
Private_Part_Items : aliased Primary_Declaration_Lists.List;
Identifier : aliased Asis.Element;
Corresponding_Type_Operators : aliased Secondary_Declaration_Lists.List_Node;
end record;
type Task_Definition_Node is
new Protected_Definition_Node with
record
Is_Task_Definition_Present : aliased Boolean := False;
end record;
type Formal_Type_Definition_Node is abstract
new Definition_Node with
record
Corresponding_Type_Operators : aliased Secondary_Declaration_Lists.List_Node;
end record;
end Asis.Gela.Elements.Defs;
|
272
|
ada
| 0
|
hgrodriguez/edc-client
|
src/edc_client-led.ads
|
<reponame>hgrodriguez/edc-client
--===========================================================================
--
-- This package is the interface to the LED part of the EDC Client
--
--===========================================================================
--
-- Copyright 2021 (C) <NAME>
--
-- SPDX-License-Identifier: BSD-3-Clause
--
package Edc_Client.LED is
--------------------------------------------------------------------------
-- Command string for controlling the LEDs
--------------------------------------------------------------------------
subtype LED_String is String (1 .. 4);
--------------------------------------------------------------------------
-- Procedures to control the red LED
--------------------------------------------------------------------------
procedure Red_On with Pre => Initialized;
procedure Red_Off with Pre => Initialized;
procedure Red_Toggle with Pre => Initialized;
--------------------------------------------------------------------------
-- Procedures to control the amber LED
--------------------------------------------------------------------------
procedure Amber_On with Pre => Initialized;
procedure Amber_Off with Pre => Initialized;
procedure Amber_Toggle with Pre => Initialized;
--------------------------------------------------------------------------
-- Procedures to control the green LED
--------------------------------------------------------------------------
procedure Green_On with Pre => Initialized;
procedure Green_Off with Pre => Initialized;
procedure Green_Toggle with Pre => Initialized;
--------------------------------------------------------------------------
-- Procedures to control the white LED
--------------------------------------------------------------------------
procedure White_On with Pre => Initialized;
procedure White_Off with Pre => Initialized;
procedure White_Toggle with Pre => Initialized;
--------------------------------------------------------------------------
-- Procedures to control the blue LED
--------------------------------------------------------------------------
procedure Blue_On with Pre => Initialized;
procedure Blue_Off with Pre => Initialized;
procedure Blue_Toggle with Pre => Initialized;
end Edc_Client.LED;
|
273
|
ada
| 0
|
jquorning/CELLE
|
source/symbols-io.adb
|
<filename>source/symbols-io.adb
--
-- The author disclaims copyright to this source code. In place of
-- a legal notice, here is a blessing:
--
-- May you do good and not evil.
-- May you find forgiveness for yourself and forgive others.
-- May you share freely, not taking more than you give.
--
with Ada.Text_IO;
package body Symbols.IO is
procedure Put_Named (Session : in Sessions.Session_Type;
Set : in Symbol_Sets.Set_Type)
is
pragma Unreferenced (Session);
use Ada.Text_IO;
First : Boolean := True;
begin
Put ("[");
for Index in Symbol_Sets.First_Index .. Symbol_Sets.Last_Index loop
if Symbol_Sets.Set_Find (Set, Index) then
if not First then
Put (" ");
end if;
Put (Name_Of (Element_At (Index)));
First := False;
end if;
end loop;
Put ("]");
end Put_Named;
--
-- Debug
--
procedure JQ_Dump_Symbols (Session : in Sessions.Session_Type;
Mode : in Integer)
is
use Ada.Text_IO;
use Symbol_Sets;
begin
for Index in 0 .. Last_Index loop
declare
Symbol : Symbol_Access renames Element_At (Index);
begin
Put ("SYM ");
Put (To_String (Symbol.Name));
Put (" INDEX");
Put (Symbol_Index'Image (Symbol.Index));
Put (" NSUB");
Put (Symbol.Sub_Symbol.Length'Img);
Put (" KIND");
Put (Symbol_Kind'Pos (Symbol.Kind)'Img);
if Mode = 1 then
Put (" PREC");
if Symbol.Kind = Multi_Terminal then
Put (" (");
for J in Symbol.Sub_Symbol.First_Index .. Symbol.Sub_Symbol.Last_Index loop
Put (Natural'Image (Symbol.Sub_Symbol.Element (J).Precedence));
Put (" ");
end loop;
Put (")");
else
if Symbol.Precedence = -1 then
Put (" -1"); -- Hack
else
Put (Natural'Image (Symbol.Precedence));
end if;
end if;
Put (" LAMB ");
Put (Boolean'Image (Symbol.Lambda));
Put (" FS ");
if Symbol.First_Set = Null_Set then
Put ("<null>");
else
Put_Named (Session, Symbol.First_Set);
end if;
end if;
New_Line;
end;
end loop;
end JQ_Dump_Symbols;
end Symbols.IO;
|
274
|
ada
| 34
|
GaloisInc/hacrypto
|
src/C/nss/nss-3.16.1/nss/lib/freebl/mpi/hppatch.adb
|
#/bin/sh
#
# This Source Code Form is subject to the terms of the Mozilla Public
# License, v. 2.0. If a copy of the MPL was not distributed with this
# file, You can obtain one at http://mozilla.org/MPL/2.0/.
# script to change the system id in an object file from PA-RISC 2.0 to 1.1
adb -w $1 << EOF
?m 0 -1 0
0x0?X
0x0?W (@0x0&~0x40000)|(~@0x0&0x40000)
0?"change checksum"
0x7c?X
0x7c?W (@0x7c&~0x40000)|(~@0x7c&0x40000)
$q
EOF
exit 0
|
275
|
ada
| 12
|
TUM-EI-RCS/StratoX
|
runtime/ravenscar-sfp-stm32f427/gnarl-common/a-taster.adb
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . T A S K _ T E R M I N A T I O N --
-- --
-- B o d y --
-- --
-- Copyright (C) 2005-2014, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This is a simplified version of this package body to be used in when the
-- Ravenscar profile and there are no exception handlers present (either of
-- the restrictions No_Exception_Handlers or No_Exception_Propagation are in
-- effect). This means that the only task termination cause that need to be
-- taken into account is normal task termination (abort is not allowed by
-- the Ravenscar profile and the restricted exception support does not
-- include Exception_Occurrence).
with System.Tasking;
-- used for Task_Id
-- Self
-- Fall_Back_Handler
with System.Task_Primitives.Operations;
-- Used for Self
-- Set_Priority
-- Get_Priority
with Unchecked_Conversion;
package body Ada.Task_Termination is
use System.Task_Primitives.Operations;
use type Ada.Task_Identification.Task_Id;
function To_TT is new Unchecked_Conversion
(System.Tasking.Termination_Handler, Termination_Handler);
function To_ST is new Unchecked_Conversion
(Termination_Handler, System.Tasking.Termination_Handler);
-----------------------------------
-- Current_Task_Fallback_Handler --
-----------------------------------
function Current_Task_Fallback_Handler return Termination_Handler is
Self_Id : constant System.Tasking.Task_Id := Self;
Caller_Priority : constant System.Any_Priority := Get_Priority (Self_Id);
Result : Termination_Handler;
begin
-- Raise the priority to prevent race conditions when modifying
-- System.Tasking.Fall_Back_Handler.
Set_Priority (Self_Id, System.Any_Priority'Last);
Result := To_TT (System.Tasking.Fall_Back_Handler);
-- Restore the original priority
Set_Priority (Self_Id, Caller_Priority);
return Result;
end Current_Task_Fallback_Handler;
-------------------------------------
-- Set_Dependents_Fallback_Handler --
-------------------------------------
procedure Set_Dependents_Fallback_Handler (Handler : Termination_Handler) is
Self_Id : constant System.Tasking.Task_Id := Self;
Caller_Priority : constant System.Any_Priority := Get_Priority (Self_Id);
begin
-- Raise the priority to prevent race conditions when modifying
-- System.Tasking.Fall_Back_Handler.
Set_Priority (Self_Id, System.Any_Priority'Last);
System.Tasking.Fall_Back_Handler := To_ST (Handler);
-- Restore the original priority
Set_Priority (Self_Id, Caller_Priority);
end Set_Dependents_Fallback_Handler;
end Ada.Task_Termination;
|
276
|
ada
| 33
|
ytomino/drake
|
source/pools/machine-apple-darwin/s-unball.ads
|
pragma License (Unrestricted);
-- implementation unit specialized for Darwin
with System.Storage_Elements;
private with C.malloc.malloc;
package System.Unbounded_Allocators is
-- Separated storage pool for local scope.
pragma Preelaborate;
type Unbounded_Allocator is limited private;
procedure Initialize (Object : in out Unbounded_Allocator);
procedure Finalize (Object : in out Unbounded_Allocator);
procedure Allocate (
Allocator : Unbounded_Allocator;
Storage_Address : out Address;
Size_In_Storage_Elements : Storage_Elements.Storage_Count;
Alignment : Storage_Elements.Storage_Count);
procedure Deallocate (
Allocator : Unbounded_Allocator;
Storage_Address : Address;
Size_In_Storage_Elements : Storage_Elements.Storage_Count;
Alignment : Storage_Elements.Storage_Count);
function Allocator_Of (Storage_Address : Address)
return Unbounded_Allocator;
private
type Unbounded_Allocator is new C.malloc.malloc.malloc_zone_t_ptr;
end System.Unbounded_Allocators;
|
277
|
ada
| 30
|
jrmarino/AdaBase
|
testcases/fruit1/fruit1.adb
|
with AdaBase;
with Connect;
with Ada.Text_IO;
procedure Fruit1 is
package CON renames Connect;
package TIO renames Ada.Text_IO;
numrows : AdaBase.Affected_Rows;
cmd : constant String := "DELETE FROM fruits WHERE color = 'red'";
begin
CON.connect_database;
numrows := CON.DR.execute (sql => cmd);
TIO.Put_Line ("SQL: " & cmd);
TIO.Put_Line ("Result: Deleted" & numrows'Img & " rows");
CON.DR.rollback;
CON.DR.disconnect;
end Fruit1;
|
278
|
ada
| 7
|
best08618/asylo
|
gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c34009g.ada
|
-- C34009G.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- OBJECTIVE:
-- CHECK THAT THE REQUIRED PREDEFINED OPERATIONS ARE DECLARED
-- (IMPLICITLY) FOR DERIVED LIMITED PRIVATE TYPES WITHOUT
-- DISCRIMINANTS.
-- HISTORY:
-- JRK 09/01/87 CREATED ORIGINAL TEST.
-- PWN 11/30/94 REMOVED 'BASE USE ILLEGAL IN ADA 9X.
-- PWN 01/31/95 REMOVED INCONSISTENCIES WITH ADA 9X.
WITH SYSTEM; USE SYSTEM;
WITH REPORT; USE REPORT;
PROCEDURE C34009G IS
PACKAGE PKG IS
TYPE PARENT IS LIMITED PRIVATE;
FUNCTION CREATE (X : INTEGER) RETURN PARENT;
FUNCTION CON (X : INTEGER) RETURN PARENT;
FUNCTION EQUAL (X, Y : PARENT) RETURN BOOLEAN;
PROCEDURE ASSIGN (X : OUT PARENT; Y : PARENT);
PRIVATE
TYPE PARENT IS NEW INTEGER;
END PKG;
USE PKG;
TYPE T IS NEW PARENT;
X : T;
W : PARENT;
B : BOOLEAN := FALSE;
PROCEDURE A (X : ADDRESS) IS
BEGIN
B := IDENT_BOOL (TRUE);
END A;
PACKAGE BODY PKG IS
FUNCTION CREATE (X : INTEGER) RETURN PARENT IS
BEGIN
RETURN PARENT (IDENT_INT (X));
END CREATE;
FUNCTION CON (X : INTEGER) RETURN PARENT IS
BEGIN
RETURN PARENT (X);
END CON;
FUNCTION EQUAL (X, Y : PARENT) RETURN BOOLEAN IS
BEGIN
RETURN X = Y;
END EQUAL;
PROCEDURE ASSIGN (X : OUT PARENT; Y : PARENT) IS
BEGIN
X := Y;
END ASSIGN;
END PKG;
BEGIN
TEST ("C34009G", "CHECK THAT THE REQUIRED PREDEFINED OPERATIONS " &
"ARE DECLARED (IMPLICITLY) FOR DERIVED " &
"LIMITED PRIVATE TYPES WITHOUT DISCRIMINANTS");
ASSIGN (X, CREATE (30));
IF NOT EQUAL (T'(X), CON (30)) THEN
FAILED ("INCORRECT QUALIFICATION");
END IF;
IF NOT EQUAL (T (X), CON (30)) THEN
FAILED ("INCORRECT SELF CONVERSION");
END IF;
ASSIGN (W, CREATE (-30));
IF NOT EQUAL (T (W), CON (-30)) THEN
FAILED ("INCORRECT CONVERSION FROM PARENT");
END IF;
IF NOT EQUAL (PARENT (X), CON (30)) THEN
FAILED ("INCORRECT CONVERSION TO PARENT");
END IF;
IF NOT (X IN T) THEN
FAILED ("INCORRECT ""IN""");
END IF;
IF X NOT IN T THEN
FAILED ("INCORRECT ""NOT IN""");
END IF;
B := FALSE;
A (X'ADDRESS);
IF NOT B THEN
FAILED ("INCORRECT 'ADDRESS");
END IF;
IF X'SIZE < T'SIZE THEN
FAILED ("INCORRECT OBJECT'SIZE");
END IF;
RESULT;
END C34009G;
|
279
|
ada
| 0
|
likai3g/afmt
|
src/fmt-generic_ordinary_fixed_point_argument.ads
|
<gh_stars>0
generic
type Fixed_Point_Type is delta <>;
package Fmt.Generic_Ordinary_Fixed_Point_Argument is
function To_Argument (X : Fixed_Point_Type) return Argument_Type'Class
with Inline;
function "&" (Args : Arguments; X : Fixed_Point_Type) return Arguments
with Inline;
private
type Fixed_Point_Argument_Type is new Argument_Type with record
Value : Fixed_Point_Type;
Width : Natural := 0;
Fill : Character := ' ';
Fore : Natural := Fixed_Point_Type'Fore;
Aft : Natural := Fixed_Point_Type'Aft;
end record;
overriding
procedure Parse (
Self : in out Fixed_Point_Argument_Type;
Edit : String);
overriding
function Get_Length (
Self : in out Fixed_Point_Argument_Type)
return Natural;
overriding
procedure Put (
Self : in out Fixed_Point_Argument_Type;
Edit : String;
To : in out String);
end Fmt.Generic_Ordinary_Fixed_Point_Argument;
|
280
|
ada
| 286
|
auzkok/libagar
|
ada/original_2008/ada-gui/agar-gui-widget-toolbar.adb
|
package body agar.gui.widget.toolbar is
package cbinds is
function allocate
(parent : widget_access_t;
bar_type : type_t;
num_rows : c.int;
flags : flags_t) return toolbar_access_t;
pragma import (c, allocate, "AG_ToolbarNew");
procedure row
(toolbar : toolbar_access_t;
row_name : c.int);
pragma import (c, row, "AG_ToolbarRow");
end cbinds;
function allocate
(parent : widget_access_t;
bar_type : type_t;
num_rows : natural;
flags : flags_t) return toolbar_access_t is
begin
return cbinds.allocate
(parent => parent,
bar_type => bar_type,
num_rows => c.int (num_rows),
flags => flags);
end allocate;
procedure row
(toolbar : toolbar_access_t;
row_name : natural) is
begin
cbinds.row
(toolbar => toolbar,
row_name => c.int (row_name));
end row;
function widget (toolbar : toolbar_access_t) return widget_access_t is
begin
return agar.gui.widget.box.widget (toolbar.box'access);
end widget;
end agar.gui.widget.toolbar;
|
281
|
ada
| 7
|
best08618/asylo
|
gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/wide_boolean_pkg.adb
|
<reponame>best08618/asylo
package body Wide_Boolean_Pkg is
procedure Modify (LH : in out TUINT32; LB : in out TBOOL) is
begin
LH := 16#12345678#;
LB := TRUE;
end;
end Wide_Boolean_Pkg;
|
282
|
ada
| 1
|
LaudateCorpus1/RosettaCodeData
|
Task/Terminal-control-Cursor-positioning/Ada/terminal-control-cursor-positioning.ada
|
<reponame>LaudateCorpus1/RosettaCodeData
with Ada.Text_IO;
procedure Cursor_Pos is
begin
Ada.Text_IO.Set_Line(6);
Ada.Text_IO.Set_Col(3);
Ada.Text_IO.Put("Hello");
end Cursor_Pos;
|
283
|
ada
| 1
|
assessorgeneral/ConQAT
|
org.conqat.engine.sourcecode/test-data/org.conqat.engine.sourcecode.coverage.volume/loops.adb
|
<gh_stars>1-10
with Ada.Text_IO;
procedure Hello is
package IO renames Ada.Text_IO;
begin
loop
foo();
exit when 2 > 3;
bar();
exit when 2 > 3 and 3 > 4;
end loop;
end Hello;
|
284
|
ada
| 0
|
SSOCsoft/Log_Reporter
|
src/ini-section_to_vector.adb
|
<reponame>SSOCsoft/Log_Reporter
Function INI.Section_to_Vector( Object : in Instance;
Section: in String:= ""
) return NSO.Types.String_Vector.Vector is
Use NSO.Types.String_Vector;
Begin
Return Result : Vector do
For Item in Object(Section).Iterate loop
Declare
Key : String renames KEY_VALUE_MAP.Key( Item );
Value : Value_Object renames KEY_Value_MAP.Element(Item);
Image : String renames -- "ABS"(Value);
String'(if Value.Kind = vt_String then Value.String_Value
else ABS Value);
Begin
Result.Append( Image );
End;
end loop;
Exception
when CONSTRAINT_ERROR => null;
End return;
End INI.Section_to_Vector;
|
285
|
ada
| 1
|
ForYouEyesOnly/Space-Convoy
|
Sources/Globe_3d/globe_3d-options.adb
|
<reponame>ForYouEyesOnly/Space-Convoy
package body GLOBE_3D.Options is
function Is_debug_mode return Boolean is
begin
return
show_normals or
show_portals or
full_check_objects or
filter_portal_depth;
end Is_debug_mode;
end GLOBE_3D.Options;
|
286
|
ada
| 12
|
TUM-EI-RCS/StratoX
|
software/modules/actuators/servo.ads
|
-- Institution: Technische Universitaet Muenchen
-- Department: Real-Time Computer Systems (RCS)
-- Project: StratoX
--
-- Authors: <NAME> (<EMAIL>)
-- <NAME> (<EMAIL>)
--
-- @summary Servo Actuator frontend
with Units; use Units;
with Config; use Config;
package Servo with SPARK_Mode is
type Servo_Type is (LEFT_ELEVON, RIGHT_ELEVON);
subtype Servo_Angle_Type is Angle_Type range CFG_SERVO_ANGLE_LIMIT_MIN .. CFG_SERVO_ANGLE_LIMIT_MAX;
procedure initialize;
procedure activate;
procedure deactivate;
procedure Set_Critical_Angle (which: Servo_Type; angle : Servo_Angle_Type);
-- call this if the angle is vital at this very moment. It will be restored
-- immediately after a potential in-air reset. this procedure is a bit slower
procedure Set_Angle (which: Servo_Type; angle : Servo_Angle_Type);
-- call this for all other angles, which is faster.
procedure sync;
end Servo;
|
287
|
ada
| 33
|
ytomino/drake
|
source/image/s-valerr.ads
|
pragma License (Unrestricted);
-- implementation unit
package System.Value_Errors is
pragma Pure;
procedure Raise_Value_Failure (T : String; S : String);
pragma No_Return (Raise_Value_Failure);
procedure Raise_Discrete_Value_Failure (T : String; S : String);
-- Returns if the flag of System.Runtime_Context is set.
end System.Value_Errors;
|
288
|
ada
| 0
|
yannickmoy/spat
|
src/spat-proof_attempt.ads
|
------------------------------------------------------------------------------
-- Copyright (C) 2020 by Heisenbug Ltd. (<EMAIL>)
--
-- This work is free. You can redistribute it and/or modify it under the
-- terms of the Do What The Fuck You Want To Public License, Version 2,
-- as published by Sam Hocevar. See the LICENSE file for more details.
------------------------------------------------------------------------------
pragma License (Unrestricted);
------------------------------------------------------------------------------
--
-- SPARK Proof Analysis Tool
--
-- S.P.A.T. - Object representing a JSON "proof attempt" object.
--
------------------------------------------------------------------------------
private with Ada.Tags;
with SPAT.Entity;
with SPAT.Field_Names;
with SPAT.Preconditions;
package SPAT.Proof_Attempt is
use all type GNATCOLL.JSON.JSON_Value_Type;
---------------------------------------------------------------------------
-- Has_Required_Fields
---------------------------------------------------------------------------
function Has_Required_Fields (Object : JSON_Value) return Boolean is
(Preconditions.Ensure_Field (Object => Object,
Field => Field_Names.Result,
Kind => JSON_String_Type) and
Preconditions.Ensure_Field (Object => Object,
Field => Field_Names.Time,
Kinds_Allowed => Preconditions.Number_Kind));
type T is new Entity.T with private;
---------------------------------------------------------------------------
-- Create
---------------------------------------------------------------------------
not overriding
function Create (Object : JSON_Value;
Prover : Subject_Name) return T
with Pre => Has_Required_Fields (Object => Object);
Trivial_True : constant T;
-- Special Proof_Attempt instance that represents a trivially true proof.
--
-- Since GNAT_CE_2020 we can also have a "trivial_true" in the check_tree
-- which - unlike a proper proof attempt - has no Result nor Time value, so
-- we assume "Valid" and "no time" (i.e. 0.0 s). These kind of proof
-- attempts are registered to a special prover object "Trivial" (which
-- subsequently appears in the "stats" objects).
-- Sorting instantiations.
---------------------------------------------------------------------------
-- "<"
--
-- Comparison operator.
---------------------------------------------------------------------------
not overriding
function "<" (Left : in T;
Right : in T) return Boolean;
---------------------------------------------------------------------------
-- Prover
---------------------------------------------------------------------------
not overriding
function Prover (This : in T) return Subject_Name;
---------------------------------------------------------------------------
-- Result
---------------------------------------------------------------------------
not overriding
function Result (This : in T) return Subject_Name;
---------------------------------------------------------------------------
-- Time
---------------------------------------------------------------------------
not overriding
function Time (This : in T) return Duration;
private
type T is new Entity.T with
record
Prover : Subject_Name; -- Prover involved.
Result : Subject_Name; -- "Valid", "Unknown", etc.
Time : Duration; -- time spent during proof
-- Steps -- part of the JSON data, but we don't care.
end record;
---------------------------------------------------------------------------
-- Image
---------------------------------------------------------------------------
overriding
function Image (This : in T) return String is
(Ada.Tags.External_Tag (T'Class (This)'Tag) & ": (" &
"Prover => " & To_String (This.Prover) &
", Result => " & To_String (This.Result) &
", Time => " & This.Time'Image & ")");
Trivial_True : constant T := T'(Entity.T with
Prover => To_Name ("Trivial"),
Result => To_Name ("Valid"),
Time => 0.0);
---------------------------------------------------------------------------
-- Prover
---------------------------------------------------------------------------
not overriding
function Prover (This : in T) return Subject_Name is
(This.Prover);
---------------------------------------------------------------------------
-- Result
---------------------------------------------------------------------------
not overriding
function Result (This : in T) return Subject_Name is
(This.Result);
---------------------------------------------------------------------------
-- Time
---------------------------------------------------------------------------
not overriding
function Time (This : in T) return Duration is
(This.Time);
end SPAT.Proof_Attempt;
|
289
|
ada
| 0
|
GLADORG/glad-cli
|
src/commands-destroy.adb
|
<reponame>GLADORG/glad-cli
with Ada.Containers; use Ada.Containers;
with Ada.Directories; use Ada.Directories;
with Blueprint; use Blueprint;
with AAA.Strings; use AAA.Strings;
with Ada.Command_Line;
with Ada.Text_IO;
with Templates_Parser;
with CLIC.TTY;
with Filesystem;
with Commands;
package body Commands.Destroy is
-------------
-- Execute --
-------------
overriding
procedure Execute ( Cmd : in out Command;
Args : AAA.Strings.Vector) is
begin
if Args.Length > 1 then
declare
Name : String := Element (Args, 2);
Blueprint : String := Args.First_Element;
Blueprint_Path : String := Compose(Get_Blueprint_Folder,Blueprint);
Current : String := Current_Directory;
begin
Templates_Parser.Insert
(Commands.Translations, Templates_Parser.Assoc ("NAME", Name));
if Exists (Blueprint_Path) then
Iterate (Blueprint_Path, Current, Delete);
IO.Put_Line (TT.Success("Successfully deleted " & Blueprint) & " " & TT.Warn (TT.Bold (Name)));
else
IO.Put_Line (TT.Error("Blueprint" & " " & Blueprint_Path & " " & "not found"));
end if;
end;
else
IO.Put_Line(TT.Error("Command requires a blueprint and a name to be specified."));
end if;
end Execute;
--------------------
-- Setup_Switches --
--------------------
overriding
procedure Setup_Switches
(Cmd : in out Command;
Config : in out CLIC.Subcommand.Switches_Configuration)
is
use CLIC.Subcommand;
begin
null;
end Setup_Switches;
end Commands.Destroy;
|
290
|
ada
| 20
|
charlie5/lace
|
3-mid/opengl/source/lean/opengl-terrain.ads
|
with
openGL.Visual;
package openGL.Terrain
--
-- Provides a constructor for heightmap terrain.
--
is
function new_Terrain (heights_File : in asset_Name;
texture_File : in asset_Name := null_Asset;
Scale : in math.Vector_3 := (1.0, 1.0, 1.0)) return Visual.Grid;
end openGL.Terrain;
|
291
|
ada
| 1
|
mosteo/ansi-ada
|
src/ansi.ads
|
package ANSI with Pure is
Reset_All : constant String;
-- Resets the device to its original state. This may include (if
-- applicable): reset graphic rendition, clear tabulation stops, reset
-- to default font, and more.
type States is (Off, On);
function Shorten (Sequence : String) return String is (Sequence);
-- Some consecutive commands can be combined, resulting in a shorter
-- string. Currently does nothing, but included for future optimization.
-----------
-- COLOR --
-----------
type Colors is
(Default, -- Implementation defined according to ANSI
Black,
Red,
Green,
Yellow,
Blue,
Magenta,
Cyan,
Grey,
-- Note: these light variants might not work in older terminals. In
-- general, the bold + [light] color combination will result in the
-- same bright color
Light_Black,
Light_Red,
Light_Green,
Light_Yellow,
Light_Blue,
Light_Magenta,
Light_Cyan,
Light_Grey);
Reset : constant String;
-- Back to defaults. Applies to colors & styles.
function Foreground (Color : Colors) return String;
function Background (Color : Colors) return String;
-- Basic palette, 8/16 colors
subtype Palette_RGB is Natural range 0 .. 5;
-- Used for the 256-palette colors. Actual colors in this index-mode
-- palette can slightly vary from terminal to terminal.
function Palette_Fg (R, G, B : Palette_RGB) return String;
function Palette_Bg (R, G, B : Palette_RGB) return String;
subtype Greyscale is Natural range 0 .. 23;
-- Drawn from the same palette mode. 0 is black, 23 is white
function Foreground (Level : Greyscale) return String;
function Background (Level : Greyscale) return String;
subtype True_RGB is Natural range 0 .. 255;
-- Modern terminals support true 24-bit RGB color
function Foreground (R, G, B : True_RGB) return String;
function Background (R, G, B : True_RGB) return String;
Default_Foreground : constant String;
Default_Background : constant String;
function Color_Wrap (Text : String;
Foreground : String := "";
Background : String := "")
return String;
-- Wraps text between opening color and closing Defaults. See the combo
-- color+styles below.
------------
-- STYLES --
------------
type Styles is
(Default, -- equivalent to Default_Foreground/Background
Bright, -- aka Bold
Dim, -- aka Faint
Italic,
Underline,
Blink,
Rapid_Blink, -- ansi.sys only
Invert, -- swaps fg/bg, aka reverse video
Conceal, -- aka hide
Strike, -- aka crossed-out
Fraktur, -- rarely supported, gothic style
Double_Underline);
function Style (Style : Styles; Active : States := On) return String;
-- Apply/Remove a style
function Style_Wrap (Text : String;
Style : Styles) return String;
-- Wraps Text in the given style between On/Off sequences
function Wrap (Text : String;
Style : Styles;
Foreground : String := "";
Background : String := "")
return String;
------------
-- CURSOR --
------------
-- Cursor movement. No effect if at edge of screen.
function Back (Cells : Positive := 1) return String;
function Down (Lines : Positive := 1) return String;
function Forward (Cells : Positive := 1) return String;
function Up (Lines : Positive := 1) return String;
function Next (Lines : Positive := 1) return String;
function Previous (Lines : Positive := 1) return String;
-- Move to the beginning of the next/prev lines. Not in ansi.sys
function Horizontal (Column : Positive := 1) return String;
-- Move to a certain absolute column. Not in ansy.sys
function Position (Row, Column : Positive := 1) return String;
-- 1, 1 is top-left
Store : constant String;
-- Store cursor position. Private SCO extension, may work in current vts
Restore : constant String;
-- Restore cursor position to the previously stored one
Hide : constant String;
Show : constant String;
-- DECTCEM private extension, may work in current vts
--------------
-- CLEARING --
--------------
Clear_Screen : constant String;
Clear_Screen_And_Buffer : constant String;
-- Clear also the backscroll buffer
Clear_To_Beginning_Of_Screen : constant String;
Clear_To_End_Of_Screen : constant String;
-- From the cursor position
Clear_Line : constant String;
-- Does not change cursor position (neither the two following).
Clear_To_Beginning_Of_Line : constant String;
Clear_To_End_Of_Line : constant String;
function Scroll_Up (Lines : Positive) return String;
-- Adds lines at bottom
function Scroll_Down (Lines : Positive) return String;
-- Adds lines at top
private
ESC : constant Character := ASCII.ESC;
CSI : constant String := ESC & '[';
Reset_All : constant String := ESC & "c";
-- Helpers for the many int-to-str conversions
function Tail (S : String) return String is
(S (S'First + 1 .. S'Last));
function Img (I : Natural) return String is
(Tail (I'Img));
------------
-- COLORS --
------------
Reset : constant String := CSI & "0m";
-- Back to defaults. Applies to colors & styles.
function Foreground (Color : Colors) return String is
(CSI
& (case Color is
when Default => "39",
when Black => "30",
when Red => "31",
when Green => "32",
when Yellow => "33",
when Blue => "34",
when Magenta => "35",
when Cyan => "36",
when Grey => "37",
when Light_Black => "90",
when Light_Red => "91",
when Light_Green => "92",
when Light_Yellow => "93",
when Light_Blue => "94",
when Light_Magenta => "95",
when Light_Cyan => "96",
when Light_Grey => "97")
& "m");
function Background (Color : Colors) return String is
(CSI
& (case Color is
when Default => "49",
when Black => "40",
when Red => "41",
when Green => "42",
when Yellow => "43",
when Blue => "44",
when Magenta => "45",
when Cyan => "46",
when Grey => "47",
when Light_Black => "100",
when Light_Red => "101",
when Light_Green => "102",
when Light_Yellow => "103",
when Light_Blue => "104",
when Light_Magenta => "105",
when Light_Cyan => "106",
when Light_Grey => "107")
& "m");
function Bit8 (R, G, B : Palette_RGB) return String is
(Img (16 + 36 * R + 6 * G + B));
Fg : constant String := "38";
Bg : constant String := "48";
function Palette_Fg (R, G, B : Palette_RGB) return String is
(CSI & Fg & ";5;" & Bit8 (R, G, B) & "m");
function Palette_Bg (R, G, B : Palette_RGB) return String is
(CSI & Bg & ";5;" & Bit8 (R, G, B) & "m");
function Foreground (Level : Greyscale) return String is
(CSI & Fg & ";5;" & Img (232 + Level) & "m");
function Background (Level : Greyscale) return String is
(CSI & Bg & ";5;" & Img (232 + Level) & "m");
function Foreground (R, G, B : True_RGB) return String is
(CSI & Fg & ";2;" & Img (R) & ";" & Img (G) & ";" & Img (B) & "m");
function Background (R, G, B : True_RGB) return String is
(CSI & Bg & ";2;" & Img (R) & ";" & Img (G) & ";" & Img (B) & "m");
Default_Foreground : constant String := CSI & "39m";
Default_Background : constant String := CSI & "49m";
function Color_Wrap (Text : String;
Foreground : String := "";
Background : String := "")
return String is
((if Foreground /= "" then Foreground else "")
& (if Background /= "" then Background else "")
& Text
& (if Background /= "" then Default_Background else "")
& (if Foreground /= "" then Default_Foreground else ""));
------------
-- STYLES --
------------
function Style (Style : Styles; Active : States := On) return String is
(CSI
& (case Active is
when On =>
(case Style is
when Default => "39",
when Bright => "1",
when Dim => "2",
when Italic => "3",
when Underline => "4",
when Blink => "5",
when Rapid_Blink => "6",
when Invert => "7",
when Conceal => "8",
when Strike => "9",
when Fraktur => "20",
when Double_Underline => "21"
),
when Off =>
(case Style is
when Default => "49",
when Bright => "22",
when Dim => "22",
when Italic => "23",
when Underline => "24",
when Blink => "25",
when Rapid_Blink => "25",
when Invert => "27",
when Conceal => "28",
when Strike => "29",
when Fraktur => "23",
when Double_Underline => "24"
))
& "m");
function Style_Wrap (Text : String;
Style : Styles) return String is
(ANSI.Style (Style, On)
& Text
& ANSI.Style (Style, Off));
function Wrap (Text : String;
Style : Styles;
Foreground : String := "";
Background : String := "")
return String is
(Style_Wrap (Style => Style,
Text => Color_Wrap (Text => Text,
Foreground => Foreground,
Background => Background)));
------------
-- CURSOR --
------------
function Cursor (N : Positive; Code : Character) return String is
(CSI & Img (N) & Code) with Inline_Always;
-- For common Cursor sequences
function Back (Cells : Positive := 1) return String is
(Cursor (Cells, 'D'));
function Down (Lines : Positive := 1) return String is
(Cursor (Lines, 'B'));
function Forward (Cells : Positive := 1) return String is
(Cursor (Cells, 'C'));
function Up (Lines : Positive := 1) return String is
(Cursor (Lines, 'A'));
function Next (Lines : Positive := 1) return String is
(Cursor (Lines, 'E'));
function Previous (Lines : Positive := 1) return String is
(Cursor (Lines, 'F'));
function Horizontal (Column : Positive := 1) return String is
(Cursor (Column, 'G'));
function Position (Row, Column : Positive := 1) return String is
(CSI & Img (Row) & ";" & Img (Column) & "H");
Store : constant String := CSI & "s";
Restore : constant String := CSI & "u";
Hide : constant String := CSI & "?25l";
Show : constant String := CSI & "?25h";
--------------
-- CLEARING --
--------------
Clear_Screen : constant String := CSI & "2J";
Clear_Screen_And_Buffer : constant String := CSI & "3J";
Clear_To_Beginning_Of_Screen : constant String := CSI & "2J";
Clear_To_End_Of_Screen : constant String := CSI & "0J";
Clear_Line : constant String := CSI & "2K";
Clear_To_Beginning_Of_Line : constant String := CSI & "1K";
Clear_To_End_Of_Line : constant String := CSI & "0K";
function Scroll_Up (Lines : Positive) return String is
(CSI & Img (Lines) & "S");
function Scroll_Down (Lines : Positive) return String is
(CSI & Img (Lines) & "T");
end ANSI;
|
292
|
ada
| 80
|
thindil/steamsky
|
tests/events-test_data-tests.adb
|
<reponame>thindil/steamsky<filename>tests/events-test_data-tests.adb
-- This package has been generated automatically by GNATtest.
-- You are allowed to add your code to the bodies of test routines.
-- Such changes will be kept during further regeneration of this file.
-- All code placed outside of test routine bodies will be lost. The
-- code intended to set up and tear down the test environment should be
-- placed into Events.Test_Data.
with AUnit.Assertions; use AUnit.Assertions;
with System.Assertions;
-- begin read only
-- id:2.2/00/
--
-- This section can be used to add with clauses if necessary.
--
-- end read only
with Bases; use Bases;
-- begin read only
-- end read only
package body Events.Test_Data.Tests is
-- begin read only
-- id:2.2/01/
--
-- This section can be used to add global variables and other elements.
--
-- end read only
-- begin read only
-- end read only
-- begin read only
function Wrap_Test_CheckForEvent_1c4562_e01b25 return Boolean is
begin
declare
Test_CheckForEvent_1c4562_e01b25_Result: constant Boolean :=
GNATtest_Generated.GNATtest_Standard.Events.CheckForEvent;
begin
return Test_CheckForEvent_1c4562_e01b25_Result;
end;
end Wrap_Test_CheckForEvent_1c4562_e01b25;
-- end read only
-- begin read only
procedure Test_CheckForEvent_test_checkforevent(Gnattest_T: in out Test);
procedure Test_CheckForEvent_1c4562_e01b25(Gnattest_T: in out Test) renames
Test_CheckForEvent_test_checkforevent;
-- id:2.2/1c45624e0a8cde64/CheckForEvent/1/0/test_checkforevent/
procedure Test_CheckForEvent_test_checkforevent(Gnattest_T: in out Test) is
function CheckForEvent return Boolean renames
Wrap_Test_CheckForEvent_1c4562_e01b25;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
if CheckForEvent then
null;
end if;
Assert(True, "This test can only crash");
-- begin read only
end Test_CheckForEvent_test_checkforevent;
-- end read only
-- begin read only
procedure Wrap_Test_UpdateEvents_96e988_646fe5(Minutes: Positive) is
begin
GNATtest_Generated.GNATtest_Standard.Events.UpdateEvents(Minutes);
end Wrap_Test_UpdateEvents_96e988_646fe5;
-- end read only
-- begin read only
procedure Test_UpdateEvents_test_updateevents(Gnattest_T: in out Test);
procedure Test_UpdateEvents_96e988_646fe5(Gnattest_T: in out Test) renames
Test_UpdateEvents_test_updateevents;
-- id:2.2/96e988ace71f5fcf/UpdateEvents/1/0/test_updateevents/
procedure Test_UpdateEvents_test_updateevents(Gnattest_T: in out Test) is
procedure UpdateEvents(Minutes: Positive) renames
Wrap_Test_UpdateEvents_96e988_646fe5;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
UpdateEvents(1);
Assert(True, "This test can only crash.");
-- begin read only
end Test_UpdateEvents_test_updateevents;
-- end read only
-- begin read only
procedure Wrap_Test_DeleteEvent_0ca9ce_33228f(EventIndex: Positive) is
begin
begin
pragma Assert(EventIndex <= Events_List.Last_Index);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(events.ads:0):Test_DeleteEvent test requirement violated");
end;
GNATtest_Generated.GNATtest_Standard.Events.DeleteEvent(EventIndex);
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(events.ads:0:):Test_DeleteEvent test commitment violated");
end;
end Wrap_Test_DeleteEvent_0ca9ce_33228f;
-- end read only
-- begin read only
procedure Test_DeleteEvent_test_deleteevent(Gnattest_T: in out Test);
procedure Test_DeleteEvent_0ca9ce_33228f(Gnattest_T: in out Test) renames
Test_DeleteEvent_test_deleteevent;
-- id:2.2/0ca9ce05c1aa70d1/DeleteEvent/1/0/test_deleteevent/
procedure Test_DeleteEvent_test_deleteevent(Gnattest_T: in out Test) is
procedure DeleteEvent(EventIndex: Positive) renames
Wrap_Test_DeleteEvent_0ca9ce_33228f;
-- end read only
pragma Unreferenced(Gnattest_T);
Amount: constant Natural := Natural(Events_List.Length);
begin
DeleteEvent(1);
Assert(Natural(Events_List.Length) < Amount, "Failed to delete event.");
-- begin read only
end Test_DeleteEvent_test_deleteevent;
-- end read only
-- begin read only
procedure Wrap_Test_GenerateTraders_8d2b65_5d00a3 is
begin
GNATtest_Generated.GNATtest_Standard.Events.GenerateTraders;
end Wrap_Test_GenerateTraders_8d2b65_5d00a3;
-- end read only
-- begin read only
procedure Test_GenerateTraders_test_generatetraders
(Gnattest_T: in out Test);
procedure Test_GenerateTraders_8d2b65_5d00a3
(Gnattest_T: in out Test) renames
Test_GenerateTraders_test_generatetraders;
-- id:2.2/8d2b65740d8f0270/GenerateTraders/1/0/test_generatetraders/
procedure Test_GenerateTraders_test_generatetraders
(Gnattest_T: in out Test) is
procedure GenerateTraders renames
Wrap_Test_GenerateTraders_8d2b65_5d00a3;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
GenerateTraders;
Assert(True, "This test can only crash.");
-- begin read only
end Test_GenerateTraders_test_generatetraders;
-- end read only
-- begin read only
procedure Wrap_Test_RecoverBase_904011_a032fd(BaseIndex: Bases_Range) is
begin
GNATtest_Generated.GNATtest_Standard.Events.RecoverBase(BaseIndex);
end Wrap_Test_RecoverBase_904011_a032fd;
-- end read only
-- begin read only
procedure Test_RecoverBase_test_recoverbase(Gnattest_T: in out Test);
procedure Test_RecoverBase_904011_a032fd(Gnattest_T: in out Test) renames
Test_RecoverBase_test_recoverbase;
-- id:2.2/904011d165b5f6d4/RecoverBase/1/0/test_recoverbase/
procedure Test_RecoverBase_test_recoverbase(Gnattest_T: in out Test) is
procedure RecoverBase(BaseIndex: Bases_Range) renames
Wrap_Test_RecoverBase_904011_a032fd;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
for I in Sky_Bases'Range loop
if Sky_Bases(I).Population = 0 then
RecoverBase(I);
exit;
end if;
end loop;
Assert(True, "This test can only crash.");
-- begin read only
end Test_RecoverBase_test_recoverbase;
-- end read only
-- begin read only
procedure Wrap_Test_GenerateEnemies_7f8f2c_3cff13
(Enemies: in out UnboundedString_Container.Vector;
Owner: Unbounded_String := To_Unbounded_String("Any");
WithTraders: Boolean := True) is
begin
begin
pragma Assert(Owner /= Null_Unbounded_String);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(events.ads:0):Test_GenerateEnemies test requirement violated");
end;
GNATtest_Generated.GNATtest_Standard.Events.GenerateEnemies
(Enemies, Owner, WithTraders);
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(events.ads:0:):Test_GenerateEnemies test commitment violated");
end;
end Wrap_Test_GenerateEnemies_7f8f2c_3cff13;
-- end read only
-- begin read only
procedure Test_GenerateEnemies_test_generateenemies
(Gnattest_T: in out Test);
procedure Test_GenerateEnemies_7f8f2c_3cff13
(Gnattest_T: in out Test) renames
Test_GenerateEnemies_test_generateenemies;
-- id:2.2/7f8f2ce3bb5b1dd9/GenerateEnemies/1/0/test_generateenemies/
procedure Test_GenerateEnemies_test_generateenemies
(Gnattest_T: in out Test) is
procedure GenerateEnemies
(Enemies: in out UnboundedString_Container.Vector;
Owner: Unbounded_String := To_Unbounded_String("Any");
WithTraders: Boolean := True) renames
Wrap_Test_GenerateEnemies_7f8f2c_3cff13;
-- end read only
pragma Unreferenced(Gnattest_T);
Enemies: UnboundedString_Container.Vector;
begin
GenerateEnemies(Enemies);
Assert(Enemies.Length > 0, "Failed to generate enemies.");
-- begin read only
end Test_GenerateEnemies_test_generateenemies;
-- end read only
-- begin read only
-- id:2.2/02/
--
-- This section can be used to add elaboration code for the global state.
--
begin
-- end read only
null;
-- begin read only
-- end read only
end Events.Test_Data.Tests;
|
293
|
ada
| 0
|
AntonioRamosNieto/TFG-STM32F429
|
STM32F4/ToyOBDH/src/housekeeping.adb
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2018, Universidad Politécnica de Madrid --
-- --
-- This is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. This software is distributed in the hope that it will be useful, --
-- but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHAN- --
-- TABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public --
-- License for more details. You should have received a copy of the GNU --
-- General Public License distributed with this software; see file --
-- COPYING3. If not, go to http://www.gnu.org/licenses for a complete copy --
-- of the license. --
-- --
------------------------------------------------------------------------------
with HK_Data; use HK_Data;
with Sensor;
with Storage;
with Ada.Real_Time; use Ada.Real_Time;
package body Housekeeping is
-------------------------
-- Internal operations --
-------------------------
procedure Read_Data;
-- Read a value from a temperature sensor
----------------------------
-- Housekeeping task body --
----------------------------
task body Housekeeping_Task is -- cyclic
Next_Time : Time := Clock + Milliseconds (Start_Delay);
begin
loop
delay until Next_Time;
Read_Data;
Next_Time := Next_Time + Milliseconds (Period);
end loop;
end Housekeeping_Task;
----------
-- Read --
----------
procedure Read_Data is
Reading : Sensor_Reading;
Data : Sensor_Data;
SC : Seconds_Count;
TS : Time_Span;
begin
Sensor.Get (Reading);
Split (Clock, SC, TS);
Data := (Value => Reading, Timestamp => Mission_Time (SC));
Storage.Put (Data);
end Read_Data;
end Housekeeping;
|
294
|
ada
| 1
|
assessorgeneral/ConQAT
|
org.conqat.engine.sourcecode/test-data/org.conqat.engine.sourcecode.coverage.volume/loops2.adb
|
with Ada.Text_IO;
procedure Hello is
package IO renames Ada.Text_IO;
begin
for I in Integer range 1 .. 10 loop
bar();
end loop;
end Hello;
|
295
|
ada
| 0
|
btmalone/alog
|
aunit/aunit-tests.ads
|
<gh_stars>0
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- A U N I T . T E S T S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2000-2011, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT is maintained by AdaCore (http://www.adacore.com). --
-- --
------------------------------------------------------------------------------
-- Base Test Case or Test Suite
--
-- This base type allows composition of both test cases and sub-suites into a
-- test suite (Composite pattern)
package AUnit.Tests is
type Test is abstract tagged limited private;
type Test_Access is access all Test'Class;
private
type Test is abstract tagged limited null record;
end AUnit.Tests;
|
296
|
ada
| 0
|
marcello-s/AeonFlux
|
src/ada/AeonFlux/Parser/TokenReading.ads
|
-- Copyright (c) 2015-2019 <NAME>
-- for details see License.txt
with TokenValue; use TokenValue;
package TokenReading is
type Object is interface;
function ReadToken (O : Object) return TokenValue.Object is abstract;
end TokenReading;
|
297
|
ada
| 3
|
jwarwick/aoc_2020
|
day13/src/main.adb
|
<reponame>jwarwick/aoc_2020<gh_stars>1-10
-- AOC 2020, Day 13
with Ada.Text_IO; use Ada.Text_IO;
with Day; use Day;
procedure main is
s : constant Schedule := load_file("input.txt");
part1 : constant Long_Long_Integer := bus_mult(s);
part2 : constant Long_Long_Integer := earliest_matching(s);
begin
put_line("Part 1: " & Long_Long_Integer'Image(part1));
put_line("Part 2: " & Long_Long_Integer'Image(part2));
end main;
|
298
|
ada
| 1
|
charlie5/lace-alire
|
1-base/math/source/generic/pure/geometry/any_math-any_geometry-any_d3-any_modeller-any_forge.adb
|
<reponame>charlie5/lace-alire<filename>1-base/math/source/generic/pure/geometry/any_math-any_geometry-any_d3-any_modeller-any_forge.adb
with
ada.Text_IO,
ada.Strings.unbounded,
ada.Strings.Maps;
package body any_Math.any_Geometry.any_d3.any_Modeller.any_Forge
is
function to_Box_Model (half_Extents : in Vector_3 := (0.5, 0.5, 0.5)) return a_Model
is
pragma Unreferenced (half_Extents);
Modeller : any_Modeller.item;
begin
Modeller.add_Triangle ((0.0, 0.0, 0.0),
(1.0, 0.0, 0.0),
(1.0, 1.0, 0.0));
Modeller.add_Triangle ((1.0, 1.0, 0.0),
(0.0, 1.0, 0.0),
(0.0, 0.0, 0.0));
-- TODO: Add the rest.
return Modeller.Model;
end to_Box_Model;
function to_Capsule_Model (Length : in Real := 1.0;
Radius : in Real := 0.5) return a_Model
is
use Functions;
quality_Level : constant Positive := 4;
sides_Count : constant Positive := Positive (quality_Level * 4); -- Number of sides to the cylinder (divisible by 4).
type Edge is -- 'Barrel' edge.
record
Fore : Site;
Aft : Site;
end record;
type Edges is array (Positive range 1 .. sides_Count) of Edge;
type arch_Edges is array (Positive range 1 .. quality_Level) of Sites (1 .. sides_Count);
tmp,
ny, nz,
start_nx,
start_ny : Real;
a : constant Real := Pi * 2.0 / Real (sides_Count);
ca : constant Real := Cos (a);
sa : constant Real := Sin (a);
L : constant Real := Length * 0.5;
the_Edges : Edges;
Modeller : any_Modeller.item;
begin
-- Define cylinder body.
--
ny := 1.0;
nz := 0.0; -- Normal vector = (0, ny, nz)
for Each in Edges'Range
loop
the_Edges (Each).Fore (1) := ny * Radius;
the_Edges (Each).Fore (2) := nz * Radius;
the_Edges (Each).Fore (3) := L;
the_Edges (Each).Aft (1) := ny * Radius;
the_Edges (Each).Aft (2) := nz * Radius;
the_Edges (Each).Aft (3) := -L;
-- Rotate ny, nz.
--
tmp := ca * ny - sa * nz;
nz := sa * ny + ca * nz;
ny := tmp;
end loop;
for Each in Edges'Range
loop
if Each /= Edges'Last
then
Modeller.add_Triangle (the_Edges (Each) .Fore,
the_Edges (Each) .Aft,
the_Edges (Each + 1).Aft);
Modeller.add_Triangle (the_Edges (Each + 1).Aft,
the_Edges (Each + 1).Fore,
the_Edges (Each) .Fore);
else
Modeller.add_Triangle (the_Edges (Each) .Fore,
the_Edges (Each) .Aft,
the_Edges (edges'First).Aft);
Modeller.add_Triangle (the_Edges (edges'First).Aft,
the_Edges (edges'First).Fore,
the_Edges (Each) .Fore);
end if;
end loop;
-- Define fore cylinder cap.
--
declare
the_arch_Edges : arch_Edges;
begin
start_nx := 0.0;
start_ny := 1.0;
for each_Hoop in 1 .. quality_Level
loop
-- Get start_n2 = rotated start_n.
--
declare
start_nx2 : constant Real := ca * start_nx + sa * start_ny;
start_ny2 : constant Real := -sa * start_nx + ca * start_ny;
begin
-- Get n = start_n and n2 = start_n2.
--
ny := start_ny;
nz := 0.0;
declare
nx2 : constant Real := start_nx2;
ny2 : Real := start_ny2;
nz2 : Real := 0.0;
begin
for Each in 1 .. sides_Count
loop
the_arch_Edges (each_Hoop)(Each) (1) := ny2 * Radius;
the_arch_Edges (each_Hoop)(Each) (2) := nz2 * Radius;
the_arch_Edges (each_Hoop)(Each) (3) := nx2 * Radius + L;
-- Rotate n, n2.
--
tmp := ca * ny - sa * nz;
nz := sa * ny + ca * nz;
ny := tmp;
tmp := ca * ny2 - sa * nz2;
nz2 := sa * ny2 + ca * nz2;
ny2 := tmp;
end loop;
end;
start_nx := start_nx2;
start_ny := start_ny2;
end;
end loop;
for Each in 1 .. sides_Count
loop
if Each /= sides_Count
then
Modeller.add_Triangle (the_Edges (Each) .Fore,
the_Edges (Each + 1).Fore,
the_arch_Edges (1) (Each));
else
Modeller.add_Triangle (the_Edges (Each).Fore,
the_Edges (1) .Fore,
the_arch_Edges (1) (Each));
end if;
if Each /= sides_Count
then
Modeller.add_Triangle (the_Edges (Each + 1).Fore,
the_arch_Edges (1) (Each + 1),
the_arch_Edges (1) (Each));
else
Modeller.add_Triangle (the_Edges (1).Fore,
the_arch_Edges (1) (1),
the_arch_Edges (1) (Each));
end if;
end loop;
for each_Hoop in 1 .. quality_Level - 1
loop
for Each in 1 .. sides_Count
loop
declare
function next_Hoop_Vertex return Positive
is
begin
if Each = sides_Count then return 1;
else return Each + 1;
end if;
end next_Hoop_Vertex;
begin
Modeller.add_Triangle (the_arch_Edges (each_Hoop) (Each),
the_arch_Edges (each_Hoop) (next_Hoop_Vertex),
the_arch_Edges (each_Hoop + 1) (Each));
if each_Hoop /= quality_Level - 1
then
Modeller.add_Triangle (the_arch_Edges (each_Hoop) (next_Hoop_Vertex),
the_arch_Edges (each_Hoop + 1) (next_Hoop_Vertex),
the_arch_Edges (each_Hoop + 1) (Each));
end if;
end;
end loop;
end loop;
end;
-- Define aft cylinder cap.
--
declare
the_arch_Edges : arch_Edges;
begin
start_nx := 0.0;
start_ny := 1.0;
for each_Hoop in 1 .. quality_Level
loop
declare
-- Get start_n2 = rotated start_n.
--
start_nx2 : constant Real := ca * start_nx - sa * start_ny;
start_ny2 : constant Real := sa * start_nx + ca * start_ny;
begin
-- Get n = start_n and n2 = start_n2.
--
ny := start_ny;
nz := 0.0;
declare
nx2 : constant Real := start_nx2;
ny2 : Real := start_ny2;
nz2 : Real := 0.0;
begin
for Each in 1 .. sides_Count
loop
the_arch_Edges (each_Hoop) (Each) (1) := ny2 * Radius;
the_arch_Edges (each_Hoop) (Each) (2) := nz2 * Radius;
the_arch_Edges (each_Hoop) (Each) (3) := nx2 * Radius - L;
-- Rotate n, n2
--
tmp := ca * ny - sa * nz;
nz := sa * ny + ca * nz;
ny := tmp;
tmp := ca * ny2 - sa * nz2;
nz2 := sa * ny2 + ca * nz2;
ny2 := tmp;
end loop;
end;
start_nx := start_nx2;
start_ny := start_ny2;
end;
end loop;
for Each in 1 .. sides_Count
loop
if Each /= sides_Count
then
Modeller.add_Triangle (the_Edges (Each).Aft,
the_arch_Edges (1) (Each),
the_Edges (Each + 1).Aft);
else
Modeller.add_Triangle (the_Edges (Each).Aft,
the_arch_Edges (1) (Each),
the_Edges (1).Aft);
end if;
if Each /= sides_Count
then
Modeller.add_Triangle (The_Edges (Each + 1).Aft,
the_arch_Edges (1) (Each),
the_arch_Edges (1) (Each + 1));
else
Modeller.add_Triangle (the_Edges (1).Aft,
the_arch_Edges (1) (Each),
the_arch_Edges (1) (1));
end if;
end loop;
for each_Hoop in 1 .. quality_Level - 1
loop
for Each in 1 .. sides_Count
loop
declare
function next_Hoop_Vertex return Positive
is
begin
if Each = sides_Count then return 1;
else return Each + 1;
end if;
end next_hoop_Vertex;
begin
Modeller.add_Triangle (the_arch_Edges (each_Hoop) (Each),
the_arch_Edges (each_Hoop + 1) (Each),
the_arch_Edges (each_Hoop) (next_Hoop_Vertex));
if each_Hoop /= quality_Level - 1
then
Modeller.add_Triangle (the_arch_Edges (each_Hoop) (next_hoop_Vertex),
the_arch_Edges (each_Hoop + 1) (Each),
the_arch_Edges (each_Hoop + 1) (next_Hoop_Vertex));
end if;
end;
end loop;
end loop;
end;
return Modeller.Model;
end to_capsule_Model;
-- Polar to euclidian shape models.
--
function to_Radians (From : in Latitude) return Radians
is
begin
return Radians (From) * Pi / 180.0;
end to_Radians;
function to_Radians (From : in Longitude) return Radians
is
begin
return Radians (From) * Pi / 180.0;
end to_Radians;
function polar_Model_from (model_Filename : in String) return polar_Model -- TODO: Handle different file formats.
is
use Functions,
ada.Text_IO,
ada.Strings.unbounded;
the_File : File_type;
the_Text : unbounded_String;
begin
open (the_File, in_File, model_Filename);
while not end_of_File (the_File)
loop
append (the_Text, get_Line (the_File) & " ");
end loop;
declare
text_Length : constant Natural := Length (the_Text);
First : Positive := 1;
function get_Real return Real
is
use ada.Strings,
ada.Strings.Maps;
real_Set : constant Character_Set := to_Set (Span => (Low => '0',
High => '9'))
or to_Set ('-' & '.');
Last : Positive;
Result : Real;
begin
find_Token (the_Text, Set => real_Set,
From => First,
Test => Inside,
First => First,
Last => Last);
Result := Real'Value (Slice (the_Text,
Low => First,
High => Last));
First := Last + 1;
return Result;
end get_Real;
Lat : Latitude;
Long : Longitude;
Value : Integer;
Distance : Real;
Scale : constant Real := 10.0; -- TODO: Add a 'Scale' parameter.
the_Model : polar_Model;
begin
while First < text_Length
loop
Value := Integer (get_Real);
exit when Value = 360;
Long := Longitude (Value);
Lat := Latitude (get_Real);
Distance := get_Real;
the_Model (Long) (Lat).Site (1) := Scale * Distance * Cos (to_Radians (Lat)) * Sin (to_Radians (Long));
the_Model (Long) (Lat).Site (2) := Scale * Distance * Sin (to_Radians (Lat));
the_Model (Long) (Lat).Site (3) := Scale * Distance * Cos (to_Radians (Lat)) * Cos (to_Radians (Long));
end loop;
return the_Model;
end;
end polar_Model_from;
function mesh_Model_from (Model : in polar_Model) return a_Model
is
the_raw_Model : polar_Model := Model;
the_mesh_Model : a_Model (site_Count => 2522,
tri_Count => 73 * (16 * 4 + 6));
the_longitude : Longitude := 0;
the_latitude : Latitude ;
the_Vertex : Positive := 1;
the_Triangle : Positive := 1;
the_North_Pole : Positive;
the_South_Pole : Positive;
function Sum (the_Longitude : in Longitude; Increment : in Integer) return Longitude
is
Result : Integer := Integer (the_Longitude) + Increment;
begin
if Result >= 360
then
Result := Result - 360;
end if;
return longitude (Result);
end Sum;
begin
the_mesh_Model.Sites (the_Vertex) := (the_raw_model (0) (-90).Site);
the_North_Pole := the_Vertex;
the_raw_Model (0) (-90).Id := the_Vertex;
the_Vertex := the_Vertex + 1;
the_mesh_Model.Sites (the_Vertex) := (the_raw_model (0) (90).Site);
the_south_Pole := the_Vertex;
the_raw_Model (0) (90).Id := the_Vertex;
the_Vertex := the_Vertex + 1;
loop
the_latitude := -90;
loop
if the_Latitude = -90
then
the_raw_Model (the_Longitude) (the_Latitude).Id := the_North_Pole;
elsif the_Latitude = 90
then
the_raw_Model (the_Longitude) (the_Latitude).Id := the_South_Pole;
else
the_mesh_Model.Sites (the_Vertex) := the_raw_model (the_Longitude) (the_Latitude).Site;
the_raw_Model (the_Longitude) (the_Latitude).Id := the_Vertex;
the_Vertex := the_Vertex + 1;
end if;
exit when the_Latitude = 90;
the_Latitude := the_Latitude + 5;
end loop;
exit when the_Longitude = 355;
the_Longitude := the_Longitude + 5;
end loop;
the_Longitude := 0;
loop
the_mesh_Model.Triangles (the_Triangle) := (1 => the_North_Pole,
2 => the_raw_Model (Sum (the_Longitude, 5)) (-85).Id,
3 => the_raw_Model ( the_Longitude ) (-85).Id);
the_Triangle := the_Triangle + 1;
the_mesh_Model.Triangles (the_Triangle) := (1 => the_South_Pole,
2 => the_raw_Model (the_Longitude) (85).Id,
3 => the_raw_Model (Sum (the_Longitude, 5)) (85).Id);
the_Triangle := the_Triangle + 1;
the_Latitude := -85;
loop
the_mesh_Model.Triangles (the_Triangle) := (1 => the_raw_Model ( the_Longitude) (the_Latitude ).Id,
2 => the_raw_Model (Sum (the_Longitude, 5)) (the_Latitude ).Id,
3 => the_raw_Model ( the_Longitude) (the_Latitude + 5).Id);
the_Triangle := the_Triangle + 1;
the_mesh_Model.Triangles (the_Triangle) := (1 => the_raw_Model (the_Longitude) (the_Latitude + 5).Id,
2 => the_raw_Model (Sum (the_Longitude, 5)) (the_Latitude ).Id,
3 => the_raw_Model (Sum (the_Longitude, 5)) (the_Latitude + 5).Id);
the_Triangle := the_Triangle + 1;
the_Latitude := the_Latitude + 5;
exit when the_Latitude = 85;
end loop;
exit when the_Longitude = 355;
the_Longitude := the_Longitude + 5;
end loop;
the_mesh_Model.Triangles (the_Triangle) := (1 => the_North_Pole,
2 => the_raw_Model (5) (-85).Id,
3 => the_raw_Model (0) (-85).Id);
the_Triangle := the_Triangle + 1;
the_mesh_Model.Triangles (the_Triangle) := (1 => the_South_Pole,
2 => the_raw_Model (0) (85).Id,
3 => the_raw_Model (5) (85).Id);
the_Triangle := the_Triangle + 1;
the_latitude := -85;
loop
the_mesh_Model.Triangles (the_Triangle) := (1 => the_raw_Model (0) (the_Latitude ).Id,
2 => the_raw_Model (5) (the_Latitude ).Id,
3 => the_raw_Model (0) (the_Latitude + 5).Id);
the_Triangle := the_Triangle + 1;
the_mesh_Model.Triangles (the_Triangle) := (1 => the_raw_Model (0) (the_Latitude + 5).Id,
2 => the_raw_Model (5) (the_Latitude ).Id,
3 => the_raw_Model (5) (the_Latitude + 5).Id);
the_Triangle := the_Triangle + 1;
the_Latitude := the_Latitude + 5;
exit when the_Latitude = 85;
end loop;
return the_mesh_Model;
end mesh_Model_from;
end any_Math.any_Geometry.any_d3.any_Modeller.any_Forge;
|
299
|
ada
| 52
|
onox/orka
|
orka/src/gl/interface/gl-objects-queries.ads
|
<reponame>onox/orka<gh_stars>10-100
-- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2016 onox <<EMAIL>>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
with GL.Low_Level;
package GL.Objects.Queries is
pragma Preelaborate;
type Query_Type is
(Vertices_Submitted,
Primitives_Submitted,
Vertex_Shader_Invocations,
Tess_Control_Shader_Invocations,
Tess_Evaluation_Shader_Invocations,
Geometry_Shader_Primitives_Emitted,
Fragment_Shader_Invocations,
Compute_Shader_Invocations,
Clipping_Input_Primitives,
Clipping_Output_Primitives,
Geometry_Shader_Invocations,
Time_Elapsed,
Samples_Passed,
Any_Samples_Passed,
Primitives_Generated,
Any_Samples_Passed_Conservative,
Timestamp);
-- Has to be defined here because of the subtype declaration below
for Query_Type use
(Vertices_Submitted => 16#82EE#,
Primitives_Submitted => 16#82EF#,
Vertex_Shader_Invocations => 16#82F0#,
Tess_Control_Shader_Invocations => 16#82F1#,
Tess_Evaluation_Shader_Invocations => 16#82F2#,
Geometry_Shader_Primitives_Emitted => 16#82F3#,
Fragment_Shader_Invocations => 16#82F4#,
Compute_Shader_Invocations => 16#82F5#,
Clipping_Input_Primitives => 16#82F6#,
Clipping_Output_Primitives => 16#82F7#,
Geometry_Shader_Invocations => 16#887F#,
Time_Elapsed => 16#88BF#,
Samples_Passed => 16#8914#,
Any_Samples_Passed => 16#8C2F#,
Primitives_Generated => 16#8C87#,
Any_Samples_Passed_Conservative => 16#8D6A#,
Timestamp => 16#8E28#);
for Query_Type'Size use Low_Level.Enum'Size;
subtype Async_Query_Type is Query_Type
range Vertices_Submitted .. Any_Samples_Passed_Conservative;
subtype Timestamp_Query_Type is Query_Type range Timestamp .. Timestamp;
subtype Stream_Query_Type is Query_Type
with Static_Predicate =>
Stream_Query_Type in Primitives_Generated;
type Query_Param is (Result, Result_Available, Result_No_Wait);
type Query (Target : Query_Type) is new GL_Object with private;
overriding
procedure Initialize_Id (Object : in out Query);
overriding
procedure Delete_Id (Object : in out Query);
overriding
function Identifier (Object : Query) return Types.Debug.Identifier is
(Types.Debug.Query);
type Active_Query is limited new Ada.Finalization.Limited_Controlled with private;
function Begin_Query
(Object : in out Query;
Index : in Natural := 0) return Active_Query'Class
with Pre => Object.Target in Async_Query_Type and
(if Object.Target not in Stream_Query_Type then Index = 0);
-- Start an asynchronous query. The value returned is of a controlled
-- type, meaning you must assign it to some local variable, so that
-- the query will be automatically ended when the variable goes out
-- of scope.
--
-- Queries of type Timestamp are not used within a scope. For such
-- a query you can record the time into the query object by calling
-- Record_Current_Time.
--
-- Certain queries support multiple query operations; one for each
-- index. The index represents the vertex output stream used in a
-- Geometry Shader. These targets are:
--
-- * Primitives_Generated
function Result_Available (Object : in out Query) return Boolean;
-- Return true if a result is available, false otherwise. This function
-- can be used to avoid calling Result (and thereby stalling the CPU)
-- when the result is not yet available.
function Result_If_Available (Object : in out Query; Default : Boolean) return Boolean;
function Result_If_Available (Object : in out Query; Default : Natural) return Natural;
function Result_If_Available (Object : in out Query; Default : UInt64) return UInt64;
-- Return the result if available, otherwise return the default value
function Result (Object : in out Query) return Boolean;
function Result (Object : in out Query) return Natural;
function Result (Object : in out Query) return UInt64;
-- Return the result. If the result is not yet available, then the
-- CPU will stall until the result becomes available. This means
-- that if you do not call Result_Available, then this function call
-- will make the query synchronous.
procedure Record_Current_Time (Object : in out Query);
-- Record the time when the GPU has completed all previous commands
-- in a query object. The result must be retrieved asynchronously using
-- one of the Result functions.
function Get_Current_Time return Long;
-- Return the time when the GPU has received (but not necessarily
-- completed) all previous commands. Calling this function stalls the CPU.
private
for Query_Param use (Result => 16#8866#,
Result_Available => 16#8867#,
Result_No_Wait => 16#9194#);
for Query_Param'Size use Low_Level.Enum'Size;
type Query (Target : Query_Type) is new GL_Object with null record;
type Active_Query is limited new Ada.Finalization.Limited_Controlled with record
Target : Query_Type;
Index : Natural;
Finalized : Boolean;
end record;
overriding
procedure Finalize (Object : in out Active_Query);
end GL.Objects.Queries;
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.