repo_name
stringlengths 9
74
| language
stringclasses 1
value | length_bytes
int64 11
9.34M
| extension
stringclasses 2
values | content
stringlengths 11
9.34M
|
|---|---|---|---|---|
zhmu/ananas | Ada | 1,950 | ads | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T B I N D --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2022, 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. --
-- --
------------------------------------------------------------------------------
-- Main program of GNAT binder
procedure Gnatbind;
|
vpodzime/ada-util | Ada | 1,856 | adb | -----------------------------------------------------------------------
-- util-mail -- Mail Utility Library
-- Copyright (C) 2017 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- 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.Fixed;
package body Util.Mail is
-- ------------------------------
-- Parse the email address and separate the name from the address.
-- ------------------------------
function Parse_Address (E_Mail : in String) return Email_Address is
use Ada.Strings.Unbounded;
use Ada.Strings.Fixed;
use Ada.Strings;
Result : Email_Address;
First_Pos : constant Natural := Index (E_Mail, "<");
Last_Pos : constant Natural := Index (E_Mail, ">");
begin
if First_Pos > 0 and Last_Pos > 0 then
Result.Name := To_Unbounded_String (Trim (E_Mail (E_Mail'First .. First_Pos - 1),
Both));
Result.Address := To_Unbounded_String (Trim (E_Mail (First_Pos + 1 .. Last_Pos - 1),
Both));
else
Result.Address := To_Unbounded_String (Trim (E_Mail, Both));
end if;
return Result;
end Parse_Address;
end Util.Mail;
|
reznikmm/matreshka | Ada | 3,603 | ads | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <[email protected]> --
-- 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$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Elements.Generic_Hash;
function AMF.Utp.Data_Pools.Hash is
new AMF.Elements.Generic_Hash (Utp_Data_Pool, Utp_Data_Pool_Access);
|
AdaCore/Ada-IntelliJ | Ada | 1,935 | ads | -- Copyright (c) 2013, Nordic Semiconductor ASA
-- 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 Nordic Semiconductor ASA 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.
--
-- This spec has been automatically generated from nrf51.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with System;
-- nRF51 reference description for radio MCU with ARM 32-bit Cortex-M0
-- Microcontroller at 16MHz CPU clock
package NRF51_SVD is
pragma Preelaborate;
end NRF51_SVD;
|
reznikmm/matreshka | Ada | 77,377 | ads | package Encoder is
procedure Encode
(Data : ICTSClient.Types.Order_Item;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String);
procedure Encode
(Data : ICTSClient.Types.Order_Item;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String) is
begin
Writer.Start_Element (IATS_URI, Name);
Writer.Start_Element (IATS_URI, Account_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Account_Identifier'Wide_Wide_Image
(Data.Account),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Account_Name);
Writer.Start_Element (IATS_URI, Amount_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Amount))); -- decimal
Writer.End_Element (IATS_URI, Amount_Name);
if Ada.Strings.Unbounded.Length (Data.Application_Data) /= 0 then
Writer.Start_Element (IATS_URI, Application_Data_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Application_Data))); -- string
Writer.End_Element (IATS_URI, Application_Data_Name);
end if;
Writer.End_Element (IATS_URI, Name);
end Encode;
procedure Encode
(Data : Payloads_2.Activate_Condition;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String);
procedure Encode
(Data : Payloads_2.Activate_Condition;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String) is
begin
Writer.Start_Element (IATS_URI, Name);
case Data.Activate_Condition.Kind is
when Payloads.Rate_Case =>
if Data.Rate /= Payloads.Null_Decimal
and then CLI.Ws_Utils.Is_Digits (Data.Rate)
then
Writer.Start_Element (IATS_URI, Rate_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Rate))); -- decimal
Writer.End_Element (IATS_URI, Rate_Name);
end if;
when Payloads.Trailing_Case =>
if Data.Trailing /= Payloads.Null_Decimal
and then CLI.Ws_Utils.Is_Digits (Data.Trailing)
then
Writer.Start_Element (IATS_URI, Trailing_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Trailing))); -- decimal
Writer.End_Element (IATS_URI, Trailing_Name);
end if;
end case;
Writer.End_Element (IATS_URI, Name);
end Encode;
procedure Encode
(Data : ICTSClient.Types.Predefined_Condition;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String);
procedure Encode
(Data : ICTSClient.Types.Predefined_Condition;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String) is
begin
Writer.Start_Element (IATS_URI, Name);
Encode (Data.Stop
Writer,
"Stop");
Encode (Data.Limit
Writer,
"Limit");
Writer.End_Element (IATS_URI, Name);
end Encode;
procedure Encode
(Data : ICTSClient.Types.Entry_Order;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String);
procedure Encode
(Data : ICTSClient.Types.Entry_Order;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String) is
begin
Writer.Start_Element (IATS_URI, Name);
Writer.Start_Element (IATS_URI, Kind_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Kind))); -- string
Writer.End_Element (IATS_URI, Kind_Name);
Writer.Start_Element (IATS_URI, Instrument_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Instrument_Identifier'Wide_Wide_Image
(Data.Instrument),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Instrument_Name);
case Data.Create_Conditional_Open_Order_Base.Kind is
when Payloads.Rate_Case =>
Writer.Start_Element (IATS_URI, Rate_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Rate))); -- decimal
Writer.End_Element (IATS_URI, Rate_Name);
when Payloads.Distance_Case =>
Writer.Start_Element (IATS_URI, Distance_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Distance))); -- decimal
Writer.End_Element (IATS_URI, Distance_Name);
end case;
for Index in 1 .. Integer (Data.Order_Item.Length) loop
Encode (Data.Order_Item.Element (Index),
Writer,
"Order_Item");
end loop;
Writer.Start_Element (IATS_URI, Hedge_Name);
Writer.Characters (CLI.Ws_Utils.Image
(Data.Hedge)); -- boolean
Writer.End_Element (IATS_URI, Hedge_Name);
Encode (Data.Predefined
Writer,
"Predefined");
if Ada.Strings.Unbounded.Length (Data.Application_Data) /= 0 then
Writer.Start_Element (IATS_URI, Application_Data_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Application_Data))); -- string
Writer.End_Element (IATS_URI, Application_Data_Name);
end if;
Writer.End_Element (IATS_URI, Name);
end Encode;
procedure Encode
(Data : ICTSClient.Types.Stop_Limit_Order;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String);
procedure Encode
(Data : ICTSClient.Types.Stop_Limit_Order;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String) is
begin
Writer.Start_Element (IATS_URI, Name);
Writer.Start_Element (IATS_URI, Position_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Position_Group'Wide_Wide_Image
(Data.Position),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Position_Name);
case Data.Create_Conditional_Close_Order_Base.Kind is
when Payloads.Rate_Case =>
Writer.Start_Element (IATS_URI, Rate_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Rate))); -- decimal
Writer.End_Element (IATS_URI, Rate_Name);
when Payloads.Distance_Case =>
Writer.Start_Element (IATS_URI, Distance_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Distance))); -- decimal
Writer.End_Element (IATS_URI, Distance_Name);
end case;
for Index in 1 .. Integer (Data.Order_Item.Length) loop
Encode (Data.Order_Item.Element (Index),
Writer,
"Order_Item");
end loop;
Writer.Start_Element (IATS_URI, Hedge_Name);
Writer.Characters (CLI.Ws_Utils.Image
(Data.Hedge)); -- boolean
Writer.End_Element (IATS_URI, Hedge_Name);
if Ada.Strings.Unbounded.Length (Data.Application_Data) /= 0 then
Writer.Start_Element (IATS_URI, Application_Data_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Application_Data))); -- string
Writer.End_Element (IATS_URI, Application_Data_Name);
end if;
Writer.End_Element (IATS_URI, Name);
end Encode;
procedure Encode
(Data : ICTS.Forex.Order;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String);
procedure Encode
(Data : ICTS.Forex.Order;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String) is
begin
Writer.Start_Element (IATS_URI, Name);
Writer.Start_Element (IATS_URI, Identifier_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Order_Identifier'Wide_Wide_Image
(Data.Identifier),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Identifier_Name);
Writer.Start_Element (IATS_URI, Version_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Order_Version'Wide_Wide_Image
(Data.Version),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Version_Name);
Writer.End_Element (IATS_URI, Name);
end Encode;
procedure Encode
(Data : ICTS.Forex.Position_Group;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String);
procedure Encode
(Data : ICTS.Forex.Position_Group;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String) is
begin
Writer.Start_Element (IATS_URI, Name);
Writer.Start_Element (IATS_URI, Identifier_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Position_Group'Wide_Wide_Image
(Data.Identifier),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Identifier_Name);
Writer.Start_Element (IATS_URI, Version_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Position_Group_Version'Wide_Wide_Image
(Data.Version),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Version_Name);
Writer.End_Element (IATS_URI, Name);
end Encode;
procedure Encode
(Data : ICTS.Forex.Link;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String);
procedure Encode
(Data : ICTS.Forex.Link;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String) is
begin
Writer.Start_Element (IATS_URI, Name);
Writer.Start_Element (IATS_URI, Identifier_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Link_Identifier'Wide_Wide_Image
(Data.Identifier),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Identifier_Name);
Writer.Start_Element (IATS_URI, Version_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Link_Version'Wide_Wide_Image
(Data.Version),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Version_Name);
Writer.End_Element (IATS_URI, Name);
end Encode;
procedure Encode
(Data : Payloads_2.Instrument;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String);
procedure Encode
(Data : Payloads_2.Instrument;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String) is
begin
Writer.Start_Element (IATS_URI, Name);
Writer.Start_Element (IATS_URI, Identifier_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Instrument_Identifier'Wide_Wide_Image
(Data.Identifier),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Identifier_Name);
Writer.Start_Element (IATS_URI, Version_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Instrument_Version'Wide_Wide_Image
(Data.Version),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Version_Name);
Writer.End_Element (IATS_URI, Name);
end Encode;
procedure Encode
(Data : Payloads_2.Time_Interval;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String);
procedure Encode
(Data : Payloads_2.Time_Interval;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String) is
begin
Writer.Start_Element (IATS_URI, Name);
Writer.Start_Element (IATS_URI, From_Name);
Writer.Characters (IATS_URI, Data.From); -- time
Writer.End_Element (IATS_URI, From_Name);
Writer.Start_Element (IATS_URI, To_Name);
Writer.Characters (IATS_URI, Data.To); -- time
Writer.End_Element (IATS_URI, To_Name);
Writer.End_Element (IATS_URI, Name);
end Encode;
procedure Encode
(Data : ICTSClient.Types.Money;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String);
procedure Encode
(Data : ICTSClient.Types.Money;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String) is
begin
Writer.Start_Element (IATS_URI, Name);
Writer.Start_Element (IATS_URI, Currency_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Currency_Identifier'Wide_Wide_Image
(Data.Currency),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Currency_Name);
Writer.Start_Element (IATS_URI, Amount_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Amount))); -- decimal
Writer.End_Element (IATS_URI, Amount_Name);
Writer.End_Element (IATS_URI, Name);
end Encode;
procedure Encode
(Data : Payloads_2.Base_Margin_Requirement;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String);
procedure Encode
(Data : Payloads_2.Base_Margin_Requirement;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String) is
begin
Writer.Start_Element (IATS_URI, Name);
Writer.Start_Element (IATS_URI, Kind_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Kind))); -- string
Writer.End_Element (IATS_URI, Kind_Name);
if Data.Percent /= Payloads.Null_Decimal
and then CLI.Ws_Utils.Is_Digits (Data.Percent)
then
Writer.Start_Element (IATS_URI, Percent_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Percent))); -- decimal
Writer.End_Element (IATS_URI, Percent_Name);
end if;
Encode (Data.Fixed
Writer,
"Fixed");
Writer.End_Element (IATS_URI, Name);
end Encode;
procedure Encode
(Data : Payloads_2.Margin_Requirement_Level;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String);
procedure Encode
(Data : Payloads_2.Margin_Requirement_Level;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String) is
begin
Writer.Start_Element (IATS_URI, Name);
if Data.Limit /= Payloads.Null_Decimal
and then CLI.Ws_Utils.Is_Digits (Data.Limit)
then
Writer.Start_Element (IATS_URI, Limit_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Limit))); -- decimal
Writer.End_Element (IATS_URI, Limit_Name);
end if;
if Data.Coefficient /= Payloads.Null_Decimal
and then CLI.Ws_Utils.Is_Digits (Data.Coefficient)
then
Writer.Start_Element (IATS_URI, Coefficient_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Coefficient))); -- decimal
Writer.End_Element (IATS_URI, Coefficient_Name);
end if;
Writer.End_Element (IATS_URI, Name);
end Encode;
procedure Encode
(Data : Payloads_2.Margin_Requirement;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String);
procedure Encode
(Data : Payloads_2.Margin_Requirement;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String) is
begin
Writer.Start_Element (IATS_URI, Name);
Encode (Data.Base
Writer,
"Base");
if Data.Intraday_Discount_Coefficient /= Payloads.Null_Decimal
and then CLI.Ws_Utils.Is_Digits (Data.Intraday_Discount_Coefficient)
then
Writer.Start_Element (IATS_URI, Intraday_Discount_Coefficient_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Intraday_Discount_Coefficient))); -- decimal
Writer.End_Element (IATS_URI, Intraday_Discount_Coefficient_Name);
end if;
Encode (Data.Limit1
Writer,
"Limit1");
Encode (Data.Limit2
Writer,
"Limit2");
Writer.End_Element (IATS_URI, Name);
end Encode;
procedure Encode
(Data : Payloads_2.Margin_Call_Execution;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String);
procedure Encode
(Data : Payloads_2.Margin_Call_Execution;
Writer : in out XML.SAX.Writers.SAX_Writer'Class;
Name : League.Strings.Universal_String) is
begin
Writer.Start_Element (IATS_URI, Name);
Writer.Start_Element (IATS_URI, Mode_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Mode))); -- string
Writer.End_Element (IATS_URI, Mode_Name);
if Data.Level /= Payloads.Null_Decimal
and then CLI.Ws_Utils.Is_Digits (Data.Level)
then
Writer.Start_Element (IATS_URI, Level_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Level))); -- decimal
Writer.End_Element (IATS_URI, Level_Name);
end if;
Writer.End_Element (IATS_URI, Name);
end Encode;
-----------------------------------------------------------------------------
-- Copyright © 2013 ACTForex, Inc.
-- All rights reserved.
-----------------------------------------------------------------------------
-- This file is generated by xsd_to_Ada, don't edit it.
-----------------------------------------------------------------------------
-----------------
-- Bind_Orders --
-----------------
overriding procedure Encode
(Self : Bind_Orders_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Bind_Orders
renames Payloads.Bind_Orders (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Bind_Orders_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
for J in 1 .. Data.Bind_Orders_delphi.Lenght loop
case Data.Bind_Orders_delphi.Kind is
when Payloads.Create_Stop_Open_Order_Case =>
Encode (Data.Bind_Orders_delphi.Create_Stop_Open_Order.Element (Index),
Writer,
"Create_Stop_Open_Order");
when Payloads.Create_Limit_Open_Order_Case =>
Encode (Data.Bind_Orders_delphi.Create_Limit_Open_Order.Element (Index),
Writer,
"Create_Limit_Open_Order");
when Payloads.Create_Stop_Close_Order_Case =>
Encode (Data.Bind_Orders_delphi.Create_Stop_Close_Order.Element (Index),
Writer,
"Create_Stop_Close_Order");
when Payloads.Create_Limit_Close_Order_Case =>
Encode
(Data.Bind_Orders_delphi.Create_Limit_Close_Order.Element (Index),
Writer,
"Create_Limit_Close_Order");
when Payloads.Conditional_Order_Case =>
Encode (Data.Bind_Orders_delphi.Conditional_Order.Element (Index),
Writer,
"Conditional_Order");
end case;
end loop;
Writer.End_Element (IATS_URI, Bind_Orders_Name);
end Encode;
----------------------------------------
-- Set_Position_Item_Application_Data --
----------------------------------------
overriding procedure Encode
(Self : Set_Position_Item_Application_Data_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Set_Position_Item_Application_Data
renames Payloads.Set_Position_Item_Application_Data (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Set_Position_Item_Application_Data_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Encode (Data.Position
Writer,
"Position");
Writer.Start_Element (IATS_URI, Account_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Account_Identifier'Wide_Wide_Image
(Data.Account),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Account_Name);
Writer.Start_Element (IATS_URI, Application_Data_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Application_Data))); -- string
Writer.End_Element (IATS_URI, Application_Data_Name);
Writer.End_Element (IATS_URI, Set_Position_Item_Application_Data_Name);
end Encode;
-----------------------------------
-- Set_Position_Application_Data --
-----------------------------------
overriding procedure Encode
(Self : Set_Position_Application_Data_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Set_Position_Application_Data
renames Payloads.Set_Position_Application_Data (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Set_Position_Application_Data_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Encode (Data.Position
Writer,
"Position");
Writer.Start_Element (IATS_URI, Application_Data_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Application_Data))); -- string
Writer.End_Element (IATS_URI, Application_Data_Name);
Writer.End_Element (IATS_URI, Set_Position_Application_Data_Name);
end Encode;
-------------------
-- Close_Session --
-------------------
overriding procedure Encode
(Self : Close_Session_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Close_Session
renames Payloads.Close_Session (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Close_Session_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Writer.End_Element (IATS_URI, Close_Session_Name);
end Encode;
---------------------
-- Get_Instruments --
---------------------
overriding procedure Encode
(Self : Get_Instruments_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Get_Instruments
renames Payloads.Get_Instruments (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Get_Instruments_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Writer.End_Element (IATS_URI, Get_Instruments_Name);
end Encode;
-----------------------------------
-- Modify_Conditional_Order_Base --
-----------------------------------
overriding procedure Encode
(Self : Modify_Conditional_Order_Base_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Modify_Conditional_Order_Base
renames Payloads.Modify_Conditional_Order_Base (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Modify_Conditional_Order_Base_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Encode (Data.Order
Writer,
"Order");
case Data.Modify_Conditional_Order_Base_Condition.Kind is
when Payloads.Rate_Case =>
if Data
.Modify_Conditional_Order_Base_Condition.Rate /= Payloads.Null_Decimal
and then CLI.Ws_Utils.Is_Digits (Data.Rate)
then
Writer.Start_Element (IATS_URI, Condition_Name);
Writer.Start_Element (IATS_URI, Rate_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Modify_Conditional_Order_Base_Condition.Rate))); -- decimal
Writer.End_Element (IATS_URI, Rate_Name);
Writer.End_Element (IATS_URI, Condition_Name);
end if;
when Payloads.Distance_Case =>
if Data
.Modify_Conditional_Order_Base_Condition
.Distance /= Payloads.Null_Decimal
and then CLI.Ws_Utils.Is_Digits (Data.Distance)
then
Writer.Start_Element (IATS_URI, Condition_Name);
Writer.Start_Element (IATS_URI, Distance_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String
(Data.Modify_Conditional_Order_Base_Condition.Distance))); -- decimal
Writer.End_Element (IATS_URI, Distance_Name);
Writer.End_Element (IATS_URI, Condition_Name);
end if;
end case;
for J in 1 .. Data.Modify_Conditional_Order_Base_Order_Item.Lenght loop
Writer.Start_Element (IATS_URI, Order_Item_Name);
Writer.Start_Element (IATS_URI, Account_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Account_Identifier'Wide_Wide_Image
(Data
.Modify_Conditional_Order_Base_Order_Item
.Element (Index).Account),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Account_Name);
Writer.Ends_Element (IATS_URI, OrderItem_Name);
if Data
.Modify_Conditional_Order_Base_Order_Item
.Amount /= Payloads.Null_Decimal
and then CLI.Ws_Utils.Is_Digits (Data.Amount)
then
Writer.Start_Element (IATS_URI, Order_Item_Name);
Writer.Start_Element (IATS_URI, Amount_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String
(Data
.Modify_Conditional_Order_Base_Order_Item
.Element (Index).Amount))); -- decimal
Writer.End_Element (IATS_URI, Amount_Name);
Writer.End_Element (IATS_URI, Order_Item_Name);
end if;
if Ada
.Strings
.Unbounded
.Length
(Data
.Modify_Conditional_Order_Base_Order_Item
.Application_Data) /= 0 then
Writer.Start_Element (IATS_URI, Order_Item_Name);
Writer.Start_Element (IATS_URI, Application_Data_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data
.Modify_Conditional_Order_Base_Order_Item
.Element (Index).Application_Data))); -- string
Writer.End_Element (IATS_URI, Application_Data_Name);
Writer.End_Element (IATS_URI, Order_Item_Name);
end if;
end loop;
if Ada.Strings.Unbounded.Length (Data.Application_Data) /= 0 then
Writer.Start_Element (IATS_URI, Application_Data_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Application_Data))); -- string
Writer.End_Element (IATS_URI, Application_Data_Name);
end if;
Writer.End_Element (IATS_URI, Modify_Conditional_Order_Base_Name);
end Encode;
-------------------
-- Get_Positions --
-------------------
overriding procedure Encode
(Self : Get_Positions_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Get_Positions
renames Payloads.Get_Positions (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Get_Positions_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Writer.End_Element (IATS_URI, Get_Positions_Name);
end Encode;
-----------------
-- Get_Balance --
-----------------
overriding procedure Encode
(Self : Get_Balance_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Get_Balance
renames Payloads.Get_Balance (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Get_Balance_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Writer.Start_Element (IATS_URI, Account_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Account_Identifier'Wide_Wide_Image
(Data.Account),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Account_Name);
Writer.End_Element (IATS_URI, Get_Balance_Name);
end Encode;
-----------------------
-- Modify_Order_Base --
-----------------------
overriding procedure Encode
(Self : Modify_Order_Base_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Modify_Order_Base
renames Payloads.Modify_Order_Base (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Modify_Order_Base_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Encode (Data.Order
Writer,
"Order");
for J in 1 .. Data.Modify_Order_Base_Order_Item.Lenght loop
Writer.Start_Element (IATS_URI, Order_Item_Name);
Writer.Start_Element (IATS_URI, Account_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Account_Identifier'Wide_Wide_Image
(Data.Modify_Order_Base_Order_Item.Element (Index).Account),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Account_Name);
Writer.Ends_Element (IATS_URI, OrderItem_Name);
if Ada
.Strings
.Unbounded
.Length
(Data.Modify_Order_Base_Order_Item.Application_Data) /= 0 then
Writer.Start_Element (IATS_URI, Order_Item_Name);
Writer.Start_Element (IATS_URI, Application_Data_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data
.Modify_Order_Base_Order_Item
.Element (Index).Application_Data))); -- string
Writer.End_Element (IATS_URI, Application_Data_Name);
Writer.End_Element (IATS_URI, Order_Item_Name);
end if;
end loop;
if Ada.Strings.Unbounded.Length (Data.Application_Data) /= 0 then
Writer.Start_Element (IATS_URI, Application_Data_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Application_Data))); -- string
Writer.End_Element (IATS_URI, Application_Data_Name);
end if;
Writer.End_Element (IATS_URI, Modify_Order_Base_Name);
end Encode;
--------------------
-- Get_Currencies --
--------------------
overriding procedure Encode
(Self : Get_Currencies_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Get_Currencies
renames Payloads.Get_Currencies (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Get_Currencies_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Writer.End_Element (IATS_URI, Get_Currencies_Name);
end Encode;
------------------
-- Reject_Order --
------------------
overriding procedure Encode
(Self : Reject_Order_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Reject_Order
renames Payloads.Reject_Order (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Reject_Order_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Writer.Start_Element (IATS_URI, Order_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Order_Identifier'Wide_Wide_Image
(Data.Order),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Order_Name);
Writer.End_Element (IATS_URI, Reject_Order_Name);
end Encode;
-------------------
-- Unbind_Orders --
-------------------
overriding procedure Encode
(Self : Unbind_Orders_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Unbind_Orders
renames Payloads.Unbind_Orders (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Unbind_Orders_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Encode (Data.Orders_Link
Writer,
"Orders_Link");
Writer.End_Element (IATS_URI, Unbind_Orders_Name);
end Encode;
----------------------
-- Activate_Account --
----------------------
overriding procedure Encode
(Self : Activate_Account_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Activate_Account
renames Payloads.Activate_Account (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Activate_Account_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Writer.Start_Element (IATS_URI, Account_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Account_Identifier'Wide_Wide_Image
(Data.Account),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Account_Name);
Writer.End_Element (IATS_URI, Activate_Account_Name);
end Encode;
-----------------------
-- Create_Open_Order --
-----------------------
overriding procedure Encode
(Self : Create_Open_Order_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Create_Open_Order
renames Payloads.Create_Open_Order (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Create_Open_Order_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Writer.Start_Element (IATS_URI, Kind_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Kind))); -- string
Writer.End_Element (IATS_URI, Kind_Name);
Writer.Start_Element (IATS_URI, Instrument_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Instrument_Identifier'Wide_Wide_Image
(Data.Instrument),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Instrument_Name);
for Index in 1 .. Integer (Data.Order_Item.Length) loop
Encode (Data.Order_Item.Element (Index),
Writer,
"Order_Item");
end loop;
Writer.Start_Element (IATS_URI, Rate_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Rate))); -- decimal
Writer.End_Element (IATS_URI, Rate_Name);
if Data.Trader_Range /= Payloads.Null_Decimal
and then CLI.Ws_Utils.Is_Digits (Data.Trader_Range)
then
Writer.Start_Element (IATS_URI, Trader_Range_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Trader_Range))); -- decimal
Writer.End_Element (IATS_URI, Trader_Range_Name);
end if;
Writer.Start_Element (IATS_URI, Hedge_Name);
Writer.Characters (CLI.Ws_Utils.Image
(Data.Hedge)); -- boolean
Writer.End_Element (IATS_URI, Hedge_Name);
Encode (Data.Predefined
Writer,
"Predefined");
if Ada.Strings.Unbounded.Length (Data.Application_Data) /= 0 then
Writer.Start_Element (IATS_URI, Application_Data_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Application_Data))); -- string
Writer.End_Element (IATS_URI, Application_Data_Name);
end if;
Writer.End_Element (IATS_URI, Create_Open_Order_Name);
end Encode;
----------------------
-- Deactivate_Order --
----------------------
overriding procedure Encode
(Self : Deactivate_Order_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Deactivate_Order
renames Payloads.Deactivate_Order (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Deactivate_Order_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Writer.Start_Element (IATS_URI, Order_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Order_Identifier'Wide_Wide_Image
(Data.Order),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Order_Name);
Writer.End_Element (IATS_URI, Deactivate_Order_Name);
end Encode;
---------------------
-- Accept_Order_At --
---------------------
overriding procedure Encode
(Self : Accept_Order_At_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Accept_Order_At
renames Payloads.Accept_Order_At (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Accept_Order_At_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Writer.Start_Element (IATS_URI, Order_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Order_Identifier'Wide_Wide_Image
(Data.Order),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Order_Name);
Writer.Start_Element (IATS_URI, Rate_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Rate))); -- decimal
Writer.End_Element (IATS_URI, Rate_Name);
if Data.Trader_Range /= Payloads.Null_Decimal
and then CLI.Ws_Utils.Is_Digits (Data.Trader_Range)
then
Writer.Start_Element (IATS_URI, Trader_Range_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Trader_Range))); -- decimal
Writer.End_Element (IATS_URI, Trader_Range_Name);
end if;
Writer.End_Element (IATS_URI, Accept_Order_At_Name);
end Encode;
------------------
-- Cancel_Order --
------------------
overriding procedure Encode
(Self : Cancel_Order_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Cancel_Order
renames Payloads.Cancel_Order (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Cancel_Order_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Writer.Start_Element (IATS_URI, Order_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Order_Identifier'Wide_Wide_Image
(Data.Order),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Order_Name);
Writer.End_Element (IATS_URI, Cancel_Order_Name);
end Encode;
-----------------------------
-- Execute_Order_At_Market --
-----------------------------
overriding procedure Encode
(Self : Execute_Order_At_Market_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Execute_Order_At_Market
renames Payloads.Execute_Order_At_Market (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Execute_Order_At_Market_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Writer.Start_Element (IATS_URI, Order_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Order_Identifier'Wide_Wide_Image
(Data.Order),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Order_Name);
Writer.End_Element (IATS_URI, Execute_Order_At_Market_Name);
end Encode;
------------------------
-- Negotiate_Order_At --
------------------------
overriding procedure Encode
(Self : Negotiate_Order_At_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Negotiate_Order_At
renames Payloads.Negotiate_Order_At (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Negotiate_Order_At_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Writer.Start_Element (IATS_URI, Order_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Order_Identifier'Wide_Wide_Image
(Data.Order),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Order_Name);
Writer.Start_Element (IATS_URI, Rate_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Rate))); -- decimal
Writer.End_Element (IATS_URI, Rate_Name);
Writer.End_Element (IATS_URI, Negotiate_Order_At_Name);
end Encode;
------------------------
-- Create_Close_Order --
------------------------
overriding procedure Encode
(Self : Create_Close_Order_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Create_Close_Order
renames Payloads.Create_Close_Order (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Create_Close_Order_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Writer.Start_Element (IATS_URI, Position_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Position_Group'Wide_Wide_Image
(Data.Position),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Position_Name);
for Index in 1 .. Integer (Data.Order_Item.Length) loop
Encode (Data.Order_Item.Element (Index),
Writer,
"Order_Item");
end loop;
Writer.Start_Element (IATS_URI, Rate_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Rate))); -- decimal
Writer.End_Element (IATS_URI, Rate_Name);
if Data.Trader_Range /= Payloads.Null_Decimal
and then CLI.Ws_Utils.Is_Digits (Data.Trader_Range)
then
Writer.Start_Element (IATS_URI, Trader_Range_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Trader_Range))); -- decimal
Writer.End_Element (IATS_URI, Trader_Range_Name);
end if;
Writer.Start_Element (IATS_URI, With_Hedge_Name);
Writer.Characters (CLI.Ws_Utils.Image
(Data.With_Hedge)); -- boolean
Writer.End_Element (IATS_URI, With_Hedge_Name);
if Ada.Strings.Unbounded.Length (Data.Application_Data) /= 0 then
Writer.Start_Element (IATS_URI, Application_Data_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Application_Data))); -- string
Writer.End_Element (IATS_URI, Application_Data_Name);
end if;
Writer.End_Element (IATS_URI, Create_Close_Order_Name);
end Encode;
-------------------
-- Execute_Order --
-------------------
overriding procedure Encode
(Self : Execute_Order_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Execute_Order
renames Payloads.Execute_Order (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Execute_Order_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Writer.Start_Element (IATS_URI, Order_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Order_Identifier'Wide_Wide_Image
(Data.Order),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Order_Name);
Writer.End_Element (IATS_URI, Execute_Order_Name);
end Encode;
----------------------
-- Execute_Order_At --
----------------------
overriding procedure Encode
(Self : Execute_Order_At_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Execute_Order_At
renames Payloads.Execute_Order_At (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Execute_Order_At_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Writer.Start_Element (IATS_URI, Order_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Order_Identifier'Wide_Wide_Image
(Data.Order),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Order_Name);
Writer.Start_Element (IATS_URI, Rate_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Rate))); -- decimal
Writer.End_Element (IATS_URI, Rate_Name);
Writer.End_Element (IATS_URI, Execute_Order_At_Name);
end Encode;
----------------
-- Get_Orders --
----------------
overriding procedure Encode
(Self : Get_Orders_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Get_Orders
renames Payloads.Get_Orders (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Get_Orders_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Writer.End_Element (IATS_URI, Get_Orders_Name);
end Encode;
----------------------
-- Get_Orders_Links --
----------------------
overriding procedure Encode
(Self : Get_Orders_Links_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Get_Orders_Links
renames Payloads.Get_Orders_Links (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Get_Orders_Links_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Writer.End_Element (IATS_URI, Get_Orders_Links_Name);
end Encode;
------------------
-- Get_Accounts --
------------------
overriding procedure Encode
(Self : Get_Accounts_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Get_Accounts
renames Payloads.Get_Accounts (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Get_Accounts_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Writer.End_Element (IATS_URI, Get_Accounts_Name);
end Encode;
------------------
-- Accept_Order --
------------------
overriding procedure Encode
(Self : Accept_Order_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Accept_Order
renames Payloads.Accept_Order (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Accept_Order_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Writer.Start_Element (IATS_URI, Order_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Order_Identifier'Wide_Wide_Image
(Data.Order),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Order_Name);
Writer.End_Element (IATS_URI, Accept_Order_Name);
end Encode;
----------------------------
-- Instrument_Information --
----------------------------
overriding procedure Encode
(Self : Instrument_Updated_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Instrument_Updated
renames Payloads.Instrument_Updated (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Instrument_Updated_Name);
Encode (Data.Instrument
Writer,
"Instrument");
Writer.Start_Element (IATS_URI, Contract_Currency_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Currency_Identifier'Wide_Wide_Image
(Data.Contract_Currency),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Contract_Currency_Name);
Writer.Start_Element (IATS_URI, Opposite_Currency_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Currency_Identifier'Wide_Wide_Image
(Data.Opposite_Currency),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Opposite_Currency_Name);
Writer.Start_Element (IATS_URI, Contract_Size_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Contract_Size))); -- decimal
Writer.End_Element (IATS_URI, Contract_Size_Name);
Writer.Start_Element (IATS_URI, Is_Active_Name);
Writer.Characters (CLI.Ws_Utils.Image
(Data.Is_Active)); -- boolean
Writer.End_Element (IATS_URI, Is_Active_Name);
Writer.Start_Element (IATS_URI, Rate_Expiration_Name);
Writer.Characters (IATS_URI, Data.Rate_Expiration); -- duration
Writer.End_Element (IATS_URI, Rate_Expiration_Name);
if Data.Max_Order_Volume /= Payloads.Null_Decimal
and then CLI.Ws_Utils.Is_Digits (Data.Max_Order_Volume)
then
Writer.Start_Element (IATS_URI, Max_Order_Volume_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Max_Order_Volume))); -- decimal
Writer.End_Element (IATS_URI, Max_Order_Volume_Name);
end if;
for Index in 1 .. Integer (Data.Trading_Interval.Length) loop
Encode (Data.Trading_Interval.Element (Index),
Writer,
"Trading_Interval");
end loop;
if Data.Slippage_Range /= Payloads.Null_Decimal
and then CLI.Ws_Utils.Is_Digits (Data.Slippage_Range)
then
Writer.Start_Element (IATS_URI, Slippage_Range_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Slippage_Range))); -- decimal
Writer.End_Element (IATS_URI, Slippage_Range_Name);
end if;
if Data.Dealer_Range /= Payloads.Null_Decimal
and then CLI.Ws_Utils.Is_Digits (Data.Dealer_Range)
then
Writer.Start_Element (IATS_URI, Dealer_Range_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Dealer_Range))); -- decimal
Writer.End_Element (IATS_URI, Dealer_Range_Name);
end if;
if Data.Acceptable_Range /= Payloads.Null_Decimal
and then CLI.Ws_Utils.Is_Digits (Data.Acceptable_Range)
then
Writer.Start_Element (IATS_URI, Acceptable_Range_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Acceptable_Range))); -- decimal
Writer.End_Element (IATS_URI, Acceptable_Range_Name);
end if;
if Data.Negotiation_Volume /= Payloads.Null_Decimal
and then CLI.Ws_Utils.Is_Digits (Data.Negotiation_Volume)
then
Writer.Start_Element (IATS_URI, Negotiation_Volume_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String (Data.Negotiation_Volume))); -- decimal
Writer.End_Element (IATS_URI, Negotiation_Volume_Name);
end if;
Encode (Data.Margin_Requirement
Writer,
"Margin_Requirement");
Encode (Data.Margin_Call_Execution
Writer,
"Margin_Call_Execution");
Writer.End_Element (IATS_URI, Instrument_Updated_Name);
end Encode;
-------------------------
-- Add_Separator ERROR --
-------------------------
overriding procedure Encode
(Self : Create_Stop_Open_Order_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Create_Stop_Open_Order
renames Payloads.Create_Stop_Open_Order (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Create_Stop_Open_Order_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Writer.Start_Element (IATS_URI, Kind_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Create_Conditional_Open_Order_Base.Kind))); -- string
Writer.End_Element (IATS_URI, Kind_Name);
Writer.Start_Element (IATS_URI, Instrument_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Instrument_Identifier'Wide_Wide_Image
(Data.Create_Conditional_Open_Order_Base.Instrument),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Instrument_Name);
case Data
.Create_Conditional_Open_Order_Base
.Create_Conditional_Open_Order_Base.Kind is
when Payloads.Rate_Case =>
Writer.Start_Element (IATS_URI, Rate_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String
(Data
.Create_Conditional_Open_Order_Base
.Create_Conditional_Open_Order_Base.Rate))); -- decimal
Writer.End_Element (IATS_URI, Rate_Name);
when Payloads.Distance_Case =>
Writer.Start_Element (IATS_URI, Distance_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String
(Data
.Create_Conditional_Open_Order_Base
.Create_Conditional_Open_Order_Base.Distance))); -- decimal
Writer.End_Element (IATS_URI, Distance_Name);
end case;
for Index in 1 .
. Integer
(Data.Create_Conditional_Open_Order_Base.Order_Item.Length) loop
Encode
(Data.Create_Conditional_Open_Order_Base.Order_Item.Element (Index),
Writer,
"Order_Item");
end loop;
Writer.Start_Element (IATS_URI, Hedge_Name);
Writer.Characters (CLI.Ws_Utils.Image
(Data.Create_Conditional_Open_Order_Base.Hedge)); -- boolean
Writer.End_Element (IATS_URI, Hedge_Name);
Encode (Data.Create_Conditional_Open_Order_Base.Predefined
Writer,
"Predefined");
if Ada
.Strings
.Unbounded
.Length
(Data
.Create_Conditional_Open_Order_Base.Application_Data) /= 0 then
Writer.Start_Element (IATS_URI, Application_Data_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Create_Conditional_Open_Order_Base.Application_Data))); -- string
Writer.End_Element (IATS_URI, Application_Data_Name);
end if;
Writer.End_Element (IATS_URI, Create_Stop_Open_Order_Name);
end Encode;
-------------------------
-- Add_Separator ERROR --
-------------------------
overriding procedure Encode
(Self : Create_Stop_Close_Order_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Create_Stop_Close_Order
renames Payloads.Create_Stop_Close_Order (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Create_Stop_Close_Order_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Writer.Start_Element (IATS_URI, Position_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Position_Group'Wide_Wide_Image
(Data.Create_Conditional_Close_Order_Base.Position),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Position_Name);
case Data
.Create_Conditional_Close_Order_Base
.Create_Conditional_Close_Order_Base.Kind is
when Payloads.Rate_Case =>
Writer.Start_Element (IATS_URI, Rate_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String
(Data
.Create_Conditional_Close_Order_Base
.Create_Conditional_Close_Order_Base.Rate))); -- decimal
Writer.End_Element (IATS_URI, Rate_Name);
when Payloads.Distance_Case =>
Writer.Start_Element (IATS_URI, Distance_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String
(Data
.Create_Conditional_Close_Order_Base
.Create_Conditional_Close_Order_Base.Distance))); -- decimal
Writer.End_Element (IATS_URI, Distance_Name);
end case;
for Index in 1 .
. Integer
(Data.Create_Conditional_Close_Order_Base.Order_Item.Length) loop
Encode
(Data.Create_Conditional_Close_Order_Base.Order_Item.Element (Index),
Writer,
"Order_Item");
end loop;
Writer.Start_Element (IATS_URI, Hedge_Name);
Writer.Characters (CLI.Ws_Utils.Image
(Data.Create_Conditional_Close_Order_Base.Hedge)); -- boolean
Writer.End_Element (IATS_URI, Hedge_Name);
if Ada
.Strings
.Unbounded
.Length
(Data
.Create_Conditional_Close_Order_Base.Application_Data) /= 0 then
Writer.Start_Element (IATS_URI, Application_Data_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Create_Conditional_Close_Order_Base.Application_Data))); -- string
Writer.End_Element (IATS_URI, Application_Data_Name);
end if;
Writer.End_Element (IATS_URI, Create_Stop_Close_Order_Name);
end Encode;
-------------------------
-- Add_Separator ERROR --
-------------------------
overriding procedure Encode
(Self : Create_Limit_Open_Order_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Create_Limit_Open_Order
renames Payloads.Create_Limit_Open_Order (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Create_Limit_Open_Order_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Writer.Start_Element (IATS_URI, Kind_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Create_Conditional_Open_Order_Base.Kind))); -- string
Writer.End_Element (IATS_URI, Kind_Name);
Writer.Start_Element (IATS_URI, Instrument_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Instrument_Identifier'Wide_Wide_Image
(Data.Create_Conditional_Open_Order_Base.Instrument),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Instrument_Name);
case Data
.Create_Conditional_Open_Order_Base
.Create_Conditional_Open_Order_Base.Kind is
when Payloads.Rate_Case =>
Writer.Start_Element (IATS_URI, Rate_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String
(Data
.Create_Conditional_Open_Order_Base
.Create_Conditional_Open_Order_Base.Rate))); -- decimal
Writer.End_Element (IATS_URI, Rate_Name);
when Payloads.Distance_Case =>
Writer.Start_Element (IATS_URI, Distance_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String
(Data
.Create_Conditional_Open_Order_Base
.Create_Conditional_Open_Order_Base.Distance))); -- decimal
Writer.End_Element (IATS_URI, Distance_Name);
end case;
for Index in 1 .
. Integer
(Data.Create_Conditional_Open_Order_Base.Order_Item.Length) loop
Encode
(Data.Create_Conditional_Open_Order_Base.Order_Item.Element (Index),
Writer,
"Order_Item");
end loop;
Writer.Start_Element (IATS_URI, Hedge_Name);
Writer.Characters (CLI.Ws_Utils.Image
(Data.Create_Conditional_Open_Order_Base.Hedge)); -- boolean
Writer.End_Element (IATS_URI, Hedge_Name);
Encode (Data.Create_Conditional_Open_Order_Base.Predefined
Writer,
"Predefined");
if Ada
.Strings
.Unbounded
.Length
(Data
.Create_Conditional_Open_Order_Base.Application_Data) /= 0 then
Writer.Start_Element (IATS_URI, Application_Data_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Create_Conditional_Open_Order_Base.Application_Data))); -- string
Writer.End_Element (IATS_URI, Application_Data_Name);
end if;
Writer.End_Element (IATS_URI, Create_Limit_Open_Order_Name);
end Encode;
-------------------------
-- Add_Separator ERROR --
-------------------------
overriding procedure Encode
(Self : Create_Limit_Close_Order_Encoder;
Message : Web_Services.SOAP.Payloads.Abstract_SOAP_Payload'Class;
Writer : in out XML.SAX.Writers.SAX_Writer'Class)
is
pragma Unreferenced (Self);
use Ada.Strings.Unbounded;
Data : Payloads.Create_Limit_Close_Order
renames Payloads.Create_Limit_Close_Order (Message);
begin
Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);
Writer.Start_Element (IATS_URI, Create_Limit_Close_Order_Name);
Writer.Start_Element (IATS_URI, Session_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Session))); -- string
Writer.End_Element (IATS_URI, Session_Name);
Writer.Start_Element (IATS_URI, Position_Name);
Writer.Characters
(League.Strings.To_Universal_String
(Ada.Strings.Wide_Wide_Fixed.Trim
(ICTS.Types.Position_Group'Wide_Wide_Image
(Data.Create_Conditional_Close_Order_Base.Position),
Ada.Strings.Both))); -- positive_Integer
Writer.End_Element (IATS_URI, Position_Name);
case Data
.Create_Conditional_Close_Order_Base
.Create_Conditional_Close_Order_Base.Kind is
when Payloads.Rate_Case =>
Writer.Start_Element (IATS_URI, Rate_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String
(Data
.Create_Conditional_Close_Order_Base
.Create_Conditional_Close_Order_Base.Rate))); -- decimal
Writer.End_Element (IATS_URI, Rate_Name);
when Payloads.Distance_Case =>
Writer.Start_Element (IATS_URI, Distance_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(To_String
(Data
.Create_Conditional_Close_Order_Base
.Create_Conditional_Close_Order_Base.Distance))); -- decimal
Writer.End_Element (IATS_URI, Distance_Name);
end case;
for Index in 1 .
. Integer
(Data.Create_Conditional_Close_Order_Base.Order_Item.Length) loop
Encode
(Data.Create_Conditional_Close_Order_Base.Order_Item.Element (Index),
Writer,
"Order_Item");
end loop;
Writer.Start_Element (IATS_URI, Hedge_Name);
Writer.Characters (CLI.Ws_Utils.Image
(Data.Create_Conditional_Close_Order_Base.Hedge)); -- boolean
Writer.End_Element (IATS_URI, Hedge_Name);
if Ada
.Strings
.Unbounded
.Length
(Data
.Create_Conditional_Close_Order_Base.Application_Data) /= 0 then
Writer.Start_Element (IATS_URI, Application_Data_Name);
Writer.Characters
(League.Strings.From_UTF_8_String
(Ada.Strings.Unbounded.To_String
(Data.Create_Conditional_Close_Order_Base.Application_Data))); -- string
Writer.End_Element (IATS_URI, Application_Data_Name);
end if;
Writer.End_Element (IATS_URI, Create_Limit_Close_Order_Name);
end Encode;
end Encoder;
|
burratoo/Acton | Ada | 3,433 | ads | ------------------------------------------------------------------------------------------
-- --
-- OAK COMPONENTS --
-- --
-- OAK.MESSAGE --
-- --
-- Copyright (C) 2013-2021, Patrick Bernardi --
-- --
------------------------------------------------------------------------------------------
with Oak.Oak_Time;
with Oak.Agent;
with Oak.Brokers;
with Oak.Indices; use Oak.Indices;
with Oak.Interrupts; use Oak.Interrupts;
with Oak.States; use Oak.States;
with System; use System;
package Oak.Message with Preelaborate is
type Protected_Subprogram_Type is
(Protected_Function,
Protected_Procedure,
Protected_Entry);
type Task_Property_Kind is (Cycle_Period, Relative_Deadline);
type Task_Property (Property : Task_Property_Kind := Cycle_Period) is record
case Property is
when Cycle_Period =>
Cycle_Period : Oak_Time.Time_Span;
when Relative_Deadline =>
Deadline_Span : Oak_Time.Time_Span;
end case;
end record;
type Queue_End is (Back, Front);
type Oak_Message (Message_Type : Agent_State := No_Message) is record
case Message_Type is
when Activation_Pending =>
Activation_List : Oak.Agent.Task_List;
when Sleeping =>
Wake_Up_At : Oak_Time.Time;
Remove_From_Charge_List : Boolean;
when Update_Task_Property =>
Property_To_Update : Task_Property;
Update_Task : Oak.Agent.Task_Id;
when Release_Task =>
Task_To_Release : Oak.Agent.Task_Id;
when Entering_PO =>
PO_Enter : Oak.Brokers.Protected_Id;
Subprogram_Kind : Protected_Subprogram_Type;
Entry_Id_Enter : Indices.Entry_Index;
when Exiting_PO =>
PO_Exit : Oak.Brokers.Protected_Id;
when Attach_Interrupt_Handler =>
Attach_Handler : Interrupt_Handler_Pair;
when Selecting_Next_Agent =>
null;
when Adding_Agent =>
Agent_To_Add : Oak.Agent.Oak_Agent_Id;
Place_At : Queue_End;
when Adding_Agents =>
Agents_To_Add : Oak.Agent.Oak_Agent_Id;
when Removing_Agent =>
Agent_To_Remove : Oak.Agent.Oak_Agent_Id;
when Agent_State_Change =>
Agent_That_Changed : Oak.Agent.Oak_Agent_Id;
when Scheduler_Agent_Done =>
Wake_Scheduler_At : Oak_Time.Time;
Wake_Priority : Any_Priority;
Next_Agent : Oak.Agent.Oak_Agent_Id;
when Initialising_Agents =>
Agents_To_Init : Oak.Agent.Oak_Agent_Id;
when Wake_Agent =>
Agent_To_Wake : Oak.Agent.Oak_Agent_Id;
when others =>
null;
end case;
end record;
type Yielded_State is (Timer, Interrupt, Voluntary);
end Oak.Message;
|
twdroeger/ada-awa | Ada | 6,897 | adb | -----------------------------------------------------------------------
-- awa-index_arrays -- Static index arrays
-- Copyright (C) 2015 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- 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.Log.Loggers;
with Ada.Unchecked_Deallocation;
package body AWA.Index_Arrays is
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("AWA.Index_Arrays");
type Name_Pair is record
Name : Element_Type_Access := null;
Index : Index_Type := Index_Type'First;
end record;
type Name_Pair_Array is array (Index_Type range <>) of Name_Pair;
type Name_Pair_Array_Access is access all Name_Pair_Array;
type Name_Array is array (Index_Type range <>) of Element_Type_Access;
type Name_Array_Access is access all Name_Array;
-- Register a definition by its name and allocate a unique runtime index.
procedure Add_Index (Name : in Element_Type_Access;
Index : out Index_Type);
-- A static list of names. This array is created during the elaboration
-- of definitions. It is sorted on names.
Indexes : Name_Pair_Array_Access;
-- A static list of names indexed by the index.
Names : Name_Array_Access;
-- The index of the last definition.
Last_Index : Index_Type := Index_Type'First;
-- ------------------------------
-- Register a definition by its name and allocate a unique runtime index.
-- ------------------------------
procedure Add_Index (Name : in Element_Type_Access;
Index : out Index_Type) is
procedure Free is
new Ada.Unchecked_Deallocation (Object => Name_Pair_Array,
Name => Name_Pair_Array_Access);
procedure Free is
new Ada.Unchecked_Deallocation (Object => Name_Array,
Name => Name_Array_Access);
Left : Index_Type := Index_Type'First + 1;
Right : Index_Type := Last_Index;
begin
-- Check the storage and allocate it if necessary.
if Indexes = null then
Indexes := new Name_Pair_Array (Index_Type'First + 1 .. Index_Type'First + 10);
Names := new Name_Array (Index_Type'First + 1 .. Index_Type'First + 10);
elsif Indexes'Last = Last_Index then
declare
E : constant Name_Pair_Array_Access
:= new Name_Pair_Array (1 .. Last_Index + 10);
N : constant Name_Array_Access := new Name_Array (1 .. Last_Index + 10);
begin
E (Indexes'Range) := Indexes.all;
N (Names'Range) := Names.all;
Free (Indexes);
Free (Names);
Names := N;
Indexes := E;
end;
end if;
-- Find the definition position within the sorted table.
-- If a definition is already registered, bark and re-use the previous index.
while Left <= Right loop
declare
Pos : constant Index_Type := (Left + Right + 1) / 2;
Item : constant Element_Type_Access := Indexes (Pos).Name;
begin
if Name.all = Item.all then
Log.Error ("Definition " & Name.all & " is already registered.");
Index := Indexes (Pos).Index;
return;
elsif Name.all < Item.all then
Right := Pos - 1;
else
Left := Pos + 1;
end if;
end;
end loop;
-- Insert the new definition at the good position now.
if Left = 0 then
Left := Left + 1;
end if;
if Left <= Last_Index then
Indexes (Left + 1 .. Last_Index + 1) := Indexes (Left .. Last_Index);
end if;
Last_Index := Last_Index + 1;
Indexes (Left).Name := Name;
Indexes (Left).Index := Last_Index;
Names (Last_Index) := Name;
Index := Last_Index;
Log.Debug ("Definition " & Name.all & " index is {0}", Index_Type'Image (Index));
end Add_Index;
-- ------------------------------
-- Declare a new definition
-- ------------------------------
package body Definition is
Index : Index_Type;
Index_Name : aliased constant Element_Type := Name;
function Kind return Index_Type is
begin
return Index;
end Kind;
begin
Add_Index (Index_Name'Access, Index);
end Definition;
-- ------------------------------
-- Find the runtime index given the name.
-- Raises Not_Found exception if the name is not recognized.
-- ------------------------------
function Find (Name : in Element_Type) return Index_Type is
Left : Index_Type := 1;
Right : Index_Type := Last_Index;
begin
while Left <= Right loop
declare
Pos : constant Index_Type := (Left + Right + 1) / 2;
Item : constant Element_Type_Access := Indexes (Pos).Name;
begin
if Name = Item.all then
return Indexes (Pos).Index;
elsif Name < Item.all then
Right := Pos - 1;
else
Left := Pos + 1;
end if;
end;
end loop;
Log.Error ("Definition " & Name & " not recognized.");
raise Not_Found with "Definition " & Name & " not found";
end Find;
-- ------------------------------
-- Get the element associated with the index.
-- ------------------------------
function Get_Element (Index : in Index_Type) return Element_Type_Access is
begin
if Index = Invalid_Index or Index > Last_Index then
Log.Error ("Index {0} is out of bounds", Index_Type'Image (Index));
raise Not_Found;
end if;
return Names (Index);
end Get_Element;
-- ------------------------------
-- Check if the index is a valid index.
-- ------------------------------
function Is_Valid (Index : in Index_Type) return Boolean is
begin
return Index > Invalid_Index and Index <= Last_Index;
end Is_Valid;
-- ------------------------------
-- Get the last valid index.
-- ------------------------------
function Get_Last return Index_Type is
begin
return Last_Index;
end Get_Last;
end AWA.Index_Arrays;
|
AdaCore/training_material | Ada | 491 | adb | with Swaps; use Swaps;
with Ada.Text_IO;
with Sorts; use Sorts;
procedure Main is
V1 : Integer := 42;
V2 : Integer := 43;
T : Integer_List := (2, 7, 1, 9, 40, -1);
begin
Display_List (T);
Sort(T);
Display_List (T);
Ada.Text_IO.Put_Line ("V1 :=" & Integer'Image (V1) &
" V2 :=" & Integer'Image (V2));
Swap (V1, V2);
Ada.Text_IO.Put_Line ("V1 :=" & Integer'Image (V1) &
" V2 :=" & Integer'Image (V2));
end Main;
|
thieryw/game_of_life | Ada | 5,226 | adb | with ada.text_io,ada.integer_text_io,display,game_types ;
use ada.text_io,game_types ;
package body game_functions is
function initialize_cells return game_types.array_of_cell is
cells : game_types.array_of_cell := (others => (others => game_types.DEAD)) ;
initial_coordonates : game_types.coordinates := (x => 25, y => 50) ;
begining_of_line : integer ;
c : character ;
f : file_type ;
begin
open(f,in_file,"cells.life") ;
begining_of_line := initial_coordonates.y ;
while not end_of_file(f) loop
get(f,c) ;
--if end_of_line(f) then
-- skip_line(f);
--end if;
if c = '#' then
skip_line(f) ;
else
if c = '*' then
cells(initial_coordonates.x,initial_coordonates.y) := game_types.ALIVE ;
end if ;
initial_coordonates.y := initial_coordonates.y + 1 ;
if end_of_line(f) then
initial_coordonates.x := initial_coordonates.x + 1 ;
initial_coordonates.y := begining_of_line ;
end if ;
end if ;
end loop ;
close(f) ;
return cells ;
end initialize_cells ;
function evolve_cells(cells : game_types.array_of_cell) return game_types.array_of_cell is
function is_on_screen_frontier(i,j : integer) return boolean is
begin
if i = display.screen'first(1) or
i = display.screen'last(1) or
j = display.screen'first(2) or
j = display.screen'last(2)
then
return true ;
else
return false ;
end if ;
end is_on_screen_frontier ;
function get_live_neighbour_count(cells : game_types.array_of_cell ; i,j : integer) return integer is
count : integer := 0 ;
begin
if not is_on_screen_frontier(i,j) then
for k in i-1..i+1 loop
for l in j-1..j+1 loop
if k /= i or l /= j then
if cells(k,l) = ALIVE then
count := count + 1 ;
end if;
end if ;
end loop ;
end loop ;
end if ;
return count ;
end get_live_neighbour_count ;
procedure compute_next_cell_state(i,j : integer ; cells : game_types.array_of_cell ; new_cells : in out game_types.array_of_cell) is
count : integer ;
begin
count := get_live_neighbour_count(cells,i,j) ;
if cells(i,j) = ALIVE then
if count < 2 or count > 3 then
new_cells(i,j) := DEAD ;
elsif count = 2 or count = 3 then
new_cells(i,j) := ALIVE ;
end if ;
elsif cells(i,j) = DEAD then
if count = 3 then
new_cells(i,j) := ALIVE ;
end if ;
end if ;
end compute_next_cell_state ;
new_cells : game_types.array_of_cell := (others => (others => DEAD)) ;
begin
for i in cells'range(1) loop
for j in cells'range(2) loop
compute_next_cell_state(i,j,cells,new_cells) ;
end loop ;
end loop ;
return new_cells ;
end evolve_cells ;
procedure render_game(cells : game_types.array_of_cell) is
screen : display.grid := (others => (others => false)) ;
begin
for i in cells'range(1) loop
for j in cells'range(2) loop
if cells(i,j) = game_types.ALIVE then
screen(i,j) := true ;
end if ;
end loop ;
end loop ;
display.render(screen) ;
end render_game ;
end game_functions ;
|
AdaCore/training_material | Ada | 7,097 | 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 declarations for STM32F407xx boards manufactured by
-- from ST Microelectronics. For example: the STM32F4 Discovery kit.
with System; use System;
with STM32F4.GPIO; use STM32F4.GPIO;
with STM32F4.DMA; use STM32F4.DMA;
with STM32F4.USARTs; use STM32F4.USARTs;
with STM32F4.I2C; use STM32F4.I2C;
with STM32F4.SPI; use STM32F4.SPI;
with STM32F4.Timers; use STM32F4.Timers;
use STM32F4; -- for base addresses
package STM32F4_Discovery is
pragma Elaborate_Body;
subtype User_LED is GPIO_Pin;
Green : User_LED renames Pin_12;
Orange : User_LED renames Pin_13;
Red : User_LED renames Pin_14;
Blue : User_LED renames Pin_15;
LED3 : User_LED renames Orange;
LED4 : User_LED renames Green;
LED5 : User_LED renames Red;
LED6 : User_LED renames Blue;
procedure Initialize_LEDs;
-- MUST be called prior to any use of the LEDs
procedure On (This : User_LED) with Inline;
procedure Off (This : User_LED) with Inline;
procedure Toggle (This : User_LED) with Inline;
procedure All_LEDs_Off with Inline;
procedure All_LEDs_On with Inline;
GPIO_A : aliased GPIO_Port with Volatile, Address => System'To_Address (GPIOA_Base);
GPIO_B : aliased GPIO_Port with Volatile, Address => System'To_Address (GPIOB_Base);
GPIO_C : aliased GPIO_Port with Volatile, Address => System'To_Address (GPIOC_Base);
GPIO_D : aliased GPIO_Port with Volatile, Address => System'To_Address (GPIOD_Base);
GPIO_E : aliased GPIO_Port with Volatile, Address => System'To_Address (GPIOE_Base);
GPIO_F : aliased GPIO_Port with Volatile, Address => System'To_Address (GPIOF_Base);
GPIO_G : aliased GPIO_Port with Volatile, Address => System'To_Address (GPIOG_Base);
GPIO_H : aliased GPIO_Port with Volatile, Address => System'To_Address (GPIOH_Base);
GPIO_I : aliased GPIO_Port with Volatile, Address => System'To_Address (GPIOI_Base);
procedure Enable_Clock (This : aliased in out GPIO_Port);
USART_1 : aliased USART with Volatile, Address => System'To_Address (USART1_Base);
USART_2 : aliased USART with Volatile, Address => System'To_Address (USART2_Base);
USART_3 : aliased USART with Volatile, Address => System'To_Address (USART3_Base);
USART_6 : aliased USART with Volatile, Address => System'To_Address (USART6_Base);
procedure Enable_Clock (This : aliased in out USART);
DMA_1 : aliased DMA_Controller with Volatile, Address => System'To_Address (DMA1_BASE);
DMA_2 : aliased DMA_Controller with Volatile, Address => System'To_Address (DMA2_BASE);
procedure Enable_Clock (This : aliased in out DMA_Controller);
I2C_1 : aliased I2C_Port with Volatile, Address => System'To_Address (I2C1_Base);
I2C_2 : aliased I2C_Port with Volatile, Address => System'To_Address (I2C2_Base);
I2C_3 : aliased I2C_Port with Volatile, Address => System'To_Address (I2C3_Base);
procedure Enable_Clock (This : aliased in out I2C_Port);
procedure Reset (This : in out I2C_Port);
SPI_1 : aliased SPI_Port with Volatile, Address => System'To_Address (SPI1_Base);
SPI_2 : aliased SPI_Port with Volatile, Address => System'To_Address (SPI2_Base);
SPI_3 : aliased SPI_Port with Volatile, Address => System'To_Address (SPI3_Base);
procedure Enable_Clock (This : aliased in out SPI_Port);
procedure Reset (This : in out SPI_Port);
Timer_1 : Timer with Volatile, Address => System'To_Address (TIM1_Base);
pragma Import (Ada, Timer_1);
Timer_2 : Timer with Volatile, Address => System'To_Address (TIM2_Base);
pragma Import (Ada, Timer_2);
Timer_3 : Timer with Volatile, Address => System'To_Address (TIM3_Base);
pragma Import (Ada, Timer_3);
Timer_4 : Timer with Volatile, Address => System'To_Address (TIM4_Base);
pragma Import (Ada, Timer_4);
Timer_5 : Timer with Volatile, Address => System'To_Address (TIM5_Base);
pragma Import (Ada, Timer_5);
Timer_6 : Timer with Volatile, Address => System'To_Address (TIM6_Base);
pragma Import (Ada, Timer_6);
Timer_7 : Timer with Volatile, Address => System'To_Address (TIM7_Base);
pragma Import (Ada, Timer_7);
Timer_8 : Timer with Volatile, Address => System'To_Address (TIM8_Base);
pragma Import (Ada, Timer_8);
Timer_9 : Timer with Volatile, Address => System'To_Address (TIM9_Base);
pragma Import (Ada, Timer_9);
Timer_10 : Timer with Volatile, Address => System'To_Address (TIM10_Base);
pragma Import (Ada, Timer_10);
Timer_11 : Timer with Volatile, Address => System'To_Address (TIM11_Base);
pragma Import (Ada, Timer_11);
Timer_12 : Timer with Volatile, Address => System'To_Address (TIM12_Base);
pragma Import (Ada, Timer_12);
Timer_13 : Timer with Volatile, Address => System'To_Address (TIM13_Base);
pragma Import (Ada, Timer_13);
Timer_14 : Timer with Volatile, Address => System'To_Address (TIM14_Base);
pragma Import (Ada, Timer_14);
procedure Enable_Clock (This : in out Timer);
procedure Reset (This : in out Timer);
end STM32F4_Discovery;
|
charlie5/lace | Ada | 268 | ads | with
physics.Space;
package physics.Forge
--
-- Provides constructors for physics classes.
--
is
type Real_view is access all math.Real;
----------
--- Space
--
function new_Space (Kind : in space_Kind) return Space.view;
end physics.Forge;
|
AdaCore/libadalang | Ada | 124 | adb | with Ada.Text_IO;
procedure Hello is
begin
Ada.Text_IO.Put_Line ("Hello");
end Hello;
pragma Find_All_References (Any);
|
riccardo-bernardini/eugen | Ada | 2,445 | ads |
with EU_Projects.Nodes.Timed_Nodes;
with EU_Projects.Node_Tables;
package EU_Projects.Nodes.Timed_Nodes.Milestones is
subtype Milestone_Index is Node_Index;
No_Milestone : constant Extended_Node_Index := No_Index;
type Milestone is new Nodes.Timed_Nodes.Timed_Node with private;
type Milestone_Label is new Node_Label;
type Milestone_Access is access all Milestone;
function Create (Label : Milestone_Label;
Name : String;
Short_Name : String;
Description : String;
Due_On : String;
Node_Dir : in out Node_Tables.Node_Table;
Verification : String)
return Milestone_Access;
-- function Index (Item : Milestone) return Milestone_Index;
procedure Set_Index (Item : in out Milestone;
Idx : Milestone_Index);
procedure Update_Index (Item : in out Milestone;
Idx : Milestone_Index);
overriding
function Full_Index (Item : Milestone;
Prefixed : Boolean)
return String;
procedure Add_Deliverable (Item : in out Milestone;
Deliv : Node_Label);
function Deliverable_List (Item : Milestone) return Node_Label_Lists.Vector;
overriding function Dependency_List (Item : Milestone)
return Node_Label_Lists.Vector
is (Item.Deliverable_List);
overriding function Dependency_Ready_Var (Item : Milestone) return String
is ("when");
function Verification_Mean (Item : Milestone) return String;
private
type Milestone is new Nodes.Timed_Nodes.Timed_Node with
record
Deliv : Node_Label_Lists.Vector;
Verification : Unbounded_String;
end record;
-- function Index (Item : Milestone) return Milestone_Index
-- is (Milestone_Index (Item.Index));
overriding
function Full_Index (Item : Milestone;
Prefixed : Boolean)
return String
is ((if Prefixed then "M" else "") & Image (Item.Index));
function Deliverable_List (Item : Milestone) return Node_Label_Lists.Vector
is (Item.Deliv);
function Verification_Mean (Item : Milestone) return String
is (To_String (Item.Verification));
end EU_Projects.Nodes.Timed_Nodes.Milestones;
|
reznikmm/matreshka | Ada | 6,780 | adb | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Open Document Toolkit --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2014, Vadim Godunko <[email protected]> --
-- 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.DOM_Documents;
with Matreshka.ODF_String_Constants;
with ODF.DOM.Iterators;
with ODF.DOM.Visitors;
package body Matreshka.ODF_Text.Change_Elements is
------------
-- Create --
------------
overriding function Create
(Parameters : not null access Matreshka.DOM_Elements.Element_L2_Parameters)
return Text_Change_Element_Node is
begin
return Self : Text_Change_Element_Node do
Matreshka.ODF_Text.Constructors.Initialize
(Self'Unchecked_Access,
Parameters.Document,
Matreshka.ODF_String_Constants.Text_Prefix);
end return;
end Create;
----------------
-- Enter_Node --
----------------
overriding procedure Enter_Node
(Self : not null access Text_Change_Element_Node;
Visitor : in out XML.DOM.Visitors.Abstract_Visitor'Class;
Control : in out XML.DOM.Visitors.Traverse_Control) is
begin
if Visitor in ODF.DOM.Visitors.Abstract_ODF_Visitor'Class then
ODF.DOM.Visitors.Abstract_ODF_Visitor'Class
(Visitor).Enter_Text_Change
(ODF.DOM.Text_Change_Elements.ODF_Text_Change_Access
(Self),
Control);
else
Matreshka.DOM_Elements.Abstract_Element_Node
(Self.all).Enter_Node (Visitor, Control);
end if;
end Enter_Node;
--------------------
-- Get_Local_Name --
--------------------
overriding function Get_Local_Name
(Self : not null access constant Text_Change_Element_Node)
return League.Strings.Universal_String
is
pragma Unreferenced (Self);
begin
return Matreshka.ODF_String_Constants.Change_Element;
end Get_Local_Name;
----------------
-- Leave_Node --
----------------
overriding procedure Leave_Node
(Self : not null access Text_Change_Element_Node;
Visitor : in out XML.DOM.Visitors.Abstract_Visitor'Class;
Control : in out XML.DOM.Visitors.Traverse_Control) is
begin
if Visitor in ODF.DOM.Visitors.Abstract_ODF_Visitor'Class then
ODF.DOM.Visitors.Abstract_ODF_Visitor'Class
(Visitor).Leave_Text_Change
(ODF.DOM.Text_Change_Elements.ODF_Text_Change_Access
(Self),
Control);
else
Matreshka.DOM_Elements.Abstract_Element_Node
(Self.all).Leave_Node (Visitor, Control);
end if;
end Leave_Node;
----------------
-- Visit_Node --
----------------
overriding procedure Visit_Node
(Self : not null access Text_Change_Element_Node;
Iterator : in out XML.DOM.Visitors.Abstract_Iterator'Class;
Visitor : in out XML.DOM.Visitors.Abstract_Visitor'Class;
Control : in out XML.DOM.Visitors.Traverse_Control) is
begin
if Iterator in ODF.DOM.Iterators.Abstract_ODF_Iterator'Class then
ODF.DOM.Iterators.Abstract_ODF_Iterator'Class
(Iterator).Visit_Text_Change
(Visitor,
ODF.DOM.Text_Change_Elements.ODF_Text_Change_Access
(Self),
Control);
else
Matreshka.DOM_Elements.Abstract_Element_Node
(Self.all).Visit_Node (Iterator, Visitor, Control);
end if;
end Visit_Node;
begin
Matreshka.DOM_Documents.Register_Element
(Matreshka.ODF_String_Constants.Text_URI,
Matreshka.ODF_String_Constants.Change_Element,
Text_Change_Element_Node'Tag);
end Matreshka.ODF_Text.Change_Elements;
|
stcarrez/ada-util | Ada | 7,092 | adb | -----------------------------------------------------------------------
-- util-streams-encoders -- Streams with encoding and decoding capabilities
-- Copyright (C) 2017, 2018, 2019, 2021, 2022 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- 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 Util.Streams.Buffered.Encoders is
-- -----------------------
-- Initialize the stream with a buffer of <b>Size</b> bytes.
-- -----------------------
overriding
procedure Initialize (Stream : in out Encoder_Stream;
Size : in Positive) is
begin
Buffer_Stream (Stream).Initialize (Size);
Stream.No_Flush := True;
end Initialize;
-- -----------------------
-- Initialize the stream to write on the given stream.
-- An internal buffer is allocated for writing the stream.
-- -----------------------
-- overriding
procedure Produces (Stream : in out Encoder_Stream;
Output : access Output_Stream'Class;
Size : in Positive) is
begin
Stream.Initialize (Size);
Stream.Output := Output;
Stream.No_Flush := False;
end Produces;
-- -----------------------
-- Initialize the stream to read the given streams.
-- -----------------------
procedure Consumes (Stream : in out Encoder_Stream;
Input : access Input_Stream'Class;
Size : in Positive) is
begin
Stream.Initialize (Size);
Stream.Input := Input;
end Consumes;
-- -----------------------
-- Close the sink.
-- -----------------------
overriding
procedure Close (Stream : in out Encoder_Stream) is
begin
Stream.Flush;
if Stream.Output /= null then
Stream.Output.Close;
end if;
end Close;
-- -----------------------
-- Write the buffer array to the output stream.
-- -----------------------
overriding
procedure Write (Stream : in out Encoder_Stream;
Buffer : in Ada.Streams.Stream_Element_Array) is
First_Encoded : Ada.Streams.Stream_Element_Offset := Buffer'First;
Last_Encoded : Ada.Streams.Stream_Element_Offset;
Last_Pos : Ada.Streams.Stream_Element_Offset;
begin
while First_Encoded <= Buffer'Last loop
Stream.Transform.Transform
(Data => Buffer (First_Encoded .. Buffer'Last),
Into => Stream.Buffer (Stream.Write_Pos .. Stream.Buffer'Last),
Last => Last_Pos,
Encoded => Last_Encoded);
if Last_Encoded < Buffer'Last or else Last_Pos = Stream.Buffer'Last then
Stream.Output.Write (Stream.Buffer (Stream.Buffer'First .. Last_Pos));
Stream.Write_Pos := Stream.Buffer'First;
else
Stream.Write_Pos := Last_Pos + 1;
end if;
First_Encoded := Last_Encoded + 1;
end loop;
end Write;
-- ------------------------------
-- Fill the buffer by reading the input stream.
-- Raises Data_Error if there is no input stream;
-- ------------------------------
procedure Fill (Stream : in out Encoder_Stream) is
begin
if Stream.Input = null then
Stream.Eof := True;
else
Stream.Input.Read (Stream.Buffer (1 .. Stream.Last), Stream.Write_Pos);
Stream.Eof := Stream.Write_Pos < 1;
if not Stream.Eof then
Stream.Write_Pos := Stream.Write_Pos + 1;
end if;
Stream.Read_Pos := 1;
end if;
end Fill;
-- -----------------------
-- Read into the buffer as many bytes as possible and return in
-- `last` the position of the last byte read.
-- -----------------------
overriding
procedure Read (Stream : in out Encoder_Stream;
Into : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset) is
Start : Stream_Element_Offset := Into'First;
Pos : Stream_Element_Offset := Stream.Read_Pos;
Avail : Stream_Element_Offset;
Last_Decoded : Ada.Streams.Stream_Element_Offset;
Last_Pos : Ada.Streams.Stream_Element_Offset;
begin
while Start <= Into'Last loop
Avail := Stream.Write_Pos - Pos;
if Avail = 0 then
Stream.Fill;
Pos := Stream.Read_Pos;
Avail := Stream.Write_Pos - Pos;
if Avail <= 0 then
Last := Start - 1;
Stream.Transform.Finish
(Into => Into (Start .. Into'Last),
Last => Last);
return;
end if;
end if;
Stream.Transform.Transform
(Data => Stream.Buffer (Pos .. Pos + Avail - 1),
Into => Into (Start .. Into'Last),
Last => Last_Pos,
Encoded => Last_Decoded);
Stream.Read_Pos := Last_Decoded + 1;
Start := Last_Pos + 1;
exit when Stream.Read_Pos = Pos;
Pos := Stream.Read_Pos;
end loop;
Last := Start - 1;
end Read;
-- -----------------------
-- Flush the buffer by writing on the output stream.
-- Raises Data_Error if there is no output stream.
-- -----------------------
overriding
procedure Flush (Stream : in out Encoder_Stream) is
Last_Pos : Ada.Streams.Stream_Element_Offset := Stream.Write_Pos - 1;
begin
if not Stream.Flushed
and then Stream.Buffer /= null
and then Stream.Write_Pos >= Stream.Buffer'First
then
Stream.Transform.Finish (Stream.Buffer (Stream.Write_Pos .. Stream.Buffer'Last),
Last_Pos);
Stream.Write_Pos := Last_Pos + 1;
if not Stream.No_Flush then
if Stream.Write_Pos > 1 then
if Stream.Output /= null then
Stream.Output.Write (Stream.Buffer (1 .. Stream.Write_Pos - 1));
end if;
Stream.Write_Pos := 1;
end if;
if Stream.Output /= null then
Stream.Output.Flush;
end if;
end if;
Stream.Flushed := True;
end if;
end Flush;
overriding
procedure Finalize (Stream : in out Encoder_Stream) is
begin
if not Stream.Flushed and then Stream.Buffer /= null then
Stream.Flush;
end if;
Buffer_Stream (Stream).Finalize;
end Finalize;
end Util.Streams.Buffered.Encoders;
|
peterfrankjohnson/kernel | Ada | 1,378 | ads | with Types; use Types;
with System; use System;
with CPU.MMU.Paging; use CPU.MMU.Paging;
with System.Unsigned_Types; use System.Unsigned_Types;
package Memory is
-- A single 4kb page is represented in the Bitmap matrix as 1 bit
-- Page -> 1 bit
-- There is a 4GB address space which means we have 1024 x 1024 x 4kb
type PageBitmap is array (Integer range 1 .. (1024 * 1024)) of Boolean;
pragma Pack (PageBitmap);
for PageBitmap'Size use 16#1000_00#;
PhysicalPageBitmap : PageBitmap;
type PageType is
(Raw, PageDirectory, PageTable);
type A is array (Integer range 1 .. 1024) of Double;
type B is array (Integer range 1 .. 1024) of PageTableEntry;
type Page (Page_Type : PageType := Raw) is
record
case Page_Type is
when Raw =>
Memory : A;
when PageDirectory =>
PageDirectory : PageDirectoryT;
when PageTable =>
PageEntry : B;
end case;
end record;
pragma Unchecked_Union (Page);
Memory : array (Integer range 1 .. (1024 * 1024)) of aliased Page;
for Memory'Address use System'To_Address (16#00000000#);
pragma Import (Ada, Memory);
function Allocate (Pages : Integer) return access Page;
procedure Reserve (Address : Double; Length : Double);
pragma Export (C, Allocate, "__gnat_malloc");
end Memory;
|
io7m/coreland-openal-ada | Ada | 1,406 | adb | with Interfaces.C;
with OpenAL.List;
with Ada.Containers;
with System;
with Test;
procedure list_001 is
package List renames OpenAL.List;
package C renames Interfaces.C;
function list_001c_element (Element : C.unsigned) return System.Address;
pragma Import (C, list_001c_element, "list_001c_element");
A : System.Address;
V : List.String_Vector_t;
TC : Test.Context_t;
use type Ada.Containers.Count_Type;
begin
Test.Initialize
(Test_Context => TC,
Program => "list_001",
Test_DB => "TEST_DB",
Test_Results => "TEST_RESULTS");
V := List.String_Vectors.Empty_Vector;
A := list_001c_element (0);
List.Address_To_Vector (A, V);
Test.Check (TC, 23, List.String_Vectors.Length (V) = 0, "List.String_Vectors.Length (V) = 0");
V := List.String_Vectors.Empty_Vector;
A := list_001c_element (1);
List.Address_To_Vector (A, V);
Test.Check (TC, 24, List.String_Vectors.Length (V) = 1, "List.String_Vectors.Length (V) = 1");
V := List.String_Vectors.Empty_Vector;
A := list_001c_element (2);
List.Address_To_Vector (A, V);
Test.Check (TC, 25, List.String_Vectors.Length (V) = 2, "List.String_Vectors.Length (V) = 2");
V := List.String_Vectors.Empty_Vector;
A := list_001c_element (3);
List.Address_To_Vector (A, V);
Test.Check (TC, 26, List.String_Vectors.Length (V) = 3, "List.String_Vectors.Length (V) = 3");
end list_001;
|
reznikmm/matreshka | Ada | 4,899 | ads | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <[email protected]> --
-- 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$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Generic_Collections;
package AMF.CMOF.Comments.Collections is
pragma Preelaborate;
package CMOF_Comment_Collections is
new AMF.Generic_Collections
(CMOF_Comment,
CMOF_Comment_Access);
type Set_Of_CMOF_Comment is
new CMOF_Comment_Collections.Set with null record;
Empty_Set_Of_CMOF_Comment : constant Set_Of_CMOF_Comment;
type Ordered_Set_Of_CMOF_Comment is
new CMOF_Comment_Collections.Ordered_Set with null record;
Empty_Ordered_Set_Of_CMOF_Comment : constant Ordered_Set_Of_CMOF_Comment;
type Bag_Of_CMOF_Comment is
new CMOF_Comment_Collections.Bag with null record;
Empty_Bag_Of_CMOF_Comment : constant Bag_Of_CMOF_Comment;
type Sequence_Of_CMOF_Comment is
new CMOF_Comment_Collections.Sequence with null record;
Empty_Sequence_Of_CMOF_Comment : constant Sequence_Of_CMOF_Comment;
private
Empty_Set_Of_CMOF_Comment : constant Set_Of_CMOF_Comment
:= (CMOF_Comment_Collections.Set with null record);
Empty_Ordered_Set_Of_CMOF_Comment : constant Ordered_Set_Of_CMOF_Comment
:= (CMOF_Comment_Collections.Ordered_Set with null record);
Empty_Bag_Of_CMOF_Comment : constant Bag_Of_CMOF_Comment
:= (CMOF_Comment_Collections.Bag with null record);
Empty_Sequence_Of_CMOF_Comment : constant Sequence_Of_CMOF_Comment
:= (CMOF_Comment_Collections.Sequence with null record);
end AMF.CMOF.Comments.Collections;
|
sungyeon/drake | Ada | 2,150 | adb | -- for ZCX
pragma Check_Policy (Trace => Ignore);
with C.unwind;
separate (System.Unwind.Backtrace)
package body Separated is
pragma Suppress (All_Checks);
type Data is record
Item : not null access Tracebacks_Array;
Last : Natural;
Exclude_Min : Address;
Exclude_Max : Address;
end record;
pragma Suppress_Initialization (Data);
function Unwind_Trace (
Context : access C.unwind.struct_Unwind_Context;
Argument : C.void_ptr)
return C.unwind.Unwind_Reason_Code
with Convention => C;
function Unwind_Trace (
Context : access C.unwind.struct_Unwind_Context;
Argument : C.void_ptr)
return C.unwind.Unwind_Reason_Code
is
pragma Check (Trace, Ada.Debug.Put ("enter"));
D : Data;
for D'Address use Address (Argument);
IP : constant Address :=
System'To_Address (C.unwind.Unwind_GetIP (Context));
begin
if IP >= D.Exclude_Min and then IP <= D.Exclude_Max then
D.Last := Tracebacks_Array'First - 1; -- reset
pragma Check (Trace, Ada.Debug.Put ("exclude"));
else
D.Last := D.Last + 1;
D.Item (D.Last) := IP;
pragma Check (Trace, Ada.Debug.Put ("fill"));
if D.Last >= Tracebacks_Array'Last then
pragma Check (Trace, Ada.Debug.Put ("leave, over"));
return C.unwind.URC_NORMAL_STOP;
end if;
end if;
pragma Check (Trace, Ada.Debug.Put ("leave"));
return C.unwind.URC_NO_REASON;
end Unwind_Trace;
procedure Backtrace (
Item : aliased out Tracebacks_Array;
Last : out Natural;
Exclude_Min : Address;
Exclude_Max : Address)
is
D : aliased Data := (
Item'Unchecked_Access,
Tracebacks_Array'First - 1,
Exclude_Min,
Exclude_Max);
Dummy : C.unwind.Unwind_Reason_Code;
begin
pragma Check (Trace, Ada.Debug.Put ("start"));
Dummy := C.unwind.Unwind_Backtrace (
Unwind_Trace'Access,
C.void_ptr (D'Address));
pragma Check (Trace, Ada.Debug.Put ("end"));
Last := D.Last;
end Backtrace;
end Separated;
|
ekoeppen/STM32_Generic_Ada_Drivers | Ada | 9,654 | ads | -- This spec has been automatically generated from STM32F072x.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with System;
package STM32_SVD.EXTI is
pragma Preelaborate;
---------------
-- Registers --
---------------
-- IMR_MR array element
subtype IMR_MR_Element is STM32_SVD.Bit;
-- IMR_MR array
type IMR_MR_Field_Array is array (0 .. 27) of IMR_MR_Element
with Component_Size => 1, Size => 28;
-- Type definition for IMR_MR
type IMR_MR_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- MR as a value
Val : STM32_SVD.UInt28;
when True =>
-- MR as an array
Arr : IMR_MR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 28;
for IMR_MR_Field use record
Val at 0 range 0 .. 27;
Arr at 0 range 0 .. 27;
end record;
-- Interrupt mask register (EXTI_IMR)
type IMR_Register is record
-- Interrupt Mask on line 0
MR : IMR_MR_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_28_31 : STM32_SVD.UInt4 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IMR_Register use record
MR at 0 range 0 .. 27;
Reserved_28_31 at 0 range 28 .. 31;
end record;
-- EMR_MR array element
subtype EMR_MR_Element is STM32_SVD.Bit;
-- EMR_MR array
type EMR_MR_Field_Array is array (0 .. 27) of EMR_MR_Element
with Component_Size => 1, Size => 28;
-- Type definition for EMR_MR
type EMR_MR_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- MR as a value
Val : STM32_SVD.UInt28;
when True =>
-- MR as an array
Arr : EMR_MR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 28;
for EMR_MR_Field use record
Val at 0 range 0 .. 27;
Arr at 0 range 0 .. 27;
end record;
-- Event mask register (EXTI_EMR)
type EMR_Register is record
-- Event Mask on line 0
MR : EMR_MR_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_28_31 : STM32_SVD.UInt4 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EMR_Register use record
MR at 0 range 0 .. 27;
Reserved_28_31 at 0 range 28 .. 31;
end record;
-- RTSR_TR array element
subtype RTSR_TR_Element is STM32_SVD.Bit;
-- RTSR_TR array
type RTSR_TR_Field_Array is array (0 .. 17) of RTSR_TR_Element
with Component_Size => 1, Size => 18;
-- Type definition for RTSR_TR
type RTSR_TR_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- TR as a value
Val : STM32_SVD.UInt18;
when True =>
-- TR as an array
Arr : RTSR_TR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 18;
for RTSR_TR_Field use record
Val at 0 range 0 .. 17;
Arr at 0 range 0 .. 17;
end record;
subtype RTSR_TR19_Field is STM32_SVD.Bit;
-- Rising Trigger selection register (EXTI_RTSR)
type RTSR_Register is record
-- Rising trigger event configuration of line 0
TR : RTSR_TR_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_18_18 : STM32_SVD.Bit := 16#0#;
-- Rising trigger event configuration of line 19
TR19 : RTSR_TR19_Field := 16#0#;
-- unspecified
Reserved_20_31 : STM32_SVD.UInt12 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for RTSR_Register use record
TR at 0 range 0 .. 17;
Reserved_18_18 at 0 range 18 .. 18;
TR19 at 0 range 19 .. 19;
Reserved_20_31 at 0 range 20 .. 31;
end record;
-- FTSR_TR array element
subtype FTSR_TR_Element is STM32_SVD.Bit;
-- FTSR_TR array
type FTSR_TR_Field_Array is array (0 .. 17) of FTSR_TR_Element
with Component_Size => 1, Size => 18;
-- Type definition for FTSR_TR
type FTSR_TR_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- TR as a value
Val : STM32_SVD.UInt18;
when True =>
-- TR as an array
Arr : FTSR_TR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 18;
for FTSR_TR_Field use record
Val at 0 range 0 .. 17;
Arr at 0 range 0 .. 17;
end record;
subtype FTSR_TR19_Field is STM32_SVD.Bit;
-- Falling Trigger selection register (EXTI_FTSR)
type FTSR_Register is record
-- Falling trigger event configuration of line 0
TR : FTSR_TR_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_18_18 : STM32_SVD.Bit := 16#0#;
-- Falling trigger event configuration of line 19
TR19 : FTSR_TR19_Field := 16#0#;
-- unspecified
Reserved_20_31 : STM32_SVD.UInt12 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for FTSR_Register use record
TR at 0 range 0 .. 17;
Reserved_18_18 at 0 range 18 .. 18;
TR19 at 0 range 19 .. 19;
Reserved_20_31 at 0 range 20 .. 31;
end record;
-- SWIER array element
subtype SWIER_Element is STM32_SVD.Bit;
-- SWIER array
type SWIER_Field_Array is array (0 .. 17) of SWIER_Element
with Component_Size => 1, Size => 18;
-- Type definition for SWIER
type SWIER_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- SWIER as a value
Val : STM32_SVD.UInt18;
when True =>
-- SWIER as an array
Arr : SWIER_Field_Array;
end case;
end record
with Unchecked_Union, Size => 18;
for SWIER_Field use record
Val at 0 range 0 .. 17;
Arr at 0 range 0 .. 17;
end record;
subtype SWIER_SWIER19_Field is STM32_SVD.Bit;
-- Software interrupt event register (EXTI_SWIER)
type SWIER_Register is record
-- Software Interrupt on line 0
SWIER : SWIER_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_18_18 : STM32_SVD.Bit := 16#0#;
-- Software Interrupt on line 19
SWIER19 : SWIER_SWIER19_Field := 16#0#;
-- unspecified
Reserved_20_31 : STM32_SVD.UInt12 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SWIER_Register use record
SWIER at 0 range 0 .. 17;
Reserved_18_18 at 0 range 18 .. 18;
SWIER19 at 0 range 19 .. 19;
Reserved_20_31 at 0 range 20 .. 31;
end record;
-- PR array element
subtype PR_Element is STM32_SVD.Bit;
-- PR array
type PR_Field_Array is array (0 .. 17) of PR_Element
with Component_Size => 1, Size => 18;
-- Type definition for PR
type PR_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- PR as a value
Val : STM32_SVD.UInt18;
when True =>
-- PR as an array
Arr : PR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 18;
for PR_Field use record
Val at 0 range 0 .. 17;
Arr at 0 range 0 .. 17;
end record;
subtype PR_PR19_Field is STM32_SVD.Bit;
-- Pending register (EXTI_PR)
type PR_Register is record
-- Pending bit 0
PR : PR_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_18_18 : STM32_SVD.Bit := 16#0#;
-- Pending bit 19
PR19 : PR_PR19_Field := 16#0#;
-- unspecified
Reserved_20_31 : STM32_SVD.UInt12 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for PR_Register use record
PR at 0 range 0 .. 17;
Reserved_18_18 at 0 range 18 .. 18;
PR19 at 0 range 19 .. 19;
Reserved_20_31 at 0 range 20 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- External interrupt/event controller
type EXTI_Peripheral is record
-- Interrupt mask register (EXTI_IMR)
IMR : aliased IMR_Register;
-- Event mask register (EXTI_EMR)
EMR : aliased EMR_Register;
-- Rising Trigger selection register (EXTI_RTSR)
RTSR : aliased RTSR_Register;
-- Falling Trigger selection register (EXTI_FTSR)
FTSR : aliased FTSR_Register;
-- Software interrupt event register (EXTI_SWIER)
SWIER : aliased SWIER_Register;
-- Pending register (EXTI_PR)
PR : aliased PR_Register;
end record
with Volatile;
for EXTI_Peripheral use record
IMR at 16#0# range 0 .. 31;
EMR at 16#4# range 0 .. 31;
RTSR at 16#8# range 0 .. 31;
FTSR at 16#C# range 0 .. 31;
SWIER at 16#10# range 0 .. 31;
PR at 16#14# range 0 .. 31;
end record;
-- External interrupt/event controller
EXTI_Periph : aliased EXTI_Peripheral
with Import, Address => System'To_Address (16#40010400#);
end STM32_SVD.EXTI;
|
reznikmm/matreshka | Ada | 4,673 | ads | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Open Document Toolkit --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2014, Vadim Godunko <[email protected]> --
-- 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 XML.DOM.Visitors;
with ODF.DOM.Draw_Plugin_Elements;
package Matreshka.ODF_Draw.Plugin_Elements is
type Draw_Plugin_Element_Node is
new Matreshka.ODF_Draw.Abstract_Draw_Element_Node
and ODF.DOM.Draw_Plugin_Elements.ODF_Draw_Plugin
with null record;
overriding function Create
(Parameters : not null access Matreshka.DOM_Elements.Element_L2_Parameters)
return Draw_Plugin_Element_Node;
overriding function Get_Local_Name
(Self : not null access constant Draw_Plugin_Element_Node)
return League.Strings.Universal_String;
overriding procedure Enter_Node
(Self : not null access Draw_Plugin_Element_Node;
Visitor : in out XML.DOM.Visitors.Abstract_Visitor'Class;
Control : in out XML.DOM.Visitors.Traverse_Control);
overriding procedure Leave_Node
(Self : not null access Draw_Plugin_Element_Node;
Visitor : in out XML.DOM.Visitors.Abstract_Visitor'Class;
Control : in out XML.DOM.Visitors.Traverse_Control);
overriding procedure Visit_Node
(Self : not null access Draw_Plugin_Element_Node;
Iterator : in out XML.DOM.Visitors.Abstract_Iterator'Class;
Visitor : in out XML.DOM.Visitors.Abstract_Visitor'Class;
Control : in out XML.DOM.Visitors.Traverse_Control);
end Matreshka.ODF_Draw.Plugin_Elements;
|
onox/orka | Ada | 2,721 | adb | -- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2022 onox <[email protected]>
--
-- 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 AUnit.Assertions;
with AUnit.Test_Caller;
with AUnit.Test_Fixtures;
with Orka.SIMD.AVX.Integers;
with Orka.SIMD.AVX2.Integers.Shift;
package body Test_SIMD_AVX2_Shift is
use Orka;
use Orka.SIMD.AVX.Integers;
use Orka.SIMD.AVX2.Integers.Shift;
use AUnit.Assertions;
type Test is new AUnit.Test_Fixtures.Test_Fixture with null record;
procedure Test_Shift_Left_Zeros (Object : in out Test) is
Values : constant m256i := (0, 1, 2, 4, 8, 2**8, 2**16, 2**30);
-- x86 is little endian, so 'left' element is on the right side
Expected : constant m256i := (0, 0, 1, 2, 4, 8, 2**8, 2**16);
Result : constant m256i := Shift_Elements_Left_Zeros (Values);
begin
for I in Result'Range loop
Assert (Expected (I) = Result (I), "Unexpected Integer at " & I'Image);
end loop;
end Test_Shift_Left_Zeros;
procedure Test_Shift_Right_Zeros (Object : in out Test) is
Values : constant m256i := (0, 1, 2, 4, 8, 2**8, 2**16, 2**30);
-- x86 is little endian, so 'left' element is on the right side
Expected : constant m256i := (1, 2, 4, 8, 2**8, 2**16, 2**30, 0);
Result : constant m256i := Shift_Elements_Right_Zeros (Values);
begin
for I in Result'Range loop
Assert (Expected (I) = Result (I), "Unexpected Integer at " & I'Image);
end loop;
end Test_Shift_Right_Zeros;
----------------------------------------------------------------------------
package Caller is new AUnit.Test_Caller (Test);
Test_Suite : aliased AUnit.Test_Suites.Test_Suite;
function Suite return AUnit.Test_Suites.Access_Test_Suite is
Name : constant String := "(SIMD - AVX2 - Integers - Shift) ";
begin
Test_Suite.Add_Test (Caller.Create
(Name & "Test function Shift_Elements_Left_Zeros", Test_Shift_Left_Zeros'Access));
Test_Suite.Add_Test (Caller.Create
(Name & "Test function Shift_Elements_Right_Zeros", Test_Shift_Right_Zeros'Access));
return Test_Suite'Access;
end Suite;
end Test_SIMD_AVX2_Shift;
|
reznikmm/matreshka | Ada | 3,618 | ads | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Web API Definition --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2016, Vadim Godunko <[email protected]> --
-- 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$
------------------------------------------------------------------------------
package WebAPI.WebGL.Uniform_Locations is
pragma Preelaborate;
type WebGL_Uniform_Location is limited interface;
type WebGL_Uniform_Location_Access is
access all WebGL_Uniform_Location'Class
with Storage_Size => 0;
end WebAPI.WebGL.Uniform_Locations;
|
AdaCore/langkit | Ada | 980 | adb | -- Check that predicates are evaluated in the same order as they appear in the
-- original relation tree.
with Langkit_Support.Adalog.Main_Support;
use Langkit_Support.Adalog.Main_Support;
procedure Main is
use T_Solver, Refs, Solver_Ifc;
function Is_Positive (Value : Integer) return Boolean
is (Value > 0);
function LT_100 (Value : Integer) return Boolean
is (100 / Value >= 1);
P_Is_Positive : constant Predicate_Type'Class :=
Predicate (Is_Positive'Access, "is_positive");
P_LT_100 : constant Predicate_Type'Class :=
Predicate (LT_100'Access, "lt-100");
X : constant Refs.Logic_Var := Create ("X");
-- P_Is_Positive should reject X = 0, and thus should avoid a crash in
-- P_LT_100. If predicates are re-ordered, the crash will happen.
R : constant Relation :=
R_All ((Domain (X, (-1, 0, 27, 100)),
Predicate (X, P_Is_Positive),
Predicate (X, P_LT_100)));
begin
Solve_All (R);
end Main;
|
Fabien-Chouteau/GESTE | Ada | 59,940 | ads | package GESTE_Fonts.FreeSans12pt7b is
Font : constant Bitmap_Font_Ref;
private
FreeSans12pt7bBitmaps : aliased constant Font_Bitmap := (
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#,
16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#, 16#00#,
16#01#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#,
16#60#, 16#00#, 16#01#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#18#,
16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#80#, 16#00#, 16#06#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#,
16#06#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#19#, 16#80#, 16#00#,
16#66#, 16#00#, 16#01#, 16#98#, 16#00#, 16#06#, 16#60#, 16#00#, 16#19#,
16#80#, 16#00#, 16#26#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#, 16#30#, 16#00#, 16#19#,
16#80#, 16#00#, 16#C6#, 16#00#, 16#03#, 16#18#, 16#00#, 16#7F#, 16#F8#,
16#01#, 16#FF#, 16#E0#, 16#00#, 16#C4#, 16#00#, 16#06#, 16#30#, 16#00#,
16#18#, 16#C0#, 16#03#, 16#FF#, 16#C0#, 16#0F#, 16#FF#, 16#00#, 16#06#,
16#60#, 16#00#, 16#31#, 16#80#, 16#00#, 16#C6#, 16#00#, 16#03#, 16#18#,
16#00#, 16#0C#, 16#60#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#20#, 16#00#, 16#03#, 16#E0#,
16#00#, 16#3F#, 16#E0#, 16#00#, 16#C9#, 16#80#, 16#06#, 16#23#, 16#00#,
16#18#, 16#8C#, 16#00#, 16#62#, 16#00#, 16#01#, 16#C8#, 16#00#, 16#03#,
16#F0#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#02#, 16#F0#, 16#00#, 16#08#,
16#C0#, 16#06#, 16#23#, 16#00#, 16#18#, 16#8C#, 16#00#, 16#62#, 16#30#,
16#01#, 16#C9#, 16#C0#, 16#03#, 16#FE#, 16#00#, 16#03#, 16#F0#, 16#00#,
16#02#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#1E#, 16#02#, 16#00#,
16#FC#, 16#18#, 16#06#, 16#38#, 16#40#, 16#10#, 16#63#, 16#00#, 16#41#,
16#88#, 16#01#, 16#8E#, 16#60#, 16#03#, 16#F3#, 16#00#, 16#07#, 16#88#,
16#00#, 16#00#, 16#61#, 16#C0#, 16#01#, 16#1F#, 16#C0#, 16#0C#, 16#63#,
16#00#, 16#23#, 16#06#, 16#01#, 16#8C#, 16#18#, 16#04#, 16#18#, 16#C0#,
16#30#, 16#7F#, 16#01#, 16#80#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#,
16#E0#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#71#, 16#80#, 16#01#, 16#86#,
16#00#, 16#06#, 16#18#, 16#00#, 16#0C#, 16#E0#, 16#00#, 16#3F#, 16#00#,
16#00#, 16#70#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#39#, 16#8C#, 16#00#,
16#C3#, 16#30#, 16#06#, 16#07#, 16#80#, 16#18#, 16#1E#, 16#00#, 16#70#,
16#38#, 16#00#, 16#E3#, 16#F0#, 16#03#, 16#FC#, 16#C0#, 16#03#, 16#E3#,
16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#70#, 16#00#,
16#01#, 16#C0#, 16#00#, 16#06#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#,
16#20#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#,
16#01#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#20#, 16#00#, 16#01#,
16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#C0#,
16#00#, 16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#,
16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#,
16#30#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#00#, 16#00#, 16#06#,
16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#20#, 16#00#, 16#00#, 16#C0#,
16#00#, 16#01#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#, 16#30#,
16#00#, 16#00#, 16#40#, 16#00#, 16#01#, 16#80#, 16#00#, 16#06#, 16#00#,
16#00#, 16#08#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#,
16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#,
16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#,
16#00#, 16#00#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#,
16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#80#,
16#00#, 16#02#, 16#00#, 16#00#, 16#6B#, 16#00#, 16#00#, 16#F8#, 16#00#,
16#01#, 16#C0#, 16#00#, 16#0D#, 16#80#, 16#00#, 16#22#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#,
16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#01#, 16#FF#, 16#E0#,
16#07#, 16#FF#, 16#80#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#,
16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#,
16#00#, 16#0E#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#, 16#00#,
16#01#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#01#, 16#F8#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#,
16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#,
16#00#, 16#00#, 16#04#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#80#,
16#00#, 16#02#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#40#, 16#00#,
16#01#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#,
16#80#, 16#00#, 16#02#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#40#,
16#00#, 16#01#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#20#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#1F#, 16#C0#,
16#00#, 16#E3#, 16#80#, 16#03#, 16#06#, 16#00#, 16#1C#, 16#0C#, 16#00#,
16#60#, 16#30#, 16#01#, 16#80#, 16#C0#, 16#06#, 16#03#, 16#00#, 16#18#,
16#0C#, 16#00#, 16#60#, 16#30#, 16#01#, 16#80#, 16#C0#, 16#06#, 16#03#,
16#00#, 16#1C#, 16#0C#, 16#00#, 16#30#, 16#60#, 16#00#, 16#E3#, 16#80#,
16#01#, 16#FC#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#40#, 16#00#, 16#03#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#03#,
16#F0#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#,
16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#,
16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#,
16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#3F#,
16#E0#, 16#00#, 16#E1#, 16#C0#, 16#07#, 16#03#, 16#00#, 16#18#, 16#0C#,
16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#07#, 16#00#,
16#00#, 16#38#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#3C#, 16#00#, 16#01#,
16#C0#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#30#, 16#00#, 16#01#, 16#80#,
16#00#, 16#07#, 16#FF#, 16#00#, 16#1F#, 16#FC#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#C3#, 16#80#,
16#07#, 16#07#, 16#00#, 16#18#, 16#1C#, 16#00#, 16#00#, 16#70#, 16#00#,
16#03#, 16#80#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#,
16#70#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#18#, 16#0C#,
16#00#, 16#60#, 16#30#, 16#01#, 16#C1#, 16#80#, 16#03#, 16#FE#, 16#00#,
16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#,
16#01#, 16#C0#, 16#00#, 16#07#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#01#,
16#B0#, 16#00#, 16#0C#, 16#C0#, 16#00#, 16#33#, 16#00#, 16#01#, 16#8C#,
16#00#, 16#0C#, 16#30#, 16#00#, 16#30#, 16#C0#, 16#01#, 16#83#, 16#00#,
16#07#, 16#FF#, 16#00#, 16#1F#, 16#FC#, 16#00#, 16#00#, 16#C0#, 16#00#,
16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#C0#,
16#00#, 16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#37#, 16#80#,
16#00#, 16#FF#, 16#80#, 16#07#, 16#0E#, 16#00#, 16#00#, 16#1C#, 16#00#,
16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#,
16#0C#, 16#00#, 16#60#, 16#70#, 16#01#, 16#C3#, 16#80#, 16#03#, 16#FC#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#,
16#00#, 16#1F#, 16#E0#, 16#00#, 16#E1#, 16#80#, 16#03#, 16#03#, 16#00#,
16#0C#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#9E#, 16#00#, 16#06#,
16#FE#, 16#00#, 16#1E#, 16#1C#, 16#00#, 16#70#, 16#30#, 16#01#, 16#80#,
16#C0#, 16#06#, 16#03#, 16#00#, 16#18#, 16#0C#, 16#00#, 16#30#, 16#30#,
16#00#, 16#E1#, 16#80#, 16#01#, 16#FE#, 16#00#, 16#03#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#1F#, 16#FC#, 16#00#, 16#7F#, 16#F0#, 16#00#,
16#00#, 16#C0#, 16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#,
16#C0#, 16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#C0#,
16#00#, 16#03#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#, 16#00#,
16#01#, 16#80#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#,
16#C0#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#,
16#E0#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#E3#, 16#80#, 16#03#, 16#07#,
16#00#, 16#1C#, 16#0C#, 16#00#, 16#30#, 16#70#, 16#00#, 16#E3#, 16#80#,
16#01#, 16#FC#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#38#, 16#60#, 16#01#,
16#80#, 16#C0#, 16#06#, 16#03#, 16#00#, 16#18#, 16#0C#, 16#00#, 16#60#,
16#30#, 16#00#, 16#C1#, 16#C0#, 16#03#, 16#FE#, 16#00#, 16#03#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#1F#, 16#C0#,
16#00#, 16#E3#, 16#80#, 16#07#, 16#07#, 16#00#, 16#18#, 16#0C#, 16#00#,
16#60#, 16#30#, 16#01#, 16#80#, 16#C0#, 16#07#, 16#07#, 16#00#, 16#0C#,
16#3C#, 16#00#, 16#3F#, 16#F0#, 16#00#, 16#3C#, 16#C0#, 16#00#, 16#03#,
16#00#, 16#00#, 16#1C#, 16#00#, 16#70#, 16#60#, 16#00#, 16#C3#, 16#80#,
16#03#, 16#FC#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#03#, 16#80#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#18#, 16#00#,
16#00#, 16#60#, 16#00#, 16#01#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#E0#, 16#00#, 16#0F#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#1E#,
16#00#, 16#01#, 16#E0#, 16#00#, 16#07#, 16#00#, 16#00#, 16#0F#, 16#80#,
16#00#, 16#07#, 16#80#, 16#00#, 16#07#, 16#80#, 16#00#, 16#07#, 16#80#,
16#00#, 16#02#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#1F#, 16#FE#, 16#00#, 16#7F#, 16#F8#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#1F#, 16#FE#, 16#00#, 16#7F#, 16#F8#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#01#, 16#C0#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#03#, 16#E0#, 16#00#,
16#03#, 16#E0#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#03#, 16#80#, 16#00#,
16#3C#, 16#00#, 16#07#, 16#80#, 16#00#, 16#78#, 16#00#, 16#07#, 16#80#,
16#00#, 16#10#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#07#, 16#F8#,
16#00#, 16#38#, 16#70#, 16#00#, 16#C0#, 16#C0#, 16#03#, 16#03#, 16#00#,
16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#01#, 16#80#, 16#00#,
16#0E#, 16#00#, 16#00#, 16#70#, 16#00#, 16#03#, 16#80#, 16#00#, 16#0C#,
16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#07#, 16#F0#, 16#00#, 16#7F#, 16#F0#, 16#07#, 16#81#, 16#F0#,
16#38#, 16#01#, 16#E1#, 16#C0#, 16#01#, 16#86#, 16#0F#, 16#07#, 16#30#,
16#7E#, 16#CC#, 16#C3#, 16#8E#, 16#36#, 16#1C#, 16#38#, 16#58#, 16#60#,
16#61#, 16#63#, 16#83#, 16#05#, 16#8E#, 16#0C#, 16#36#, 16#38#, 16#30#,
16#D8#, 16#E1#, 16#C7#, 16#71#, 16#CF#, 16#38#, 16#C7#, 16#EF#, 16#C3#,
16#8F#, 16#3E#, 16#07#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#0F#,
16#FE#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#66#,
16#00#, 16#01#, 16#98#, 16#00#, 16#0E#, 16#70#, 16#00#, 16#30#, 16#C0#,
16#00#, 16#C3#, 16#00#, 16#07#, 16#0E#, 16#00#, 16#18#, 16#18#, 16#00#,
16#7F#, 16#E0#, 16#03#, 16#FF#, 16#C0#, 16#0C#, 16#07#, 16#00#, 16#30#,
16#0C#, 16#01#, 16#C0#, 16#38#, 16#06#, 16#00#, 16#60#, 16#18#, 16#01#,
16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#03#, 16#FF#, 16#00#, 16#0F#, 16#FE#, 16#00#, 16#30#, 16#1C#,
16#00#, 16#C0#, 16#30#, 16#03#, 16#00#, 16#C0#, 16#0C#, 16#03#, 16#00#,
16#30#, 16#0C#, 16#00#, 16#C0#, 16#60#, 16#03#, 16#FF#, 16#00#, 16#0F#,
16#FE#, 16#00#, 16#30#, 16#0C#, 16#00#, 16#C0#, 16#38#, 16#03#, 16#00#,
16#60#, 16#0C#, 16#01#, 16#80#, 16#30#, 16#0E#, 16#00#, 16#C0#, 16#70#,
16#03#, 16#FF#, 16#C0#, 16#0F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#,
16#03#, 16#FF#, 16#00#, 16#1C#, 16#1E#, 16#00#, 16#E0#, 16#18#, 16#03#,
16#00#, 16#70#, 16#1C#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#80#,
16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#, 16#00#,
16#01#, 16#80#, 16#00#, 16#07#, 16#00#, 16#30#, 16#0C#, 16#01#, 16#C0#,
16#38#, 16#06#, 16#00#, 16#70#, 16#78#, 16#00#, 16#FF#, 16#C0#, 16#00#,
16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#0F#, 16#FE#, 16#00#, 16#30#,
16#1C#, 16#00#, 16#C0#, 16#38#, 16#03#, 16#00#, 16#60#, 16#0C#, 16#01#,
16#80#, 16#30#, 16#07#, 16#00#, 16#C0#, 16#1C#, 16#03#, 16#00#, 16#30#,
16#0C#, 16#00#, 16#C0#, 16#30#, 16#07#, 16#00#, 16#C0#, 16#1C#, 16#03#,
16#00#, 16#60#, 16#0C#, 16#01#, 16#80#, 16#30#, 16#0E#, 16#00#, 16#C0#,
16#70#, 16#03#, 16#FF#, 16#80#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#,
16#C0#, 16#0F#, 16#FF#, 16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#,
16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#,
16#C0#, 16#00#, 16#03#, 16#FF#, 16#C0#, 16#0F#, 16#FF#, 16#00#, 16#30#,
16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#, 16#00#,
16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#FF#, 16#C0#,
16#0F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#C0#, 16#0F#, 16#FF#, 16#00#,
16#30#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#,
16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#FF#,
16#80#, 16#0F#, 16#FE#, 16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#,
16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#,
16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#3F#, 16#80#, 16#03#, 16#FF#, 16#80#, 16#1E#, 16#0F#, 16#00#, 16#E0#,
16#0C#, 16#03#, 16#00#, 16#38#, 16#1C#, 16#00#, 16#00#, 16#60#, 16#00#,
16#01#, 16#80#, 16#00#, 16#06#, 16#03#, 16#F8#, 16#18#, 16#0F#, 16#E0#,
16#60#, 16#01#, 16#81#, 16#C0#, 16#06#, 16#03#, 16#00#, 16#18#, 16#0E#,
16#00#, 16#E0#, 16#38#, 16#07#, 16#80#, 16#78#, 16#3E#, 16#00#, 16#FF#,
16#D8#, 16#00#, 16#FC#, 16#60#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#60#, 16#0C#, 16#01#,
16#80#, 16#30#, 16#06#, 16#00#, 16#C0#, 16#18#, 16#03#, 16#00#, 16#60#,
16#0C#, 16#01#, 16#80#, 16#30#, 16#06#, 16#00#, 16#C0#, 16#18#, 16#03#,
16#FF#, 16#E0#, 16#0F#, 16#FF#, 16#80#, 16#30#, 16#06#, 16#00#, 16#C0#,
16#18#, 16#03#, 16#00#, 16#60#, 16#0C#, 16#01#, 16#80#, 16#30#, 16#06#,
16#00#, 16#C0#, 16#18#, 16#03#, 16#00#, 16#60#, 16#0C#, 16#01#, 16#80#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#03#, 16#80#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#,
16#E0#, 16#00#, 16#03#, 16#80#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#38#,
16#00#, 16#00#, 16#E0#, 16#00#, 16#03#, 16#80#, 16#00#, 16#0E#, 16#00#,
16#00#, 16#38#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#03#, 16#80#, 16#00#,
16#0E#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#03#,
16#80#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#,
16#38#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#03#, 16#80#, 16#00#, 16#0E#,
16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#03#, 16#80#,
16#00#, 16#0E#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#E0#, 16#00#,
16#03#, 16#80#, 16#06#, 16#0E#, 16#00#, 16#18#, 16#38#, 16#00#, 16#60#,
16#E0#, 16#01#, 16#C7#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#07#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#03#, 16#00#, 16#E0#, 16#0C#, 16#07#, 16#00#, 16#30#, 16#38#,
16#00#, 16#C1#, 16#C0#, 16#03#, 16#06#, 16#00#, 16#0C#, 16#30#, 16#00#,
16#31#, 16#80#, 16#00#, 16#CE#, 16#00#, 16#03#, 16#78#, 16#00#, 16#0F#,
16#30#, 16#00#, 16#38#, 16#E0#, 16#00#, 16#C1#, 16#80#, 16#03#, 16#03#,
16#00#, 16#0C#, 16#0E#, 16#00#, 16#30#, 16#18#, 16#00#, 16#C0#, 16#30#,
16#03#, 16#00#, 16#E0#, 16#0C#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#,
16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#,
16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#C0#,
16#00#, 16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#,
16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#,
16#30#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#FF#, 16#80#, 16#0F#,
16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#03#, 16#80#, 16#1C#, 16#0F#, 16#00#, 16#70#, 16#3C#,
16#03#, 16#C0#, 16#F0#, 16#0F#, 16#03#, 16#60#, 16#3C#, 16#0D#, 16#81#,
16#B0#, 16#36#, 16#06#, 16#C0#, 16#CC#, 16#1B#, 16#03#, 16#30#, 16#4C#,
16#0C#, 16#C3#, 16#30#, 16#31#, 16#0C#, 16#C0#, 16#C6#, 16#23#, 16#03#,
16#19#, 16#8C#, 16#0C#, 16#26#, 16#30#, 16#30#, 16#D8#, 16#C0#, 16#C3#,
16#C3#, 16#03#, 16#0F#, 16#0C#, 16#0C#, 16#1C#, 16#30#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#,
16#70#, 16#0E#, 16#01#, 16#C0#, 16#3C#, 16#07#, 16#00#, 16#F8#, 16#1C#,
16#03#, 16#60#, 16#70#, 16#0D#, 16#C1#, 16#C0#, 16#33#, 16#07#, 16#00#,
16#C6#, 16#1C#, 16#03#, 16#1C#, 16#70#, 16#0C#, 16#31#, 16#C0#, 16#30#,
16#E7#, 16#00#, 16#C1#, 16#9C#, 16#03#, 16#03#, 16#70#, 16#0C#, 16#0F#,
16#C0#, 16#30#, 16#1F#, 16#00#, 16#C0#, 16#3C#, 16#03#, 16#00#, 16#F0#,
16#0C#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#03#, 16#FF#, 16#00#,
16#1E#, 16#0F#, 16#00#, 16#E0#, 16#1C#, 16#03#, 16#00#, 16#38#, 16#1C#,
16#00#, 16#60#, 16#70#, 16#01#, 16#C1#, 16#80#, 16#07#, 16#06#, 16#00#,
16#0C#, 16#18#, 16#00#, 16#30#, 16#60#, 16#00#, 16#C1#, 16#80#, 16#07#,
16#07#, 16#00#, 16#18#, 16#0C#, 16#00#, 16#E0#, 16#38#, 16#07#, 16#00#,
16#78#, 16#3C#, 16#00#, 16#FF#, 16#C0#, 16#00#, 16#FC#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#,
16#FF#, 16#00#, 16#0F#, 16#FE#, 16#00#, 16#30#, 16#1C#, 16#00#, 16#C0#,
16#30#, 16#03#, 16#00#, 16#E0#, 16#0C#, 16#03#, 16#80#, 16#30#, 16#0C#,
16#00#, 16#C0#, 16#70#, 16#03#, 16#FF#, 16#80#, 16#0F#, 16#FC#, 16#00#,
16#30#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#,
16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#,
16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#03#, 16#FF#,
16#00#, 16#1E#, 16#0F#, 16#00#, 16#E0#, 16#1C#, 16#03#, 16#00#, 16#38#,
16#1C#, 16#00#, 16#60#, 16#70#, 16#01#, 16#C1#, 16#80#, 16#03#, 16#06#,
16#00#, 16#0C#, 16#18#, 16#00#, 16#30#, 16#60#, 16#01#, 16#C1#, 16#80#,
16#07#, 16#07#, 16#00#, 16#18#, 16#0C#, 16#06#, 16#E0#, 16#38#, 16#1F#,
16#00#, 16#78#, 16#38#, 16#00#, 16#FF#, 16#F0#, 16#00#, 16#FC#, 16#60#,
16#00#, 16#00#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#03#, 16#FF#, 16#80#, 16#0F#, 16#FF#, 16#00#, 16#30#, 16#0E#, 16#00#,
16#C0#, 16#18#, 16#03#, 16#00#, 16#60#, 16#0C#, 16#01#, 16#80#, 16#30#,
16#06#, 16#00#, 16#C0#, 16#30#, 16#03#, 16#FF#, 16#80#, 16#0F#, 16#FF#,
16#00#, 16#30#, 16#0C#, 16#00#, 16#C0#, 16#38#, 16#03#, 16#00#, 16#60#,
16#0C#, 16#01#, 16#80#, 16#30#, 16#06#, 16#00#, 16#C0#, 16#18#, 16#03#,
16#00#, 16#60#, 16#0C#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#07#,
16#FE#, 16#00#, 16#3C#, 16#3C#, 16#00#, 16#C0#, 16#30#, 16#03#, 16#00#,
16#C0#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#F0#, 16#00#,
16#01#, 16#FC#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#7C#, 16#00#,
16#00#, 16#38#, 16#06#, 16#00#, 16#60#, 16#1C#, 16#01#, 16#80#, 16#30#,
16#0E#, 16#00#, 16#E0#, 16#70#, 16#01#, 16#FF#, 16#80#, 16#01#, 16#F8#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#07#, 16#FF#, 16#C0#, 16#1F#, 16#FF#, 16#00#, 16#03#, 16#80#,
16#00#, 16#0E#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#E0#, 16#00#,
16#03#, 16#80#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#,
16#E0#, 16#00#, 16#03#, 16#80#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#38#,
16#00#, 16#00#, 16#E0#, 16#00#, 16#03#, 16#80#, 16#00#, 16#0E#, 16#00#,
16#00#, 16#38#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#60#,
16#0C#, 16#01#, 16#80#, 16#30#, 16#06#, 16#00#, 16#C0#, 16#18#, 16#03#,
16#00#, 16#60#, 16#0C#, 16#01#, 16#80#, 16#30#, 16#06#, 16#00#, 16#C0#,
16#18#, 16#03#, 16#00#, 16#60#, 16#0C#, 16#01#, 16#80#, 16#30#, 16#06#,
16#00#, 16#C0#, 16#18#, 16#03#, 16#00#, 16#60#, 16#0C#, 16#01#, 16#80#,
16#38#, 16#0E#, 16#00#, 16#70#, 16#70#, 16#00#, 16#FF#, 16#80#, 16#00#,
16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#06#, 16#00#, 16#60#, 16#18#, 16#03#, 16#80#, 16#70#,
16#0C#, 16#00#, 16#C0#, 16#30#, 16#03#, 16#01#, 16#C0#, 16#0E#, 16#06#,
16#00#, 16#18#, 16#18#, 16#00#, 16#60#, 16#E0#, 16#01#, 16#C3#, 16#00#,
16#03#, 16#0C#, 16#00#, 16#0C#, 16#70#, 16#00#, 16#39#, 16#80#, 16#00#,
16#66#, 16#00#, 16#01#, 16#B8#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#0F#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#03#,
16#81#, 16#D8#, 16#0E#, 16#07#, 16#60#, 16#78#, 16#1D#, 16#C1#, 16#E0#,
16#67#, 16#07#, 16#C1#, 16#8C#, 16#1B#, 16#0E#, 16#30#, 16#CC#, 16#38#,
16#E3#, 16#30#, 16#C3#, 16#8C#, 16#63#, 16#06#, 16#71#, 16#8C#, 16#19#,
16#86#, 16#70#, 16#66#, 16#1D#, 16#81#, 16#D8#, 16#36#, 16#03#, 16#E0#,
16#D8#, 16#0F#, 16#03#, 16#E0#, 16#3C#, 16#07#, 16#00#, 16#F0#, 16#1C#,
16#01#, 16#80#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#E0#, 16#0C#, 16#07#, 16#00#,
16#38#, 16#18#, 16#00#, 16#70#, 16#E0#, 16#00#, 16#C3#, 16#00#, 16#03#,
16#98#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#38#,
16#00#, 16#00#, 16#F0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#19#, 16#80#,
16#00#, 16#E7#, 16#00#, 16#07#, 16#0C#, 16#00#, 16#18#, 16#38#, 16#00#,
16#E0#, 16#70#, 16#07#, 16#00#, 16#C0#, 16#18#, 16#03#, 16#80#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#,
16#00#, 16#70#, 16#1C#, 16#03#, 16#80#, 16#38#, 16#0C#, 16#00#, 16#60#,
16#70#, 16#01#, 16#C1#, 16#80#, 16#03#, 16#0E#, 16#00#, 16#0E#, 16#30#,
16#00#, 16#1D#, 16#80#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#F0#, 16#00#,
16#01#, 16#C0#, 16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#,
16#60#, 16#00#, 16#01#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#18#,
16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#C0#, 16#1F#, 16#FF#,
16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#07#, 16#00#,
16#00#, 16#18#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#07#, 16#00#, 16#00#,
16#38#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#07#, 16#00#, 16#00#, 16#38#,
16#00#, 16#01#, 16#C0#, 16#00#, 16#06#, 16#00#, 16#00#, 16#38#, 16#00#,
16#01#, 16#C0#, 16#00#, 16#07#, 16#FF#, 16#C0#, 16#1F#, 16#FF#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#,
16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#,
16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#, 16#00#,
16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#,
16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#,
16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#C0#,
16#00#, 16#03#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#, 16#30#,
16#00#, 16#00#, 16#40#, 16#00#, 16#01#, 16#00#, 16#00#, 16#06#, 16#00#,
16#00#, 16#08#, 16#00#, 16#00#, 16#20#, 16#00#, 16#00#, 16#80#, 16#00#,
16#03#, 16#00#, 16#00#, 16#04#, 16#00#, 16#00#, 16#10#, 16#00#, 16#00#,
16#60#, 16#00#, 16#00#, 16#80#, 16#00#, 16#02#, 16#00#, 16#00#, 16#0C#,
16#00#, 16#00#, 16#10#, 16#00#, 16#00#, 16#40#, 16#00#, 16#01#, 16#80#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#07#, 16#80#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#18#, 16#00#,
16#00#, 16#60#, 16#00#, 16#01#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#,
16#18#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#80#, 16#00#, 16#06#,
16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#80#,
16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#, 16#00#,
16#01#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#,
16#60#, 16#00#, 16#01#, 16#80#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#01#, 16#80#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#2C#, 16#00#, 16#01#,
16#B0#, 16#00#, 16#06#, 16#40#, 16#00#, 16#11#, 16#80#, 16#00#, 16#C6#,
16#00#, 16#02#, 16#0C#, 16#00#, 16#18#, 16#30#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#,
16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#20#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#,
16#E0#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#C3#, 16#80#, 16#06#, 16#06#,
16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#7F#, 16#80#,
16#07#, 16#C6#, 16#00#, 16#18#, 16#18#, 16#00#, 16#60#, 16#60#, 16#01#,
16#87#, 16#80#, 16#07#, 16#F7#, 16#80#, 16#07#, 16#8E#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#,
16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#80#,
16#00#, 16#06#, 16#00#, 16#00#, 16#19#, 16#F0#, 16#00#, 16#6F#, 16#E0#,
16#01#, 16#E1#, 16#C0#, 16#07#, 16#03#, 16#00#, 16#1C#, 16#0E#, 16#00#,
16#70#, 16#18#, 16#01#, 16#80#, 16#60#, 16#06#, 16#01#, 16#80#, 16#1C#,
16#0C#, 16#00#, 16#70#, 16#30#, 16#01#, 16#E1#, 16#C0#, 16#06#, 16#FE#,
16#00#, 16#19#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#03#, 16#E0#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#E3#, 16#80#, 16#07#,
16#06#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#80#,
16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#, 16#60#,
16#00#, 16#C3#, 16#80#, 16#03#, 16#FC#, 16#00#, 16#03#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#,
16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#03#, 16#CC#, 16#00#, 16#3F#,
16#F0#, 16#00#, 16#E3#, 16#C0#, 16#07#, 16#07#, 16#00#, 16#18#, 16#0C#,
16#00#, 16#60#, 16#30#, 16#01#, 16#80#, 16#C0#, 16#06#, 16#03#, 16#00#,
16#18#, 16#0C#, 16#00#, 16#70#, 16#70#, 16#00#, 16#E3#, 16#C0#, 16#03#,
16#FF#, 16#00#, 16#03#, 16#CC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#C3#, 16#80#,
16#06#, 16#07#, 16#00#, 16#18#, 16#0C#, 16#00#, 16#7F#, 16#F0#, 16#01#,
16#FF#, 16#C0#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#,
16#30#, 16#00#, 16#E1#, 16#80#, 16#01#, 16#FE#, 16#00#, 16#03#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#01#, 16#C0#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#30#, 16#00#,
16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#,
16#FC#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#,
16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#,
16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#,
16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#03#, 16#CC#, 16#00#, 16#3F#, 16#B0#, 16#00#, 16#E3#,
16#C0#, 16#07#, 16#07#, 16#00#, 16#18#, 16#1C#, 16#00#, 16#60#, 16#30#,
16#01#, 16#80#, 16#C0#, 16#06#, 16#03#, 16#00#, 16#18#, 16#1C#, 16#00#,
16#70#, 16#70#, 16#00#, 16#E3#, 16#C0#, 16#03#, 16#FB#, 16#00#, 16#03#,
16#CC#, 16#00#, 16#00#, 16#70#, 16#00#, 16#01#, 16#80#, 16#07#, 16#0E#,
16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#,
16#00#, 16#01#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#19#, 16#F0#,
16#00#, 16#6F#, 16#E0#, 16#01#, 16#E3#, 16#80#, 16#07#, 16#06#, 16#00#,
16#1C#, 16#18#, 16#00#, 16#60#, 16#60#, 16#01#, 16#81#, 16#80#, 16#06#,
16#06#, 16#00#, 16#18#, 16#18#, 16#00#, 16#60#, 16#60#, 16#01#, 16#81#,
16#80#, 16#06#, 16#06#, 16#00#, 16#18#, 16#18#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#,
16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#,
16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#,
16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#, 16#00#,
16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#,
16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0C#,
16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#,
16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#,
16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#,
16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#,
16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#3C#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#,
16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#80#,
16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#38#, 16#00#, 16#61#, 16#C0#,
16#01#, 16#8E#, 16#00#, 16#06#, 16#70#, 16#00#, 16#1B#, 16#80#, 16#00#,
16#7F#, 16#00#, 16#01#, 16#EC#, 16#00#, 16#07#, 16#38#, 16#00#, 16#18#,
16#60#, 16#00#, 16#60#, 16#C0#, 16#01#, 16#83#, 16#80#, 16#06#, 16#06#,
16#00#, 16#18#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#,
16#00#, 16#60#, 16#00#, 16#01#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#,
16#18#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#80#, 16#00#, 16#06#,
16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#80#,
16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#, 16#00#,
16#01#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#19#, 16#E3#, 16#E0#, 16#6F#,
16#DF#, 16#C1#, 16#E3#, 16#C7#, 16#07#, 16#06#, 16#0C#, 16#1C#, 16#18#,
16#30#, 16#60#, 16#60#, 16#C1#, 16#81#, 16#83#, 16#06#, 16#06#, 16#0C#,
16#18#, 16#18#, 16#30#, 16#60#, 16#60#, 16#C1#, 16#81#, 16#83#, 16#06#,
16#06#, 16#0C#, 16#18#, 16#18#, 16#30#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#19#, 16#F0#, 16#00#, 16#6F#, 16#E0#, 16#01#, 16#E1#, 16#80#,
16#07#, 16#06#, 16#00#, 16#1C#, 16#18#, 16#00#, 16#60#, 16#60#, 16#01#,
16#81#, 16#80#, 16#06#, 16#06#, 16#00#, 16#18#, 16#18#, 16#00#, 16#60#,
16#60#, 16#01#, 16#81#, 16#80#, 16#06#, 16#06#, 16#00#, 16#18#, 16#18#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#,
16#1F#, 16#C0#, 16#00#, 16#E3#, 16#80#, 16#07#, 16#07#, 16#00#, 16#18#,
16#0C#, 16#00#, 16#60#, 16#30#, 16#01#, 16#80#, 16#C0#, 16#06#, 16#03#,
16#00#, 16#18#, 16#0C#, 16#00#, 16#70#, 16#70#, 16#00#, 16#E3#, 16#80#,
16#03#, 16#FC#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#19#, 16#F0#, 16#00#, 16#6F#, 16#E0#, 16#01#, 16#E1#,
16#C0#, 16#07#, 16#03#, 16#00#, 16#1C#, 16#0C#, 16#00#, 16#70#, 16#18#,
16#01#, 16#80#, 16#60#, 16#07#, 16#01#, 16#80#, 16#1C#, 16#0E#, 16#00#,
16#70#, 16#30#, 16#01#, 16#E1#, 16#C0#, 16#06#, 16#FE#, 16#00#, 16#19#,
16#F0#, 16#00#, 16#60#, 16#00#, 16#01#, 16#80#, 16#00#, 16#06#, 16#00#,
16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#CC#,
16#00#, 16#3F#, 16#F0#, 16#00#, 16#E3#, 16#C0#, 16#07#, 16#07#, 16#00#,
16#18#, 16#0C#, 16#00#, 16#60#, 16#30#, 16#01#, 16#80#, 16#C0#, 16#06#,
16#03#, 16#00#, 16#18#, 16#0C#, 16#00#, 16#70#, 16#70#, 16#00#, 16#E3#,
16#C0#, 16#03#, 16#FF#, 16#00#, 16#03#, 16#CC#, 16#00#, 16#00#, 16#30#,
16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#19#, 16#80#, 16#00#, 16#6E#, 16#00#, 16#01#,
16#E0#, 16#00#, 16#07#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#60#,
16#00#, 16#01#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#,
16#00#, 16#60#, 16#00#, 16#01#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#,
16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#,
16#E0#, 16#00#, 16#3F#, 16#C0#, 16#01#, 16#C3#, 16#00#, 16#06#, 16#00#,
16#00#, 16#18#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#FE#, 16#00#,
16#00#, 16#7E#, 16#00#, 16#00#, 16#38#, 16#00#, 16#60#, 16#60#, 16#01#,
16#C3#, 16#80#, 16#03#, 16#FC#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#C0#,
16#00#, 16#03#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#FC#, 16#00#,
16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#,
16#30#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#,
16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#C0#,
16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#18#, 16#18#, 16#00#, 16#60#, 16#60#, 16#01#, 16#81#, 16#80#, 16#06#,
16#06#, 16#00#, 16#18#, 16#18#, 16#00#, 16#60#, 16#60#, 16#01#, 16#81#,
16#80#, 16#06#, 16#06#, 16#00#, 16#18#, 16#18#, 16#00#, 16#70#, 16#60#,
16#00#, 16#C3#, 16#80#, 16#03#, 16#FA#, 16#00#, 16#07#, 16#C8#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#18#, 16#00#, 16#60#,
16#60#, 16#01#, 16#81#, 16#80#, 16#07#, 16#0C#, 16#00#, 16#0C#, 16#30#,
16#00#, 16#30#, 16#C0#, 16#00#, 16#E6#, 16#00#, 16#01#, 16#98#, 16#00#,
16#06#, 16#60#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#,
16#E0#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#38#, 16#70#, 16#60#, 16#61#, 16#C3#, 16#81#, 16#87#, 16#0C#,
16#06#, 16#16#, 16#30#, 16#1C#, 16#D8#, 16#C0#, 16#33#, 16#67#, 16#00#,
16#CD#, 16#98#, 16#03#, 16#33#, 16#60#, 16#07#, 16#8D#, 16#80#, 16#1E#,
16#34#, 16#00#, 16#78#, 16#F0#, 16#01#, 16#E1#, 16#C0#, 16#03#, 16#07#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#18#, 16#38#, 16#00#,
16#70#, 16#C0#, 16#00#, 16#C6#, 16#00#, 16#01#, 16#98#, 16#00#, 16#07#,
16#C0#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#F0#,
16#00#, 16#06#, 16#C0#, 16#00#, 16#19#, 16#80#, 16#00#, 16#C7#, 16#00#,
16#06#, 16#0C#, 16#00#, 16#18#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#38#, 16#18#, 16#00#, 16#60#, 16#60#, 16#01#, 16#83#,
16#00#, 16#06#, 16#0C#, 16#00#, 16#0C#, 16#30#, 16#00#, 16#31#, 16#80#,
16#00#, 16#C6#, 16#00#, 16#01#, 16#B8#, 16#00#, 16#06#, 16#C0#, 16#00#,
16#1B#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#03#,
16#80#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#01#, 16#C0#,
16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F8#,
16#00#, 16#7F#, 16#E0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#18#, 16#00#,
16#00#, 16#E0#, 16#00#, 16#07#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#,
16#C0#, 16#00#, 16#06#, 16#00#, 16#00#, 16#30#, 16#00#, 16#01#, 16#C0#,
16#00#, 16#07#, 16#FE#, 16#00#, 16#1F#, 16#F8#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#,
16#00#, 16#07#, 16#80#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#, 16#00#,
16#01#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#,
16#60#, 16#00#, 16#01#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#30#,
16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#,
16#00#, 16#18#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#80#, 16#00#,
16#06#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#,
16#80#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#,
16#30#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#,
16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#,
16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#,
16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#,
16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#,
16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#,
16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#,
16#00#, 16#01#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#,
16#00#, 16#60#, 16#00#, 16#01#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#,
16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#06#,
16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#80#,
16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#, 16#00#,
16#01#, 16#80#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#07#,
16#C0#, 16#00#, 16#13#, 16#88#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#07#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#);
Font_D : aliased constant Bitmap_Font :=
(
Bytes_Per_Glyph => 77,
Glyph_Width => 22,
Glyph_Height => 28,
Data => FreeSans12pt7bBitmaps'Access);
Font : constant Bitmap_Font_Ref := Font_D'Access;
end GESTE_Fonts.FreeSans12pt7b;
|
reznikmm/matreshka | Ada | 3,818 | ads | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Open Document Toolkit --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2013, Vadim Godunko <[email protected]> --
-- 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$
------------------------------------------------------------------------------
package Matreshka.ODF_Attributes.Text.Start_Numbering_At is
type Text_Start_Numbering_At_Node is
new Matreshka.ODF_Attributes.Text.Text_Node_Base with null record;
type Text_Start_Numbering_At_Access is
access all Text_Start_Numbering_At_Node'Class;
overriding function Get_Local_Name
(Self : not null access constant Text_Start_Numbering_At_Node)
return League.Strings.Universal_String;
end Matreshka.ODF_Attributes.Text.Start_Numbering_At;
|
zhmu/ananas | Ada | 3,591 | ads | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . N U M E R I C S . A U X --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2022, 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 is a backward-compatibility unit, for users of this internal
-- package before the introduction of Aux.Generic_Float.
with Ada.Numerics.Aux_Compat;
package Ada.Numerics.Aux is
pragma Pure;
package Aux renames Aux_Compat;
type Double is new Aux.T;
subtype T is Double;
subtype W is Aux.T;
-- Use the Aux implementation.
function Sin (X : T) return T
is (T (Aux.Sin (W (X))));
function Cos (X : T) return T
is (T (Aux.Cos (W (X))));
function Tan (X : T) return T
is (T (Aux.Tan (W (X))));
function Exp (X : T) return T
is (T (Aux.Exp (W (X))));
function Sqrt (X : T) return T
is (T (Aux.Sqrt (W (X))));
function Log (X : T) return T
is (T (Aux.Log (W (X))));
function Acos (X : T) return T
is (T (Aux.Acos (W (X))));
function Asin (X : T) return T
is (T (Aux.Asin (W (X))));
function Atan (X : T) return T
is (T (Aux.Atan (W (X))));
function Sinh (X : T) return T
is (T (Aux.Sinh (W (X))));
function Cosh (X : T) return T
is (T (Aux.Cosh (W (X))));
function Tanh (X : T) return T
is (T (Aux.Tanh (W (X))));
function Pow (X, Y : T) return T
is (T (Aux.Pow (W (X), W (Y))));
end Ada.Numerics.Aux;
|
vikasbidhuri1995/DW1000 | Ada | 6,096 | ads | -- This spec has been automatically generated from STM32F105xx.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
with System;
package STM32.NVIC is
pragma Preelaborate;
---------------
-- Registers --
---------------
-------------------
-- ICTR_Register --
-------------------
subtype ICTR_INTLINESNUM_Field is STM32.UInt4;
-- Interrupt Controller Type Register
type ICTR_Register is record
-- Read-only. Total number of interrupt lines in groups
INTLINESNUM : ICTR_INTLINESNUM_Field;
-- unspecified
Reserved_4_31 : STM32.UInt28;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ICTR_Register use record
INTLINESNUM at 0 range 0 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
------------------
-- IPR_Register --
------------------
-- IPR0_IPR_N array element
subtype IPR0_IPR_N_Element is STM32.Byte;
-- IPR0_IPR_N array
type IPR0_IPR_N_Field_Array is array (0 .. 3) of IPR0_IPR_N_Element
with Component_Size => 8, Size => 32;
-- Interrupt Priority Register
type IPR_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- IPR_N as a value
Val : STM32.Word;
when True =>
-- IPR_N as an array
Arr : IPR0_IPR_N_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access,
Bit_Order => System.Low_Order_First;
for IPR_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-------------------
-- STIR_Register --
-------------------
subtype STIR_INTID_Field is STM32.UInt9;
-- Software Triggered Interrupt Register
type STIR_Register is record
-- Write-only. interrupt to be triggered
INTID : STIR_INTID_Field := 16#0#;
-- unspecified
Reserved_9_31 : STM32.UInt23 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for STIR_Register use record
INTID at 0 range 0 .. 8;
Reserved_9_31 at 0 range 9 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Nested Vectored Interrupt Controller
type NVIC_Peripheral is record
-- Interrupt Controller Type Register
ICTR : ICTR_Register;
-- Interrupt Set-Enable Register
ISER0 : STM32.Word;
-- Interrupt Set-Enable Register
ISER1 : STM32.Word;
-- Interrupt Set-Enable Register
ISER2 : STM32.Word;
-- Interrupt Clear-Enable Register
ICER0 : STM32.Word;
-- Interrupt Clear-Enable Register
ICER1 : STM32.Word;
-- Interrupt Clear-Enable Register
ICER2 : STM32.Word;
-- Interrupt Set-Pending Register
ISPR0 : STM32.Word;
-- Interrupt Set-Pending Register
ISPR1 : STM32.Word;
-- Interrupt Set-Pending Register
ISPR2 : STM32.Word;
-- Interrupt Clear-Pending Register
ICPR0 : STM32.Word;
-- Interrupt Clear-Pending Register
ICPR1 : STM32.Word;
-- Interrupt Clear-Pending Register
ICPR2 : STM32.Word;
-- Interrupt Active Bit Register
IABR0 : STM32.Word;
-- Interrupt Active Bit Register
IABR1 : STM32.Word;
-- Interrupt Active Bit Register
IABR2 : STM32.Word;
-- Interrupt Priority Register
IPR0 : IPR_Register;
-- Interrupt Priority Register
IPR1 : IPR_Register;
-- Interrupt Priority Register
IPR2 : IPR_Register;
-- Interrupt Priority Register
IPR3 : IPR_Register;
-- Interrupt Priority Register
IPR4 : IPR_Register;
-- Interrupt Priority Register
IPR5 : IPR_Register;
-- Interrupt Priority Register
IPR6 : IPR_Register;
-- Interrupt Priority Register
IPR7 : IPR_Register;
-- Interrupt Priority Register
IPR8 : IPR_Register;
-- Interrupt Priority Register
IPR9 : IPR_Register;
-- Interrupt Priority Register
IPR10 : IPR_Register;
-- Interrupt Priority Register
IPR11 : IPR_Register;
-- Interrupt Priority Register
IPR12 : IPR_Register;
-- Interrupt Priority Register
IPR13 : IPR_Register;
-- Interrupt Priority Register
IPR14 : IPR_Register;
-- Interrupt Priority Register
IPR15 : IPR_Register;
-- Interrupt Priority Register
IPR16 : IPR_Register;
-- Software Triggered Interrupt Register
STIR : STIR_Register;
end record
with Volatile;
for NVIC_Peripheral use record
ICTR at 4 range 0 .. 31;
ISER0 at 256 range 0 .. 31;
ISER1 at 260 range 0 .. 31;
ISER2 at 264 range 0 .. 31;
ICER0 at 384 range 0 .. 31;
ICER1 at 388 range 0 .. 31;
ICER2 at 392 range 0 .. 31;
ISPR0 at 512 range 0 .. 31;
ISPR1 at 516 range 0 .. 31;
ISPR2 at 520 range 0 .. 31;
ICPR0 at 640 range 0 .. 31;
ICPR1 at 644 range 0 .. 31;
ICPR2 at 648 range 0 .. 31;
IABR0 at 768 range 0 .. 31;
IABR1 at 772 range 0 .. 31;
IABR2 at 776 range 0 .. 31;
IPR0 at 1024 range 0 .. 31;
IPR1 at 1028 range 0 .. 31;
IPR2 at 1032 range 0 .. 31;
IPR3 at 1036 range 0 .. 31;
IPR4 at 1040 range 0 .. 31;
IPR5 at 1044 range 0 .. 31;
IPR6 at 1048 range 0 .. 31;
IPR7 at 1052 range 0 .. 31;
IPR8 at 1056 range 0 .. 31;
IPR9 at 1060 range 0 .. 31;
IPR10 at 1064 range 0 .. 31;
IPR11 at 1068 range 0 .. 31;
IPR12 at 1072 range 0 .. 31;
IPR13 at 1076 range 0 .. 31;
IPR14 at 1080 range 0 .. 31;
IPR15 at 1084 range 0 .. 31;
IPR16 at 1088 range 0 .. 31;
STIR at 3840 range 0 .. 31;
end record;
-- Nested Vectored Interrupt Controller
NVIC_Periph : aliased NVIC_Peripheral
with Import, Address => NVIC_Base;
end STM32.NVIC;
|
frett27/Ada-Synthetizer | Ada | 5,546 | adb | -- The Beer-Ware License (revision 42)
--
-- Jacob Sparre Andersen <[email protected]> wrote this. As long as you
-- retain this notice you can do whatever you want with this stuff. If we meet
-- some day, and you think this stuff is worth it, you can buy me a beer in
-- return.
--
-- Jacob Sparre Andersen
with Ada.Text_IO, Ada.Text_IO.Text_Streams;
with Sound.Stereo_Recording;
procedure Record_Stereo_WAV is
type Double_Word is mod 2 ** 32;
for Double_Word'Size use 32;
type Word is mod 2 ** 16;
for Word'Size use 16;
type Byte is mod 2 ** 8;
for Byte'Size use 8;
function Little_Endian return Boolean;
-- Checks if we are running on a little-endian architecture.
procedure Write_RIFF
(Target : in Ada.Text_IO.Text_Streams.Stream_Access;
Data : in Sound.Stereo_Recording.Frame_Array);
procedure Write_Format
(Target : in Ada.Text_IO.Text_Streams.Stream_Access;
Sample_Frequency : in Sound.Sample_Frequency);
procedure Write_Data
(Target : in Ada.Text_IO.Text_Streams.Stream_Access;
Data : in Sound.Stereo_Recording.Frame_Array);
function Little_Endian return Boolean is
type Word_As_Bytes is array (1 .. 2) of Byte;
for Word_As_Bytes'Size use 16;
As_Word : Word := 11 * 256 + 42;
As_Bytes : Word_As_Bytes;
for As_Bytes'Address use As_Word'Address;
begin
As_Word := 42 + 256 * 11;
return As_Bytes = (42, 11);
end Little_Endian;
Bits_Per_Sample : constant := Sound.Stereo_Recording.Level'Size;
Number_Of_Channels : constant Word :=
Sound.Stereo_Recording.Frame'Size / Bits_Per_Sample;
Block_Alignment : constant Word :=
Number_Of_Channels * Bits_Per_Sample / 8;
procedure Write_Data
(Target : in Ada.Text_IO.Text_Streams.Stream_Access;
Data : in Sound.Stereo_Recording.Frame_Array) is
Number_Of_Samples : constant Double_Word := Data'Length;
begin
String'Write
(Target,
"data");
Double_Word'Write
(Target,
Number_Of_Samples * Double_Word (Number_Of_Channels)
* Bits_Per_Sample / 8);
Sound.Stereo_Recording.Frame_Array'Write
(Target,
Data);
end Write_Data;
procedure Write_Format
(Target : in Ada.Text_IO.Text_Streams.Stream_Access;
Sample_Frequency : in Sound.Sample_Frequency) is
Sample_Rate : constant Double_Word := Double_Word
(Sample_Frequency);
Byte_Rate : constant Double_Word :=
Sample_Rate * Double_Word (Number_Of_Channels) * Bits_Per_Sample / 8;
begin
String'Write (Target, "fmt ");
Double_Word'Write (Target, 16);
Word'Write (Target, 1);
Word'Write (Target, Number_Of_Channels);
Double_Word'Write (Target, Sample_Rate);
Double_Word'Write (Target, Byte_Rate);
Word'Write (Target, Block_Alignment);
Word'Write (Target, Bits_Per_Sample);
end Write_Format;
procedure Write_RIFF
(Target : in Ada.Text_IO.Text_Streams.Stream_Access;
Data : in Sound.Stereo_Recording.Frame_Array) is
begin
String'Write (Target, "RIFF");
Double_Word'Write (Target, 4 + 24 + 8 + Data'Size / 8);
String'Write (Target, "WAVE");
end Write_RIFF;
Microphone : Sound.Stereo_Recording.Line_Type;
Resolution : Sound.Sample_Frequency := 48_000;
Buffer_Size : Duration := 0.5;
Period : Duration := 0.1;
Recording : Sound.Stereo_Recording.Frame_Array (1 .. 48_000 * 30);
Filled_To : Natural := Recording'First - 1;
Target : Ada.Text_IO.Text_Streams.Stream_Access;
begin
if not Little_Endian then
Ada.Text_IO.Put_Line (File => Ada.Text_IO.Standard_Error,
Item => "Big endian is too messy.");
return;
end if;
Sound.Stereo_Recording.Open (Line => Microphone,
Resolution => Resolution,
Buffer_Size => Buffer_Size,
Period => Period);
Ada.Text_IO.Put_Line
(File => Ada.Text_IO.Standard_Error,
Item => "Resolution [samples/s]:" &
Sound.Sample_Frequency'Image (Resolution));
Ada.Text_IO.Put_Line
(File => Ada.Text_IO.Standard_Error,
Item => "Buffer size [s]:" & Duration'Image (Buffer_Size));
Ada.Text_IO.Put_Line
(File => Ada.Text_IO.Standard_Error,
Item => "Period [s]:" & Duration'Image (Period));
while Filled_To < Recording'Last loop
Sound.Stereo_Recording.Read
(Line => Microphone,
Item => Recording (Filled_To + 1 ..
Positive'Min (Recording'Last, Filled_To + 3000)),
Last => Filled_To);
end loop;
Ada.Text_IO.Put_Line
(File => Ada.Text_IO.Standard_Error,
Item => "Recorded [s]:" &
Duration'Image (Duration (Filled_To) / Duration (Resolution)));
Sound.Stereo_Recording.Close (Line => Microphone);
Target := Ada.Text_IO.Text_Streams.Stream (Ada.Text_IO.Standard_Output);
Write_RIFF (Target => Target,
Data => Recording (Recording'First .. Filled_To));
Write_Format (Target => Target,
Sample_Frequency => Resolution);
Write_Data (Target => Target,
Data => Recording (Recording'First .. Filled_To));
end Record_Stereo_WAV;
|
AdaCore/gpr | Ada | 6,018 | adb | --
-- Copyright (C) 2019-2023, AdaCore
--
-- SPDX-License-Identifier: Apache-2.0
--
with Ada.Strings.Fixed;
with Ada.Text_IO;
with GPR2.Project.Attribute;
with GPR2.Project.Attribute_Index;
with GPR2.Project.Registry.Attribute;
with GPR2.Project.Registry.Pack;
with GPR2.Containers;
with GPR2.Context;
with GPR2.Path_Name;
with GPR2.Project.Tree;
with GPR2.Project.View;
pragma Warnings (Off);
with System.OS_Constants;
pragma Warnings (On);
procedure Main is
use Ada;
use GPR2;
use GPR2.Containers;
package PRA renames Project.Registry.Attribute;
package PRP renames Project.Registry.Pack;
Project_Tree : Project.Tree.Object;
Ctx : Context.Object := Context.Empty;
RTS : Lang_Value_Map := Lang_Value_Maps.Empty_Map;
This_Target : constant String := System.OS_Constants.Target_Name;
procedure Print_Config_Info;
-----------------------
-- Print_Config_Info --
-----------------------
procedure Print_Config_Info is
Ada_I : constant Project.Attribute_Index.Object :=
Project.Attribute_Index.Create (GPR2.Ada_Language);
Config_View : constant Project.View.Object :=
Project_Tree.Configuration.Corresponding_View;
Var : constant String :=
String
(Project_Tree.Root_Project.Variable
("Var").Value.Text);
Target : constant String :=
Config_View.Attribute (PRA.Target).Value.Text;
Canonical_Target : constant String :=
Config_View.Attribute
(PRA.Canonical_Target).Value.Text;
Languages : constant GPR2.Containers.Source_Value_List :=
Project_Tree.Root_Project.Languages;
Has_C : Boolean := False;
begin
Text_IO.Put_Line ("target = "
& (if Target = This_Target
then "this-target"
else Target));
if Target /= This_Target then
Text_IO.Put_Line ("canonical_target = " & Canonical_Target);
end if;
if Var /= Target then
Text_IO.Put_Line
("!!! Error: Var is different from actual target value");
Text_IO.Put_Line ("Var = " & Var);
end if;
-- Check languages list change during autoconf
if not Languages.Is_Empty then
for Value of Languages loop
Text_IO.Put_Line ("language: " & Value.Text);
declare
package PAI renames Project.Attribute_Index;
Driver_Attr : constant Project.Attribute.Object :=
Config_View.Attribute
(Name => PRA.Compiler.Driver,
Index => PAI.Create
(+Name_Type (Value.Text)));
Compiler_Driver : constant Path_Name.Object :=
Path_Name.Create_File
(Filename_Type (Driver_Attr.Value.Text));
Runtime_Dir : constant Path_Name.Object :=
(if Value.Text = "Ada"
then Path_Name.Create_Directory
(Filename_Type (Config_View.Attribute
(Name => PRA.Runtime_Dir,
Index => Ada_I).Value.Text))
else Path_Name.Undefined);
begin
Text_IO.Put_Line ("- compiler driver = "
& String (Compiler_Driver.Base_Name));
if Runtime_Dir.Is_Defined then
declare
use Strings.Fixed;
RT_Dir_Str : constant String :=
String (Runtime_Dir.Dir_Name);
Sec_To_Last_Sep : constant Integer :=
Index (Source => RT_Dir_Str,
Pattern => Tail (RT_Dir_Str, 1),
From => RT_Dir_Str'Last - 1,
Going => Strings.Backward);
begin
Text_IO.Put_Line
("- runtime dir = "
& RT_Dir_Str (Sec_To_Last_Sep + 1 .. RT_Dir_Str'Last - 1));
end;
end if;
end;
end loop;
end if;
end Print_Config_Info;
begin
-- Equivalent to command line options:
-- --RTS=rtp -Xtarget=x86_64-wrs-vxworks7
RTS.Insert (Ada_Language, "rtp");
Ctx.Insert ("VSB_DIR", ".");
Ctx.Insert ("target", "x86_64-wrs-vxworks7");
Project_Tree.Load_Autoconf
(Filename => Project.Create ("projects/a.gpr"),
Context => Ctx,
Language_Runtimes => RTS);
Print_Config_Info;
Project_Tree.Unload;
Text_IO.New_Line;
-- --RTS=rtp -Xtarget=x86-linux --target=x86_64-wrs-vxworks7
-- --target will take precedence over Target definition in the project
Ctx.Clear;
Ctx.Insert ("VSB_DIR", ".");
Ctx.Insert ("target", This_Target);
Project_Tree.Load_Autoconf
(Filename => Project.Create ("projects/a.gpr"),
Context => Ctx,
Target => "x86_64-wrs-vxworks7",
Language_Runtimes => RTS);
Print_Config_Info;
Project_Tree.Unload;
Text_IO.New_Line;
-- Equivalent to command line without --RTS / --target
Project_Tree.Load_Autoconf
(Filename => Project.Create ("projects/a.gpr"),
Context => Ctx);
Print_Config_Info;
exception
when Project_Error =>
for M of Project_Tree.Log_Messages.all loop
Text_IO.Put_Line (M.Format);
end loop;
end Main;
|
AdaCore/training_material | Ada | 103 | ads | package Shapes is
type Shape is tagged null record;
procedure P (O : Shape) is null;
end Shapes;
|
pchapin/augusta | Ada | 360 | adb |
procedure Type_Declare3 is
type T1 is range 1 .. 10;
subtype S1 is Boolean range 1 .. 2;
subtype S2 is Integer range 1 .. 2;
subtype S3 is T1 range 0 .. 5;
subtype S4 is T1 range 5 .. 15;
subtype S5 is T1 range 1 .. 5;
subtype S6 is S5 range 0 .. 5;
subtype S7 is S5 range 1 .. 6;
subtype S8 is S5 range 2 .. 4;
begin
null;
end;
|
Samsung/TizenRT | Ada | 13,097 | ads | ----------------------------------------------------------------------------- -
-- ZLib for Ada thick binding. --
-- --
-- Copyright(C) 2002 - 2004 Dmitriy Anisimkov --
-- --
-- This library 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 2 of the License, 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 --
- - 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 this library;
if not, write to the Free Software Foundation, --
- - Inc., 59 Temple Place - Suite 330, Boston, MA 02111 - 1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
------------------------------------------------------------------------------
-- $Id: zlib.ads, v 1.26 2004 / 09 / 06 06:53:19 vagul Exp $
with Ada.Streams;
with Interfaces;
package ZLib is
ZLib_Error :
exception;
Status_Error :
exception;
type Compression_Level is new Integer range - 1 .. 9;
type Flush_Mode is private;
type Compression_Method is private;
type Window_Bits_Type is new Integer range 8 .. 15;
type Memory_Level_Type is new Integer range 1 .. 9;
type Unsigned_32 is new Interfaces.Unsigned_32;
type Strategy_Type is private;
type Header_Type is(None, Auto, Default, GZip);
- - Header type usage have a some limitation for inflate.
-- See comment for Inflate_Init.
subtype Count is Ada.Streams.Stream_Element_Count;
Default_Memory_Level :
constant Memory_Level_Type :
= 8;
Default_Window_Bits :
constant Window_Bits_Type :
= 15;
--------------------------------- -
-- Compression method constants --
----------------------------------
Deflated : constant Compression_Method;
- - Only one method allowed in this ZLib version
-------------------------------- -
-- Compression level constants --
-------------------------------- -
No_Compression : constant Compression_Level : = 0;
Best_Speed :
constant Compression_Level :
= 1;
Best_Compression :
constant Compression_Level :
= 9;
Default_Compression :
constant Compression_Level :
= -1;
------------------------- -
-- Flush mode constants --
--------------------------
No_Flush : constant Flush_Mode;
- - Regular way for compression, no flush
Partial_Flush : constant Flush_Mode;
- - Will be removed, use Z_SYNC_FLUSH instead
Sync_Flush : constant Flush_Mode;
- - All pending output is flushed to the output buffer and the output
-- is aligned on a byte boundary, so that the decompressor can get all
-- input data available so far.(In particular avail_in is zero after the
-- call if enough output space has been provided before the call.)
-- Flushing may degrade compression for some compression algorithms and so
-- it should be used only when necessary.
Block_Flush : constant Flush_Mode;
- - Z_BLOCK requests that inflate() stop
-- if and when it get to the next deflate block boundary. When decoding the
-- zlib or gzip format, this will cause inflate() to return immediately
-- after the header and before the first block. When doing a raw inflate,
-- inflate() will go ahead and process the first block, and will return
-- when it gets to the end of that block, or when it runs out of data.
Full_Flush : constant Flush_Mode;
- - All output is flushed as with SYNC_FLUSH, and the compression state
-- is reset so that decompression can restart from this point if previous
-- compressed data has been damaged or if random access is desired. Using
-- Full_Flush too often can seriously degrade the compression.
Finish : constant Flush_Mode;
- - Just for tell the compressor that input data is complete.
------------------------------------
-- Compression strategy constants --
------------------------------------
-- RLE stategy could be used only in version 1.2.0 and later.
Filtered : constant Strategy_Type;
Huffman_Only :
constant Strategy_Type;
RLE :
constant Strategy_Type;
Default_Strategy :
constant Strategy_Type;
Default_Buffer_Size :
constant :
= 4096;
type Filter_Type is tagged limited private;
- - The filter is for compression and for decompression.
-- The usage of the type is depend of its initialization.
function Version return String;
pragma Inline(Version);
- - Return string representation of the ZLib version.
procedure Deflate_Init
(Filter : in out Filter_Type;
Level : in Compression_Level : = Default_Compression;
Strategy : in Strategy_Type : = Default_Strategy;
Method : in Compression_Method : = Deflated;
Window_Bits : in Window_Bits_Type : = Default_Window_Bits;
Memory_Level : in Memory_Level_Type : = Default_Memory_Level;
Header : in Header_Type : = Default);
- - Compressor initialization.
-- When Header parameter is Auto or Default, then default zlib header
-- would be provided for compressed data.
-- When Header is GZip, then gzip header would be set instead of
-- default header.
-- When Header is None, no header would be set for compressed data.
procedure Inflate_Init
(Filter : in out Filter_Type;
Window_Bits : in Window_Bits_Type : = Default_Window_Bits;
Header : in Header_Type : = Default);
- - Decompressor initialization.
-- Default header type mean that ZLib default header is expecting in the
-- input compressed stream.
-- Header type None mean that no header is expecting in the input stream.
-- GZip header type mean that GZip header is expecting in the
-- input compressed stream.
-- Auto header type mean that header type(GZip or Native) would be
-- detected automatically in the input stream.
-- Note that header types parameter values None, GZip and Auto are
-- supported for inflate routine only in ZLib versions 1.2.0.2 and later.
-- Deflate_Init is supporting all header types.
function Is_Open(Filter : in Filter_Type)
{
return Boolean;
}
pragma Inline(Is_Open);
- - Is the filter opened for compression or decompression.
procedure Close
(Filter : in out Filter_Type;
Ignore_Error : in Boolean : = False);
- - Closing the compression or decompressor.
-- If stream is closing before the complete and Ignore_Error is False,
-- The exception would be raised.
generic
with procedure Data_In
(Item : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset);
with procedure Data_Out
(Item : in Ada.Streams.Stream_Element_Array);
procedure Generic_Translate
(Filter : in out Filter_Type;
In_Buffer_Size : in Integer : = Default_Buffer_Size;
Out_Buffer_Size : in Integer : = Default_Buffer_Size);
- - Compress / decompress data fetch from Data_In routine and pass the result
-- to the Data_Out routine. User should provide Data_In and Data_Out
-- for compression / decompression data flow.
-- Compression or decompression depend on Filter initialization.
function Total_In(Filter : in Filter_Type)
{
return Count;
}
pragma Inline(Total_In);
- - Returns total number of input bytes read so far
function Total_Out(Filter : in Filter_Type) return Count;
pragma Inline(Total_Out);
- - Returns total number of bytes output so far
function CRC32
(CRC : in Unsigned_32;
Data : in Ada.Streams.Stream_Element_Array)
return Unsigned_32;
pragma Inline(CRC32);
- - Compute CRC32, it could be necessary for make gzip format
procedure CRC32
(CRC : in out Unsigned_32;
Data : in Ada.Streams.Stream_Element_Array);
pragma Inline(CRC32);
- - Compute CRC32, it could be necessary for make gzip format
------------------------------------------------ -
-- Below is more complex low level routines. --
------------------------------------------------ -
procedure Translate
(Filter : in out Filter_Type;
In_Data : in Ada.Streams.Stream_Element_Array;
In_Last : out Ada.Streams.Stream_Element_Offset;
Out_Data : out Ada.Streams.Stream_Element_Array;
Out_Last : out Ada.Streams.Stream_Element_Offset;
Flush : in Flush_Mode);
- - Compress / decompress the In_Data buffer and place the result into
-- Out_Data. In_Last is the index of last element from In_Data accepted by
-- the Filter. Out_Last is the last element of the received data from
-- Filter. To tell the filter that incoming data are complete put the
-- Flush parameter to Finish.
function Stream_End(Filter : in Filter_Type) return Boolean;
pragma Inline(Stream_End);
- - Return the true when the stream is complete.
procedure Flush
(Filter : in out Filter_Type;
Out_Data : out Ada.Streams.Stream_Element_Array;
Out_Last : out Ada.Streams.Stream_Element_Offset;
Flush : in Flush_Mode);
pragma Inline(Flush);
- - Flushing the data from the compressor.
generic
with procedure Write
(Item : in Ada.Streams.Stream_Element_Array);
- - User should provide this routine for accept
-- compressed / decompressed data.
Buffer_Size : in Ada.Streams.Stream_Element_Offset
: = Default_Buffer_Size;
- - Buffer size for Write user routine.
procedure Write
(Filter : in out Filter_Type;
Item : in Ada.Streams.Stream_Element_Array;
Flush : in Flush_Mode : = No_Flush);
- - Compress / Decompress data from Item to the generic parameter procedure
-- Write. Output buffer size could be set in Buffer_Size generic parameter.
generic
with procedure Read
(Item : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset);
- - User should provide data for compression / decompression
-- thru this routine.
Buffer : in out Ada.Streams.Stream_Element_Array;
- - Buffer for keep remaining data from the previous
-- back read.
Rest_First, Rest_Last : in out Ada.Streams.Stream_Element_Offset;
- - Rest_First have to be initialized to Buffer'Last + 1
-- Rest_Last have to be initialized to Buffer'Last
-- before usage.
Allow_Read_Some : in Boolean : = False;
- - Is it allowed to return Last < Item'Last before end of data.
procedure Read
(Filter : in out Filter_Type;
Item : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset;
Flush : in Flush_Mode : = No_Flush);
- - Compress / Decompress data from generic parameter procedure Read to the
-- Item. User should provide Buffer and initialized Rest_First, Rest_Last
-- indicators. If Allow_Read_Some is True, Read routines could return
-- Last < Item'Last only at end of stream.
private
use Ada.Streams;
pragma Assert(Ada.Streams.Stream_Element'Size = 8);
pragma Assert(Ada.Streams.Stream_Element'Modulus = 2**8);
type Flush_Mode is new Integer range 0 .. 5;
type Compression_Method is new Integer range 8 .. 8;
type Strategy_Type is new Integer range 0 .. 3;
No_Flush : constant Flush_Mode : = 0;
Partial_Flush : constant Flush_Mode : = 1;
Sync_Flush : constant Flush_Mode : = 2;
Full_Flush : constant Flush_Mode : = 3;
Finish : constant Flush_Mode : = 4;
Block_Flush : constant Flush_Mode : = 5;
Filtered : constant Strategy_Type : = 1;
Huffman_Only : constant Strategy_Type : = 2;
RLE : constant Strategy_Type : = 3;
Default_Strategy : constant Strategy_Type : = 0;
Deflated : constant Compression_Method : = 8;
type Z_Stream;
type Z_Stream_Access is access all Z_Stream;
type Filter_Type is tagged limited record
Strm : Z_Stream_Access;
Compression : Boolean;
Stream_End : Boolean;
Header : Header_Type;
CRC : Unsigned_32;
Offset : Stream_Element_Offset;
- - Offset for gzip header / footer output.
end record;
end ZLib;
|
reznikmm/matreshka | Ada | 4,163 | ads | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Open Document Toolkit --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2014, Vadim Godunko <[email protected]> --
-- 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 ODF.DOM.Style_Legend_Expansion_Aspect_Ratio_Attributes;
package Matreshka.ODF_Style.Legend_Expansion_Aspect_Ratio_Attributes is
type Style_Legend_Expansion_Aspect_Ratio_Attribute_Node is
new Matreshka.ODF_Style.Abstract_Style_Attribute_Node
and ODF.DOM.Style_Legend_Expansion_Aspect_Ratio_Attributes.ODF_Style_Legend_Expansion_Aspect_Ratio_Attribute
with null record;
overriding function Create
(Parameters : not null access Matreshka.DOM_Attributes.Attribute_L2_Parameters)
return Style_Legend_Expansion_Aspect_Ratio_Attribute_Node;
overriding function Get_Local_Name
(Self : not null access constant Style_Legend_Expansion_Aspect_Ratio_Attribute_Node)
return League.Strings.Universal_String;
end Matreshka.ODF_Style.Legend_Expansion_Aspect_Ratio_Attributes;
|
caqg/linux-home | Ada | 241,142 | adb | -- generated parser support file.
-- command line: wisitoken-bnf-generate.exe --generate LR1 Ada_Emacs re2c PROCESS text_rep ada.wy
--
-- Copyright (C) 2013 - 2019 Free Software Foundation, Inc.
-- This program 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, or (at
-- your option) any later version.
--
-- This software 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 GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
with Wisi; use Wisi;
with Wisi.Ada; use Wisi.Ada;
package body Ada_Process_Actions is
use WisiToken.Semantic_Checks;
use all type Motion_Param_Array;
procedure abstract_subprogram_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_Override), (6,
Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end abstract_subprogram_declaration_0;
procedure accept_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Motion), (9, Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 4);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 6);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (5, Empty_IDs) & (6, 26 & 72) & (9,
Empty_IDs)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 3, 1), (8, 3, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (True, (Simple, (Label => None)), (Simple, (Int, Ada_Indent))), (True, (Simple, (Int,
Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label =>
None))), (False, (Simple, (Label => None)))));
end case;
end accept_statement_0;
function accept_statement_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 2, 8, End_Names_Optional);
end accept_statement_0_check;
procedure accept_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 4);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end accept_statement_1;
procedure access_definition_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple,
(Anchored_1, 4, Ada_Indent_Broken)))));
end case;
end access_definition_0;
procedure access_definition_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple,
(Anchored_2, 4, Ada_Indent_Broken)))));
end case;
end access_definition_1;
procedure access_definition_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (4, 1, 2)));
when Indent =>
null;
end case;
end access_definition_2;
procedure actual_parameter_part_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple,
(Anchored_0, 1, 1)), (Simple, (Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
end case;
end actual_parameter_part_0;
procedure actual_parameter_part_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple,
(Anchored_0, 1, 1)), (Simple, (Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
end case;
end actual_parameter_part_1;
procedure aggregate_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 1))), (False, (Simple, (Label => None))), (False,
(Simple, (Label => None))), (False, (Simple, (Anchored_0, 1, 0)))));
end case;
end aggregate_0;
procedure aggregate_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 1))), (True, (Simple, (Anchored_0, 1, 1)), (Simple,
(Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
end case;
end aggregate_1;
procedure aggregate_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple,
(Anchored_0, 1, 1)), (Simple, (Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
end case;
end aggregate_3;
procedure aggregate_4
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple,
(Anchored_0, 1, 1)), (Simple, (Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
end case;
end aggregate_4;
procedure array_type_definition_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Anchored_0, 2, 1))), (False, (Simple, (Anchored_0, 2, 0))), (False,
(Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end array_type_definition_0;
procedure array_type_definition_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Anchored_0, 2, 1))), (False, (Simple, (Anchored_0, 2, 0))), (False,
(Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end array_type_definition_1;
procedure aspect_clause_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Statement_End)));
when Face =>
null;
when Indent =>
null;
end case;
end aspect_clause_0;
procedure aspect_specification_opt_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken)))));
end case;
end aspect_specification_opt_0;
procedure assignment_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 3);
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Hanging_0, (Anchored_1, 2, Ada_Indent_Broken), (Anchored_1, 3,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end assignment_statement_0;
procedure association_opt_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (True, (Simple, (Anchored_1, 2, Ada_Indent_Broken)), (Simple, (Anchored_1, 2,
Ada_Indent_Broken)))));
end case;
end association_opt_0;
procedure association_opt_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Hanging_0, (Label => None), (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (True, (Hanging_3, (Anchored_1, 2,
Ada_Indent_Broken), (Anchored_1, 2, 2 * Ada_Indent_Broken)), (Hanging_3, (Anchored_1, 2, Ada_Indent_Broken),
(Anchored_1, 2, 2 * Ada_Indent_Broken)))));
end case;
end association_opt_2;
procedure association_opt_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Hanging_0, (Label => None), (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end association_opt_3;
procedure association_opt_4
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, (1 => (True, (Hanging_0, (Label => None), (Int,
Ada_Indent_Broken)), (Hanging_0, (Label => None), (Int, Ada_Indent_Broken)))));
end case;
end association_opt_4;
procedure asynchronous_select_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Motion), (8, Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 2);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 5);
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent)), (Simple, (Int, Ada_Indent))), (True, (Simple, (Label => None)), (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (True, (Simple, (Int, Ada_Indent)),
(Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False,
(Simple, (Label => None)))));
end case;
end asynchronous_select_0;
procedure at_clause_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Statement_End)));
when Face =>
null;
when Indent =>
null;
end case;
end at_clause_0;
procedure block_label_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Int, Ada_Indent_Label))), (False,
(Simple, (Label => None)))));
end case;
end block_label_0;
function block_label_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Propagate_Name (Nonterm, Tokens, 1);
end block_label_0_check;
function block_label_opt_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Propagate_Name (Nonterm, Tokens, 1);
end block_label_opt_0_check;
procedure block_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Misc), (4, Motion), (8,
Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 2, 3);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 2, 5);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, Empty_IDs) & (4, Empty_IDs) & (5, 26 & 72) & (8,
Empty_IDs)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label
=> None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label =>
None))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end block_statement_0;
function block_statement_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 1, 7, End_Names_Optional);
end block_statement_0_check;
procedure block_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Misc), (6, Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 2, 3);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, Empty_IDs) & (3, 26 & 72) & (6, Empty_IDs)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label
=> None))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end block_statement_1;
function block_statement_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 1, 5, End_Names_Optional);
end block_statement_1_check;
procedure case_expression_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Int, Ada_Indent_When)))));
end case;
end case_expression_0;
procedure case_expression_alternative_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Hanging_0, (Anchored_1, 1,
Ada_Indent), (Anchored_1, 1, Ada_Indent + Ada_Indent_Broken)))));
end case;
end case_expression_alternative_0;
procedure case_expression_alternative_list_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple,
(Label => None)), (Simple, (Int, Ada_Indent_When))), (False, (Simple, (Label => None)))));
end case;
end case_expression_alternative_list_0;
procedure case_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Motion), (7, Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 4);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (4, +72) & (7, Empty_IDs)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (True, (Simple, (Int, Ada_Indent_When)),
(Simple, (Int, Ada_Indent_When))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))),
(False, (Simple, (Label => None)))));
end case;
end case_statement_0;
procedure case_statement_alternative_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Motion)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (True, (Simple, (Int, Ada_Indent)),
(Simple, (Int, Ada_Indent)))));
end case;
end case_statement_alternative_0;
procedure compilation_unit_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Int, 0))), (False, (Simple, (Int,
0)))));
end case;
end compilation_unit_2;
procedure compilation_unit_list_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Int, 0))), (True, (Simple, (Int, 0)),
(Simple, (Int, 0)))));
end case;
end compilation_unit_list_0;
procedure compilation_unit_list_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, (1 => (True, (Simple, (Int, 0)), (Simple, (Int, 0)))));
end case;
end compilation_unit_list_1;
function compilation_unit_list_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Tokens);
begin
return Terminate_Partial_Parse (Partial_Parse_Active, Partial_Parse_Byte_Goal, Recover_Active, Nonterm);
end compilation_unit_list_1_check;
procedure component_clause_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (8, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end component_clause_0;
procedure component_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 3);
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 4, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end component_declaration_0;
procedure component_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 3);
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end component_declaration_1;
procedure component_list_4
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_End)));
when Face =>
null;
when Indent =>
null;
end case;
end component_list_4;
procedure conditional_entry_call_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Motion), (7, Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 2);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 4);
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label =>
None))), (False, (Simple, (Label => None)))));
end case;
end conditional_entry_call_0;
procedure declaration_9
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 5);
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Hanging_0, (Label => None), (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 4,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end declaration_9;
procedure delay_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end delay_statement_0;
procedure delay_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end delay_statement_1;
procedure derived_type_definition_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1, 2)));
when Indent =>
null;
end case;
end derived_type_definition_0;
procedure derived_type_definition_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1, 2)));
when Indent =>
null;
end case;
end derived_type_definition_1;
procedure discriminant_part_opt_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
end case;
end discriminant_part_opt_1;
procedure elsif_expression_item_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Motion), (3, Motion)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent)))));
end case;
end elsif_expression_item_0;
procedure elsif_statement_item_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Motion), (3, Motion)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (True, (Simple,
(Int, Ada_Indent)), (Simple, (Int, Ada_Indent)))));
end case;
end elsif_statement_item_0;
procedure entry_body_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Motion), (6, Motion), (8,
Motion), (12, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 3);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 7);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 9);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (4, Empty_IDs) & (6, Empty_IDs) & (8,
Empty_IDs) & (12, Empty_IDs)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 3, 1), (11, 3, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 4, Ada_Indent_Broken))), (False, (Simple, (Label =>
None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))),
(True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))), (False,
(Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end entry_body_0;
function entry_body_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 2, 11, End_Names_Optional);
end entry_body_0_check;
procedure entry_body_formal_part_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 1))), (False,
(Simple, (Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
end case;
end entry_body_formal_part_0;
procedure entry_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Motion), (8, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 2, 7);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Anchored_0, 4, 1))), (False, (Simple, (Anchored_0, 4, 0))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end entry_declaration_0;
procedure entry_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Motion), (6, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 2, 4);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end entry_declaration_1;
procedure enumeration_representation_clause_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Statement_End)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 1, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end enumeration_representation_clause_0;
procedure enumeration_type_definition_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
end case;
end enumeration_type_definition_0;
procedure exception_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Statement_End)));
when Face =>
null;
when Indent =>
null;
end case;
end exception_declaration_0;
procedure exception_handler_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Motion)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (True, (Simple, (Int, Ada_Indent)),
(Simple, (Int, Ada_Indent)))));
end case;
end exception_handler_0;
procedure exception_handler_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Motion)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (True, (Simple, (Int, Ada_Indent)),
(Simple, (Int, Ada_Indent)))));
end case;
end exception_handler_1;
procedure exit_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False,
(Simple, (Label => None)))));
end case;
end exit_statement_0;
procedure exit_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Statement_End)));
when Face =>
null;
when Indent =>
null;
end case;
end exit_statement_1;
procedure expression_function_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_Override), (6,
Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end expression_function_declaration_0;
procedure extended_return_object_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple,
(Anchored_1, 6, Ada_Indent_Broken)))));
end case;
end extended_return_object_declaration_0;
procedure extended_return_object_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken)))));
end case;
end extended_return_object_declaration_1;
procedure extended_return_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Motion), (7, Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 4);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (3, Empty_IDs) & (7, Empty_IDs)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple, (Label => None)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (True,
(Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))), (False,
(Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end extended_return_statement_0;
procedure extended_return_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Statement_End)));
when Face =>
null;
when Indent =>
null;
end case;
end extended_return_statement_1;
procedure formal_object_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (9, Statement_End)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (5, 1, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 6, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end formal_object_declaration_0;
procedure formal_object_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (8, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 5,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end formal_object_declaration_1;
procedure formal_object_declaration_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (5, 1, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end formal_object_declaration_2;
procedure formal_object_declaration_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end formal_object_declaration_3;
procedure formal_part_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Misc)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
end case;
end formal_part_0;
procedure formal_subprogram_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple,
(Label => None)))));
end case;
end formal_subprogram_declaration_0;
procedure formal_subprogram_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end formal_subprogram_declaration_1;
procedure formal_subprogram_declaration_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end formal_subprogram_declaration_2;
procedure formal_subprogram_declaration_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end formal_subprogram_declaration_3;
procedure formal_type_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 5);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end formal_type_declaration_0;
procedure formal_type_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end formal_type_declaration_1;
procedure formal_type_declaration_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Statement_End)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end formal_type_declaration_2;
procedure formal_derived_type_definition_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1, 2)));
when Indent =>
null;
end case;
end formal_derived_type_definition_0;
procedure formal_derived_type_definition_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1, 2)));
when Indent =>
null;
end case;
end formal_derived_type_definition_1;
procedure formal_package_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (9, Statement_End)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 1, 1), (6, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end formal_package_declaration_0;
procedure full_type_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 5);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False,
(Simple, (Label => None)))));
end case;
end full_type_declaration_0;
procedure function_specification_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Statement_Start)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 3);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
end case;
end function_specification_0;
function function_specification_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Propagate_Name (Nonterm, Tokens, 2);
end function_specification_0_check;
procedure generic_formal_part_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Statement_Start)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent)))));
end case;
end generic_formal_part_0;
procedure generic_formal_part_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Statement_Start)));
when Face =>
null;
when Indent =>
null;
end case;
end generic_formal_part_1;
procedure generic_instantiation_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 1, 1), (5, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple,
(Label => None)))));
end case;
end generic_instantiation_0;
procedure generic_instantiation_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Motion), (8, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 1, 1), (6, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end generic_instantiation_1;
procedure generic_instantiation_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Motion), (8, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 1, 1), (6, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False,
(Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end generic_instantiation_2;
procedure generic_package_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Motion), (3, Statement_End)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (2, Empty_IDs) & (3, Empty_IDs)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple, (Label => None)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end generic_package_declaration_0;
procedure generic_renaming_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 1, 1), (5, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple,
(Label => None)))));
end case;
end generic_renaming_declaration_0;
procedure generic_renaming_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 1, 1), (5, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Language,
Ada_Indent_Renames_0'Access, +3))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end generic_renaming_declaration_1;
procedure generic_renaming_declaration_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 1, 1), (5, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Language,
Ada_Indent_Renames_0'Access, +3))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end generic_renaming_declaration_2;
procedure generic_subprogram_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Motion), (4, Statement_End)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (2, Empty_IDs) & (4, Empty_IDs)));
when Face =>
null;
when Indent =>
null;
end case;
end generic_subprogram_declaration_0;
procedure goto_label_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 0)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Int, Ada_Indent_Label))), (False,
(Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end goto_label_0;
procedure handled_sequence_of_statements_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, Motion)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple, (Label => None)), (Simple, (Label =>
None))), (False, (Simple, (Int, -Ada_Indent))), (True, (Simple, (Int, Ada_Indent_When - Ada_Indent)), (Simple,
(Int, Ada_Indent_When - Ada_Indent)))));
end case;
end handled_sequence_of_statements_0;
procedure identifier_list_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken)))));
end case;
end identifier_list_0;
procedure identifier_list_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 1);
when Face =>
null;
when Indent =>
null;
end case;
end identifier_list_1;
function identifier_opt_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Propagate_Name (Nonterm, Tokens, 1);
end identifier_opt_0_check;
procedure if_expression_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Motion), (6, Motion)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 2);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (3, Empty_IDs) & (5, 23 & 68) & (6,
Empty_IDs)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent)))));
end case;
end if_expression_0;
procedure if_expression_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Motion), (5, Motion)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 2);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (3, Empty_IDs) & (5, Empty_IDs)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Int, Ada_Indent)))));
end case;
end if_expression_1;
procedure if_expression_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Motion)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 2);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (3, Empty_IDs) & (5, 23 & 68)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent))), (False, (Simple, (Label => None)))));
end case;
end if_expression_2;
procedure if_expression_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Motion)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 2);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (3, Empty_IDs)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent)))));
end case;
end if_expression_3;
procedure if_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Motion), (6, Motion), (10,
Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 2);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 4);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 5);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 7);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (3, Empty_IDs) & (5, 23 & 68) & (6,
Empty_IDs) & (10, Empty_IDs)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Hanging_2,
(Int, Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), (False, (Simple,
(Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label
=> None))), (False, (Simple, (Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple, (Label
=> None)))));
end case;
end if_statement_0;
procedure if_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Motion), (5, Motion), (9,
Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 2);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 4);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 6);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (3, Empty_IDs) & (5, Empty_IDs) & (9,
Empty_IDs)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Hanging_2,
(Int, Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), (False, (Simple,
(Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label
=> None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label =>
None))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end if_statement_1;
procedure if_statement_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Motion), (8, Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 2);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 4);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 5);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (3, Empty_IDs) & (5, 23 & 68) & (8,
Empty_IDs)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Hanging_2,
(Int, Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), (False, (Simple,
(Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label
=> None))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple, (Label =>
None)))));
end case;
end if_statement_2;
procedure if_statement_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Motion), (7, Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 2);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 4);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (3, Empty_IDs) & (7, Empty_IDs)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Hanging_2,
(Int, Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), (False, (Simple,
(Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label
=> None))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end if_statement_3;
procedure incomplete_type_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end incomplete_type_declaration_0;
procedure incomplete_type_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end incomplete_type_declaration_1;
procedure index_constraint_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
end case;
end index_constraint_0;
procedure interface_list_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1, 2)));
when Indent =>
null;
end case;
end interface_list_0;
procedure interface_list_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, 1, 2)));
when Indent =>
null;
end case;
end interface_list_1;
procedure iteration_scheme_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken)))));
end case;
end iteration_scheme_0;
procedure iteration_scheme_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken)))));
end case;
end iteration_scheme_1;
procedure iterator_specification_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Remove_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => 4));
when Indent =>
null;
end case;
end iterator_specification_2;
procedure iterator_specification_5
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Remove_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => 3));
when Indent =>
null;
end case;
end iterator_specification_5;
procedure loop_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Misc), (3, Motion), (8,
Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 2, 4);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, Empty_IDs) & (3, Empty_IDs) & (8, Empty_IDs)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple, (Label
=> None))), (False, (Simple, (Label => None)))));
end case;
end loop_statement_0;
function loop_statement_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 1, 7, End_Names_Optional);
end loop_statement_0_check;
procedure loop_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Misc), (7, Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 2, 3);
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label
=> None))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple, (Label =>
None)))));
end case;
end loop_statement_1;
function loop_statement_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 1, 6, End_Names_Optional);
end loop_statement_1_check;
procedure name_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Anchored_1, 1, Ada_Indent_Broken))), (False, (Hanging_0, (Anchored_0, 2, 1), (Anchored_0, 2, 1 +
Ada_Indent_Broken))), (False, (Simple, (Anchored_0, 2, 0)))));
end case;
end name_0;
procedure name_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Misc)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 2);
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple, (if
Ada_Indent_Hanging_Rel_Exp then (Anchored_0, 1, Ada_Indent_Broken) else (Anchored_1, 1,
Ada_Indent_Broken))))));
end case;
end name_1;
function name_2_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Propagate_Name (Nonterm, Tokens, 1);
end name_2_check;
procedure name_5
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Mark_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Suffix)));
when Indent =>
null;
end case;
end name_5;
function name_5_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Propagate_Name (Nonterm, Tokens, 1);
end name_5_check;
function name_7_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Propagate_Name (Nonterm, Tokens, 1);
end name_7_check;
function name_opt_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Propagate_Name (Nonterm, Tokens, 1);
end name_opt_0_check;
procedure null_exclusion_opt_name_type_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, 3, 2)));
when Indent =>
null;
end case;
end null_exclusion_opt_name_type_0;
procedure null_exclusion_opt_name_type_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, 1, 2)));
when Indent =>
null;
end case;
end null_exclusion_opt_name_type_1;
procedure null_exclusion_opt_name_type_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3, 2)));
when Indent =>
null;
end case;
end null_exclusion_opt_name_type_2;
procedure null_exclusion_opt_name_type_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1, 2)));
when Indent =>
null;
end case;
end null_exclusion_opt_name_type_3;
procedure null_procedure_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_Override), (6,
Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end null_procedure_declaration_0;
procedure object_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (9, Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 7);
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Anchored_2, 6, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end object_declaration_0;
procedure object_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (9, Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 5);
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 6, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end object_declaration_1;
procedure object_declaration_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (9, Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 5);
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 6, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end object_declaration_2;
procedure object_declaration_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end object_declaration_3;
procedure object_declaration_4
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 5);
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end object_declaration_4;
procedure object_declaration_5
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 5);
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end object_declaration_5;
procedure object_renaming_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (8, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 1);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (4, 1, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end object_renaming_declaration_0;
procedure object_renaming_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 1);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 3);
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end object_renaming_declaration_1;
procedure object_renaming_declaration_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 1);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (5, 1, 3)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end object_renaming_declaration_2;
procedure overriding_indicator_opt_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_Override)));
when Face =>
null;
when Indent =>
null;
end case;
end overriding_indicator_opt_0;
procedure overriding_indicator_opt_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Statement_Start)));
when Face =>
null;
when Indent =>
null;
end case;
end overriding_indicator_opt_1;
procedure package_body_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Motion), (7, Motion), (11,
Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 6);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 8);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (5, Empty_IDs) & (7, Empty_IDs) & (8, 26 &
72) & (11, Empty_IDs)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 1, 1), (10, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))),
(False, (Simple, (Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False,
(Simple, (Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end package_body_0;
function package_body_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 3, 10, End_Names_Optional);
end package_body_0_check;
procedure package_body_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Motion), (9, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 6);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (5, Empty_IDs) & (9, Empty_IDs)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 1, 1), (8, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple, (Label
=> None)))));
end case;
end package_body_1;
function package_body_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 3, 8, End_Names_Optional);
end package_body_1_check;
procedure package_body_stub_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))),
(False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple,
(Label => None)))));
end case;
end package_body_stub_0;
procedure package_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_End)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, +49) & (2, Empty_IDs)));
when Face =>
null;
when Indent =>
null;
end case;
end package_declaration_0;
procedure package_renaming_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 1, 1), (4, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end package_renaming_declaration_0;
procedure package_specification_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Motion), (6, Motion)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 4);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 4, 5);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 7);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (4, Empty_IDs) & (6, Empty_IDs)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 1, 1), (9, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))),
(True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))), (True,
(Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))), (False,
(Simple, (Label => None)))));
end case;
end package_specification_0;
function package_specification_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 2, 9, End_Names_Optional);
end package_specification_0_check;
procedure package_specification_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Motion)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 4);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 4, 5);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (4, Empty_IDs)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 1, 1), (7, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))),
(True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))), (False,
(Simple, (Label => None)))));
end case;
end package_specification_1;
function package_specification_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 2, 7, End_Names_Optional);
end package_specification_1_check;
procedure parameter_and_result_profile_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Language, Ada_Indent_Return_0'Access, 1 & 0)))));
end case;
end parameter_and_result_profile_0;
procedure parameter_specification_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (6, 1, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 7,
Ada_Indent_Broken)))));
end case;
end parameter_specification_0;
procedure parameter_specification_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (6, 1, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
end case;
end parameter_specification_1;
procedure parameter_specification_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 5,
Ada_Indent_Broken)))));
end case;
end parameter_specification_2;
procedure parameter_specification_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
end case;
end parameter_specification_3;
procedure parameter_specification_list_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, Motion)));
when Face =>
null;
when Indent =>
null;
end case;
end parameter_specification_list_0;
procedure paren_expression_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Hanging_0,
(Anchored_0, 1, 1), (Anchored_0, 1, 1 + Ada_Indent_Broken))), (False, (Simple, (Anchored_0, 1, 0)))));
end case;
end paren_expression_0;
procedure paren_expression_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
end case;
end paren_expression_1;
procedure paren_expression_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
end case;
end paren_expression_2;
procedure pragma_g_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Statement_End)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Anchored_0, 3,
1))), (False, (Simple, (Anchored_0, 3, 0))), (False, (Simple, (Label => None)))));
end case;
end pragma_g_0;
procedure pragma_g_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Statement_End)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Anchored_0, 3,
1))), (False, (Simple, (Anchored_0, 3, 0))), (False, (Simple, (Label => None)))));
end case;
end pragma_g_1;
procedure pragma_g_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Statement_End)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end pragma_g_2;
procedure primary_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, 3, 0)));
when Indent =>
null;
end case;
end primary_0;
procedure primary_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, (1 => (False, (Simple, (Language,
Ada_Indent_Aggregate'Access, Null_Args)))));
end case;
end primary_2;
procedure primary_4
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 1, 2)));
when Indent =>
null;
end case;
end primary_4;
procedure private_extension_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (12, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end private_extension_declaration_0;
procedure private_type_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (8, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))),
(False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple,
(Label => None))), (False, (Simple, (Label => None)))));
end case;
end private_type_declaration_0;
procedure procedure_call_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Hanging_0, (Label => None), (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end procedure_call_statement_0;
procedure procedure_specification_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Statement_Start)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 3);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
end case;
end procedure_specification_0;
function procedure_specification_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Propagate_Name (Nonterm, Tokens, 2);
end procedure_specification_0_check;
procedure protected_body_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Motion), (9, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 6);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (5, Empty_IDs) & (9, Empty_IDs)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 3, 2), (8, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))),
(False, (Simple, (Label => None))), (False, (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))),
(False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end protected_body_0;
function protected_body_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 3, 8, End_Names_Optional);
end protected_body_0_check;
procedure protected_body_stub_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end protected_body_stub_0;
procedure protected_definition_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, Motion)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (5, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end protected_definition_0;
function protected_definition_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Propagate_Name (Nonterm, Tokens, 5);
end protected_definition_0_check;
procedure protected_definition_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end protected_definition_1;
function protected_definition_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Propagate_Name (Nonterm, Tokens, 3);
end protected_definition_1_check;
procedure protected_type_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Motion), (9, Motion), (11,
Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 10);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (6, Empty_IDs) & (10, +49) & (11,
Empty_IDs)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end protected_type_declaration_0;
function protected_type_declaration_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 3, 10, End_Names_Optional);
end protected_type_declaration_0_check;
procedure protected_type_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Motion), (8, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 7);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (6, Empty_IDs) & (7, +49) & (8,
Empty_IDs)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))), (True, (Simple, (Label => None)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end protected_type_declaration_1;
function protected_type_declaration_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 3, 7, End_Names_Optional);
end protected_type_declaration_1_check;
procedure qualified_expression_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, 1, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (if Ada_Indent_Hanging_Rel_Exp then (Anchored_0, 1, Ada_Indent_Broken)
else (Anchored_1, 1, Ada_Indent_Broken))))));
end case;
end qualified_expression_0;
procedure quantified_expression_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 4, Ada_Indent_Broken)))));
end case;
end quantified_expression_0;
procedure raise_expression_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 3,
Ada_Indent_Broken)))));
end case;
end raise_expression_0;
procedure raise_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Motion), (5, Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 4);
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 3,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end raise_statement_0;
procedure raise_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end raise_statement_1;
procedure raise_statement_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_End)));
when Face =>
null;
when Indent =>
null;
end case;
end raise_statement_2;
procedure range_g_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Anchored_0, 4, 1))), (False, (Simple, (Anchored_0, 4, 0)))));
end case;
end range_g_0;
procedure record_definition_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple, (Language, Ada_Indent_Record_1'Access, 69
& 1 & 0)), (Simple, (Language, Ada_Indent_Record_1'Access, 69 & 1 & Ada_Indent))), (True, (Simple, (Language,
Ada_Indent_Record_1'Access, 69 & 1 & Ada_Indent)), (Simple, (Language, Ada_Indent_Record_1'Access, 69 & 1 &
Ada_Indent))), (False, (Simple, (Language, Ada_Indent_Record_1'Access, 69 & 1 & 0))), (False, (Simple, (Label
=> None)))));
end case;
end record_definition_0;
procedure record_representation_clause_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Statement_End)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 1, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Language,
Ada_Indent_Record_0'Access, 1 & 4 & 0))), (False, (Simple, (Language, Ada_Indent_Record_0'Access, 1 & 4 &
Ada_Indent))), (False, (Simple, (Language, Ada_Indent_Record_0'Access, 1 & 4 & Ada_Indent))), (False, (Simple,
(Language, Ada_Indent_Record_0'Access, 1 & 4 & 0))), (False, (Simple, (Label => None))), (False, (Simple,
(Label => None)))));
end case;
end record_representation_clause_0;
procedure requeue_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Statement_End)));
when Face =>
null;
when Indent =>
null;
end case;
end requeue_statement_0;
procedure requeue_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Statement_End)));
when Face =>
null;
when Indent =>
null;
end case;
end requeue_statement_1;
procedure result_profile_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1, 2)));
when Indent =>
Indent_Action_1 (Parse_Data, Tree, Nonterm, Tokens, 1, ((False, (Simple, (Label => None))), (False, (Simple,
(Anchored_3, 1, Ada_Indent_Broken))), (False, (Simple, (Anchored_3, 1, Ada_Indent_Broken)))));
end case;
end result_profile_0;
procedure result_profile_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_1 (Parse_Data, Tree, Nonterm, Tokens, 1, ((False, (Simple, (Label => None))), (False, (Simple,
(Anchored_4, 1, Ada_Indent_Broken)))));
end case;
end result_profile_1;
procedure selected_component_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Mark_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Prefix), (3, Suffix)));
when Indent =>
null;
end case;
end selected_component_0;
function selected_component_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Merge_Names (Nonterm, Tokens, 1, 3);
end selected_component_0_check;
procedure selected_component_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Mark_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Prefix)));
when Indent =>
null;
end case;
end selected_component_1;
procedure selected_component_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Mark_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Prefix)));
when Indent =>
null;
end case;
end selected_component_2;
function selected_component_2_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Merge_Names (Nonterm, Tokens, 1, 3);
end selected_component_2_check;
procedure selected_component_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Mark_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Prefix)));
when Indent =>
null;
end case;
end selected_component_3;
procedure selective_accept_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Motion), (7, Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 2);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 4);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (2, 43 & 72) & (3, Empty_IDs) & (7,
Empty_IDs)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple, (Label => None)), (Simple, (Int,
Ada_Indent))), (True, (Simple, (Label => None)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label =>
None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))),
(False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end selective_accept_0;
procedure selective_accept_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Statement_End)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (2, 43 & 72) & (5, Empty_IDs)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple, (Label => None)), (Simple, (Int,
Ada_Indent))), (True, (Simple, (Label => None)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label =>
None))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end selective_accept_1;
procedure select_alternative_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Motion)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent))),
(False, (Simple, (Int, Ada_Indent)))));
end case;
end select_alternative_0;
procedure select_alternative_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Motion), (4, Statement_Start), (5, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent))),
(False, (Simple, (Label => None)))));
end case;
end select_alternative_1;
procedure select_alternative_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Motion)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent)))));
end case;
end select_alternative_2;
procedure select_alternative_4
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_End)));
when Face =>
null;
when Indent =>
null;
end case;
end select_alternative_4;
procedure select_alternative_list_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, Motion)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent)))));
end case;
end select_alternative_list_0;
procedure select_alternative_list_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, (1 => (False, (Simple, (Int, Ada_Indent)))));
end case;
end select_alternative_list_1;
procedure simple_return_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 2);
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end simple_return_statement_0;
procedure simple_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_End)));
when Face =>
null;
when Indent =>
null;
end case;
end simple_statement_0;
procedure simple_statement_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Statement_End)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 0)));
when Indent =>
null;
end case;
end simple_statement_3;
procedure simple_statement_8
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Statement_End)));
when Face =>
null;
when Indent =>
null;
end case;
end simple_statement_8;
procedure single_protected_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Motion), (7, Motion), (9,
Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 8);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (4, Empty_IDs) & (7, Empty_IDs) & (8, +49)
& (9, Empty_IDs)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False,
(Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end single_protected_declaration_0;
function single_protected_declaration_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 2, 8, End_Names_Optional);
end single_protected_declaration_0_check;
procedure single_protected_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Motion), (6, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 5);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (4, Empty_IDs) & (5, +49) & (6,
Empty_IDs)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (True, (Simple, (Label => None)), (Simple,
(Int, Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end single_protected_declaration_1;
function single_protected_declaration_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 2, 5, End_Names_Optional);
end single_protected_declaration_1_check;
procedure single_task_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Motion), (7, Motion), (11,
Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 8);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (4, Empty_IDs) & (8, +49) & (11,
Empty_IDs)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 3, 2), (9, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False,
(Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Label => None)))));
end case;
end single_task_declaration_0;
function single_task_declaration_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 2, 10, End_Names_Optional);
end single_task_declaration_0_check;
procedure single_task_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Motion), (8, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 5);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (4, Empty_IDs) & (5, +49) & (8,
Empty_IDs)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 3, 2), (6, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (True, (Simple, (Label => None)), (Simple,
(Int, Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Label => None)))));
end case;
end single_task_declaration_1;
function single_task_declaration_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 2, 7, End_Names_Optional);
end single_task_declaration_1_check;
procedure single_task_declaration_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end single_task_declaration_2;
procedure subprogram_body_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_Override), (4,
Motion), (6, Motion), (10, Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 2, 4);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 4, 5);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 2, 7);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (2, 29 & 50) & (4, Empty_IDs) & (6,
Empty_IDs) & (10, Empty_IDs)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (9, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple,
(Label => None)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label =>
None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))),
(True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))), (False,
(Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end subprogram_body_0;
function subprogram_body_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 2, 9, End_Names_Optional);
end subprogram_body_0_check;
procedure subprogram_body_stub_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_Override), (6,
Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False,
(Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end subprogram_body_stub_0;
procedure subprogram_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_Override), (4,
Statement_End)));
when Face =>
null;
when Indent =>
null;
end case;
end subprogram_declaration_0;
procedure subprogram_default_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, 1, 1)));
when Indent =>
null;
end case;
end subprogram_default_0;
procedure subprogram_renaming_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_Override), (6,
Statement_End)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (4, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Language, Ada_Indent_Renames_0'Access, +2))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end subprogram_renaming_declaration_0;
function subprogram_specification_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Propagate_Name (Nonterm, Tokens, 1);
end subprogram_specification_0_check;
function subprogram_specification_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Propagate_Name (Nonterm, Tokens, 1);
end subprogram_specification_1_check;
procedure subtype_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end subtype_declaration_0;
procedure subtype_indication_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1, 2)));
when Indent =>
null;
end case;
end subtype_indication_0;
procedure subtype_indication_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1, 2)));
when Indent =>
null;
end case;
end subtype_indication_1;
procedure subtype_indication_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, 1, 2)));
when Indent =>
null;
end case;
end subtype_indication_2;
procedure subtype_indication_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, 1, 2)));
when Indent =>
null;
end case;
end subtype_indication_3;
procedure subunit_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Motion)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Anchored_0, 2, 1))), (False, (Simple, (Anchored_0, 2, 0))),
(False, (Simple, (Label => None)))));
end case;
end subunit_0;
procedure task_body_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Motion), (7, Motion), (11,
Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 6);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 8);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (5, Empty_IDs) & (7, Empty_IDs) & (11,
Empty_IDs)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 3, 2), (10, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False,
(Simple, (Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple,
(Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label
=> None))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end task_body_0;
function task_body_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 3, 10, End_Names_Optional);
end task_body_0_check;
procedure task_body_stub_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False,
(Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label =>
None)))));
end case;
end task_body_stub_0;
procedure task_definition_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, Motion)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 2, 3);
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent)))));
end case;
end task_definition_0;
procedure task_definition_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, (1 => (True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent)))));
end case;
end task_definition_1;
procedure task_type_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Motion), (9, Motion), (13,
Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 10);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (6, Empty_IDs) & (9, Empty_IDs) & (10,
+49) & (13, Empty_IDs)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 3, 2), (12, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Label => None)))));
end case;
end task_type_declaration_0;
function task_type_declaration_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 3, 12, End_Names_Optional);
end task_type_declaration_0_check;
procedure task_type_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Motion), (10,
Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 7);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Empty_IDs) & (6, Empty_IDs) & (7, +49) & (10,
Empty_IDs)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 3, 2), (9, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))), (True, (Simple, (Label => None)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple, (Label
=> None))), (False, (Simple, (Label => None)))));
end case;
end task_type_declaration_1;
function task_type_declaration_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 3, 9, End_Names_Optional);
end task_type_declaration_1_check;
procedure task_type_declaration_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end task_type_declaration_2;
procedure timed_entry_call_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Motion), (6, Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 2);
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 4);
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label =>
None))), (False, (Simple, (Label => None)))));
end case;
end timed_entry_call_0;
procedure variant_part_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Containing_Action (Parse_Data, Tree, Nonterm, Tokens, 1, 4);
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Int, Ada_Indent_When))),
(False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end variant_part_0;
procedure variant_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Motion)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Hanging_0,
(Label => None), (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent))), (True, (Simple, (Int,
Ada_Indent)), (Simple, (Int, Ada_Indent)))));
end case;
end variant_0;
procedure use_clause_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Statement_End)));
when Face =>
Face_Apply_List_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (4, 1, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Use))), (False, (Simple, (Label => None)))));
end case;
end use_clause_0;
procedure use_clause_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Statement_End)));
when Face =>
Face_Apply_List_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Use))), (False, (Simple, (Label => None)))));
end case;
end use_clause_1;
procedure use_clause_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Statement_End)));
when Face =>
Face_Apply_List_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Use))), (False, (Simple, (Label => None)))));
end case;
end use_clause_2;
procedure with_clause_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Statement_End)));
when Face =>
Face_Apply_List_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (4, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_With))), (False, (Simple, (Label => None)))));
end case;
end with_clause_0;
procedure with_clause_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Statement_End)));
when Face =>
Face_Apply_List_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_With))), (False, (Simple, (Label => None)))));
end case;
end with_clause_1;
procedure with_clause_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Statement_End)));
when Face =>
Face_Apply_List_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_With))), (False, (Simple, (Label => None)))));
end case;
end with_clause_2;
procedure with_clause_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Statement_End)));
when Face =>
Face_Apply_List_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_With))), (False, (Simple, (Label => None)))));
end case;
end with_clause_3;
end Ada_Process_Actions;
|
flyx/OpenGLAda | Ada | 5,048 | adb | -- part of OpenGLAda, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "COPYING"
with Ada.Text_IO;
with GL.Attributes;
with GL.Buffers;
with GL.Files;
with GL.Objects.Buffers;
with GL.Objects.Shaders;
with GL.Objects.Programs;
with GL.Objects.Vertex_Arrays;
with GL.Types.Colors;
with GL_Test.Display_Backend;
procedure GL_Test.OpenGL3 is
use GL.Buffers;
use GL.Types;
use GL.Objects.Vertex_Arrays;
procedure Load_Vectors is new GL.Objects.Buffers.Load_To_Buffer
(Singles.Vector3_Pointers);
procedure Load_Colors is new GL.Objects.Buffers.Load_To_Buffer
(Colors.Basic_Color_Pointers);
procedure Load_Data (Array1, Array2 : Vertex_Array_Object;
Buffer1, Buffer2, Buffer3 : GL.Objects.Buffers.Buffer) is
use GL.Objects.Buffers;
Triangle1 : constant Singles.Vector3_Array
:= ((-0.3, 0.5, -1.0),
(-0.8, -0.5, -1.0),
(0.2, -0.5, -1.0));
Triangle2 : constant Singles.Vector3_Array
:= ((-0.2, 0.5, -1.0),
(0.3, -0.5, -1.0),
(0.8, 0.5, -1.0));
Color_Array : constant Colors.Basic_Color_Array
:= ((1.0, 0.0, 0.0),
(0.0, 1.0, 0.0),
(0.0, 0.0, 1.0));
begin
-- First vertex array object: Colored vertices
Array1.Bind;
Array_Buffer.Bind (Buffer1);
Load_Vectors (Array_Buffer, Triangle1, Static_Draw);
GL.Attributes.Set_Vertex_Attrib_Pointer (0, 3, Single_Type, False, 0, 0);
GL.Attributes.Enable_Vertex_Attrib_Array (0);
Array_Buffer.Bind (Buffer2);
Load_Colors (Array_Buffer, Color_Array, Static_Draw);
GL.Attributes.Set_Vertex_Attrib_Pointer (1, 3, Single_Type, False, 0, 0);
GL.Attributes.Enable_Vertex_Attrib_Array (1);
-- Second vertex array object: Only vertices
Array2.Bind;
Array_Buffer.Bind (Buffer3);
Load_Vectors (Array_Buffer, Triangle2, Static_Draw);
GL.Attributes.Set_Vertex_Attrib_Pointer (0, 3, Single_Type, False, 0, 0);
GL.Attributes.Enable_Vertex_Attrib_Array (0);
end Load_Data;
procedure Load_Shaders (Program : out GL.Objects.Programs.Program) is
Vertex_Shader : GL.Objects.Shaders.Shader
(Kind => GL.Objects.Shaders.Vertex_Shader);
Fragment_Shader : GL.Objects.Shaders.Shader
(Kind => GL.Objects.Shaders.Fragment_Shader);
begin
Vertex_Shader.Initialize_Id;
Fragment_Shader.Initialize_Id;
Program.Initialize_Id;
-- load shader sources and compile shaders
GL.Files.Load_Shader_Source_From_File
(Vertex_Shader, "../src/gl/gl_test-opengl3-vertex.glsl");
GL.Files.Load_Shader_Source_From_File
(Fragment_Shader, "../src/gl/gl_test-opengl3-fragment.glsl");
Vertex_Shader.Compile;
Fragment_Shader.Compile;
if not Vertex_Shader.Compile_Status then
Ada.Text_IO.Put_Line ("Compilation of vertex shader failed. log:");
Ada.Text_IO.Put_Line (Vertex_Shader.Info_Log);
end if;
if not Fragment_Shader.Compile_Status then
Ada.Text_IO.Put_Line ("Compilation of fragment shader failed. log:");
Ada.Text_IO.Put_Line (Fragment_Shader.Info_Log);
end if;
-- set up program
Program.Attach (Vertex_Shader);
Program.Attach (Fragment_Shader);
Program.Bind_Attrib_Location (0, "in_Position");
Program.Bind_Attrib_Location (1, "in_Color");
Program.Link;
if not Program.Link_Status then
Ada.Text_IO.Put_Line ("Program linking failed. Log:");
Ada.Text_IO.Put_Line (Program.Info_Log);
return;
end if;
Program.Use_Program;
end Load_Shaders;
Program : GL.Objects.Programs.Program;
Vector_Buffer1, Vector_Buffer2, Color_Buffer : GL.Objects.Buffers.Buffer;
Array1, Array2 : GL.Objects.Vertex_Arrays.Vertex_Array_Object;
begin
Display_Backend.Init;
Display_Backend.Configure_Minimum_OpenGL_Version (Major => 3, Minor => 2);
Display_Backend.Open_Window (Width => 500, Height => 500);
Ada.Text_IO.Put_Line ("Initialized GLFW window");
Vector_Buffer1.Initialize_Id;
Vector_Buffer2.Initialize_Id;
Color_Buffer.Initialize_Id;
Array1.Initialize_Id;
Array2.Initialize_Id;
Ada.Text_IO.Put_Line ("Initialized objects");
Load_Shaders (Program);
Ada.Text_IO.Put_Line ("Loaded shaders");
Load_Data (Array1, Array2, Vector_Buffer1, Color_Buffer, Vector_Buffer2);
Ada.Text_IO.Put_Line ("Loaded data");
while Display_Backend.Window_Opened loop
Clear (Buffer_Bits'(Color => True, Depth => True, others => False));
Array1.Bind;
GL.Objects.Vertex_Arrays.Draw_Arrays (Triangles, 0, 3);
Array2.Bind;
GL.Attributes.Set_Single (1, 1.0, 0.0, 0.0);
GL.Objects.Vertex_Arrays.Draw_Arrays (Triangles, 0, 3);
GL.Objects.Vertex_Arrays.Null_Array_Object.Bind;
GL.Flush;
Display_Backend.Swap_Buffers;
Display_Backend.Poll_Events;
end loop;
Display_Backend.Shutdown;
end GL_Test.OpenGL3;
|
notdb/LC-Practice | Ada | 371 | adb | with Ada.Text_IO; use Ada.Text_IO;
procedure Greet2 is
begin
loop
Put_Line ("Please enter your name: ");
declare
Name : String := Get_Line;
-- ^ Call to the Get_Line function
begin
exit when Name = "";
Put_line ("Hi " & Name & "!");
end;
-- Name is undefined here
end loop;
Put_Line ("Bye!");
end Greet2;
|
reznikmm/matreshka | Ada | 4,027 | ads | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Open Document Toolkit --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2014, Vadim Godunko <[email protected]> --
-- 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 ODF.DOM.Table_Cell_Address_Attributes;
package Matreshka.ODF_Table.Cell_Address_Attributes is
type Table_Cell_Address_Attribute_Node is
new Matreshka.ODF_Table.Abstract_Table_Attribute_Node
and ODF.DOM.Table_Cell_Address_Attributes.ODF_Table_Cell_Address_Attribute
with null record;
overriding function Create
(Parameters : not null access Matreshka.DOM_Attributes.Attribute_L2_Parameters)
return Table_Cell_Address_Attribute_Node;
overriding function Get_Local_Name
(Self : not null access constant Table_Cell_Address_Attribute_Node)
return League.Strings.Universal_String;
end Matreshka.ODF_Table.Cell_Address_Attributes;
|
AdaCore/Ada_Drivers_Library | Ada | 2,799 | adb | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015, 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 System.Machine_Code; use System.Machine_Code;
package body Memory_Barriers is
----------------------------------
-- Data_Synchronization_Barrier --
----------------------------------
procedure Data_Synchronization_Barrier is
pragma Suppress (All_Checks);
begin
Asm ("DSB #0xF", Volatile => True); -- 15 is 'Sy", ie "full system"
end Data_Synchronization_Barrier;
end Memory_Barriers;
|
mirror/ncurses | Ada | 3,780 | adb | ------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding --
-- --
-- Terminal_Interface.Curses.Text_IO.Modular_IO --
-- --
-- B O D Y --
-- --
------------------------------------------------------------------------------
-- Copyright 2020 Thomas E. Dickey --
-- Copyright 1999-2003,2009 Free Software Foundation, Inc. --
-- --
-- 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, distribute with modifications, 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 ABOVE 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. --
-- --
-- Except as contained in this notice, the name(s) of the above copyright --
-- holders shall not be used in advertising or otherwise to promote the --
-- sale, use or other dealings in this Software without prior written --
-- authorization. --
------------------------------------------------------------------------------
-- Author: Juergen Pfeifer, 1996
-- Version Control:
-- $Revision: 1.12 $
-- Binding Version 01.00
------------------------------------------------------------------------------
with Ada.Text_IO;
with Terminal_Interface.Curses.Text_IO.Aux;
package body Terminal_Interface.Curses.Text_IO.Modular_IO is
package Aux renames Terminal_Interface.Curses.Text_IO.Aux;
package MIO is new Ada.Text_IO.Modular_IO (Num);
procedure Put
(Win : Window;
Item : Num;
Width : Field := Default_Width;
Base : Number_Base := Default_Base)
is
Buf : String (1 .. Field'Last);
begin
MIO.Put (Buf, Item, Base);
Aux.Put_Buf (Win, Buf, Width);
end Put;
procedure Put
(Item : Num;
Width : Field := Default_Width;
Base : Number_Base := Default_Base)
is
begin
Put (Get_Window, Item, Width, Base);
end Put;
end Terminal_Interface.Curses.Text_IO.Modular_IO;
|
reznikmm/matreshka | Ada | 6,900 | adb | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Open Document Toolkit --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2014, Vadim Godunko <[email protected]> --
-- 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.DOM_Documents;
with Matreshka.ODF_String_Constants;
with ODF.DOM.Iterators;
with ODF.DOM.Visitors;
package body Matreshka.ODF_Anim.AnimateColor_Elements is
------------
-- Create --
------------
overriding function Create
(Parameters : not null access Matreshka.DOM_Elements.Element_L2_Parameters)
return Anim_AnimateColor_Element_Node is
begin
return Self : Anim_AnimateColor_Element_Node do
Matreshka.ODF_Anim.Constructors.Initialize
(Self'Unchecked_Access,
Parameters.Document,
Matreshka.ODF_String_Constants.Anim_Prefix);
end return;
end Create;
----------------
-- Enter_Node --
----------------
overriding procedure Enter_Node
(Self : not null access Anim_AnimateColor_Element_Node;
Visitor : in out XML.DOM.Visitors.Abstract_Visitor'Class;
Control : in out XML.DOM.Visitors.Traverse_Control) is
begin
if Visitor in ODF.DOM.Visitors.Abstract_ODF_Visitor'Class then
ODF.DOM.Visitors.Abstract_ODF_Visitor'Class
(Visitor).Enter_Anim_AnimateColor
(ODF.DOM.Anim_AnimateColor_Elements.ODF_Anim_AnimateColor_Access
(Self),
Control);
else
Matreshka.DOM_Elements.Abstract_Element_Node
(Self.all).Enter_Node (Visitor, Control);
end if;
end Enter_Node;
--------------------
-- Get_Local_Name --
--------------------
overriding function Get_Local_Name
(Self : not null access constant Anim_AnimateColor_Element_Node)
return League.Strings.Universal_String
is
pragma Unreferenced (Self);
begin
return Matreshka.ODF_String_Constants.AnimateColor_Element;
end Get_Local_Name;
----------------
-- Leave_Node --
----------------
overriding procedure Leave_Node
(Self : not null access Anim_AnimateColor_Element_Node;
Visitor : in out XML.DOM.Visitors.Abstract_Visitor'Class;
Control : in out XML.DOM.Visitors.Traverse_Control) is
begin
if Visitor in ODF.DOM.Visitors.Abstract_ODF_Visitor'Class then
ODF.DOM.Visitors.Abstract_ODF_Visitor'Class
(Visitor).Leave_Anim_AnimateColor
(ODF.DOM.Anim_AnimateColor_Elements.ODF_Anim_AnimateColor_Access
(Self),
Control);
else
Matreshka.DOM_Elements.Abstract_Element_Node
(Self.all).Leave_Node (Visitor, Control);
end if;
end Leave_Node;
----------------
-- Visit_Node --
----------------
overriding procedure Visit_Node
(Self : not null access Anim_AnimateColor_Element_Node;
Iterator : in out XML.DOM.Visitors.Abstract_Iterator'Class;
Visitor : in out XML.DOM.Visitors.Abstract_Visitor'Class;
Control : in out XML.DOM.Visitors.Traverse_Control) is
begin
if Iterator in ODF.DOM.Iterators.Abstract_ODF_Iterator'Class then
ODF.DOM.Iterators.Abstract_ODF_Iterator'Class
(Iterator).Visit_Anim_AnimateColor
(Visitor,
ODF.DOM.Anim_AnimateColor_Elements.ODF_Anim_AnimateColor_Access
(Self),
Control);
else
Matreshka.DOM_Elements.Abstract_Element_Node
(Self.all).Visit_Node (Iterator, Visitor, Control);
end if;
end Visit_Node;
begin
Matreshka.DOM_Documents.Register_Element
(Matreshka.ODF_String_Constants.Anim_URI,
Matreshka.ODF_String_Constants.AnimateColor_Element,
Anim_AnimateColor_Element_Node'Tag);
end Matreshka.ODF_Anim.AnimateColor_Elements;
|
sungyeon/drake | Ada | 315 | ads | pragma License (Unrestricted);
with Ada.Numerics.Generic_Complex_Elementary_Functions;
with Ada.Numerics.Short_Complex_Types;
package Ada.Numerics.Short_Complex_Elementary_Functions is
new Generic_Complex_Elementary_Functions (Short_Complex_Types);
pragma Pure (Ada.Numerics.Short_Complex_Elementary_Functions);
|
zhmu/ananas | Ada | 7,677 | ads | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . S T R I N G S . U T F _ E N C O D I N G --
-- --
-- S p e c --
-- --
-- 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. --
-- --
-- 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 is one of the Ada 2012 package defined in AI05-0137-1. It is a parent
-- package that contains declarations used in the child packages for handling
-- UTF encoded strings. Note: this package is consistent with Ada 95, and may
-- be used in Ada 95 or Ada 2005 mode.
with Interfaces;
with Unchecked_Conversion;
package Ada.Strings.UTF_Encoding is
pragma Pure (UTF_Encoding);
subtype UTF_String is String;
-- Used to represent a string of 8-bit values containing a sequence of
-- values encoded in one of three ways (UTF-8, UTF-16BE, or UTF-16LE).
-- Typically used in connection with a Scheme parameter indicating which
-- of the encodings applies. This is not strictly a String value in the
-- sense defined in the Ada RM, but in practice type String accommodates
-- all possible 256 codes, and can be used to hold any sequence of 8-bit
-- codes. We use String directly rather than create a new type so that
-- all existing facilities for manipulating type String (e.g. the child
-- packages of Ada.Strings) are available for manipulation of UTF_Strings.
type Encoding_Scheme is (UTF_8, UTF_16BE, UTF_16LE);
-- Used to specify which of three possible encodings apply to a UTF_String
subtype UTF_8_String is String;
-- Similar to UTF_String but specifically represents a UTF-8 encoded string
subtype UTF_16_Wide_String is Wide_String;
-- This is similar to UTF_8_String but is used to represent a Wide_String
-- value which is a sequence of 16-bit values encoded using UTF-16. Again
-- this is not strictly a Wide_String in the sense of the Ada RM, but the
-- type Wide_String can be used to represent a sequence of arbitrary 16-bit
-- values, and it is more convenient to use Wide_String than a new type.
Encoding_Error : exception;
-- This exception is raised in the following situations:
-- a) A UTF encoded string contains an invalid encoding sequence
-- b) A UTF-16BE or UTF-16LE input string has an odd length
-- c) An incorrect character value is present in the Input string
-- d) The result for a Wide_Character output exceeds 16#FFFF#
-- The exception message has the index value where the error occurred.
-- The BOM (BYTE_ORDER_MARK) values defined here are used at the start of
-- a string to indicate the encoding. The convention in this package is
-- that on input a correct BOM is ignored and an incorrect BOM causes an
-- Encoding_Error exception. On output, the output string may or may not
-- include a BOM depending on the setting of Output_BOM.
BOM_8 : constant UTF_8_String :=
Character'Val (16#EF#) &
Character'Val (16#BB#) &
Character'Val (16#BF#);
BOM_16BE : constant UTF_String :=
Character'Val (16#FE#) &
Character'Val (16#FF#);
BOM_16LE : constant UTF_String :=
Character'Val (16#FF#) &
Character'Val (16#FE#);
BOM_16 : constant UTF_16_Wide_String :=
[Wide_Character'Val (16#FEFF#)];
function Encoding
(Item : UTF_String;
Default : Encoding_Scheme := UTF_8) return Encoding_Scheme;
-- This function inspects a UTF_String value to determine whether it
-- starts with a BOM for UTF-8, UTF-16BE, or UTF_16LE. If so, the result
-- is the scheme corresponding to the BOM. If no valid BOM is present
-- then the result is the specified Default value.
private
function To_Unsigned_8 is new
Unchecked_Conversion (Character, Interfaces.Unsigned_8);
function To_Unsigned_16 is new
Unchecked_Conversion (Wide_Character, Interfaces.Unsigned_16);
function To_Unsigned_32 is new
Unchecked_Conversion (Wide_Wide_Character, Interfaces.Unsigned_32);
subtype UTF_XE_Encoding is Encoding_Scheme range UTF_16BE .. UTF_16LE;
-- Subtype containing only UTF_16BE and UTF_16LE entries
-- Utility routines for converting between UTF-16 and UTF-16LE/BE
function From_UTF_16
(Item : UTF_16_Wide_String;
Output_Scheme : UTF_XE_Encoding;
Output_BOM : Boolean := False) return UTF_String;
-- The input string Item is encoded in UTF-16. The output is encoded using
-- Output_Scheme (which is either UTF-16LE or UTF-16BE). There are no error
-- cases. The output starts with BOM_16BE/LE if Output_BOM is True.
function To_UTF_16
(Item : UTF_String;
Input_Scheme : UTF_XE_Encoding;
Output_BOM : Boolean := False) return UTF_16_Wide_String;
-- The input string Item is encoded using Input_Scheme which is either
-- UTF-16LE or UTF-16BE. The output is the corresponding UTF_16 wide
-- string. Encoding error is raised if the length of the input is odd.
-- The output starts with BOM_16 if Output_BOM is True.
procedure Raise_Encoding_Error (Index : Natural);
pragma No_Return (Raise_Encoding_Error);
-- Raise Encoding_Error exception for bad encoding in input item. The
-- parameter Index is the index of the location in Item for the error.
end Ada.Strings.UTF_Encoding;
|
reznikmm/matreshka | Ada | 3,694 | ads | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Open Document Toolkit --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2014, Vadim Godunko <[email protected]> --
-- 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 XML.DOM.Elements;
package ODF.DOM.Presentation_Header_Elements is
pragma Preelaborate;
type ODF_Presentation_Header is limited interface
and XML.DOM.Elements.DOM_Element;
type ODF_Presentation_Header_Access is
access all ODF_Presentation_Header'Class
with Storage_Size => 0;
end ODF.DOM.Presentation_Header_Elements;
|
HeisenbugLtd/flac-ada | Ada | 3,384 | adb | ------------------------------------------------------------------------------
-- Copyright (C) 2020 by Heisenbug Ltd. ([email protected])
--
-- 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);
with Ada.Streams.Stream_IO;
with SPARK_Stream_IO;
with System;
package body FLAC.Headers.Meta_Data with
SPARK_Mode => On
is
type Unsigned_7 is range 0 .. 127
with
Size => 7,
Object_Size => 8;
---------------------------------------------------------------------------
-- To_Block_Type
---------------------------------------------------------------------------
procedure To_Block_Type (Source : in Unsigned_7;
Target : out Types.Block_Type;
Error : out Boolean)
with
Relaxed_Initialization => Target,
Depends => (Error => Source,
Target => Source),
Post => (if not Error then Target'Initialized);
---------------------------------------------------------------------------
-- Read
---------------------------------------------------------------------------
procedure Read (File : in Ada.Streams.Stream_IO.File_Type;
Item : out T;
Error : out Boolean)
is
Raw_Data : Ada.Streams.Stream_Element_Array (1 .. Meta_Data_Length);
BT : Types.Block_Type;
use type Ada.Streams.Stream_Element;
use type Types.Length_24;
begin
SPARK_Stream_IO.Read (File => File,
Item => Raw_Data,
Error => Error);
if Error then
return;
end if;
To_Block_Type (Source => Unsigned_7 (Raw_Data (1) and 2#0111_1111#),
Target => BT,
Error => Error);
if Error then
return;
end if;
Item.Last := (Raw_Data (1) and 2#1000_0000#) /= 0;
Item.Block_Type := BT;
Item.Length :=
Types.Length_24 (Raw_Data (2)) * 256 ** 2 +
Types.Length_24 (Raw_Data (3)) * 256 +
Types.Length_24 (Raw_Data (4));
end Read;
---------------------------------------------------------------------------
-- To_Block_Type
---------------------------------------------------------------------------
procedure To_Block_Type (Source : in Unsigned_7;
Target : out Types.Block_Type;
Error : out Boolean)
with
SPARK_Mode => Off
is
function Raw_Convert is
new Ada.Unchecked_Conversion (Source => Unsigned_7,
Target => Types.Block_Type);
use type Types.Block_Type;
begin
Target := Raw_Convert (S => Source);
if not Target'Valid then
Target := Types.Padding; -- We ignore all of those, so pretend
-- they are just padding.
end if;
-- This one we should never read. If we do the file is corrupt.
Error := Target = Types.Invalid;
end To_Block_Type;
end FLAC.Headers.Meta_Data;
|
ekoeppen/STM32_Generic_Ada_Drivers | Ada | 129 | adb | with STM32GD.Startup;
package body STM32GD.Board is
procedure Init is
begin
null;
end Init;
end STM32GD.Board;
|
osannolik/Ada_Drivers_Library | Ada | 7,943 | ads | -- This spec has been automatically generated from STM32F446x.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.EXTI is
pragma Preelaborate;
---------------
-- Registers --
---------------
-- IMR_MR array
type IMR_MR_Field_Array is array (0 .. 22) of Boolean
with Component_Size => 1, Size => 23;
-- Type definition for IMR_MR
type IMR_MR_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- MR as a value
Val : HAL.UInt23;
when True =>
-- MR as an array
Arr : IMR_MR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 23;
for IMR_MR_Field use record
Val at 0 range 0 .. 22;
Arr at 0 range 0 .. 22;
end record;
-- Interrupt mask register (EXTI_IMR)
type IMR_Register is record
-- Interrupt Mask on line 0
MR : IMR_MR_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_23_31 : HAL.UInt9 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IMR_Register use record
MR at 0 range 0 .. 22;
Reserved_23_31 at 0 range 23 .. 31;
end record;
-- EMR_MR array
type EMR_MR_Field_Array is array (0 .. 22) of Boolean
with Component_Size => 1, Size => 23;
-- Type definition for EMR_MR
type EMR_MR_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- MR as a value
Val : HAL.UInt23;
when True =>
-- MR as an array
Arr : EMR_MR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 23;
for EMR_MR_Field use record
Val at 0 range 0 .. 22;
Arr at 0 range 0 .. 22;
end record;
-- Event mask register (EXTI_EMR)
type EMR_Register is record
-- Event Mask on line 0
MR : EMR_MR_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_23_31 : HAL.UInt9 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EMR_Register use record
MR at 0 range 0 .. 22;
Reserved_23_31 at 0 range 23 .. 31;
end record;
-- RTSR_TR array
type RTSR_TR_Field_Array is array (0 .. 22) of Boolean
with Component_Size => 1, Size => 23;
-- Type definition for RTSR_TR
type RTSR_TR_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- TR as a value
Val : HAL.UInt23;
when True =>
-- TR as an array
Arr : RTSR_TR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 23;
for RTSR_TR_Field use record
Val at 0 range 0 .. 22;
Arr at 0 range 0 .. 22;
end record;
-- Rising Trigger selection register (EXTI_RTSR)
type RTSR_Register is record
-- Rising trigger event configuration of line 0
TR : RTSR_TR_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_23_31 : HAL.UInt9 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for RTSR_Register use record
TR at 0 range 0 .. 22;
Reserved_23_31 at 0 range 23 .. 31;
end record;
-- FTSR_TR array
type FTSR_TR_Field_Array is array (0 .. 22) of Boolean
with Component_Size => 1, Size => 23;
-- Type definition for FTSR_TR
type FTSR_TR_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- TR as a value
Val : HAL.UInt23;
when True =>
-- TR as an array
Arr : FTSR_TR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 23;
for FTSR_TR_Field use record
Val at 0 range 0 .. 22;
Arr at 0 range 0 .. 22;
end record;
-- Falling Trigger selection register (EXTI_FTSR)
type FTSR_Register is record
-- Falling trigger event configuration of line 0
TR : FTSR_TR_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_23_31 : HAL.UInt9 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for FTSR_Register use record
TR at 0 range 0 .. 22;
Reserved_23_31 at 0 range 23 .. 31;
end record;
-- SWIER array
type SWIER_Field_Array is array (0 .. 22) of Boolean
with Component_Size => 1, Size => 23;
-- Type definition for SWIER
type SWIER_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- SWIER as a value
Val : HAL.UInt23;
when True =>
-- SWIER as an array
Arr : SWIER_Field_Array;
end case;
end record
with Unchecked_Union, Size => 23;
for SWIER_Field use record
Val at 0 range 0 .. 22;
Arr at 0 range 0 .. 22;
end record;
-- Software interrupt event register (EXTI_SWIER)
type SWIER_Register is record
-- Software Interrupt on line 0
SWIER : SWIER_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_23_31 : HAL.UInt9 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SWIER_Register use record
SWIER at 0 range 0 .. 22;
Reserved_23_31 at 0 range 23 .. 31;
end record;
-- PR array
type PR_Field_Array is array (0 .. 22) of Boolean
with Component_Size => 1, Size => 23;
-- Type definition for PR
type PR_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- PR as a value
Val : HAL.UInt23;
when True =>
-- PR as an array
Arr : PR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 23;
for PR_Field use record
Val at 0 range 0 .. 22;
Arr at 0 range 0 .. 22;
end record;
-- Pending register (EXTI_PR)
type PR_Register is record
-- Pending bit 0
PR : PR_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_23_31 : HAL.UInt9 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for PR_Register use record
PR at 0 range 0 .. 22;
Reserved_23_31 at 0 range 23 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- External interrupt/event controller
type EXTI_Peripheral is record
-- Interrupt mask register (EXTI_IMR)
IMR : aliased IMR_Register;
-- Event mask register (EXTI_EMR)
EMR : aliased EMR_Register;
-- Rising Trigger selection register (EXTI_RTSR)
RTSR : aliased RTSR_Register;
-- Falling Trigger selection register (EXTI_FTSR)
FTSR : aliased FTSR_Register;
-- Software interrupt event register (EXTI_SWIER)
SWIER : aliased SWIER_Register;
-- Pending register (EXTI_PR)
PR : aliased PR_Register;
end record
with Volatile;
for EXTI_Peripheral use record
IMR at 16#0# range 0 .. 31;
EMR at 16#4# range 0 .. 31;
RTSR at 16#8# range 0 .. 31;
FTSR at 16#C# range 0 .. 31;
SWIER at 16#10# range 0 .. 31;
PR at 16#14# range 0 .. 31;
end record;
-- External interrupt/event controller
EXTI_Periph : aliased EXTI_Peripheral
with Import, Address => System'To_Address (16#40013C00#);
end STM32_SVD.EXTI;
|
kleopatra999/sdlada | Ada | 2,260 | adb | --------------------------------------------------------------------------------------------------------------------
-- Copyright (c) 2014 Luke A. Guest
--
-- This software is provided 'as-is', without any express or implied
-- warranty. In no event will the authors be held liable for any damages
-- arising from the use of this software.
--
-- Permission is granted to anyone to use this software for any purpose,
-- including commercial applications, and to alter it and redistribute it
-- freely, subject to the following restrictions:
--
-- 1. The origin of this software must not be misrepresented; you must not
-- claim that you wrote the original software. If you use this software
-- in a product, an acknowledgment in the product documentation would be
-- appreciated but is not required.
--
-- 2. Altered source versions must be plainly marked as such, and must not be
-- misrepresented as being the original software.
--
-- 3. This notice may not be removed or altered from any source
-- distribution.
--------------------------------------------------------------------------------------------------------------------
package body SDL.Events.Joysticks is
type Event_States is (Query,
Ignore,
Enable) with
Convention => C;
for Event_States use (Query => -1,
Ignore => 0,
Enable => 1);
function SDL_Joystick_Event_State (State : in Event_States) return SDL_Bool with
Import => True,
Convention => C,
External_Name => "SDL_JoystickEventState";
procedure SDL_Joystick_Event_State (State : in Event_States) with
Import => True,
Convention => C,
External_Name => "SDL_JoystickEventState";
function Is_Polling_Enabled return Boolean is
Result : SDL_Bool := SDL_Joystick_Event_State (Query);
begin
if Result = SDL_True then
return True;
end if;
return False;
end Is_Polling_Enabled;
procedure Enable_Polling is
begin
SDL_Joystick_Event_State (Enable);
end Enable_Polling;
procedure Disable_Polling is
begin
SDL_Joystick_Event_State (Enable);
end Disable_Polling;
end SDL.Events.Joysticks;
|
pchapin/acrypto | Ada | 1,542 | ads | ---------------------------------------------------------------------------
-- FILE : aco-octuple_octet_operations.ads
-- SUBJECT : Intrinsic and related operations for ACO.Octuple_Octet
-- AUTHOR : (C) Copyright 2014 by Peter Chapin
--
-- Please send comments or bug reports to
--
-- Peter Chapin <[email protected]>
---------------------------------------------------------------------------
pragma SPARK_Mode(On);
package ACO.Octuple_Octet_Operations is
function Shift_Left(Value : ACO.Octuple_Octet; Count : Natural) return ACO.Octuple_Octet
with
Import,
Convention => Intrinsic,
Global => null;
function Shift_Right(Value : ACO.Octuple_Octet; Count : Natural) return ACO.Octuple_Octet
with
Import,
Convention => Intrinsic,
Global => null,
Post => Shift_Right'Result = Value / (2**Count);
function Rotate_Left(Value : ACO.Octuple_Octet; Count : Natural) return ACO.Octuple_Octet
with
Import,
Convention => Intrinsic,
Global => null;
function Rotate_Right(Value : ACO.Octuple_Octet; Count : Natural) return ACO.Octuple_Octet
with
Import,
Convention => Intrinsic,
Global => null;
procedure Xor_Array
(Accumulator : in out ACO.Octuple_Octet_Array;
Incoming : in ACO.Octuple_Octet_Array;
Success_Flag : out Boolean)
with
Depends => ((Accumulator, Success_Flag) => (Accumulator, Incoming));
end ACO.Octuple_Octet_Operations;
|
MinimSecure/unum-sdk | Ada | 832 | adb | -- Copyright 2013-2019 Free Software Foundation, Inc.
--
-- This program 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.
--
-- This program 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 this program. If not, see <http://www.gnu.org/licenses/>.
with Caller; use Caller;
procedure Foo is
Num : Float := 99.0;
begin
Verbose_Increment (Num, "Foo");
end Foo;
|
reznikmm/matreshka | Ada | 3,649 | ads | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Open Document Toolkit --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2014, Vadim Godunko <[email protected]> --
-- 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 XML.DOM.Elements;
package ODF.DOM.Anim_Audio_Elements is
pragma Preelaborate;
type ODF_Anim_Audio is limited interface
and XML.DOM.Elements.DOM_Element;
type ODF_Anim_Audio_Access is
access all ODF_Anim_Audio'Class
with Storage_Size => 0;
end ODF.DOM.Anim_Audio_Elements;
|
faelys/ada-syslog | Ada | 2,377 | adb | ------------------------------------------------------------------------------
-- Copyright (c) 2014, Natacha Porté --
-- --
-- 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. --
------------------------------------------------------------------------------
with Ada.Command_Line;
with Ada.Text_IO;
with Syslog.Guess.App_Name;
with Syslog.Guess.Hostname;
with Syslog.Transport.Send_Task;
with Syslog.Transport.UDP;
procedure Logger is
begin
Syslog.Guess.App_Name;
Syslog.Guess.Hostname;
Syslog.Transport.Send_Task.Set_Backend (Syslog.Transport.UDP.Transport);
Syslog.Set_Transport (Syslog.Transport.Send_Task.Transport);
case Ada.Command_Line.Argument_Count is
when 1 =>
Syslog.Transport.UDP.Connect ("127.0.0.1");
Syslog.Log (Syslog.Severities.Notice, Ada.Command_Line.Argument (1));
when 2 =>
Syslog.Transport.UDP.Connect (Ada.Command_Line.Argument (1));
Syslog.Log (Syslog.Severities.Notice, Ada.Command_Line.Argument (2));
when 3 =>
Syslog.Transport.UDP.Connect
(Ada.Command_Line.Argument (1),
Natural'Value (Ada.Command_Line.Argument (2)));
Syslog.Log (Syslog.Severities.Notice, Ada.Command_Line.Argument (3));
when others =>
Ada.Text_IO.Put_Line
(Ada.Text_IO.Current_Error,
"Usage: " & Ada.Command_Line.Command_Name
& " [target-host [port]] message");
end case;
end Logger;
|
reznikmm/increment | Ada | 3,921 | ads | -- Copyright (c) 2015-2017 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with League.Strings.Cursors.Characters;
with Incr.Documents;
with Incr.Lexers.Batch_Lexers;
with Incr.Nodes.Tokens;
with Incr.Version_Trees;
package Incr.Lexers.Incremental is
-- @summary
-- Incremental Lexer
--
-- @description
-- This package provides incremental lexical analyser and related types.
--
-- The lexer uses three versions of the document:
--
-- * Reference - version when last analysis completed
-- * Changing - current version under construction
-- * Previous - last read-olny version of document to be analyzed
--
-- Workflow of this lexer includes next steps:
--
-- * call Prepare_Document to explicitly mark tokens to start re-lexing
-- * find first marked token using Nested_Changes property
-- * get new token by call First_New_Token
-- * continue calling Next_New_Token until Is_Synchronized
-- * now new stream of token in sync with old one at Synchronized_Token
-- * look for next marked token from here and continue from step 3
--
type Incremental_Lexer is tagged limited private;
-- Type to perform incremental lexical analysis
type Incremental_Lexer_Access is access all Incremental_Lexer;
not overriding procedure Set_Batch_Lexer
(Self : in out Incremental_Lexer;
Lexer : Batch_Lexers.Batch_Lexer_Access);
-- Assign batch lexer to Self.
not overriding procedure Prepare_Document
(Self : in out Incremental_Lexer;
Document : Documents.Document_Access;
Reference : Version_Trees.Version);
-- Start analysis by looking for tokens where re-lexing should be start.
-- Mark them with Need_Analysis flag.
not overriding function First_New_Token
(Self : in out Incremental_Lexer;
Token : Nodes.Tokens.Token_Access)
return Nodes.Tokens.Token_Access;
-- Start construction of new token stream from given Token.
-- Token should be marked as Need_Analysis flag in Prepare_Document call.
-- Return first created token.
not overriding function Next_New_Token
(Self : in out Incremental_Lexer) return Nodes.Tokens.Token_Access;
-- with Pre => not Is_Synchronized (Self);
-- Continue construction of new token stream. Return next created token.
-- Should be called when not yet Is_Synchronized (Self);
not overriding function Is_Synchronized
(Self : Incremental_Lexer) return Boolean;
-- Check if new token stream in synch with old one.
not overriding function Synchronized_Token
(Self : Incremental_Lexer) return Nodes.Tokens.Token_Access
with Pre => Is_Synchronized (Self);
-- Return first token after join new token stream with old one.
-- Should be called just after Is_Synchronized returns True.
private
type Token_Pair is array (1 .. 2) of Nodes.Tokens.Token_Access;
type Incremental_Lexer is new Batch_Lexers.Abstract_Source with record
Batch : Batch_Lexers.Batch_Lexer_Access;
Document : Documents.Document_Access;
Reference : Version_Trees.Version; -- Last analyzed version
Previous : Version_Trees.Version; -- Version to analyze
Token : Nodes.Tokens.Token_Access;
Prev_Token : Token_Pair;
Count : Integer; -- Number of chars piped before Token
State : Batch_Lexers.State; -- Lexer State before Token
New_State : Batch_Lexers.State; -- State after Xxx_New_Token
Text : League.Strings.Universal_String; -- Text of Token
Cursor : League.Strings.Cursors.Characters.Character_Cursor;
end record;
overriding function Get_Next (Self : not null access Incremental_Lexer)
return Wide_Wide_Character;
end Incr.Lexers.Incremental;
|
reznikmm/slimp | Ada | 2,758 | adb | -- Copyright (c) 2019 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Slim.Message_Visiters;
package body Slim.Messages.grfs is
List : constant Field_Description_Array :=
((Uint_8_Field, 1), -- Screen
(Uint_8_Field, 1), -- Direction
(Uint_32_Field, 1), -- Pause
(Uint_32_Field, 1), -- Refresh
(Uint_16_Field, 1), -- Pixels
(Uint_16_Field, 1), -- Repeat
(Uint_16_Field, 1), -- Width
(Uint_16_Field, 1), -- Offset
(Custom_Field, 1)); -- Data
----------
-- Data --
----------
not overriding function Data
(Self : Grfs_Message) return Ada.Streams.Stream_Element_Array is
begin
return Self.Data.To_Stream_Element_Array;
end Data;
----------
-- Read --
----------
overriding function Read
(Data : not null access
League.Stream_Element_Vectors.Stream_Element_Vector)
return Grfs_Message is
begin
return Result : Grfs_Message do
Read_Fields (Result, List, Data.all);
end return;
end Read;
-----------------------
-- Read_Custom_Field --
-----------------------
overriding procedure Read_Custom_Field
(Self : in out Grfs_Message;
Index : Positive;
Input : in out Ada.Streams.Stream_Element_Offset;
Data : League.Stream_Element_Vectors.Stream_Element_Vector)
is
use type Ada.Streams.Stream_Element_Offset;
Content : constant Ada.Streams.Stream_Element_Array (1 .. Data.Length) :=
Data.To_Stream_Element_Array;
begin
pragma Assert (Index = 1);
Self.Data.Clear;
Self.Data.Append (Content (Input .. Content'Last));
Input := Content'Last + 1;
end Read_Custom_Field;
-----------
-- Visit --
-----------
overriding procedure Visit
(Self : not null access Grfs_Message;
Visiter : in out Slim.Message_Visiters.Visiter'Class) is
begin
Visiter.grfs (Self);
end Visit;
-----------
-- Write --
-----------
overriding procedure Write
(Self : Grfs_Message;
Tag : out Message_Tag;
Data : out League.Stream_Element_Vectors.Stream_Element_Vector) is
begin
Tag := "grfs";
Write_Fields (Self, List, Data);
end Write;
------------------------
-- Write_Custom_Field --
------------------------
overriding procedure Write_Custom_Field
(Self : Grfs_Message;
Index : Positive;
Data : in out League.Stream_Element_Vectors.Stream_Element_Vector)
is
begin
pragma Assert (Index = 1);
Data.Append (Self.Data);
end Write_Custom_Field;
end Slim.Messages.grfs;
|
godunko/cga | Ada | 928 | adb | --
-- Copyright (C) 2023, Vadim Godunko <[email protected]>
--
-- SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
--
package body CGK.Primitives.Axes_2D is
--------------------
-- Create_Axis_2D --
--------------------
function Create_Axis_2D
(Point : CGK.Primitives.Points_2D.Point_2D;
Direction : CGK.Primitives.Directions_2D.Direction_2D) return Axis_2D is
begin
return (Location => Point, Direction => Direction);
end Create_Axis_2D;
---------------
-- Direction --
---------------
function Direction
(Self : Axis_2D) return CGK.Primitives.Directions_2D.Direction_2D is
begin
return Self.Direction;
end Direction;
--------------
-- Location --
--------------
function Location
(Self : Axis_2D) return CGK.Primitives.Points_2D.Point_2D is
begin
return Self.Location;
end Location;
end CGK.Primitives.Axes_2D;
|
Rodeo-McCabe/orka | Ada | 8,956 | ads | -- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2016 onox <[email protected]>
--
-- 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 Orka.Transforms.SIMD_Vectors;
generic
with package Vector_Transforms is new Orka.Transforms.SIMD_Vectors (<>);
type Matrix_Type is array (Index_Homogeneous) of Vector_Transforms.Vector_Type;
with function Multiply_Matrices (Left, Right : Matrix_Type) return Matrix_Type;
with function Multiply_Vector
(Left : Matrix_Type;
Right : Vector_Transforms.Vector_Type) return Vector_Transforms.Vector_Type;
with function Transpose_Matrix (Matrix : Matrix_Type) return Matrix_Type;
package Orka.Transforms.SIMD_Matrices is
pragma Pure;
package Vectors renames Vector_Transforms;
subtype Element_Type is Vectors.Element_Type;
subtype Vector_Type is Vectors.Vector_Type;
subtype Matrix4 is Matrix_Type;
subtype Vector4 is Vector_Type;
function Identity_Value return Matrix_Type is
(((1.0, 0.0, 0.0, 0.0),
(0.0, 1.0, 0.0, 0.0),
(0.0, 0.0, 1.0, 0.0),
(0.0, 0.0, 0.0, 1.0)))
with Inline;
-- Return the identity matrix
function Zero_Point return Vector_Type renames Vectors.Zero_Point;
-- Return a zero vector that indicates a point. The fourth (W) component
-- is 1.
-- Linear transform: a transform in which vector addition and scalar
-- multiplication is preserved.
-- Affine transform: a transform that includes a linear transform and
-- a translation. Parallelism of lines remain unchanged, but lengths
-- and angles may not. A concatenation of affine transforms is affine.
--
-- Orthogonal matrix: the inverse of the matrix is equal to the transpose.
-- A concatenation of orthogonal matrices is orthogonal.
function T (Offset : Vector_Type) return Matrix_Type;
-- Translate points by the given amount
--
-- Matrix is affine.
--
-- The inverse T^-1 (t) = T (-t).
function Rx (Angle : Element_Type) return Matrix_Type;
-- Rotate around the x-axis by the given amount in radians
--
-- Matrix is orthogonal and affine.
--
-- The inverse Rx^-1 (o) = Rx (-o) = (Rx (o))^T.
function Ry (Angle : Element_Type) return Matrix_Type;
-- Rotate around the y-axis by the given amount in radians
--
-- Matrix is orthogonal and affine.
--
-- The inverse Ry^-1 (o) = Ry (-o) = (Ry (o))^T.
function Rz (Angle : Element_Type) return Matrix_Type;
-- Rotate around the z-axis by the given amount in radians
--
-- Matrix is orthogonal and affine.
--
-- The inverse Rz^-1 (o) = Rz (-o) = (Rz (o))^T.
function R (Axis : Vector_Type; Angle : Element_Type) return Matrix_Type;
-- Rotate around the given axis by the given amount in radians
--
-- Matrix is orthogonal and affine.
--
-- The inverse is R^-1 (a, o) = R (a, -o) = (R (a, o))^T.
function R (Quaternion : Vector_Type) return Matrix_Type;
-- Converts a quaternion to a rotation matrix
--
-- Note: the quaternion must be a unit quaternion (normalized).
function S (Factors : Vector_Type) return Matrix_Type;
-- Scale points by the given amount in the x-, y-, and z-axis
--
-- If all axes are scaled by the same amount, then the matrix is
-- affine.
--
-- The inverse is S^-1 (s) = S (1/s_x, 1/s_y, 1/s_z).
function "*" (Left, Right : Matrix_Type) return Matrix_Type renames Multiply_Matrices;
function "*" (Left : Matrix_Type; Right : Vector_Type) return Vector_Type renames Multiply_Vector;
function "+" (Offset : Vector_Type; Matrix : Matrix_Type) return Matrix_Type;
-- Add a translation transformation to the matrix
function "*" (Factor : Element_Type; Matrix : Matrix_Type) return Matrix_Type;
-- Add a scale transformation to the matrix
function Transpose (Matrix : Matrix_Type) return Matrix_Type renames Transpose_Matrix;
procedure Rotate_At_Origin (Matrix : in out Matrix_Type; Axis : Vector_Type; Angle : Element_Type);
-- Add a rotation transformation to the matrix with the center
-- of rotation at the origin to the matrix
procedure Rotate (Matrix : in out Matrix_Type; Axis : Vector_Type;
Angle : Element_Type; Point : Vector_Type);
-- Add a rotation transformation to the matrix with the center
-- of rotation at the given point to the matrix
procedure Rotate_At_Origin (Matrix : in out Matrix_Type; Quaternion : Vector_Type);
-- Add a rotation transformation based on a quaternion to the matrix
-- with the center of rotation at the origin to the matrix
--
-- Note: the quaternion must be a unit quaternion (normalized).
procedure Rotate (Matrix : in out Matrix_Type; Quaternion : Vector_Type;
Point : Vector_Type);
-- Add a rotation transformation based on a quaternion to the matrix
-- with the center of rotation at the given point to the matrix
--
-- Note: the quaternion must be a unit quaternion (normalized).
procedure Rotate_X_At_Origin (Matrix : in out Matrix_Type; Angle : Element_Type);
-- Add a rotation transformation around the X axis with the center
-- of rotation at the origin to the matrix
procedure Rotate_Y_At_Origin (Matrix : in out Matrix_Type; Angle : Element_Type);
-- Add a rotation transformation around the Y axis with the center
-- of rotation at the origin to the matrix
procedure Rotate_Z_At_Origin (Matrix : in out Matrix_Type; Angle : Element_Type);
-- Add a rotation transformation around the Z axis with the center
-- of rotation at the origin to the matrix
procedure Rotate_X (Matrix : in out Matrix_Type; Angle : Element_Type; Point : Vector_Type);
-- Add a rotation transformation around the X axis with the center
-- of rotation at the given point to the matrix
procedure Rotate_Y (Matrix : in out Matrix_Type; Angle : Element_Type; Point : Vector_Type);
-- Add a rotation transformation around the Y axis with the center
-- of rotation at the given point to the matrix
procedure Rotate_Z (Matrix : in out Matrix_Type; Angle : Element_Type; Point : Vector_Type);
-- Add a rotation transformation around the Z axis with the center
-- of rotation at the given point to the matrix
-- procedure Rotate_Quaternion (Matrix : in out Matrix_Type; Quaternion : ?);
-- procedure Rotate_Euler (Matrix : in out Matrix_Type; Euler : ?);
procedure Translate (Matrix : in out Matrix_Type; Offset : Vector_Type);
-- Add a translation transformation to the matrix
procedure Scale (Matrix : in out Matrix_Type; Factors : Vector_Type);
procedure Scale (Matrix : in out Matrix_Type; Factor : Element_Type);
procedure Transpose (Matrix : in out Matrix_Type);
-- Transpose the matrix
use type Element_Type;
function FOV (Width, Distance : Element_Type) return Element_Type;
-- Return an appropriate field of view in radians for a given screen
-- width and view distance in physical units (mm/inches)
--
-- For example, for a 35 mm frame (which is 36 mm wide) and a
-- 50 mm standard lens, the function gives ~ 39 degrees.
function Finite_Perspective (FOV, Aspect, Z_Near, Z_Far : Element_Type) return Matrix_Type
with Pre => FOV > 0.0 and Aspect > 0.0 and Z_Near > 0.0 and Z_Far > Z_Near;
-- Return a matrix providing perspective projection with a depth
-- range of [0, 1]
--
-- The vertical field of view must be in radians.
function Infinite_Perspective (FOV, Aspect, Z_Near : Element_Type) return Matrix_Type
with Pre => FOV > 0.0 and Aspect > 0.0 and Z_Near > 0.0;
-- Return a matrix providing perspective projection with Z_far to
-- infinite and a depth range of [0, 1]
--
-- The vertical field of view must be in radians.
function Infinite_Perspective_Reversed_Z
(FOV, Aspect, Z_Near : Element_Type) return Matrix_Type
with Pre => FOV > 0.0 and Aspect > 0.0 and Z_Near > 0.0;
-- Return a matrix providing perspective projection with Z_far to
-- infinite and a depth range of [1, 0]
--
-- The vertical field of view must be in radians.
function Orthographic (X_Mag, Y_Mag, Z_Near, Z_Far : Element_Type) return Matrix_Type
with Pre => Z_Near >= 0.0 and Z_Far >= 0.0;
-- Return a matrix providing orthographic projection with a depth
-- range of [0, 1]
end Orka.Transforms.SIMD_Matrices;
|
ekoeppen/STM32_Generic_Ada_Drivers | Ada | 1,104 | ads | with Ada.Interrupts.Names;
with STM32GD.GPIO;
with STM32GD.GPIO.Pin;
with STM32GD.SPI;
with STM32GD.SPI.Peripheral;
with STM32GD.Timer;
with STM32GD.Timer.Peripheral;
with Drivers;
with Drivers.RFM69;
package Peripherals is
package GPIO renames STM32GD.GPIO;
package Timer is new STM32GD.Timer.Peripheral (Timer => STM32GD.Timer.Timer_14, IRQ => Ada.Interrupts.Names.TIM14);
package SCLK is new GPIO.Pin (Pin => GPIO.Pin_5, Port => GPIO.Port_A, Mode => GPIO.Mode_AF);
package MISO is new GPIO.Pin (Pin => GPIO.Pin_6, Port => GPIO.Port_A, Mode => GPIO.Mode_AF);
package MOSI is new GPIO.Pin (Pin => GPIO.Pin_7, Port => GPIO.Port_A, Mode => GPIO.Mode_AF);
package CSN is new GPIO.Pin (Pin => GPIO.Pin_4, Port => GPIO.Port_A, Mode => GPIO.Mode_Out);
package IRQ is new GPIO.Pin (Pin => GPIO.Pin_3, Port => GPIO.Port_A, Mode => GPIO.Mode_In);
package SPI is new STM32GD.SPI.Peripheral (SPI => STM32GD.SPI.SPI_1);
package Radio is new Drivers.RFM69 (Frequency => 868_000_000, SPI => SPI, Chip_Select => CSN, IRQ => IRQ);
procedure Init;
end Peripherals;
|
zhmu/ananas | Ada | 226 | adb | -- { dg-do run }
-- { dg-options "-O -gnatn" }
with Generic_Inst12_Pkg2;
procedure Generic_Inst12 is
procedure My_Inner_G is new Generic_Inst12_Pkg2.Inner_G;
begin
My_Inner_G (1);
Generic_Inst12_Pkg2.Proc (1);
end;
|
AdaCore/training_material | Ada | 17,712 | adb | -- -----------------------------------------------------------------------
-- Ada Labs --
-- --
-- Copyright (C) 2008-2013, AdaCore --
-- --
-- Labs 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 2 of the License, or --
-- (at your option) any later version. --
-- --
-- This program 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 this program; --
-- if not, write to the Free Software Foundation, Inc., 59 Temple --
-- Place - Suite 330, Boston, MA 02111-1307, USA. --
-----------------------------------------------------------------------
with Interfaces.C.Strings; use Interfaces.C.Strings;
with GNAT.OS_Lib; use GNAT.OS_Lib;
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Numerics; use Ada.Numerics;
with Ada.Numerics.Elementary_Functions; use Ada.Numerics.Elementary_Functions;
with System; use System;
with Ada.Exceptions; use Ada.Exceptions;
with Ada.Calendar; use Ada.Calendar;
with GL_glu_h; use GL_glu_h;
with SDL_SDL_h; use SDL_SDL_h;
with SDL_SDL_stdinc_h; use SDL_SDL_stdinc_h;
with SDL_SDL_video_h; use SDL_SDL_video_h;
with SDL_SDL_events_h; use SDL_SDL_events_h;
with SDL_SDL_timer_h; use SDL_SDL_timer_h;
with SDL_SDL_keysym_h; use SDL_SDL_keysym_h;
with SDL_SDL_ttf_h; use SDL_SDL_ttf_h;
with Ada.Unchecked_Deallocation;
with Ada.Task_Identification;
with Ada.Task_Termination; use Ada.Task_Termination;
with GNAT.Traceback.Symbolic; use GNAT.Traceback.Symbolic;
with SDL_SDL_error_h; use SDL_SDL_error_h;
with Display.Basic.Utils; use Display.Basic.Utils;
package body Display.Kernel is
Initialized : Boolean := False with Atomic, Volatile;
Quadric : System.Address;
-- Window_Width, Window_Height : Integer;
-- a shared variable, set concurrently by the Poll_Events routine and read
-- by client code
-----------
-- Check --
-----------
procedure Check (Ret : Int) is
begin
if Ret /= 0 then
raise Display_Error;
end if;
end Check;
---------------
-- Set_Color --
---------------
procedure Set_Color (Color : RGBA_T) is
begin
glColor3d (double(Color.R) / 255.0 ,
double(Color.G) / 255.0,
double(Color.B) / 255.0);
end Set_Color;
---------------
-- Draw_Line --
---------------
procedure Draw_Line (Length : Float; Width : Float) is
begin
glBegin(GL_QUADS);
-- Front Face
glNormal3f (0.0, 0.0, 1.0);
glVertex3f (0.0, -Width, Width);
glVertex3f (Length, -Width, Width);
glVertex3f (Length, Width, Width);
glVertex3f (0.0, Width, Width);
-- Back Face
glNormal3f (0.0, 0.0, -1.0);
glVertex3f (0.0, -Width, -Width);
glVertex3f (0.0, Width, -Width);
glVertex3f (Length, Width, -Width);
glVertex3f (Length, -Width, -Width);
-- Top Face
glNormal3f (0.0, 1.0, 0.0);
glVertex3f (0.0, Width, -Width);
glVertex3f (0.0, Width, Width);
glVertex3f (Length, Width, Width);
glVertex3f (Length, Width, -Width);
-- Bottom Face
glNormal3f (0.0, -1.0, 0.0);
glVertex3f (0.0, -Width, -Width);
glVertex3f (Length, -Width, -Width);
glVertex3f (Length, -Width, Width);
glVertex3f (0.0, -Width, Width);
-- Right face
glNormal3f(1.0, 0.0, 0.0);
glVertex3f (Length, -Width, -Width);
glVertex3f (Length, Width, -Width);
glVertex3f (Length, Width, Width);
glVertex3f (Length, -Width, Width);
-- Left Face
glNormal3f (-1.0, 0.0, 0.0);
glVertex3f (0.0, -Length, -Length);
glVertex3f (0.0, -Length, Length);
glVertex3f (0.0, Length, Length);
glVertex3f (0.0, Length, -Length);
glEnd;
end Draw_Line;
--------------
-- Draw_Box --
--------------
procedure Draw_Box (X, Y, Width, Height : Float) is
pragma Unreferenced (X, Y);
X1 : constant Float := -Width / 2.0;
Y1 : constant Float := -Height / 2.0;
X2 : constant Float := -Width / 2.0;
Y2 : constant Float := Height / 2.0;
X3 : constant Float := Width / 2.0;
Y3 : constant Float := Height / 2.0;
X4 : constant Float := Width / 2.0;
Y4 : constant Float := -Height / 2.0;
Dx : constant := 2.0;
Dy : constant := 2.0;
Back : constant := -20.0;
Front : constant := 0.0;
begin
glBegin(GL_QUADS);
glNormal3f(-1.0, 0.0, 0.0);
glVertex3f(X1, Y1, Front);
glVertex3f(X2, Y2, Front);
glVertex3f(X2 - Dx, Y2 - Dy, Back);
glVertex3f(X1 - Dx, Y1 - Dy, Back);
glNormal3f(1.0, 0.0, 0.0);
glVertex3f(X3, Y3, Front);
glVertex3f(X4, Y4, Front);
glVertex3f(X4 - Dx, Y4 - Dy, Back);
glVertex3f(X3 - Dx, Y3 - Dy, Back);
glNormal3f(0.0, 0.0, 1.0);
glVertex3f(X1, Y1, Front);
glVertex3f(X2, Y2, Front);
glVertex3f(X3, Y3, Front);
glVertex3f(X4, Y4, Front);
glNormal3f(0.0, 0.0, -1.0);
glVertex3f(X1 - Dx, Y1 - Dy, Back);
glVertex3f(X2 - Dx, Y2 - Dy, Back);
glVertex3f(X3 - Dx, Y3 - Dy, Back);
glVertex3f(X4 - Dx, Y4 - Dy, Back);
glNormal3f(0.0, 1.0, 0.0);
glVertex3f(X2, Y2, Front);
glVertex3f(X3, Y3, Front);
glVertex3f(X3 - Dx, Y3 - Dy, Back);
glVertex3f(X2 - Dx, Y2 - Dy, Back);
glNormal3f(0.0, -1.0, 0.0);
glVertex3f(X4, Y4, Front);
glVertex3f(X1, Y1, Front);
glVertex3f(X1 - Dx, Y1 - Dy, Back);
glVertex3f(X4 - Dx, Y4 - Dy, Back);
glEnd;
end Draw_Box;
----------------
-- Draw_Torus --
----------------
procedure Draw_Torus
(Inner_Radius : GLfloat;
Outer_Radius : GLfloat;
Nsides : GLint;
Rings : GLint)
is
Theta, Phi, Theta1 : GLfloat;
CosTheta, SinTheta : GLfloat;
CosTheta1, SinTheta1 : GLfloat;
RingDelta, SideDelta : GLfloat;
begin
RingDelta := 2.0 * Pi / GLfloat (Rings);
SideDelta := 2.0 * Pi / GLfloat (Nsides);
Theta := 0.0;
CosTheta := 1.0;
SinTheta := 0.0;
for i in reverse 0 .. Rings - 1 loop
Theta1 := Theta + RingDelta;
CosTheta1 := cos(Theta1);
SinTheta1 := sin(Theta1);
glBegin(GL_QUAD_STRIP);
phi := 0.0;
for j in reverse 0 .. nsides loop
declare
CosPhi, SinPhi, Dist : GLfloat;
begin
Phi := Phi + SideDelta;
CosPhi := Cos (Phi);
SinPhi := Sin (Phi);
Dist := Outer_Radius + Inner_Radius * CosPhi;
glNormal3f
(cosTheta1 * CosPhi, -SinTheta1 * CosPhi, SinPhi);
glVertex3f
(cosTheta1 * dist, -SinTheta1 * dist, Inner_Radius * SinPhi);
glNormal3f
(cosTheta * CosPhi, -SinTheta * CosPhi, sinPhi);
glVertex3f
(cosTheta * Dist, -SinTheta * Dist, Inner_Radius * SinPhi);
end;
end loop;
glEnd;
Theta := Theta1;
CosTheta := CosTheta1;
SinTheta := SinTheta1;
end loop;
end Draw_Torus;
----------
-- Draw --
----------
procedure DrawDisk (InnerRadius : Float; OuterRadius : Float; VSlices : Integer; HSlices : Integer; Color: RGBA_T) is
begin
gluDisk(Quadric, GLdouble(InnerRadius), GLdouble(OuterRadius), int(VSlices), int(HSlices));
end DrawDisk;
procedure Draw_Sphere (Radius : Float; Color: RGBA_T) is
begin
gluSphere
(qobj => Quadric,
radius => GLdouble (Radius),
slices => 20,
stacks => 20);
end Draw_Sphere;
--------------------
-- Graphical loop --
--------------------
procedure UpdateProjection(Canvas : Canvas_ID) is
C : T_Internal_Canvas := Get_Internal_Canvas (Canvas);
S : access SDL_Surface := C.Surface;
Z : double := 1.0 / double (C.Zoom_Factor);
begin
glMatrixMode (GL_PROJECTION);
glLoadIdentity;
glOrtho (-GLdouble(S.w / 2) * Z, GLdouble(S.w / 2) * Z,
-GLdouble(S.h / 2) * Z, GLdouble(S.h / 2) * Z, -100.0, 300.0);
glMatrixMode (GL_MODELVIEW);
glLoadIdentity;
end UpdateProjection;
procedure Reshape (S : in out OpenGL_Surface; W : Integer; H : Integer) is
C : T_Internal_Canvas := Get_Internal_Canvas (S.Canvas);
SDL_S : access SDL_Surface := C.Surface;
begin
S.w := W;
S.h := H;
SDL_S.w := int(W);
SDL_S.h := int(H);
glViewport (0, 0, GLsizei (w), GLsizei (h));
UpdateProjection(S.Canvas);
-- glMatrixMode (GL_PROJECTION);
--glLoadIdentity;
-- Ratio := GLdouble (w) / GLdouble (h);
--
-- if w > h then
-- glOrtho (-100.0 * Ratio, 100.0 * Ratio, -100.0, 100.0, -100.0, 300.0);
-- else
-- glOrtho (-100.0, 100.0, -100.0 / Ratio, 100.0 / Ratio, -100.0, 300.0);
-- end if;
-- glOrtho (-GLdouble(S.w / 2), GLdouble(S.w / 2), -GLdouble(S.h / 2), GLdouble(S.h / 2), -100.0, 300.0);
-- glMatrixMode (GL_MODELVIEW);
end Reshape;
Stop : Boolean := False;
function Set_SDL_Video (Width : Integer; Height : Integer) return OpenGL_Surface;
procedure Set_OpenGL(S : in out OpenGL_Surface);
type Glubyte_Arrays is array (int range <>) of aliased GLubyte;
-------------
-- GL_Task --
-------------
function Create_Window(Width:Integer; Height : Integer; Name : String) return OpenGL_Surface is
Window: OpenGL_Surface;
begin
if not Initialized then
raise Use_Error;
end if;
-- Rather than set the video properties up in the constructor, I set
-- them in setVideo. The reason for this is that 2 pointers are used to
-- interact with SDL structures. Once used they convert their handles
-- into vidInfo and surface tamer variables. That this occurs inside
-- the function means the pointers will release their memory on function
-- exit.
Window := Set_SDL_Video (Width, Height);
Window.Canvas := Register_SDL_Surface(Window.surface);
SDL_WM_SetCaption (Title => New_String (Name), Icon => Null_Ptr);
-- openGL is not part of SDL, rather it runs in a window handled
-- by SDL. here we set up some openGL state
Set_OpenGL(Window);
glClear (GL_COLOR_BUFFER_BIT or GL_DEPTH_BUFFER_BIT);
Check (TTF_Init);
return Window;
end Create_Window;
procedure Init is
begin
-- SDL is comprised of 8 subsystems. Here we initialize the video
if SDL_Init(SDL_INIT_VIDEO) < 0 then
Put_Line ("Error initializing SDL");
Put_Line(Value (SDL_GetError));
SDL_SDL_h.SDL_Quit;
end if;
Initialized := True;
end Init;
----------
-- Draw --
----------
procedure Swap_Buffers(S : in out OpenGL_Surface) is
begin
-- Idle;
-- Poll_Events;
glFlush;
SDL_GL_SwapBuffers;
-- SDL_Delay (1);
glClear (GL_COLOR_BUFFER_BIT or GL_DEPTH_BUFFER_BIT);
Poll_Events(S);
end Swap_Buffers;
------------
-- Finish --
------------
procedure Finish is
begin
TTF_Quit;
SDL_SDL_h.SDL_Quit;
GNAT.OS_Lib.OS_Exit (0);
end Finish;
-------------------
-- Set_SDL_Video --
-------------------
function Set_SDL_Video(Width : Integer; Height : Integer) return OpenGL_Surface is
S : OpenGL_Surface;
ret : int;
begin
-- To center a non-fullscreen window we need to set an environment
-- variable
Check (SDL_putenv(New_String ("SDL_VIDEO_CENTERED=center")));
-- the video info structure contains the current video mode. Prior to
-- calling setVideoMode, it contains the best available mode
-- for your system. Post setting the video mode, it contains
-- whatever values you set the video mode with.
-- First we point at the SDL structure, then test to see that the
-- point is right. Then we copy the data from the structure to
-- the safer vidInfo variable.
declare
ptr : System.Address := SDL_GetVideoInfo;
for ptr'Address use S.vidInfo'Address;
begin
if ptr = System.Null_Address then
Put_Line ("Error querying video info");
Put_Line(Value (SDL_GetError));
SDL_SDL_h.SDL_Quit;
end if;
end;
S.w := Width;
S.h := Height;
ret := SDL_GL_SetAttribute(SDL_GL_DEPTH_SIZE, 24);
ret := SDL_GL_SetAttribute(SDL_GL_DOUBLEBUFFER, 1);
ret := SDL_GL_SetAttribute(SDL_GL_MULTISAMPLEBUFFERS, 1);
ret := SDL_GL_SetAttribute(SDL_GL_MULTISAMPLESAMPLES, 4);
-- the setVideoMode function returns the current frame buffer as an
-- SDL_Surface. Again, we grab a pointer to it, then place its
-- content into the non pointery surface variable. I say 'non-pointery',
-- but this SDL variable must have a pointer in it because it can
-- access the current pixels in the framebuffer.
S.surface := SDL_SetVideoMode(int (S.w), int (S.h), S.bpp, S.flags);
if S.surface = null then
Put_Line ("Error setting the video mode");
Put_Line(Value (SDL_GetError));
SDL_SDL_h.SDL_Quit;
end if;
return S;
end Set_SDL_Video;
----------------
-- Set_OpenGL --
----------------
procedure Set_OpenGL(S : in out OpenGL_Surface) is
type GLFloat_Array is array (Natural range <>) of aliased GLfloat;
light_diffuse : aliased GLFloat_Array
:= (1.0, 1.0, 1.0, 1.0);
light_ambient : aliased GLFloat_Array
:= (0.2, 0.2, 0.2, 1.0);
light_position : aliased GLFloat_Array
:= (0.0, 0.0, 0.0, 1.0);
GL_MULTISAMPLE : constant := 16#809D#;
begin
Quadric := gluNewQuadric;
Reshape (S, S.w, S.h);
glClearColor (0.1, 0.1, 0.1, 0.0);
glLightfv (GL_LIGHT0, GL_AMBIENT, light_ambient (0)'Access);
glLightfv (GL_LIGHT0, GL_DIFFUSE, light_diffuse (0)'Access);
glLightfv (GL_LIGHT0, GL_POSITION, light_position (0)'Access);
glEnable(GL_MULTISAMPLE);
glFrontFace (GL_CW);
glEnable (GL_LIGHTING);
glEnable (GL_LIGHT0);
glEnable (GL_DEPTH_TEST);
glEnable (GL_COLOR_MATERIAL);
glEnable (GL_NORMALIZE);
glDepthFunc (GL_LESS);
glMatrixMode (GL_MODELVIEW);
-- gluLookAt (0.0, 0.0, 10.0,
-- 0.0, 0.0, 0.0,
-- 0.0, 1.0, 0.0);
end Set_OpenGL;
-----------------
-- Poll_Events --
-----------------
Internal_Cursor : Cursor_T := ((0,0), False);
function Get_Internal_Cursor return Cursor_T is (Internal_Cursor);
procedure Poll_Events(S : in out OpenGL_Surface) is
E : aliased SDL_Event;
begin
while SDL_PollEvent (E'Access) /= 0 loop
case unsigned (E.c_type) is
when SDL_SDL_events_h.SDL_QUIT =>
Stop := True;
when SDL_SDL_events_h.SDL_MOUSEBUTTONDOWN =>
Internal_Cursor.Position := (Integer(E.motion.x), Integer(E.motion.y));
Internal_Cursor.Pressed := True;
when SDL_SDL_events_h.SDL_MOUSEBUTTONUP =>
Internal_Cursor.Position := (Integer(E.motion.x), Integer(E.motion.y));
Internal_Cursor.Pressed := False;
when SDL_SDL_events_h.SDL_VIDEORESIZE =>
Reshape (S, Integer (E.resize.w), Integer (E.resize.h));
when others =>
null;
end case;
end loop;
end Poll_Events;
-------------------------
-- Exception_Reporting --
-------------------------
protected Exception_Reporting is
procedure Report
(Cause : Cause_Of_Termination;
T : Ada.Task_Identification.Task_Id;
X : Ada.Exceptions.Exception_Occurrence);
end Exception_Reporting;
-------------------------
-- Exception_Reporting --
-------------------------
protected body Exception_Reporting is
procedure Report
(Cause : Cause_Of_Termination;
T : Ada.Task_Identification.Task_Id;
X : Ada.Exceptions.Exception_Occurrence) is
pragma Unreferenced (Cause, T);
begin
Put_Line ("=== UNCAUGHT EXCEPTION ===");
Put_Line (Exception_Information (X));
Put_Line (Symbolic_Traceback (X));
GNAT.OS_Lib.OS_Exit (1);
end Report;
end Exception_Reporting;
function Is_Stopped return Boolean is
begin
if Stop then
TTF_Quit;
SDL_SDL_h.SDL_Quit;
-- GNAT.OS_Lib.OS_Exit (0);
end if;
return Stop;
end Is_Stopped;
begin
-- Data_Manager.Initialize;
-- Set_Dependents_Fallback_Handler (Exception_Reporting.Report'Access);
-- Set_Specific_Handler
-- (Ada.Task_Identification.Current_Task,
-- Exception_Reporting.Report'Access);
Init;
end Display.Kernel;
|
reznikmm/matreshka | Ada | 4,675 | ads | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Open Document Toolkit --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2014, Vadim Godunko <[email protected]> --
-- 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 XML.DOM.Visitors;
with ODF.DOM.Table_Title_Elements;
package Matreshka.ODF_Table.Title_Elements is
type Table_Title_Element_Node is
new Matreshka.ODF_Table.Abstract_Table_Element_Node
and ODF.DOM.Table_Title_Elements.ODF_Table_Title
with null record;
overriding function Create
(Parameters : not null access Matreshka.DOM_Elements.Element_L2_Parameters)
return Table_Title_Element_Node;
overriding function Get_Local_Name
(Self : not null access constant Table_Title_Element_Node)
return League.Strings.Universal_String;
overriding procedure Enter_Node
(Self : not null access Table_Title_Element_Node;
Visitor : in out XML.DOM.Visitors.Abstract_Visitor'Class;
Control : in out XML.DOM.Visitors.Traverse_Control);
overriding procedure Leave_Node
(Self : not null access Table_Title_Element_Node;
Visitor : in out XML.DOM.Visitors.Abstract_Visitor'Class;
Control : in out XML.DOM.Visitors.Traverse_Control);
overriding procedure Visit_Node
(Self : not null access Table_Title_Element_Node;
Iterator : in out XML.DOM.Visitors.Abstract_Iterator'Class;
Visitor : in out XML.DOM.Visitors.Abstract_Visitor'Class;
Control : in out XML.DOM.Visitors.Traverse_Control);
end Matreshka.ODF_Table.Title_Elements;
|
davidkristola/vole | Ada | 2,516 | adb | package body kv.avm.Actor_References is
use Interfaces;
Local_Domain : Interfaces.Unsigned_32 := 0;
----------------------------------------------------------------------------
procedure Set_Local_Domain(Domain : Interfaces.Unsigned_32) is
begin
Local_Domain := Domain;
end Set_Local_Domain;
----------------------------------------------------------------------------
function Get_Local_Domain return Interfaces.Unsigned_32 is
begin
return Local_Domain;
end Get_Local_Domain;
----------------------------------------------------------------------------
procedure Initialize
(Self : in out Actor_Reference_Type;
Key : in Interfaces.Unsigned_32;
Domain : in Interfaces.Unsigned_32 := Get_Local_Domain) is
begin
Self.Key := Key;
Self.Domain := Domain;
end Initialize;
----------------------------------------------------------------------------
function Get_Key(Self : Actor_Reference_Type) return Interfaces.Unsigned_32 is
begin
return Self.Key;
end Get_Key;
----------------------------------------------------------------------------
function Get_Domain(Self : Actor_Reference_Type) return Interfaces.Unsigned_32 is
begin
return Self.Domain;
end Get_Domain;
----------------------------------------------------------------------------
function Is_Local(Self : Actor_Reference_Type) return Boolean is
begin
return Self.Domain = Local_Domain;
end Is_Local;
----------------------------------------------------------------------------
function Image(Self : Actor_Reference_Type) return String is
Domain : constant String := Interfaces.Unsigned_32'IMAGE(Self.Domain);
use Interfaces;
begin
if Self.Key = Null_Reference.Key and Self.Domain = Null_Reference.Domain then
return " NULL_REFERENCE";
else
return Interfaces.Unsigned_32'IMAGE(Self.Key) & "@" & Domain(2..Domain'LAST);
end if;
end Image;
----------------------------------------------------------------------------
function "="(L, R : Actor_Reference_Type) return Boolean is
begin
return L.Domain = R.Domain and then L.Key = R.Key;
end "=";
----------------------------------------------------------------------------
function "<"(L, R : Actor_Reference_Type) return Boolean is
begin
return L.Domain < R. Domain or else (L.Domain = R.Domain and L.Key < R.Key);
end "<";
end kv.avm.Actor_References;
|
optikos/oasis | Ada | 1,968 | ads | -- Copyright (c) 2019 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Program.Elements.Definitions;
with Program.Lexical_Elements;
package Program.Elements.Private_Type_Definitions is
pragma Pure (Program.Elements.Private_Type_Definitions);
type Private_Type_Definition is
limited interface and Program.Elements.Definitions.Definition;
type Private_Type_Definition_Access is
access all Private_Type_Definition'Class with Storage_Size => 0;
not overriding function Has_Abstract
(Self : Private_Type_Definition)
return Boolean is abstract;
not overriding function Has_Tagged
(Self : Private_Type_Definition)
return Boolean is abstract;
not overriding function Has_Limited
(Self : Private_Type_Definition)
return Boolean is abstract;
type Private_Type_Definition_Text is limited interface;
type Private_Type_Definition_Text_Access is
access all Private_Type_Definition_Text'Class with Storage_Size => 0;
not overriding function To_Private_Type_Definition_Text
(Self : aliased in out Private_Type_Definition)
return Private_Type_Definition_Text_Access is abstract;
not overriding function Abstract_Token
(Self : Private_Type_Definition_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function Tagged_Token
(Self : Private_Type_Definition_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function Limited_Token
(Self : Private_Type_Definition_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function Private_Token
(Self : Private_Type_Definition_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
end Program.Elements.Private_Type_Definitions;
|
Gabriel-Degret/adalib | Ada | 1,367 | ads | -- Standard Ada library specification
-- Copyright (c) 2003-2018 Maxim Reznik <[email protected]>
-- 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
---------------------------------------------------------------------------
package Ada.Streams is
pragma Pure (Streams);
type Root_Stream_Type is abstract tagged limited private;
pragma Preelaborable_Initialization (Root_Stream_Type);
type Stream_Element is mod implementation_defined;
type Stream_Element_Offset is range
implementation_defined .. implementation_defined;
subtype Stream_Element_Count is
Stream_Element_Offset range 0..Stream_Element_Offset'Last;
type Stream_Element_Array is
array (Stream_Element_Offset range <>) of aliased Stream_Element;
procedure Read (Stream : in out Root_Stream_Type;
Item : out Stream_Element_Array;
Last : out Stream_Element_Offset) is abstract;
procedure Write (Stream : in out Root_Stream_Type;
Item : in Stream_Element_Array) is abstract;
private
pragma Import (Ada, Root_Stream_Type);
end Ada.Streams;
|
reznikmm/matreshka | Ada | 4,436 | ads | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2010-2012, Vadim Godunko <[email protected]> --
-- 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$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
package AMF.Internals.Tables.MOF_Metamodel is
pragma Preelaborate;
function MM_MOF_MOF return AMF.Internals.CMOF_Element;
function MC_MOF_Tag return AMF.Internals.CMOF_Element;
function MP_MOF_Tag_Element_A_Tag return AMF.Internals.CMOF_Element;
function MP_MOF_Tag_Name return AMF.Internals.CMOF_Element;
function MP_MOF_Tag_Tag_Owner_A_Owned_Tag return AMF.Internals.CMOF_Element;
function MP_MOF_Tag_Value return AMF.Internals.CMOF_Element;
function MP_MOF_A_Tag_Tag_Element return AMF.Internals.CMOF_Element;
function MP_MOF_A_Owned_Tag_Tag_Tag_Owner return AMF.Internals.CMOF_Element;
function MA_MOF_Tag_Element_Tag return AMF.Internals.CMOF_Element;
function MA_MOF_Tag_Tag_Owner_Owned_Tag return AMF.Internals.CMOF_Element;
function MB_MOF return AMF.Internals.AMF_Element;
function ML_MOF return AMF.Internals.AMF_Element;
private
Base : AMF.Internals.CMOF_Element := 0;
end AMF.Internals.Tables.MOF_Metamodel;
|
gitter-badger/libAnne | Ada | 170,160 | ads | with Generics.Mathematics.Arrays;
use Generics.Mathematics.Arrays;
package Mathematics.Arrays with Pure, Remote_Types is
--@Description Provides arrays for array math and linear algebra
--@Version 1.0
-------------------------------
-- Short Short Integer Array --
-------------------------------
type Short_Short_Integer_Array is array(Positive range <>) of Short_Short_Integer;
function "+"(Value : Short_Short_Integer_Array) return Short_Short_Integer_Array with Pure_Function;
--Distributed assertion
function "-"(Value : Short_Short_Integer_Array) return Short_Short_Integer_Array with Pure_Function;
--Distributed negation
function "abs"(Value : Short_Short_Integer_Array) return Short_Short_Integer_Array with Pure_Function;
--Distributed absolute value
function "+"(Left : Short_Short_Integer_Array; Right : Short_Short_Integer_Array) return Short_Short_Integer_Array with Pure_Function;
--Array addition, add together each respective element of Left and Right
function "+"(Left : Short_Short_Integer_Array; Right : Short_Short_Integer) return Short_Short_Integer_Array with Pure_Function;
--Distributed addition, add each element of Left with Right
function "+"(Left : Short_Short_Integer; Right : Short_Short_Integer_Array) return Short_Short_Integer_Array with Pure_Function;
--Distributed addition, add Left with each element of Right
function "-"(Left : Short_Short_Integer_Array; Right : Short_Short_Integer_Array) return Short_Short_Integer_Array with Pure_Function;
--Array subtraction, subtract each respective element of Left and Right
function "-"(Left : Short_Short_Integer_Array; Right : Short_Short_Integer) return Short_Short_Integer_Array with Pure_Function;
--Distributed subtraction, subtract Right from each element of Left
function "-"(Left : Short_Short_Integer; Right : Short_Short_Integer_Array) return Short_Short_Integer_Array with Pure_Function;
--Distributed subtraction, subtract each element of Right from Left
function "*"(Left : Short_Short_Integer_Array; Right : Short_Short_Integer_Array) return Short_Short_Integer_Array with Pure_Function;
--Array multiplication, multiply together each respective element
function "*"(Left : Short_Short_Integer_Array; Right : Short_Short_Integer) return Short_Short_Integer_Array with Pure_Function;
--Distributed multiplication, multiply each element of Left with Right
function "*"(Left : Short_Short_Integer; Right : Short_Short_Integer_Array) return Short_Short_Integer_Array with Pure_Function;
--Distributed multiplication, multiply Left with each element of Right
function "/"(Left : Short_Short_Integer_Array; Right : Short_Short_Integer_Array) return Short_Short_Integer_Array with Pure_Function;
--Array division, divide each respective element of Left and Right
function "/"(Left : Short_Short_Integer_Array; Right : Short_Short_Integer) return Short_Short_Integer_Array with Pure_Function;
--Distributed division, divide each element of Left by Right
function "/"(Left : Short_Short_Integer; Right : Short_Short_Integer_Array) return Short_Short_Integer_Array with Pure_Function;
--Distributed division, each Left by each element of Right
function "rem"(Left : Short_Short_Integer_Array; Right : Short_Short_Integer_Array) return Short_Short_Integer_Array with Pure_Function;
--Array remainder, divide each respective element of Left and Right, keep the remainder
function "rem"(Left : Short_Short_Integer_Array; Right : Short_Short_Integer) return Short_Short_Integer_Array with Pure_Function;
--Distributed remainder, divide each element of Left by Right, keep the remainder
function "rem"(Left : Short_Short_Integer; Right : Short_Short_Integer_Array) return Short_Short_Integer_Array with Pure_Function;
--Distributed remainder, divide Left by each element of Right
function "mod"(Left : Short_Short_Integer_Array; Right : Short_Short_Integer_Array) return Short_Short_Integer_Array with Pure_Function;
--Distributed modulus, divide each respective element of Left and Right, keep the remainder
function "mod"(Left : Short_Short_Integer_Array; Right : Short_Short_Integer) return Short_Short_Integer_Array with Pure_Function;
--Distributed modulus, divide each element of Left by Right, keep the remainder
function "mod"(Left : Short_Short_Integer; Right : Short_Short_Integer_Array) return Short_Short_Integer_Array with Pure_Function;
--Distributed modulus, divide Left by each element of Right
function "="(Left : Short_Short_Integer_Array; Right : Short_Short_Integer_Array) return Boolean with Pure_Function;
--Array equality, test each respective element of Left and Right
function "="(Left : Short_Short_Integer_Array; Right : Short_Short_Integer) return Boolean with Pure_Function;
--Distributed equality, test each element of Left with Right
function "="(Left : Short_Short_Integer; Right : Short_Short_Integer_Array) return Boolean with Pure_Function;
--Distributed equality, test Left with each element of Right
function "<"(Left : Short_Short_Integer_Array; Right : Short_Short_Integer_Array) return Boolean with Pure_Function;
--Distributed lesser, test each respective element of Left with Right
function "<"(Left : Short_Short_Integer_Array; Right : Short_Short_Integer) return Boolean with Pure_Function;
--Distributed lesser, test each element of Left with Right
function "<"(Left : Short_Short_Integer; Right : Short_Short_Integer_Array) return Boolean with Pure_Function;
--Distributed lesser, test Left with each element of Right
function ">"(Left : Short_Short_Integer_Array; Right : Short_Short_Integer_Array) return Boolean with Pure_Function;
--Distributed greater, test each respective element of Left with Right
function ">"(Left : Short_Short_Integer_Array; Right : Short_Short_Integer) return Boolean with Pure_Function;
--Distributed greater, test each element of Left with Right
function ">"(Left : Short_Short_Integer; Right : Short_Short_Integer_Array) return Boolean with Pure_Function;
--Distributed greater, test Left with each element of Right
function "<="(Left : Short_Short_Integer_Array; Right : Short_Short_Integer_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test each respective element of Left with Right
function "<="(Left : Short_Short_Integer_Array; Right : Short_Short_Integer) return Boolean with Pure_Function;
--Distributed lesser or equal, test each element of Left with Right
function "<="(Left : Short_Short_Integer; Right : Short_Short_Integer_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test Left with each element of Right
function ">="(Left : Short_Short_Integer_Array; Right : Short_Short_Integer_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test each respective element of Left with Right
function ">="(Left : Short_Short_Integer_Array; Right : Short_Short_Integer) return Boolean with Pure_Function;
--Distributed greater or equal, test each element of Left with Right
function ">="(Left : Short_Short_Integer; Right : Short_Short_Integer_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test Left with each element of Right
function Max is new Integer_Max(Short_Short_Integer, Short_Short_Integer_Array) with Pure_Function;
--Find the maximum value of the array
function Min is new Integer_Min(Short_Short_Integer, Short_Short_Integer_Array) with Pure_Function;
--Find the minimum value of the array
function Apply is new Integer_Apply_Procedure(Short_Short_Integer, Short_Short_Integer_Array);
--Apply the procedure to each value of the array, returning the result
function Map(Value : Short_Short_Integer_Array; Callback : access Procedure(Value : in out Short_Short_Integer)) return Short_Short_Integer_Array renames Apply;
function Apply is new Integer_Apply_Function(Short_Short_Integer, Short_Short_Integer_Array);
--Apply the function to each value of the array, returning the result
function Map(Value : Short_Short_Integer_Array; Callback : access Function(Value : Short_Short_Integer) return Short_Short_Integer) return Short_Short_Integer_Array renames Apply;
function Fold is new Integer_Fold(Short_Short_Integer, Short_Short_Integer_Array);
--Fold the array using the specified function
-------------------------
-- Short Integer Array --
-------------------------
type Short_Integer_Array is array(Positive range <>) of Short_Integer;
function "+"(Value : Short_Integer_Array) return Short_Integer_Array with Pure_Function;
--Distributed assertion
function "-"(Value : Short_Integer_Array) return Short_Integer_Array with Pure_Function;
--Distributed negation
function "abs"(Value : Short_Integer_Array) return Short_Integer_Array with Pure_Function;
--Distributed absolute value
function "+"(Left : Short_Integer_Array; Right : Short_Integer_Array) return Short_Integer_Array with Pure_Function;
--Array addition, add together each respective element of Left and Right
function "+"(Left : Short_Integer_Array; Right : Short_Integer) return Short_Integer_Array with Pure_Function;
--Distributed addition, add each element of Left with Right
function "+"(Left : Short_Integer; Right : Short_Integer_Array) return Short_Integer_Array with Pure_Function;
--Distributed addition, add Left with each element of Right
function "-"(Left : Short_Integer_Array; Right : Short_Integer_Array) return Short_Integer_Array with Pure_Function;
--Array subtraction, subtract each respective element of Left and Right
function "-"(Left : Short_Integer_Array; Right : Short_Integer) return Short_Integer_Array with Pure_Function;
--Distributed subtraction, subtract Right from each element of Left
function "-"(Left : Short_Integer; Right : Short_Integer_Array) return Short_Integer_Array with Pure_Function;
--Distributed subtraction, subtract each element of Right from Left
function "*"(Left : Short_Integer_Array; Right : Short_Integer_Array) return Short_Integer_Array with Pure_Function;
--Array multiplication, multiply together each respective element
function "*"(Left : Short_Integer_Array; Right : Short_Integer) return Short_Integer_Array with Pure_Function;
--Distributed multiplication, multiply each element of Left with Right
function "*"(Left : Short_Integer; Right : Short_Integer_Array) return Short_Integer_Array with Pure_Function;
--Distributed multiplication, multiply Left with each element of Right
function "/"(Left : Short_Integer_Array; Right : Short_Integer_Array) return Short_Integer_Array with Pure_Function;
--Array division, divide each respective element of Left and Right
function "/"(Left : Short_Integer_Array; Right : Short_Integer) return Short_Integer_Array with Pure_Function;
--Distributed division, divide each element of Left by Right
function "/"(Left : Short_Integer; Right : Short_Integer_Array) return Short_Integer_Array with Pure_Function;
--Distributed division, each Left by each element of Right
function "rem"(Left : Short_Integer_Array; Right : Short_Integer_Array) return Short_Integer_Array with Pure_Function;
--Array remainder, divide each respective element of Left and Right, keep the remainder
function "rem"(Left : Short_Integer_Array; Right : Short_Integer) return Short_Integer_Array with Pure_Function;
--Distributed remainder, divide each element of Left by Right, keep the remainder
function "rem"(Left : Short_Integer; Right : Short_Integer_Array) return Short_Integer_Array with Pure_Function;
--Distributed remainder, divide Left by each element of Right
function "mod"(Left : Short_Integer_Array; Right : Short_Integer_Array) return Short_Integer_Array with Pure_Function;
--Distributed modulus, divide each respective element of Left and Right, keep the remainder
function "mod"(Left : Short_Integer_Array; Right : Short_Integer) return Short_Integer_Array with Pure_Function;
--Distributed modulus, divide each element of Left by Right, keep the remainder
function "mod"(Left : Short_Integer; Right : Short_Integer_Array) return Short_Integer_Array with Pure_Function;
--Distributed modulus, divide Left by each element of Right
function "="(Left : Short_Integer_Array; Right : Short_Integer_Array) return Boolean with Pure_Function;
--Array equality, test each respective element of Left and Right
function "="(Left : Short_Integer_Array; Right : Short_Integer) return Boolean with Pure_Function;
--Distributed equality, test each element of Left with Right
function "="(Left : Short_Integer; Right : Short_Integer_Array) return Boolean with Pure_Function;
--Distributed equality, test Left with each element of Right
function "<"(Left : Short_Integer_Array; Right : Short_Integer_Array) return Boolean with Pure_Function;
--Distributed lesser, test each respective element of Left with Right
function "<"(Left : Short_Integer_Array; Right : Short_Integer) return Boolean with Pure_Function;
--Distributed lesser, test each element of Left with Right
function "<"(Left : Short_Integer; Right : Short_Integer_Array) return Boolean with Pure_Function;
--Distributed lesser, test Left with each element of Right
function ">"(Left : Short_Integer_Array; Right : Short_Integer_Array) return Boolean with Pure_Function;
--Distributed greater, test each respective element of Left with Right
function ">"(Left : Short_Integer_Array; Right : Short_Integer) return Boolean with Pure_Function;
--Distributed greater, test each element of Left with Right
function ">"(Left : Short_Integer; Right : Short_Integer_Array) return Boolean with Pure_Function;
--Distributed greater, test Left with each element of Right
function "<="(Left : Short_Integer_Array; Right : Short_Integer_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test each respective element of Left with Right
function "<="(Left : Short_Integer_Array; Right : Short_Integer) return Boolean with Pure_Function;
--Distributed lesser or equal, test each element of Left with Right
function "<="(Left : Short_Integer; Right : Short_Integer_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test Left with each element of Right
function ">="(Left : Short_Integer_Array; Right : Short_Integer_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test each respective element of Left with Right
function ">="(Left : Short_Integer_Array; Right : Short_Integer) return Boolean with Pure_Function;
--Distributed greater or equal, test each element of Left with Right
function ">="(Left : Short_Integer; Right : Short_Integer_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test Left with each element of Right
function Max is new Integer_Max(Short_Integer, Short_Integer_Array) with Pure_Function;
--Find the maximum value of the array
function Min is new Integer_Min(Short_Integer, Short_Integer_Array) with Pure_Function;
--Find the minimum value of the array
function Apply is new Integer_Apply_Procedure(Short_Integer, Short_Integer_Array);
--Apply the procedure to each value of the array, returning the result
function Map(Value : Short_Integer_Array; Callback : access Procedure(Value : in out Short_Integer)) return Short_Integer_Array renames Apply;
function Apply is new Integer_Apply_Function(Short_Integer, Short_Integer_Array);
--Apply the function to each value of the array, returning the result
function Map(Value : Short_Integer_Array; Callback : access Function(Value : Short_Integer) return Short_Integer) return Short_Integer_Array renames Apply;
function Fold is new Integer_Fold(Short_Integer, Short_Integer_Array);
--Fold the array using the specified function
-------------------
-- Integer Array --
-------------------
type Integer_Array is array(Positive range <>) of Integer;
function Comprehension is new Integer_Fill_Comprehension(Integer, Integer_Array);
function Comprehension is new Integer_Step_Comprehension(Integer, Integer_Array);
function "+"(Value : Integer_Array) return Integer_Array with Pure_Function;
--Distributed assertion
function "-"(Value : Integer_Array) return Integer_Array with Pure_Function;
--Distributed negation
function "abs"(Value : Integer_Array) return Integer_Array with Pure_Function;
--Distributed absolute value
function "+"(Left : Integer_Array; Right : Integer_Array) return Integer_Array with Pure_Function;
--Array addition, add together each respective element of Left and Right
function "+"(Left : Integer_Array; Right : Integer) return Integer_Array with Pure_Function;
--Distributed addition, add each element of Left with Right
function "+"(Left : Integer; Right : Integer_Array) return Integer_Array with Pure_Function;
--Distributed addition, add Left with each element of Right
function "-"(Left : Integer_Array; Right : Integer_Array) return Integer_Array with Pure_Function;
--Array subtraction, subtract each respective element of Left and Right
function "-"(Left : Integer_Array; Right : Integer) return Integer_Array with Pure_Function;
--Distributed subtraction, subtract Right from each element of Left
function "-"(Left : Integer; Right : Integer_Array) return Integer_Array with Pure_Function;
--Distributed subtraction, subtract each element of Right from Left
function "*"(Left : Integer_Array; Right : Integer_Array) return Integer_Array with Pure_Function;
--Array multiplication, multiply together each respective element
function "*"(Left : Integer_Array; Right : Integer) return Integer_Array with Pure_Function;
--Distributed multiplication, multiply each element of Left with Right
function "*"(Left : Integer; Right : Integer_Array) return Integer_Array with Pure_Function;
--Distributed multiplication, multiply Left with each element of Right
function "/"(Left : Integer_Array; Right : Integer_Array) return Integer_Array with Pure_Function;
--Array division, divide each respective element of Left and Right
function "/"(Left : Integer_Array; Right : Integer) return Integer_Array with Pure_Function;
--Distributed division, divide each element of Left by Right
function "/"(Left : Integer; Right : Integer_Array) return Integer_Array with Pure_Function;
--Distributed division, each Left by each element of Right
function "rem"(Left : Integer_Array; Right : Integer_Array) return Integer_Array with Pure_Function;
--Array remainder, divide each respective element of Left and Right, keep the remainder
function "rem"(Left : Integer_Array; Right : Integer) return Integer_Array with Pure_Function;
--Distributed remainder, divide each element of Left by Right, keep the remainder
function "rem"(Left : Integer; Right : Integer_Array) return Integer_Array with Pure_Function;
--Distributed remainder, divide Left by each element of Right
function "mod"(Left : Integer_Array; Right : Integer_Array) return Integer_Array with Pure_Function;
--Distributed modulus, divide each respective element of Left and Right, keep the remainder
function "mod"(Left : Integer_Array; Right : Integer) return Integer_Array with Pure_Function;
--Distributed modulus, divide each element of Left by Right, keep the remainder
function "mod"(Left : Integer; Right : Integer_Array) return Integer_Array with Pure_Function;
--Distributed modulus, divide Left by each element of Right
function "="(Left : Integer_Array; Right : Integer_Array) return Boolean with Pure_Function;
--Array equality, test each respective element of Left and Right
function "="(Left : Integer_Array; Right : Integer) return Boolean with Pure_Function;
--Distributed equality, test each element of Left with Right
function "="(Left : Integer; Right : Integer_Array) return Boolean with Pure_Function;
--Distributed equality, test Left with each element of Right
function "<"(Left : Integer_Array; Right : Integer_Array) return Boolean with Pure_Function;
--Distributed lesser, test each respective element of Left with Right
function "<"(Left : Integer_Array; Right : Integer) return Boolean with Pure_Function;
--Distributed lesser, test each element of Left with Right
function "<"(Left : Integer; Right : Integer_Array) return Boolean with Pure_Function;
--Distributed lesser, test Left with each element of Right
function ">"(Left : Integer_Array; Right : Integer_Array) return Boolean with Pure_Function;
--Distributed greater, test each respective element of Left with Right
function ">"(Left : Integer_Array; Right : Integer) return Boolean with Pure_Function;
--Distributed greater, test each element of Left with Right
function ">"(Left : Integer; Right : Integer_Array) return Boolean with Pure_Function;
--Distributed greater, test Left with each element of Right
function "<="(Left : Integer_Array; Right : Integer_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test each respective element of Left with Right
function "<="(Left : Integer_Array; Right : Integer) return Boolean with Pure_Function;
--Distributed lesser or equal, test each element of Left with Right
function "<="(Left : Integer; Right : Integer_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test Left with each element of Right
function ">="(Left : Integer_Array; Right : Integer_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test each respective element of Left with Right
function ">="(Left : Integer_Array; Right : Integer) return Boolean with Pure_Function;
--Distributed greater or equal, test each element of Left with Right
function ">="(Left : Integer; Right : Integer_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test Left with each element of Right
function Max is new Integer_Max(Integer, Integer_Array) with Pure_Function;
--Find the maximum value of the array
function Min is new Integer_Min(Integer, Integer_Array) with Pure_Function;
--Find the minimum value of the array
function Apply is new Integer_Apply_Procedure(Integer, Integer_Array);
--Apply the procedure to each value of the array, returning the result
function Map(Value : Integer_Array; Callback : access Procedure(Value : in out Integer)) return Integer_Array renames Apply;
function Apply is new Integer_Apply_Function(Integer, Integer_Array);
--Apply the function to each value of the array, returning the result
function Map(Value : Integer_Array; Callback : access Function(Value : Integer) return Integer) return Integer_Array renames Apply;
function Fold is new Integer_Fold(Integer, Integer_Array);
--Fold the array using the specified function
------------------------
-- Long Integer Array --
------------------------
type Long_Integer_Array is array(Positive range <>) of Long_Integer;
function "+"(Value : Long_Integer_Array) return Long_Integer_Array with Pure_Function;
--Distributed assertion
function "-"(Value : Long_Integer_Array) return Long_Integer_Array with Pure_Function;
--Distributed negation
function "abs"(Value : Long_Integer_Array) return Long_Integer_Array with Pure_Function;
--Distributed absolute value
function "+"(Left : Long_Integer_Array; Right : Long_Integer_Array) return Long_Integer_Array with Pure_Function;
--Array addition, add together each respective element of Left and Right
function "+"(Left : Long_Integer_Array; Right : Long_Integer) return Long_Integer_Array with Pure_Function;
--Distributed addition, add each element of Left with Right
function "+"(Left : Long_Integer; Right : Long_Integer_Array) return Long_Integer_Array with Pure_Function;
--Distributed addition, add Left with each element of Right
function "-"(Left : Long_Integer_Array; Right : Long_Integer_Array) return Long_Integer_Array with Pure_Function;
--Array subtraction, subtract each respective element of Left and Right
function "-"(Left : Long_Integer_Array; Right : Long_Integer) return Long_Integer_Array with Pure_Function;
--Distributed subtraction, subtract Right from each element of Left
function "-"(Left : Long_Integer; Right : Long_Integer_Array) return Long_Integer_Array with Pure_Function;
--Distributed subtraction, subtract each element of Right from Left
function "*"(Left : Long_Integer_Array; Right : Long_Integer_Array) return Long_Integer_Array with Pure_Function;
--Array multiplication, multiply together each respective element
function "*"(Left : Long_Integer_Array; Right : Long_Integer) return Long_Integer_Array with Pure_Function;
--Distributed multiplication, multiply each element of Left with Right
function "*"(Left : Long_Integer; Right : Long_Integer_Array) return Long_Integer_Array with Pure_Function;
--Distributed multiplication, multiply Left with each element of Right
function "/"(Left : Long_Integer_Array; Right : Long_Integer_Array) return Long_Integer_Array with Pure_Function;
--Array division, divide each respective element of Left and Right
function "/"(Left : Long_Integer_Array; Right : Long_Integer) return Long_Integer_Array with Pure_Function;
--Distributed division, divide each element of Left by Right
function "/"(Left : Long_Integer; Right : Long_Integer_Array) return Long_Integer_Array with Pure_Function;
--Distributed division, each Left by each element of Right
function "rem"(Left : Long_Integer_Array; Right : Long_Integer_Array) return Long_Integer_Array with Pure_Function;
--Array remainder, divide each respective element of Left and Right, keep the remainder
function "rem"(Left : Long_Integer_Array; Right : Long_Integer) return Long_Integer_Array with Pure_Function;
--Distributed remainder, divide each element of Left by Right, keep the remainder
function "rem"(Left : Long_Integer; Right : Long_Integer_Array) return Long_Integer_Array with Pure_Function;
--Distributed remainder, divide Left by each element of Right
function "mod"(Left : Long_Integer_Array; Right : Long_Integer_Array) return Long_Integer_Array with Pure_Function;
--Distributed modulus, divide each respective element of Left and Right, keep the remainder
function "mod"(Left : Long_Integer_Array; Right : Long_Integer) return Long_Integer_Array with Pure_Function;
--Distributed modulus, divide each element of Left by Right, keep the remainder
function "mod"(Left : Long_Integer; Right : Long_Integer_Array) return Long_Integer_Array with Pure_Function;
--Distributed modulus, divide Left by each element of Right
function "="(Left : Long_Integer_Array; Right : Long_Integer_Array) return Boolean with Pure_Function;
--Array equality, test each respective element of Left and Right
function "="(Left : Long_Integer_Array; Right : Long_Integer) return Boolean with Pure_Function;
--Distributed equality, test each element of Left with Right
function "="(Left : Long_Integer; Right : Long_Integer_Array) return Boolean with Pure_Function;
--Distributed equality, test Left with each element of Right
function "<"(Left : Long_Integer_Array; Right : Long_Integer_Array) return Boolean with Pure_Function;
--Distributed lesser, test each respective element of Left with Right
function "<"(Left : Long_Integer_Array; Right : Long_Integer) return Boolean with Pure_Function;
--Distributed lesser, test each element of Left with Right
function "<"(Left : Long_Integer; Right : Long_Integer_Array) return Boolean with Pure_Function;
--Distributed lesser, test Left with each element of Right
function ">"(Left : Long_Integer_Array; Right : Long_Integer_Array) return Boolean with Pure_Function;
--Distributed greater, test each respective element of Left with Right
function ">"(Left : Long_Integer_Array; Right : Long_Integer) return Boolean with Pure_Function;
--Distributed greater, test each element of Left with Right
function ">"(Left : Long_Integer; Right : Long_Integer_Array) return Boolean with Pure_Function;
--Distributed greater, test Left with each element of Right
function "<="(Left : Long_Integer_Array; Right : Long_Integer_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test each respective element of Left with Right
function "<="(Left : Long_Integer_Array; Right : Long_Integer) return Boolean with Pure_Function;
--Distributed lesser or equal, test each element of Left with Right
function "<="(Left : Long_Integer; Right : Long_Integer_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test Left with each element of Right
function ">="(Left : Long_Integer_Array; Right : Long_Integer_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test each respective element of Left with Right
function ">="(Left : Long_Integer_Array; Right : Long_Integer) return Boolean with Pure_Function;
--Distributed greater or equal, test each element of Left with Right
function ">="(Left : Long_Integer; Right : Long_Integer_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test Left with each element of Right
function Max is new Integer_Max(Long_Integer, Long_Integer_Array) with Pure_Function;
--Find the maximum value of the array
function Min is new Integer_Min(Long_Integer, Long_Integer_Array) with Pure_Function;
--Find the minimum value of the array
function Apply is new Integer_Apply_Procedure(Long_Integer, Long_Integer_Array);
--Apply the procedure to each value of the array, returning the result
function Map(Value : Long_Integer_Array; Callback : access Procedure(Value : in out Long_Integer)) return Long_Integer_Array renames Apply;
function Apply is new Integer_Apply_Function(Long_Integer, Long_Integer_Array);
--Apply the function to each value of the array, returning the result
function Map(Value : Long_Integer_Array; Callback : access Function(Value : Long_Integer) return Long_Integer) return Long_Integer_Array renames Apply;
function Fold is new Integer_Fold(Long_Integer, Long_Integer_Array);
--Fold the array using the specified function
-----------------------------
-- Long Long Integer Array --
-----------------------------
type Long_Long_Integer_Array is array(Positive range <>) of Long_Long_Integer;
function "+"(Value : Long_Long_Integer_Array) return Long_Long_Integer_Array with Pure_Function;
--Distributed assertion
function "-"(Value : Long_Long_Integer_Array) return Long_Long_Integer_Array with Pure_Function;
--Distributed negation
function "abs"(Value : Long_Long_Integer_Array) return Long_Long_Integer_Array with Pure_Function;
--Distributed absolute value
function "+"(Left : Long_Long_Integer_Array; Right : Long_Long_Integer_Array) return Long_Long_Integer_Array with Pure_Function;
--Array addition, add together each respective element of Left and Right
function "+"(Left : Long_Long_Integer_Array; Right : Long_Long_Integer) return Long_Long_Integer_Array with Pure_Function;
--Distributed addition, add each element of Left with Right
function "+"(Left : Long_Long_Integer; Right : Long_Long_Integer_Array) return Long_Long_Integer_Array with Pure_Function;
--Distributed addition, add Left with each element of Right
function "-"(Left : Long_Long_Integer_Array; Right : Long_Long_Integer_Array) return Long_Long_Integer_Array with Pure_Function;
--Array subtraction, subtract each respective element of Left and Right
function "-"(Left : Long_Long_Integer_Array; Right : Long_Long_Integer) return Long_Long_Integer_Array with Pure_Function;
--Distributed subtraction, subtract Right from each element of Left
function "-"(Left : Long_Long_Integer; Right : Long_Long_Integer_Array) return Long_Long_Integer_Array with Pure_Function;
--Distributed subtraction, subtract each element of Right from Left
function "*"(Left : Long_Long_Integer_Array; Right : Long_Long_Integer_Array) return Long_Long_Integer_Array with Pure_Function;
--Array multiplication, multiply together each respective element
function "*"(Left : Long_Long_Integer_Array; Right : Long_Long_Integer) return Long_Long_Integer_Array with Pure_Function;
--Distributed multiplication, multiply each element of Left with Right
function "*"(Left : Long_Long_Integer; Right : Long_Long_Integer_Array) return Long_Long_Integer_Array with Pure_Function;
--Distributed multiplication, multiply Left with each element of Right
function "/"(Left : Long_Long_Integer_Array; Right : Long_Long_Integer_Array) return Long_Long_Integer_Array with Pure_Function;
--Array division, divide each respective element of Left and Right
function "/"(Left : Long_Long_Integer_Array; Right : Long_Long_Integer) return Long_Long_Integer_Array with Pure_Function;
--Distributed division, divide each element of Left by Right
function "/"(Left : Long_Long_Integer; Right : Long_Long_Integer_Array) return Long_Long_Integer_Array with Pure_Function;
--Distributed division, each Left by each element of Right
function "rem"(Left : Long_Long_Integer_Array; Right : Long_Long_Integer_Array) return Long_Long_Integer_Array with Pure_Function;
--Array remainder, divide each respective element of Left and Right, keep the remainder
function "rem"(Left : Long_Long_Integer_Array; Right : Long_Long_Integer) return Long_Long_Integer_Array with Pure_Function;
--Distributed remainder, divide each element of Left by Right, keep the remainder
function "rem"(Left : Long_Long_Integer; Right : Long_Long_Integer_Array) return Long_Long_Integer_Array with Pure_Function;
--Distributed remainder, divide Left by each element of Right
function "mod"(Left : Long_Long_Integer_Array; Right : Long_Long_Integer_Array) return Long_Long_Integer_Array with Pure_Function;
--Distributed modulus, divide each respective element of Left and Right, keep the remainder
function "mod"(Left : Long_Long_Integer_Array; Right : Long_Long_Integer) return Long_Long_Integer_Array with Pure_Function;
--Distributed modulus, divide each element of Left by Right, keep the remainder
function "mod"(Left : Long_Long_Integer; Right : Long_Long_Integer_Array) return Long_Long_Integer_Array with Pure_Function;
--Distributed modulus, divide Left by each element of Right
function "="(Left : Long_Long_Integer_Array; Right : Long_Long_Integer_Array) return Boolean with Pure_Function;
--Array equality, test each respective element of Left and Right
function "="(Left : Long_Long_Integer_Array; Right : Long_Long_Integer) return Boolean with Pure_Function;
--Distributed equality, test each element of Left with Right
function "="(Left : Long_Long_Integer; Right : Long_Long_Integer_Array) return Boolean with Pure_Function;
--Distributed equality, test Left with each element of Right
function "<"(Left : Long_Long_Integer_Array; Right : Long_Long_Integer_Array) return Boolean with Pure_Function;
--Distributed lesser, test each respective element of Left with Right
function "<"(Left : Long_Long_Integer_Array; Right : Long_Long_Integer) return Boolean with Pure_Function;
--Distributed lesser, test each element of Left with Right
function "<"(Left : Long_Long_Integer; Right : Long_Long_Integer_Array) return Boolean with Pure_Function;
--Distributed lesser, test Left with each element of Right
function ">"(Left : Long_Long_Integer_Array; Right : Long_Long_Integer_Array) return Boolean with Pure_Function;
--Distributed greater, test each respective element of Left with Right
function ">"(Left : Long_Long_Integer_Array; Right : Long_Long_Integer) return Boolean with Pure_Function;
--Distributed greater, test each element of Left with Right
function ">"(Left : Long_Long_Integer; Right : Long_Long_Integer_Array) return Boolean with Pure_Function;
--Distributed greater, test Left with each element of Right
function "<="(Left : Long_Long_Integer_Array; Right : Long_Long_Integer_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test each respective element of Left with Right
function "<="(Left : Long_Long_Integer_Array; Right : Long_Long_Integer) return Boolean with Pure_Function;
--Distributed lesser or equal, test each element of Left with Right
function "<="(Left : Long_Long_Integer; Right : Long_Long_Integer_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test Left with each element of Right
function ">="(Left : Long_Long_Integer_Array; Right : Long_Long_Integer_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test each respective element of Left with Right
function ">="(Left : Long_Long_Integer_Array; Right : Long_Long_Integer) return Boolean with Pure_Function;
--Distributed greater or equal, test each element of Left with Right
function ">="(Left : Long_Long_Integer; Right : Long_Long_Integer_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test Left with each element of Right
function Max is new Integer_Max(Long_Long_Integer, Long_Long_Integer_Array) with Pure_Function;
--Find the maximum value of the array
function Min is new Integer_Min(Long_Long_Integer, Long_Long_Integer_Array) with Pure_Function;
--Find the minimum value of the array
function Apply is new Integer_Apply_Procedure(Long_Long_Integer, Long_Long_Integer_Array);
--Apply the procedure to each value of the array, returning the result
function Map(Value : Long_Long_Integer_Array; Callback : access Procedure(Value : in out Long_Long_Integer)) return Long_Long_Integer_Array renames Apply;
function Apply is new Integer_Apply_Function(Long_Long_Integer, Long_Long_Integer_Array);
--Apply the function to each value of the array, returning the result
function Map(Value : Long_Long_Integer_Array; Callback : access Function(Value : Long_Long_Integer) return Long_Long_Integer) return Long_Long_Integer_Array renames Apply;
function Fold is new Integer_Fold(Long_Long_Integer, Long_Long_Integer_Array);
--Fold the array using the specified function
-------------------------------
-- Short Short Modular Array --
-------------------------------
type Short_Short_Modular_Array is array(Positive range <>) of Short_Short_Modular;
function "+"(Value : Short_Short_Modular_Array) return Short_Short_Modular_Array with Pure_Function;
--Distributed assertion
function "abs"(Value : Short_Short_Modular_Array) return Short_Short_Modular_Array with Pure_Function;
--Distributed absolute value
function "+"(Left : Short_Short_Modular_Array; Right : Short_Short_Modular_Array) return Short_Short_Modular_Array with Pure_Function;
--Array addition, add together each respective element of Left and Right
function "+"(Left : Short_Short_Modular_Array; Right : Short_Short_Modular) return Short_Short_Modular_Array with Pure_Function;
--Distributed addition, add each element of Left with Right
function "+"(Left : Short_Short_Modular; Right : Short_Short_Modular_Array) return Short_Short_Modular_Array with Pure_Function;
--Distributed addition, add Left with each element of Right
function "-"(Left : Short_Short_Modular_Array; Right : Short_Short_Modular_Array) return Short_Short_Modular_Array with Pure_Function;
--Array subtraction, subtract each respective element of Left and Right
function "-"(Left : Short_Short_Modular_Array; Right : Short_Short_Modular) return Short_Short_Modular_Array with Pure_Function;
--Distributed subtraction, subtract Right from each element of Left
function "-"(Left : Short_Short_Modular; Right : Short_Short_Modular_Array) return Short_Short_Modular_Array with Pure_Function;
--Distributed subtraction, subtract each element of Right from Left
function "*"(Left : Short_Short_Modular_Array; Right : Short_Short_Modular_Array) return Short_Short_Modular_Array with Pure_Function;
--Array multiplication, multiply together each respective element
function "*"(Left : Short_Short_Modular_Array; Right : Short_Short_Modular) return Short_Short_Modular_Array with Pure_Function;
--Distributed multiplication, multiply each element of Left with Right
function "*"(Left : Short_Short_Modular; Right : Short_Short_Modular_Array) return Short_Short_Modular_Array with Pure_Function;
--Distributed multiplication, multiply Left with each element of Right
function "/"(Left : Short_Short_Modular_Array; Right : Short_Short_Modular_Array) return Short_Short_Modular_Array with Pure_Function;
--Array division, divide each respective element of Left and Right
function "/"(Left : Short_Short_Modular_Array; Right : Short_Short_Modular) return Short_Short_Modular_Array with Pure_Function;
--Distributed division, divide each element of Left by Right
function "/"(Left : Short_Short_Modular; Right : Short_Short_Modular_Array) return Short_Short_Modular_Array with Pure_Function;
--Distributed division, each Left by each element of Right
function "rem"(Left : Short_Short_Modular_Array; Right : Short_Short_Modular_Array) return Short_Short_Modular_Array with Pure_Function;
--Array remainder, divide each respective element of Left and Right, keep the remainder
function "rem"(Left : Short_Short_Modular_Array; Right : Short_Short_Modular) return Short_Short_Modular_Array with Pure_Function;
--Distributed remainder, divide each element of Left by Right, keep the remainder
function "rem"(Left : Short_Short_Modular; Right : Short_Short_Modular_Array) return Short_Short_Modular_Array with Pure_Function;
--Distributed remainder, divide Left by each element of Right
function "mod"(Left : Short_Short_Modular_Array; Right : Short_Short_Modular_Array) return Short_Short_Modular_Array with Pure_Function;
--Distributed modulus, divide each respective element of Left and Right, keep the remainder
function "mod"(Left : Short_Short_Modular_Array; Right : Short_Short_Modular) return Short_Short_Modular_Array with Pure_Function;
--Distributed modulus, divide each element of Left by Right, keep the remainder
function "mod"(Left : Short_Short_Modular; Right : Short_Short_Modular_Array) return Short_Short_Modular_Array with Pure_Function;
--Distributed modulus, divide Left by each element of Right
function "not"(Value : Short_Short_Modular_Array) return Short_Short_Modular_Array with Pure_Function;
--Distributed bitwise not, not each element
function "and"(Left : Short_Short_Modular_Array; Right : Short_Short_Modular_Array) return Short_Short_Modular_Array with Pure_Function;
--Array bitwise and, and each respective element of Left and Right
function "and"(Left : Short_Short_Modular_Array; Right : Short_Short_Modular) return Short_Short_Modular_Array with Pure_Function;
--Distributed bitwise and, and each element of Left with Right
function "and"(Left : Short_Short_Modular; Right : Short_Short_Modular_Array) return Short_Short_Modular_Array with Pure_Function;
--Distributed bitwise and, and each element of Right with Left
function "or"(Left : Short_Short_Modular_Array; Right : Short_Short_Modular_Array) return Short_Short_Modular_Array with Pure_Function;
--Array bitwise or, or each respective element of Left and Right
function "or"(Left : Short_Short_Modular_Array; Right : Short_Short_Modular) return Short_Short_Modular_Array with Pure_Function;
--Distributed bitwise or, or each element of Left with Right
function "or"(Left : Short_Short_Modular; Right : Short_Short_Modular_Array) return Short_Short_Modular_Array with Pure_Function;
--Distributed bitwise or, or each element of Right with Left
function "xor"(Left : Short_Short_Modular_Array; Right : Short_Short_Modular_Array) return Short_Short_Modular_Array with Pure_Function;
--Array bitwise xor, xor each respective element of Left and Right
function "xor"(Left : Short_Short_Modular_Array; Right : Short_Short_Modular) return Short_Short_Modular_Array with Pure_Function;
--Distributed bitwise xor, xor each element of Left with Right
function "xor"(Left : Short_Short_Modular; Right : Short_Short_Modular_Array) return Short_Short_Modular_Array with Pure_Function;
--Distributed bitwise xor, xor each element of Right with Left
function "="(Left : Short_Short_Modular_Array; Right : Short_Short_Modular_Array) return Boolean with Pure_Function;
--Array equality, test each respective element of Left and Right
function "="(Left : Short_Short_Modular_Array; Right : Short_Short_Modular) return Boolean with Pure_Function;
--Distributed equality, test each element of Left with Right
function "="(Left : Short_Short_Modular; Right : Short_Short_Modular_Array) return Boolean with Pure_Function;
--Distributed equality, test Left with each element of Right
function "<"(Left : Short_Short_Modular_Array; Right : Short_Short_Modular_Array) return Boolean with Pure_Function;
--Distributed lesser, test each respective element of Left with Right
function "<"(Left : Short_Short_Modular_Array; Right : Short_Short_Modular) return Boolean with Pure_Function;
--Distributed lesser, test each element of Left with Right
function "<"(Left : Short_Short_Modular; Right : Short_Short_Modular_Array) return Boolean with Pure_Function;
--Distributed lesser, test Left with each element of Right
function ">"(Left : Short_Short_Modular_Array; Right : Short_Short_Modular_Array) return Boolean with Pure_Function;
--Distributed greater, test each respective element of Left with Right
function ">"(Left : Short_Short_Modular_Array; Right : Short_Short_Modular) return Boolean with Pure_Function;
--Distributed greater, test each element of Left with Right
function ">"(Left : Short_Short_Modular; Right : Short_Short_Modular_Array) return Boolean with Pure_Function;
--Distributed greater, test Left with each element of Right
function "<="(Left : Short_Short_Modular_Array; Right : Short_Short_Modular_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test each respective element of Left with Right
function "<="(Left : Short_Short_Modular_Array; Right : Short_Short_Modular) return Boolean with Pure_Function;
--Distributed lesser or equal, test each element of Left with Right
function "<="(Left : Short_Short_Modular; Right : Short_Short_Modular_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test Left with each element of Right
function ">="(Left : Short_Short_Modular_Array; Right : Short_Short_Modular_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test each respective element of Left with Right
function ">="(Left : Short_Short_Modular_Array; Right : Short_Short_Modular) return Boolean with Pure_Function;
--Distributed greater or equal, test each element of Left with Right
function ">="(Left : Short_Short_Modular; Right : Short_Short_Modular_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test Left with each element of Right
function Max is new Modular_Max(Short_Short_Modular, Short_Short_Modular_Array) with Pure_Function;
--Find the maximum value of the array
function Min is new Modular_Min(Short_Short_Modular, Short_Short_Modular_Array) with Pure_Function;
--Find the minimum value of the array
function Apply is new Modular_Apply_Procedure(Short_Short_Modular, Short_Short_Modular_Array);
--Apply the procedure to each value of the array, returning the result
function Map(Value : Short_Short_Modular_Array; Callback : access Procedure(Value : in out Short_Short_Modular)) return Short_Short_Modular_Array renames Apply;
function Apply is new Modular_Apply_Function(Short_Short_Modular, Short_Short_Modular_Array);
--Apply the function to each value of the array, returning the result
function Map(Value : Short_Short_Modular_Array; Callback : access Function(Value : Short_Short_Modular) return Short_Short_Modular) return Short_Short_Modular_Array renames Apply;
function Fold is new Modular_Fold(Short_Short_Modular, Short_Short_Modular_Array);
--Fold the array using the specified function
-------------------------
-- Short Modular Array --
-------------------------
type Short_Modular_Array is array(Positive range <>) of Short_Modular;
function "+"(Value : Short_Modular_Array) return Short_Modular_Array with Pure_Function;
--Distributed assertion
function "abs"(Value : Short_Modular_Array) return Short_Modular_Array with Pure_Function;
--Distributed absolute value
function "+"(Left : Short_Modular_Array; Right : Short_Modular_Array) return Short_Modular_Array with Pure_Function;
--Array addition, add together each respective element of Left and Right
function "+"(Left : Short_Modular_Array; Right : Short_Modular) return Short_Modular_Array with Pure_Function;
--Distributed addition, add each element of Left with Right
function "+"(Left : Short_Modular; Right : Short_Modular_Array) return Short_Modular_Array with Pure_Function;
--Distributed addition, add Left with each element of Right
function "-"(Left : Short_Modular_Array; Right : Short_Modular_Array) return Short_Modular_Array with Pure_Function;
--Array subtraction, subtract each respective element of Left and Right
function "-"(Left : Short_Modular_Array; Right : Short_Modular) return Short_Modular_Array with Pure_Function;
--Distributed subtraction, subtract Right from each element of Left
function "-"(Left : Short_Modular; Right : Short_Modular_Array) return Short_Modular_Array with Pure_Function;
--Distributed subtraction, subtract each element of Right from Left
function "*"(Left : Short_Modular_Array; Right : Short_Modular_Array) return Short_Modular_Array with Pure_Function;
--Array multiplication, multiply together each respective element
function "*"(Left : Short_Modular_Array; Right : Short_Modular) return Short_Modular_Array with Pure_Function;
--Distributed multiplication, multiply each element of Left with Right
function "*"(Left : Short_Modular; Right : Short_Modular_Array) return Short_Modular_Array with Pure_Function;
--Distributed multiplication, multiply Left with each element of Right
function "/"(Left : Short_Modular_Array; Right : Short_Modular_Array) return Short_Modular_Array with Pure_Function;
--Array division, divide each respective element of Left and Right
function "/"(Left : Short_Modular_Array; Right : Short_Modular) return Short_Modular_Array with Pure_Function;
--Distributed division, divide each element of Left by Right
function "/"(Left : Short_Modular; Right : Short_Modular_Array) return Short_Modular_Array with Pure_Function;
--Distributed division, each Left by each element of Right
function "rem"(Left : Short_Modular_Array; Right : Short_Modular_Array) return Short_Modular_Array with Pure_Function;
--Array remainder, divide each respective element of Left and Right, keep the remainder
function "rem"(Left : Short_Modular_Array; Right : Short_Modular) return Short_Modular_Array with Pure_Function;
--Distributed remainder, divide each element of Left by Right, keep the remainder
function "rem"(Left : Short_Modular; Right : Short_Modular_Array) return Short_Modular_Array with Pure_Function;
--Distributed remainder, divide Left by each element of Right
function "mod"(Left : Short_Modular_Array; Right : Short_Modular_Array) return Short_Modular_Array with Pure_Function;
--Distributed modulus, divide each respective element of Left and Right, keep the remainder
function "mod"(Left : Short_Modular_Array; Right : Short_Modular) return Short_Modular_Array with Pure_Function;
--Distributed modulus, divide each element of Left by Right, keep the remainder
function "mod"(Left : Short_Modular; Right : Short_Modular_Array) return Short_Modular_Array with Pure_Function;
--Distributed modulus, divide Left by each element of Right
function "not"(Value : Short_Modular_Array) return Short_Modular_Array with Pure_Function;
--Distributed bitwise not, not each element
function "and"(Left : Short_Modular_Array; Right : Short_Modular_Array) return Short_Modular_Array with Pure_Function;
--Array bitwise and, and each respective element of Left and Right
function "and"(Left : Short_Modular_Array; Right : Short_Modular) return Short_Modular_Array with Pure_Function;
--Distributed bitwise and, and each element of Left with Right
function "and"(Left : Short_Modular; Right : Short_Modular_Array) return Short_Modular_Array with Pure_Function;
--Distributed bitwise and, and each element of Right with Left
function "or"(Left : Short_Modular_Array; Right : Short_Modular_Array) return Short_Modular_Array with Pure_Function;
--Array bitwise or, or each respective element of Left and Right
function "or"(Left : Short_Modular_Array; Right : Short_Modular) return Short_Modular_Array with Pure_Function;
--Distributed bitwise or, or each element of Left with Right
function "or"(Left : Short_Modular; Right : Short_Modular_Array) return Short_Modular_Array with Pure_Function;
--Distributed bitwise or, or each element of Right with Left
function "xor"(Left : Short_Modular_Array; Right : Short_Modular_Array) return Short_Modular_Array with Pure_Function;
--Array bitwise xor, xor each respective element of Left and Right
function "xor"(Left : Short_Modular_Array; Right : Short_Modular) return Short_Modular_Array with Pure_Function;
--Distributed bitwise xor, xor each element of Left with Right
function "xor"(Left : Short_Modular; Right : Short_Modular_Array) return Short_Modular_Array with Pure_Function;
--Distributed bitwise xor, xor each element of Right with Left
function "="(Left : Short_Modular_Array; Right : Short_Modular_Array) return Boolean with Pure_Function;
--Array equality, test each respective element of Left and Right
function "="(Left : Short_Modular_Array; Right : Short_Modular) return Boolean with Pure_Function;
--Distributed equality, test each element of Left with Right
function "="(Left : Short_Modular; Right : Short_Modular_Array) return Boolean with Pure_Function;
--Distributed equality, test Left with each element of Right
function "<"(Left : Short_Modular_Array; Right : Short_Modular_Array) return Boolean with Pure_Function;
--Distributed lesser, test each respective element of Left with Right
function "<"(Left : Short_Modular_Array; Right : Short_Modular) return Boolean with Pure_Function;
--Distributed lesser, test each element of Left with Right
function "<"(Left : Short_Modular; Right : Short_Modular_Array) return Boolean with Pure_Function;
--Distributed lesser, test Left with each element of Right
function ">"(Left : Short_Modular_Array; Right : Short_Modular_Array) return Boolean with Pure_Function;
--Distributed greater, test each respective element of Left with Right
function ">"(Left : Short_Modular_Array; Right : Short_Modular) return Boolean with Pure_Function;
--Distributed greater, test each element of Left with Right
function ">"(Left : Short_Modular; Right : Short_Modular_Array) return Boolean with Pure_Function;
--Distributed greater, test Left with each element of Right
function "<="(Left : Short_Modular_Array; Right : Short_Modular_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test each respective element of Left with Right
function "<="(Left : Short_Modular_Array; Right : Short_Modular) return Boolean with Pure_Function;
--Distributed lesser or equal, test each element of Left with Right
function "<="(Left : Short_Modular; Right : Short_Modular_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test Left with each element of Right
function ">="(Left : Short_Modular_Array; Right : Short_Modular_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test each respective element of Left with Right
function ">="(Left : Short_Modular_Array; Right : Short_Modular) return Boolean with Pure_Function;
--Distributed greater or equal, test each element of Left with Right
function ">="(Left : Short_Modular; Right : Short_Modular_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test Left with each element of Right
function Max is new Modular_Max(Short_Modular, Short_Modular_Array) with Pure_Function;
--Find the maximum value of the array
function Min is new Modular_Min(Short_Modular, Short_Modular_Array) with Pure_Function;
--Find the minimum value of the array
function Apply is new Modular_Apply_Procedure(Short_Modular, Short_Modular_Array);
--Apply the procedure to each value of the array, returning the result
function Map(Value : Short_Modular_Array; Callback : access Procedure(Value : in out Short_Modular)) return Short_Modular_Array renames Apply;
function Apply is new Modular_Apply_Function(Short_Modular, Short_Modular_Array);
--Apply the function to each value of the array, returning the result
function Map(Value : Short_Modular_Array; Callback : access Function(Value : Short_Modular) return Short_Modular) return Short_Modular_Array renames Apply;
function Fold is new Modular_Fold(Short_Modular, Short_Modular_Array);
--Fold the array using the specified function
-------------------
-- Modular Array --
-------------------
type Modular_Array is array(Positive range <>) of Modular;
function "+"(Value : Modular_Array) return Modular_Array with Pure_Function;
--Distributed assertion
function "abs"(Value : Modular_Array) return Modular_Array with Pure_Function;
--Distributed absolute value
function "+"(Left : Modular_Array; Right : Modular_Array) return Modular_Array with Pure_Function;
--Array addition, add together each respective element of Left and Right
function "+"(Left : Modular_Array; Right : Modular) return Modular_Array with Pure_Function;
--Distributed addition, add each element of Left with Right
function "+"(Left : Modular; Right : Modular_Array) return Modular_Array with Pure_Function;
--Distributed addition, add Left with each element of Right
function "-"(Left : Modular_Array; Right : Modular_Array) return Modular_Array with Pure_Function;
--Array subtraction, subtract each respective element of Left and Right
function "-"(Left : Modular_Array; Right : Modular) return Modular_Array with Pure_Function;
--Distributed subtraction, subtract Right from each element of Left
function "-"(Left : Modular; Right : Modular_Array) return Modular_Array with Pure_Function;
--Distributed subtraction, subtract each element of Right from Left
function "*"(Left : Modular_Array; Right : Modular_Array) return Modular_Array with Pure_Function;
--Array multiplication, multiply together each respective element
function "*"(Left : Modular_Array; Right : Modular) return Modular_Array with Pure_Function;
--Distributed multiplication, multiply each element of Left with Right
function "*"(Left : Modular; Right : Modular_Array) return Modular_Array with Pure_Function;
--Distributed multiplication, multiply Left with each element of Right
function "/"(Left : Modular_Array; Right : Modular_Array) return Modular_Array with Pure_Function;
--Array division, divide each respective element of Left and Right
function "/"(Left : Modular_Array; Right : Modular) return Modular_Array with Pure_Function;
--Distributed division, divide each element of Left by Right
function "/"(Left : Modular; Right : Modular_Array) return Modular_Array with Pure_Function;
--Distributed division, each Left by each element of Right
function "rem"(Left : Modular_Array; Right : Modular_Array) return Modular_Array with Pure_Function;
--Array remainder, divide each respective element of Left and Right, keep the remainder
function "rem"(Left : Modular_Array; Right : Modular) return Modular_Array with Pure_Function;
--Distributed remainder, divide each element of Left by Right, keep the remainder
function "rem"(Left : Modular; Right : Modular_Array) return Modular_Array with Pure_Function;
--Distributed remainder, divide Left by each element of Right
function "mod"(Left : Modular_Array; Right : Modular_Array) return Modular_Array with Pure_Function;
--Distributed modulus, divide each respective element of Left and Right, keep the remainder
function "mod"(Left : Modular_Array; Right : Modular) return Modular_Array with Pure_Function;
--Distributed modulus, divide each element of Left by Right, keep the remainder
function "mod"(Left : Modular; Right : Modular_Array) return Modular_Array with Pure_Function;
--Distributed modulus, divide Left by each element of Right
function "not"(Value : Modular_Array) return Modular_Array with Pure_Function;
--Distributed bitwise not, not each element
function "and"(Left : Modular_Array; Right : Modular_Array) return Modular_Array with Pure_Function;
--Array bitwise and, and each respective element of Left and Right
function "and"(Left : Modular_Array; Right : Modular) return Modular_Array with Pure_Function;
--Distributed bitwise and, and each element of Left with Right
function "and"(Left : Modular; Right : Modular_Array) return Modular_Array with Pure_Function;
--Distributed bitwise and, and each element of Right with Left
function "or"(Left : Modular_Array; Right : Modular_Array) return Modular_Array with Pure_Function;
--Array bitwise or, or each respective element of Left and Right
function "or"(Left : Modular_Array; Right : Modular) return Modular_Array with Pure_Function;
--Distributed bitwise or, or each element of Left with Right
function "or"(Left : Modular; Right : Modular_Array) return Modular_Array with Pure_Function;
--Distributed bitwise or, or each element of Right with Left
function "xor"(Left : Modular_Array; Right : Modular_Array) return Modular_Array with Pure_Function;
--Array bitwise xor, xor each respective element of Left and Right
function "xor"(Left : Modular_Array; Right : Modular) return Modular_Array with Pure_Function;
--Distributed bitwise xor, xor each element of Left with Right
function "xor"(Left : Modular; Right : Modular_Array) return Modular_Array with Pure_Function;
--Distributed bitwise xor, xor each element of Right with Left
function "="(Left : Modular_Array; Right : Modular_Array) return Boolean with Pure_Function;
--Array equality, test each respective element of Left and Right
function "="(Left : Modular_Array; Right : Modular) return Boolean with Pure_Function;
--Distributed equality, test each element of Left with Right
function "="(Left : Modular; Right : Modular_Array) return Boolean with Pure_Function;
--Distributed equality, test Left with each element of Right
function "<"(Left : Modular_Array; Right : Modular_Array) return Boolean with Pure_Function;
--Distributed lesser, test each respective element of Left with Right
function "<"(Left : Modular_Array; Right : Modular) return Boolean with Pure_Function;
--Distributed lesser, test each element of Left with Right
function "<"(Left : Modular; Right : Modular_Array) return Boolean with Pure_Function;
--Distributed lesser, test Left with each element of Right
function ">"(Left : Modular_Array; Right : Modular_Array) return Boolean with Pure_Function;
--Distributed greater, test each respective element of Left with Right
function ">"(Left : Modular_Array; Right : Modular) return Boolean with Pure_Function;
--Distributed greater, test each element of Left with Right
function ">"(Left : Modular; Right : Modular_Array) return Boolean with Pure_Function;
--Distributed greater, test Left with each element of Right
function "<="(Left : Modular_Array; Right : Modular_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test each respective element of Left with Right
function "<="(Left : Modular_Array; Right : Modular) return Boolean with Pure_Function;
--Distributed lesser or equal, test each element of Left with Right
function "<="(Left : Modular; Right : Modular_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test Left with each element of Right
function ">="(Left : Modular_Array; Right : Modular_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test each respective element of Left with Right
function ">="(Left : Modular_Array; Right : Modular) return Boolean with Pure_Function;
--Distributed greater or equal, test each element of Left with Right
function ">="(Left : Modular; Right : Modular_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test Left with each element of Right
function Max is new Modular_Max(Modular, Modular_Array) with Pure_Function;
--Find the maximum value of the array
function Min is new Modular_Min(Modular, Modular_Array) with Pure_Function;
--Find the minimum value of the array
function Apply is new Modular_Apply_Procedure(Modular, Modular_Array);
--Apply the procedure to each value of the array, returning the result
function Map(Value : Modular_Array; Callback : access Procedure(Value : in out Modular)) return Modular_Array renames Apply;
function Apply is new Modular_Apply_Function(Modular, Modular_Array);
--Apply the function to each value of the array, returning the result
function Map(Value : Modular_Array; Callback : access Function(Value : Modular) return Modular) return Modular_Array renames Apply;
function Fold is new Modular_Fold(Modular, Modular_Array);
--Fold the array using the specified function
------------------------
-- Long Modular Array --
------------------------
type Long_Modular_Array is array(Positive range <>) of Long_Modular;
function "+"(Value : Long_Modular_Array) return Long_Modular_Array with Pure_Function;
--Distributed assertion
function "abs"(Value : Long_Modular_Array) return Long_Modular_Array with Pure_Function;
--Distributed absolute value
function "+"(Left : Long_Modular_Array; Right : Long_Modular_Array) return Long_Modular_Array with Pure_Function;
--Array addition, add together each respective element of Left and Right
function "+"(Left : Long_Modular_Array; Right : Long_Modular) return Long_Modular_Array with Pure_Function;
--Distributed addition, add each element of Left with Right
function "+"(Left : Long_Modular; Right : Long_Modular_Array) return Long_Modular_Array with Pure_Function;
--Distributed addition, add Left with each element of Right
function "-"(Left : Long_Modular_Array; Right : Long_Modular_Array) return Long_Modular_Array with Pure_Function;
--Array subtraction, subtract each respective element of Left and Right
function "-"(Left : Long_Modular_Array; Right : Long_Modular) return Long_Modular_Array with Pure_Function;
--Distributed subtraction, subtract Right from each element of Left
function "-"(Left : Long_Modular; Right : Long_Modular_Array) return Long_Modular_Array with Pure_Function;
--Distributed subtraction, subtract each element of Right from Left
function "*"(Left : Long_Modular_Array; Right : Long_Modular_Array) return Long_Modular_Array with Pure_Function;
--Array multiplication, multiply together each respective element
function "*"(Left : Long_Modular_Array; Right : Long_Modular) return Long_Modular_Array with Pure_Function;
--Distributed multiplication, multiply each element of Left with Right
function "*"(Left : Long_Modular; Right : Long_Modular_Array) return Long_Modular_Array with Pure_Function;
--Distributed multiplication, multiply Left with each element of Right
function "/"(Left : Long_Modular_Array; Right : Long_Modular_Array) return Long_Modular_Array with Pure_Function;
--Array division, divide each respective element of Left and Right
function "/"(Left : Long_Modular_Array; Right : Long_Modular) return Long_Modular_Array with Pure_Function;
--Distributed division, divide each element of Left by Right
function "/"(Left : Long_Modular; Right : Long_Modular_Array) return Long_Modular_Array with Pure_Function;
--Distributed division, each Left by each element of Right
function "rem"(Left : Long_Modular_Array; Right : Long_Modular_Array) return Long_Modular_Array with Pure_Function;
--Array remainder, divide each respective element of Left and Right, keep the remainder
function "rem"(Left : Long_Modular_Array; Right : Long_Modular) return Long_Modular_Array with Pure_Function;
--Distributed remainder, divide each element of Left by Right, keep the remainder
function "rem"(Left : Long_Modular; Right : Long_Modular_Array) return Long_Modular_Array with Pure_Function;
--Distributed remainder, divide Left by each element of Right
function "mod"(Left : Long_Modular_Array; Right : Long_Modular_Array) return Long_Modular_Array with Pure_Function;
--Distributed modulus, divide each respective element of Left and Right, keep the remainder
function "mod"(Left : Long_Modular_Array; Right : Long_Modular) return Long_Modular_Array with Pure_Function;
--Distributed modulus, divide each element of Left by Right, keep the remainder
function "mod"(Left : Long_Modular; Right : Long_Modular_Array) return Long_Modular_Array with Pure_Function;
--Distributed modulus, divide Left by each element of Right
function "not"(Value : Long_Modular_Array) return Long_Modular_Array with Pure_Function;
--Distributed bitwise not, not each element
function "and"(Left : Long_Modular_Array; Right : Long_Modular_Array) return Long_Modular_Array with Pure_Function;
--Array bitwise and, and each respective element of Left and Right
function "and"(Left : Long_Modular_Array; Right : Long_Modular) return Long_Modular_Array with Pure_Function;
--Distributed bitwise and, and each element of Left with Right
function "and"(Left : Long_Modular; Right : Long_Modular_Array) return Long_Modular_Array with Pure_Function;
--Distributed bitwise and, and each element of Right with Left
function "or"(Left : Long_Modular_Array; Right : Long_Modular_Array) return Long_Modular_Array with Pure_Function;
--Array bitwise or, or each respective element of Left and Right
function "or"(Left : Long_Modular_Array; Right : Long_Modular) return Long_Modular_Array with Pure_Function;
--Distributed bitwise or, or each element of Left with Right
function "or"(Left : Long_Modular; Right : Long_Modular_Array) return Long_Modular_Array with Pure_Function;
--Distributed bitwise or, or each element of Right with Left
function "xor"(Left : Long_Modular_Array; Right : Long_Modular_Array) return Long_Modular_Array with Pure_Function;
--Array bitwise xor, xor each respective element of Left and Right
function "xor"(Left : Long_Modular_Array; Right : Long_Modular) return Long_Modular_Array with Pure_Function;
--Distributed bitwise xor, xor each element of Left with Right
function "xor"(Left : Long_Modular; Right : Long_Modular_Array) return Long_Modular_Array with Pure_Function;
--Distributed bitwise xor, xor each element of Right with Left
function "="(Left : Long_Modular_Array; Right : Long_Modular_Array) return Boolean with Pure_Function;
--Array equality, test each respective element of Left and Right
function "="(Left : Long_Modular_Array; Right : Long_Modular) return Boolean with Pure_Function;
--Distributed equality, test each element of Left with Right
function "="(Left : Long_Modular; Right : Long_Modular_Array) return Boolean with Pure_Function;
--Distributed equality, test Left with each element of Right
function "<"(Left : Long_Modular_Array; Right : Long_Modular_Array) return Boolean with Pure_Function;
--Distributed lesser, test each respective element of Left with Right
function "<"(Left : Long_Modular_Array; Right : Long_Modular) return Boolean with Pure_Function;
--Distributed lesser, test each element of Left with Right
function "<"(Left : Long_Modular; Right : Long_Modular_Array) return Boolean with Pure_Function;
--Distributed lesser, test Left with each element of Right
function ">"(Left : Long_Modular_Array; Right : Long_Modular_Array) return Boolean with Pure_Function;
--Distributed greater, test each respective element of Left with Right
function ">"(Left : Long_Modular_Array; Right : Long_Modular) return Boolean with Pure_Function;
--Distributed greater, test each element of Left with Right
function ">"(Left : Long_Modular; Right : Long_Modular_Array) return Boolean with Pure_Function;
--Distributed greater, test Left with each element of Right
function "<="(Left : Long_Modular_Array; Right : Long_Modular_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test each respective element of Left with Right
function "<="(Left : Long_Modular_Array; Right : Long_Modular) return Boolean with Pure_Function;
--Distributed lesser or equal, test each element of Left with Right
function "<="(Left : Long_Modular; Right : Long_Modular_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test Left with each element of Right
function ">="(Left : Long_Modular_Array; Right : Long_Modular_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test each respective element of Left with Right
function ">="(Left : Long_Modular_Array; Right : Long_Modular) return Boolean with Pure_Function;
--Distributed greater or equal, test each element of Left with Right
function ">="(Left : Long_Modular; Right : Long_Modular_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test Left with each element of Right
function Max is new Modular_Max(Long_Modular, Long_Modular_Array) with Pure_Function;
--Find the maximum value of the array
function Min is new Modular_Min(Long_Modular, Long_Modular_Array) with Pure_Function;
--Find the minimum value of the array
function Apply is new Modular_Apply_Procedure(Long_Modular, Long_Modular_Array);
--Apply the procedure to each value of the array, returning the result
function Map(Value : Long_Modular_Array; Callback : access Procedure(Value : in out Long_Modular)) return Long_Modular_Array renames Apply;
function Apply is new Modular_Apply_Function(Long_Modular, Long_Modular_Array);
--Apply the function to each value of the array, returning the result
function Map(Value : Long_Modular_Array; Callback : access Function(Value : Long_Modular) return Long_Modular) return Long_Modular_Array renames Apply;
function Fold is new Modular_Fold(Long_Modular, Long_Modular_Array);
--Fold the array using the specified function
-----------------------------
-- Long Long Modular Array --
-----------------------------
type Long_Long_Modular_Array is array(Positive range <>) of Long_Long_Modular;
function "+"(Value : Long_Long_Modular_Array) return Long_Long_Modular_Array with Pure_Function;
--Distributed assertion
function "abs"(Value : Long_Long_Modular_Array) return Long_Long_Modular_Array with Pure_Function;
--Distributed absolute value
function "+"(Left : Long_Long_Modular_Array; Right : Long_Long_Modular_Array) return Long_Long_Modular_Array with Pure_Function;
--Array addition, add together each respective element of Left and Right
function "+"(Left : Long_Long_Modular_Array; Right : Long_Long_Modular) return Long_Long_Modular_Array with Pure_Function;
--Distributed addition, add each element of Left with Right
function "+"(Left : Long_Long_Modular; Right : Long_Long_Modular_Array) return Long_Long_Modular_Array with Pure_Function;
--Distributed addition, add Left with each element of Right
function "-"(Left : Long_Long_Modular_Array; Right : Long_Long_Modular_Array) return Long_Long_Modular_Array with Pure_Function;
--Array subtraction, subtract each respective element of Left and Right
function "-"(Left : Long_Long_Modular_Array; Right : Long_Long_Modular) return Long_Long_Modular_Array with Pure_Function;
--Distributed subtraction, subtract Right from each element of Left
function "-"(Left : Long_Long_Modular; Right : Long_Long_Modular_Array) return Long_Long_Modular_Array with Pure_Function;
--Distributed subtraction, subtract each element of Right from Left
function "*"(Left : Long_Long_Modular_Array; Right : Long_Long_Modular_Array) return Long_Long_Modular_Array with Pure_Function;
--Array multiplication, multiply together each respective element
function "*"(Left : Long_Long_Modular_Array; Right : Long_Long_Modular) return Long_Long_Modular_Array with Pure_Function;
--Distributed multiplication, multiply each element of Left with Right
function "*"(Left : Long_Long_Modular; Right : Long_Long_Modular_Array) return Long_Long_Modular_Array with Pure_Function;
--Distributed multiplication, multiply Left with each element of Right
function "/"(Left : Long_Long_Modular_Array; Right : Long_Long_Modular_Array) return Long_Long_Modular_Array with Pure_Function;
--Array division, divide each respective element of Left and Right
function "/"(Left : Long_Long_Modular_Array; Right : Long_Long_Modular) return Long_Long_Modular_Array with Pure_Function;
--Distributed division, divide each element of Left by Right
function "/"(Left : Long_Long_Modular; Right : Long_Long_Modular_Array) return Long_Long_Modular_Array with Pure_Function;
--Distributed division, each Left by each element of Right
function "rem"(Left : Long_Long_Modular_Array; Right : Long_Long_Modular_Array) return Long_Long_Modular_Array with Pure_Function;
--Array remainder, divide each respective element of Left and Right, keep the remainder
function "rem"(Left : Long_Long_Modular_Array; Right : Long_Long_Modular) return Long_Long_Modular_Array with Pure_Function;
--Distributed remainder, divide each element of Left by Right, keep the remainder
function "rem"(Left : Long_Long_Modular; Right : Long_Long_Modular_Array) return Long_Long_Modular_Array with Pure_Function;
--Distributed remainder, divide Left by each element of Right
function "mod"(Left : Long_Long_Modular_Array; Right : Long_Long_Modular_Array) return Long_Long_Modular_Array with Pure_Function;
--Distributed modulus, divide each respective element of Left and Right, keep the remainder
function "mod"(Left : Long_Long_Modular_Array; Right : Long_Long_Modular) return Long_Long_Modular_Array with Pure_Function;
--Distributed modulus, divide each element of Left by Right, keep the remainder
function "mod"(Left : Long_Long_Modular; Right : Long_Long_Modular_Array) return Long_Long_Modular_Array with Pure_Function;
--Distributed modulus, divide Left by each element of Right
function "not"(Value : Long_Long_Modular_Array) return Long_Long_Modular_Array with Pure_Function;
--Distributed bitwise not, not each element
function "and"(Left : Long_Long_Modular_Array; Right : Long_Long_Modular_Array) return Long_Long_Modular_Array with Pure_Function;
--Array bitwise and, and each respective element of Left and Right
function "and"(Left : Long_Long_Modular_Array; Right : Long_Long_Modular) return Long_Long_Modular_Array with Pure_Function;
--Distributed bitwise and, and each element of Left with Right
function "and"(Left : Long_Long_Modular; Right : Long_Long_Modular_Array) return Long_Long_Modular_Array with Pure_Function;
--Distributed bitwise and, and each element of Right with Left
function "or"(Left : Long_Long_Modular_Array; Right : Long_Long_Modular_Array) return Long_Long_Modular_Array with Pure_Function;
--Array bitwise or, or each respective element of Left and Right
function "or"(Left : Long_Long_Modular_Array; Right : Long_Long_Modular) return Long_Long_Modular_Array with Pure_Function;
--Distributed bitwise or, or each element of Left with Right
function "or"(Left : Long_Long_Modular; Right : Long_Long_Modular_Array) return Long_Long_Modular_Array with Pure_Function;
--Distributed bitwise or, or each element of Right with Left
function "xor"(Left : Long_Long_Modular_Array; Right : Long_Long_Modular_Array) return Long_Long_Modular_Array with Pure_Function;
--Array bitwise xor, xor each respective element of Left and Right
function "xor"(Left : Long_Long_Modular_Array; Right : Long_Long_Modular) return Long_Long_Modular_Array with Pure_Function;
--Distributed bitwise xor, xor each element of Left with Right
function "xor"(Left : Long_Long_Modular; Right : Long_Long_Modular_Array) return Long_Long_Modular_Array with Pure_Function;
--Distributed bitwise xor, xor each element of Right with Left
function "="(Left : Long_Long_Modular_Array; Right : Long_Long_Modular_Array) return Boolean with Pure_Function;
--Array equality, test each respective element of Left and Right
function "="(Left : Long_Long_Modular_Array; Right : Long_Long_Modular) return Boolean with Pure_Function;
--Distributed equality, test each element of Left with Right
function "="(Left : Long_Long_Modular; Right : Long_Long_Modular_Array) return Boolean with Pure_Function;
--Distributed equality, test Left with each element of Right
function "<"(Left : Long_Long_Modular_Array; Right : Long_Long_Modular_Array) return Boolean with Pure_Function;
--Distributed lesser, test each respective element of Left with Right
function "<"(Left : Long_Long_Modular_Array; Right : Long_Long_Modular) return Boolean with Pure_Function;
--Distributed lesser, test each element of Left with Right
function "<"(Left : Long_Long_Modular; Right : Long_Long_Modular_Array) return Boolean with Pure_Function;
--Distributed lesser, test Left with each element of Right
function ">"(Left : Long_Long_Modular_Array; Right : Long_Long_Modular_Array) return Boolean with Pure_Function;
--Distributed greater, test each respective element of Left with Right
function ">"(Left : Long_Long_Modular_Array; Right : Long_Long_Modular) return Boolean with Pure_Function;
--Distributed greater, test each element of Left with Right
function ">"(Left : Long_Long_Modular; Right : Long_Long_Modular_Array) return Boolean with Pure_Function;
--Distributed greater, test Left with each element of Right
function "<="(Left : Long_Long_Modular_Array; Right : Long_Long_Modular_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test each respective element of Left with Right
function "<="(Left : Long_Long_Modular_Array; Right : Long_Long_Modular) return Boolean with Pure_Function;
--Distributed lesser or equal, test each element of Left with Right
function "<="(Left : Long_Long_Modular; Right : Long_Long_Modular_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test Left with each element of Right
function ">="(Left : Long_Long_Modular_Array; Right : Long_Long_Modular_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test each respective element of Left with Right
function ">="(Left : Long_Long_Modular_Array; Right : Long_Long_Modular) return Boolean with Pure_Function;
--Distributed greater or equal, test each element of Left with Right
function ">="(Left : Long_Long_Modular; Right : Long_Long_Modular_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test Left with each element of Right
function Max is new Modular_Max(Long_Long_Modular, Long_Long_Modular_Array) with Pure_Function;
--Find the maximum value of the array
function Min is new Modular_Min(Long_Long_Modular, Long_Long_Modular_Array) with Pure_Function;
--Find the minimum value of the array
function Apply is new Modular_Apply_Procedure(Long_Long_Modular, Long_Long_Modular_Array);
--Apply the procedure to each value of the array, returning the result
function Map(Value : Long_Long_Modular_Array; Callback : access Procedure(Value : in out Long_Long_Modular)) return Long_Long_Modular_Array renames Apply;
function Apply is new Modular_Apply_Function(Long_Long_Modular, Long_Long_Modular_Array);
--Apply the function to each value of the array, returning the result
function Map(Value : Long_Long_Modular_Array; Callback : access Function(Value : Long_Long_Modular) return Long_Long_Modular) return Long_Long_Modular_Array renames Apply;
function Fold is new Modular_Fold(Long_Long_Modular, Long_Long_Modular_Array);
--Fold the array using the specified function
-----------------------------
-- Short Short Fixed Array --
-----------------------------
type Short_Short_Fixed_Array is array(Positive range <>) of Short_Short_Fixed;
function "+"(Value : Short_Short_Fixed_Array) return Short_Short_Fixed_Array with Pure_Function;
--Distributed assertion
function "-"(Value : Short_Short_Fixed_Array) return Short_Short_Fixed_Array with Pure_Function;
--Distributed negation
function "abs"(Value : Short_Short_Fixed_Array) return Short_Short_Fixed_Array with Pure_Function;
--Distributed absolute value
function "+"(Left : Short_Short_Fixed_Array; Right : Short_Short_Fixed_Array) return Short_Short_Fixed_Array with Pure_Function;
--Array addition, add together each respective element of Left and Right
function "+"(Left : Short_Short_Fixed_Array; Right : Short_Short_Fixed) return Short_Short_Fixed_Array with Pure_Function;
--Distributed addition, add each element of Left with Right
function "+"(Left : Short_Short_Fixed; Right : Short_Short_Fixed_Array) return Short_Short_Fixed_Array with Pure_Function;
--Distributed addition, add Left with each element of Right
function "-"(Left : Short_Short_Fixed_Array; Right : Short_Short_Fixed_Array) return Short_Short_Fixed_Array with Pure_Function;
--Array subtraction, subtract each respective element of Left and Right
function "-"(Left : Short_Short_Fixed_Array; Right : Short_Short_Fixed) return Short_Short_Fixed_Array with Pure_Function;
--Distributed subtraction, subtract Right from each element of Left
function "-"(Left : Short_Short_Fixed; Right : Short_Short_Fixed_Array) return Short_Short_Fixed_Array with Pure_Function;
--Distributed subtraction, subtract each element of Right from Left
function "*"(Left : Short_Short_Fixed_Array; Right : Short_Short_Fixed_Array) return Short_Short_Fixed_Array with Pure_Function;
--Array multiplication, multiply together each respective element
function "*"(Left : Short_Short_Fixed_Array; Right : Short_Short_Fixed) return Short_Short_Fixed_Array with Pure_Function;
--Distributed multiplication, multiply each element of Left with Right
function "*"(Left : Short_Short_Fixed; Right : Short_Short_Fixed_Array) return Short_Short_Fixed_Array with Pure_Function;
--Distributed multiplication, multiply Left with each element of Right
function "/"(Left : Short_Short_Fixed_Array; Right : Short_Short_Fixed_Array) return Short_Short_Fixed_Array with Pure_Function;
--Array division, divide each respective element of Left and Right
function "/"(Left : Short_Short_Fixed_Array; Right : Short_Short_Fixed) return Short_Short_Fixed_Array with Pure_Function;
--Distributed division, divide each element of Left by Right
function "/"(Left : Short_Short_Fixed; Right : Short_Short_Fixed_Array) return Short_Short_Fixed_Array with Pure_Function;
--Distributed division, each Left by each element of Right
function "rem"(Left : Short_Short_Fixed_Array; Right : Short_Short_Fixed_Array) return Short_Short_Fixed_Array with Pure_Function;
--Array remainder, divide each respective element of Left and Right, keep the remainder
function "rem"(Left : Short_Short_Fixed_Array; Right : Short_Short_Fixed) return Short_Short_Fixed_Array with Pure_Function;
--Distributed remainder, divide each element of Left by Right, keep the remainder
function "rem"(Left : Short_Short_Fixed; Right : Short_Short_Fixed_Array) return Short_Short_Fixed_Array with Pure_Function;
--Distributed remainder, divide Left by each element of Right
function "mod"(Left : Short_Short_Fixed_Array; Right : Short_Short_Fixed_Array) return Short_Short_Fixed_Array with Pure_Function;
--Distributed modulus, divide each respective element of Left and Right, keep the remainder
function "mod"(Left : Short_Short_Fixed_Array; Right : Short_Short_Fixed) return Short_Short_Fixed_Array with Pure_Function;
--Distributed modulus, divide each element of Left by Right, keep the remainder
function "mod"(Left : Short_Short_Fixed; Right : Short_Short_Fixed_Array) return Short_Short_Fixed_Array with Pure_Function;
--Distributed modulus, divide Left by each element of Right
function "="(Left : Short_Short_Fixed_Array; Right : Short_Short_Fixed_Array) return Boolean with Pure_Function;
--Array equality, test each respective element of Left and Right
function "="(Left : Short_Short_Fixed_Array; Right : Short_Short_Fixed) return Boolean with Pure_Function;
--Distributed equality, test each element of Left with Right
function "="(Left : Short_Short_Fixed; Right : Short_Short_Fixed_Array) return Boolean with Pure_Function;
--Distributed equality, test Left with each element of Right
function "<"(Left : Short_Short_Fixed_Array; Right : Short_Short_Fixed_Array) return Boolean with Pure_Function;
--Distributed lesser, test each respective element of Left with Right
function "<"(Left : Short_Short_Fixed_Array; Right : Short_Short_Fixed) return Boolean with Pure_Function;
--Distributed lesser, test each element of Left with Right
function "<"(Left : Short_Short_Fixed; Right : Short_Short_Fixed_Array) return Boolean with Pure_Function;
--Distributed lesser, test Left with each element of Right
function ">"(Left : Short_Short_Fixed_Array; Right : Short_Short_Fixed_Array) return Boolean with Pure_Function;
--Distributed greater, test each respective element of Left with Right
function ">"(Left : Short_Short_Fixed_Array; Right : Short_Short_Fixed) return Boolean with Pure_Function;
--Distributed greater, test each element of Left with Right
function ">"(Left : Short_Short_Fixed; Right : Short_Short_Fixed_Array) return Boolean with Pure_Function;
--Distributed greater, test Left with each element of Right
function "<="(Left : Short_Short_Fixed_Array; Right : Short_Short_Fixed_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test each respective element of Left with Right
function "<="(Left : Short_Short_Fixed_Array; Right : Short_Short_Fixed) return Boolean with Pure_Function;
--Distributed lesser or equal, test each element of Left with Right
function "<="(Left : Short_Short_Fixed; Right : Short_Short_Fixed_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test Left with each element of Right
function ">="(Left : Short_Short_Fixed_Array; Right : Short_Short_Fixed_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test each respective element of Left with Right
function ">="(Left : Short_Short_Fixed_Array; Right : Short_Short_Fixed) return Boolean with Pure_Function;
--Distributed greater or equal, test each element of Left with Right
function ">="(Left : Short_Short_Fixed; Right : Short_Short_Fixed_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test Left with each element of Right
function Max is new Fixed_Max(Short_Short_Fixed, Short_Short_Fixed_Array) with Pure_Function;
--Find the maximum value of the array
function Min is new Fixed_Min(Short_Short_Fixed, Short_Short_Fixed_Array) with Pure_Function;
--Find the minimum value of the array
function Apply is new Fixed_Apply_Procedure(Short_Short_Fixed, Short_Short_Fixed_Array);
--Apply the procedure to each value of the array, returning the result
function Map(Value : Short_Short_Fixed_Array; Callback : access Procedure(Value : in out Short_Short_Fixed)) return Short_Short_Fixed_Array renames Apply;
function Apply is new Fixed_Apply_Function(Short_Short_Fixed, Short_Short_Fixed_Array);
--Apply the function to each value of the array, returning the result
function Map(Value : Short_Short_Fixed_Array; Callback : access Function(Value : Short_Short_Fixed) return Short_Short_Fixed) return Short_Short_Fixed_Array renames Apply;
function Fold is new Fixed_Fold(Short_Short_Fixed, Short_Short_Fixed_Array);
--Fold the array using the specified function
-----------------------
-- Short Fixed Array --
-----------------------
type Short_Fixed_Array is array(Positive range <>) of Short_Fixed;
function "+"(Value : Short_Fixed_Array) return Short_Fixed_Array with Pure_Function;
--Distributed assertion
function "-"(Value : Short_Fixed_Array) return Short_Fixed_Array with Pure_Function;
--Distributed negation
function "abs"(Value : Short_Fixed_Array) return Short_Fixed_Array with Pure_Function;
--Distributed absolute value
function "+"(Left : Short_Fixed_Array; Right : Short_Fixed_Array) return Short_Fixed_Array with Pure_Function;
--Array addition, add together each respective element of Left and Right
function "+"(Left : Short_Fixed_Array; Right : Short_Fixed) return Short_Fixed_Array with Pure_Function;
--Distributed addition, add each element of Left with Right
function "+"(Left : Short_Fixed; Right : Short_Fixed_Array) return Short_Fixed_Array with Pure_Function;
--Distributed addition, add Left with each element of Right
function "-"(Left : Short_Fixed_Array; Right : Short_Fixed_Array) return Short_Fixed_Array with Pure_Function;
--Array subtraction, subtract each respective element of Left and Right
function "-"(Left : Short_Fixed_Array; Right : Short_Fixed) return Short_Fixed_Array with Pure_Function;
--Distributed subtraction, subtract Right from each element of Left
function "-"(Left : Short_Fixed; Right : Short_Fixed_Array) return Short_Fixed_Array with Pure_Function;
--Distributed subtraction, subtract each element of Right from Left
function "*"(Left : Short_Fixed_Array; Right : Short_Fixed_Array) return Short_Fixed_Array with Pure_Function;
--Array multiplication, multiply together each respective element
function "*"(Left : Short_Fixed_Array; Right : Short_Fixed) return Short_Fixed_Array with Pure_Function;
--Distributed multiplication, multiply each element of Left with Right
function "*"(Left : Short_Fixed; Right : Short_Fixed_Array) return Short_Fixed_Array with Pure_Function;
--Distributed multiplication, multiply Left with each element of Right
function "/"(Left : Short_Fixed_Array; Right : Short_Fixed_Array) return Short_Fixed_Array with Pure_Function;
--Array division, divide each respective element of Left and Right
function "/"(Left : Short_Fixed_Array; Right : Short_Fixed) return Short_Fixed_Array with Pure_Function;
--Distributed division, divide each element of Left by Right
function "/"(Left : Short_Fixed; Right : Short_Fixed_Array) return Short_Fixed_Array with Pure_Function;
--Distributed division, each Left by each element of Right
function "rem"(Left : Short_Fixed_Array; Right : Short_Fixed_Array) return Short_Fixed_Array with Pure_Function;
--Array remainder, divide each respective element of Left and Right, keep the remainder
function "rem"(Left : Short_Fixed_Array; Right : Short_Fixed) return Short_Fixed_Array with Pure_Function;
--Distributed remainder, divide each element of Left by Right, keep the remainder
function "rem"(Left : Short_Fixed; Right : Short_Fixed_Array) return Short_Fixed_Array with Pure_Function;
--Distributed remainder, divide Left by each element of Right
function "mod"(Left : Short_Fixed_Array; Right : Short_Fixed_Array) return Short_Fixed_Array with Pure_Function;
--Distributed modulus, divide each respective element of Left and Right, keep the remainder
function "mod"(Left : Short_Fixed_Array; Right : Short_Fixed) return Short_Fixed_Array with Pure_Function;
--Distributed modulus, divide each element of Left by Right, keep the remainder
function "mod"(Left : Short_Fixed; Right : Short_Fixed_Array) return Short_Fixed_Array with Pure_Function;
--Distributed modulus, divide Left by each element of Right
function "="(Left : Short_Fixed_Array; Right : Short_Fixed_Array) return Boolean with Pure_Function;
--Array equality, test each respective element of Left and Right
function "="(Left : Short_Fixed_Array; Right : Short_Fixed) return Boolean with Pure_Function;
--Distributed equality, test each element of Left with Right
function "="(Left : Short_Fixed; Right : Short_Fixed_Array) return Boolean with Pure_Function;
--Distributed equality, test Left with each element of Right
function "<"(Left : Short_Fixed_Array; Right : Short_Fixed_Array) return Boolean with Pure_Function;
--Distributed lesser, test each respective element of Left with Right
function "<"(Left : Short_Fixed_Array; Right : Short_Fixed) return Boolean with Pure_Function;
--Distributed lesser, test each element of Left with Right
function "<"(Left : Short_Fixed; Right : Short_Fixed_Array) return Boolean with Pure_Function;
--Distributed lesser, test Left with each element of Right
function ">"(Left : Short_Fixed_Array; Right : Short_Fixed_Array) return Boolean with Pure_Function;
--Distributed greater, test each respective element of Left with Right
function ">"(Left : Short_Fixed_Array; Right : Short_Fixed) return Boolean with Pure_Function;
--Distributed greater, test each element of Left with Right
function ">"(Left : Short_Fixed; Right : Short_Fixed_Array) return Boolean with Pure_Function;
--Distributed greater, test Left with each element of Right
function "<="(Left : Short_Fixed_Array; Right : Short_Fixed_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test each respective element of Left with Right
function "<="(Left : Short_Fixed_Array; Right : Short_Fixed) return Boolean with Pure_Function;
--Distributed lesser or equal, test each element of Left with Right
function "<="(Left : Short_Fixed; Right : Short_Fixed_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test Left with each element of Right
function ">="(Left : Short_Fixed_Array; Right : Short_Fixed_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test each respective element of Left with Right
function ">="(Left : Short_Fixed_Array; Right : Short_Fixed) return Boolean with Pure_Function;
--Distributed greater or equal, test each element of Left with Right
function ">="(Left : Short_Fixed; Right : Short_Fixed_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test Left with each element of Right
function Max is new Fixed_Max(Short_Fixed, Short_Fixed_Array) with Pure_Function;
--Find the maximum value of the array
function Min is new Fixed_Min(Short_Fixed, Short_Fixed_Array) with Pure_Function;
--Find the minimum value of the array
function Apply is new Fixed_Apply_Procedure(Short_Fixed, Short_Fixed_Array);
--Apply the procedure to each value of the array, returning the result
function Map(Value : Short_Fixed_Array; Callback : access Procedure(Value : in out Short_Fixed)) return Short_Fixed_Array renames Apply;
function Apply is new Fixed_Apply_Function(Short_Fixed, Short_Fixed_Array);
--Apply the function to each value of the array, returning the result
function Map(Value : Short_Fixed_Array; Callback : access Function(Value : Short_Fixed) return Short_Fixed) return Short_Fixed_Array renames Apply;
function Fold is new Fixed_Fold(Short_Fixed, Short_Fixed_Array);
--Fold the array using the specified function
-----------------
-- Fixed Array --
-----------------
type Fixed_Array is array(Positive range <>) of Fixed;
function "+"(Value : Fixed_Array) return Fixed_Array with Pure_Function;
--Distributed assertion
function "-"(Value : Fixed_Array) return Fixed_Array with Pure_Function;
--Distributed negation
function "abs"(Value : Fixed_Array) return Fixed_Array with Pure_Function;
--Distributed absolute value
function "+"(Left : Fixed_Array; Right : Fixed_Array) return Fixed_Array with Pure_Function;
--Array addition, add together each respective element of Left and Right
function "+"(Left : Fixed_Array; Right : Fixed) return Fixed_Array with Pure_Function;
--Distributed addition, add each element of Left with Right
function "+"(Left : Fixed; Right : Fixed_Array) return Fixed_Array with Pure_Function;
--Distributed addition, add Left with each element of Right
function "-"(Left : Fixed_Array; Right : Fixed_Array) return Fixed_Array with Pure_Function;
--Array subtraction, subtract each respective element of Left and Right
function "-"(Left : Fixed_Array; Right : Fixed) return Fixed_Array with Pure_Function;
--Distributed subtraction, subtract Right from each element of Left
function "-"(Left : Fixed; Right : Fixed_Array) return Fixed_Array with Pure_Function;
--Distributed subtraction, subtract each element of Right from Left
function "*"(Left : Fixed_Array; Right : Fixed_Array) return Fixed_Array with Pure_Function;
--Array multiplication, multiply together each respective element
function "*"(Left : Fixed_Array; Right : Fixed) return Fixed_Array with Pure_Function;
--Distributed multiplication, multiply each element of Left with Right
function "*"(Left : Fixed; Right : Fixed_Array) return Fixed_Array with Pure_Function;
--Distributed multiplication, multiply Left with each element of Right
function "/"(Left : Fixed_Array; Right : Fixed_Array) return Fixed_Array with Pure_Function;
--Array division, divide each respective element of Left and Right
function "/"(Left : Fixed_Array; Right : Fixed) return Fixed_Array with Pure_Function;
--Distributed division, divide each element of Left by Right
function "/"(Left : Fixed; Right : Fixed_Array) return Fixed_Array with Pure_Function;
--Distributed division, each Left by each element of Right
function "rem"(Left : Fixed_Array; Right : Fixed_Array) return Fixed_Array with Pure_Function;
--Array remainder, divide each respective element of Left and Right, keep the remainder
function "rem"(Left : Fixed_Array; Right : Fixed) return Fixed_Array with Pure_Function;
--Distributed remainder, divide each element of Left by Right, keep the remainder
function "rem"(Left : Fixed; Right : Fixed_Array) return Fixed_Array with Pure_Function;
--Distributed remainder, divide Left by each element of Right
function "mod"(Left : Fixed_Array; Right : Fixed_Array) return Fixed_Array with Pure_Function;
--Distributed modulus, divide each respective element of Left and Right, keep the remainder
function "mod"(Left : Fixed_Array; Right : Fixed) return Fixed_Array with Pure_Function;
--Distributed modulus, divide each element of Left by Right, keep the remainder
function "mod"(Left : Fixed; Right : Fixed_Array) return Fixed_Array with Pure_Function;
--Distributed modulus, divide Left by each element of Right
function "="(Left : Fixed_Array; Right : Fixed_Array) return Boolean with Pure_Function;
--Array equality, test each respective element of Left and Right
function "="(Left : Fixed_Array; Right : Fixed) return Boolean with Pure_Function;
--Distributed equality, test each element of Left with Right
function "="(Left : Fixed; Right : Fixed_Array) return Boolean with Pure_Function;
--Distributed equality, test Left with each element of Right
function "<"(Left : Fixed_Array; Right : Fixed_Array) return Boolean with Pure_Function;
--Distributed lesser, test each respective element of Left with Right
function "<"(Left : Fixed_Array; Right : Fixed) return Boolean with Pure_Function;
--Distributed lesser, test each element of Left with Right
function "<"(Left : Fixed; Right : Fixed_Array) return Boolean with Pure_Function;
--Distributed lesser, test Left with each element of Right
function ">"(Left : Fixed_Array; Right : Fixed_Array) return Boolean with Pure_Function;
--Distributed greater, test each respective element of Left with Right
function ">"(Left : Fixed_Array; Right : Fixed) return Boolean with Pure_Function;
--Distributed greater, test each element of Left with Right
function ">"(Left : Fixed; Right : Fixed_Array) return Boolean with Pure_Function;
--Distributed greater, test Left with each element of Right
function "<="(Left : Fixed_Array; Right : Fixed_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test each respective element of Left with Right
function "<="(Left : Fixed_Array; Right : Fixed) return Boolean with Pure_Function;
--Distributed lesser or equal, test each element of Left with Right
function "<="(Left : Fixed; Right : Fixed_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test Left with each element of Right
function ">="(Left : Fixed_Array; Right : Fixed_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test each respective element of Left with Right
function ">="(Left : Fixed_Array; Right : Fixed) return Boolean with Pure_Function;
--Distributed greater or equal, test each element of Left with Right
function ">="(Left : Fixed; Right : Fixed_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test Left with each element of Right
function Max is new Fixed_Max(Fixed, Fixed_Array) with Pure_Function;
--Find the maximum value of the array
function Min is new Fixed_Min(Fixed, Fixed_Array) with Pure_Function;
--Find the minimum value of the array
function Apply is new Fixed_Apply_Procedure(Fixed, Fixed_Array);
--Apply the procedure to each value of the array, returning the result
function Map(Value : Fixed_Array; Callback : access Procedure(Value : in out Fixed)) return Fixed_Array renames Apply;
function Apply is new Fixed_Apply_Function(Fixed, Fixed_Array);
--Apply the function to each value of the array, returning the result
function Map(Value : Fixed_Array; Callback : access Function(Value : Fixed) return Fixed) return Fixed_Array renames Apply;
function Fold is new Fixed_Fold(Fixed, Fixed_Array);
--Fold the array using the specified function
----------------------
-- Long_Fixed Array --
----------------------
type Long_Fixed_Array is array(Positive range <>) of Long_Fixed;
function "+"(Value : Long_Fixed_Array) return Long_Fixed_Array with Pure_Function;
--Distributed assertion
function "-"(Value : Long_Fixed_Array) return Long_Fixed_Array with Pure_Function;
--Distributed negation
function "abs"(Value : Long_Fixed_Array) return Long_Fixed_Array with Pure_Function;
--Distributed absolute value
function "+"(Left : Long_Fixed_Array; Right : Long_Fixed_Array) return Long_Fixed_Array with Pure_Function;
--Array addition, add together each respective element of Left and Right
function "+"(Left : Long_Fixed_Array; Right : Long_Fixed) return Long_Fixed_Array with Pure_Function;
--Distributed addition, add each element of Left with Right
function "+"(Left : Long_Fixed; Right : Long_Fixed_Array) return Long_Fixed_Array with Pure_Function;
--Distributed addition, add Left with each element of Right
function "-"(Left : Long_Fixed_Array; Right : Long_Fixed_Array) return Long_Fixed_Array with Pure_Function;
--Array subtraction, subtract each respective element of Left and Right
function "-"(Left : Long_Fixed_Array; Right : Long_Fixed) return Long_Fixed_Array with Pure_Function;
--Distributed subtraction, subtract Right from each element of Left
function "-"(Left : Long_Fixed; Right : Long_Fixed_Array) return Long_Fixed_Array with Pure_Function;
--Distributed subtraction, subtract each element of Right from Left
function "*"(Left : Long_Fixed_Array; Right : Long_Fixed_Array) return Long_Fixed_Array with Pure_Function;
--Array multiplication, multiply together each respective element
function "*"(Left : Long_Fixed_Array; Right : Long_Fixed) return Long_Fixed_Array with Pure_Function;
--Distributed multiplication, multiply each element of Left with Right
function "*"(Left : Long_Fixed; Right : Long_Fixed_Array) return Long_Fixed_Array with Pure_Function;
--Distributed multiplication, multiply Left with each element of Right
function "/"(Left : Long_Fixed_Array; Right : Long_Fixed_Array) return Long_Fixed_Array with Pure_Function;
--Array division, divide each respective element of Left and Right
function "/"(Left : Long_Fixed_Array; Right : Long_Fixed) return Long_Fixed_Array with Pure_Function;
--Distributed division, divide each element of Left by Right
function "/"(Left : Long_Fixed; Right : Long_Fixed_Array) return Long_Fixed_Array with Pure_Function;
--Distributed division, each Left by each element of Right
function "rem"(Left : Long_Fixed_Array; Right : Long_Fixed_Array) return Long_Fixed_Array with Pure_Function;
--Array remainder, divide each respective element of Left and Right, keep the remainder
function "rem"(Left : Long_Fixed_Array; Right : Long_Fixed) return Long_Fixed_Array with Pure_Function;
--Distributed remainder, divide each element of Left by Right, keep the remainder
function "rem"(Left : Long_Fixed; Right : Long_Fixed_Array) return Long_Fixed_Array with Pure_Function;
--Distributed remainder, divide Left by each element of Right
function "mod"(Left : Long_Fixed_Array; Right : Long_Fixed_Array) return Long_Fixed_Array with Pure_Function;
--Distributed modulus, divide each respective element of Left and Right, keep the remainder
function "mod"(Left : Long_Fixed_Array; Right : Long_Fixed) return Long_Fixed_Array with Pure_Function;
--Distributed modulus, divide each element of Left by Right, keep the remainder
function "mod"(Left : Long_Fixed; Right : Long_Fixed_Array) return Long_Fixed_Array with Pure_Function;
--Distributed modulus, divide Left by each element of Right
function "="(Left : Long_Fixed_Array; Right : Long_Fixed_Array) return Boolean with Pure_Function;
--Array equality, test each respective element of Left and Right
function "="(Left : Long_Fixed_Array; Right : Long_Fixed) return Boolean with Pure_Function;
--Distributed equality, test each element of Left with Right
function "="(Left : Long_Fixed; Right : Long_Fixed_Array) return Boolean with Pure_Function;
--Distributed equality, test Left with each element of Right
function "<"(Left : Long_Fixed_Array; Right : Long_Fixed_Array) return Boolean with Pure_Function;
--Distributed lesser, test each respective element of Left with Right
function "<"(Left : Long_Fixed_Array; Right : Long_Fixed) return Boolean with Pure_Function;
--Distributed lesser, test each element of Left with Right
function "<"(Left : Long_Fixed; Right : Long_Fixed_Array) return Boolean with Pure_Function;
--Distributed lesser, test Left with each element of Right
function ">"(Left : Long_Fixed_Array; Right : Long_Fixed_Array) return Boolean with Pure_Function;
--Distributed greater, test each respective element of Left with Right
function ">"(Left : Long_Fixed_Array; Right : Long_Fixed) return Boolean with Pure_Function;
--Distributed greater, test each element of Left with Right
function ">"(Left : Long_Fixed; Right : Long_Fixed_Array) return Boolean with Pure_Function;
--Distributed greater, test Left with each element of Right
function "<="(Left : Long_Fixed_Array; Right : Long_Fixed_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test each respective element of Left with Right
function "<="(Left : Long_Fixed_Array; Right : Long_Fixed) return Boolean with Pure_Function;
--Distributed lesser or equal, test each element of Left with Right
function "<="(Left : Long_Fixed; Right : Long_Fixed_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test Left with each element of Right
function ">="(Left : Long_Fixed_Array; Right : Long_Fixed_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test each respective element of Left with Right
function ">="(Left : Long_Fixed_Array; Right : Long_Fixed) return Boolean with Pure_Function;
--Distributed greater or equal, test each element of Left with Right
function ">="(Left : Long_Fixed; Right : Long_Fixed_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test Left with each element of Right
function Max is new Fixed_Max(Long_Fixed, Long_Fixed_Array) with Pure_Function;
--Find the maximum value of the array
function Min is new Fixed_Min(Long_Fixed, Long_Fixed_Array) with Pure_Function;
--Find the minimum value of the array
function Apply is new Fixed_Apply_Procedure(Long_Fixed, Long_Fixed_Array);
--Apply the procedure to each value of the array, returning the result
function Map(Value : Long_Fixed_Array; Callback : access Procedure(Value : in out Long_Fixed)) return Long_Fixed_Array renames Apply;
function Apply is new Fixed_Apply_Function(Long_Fixed, Long_Fixed_Array);
--Apply the function to each value of the array, returning the result
function Map(Value : Long_Fixed_Array; Callback : access Function(Value : Long_Fixed) return Long_Fixed) return Long_Fixed_Array renames Apply;
function Fold is new Fixed_Fold(Long_Fixed, Long_Fixed_Array);
--Fold the array using the specified function
-------------------------
-- Short Decimal Array --
-------------------------
type Short_Decimal_Array is array(Positive range <>) of Short_Decimal;
function "+"(Value : Short_Decimal_Array) return Short_Decimal_Array with Pure_Function;
--Distributed assertion
function "-"(Value : Short_Decimal_Array) return Short_Decimal_Array with Pure_Function;
--Distributed negation
function "abs"(Value : Short_Decimal_Array) return Short_Decimal_Array with Pure_Function;
--Distributed absolute value
function "+"(Left : Short_Decimal_Array; Right : Short_Decimal_Array) return Short_Decimal_Array with Pure_Function;
--Array addition, add together each respective element of Left and Right
function "+"(Left : Short_Decimal_Array; Right : Short_Decimal) return Short_Decimal_Array with Pure_Function;
--Distributed addition, add each element of Left with Right
function "+"(Left : Short_Decimal; Right : Short_Decimal_Array) return Short_Decimal_Array with Pure_Function;
--Distributed addition, add Left with each element of Right
function "-"(Left : Short_Decimal_Array; Right : Short_Decimal_Array) return Short_Decimal_Array with Pure_Function;
--Array subtraction, subtract each respective element of Left and Right
function "-"(Left : Short_Decimal_Array; Right : Short_Decimal) return Short_Decimal_Array with Pure_Function;
--Distributed subtraction, subtract Right from each element of Left
function "-"(Left : Short_Decimal; Right : Short_Decimal_Array) return Short_Decimal_Array with Pure_Function;
--Distributed subtraction, subtract each element of Right from Left
function "*"(Left : Short_Decimal_Array; Right : Short_Decimal_Array) return Short_Decimal_Array with Pure_Function;
--Array multiplication, multiply together each respective element
function "*"(Left : Short_Decimal_Array; Right : Short_Decimal) return Short_Decimal_Array with Pure_Function;
--Distributed multiplication, multiply each element of Left with Right
function "*"(Left : Short_Decimal; Right : Short_Decimal_Array) return Short_Decimal_Array with Pure_Function;
--Distributed multiplication, multiply Left with each element of Right
function "/"(Left : Short_Decimal_Array; Right : Short_Decimal_Array) return Short_Decimal_Array with Pure_Function;
--Array division, divide each respective element of Left and Right
function "/"(Left : Short_Decimal_Array; Right : Short_Decimal) return Short_Decimal_Array with Pure_Function;
--Distributed division, divide each element of Left by Right
function "/"(Left : Short_Decimal; Right : Short_Decimal_Array) return Short_Decimal_Array with Pure_Function;
--Distributed division, each Left by each element of Right
function "rem"(Left : Short_Decimal_Array; Right : Short_Decimal_Array) return Short_Decimal_Array with Pure_Function;
--Array remainder, divide each respective element of Left and Right, keep the remainder
function "rem"(Left : Short_Decimal_Array; Right : Short_Decimal) return Short_Decimal_Array with Pure_Function;
--Distributed remainder, divide each element of Left by Right, keep the remainder
function "rem"(Left : Short_Decimal; Right : Short_Decimal_Array) return Short_Decimal_Array with Pure_Function;
--Distributed remainder, divide Left by each element of Right
function "mod"(Left : Short_Decimal_Array; Right : Short_Decimal_Array) return Short_Decimal_Array with Pure_Function;
--Distributed modulus, divide each respective element of Left and Right, keep the remainder
function "mod"(Left : Short_Decimal_Array; Right : Short_Decimal) return Short_Decimal_Array with Pure_Function;
--Distributed modulus, divide each element of Left by Right, keep the remainder
function "mod"(Left : Short_Decimal; Right : Short_Decimal_Array) return Short_Decimal_Array with Pure_Function;
--Distributed modulus, divide Left by each element of Right
function "="(Left : Short_Decimal_Array; Right : Short_Decimal_Array) return Boolean with Pure_Function;
--Array equality, test each respective element of Left and Right
function "="(Left : Short_Decimal_Array; Right : Short_Decimal) return Boolean with Pure_Function;
--Distributed equality, test each element of Left with Right
function "="(Left : Short_Decimal; Right : Short_Decimal_Array) return Boolean with Pure_Function;
--Distributed equality, test Left with each element of Right
function "<"(Left : Short_Decimal_Array; Right : Short_Decimal_Array) return Boolean with Pure_Function;
--Distributed lesser, test each respective element of Left with Right
function "<"(Left : Short_Decimal_Array; Right : Short_Decimal) return Boolean with Pure_Function;
--Distributed lesser, test each element of Left with Right
function "<"(Left : Short_Decimal; Right : Short_Decimal_Array) return Boolean with Pure_Function;
--Distributed lesser, test Left with each element of Right
function ">"(Left : Short_Decimal_Array; Right : Short_Decimal_Array) return Boolean with Pure_Function;
--Distributed greater, test each respective element of Left with Right
function ">"(Left : Short_Decimal_Array; Right : Short_Decimal) return Boolean with Pure_Function;
--Distributed greater, test each element of Left with Right
function ">"(Left : Short_Decimal; Right : Short_Decimal_Array) return Boolean with Pure_Function;
--Distributed greater, test Left with each element of Right
function "<="(Left : Short_Decimal_Array; Right : Short_Decimal_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test each respective element of Left with Right
function "<="(Left : Short_Decimal_Array; Right : Short_Decimal) return Boolean with Pure_Function;
--Distributed lesser or equal, test each element of Left with Right
function "<="(Left : Short_Decimal; Right : Short_Decimal_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test Left with each element of Right
function ">="(Left : Short_Decimal_Array; Right : Short_Decimal_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test each respective element of Left with Right
function ">="(Left : Short_Decimal_Array; Right : Short_Decimal) return Boolean with Pure_Function;
--Distributed greater or equal, test each element of Left with Right
function ">="(Left : Short_Decimal; Right : Short_Decimal_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test Left with each element of Right
function Max is new Decimal_Max(Short_Decimal, Short_Decimal_Array) with Pure_Function;
--Find the maximum value of the array
function Min is new Decimal_Min(Short_Decimal, Short_Decimal_Array) with Pure_Function;
--Find the minimum value of the array
function Apply is new Decimal_Apply_Procedure(Short_Decimal, Short_Decimal_Array);
--Apply the procedure to each value of the array, returning the result
function Map(Value : Short_Decimal_Array; Callback : access Procedure(Value : in out Short_Decimal)) return Short_Decimal_Array renames Apply;
function Apply is new Decimal_Apply_Function(Short_Decimal, Short_Decimal_Array);
--Apply the function to each value of the array, returning the result
function Map(Value : Short_Decimal_Array; Callback : access Function(Value : Short_Decimal) return Short_Decimal) return Short_Decimal_Array renames Apply;
function Fold is new Decimal_Fold(Short_Decimal, Short_Decimal_Array);
--Fold the array using the specified function
-------------------
-- Decimal Array --
-------------------
type Decimal_Array is array(Positive range <>) of Decimal;
function "+"(Value : Decimal_Array) return Decimal_Array with Pure_Function;
--Distributed assertion
function "-"(Value : Decimal_Array) return Decimal_Array with Pure_Function;
--Distributed negation
function "abs"(Value : Decimal_Array) return Decimal_Array with Pure_Function;
--Distributed absolute value
function "+"(Left : Decimal_Array; Right : Decimal_Array) return Decimal_Array with Pure_Function;
--Array addition, add together each respective element of Left and Right
function "+"(Left : Decimal_Array; Right : Decimal) return Decimal_Array with Pure_Function;
--Distributed addition, add each element of Left with Right
function "+"(Left : Decimal; Right : Decimal_Array) return Decimal_Array with Pure_Function;
--Distributed addition, add Left with each element of Right
function "-"(Left : Decimal_Array; Right : Decimal_Array) return Decimal_Array with Pure_Function;
--Array subtraction, subtract each respective element of Left and Right
function "-"(Left : Decimal_Array; Right : Decimal) return Decimal_Array with Pure_Function;
--Distributed subtraction, subtract Right from each element of Left
function "-"(Left : Decimal; Right : Decimal_Array) return Decimal_Array with Pure_Function;
--Distributed subtraction, subtract each element of Right from Left
function "*"(Left : Decimal_Array; Right : Decimal_Array) return Decimal_Array with Pure_Function;
--Array multiplication, multiply together each respective element
function "*"(Left : Decimal_Array; Right : Decimal) return Decimal_Array with Pure_Function;
--Distributed multiplication, multiply each element of Left with Right
function "*"(Left : Decimal; Right : Decimal_Array) return Decimal_Array with Pure_Function;
--Distributed multiplication, multiply Left with each element of Right
function "/"(Left : Decimal_Array; Right : Decimal_Array) return Decimal_Array with Pure_Function;
--Array division, divide each respective element of Left and Right
function "/"(Left : Decimal_Array; Right : Decimal) return Decimal_Array with Pure_Function;
--Distributed division, divide each element of Left by Right
function "/"(Left : Decimal; Right : Decimal_Array) return Decimal_Array with Pure_Function;
--Distributed division, each Left by each element of Right
function "rem"(Left : Decimal_Array; Right : Decimal_Array) return Decimal_Array with Pure_Function;
--Array remainder, divide each respective element of Left and Right, keep the remainder
function "rem"(Left : Decimal_Array; Right : Decimal) return Decimal_Array with Pure_Function;
--Distributed remainder, divide each element of Left by Right, keep the remainder
function "rem"(Left : Decimal; Right : Decimal_Array) return Decimal_Array with Pure_Function;
--Distributed remainder, divide Left by each element of Right
function "mod"(Left : Decimal_Array; Right : Decimal_Array) return Decimal_Array with Pure_Function;
--Distributed modulus, divide each respective element of Left and Right, keep the remainder
function "mod"(Left : Decimal_Array; Right : Decimal) return Decimal_Array with Pure_Function;
--Distributed modulus, divide each element of Left by Right, keep the remainder
function "mod"(Left : Decimal; Right : Decimal_Array) return Decimal_Array with Pure_Function;
--Distributed modulus, divide Left by each element of Right
function "="(Left : Decimal_Array; Right : Decimal_Array) return Boolean with Pure_Function;
--Array equality, test each respective element of Left and Right
function "="(Left : Decimal_Array; Right : Decimal) return Boolean with Pure_Function;
--Distributed equality, test each element of Left with Right
function "="(Left : Decimal; Right : Decimal_Array) return Boolean with Pure_Function;
--Distributed equality, test Left with each element of Right
function "<"(Left : Decimal_Array; Right : Decimal_Array) return Boolean with Pure_Function;
--Distributed lesser, test each respective element of Left with Right
function "<"(Left : Decimal_Array; Right : Decimal) return Boolean with Pure_Function;
--Distributed lesser, test each element of Left with Right
function "<"(Left : Decimal; Right : Decimal_Array) return Boolean with Pure_Function;
--Distributed lesser, test Left with each element of Right
function ">"(Left : Decimal_Array; Right : Decimal_Array) return Boolean with Pure_Function;
--Distributed greater, test each respective element of Left with Right
function ">"(Left : Decimal_Array; Right : Decimal) return Boolean with Pure_Function;
--Distributed greater, test each element of Left with Right
function ">"(Left : Decimal; Right : Decimal_Array) return Boolean with Pure_Function;
--Distributed greater, test Left with each element of Right
function "<="(Left : Decimal_Array; Right : Decimal_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test each respective element of Left with Right
function "<="(Left : Decimal_Array; Right : Decimal) return Boolean with Pure_Function;
--Distributed lesser or equal, test each element of Left with Right
function "<="(Left : Decimal; Right : Decimal_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test Left with each element of Right
function ">="(Left : Decimal_Array; Right : Decimal_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test each respective element of Left with Right
function ">="(Left : Decimal_Array; Right : Decimal) return Boolean with Pure_Function;
--Distributed greater or equal, test each element of Left with Right
function ">="(Left : Decimal; Right : Decimal_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test Left with each element of Right
function Max is new Decimal_Max(Decimal, Decimal_Array) with Pure_Function;
--Find the maximum value of the array
function Min is new Decimal_Min(Decimal, Decimal_Array) with Pure_Function;
--Find the minimum value of the array
function Apply is new Decimal_Apply_Procedure(Decimal, Decimal_Array);
--Apply the procedure to each value of the array, returning the result
function Map(Value : Decimal_Array; Callback : access Procedure(Value : in out Decimal)) return Decimal_Array renames Apply;
function Apply is new Decimal_Apply_Function(Decimal, Decimal_Array);
--Apply the function to each value of the array, returning the result
function Map(Value : Decimal_Array; Callback : access Function(Value : Decimal) return Decimal) return Decimal_Array renames Apply;
function Fold is new Decimal_Fold(Decimal, Decimal_Array);
--Fold the array using the specified function
------------------------
-- Long Decimal Array --
------------------------
type Long_Decimal_Array is array(Positive range <>) of Long_Decimal;
function "+"(Value : Long_Decimal_Array) return Long_Decimal_Array with Pure_Function;
--Distributed assertion
function "-"(Value : Long_Decimal_Array) return Long_Decimal_Array with Pure_Function;
--Distributed negation
function "abs"(Value : Long_Decimal_Array) return Long_Decimal_Array with Pure_Function;
--Distributed absolute value
function "+"(Left : Long_Decimal_Array; Right : Long_Decimal_Array) return Long_Decimal_Array with Pure_Function;
--Array addition, add together each respective element of Left and Right
function "+"(Left : Long_Decimal_Array; Right : Long_Decimal) return Long_Decimal_Array with Pure_Function;
--Distributed addition, add each element of Left with Right
function "+"(Left : Long_Decimal; Right : Long_Decimal_Array) return Long_Decimal_Array with Pure_Function;
--Distributed addition, add Left with each element of Right
function "-"(Left : Long_Decimal_Array; Right : Long_Decimal_Array) return Long_Decimal_Array with Pure_Function;
--Array subtraction, subtract each respective element of Left and Right
function "-"(Left : Long_Decimal_Array; Right : Long_Decimal) return Long_Decimal_Array with Pure_Function;
--Distributed subtraction, subtract Right from each element of Left
function "-"(Left : Long_Decimal; Right : Long_Decimal_Array) return Long_Decimal_Array with Pure_Function;
--Distributed subtraction, subtract each element of Right from Left
function "*"(Left : Long_Decimal_Array; Right : Long_Decimal_Array) return Long_Decimal_Array with Pure_Function;
--Array multiplication, multiply together each respective element
function "*"(Left : Long_Decimal_Array; Right : Long_Decimal) return Long_Decimal_Array with Pure_Function;
--Distributed multiplication, multiply each element of Left with Right
function "*"(Left : Long_Decimal; Right : Long_Decimal_Array) return Long_Decimal_Array with Pure_Function;
--Distributed multiplication, multiply Left with each element of Right
function "/"(Left : Long_Decimal_Array; Right : Long_Decimal_Array) return Long_Decimal_Array with Pure_Function;
--Array division, divide each respective element of Left and Right
function "/"(Left : Long_Decimal_Array; Right : Long_Decimal) return Long_Decimal_Array with Pure_Function;
--Distributed division, divide each element of Left by Right
function "/"(Left : Long_Decimal; Right : Long_Decimal_Array) return Long_Decimal_Array with Pure_Function;
--Distributed division, each Left by each element of Right
function "rem"(Left : Long_Decimal_Array; Right : Long_Decimal_Array) return Long_Decimal_Array with Pure_Function;
--Array remainder, divide each respective element of Left and Right, keep the remainder
function "rem"(Left : Long_Decimal_Array; Right : Long_Decimal) return Long_Decimal_Array with Pure_Function;
--Distributed remainder, divide each element of Left by Right, keep the remainder
function "rem"(Left : Long_Decimal; Right : Long_Decimal_Array) return Long_Decimal_Array with Pure_Function;
--Distributed remainder, divide Left by each element of Right
function "mod"(Left : Long_Decimal_Array; Right : Long_Decimal_Array) return Long_Decimal_Array with Pure_Function;
--Distributed modulus, divide each respective element of Left and Right, keep the remainder
function "mod"(Left : Long_Decimal_Array; Right : Long_Decimal) return Long_Decimal_Array with Pure_Function;
--Distributed modulus, divide each element of Left by Right, keep the remainder
function "mod"(Left : Long_Decimal; Right : Long_Decimal_Array) return Long_Decimal_Array with Pure_Function;
--Distributed modulus, divide Left by each element of Right
function "="(Left : Long_Decimal_Array; Right : Long_Decimal_Array) return Boolean with Pure_Function;
--Array equality, test each respective element of Left and Right
function "="(Left : Long_Decimal_Array; Right : Long_Decimal) return Boolean with Pure_Function;
--Distributed equality, test each element of Left with Right
function "="(Left : Long_Decimal; Right : Long_Decimal_Array) return Boolean with Pure_Function;
--Distributed equality, test Left with each element of Right
function "<"(Left : Long_Decimal_Array; Right : Long_Decimal_Array) return Boolean with Pure_Function;
--Distributed lesser, test each respective element of Left with Right
function "<"(Left : Long_Decimal_Array; Right : Long_Decimal) return Boolean with Pure_Function;
--Distributed lesser, test each element of Left with Right
function "<"(Left : Long_Decimal; Right : Long_Decimal_Array) return Boolean with Pure_Function;
--Distributed lesser, test Left with each element of Right
function ">"(Left : Long_Decimal_Array; Right : Long_Decimal_Array) return Boolean with Pure_Function;
--Distributed greater, test each respective element of Left with Right
function ">"(Left : Long_Decimal_Array; Right : Long_Decimal) return Boolean with Pure_Function;
--Distributed greater, test each element of Left with Right
function ">"(Left : Long_Decimal; Right : Long_Decimal_Array) return Boolean with Pure_Function;
--Distributed greater, test Left with each element of Right
function "<="(Left : Long_Decimal_Array; Right : Long_Decimal_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test each respective element of Left with Right
function "<="(Left : Long_Decimal_Array; Right : Long_Decimal) return Boolean with Pure_Function;
--Distributed lesser or equal, test each element of Left with Right
function "<="(Left : Long_Decimal; Right : Long_Decimal_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test Left with each element of Right
function ">="(Left : Long_Decimal_Array; Right : Long_Decimal_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test each respective element of Left with Right
function ">="(Left : Long_Decimal_Array; Right : Long_Decimal) return Boolean with Pure_Function;
--Distributed greater or equal, test each element of Left with Right
function ">="(Left : Long_Decimal; Right : Long_Decimal_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test Left with each element of Right
function Max is new Decimal_Max(Long_Decimal, Long_Decimal_Array) with Pure_Function;
--Find the maximum value of the array
function Min is new Decimal_Min(Long_Decimal, Long_Decimal_Array) with Pure_Function;
--Find the minimum value of the array
function Apply is new Decimal_Apply_Procedure(Long_Decimal, Long_Decimal_Array);
--Apply the procedure to each value of the array, returning the result
function Map(Value : Long_Decimal_Array; Callback : access Procedure(Value : in out Long_Decimal)) return Long_Decimal_Array renames Apply;
function Apply is new Decimal_Apply_Function(Long_Decimal, Long_Decimal_Array);
--Apply the function to each value of the array, returning the result
function Map(Value : Long_Decimal_Array; Callback : access Function(Value : Long_Decimal) return Long_Decimal) return Long_Decimal_Array renames Apply;
function Fold is new Decimal_Fold(Long_Decimal, Long_Decimal_Array);
--Fold the array using the specified function
-----------------------------
-- Long Long Decimal Array --
-----------------------------
type Long_Long_Decimal_Array is array(Positive range <>) of Long_Long_Decimal;
function "+"(Value : Long_Long_Decimal_Array) return Long_Long_Decimal_Array with Pure_Function;
--Distributed assertion
function "-"(Value : Long_Long_Decimal_Array) return Long_Long_Decimal_Array with Pure_Function;
--Distributed negation
function "abs"(Value : Long_Long_Decimal_Array) return Long_Long_Decimal_Array with Pure_Function;
--Distributed absolute value
function "+"(Left : Long_Long_Decimal_Array; Right : Long_Long_Decimal_Array) return Long_Long_Decimal_Array with Pure_Function;
--Array addition, add together each respective element of Left and Right
function "+"(Left : Long_Long_Decimal_Array; Right : Long_Long_Decimal) return Long_Long_Decimal_Array with Pure_Function;
--Distributed addition, add each element of Left with Right
function "+"(Left : Long_Long_Decimal; Right : Long_Long_Decimal_Array) return Long_Long_Decimal_Array with Pure_Function;
--Distributed addition, add Left with each element of Right
function "-"(Left : Long_Long_Decimal_Array; Right : Long_Long_Decimal_Array) return Long_Long_Decimal_Array with Pure_Function;
--Array subtraction, subtract each respective element of Left and Right
function "-"(Left : Long_Long_Decimal_Array; Right : Long_Long_Decimal) return Long_Long_Decimal_Array with Pure_Function;
--Distributed subtraction, subtract Right from each element of Left
function "-"(Left : Long_Long_Decimal; Right : Long_Long_Decimal_Array) return Long_Long_Decimal_Array with Pure_Function;
--Distributed subtraction, subtract each element of Right from Left
function "*"(Left : Long_Long_Decimal_Array; Right : Long_Long_Decimal_Array) return Long_Long_Decimal_Array with Pure_Function;
--Array multiplication, multiply together each respective element
function "*"(Left : Long_Long_Decimal_Array; Right : Long_Long_Decimal) return Long_Long_Decimal_Array with Pure_Function;
--Distributed multiplication, multiply each element of Left with Right
function "*"(Left : Long_Long_Decimal; Right : Long_Long_Decimal_Array) return Long_Long_Decimal_Array with Pure_Function;
--Distributed multiplication, multiply Left with each element of Right
function "/"(Left : Long_Long_Decimal_Array; Right : Long_Long_Decimal_Array) return Long_Long_Decimal_Array with Pure_Function;
--Array division, divide each respective element of Left and Right
function "/"(Left : Long_Long_Decimal_Array; Right : Long_Long_Decimal) return Long_Long_Decimal_Array with Pure_Function;
--Distributed division, divide each element of Left by Right
function "/"(Left : Long_Long_Decimal; Right : Long_Long_Decimal_Array) return Long_Long_Decimal_Array with Pure_Function;
--Distributed division, each Left by each element of Right
function "rem"(Left : Long_Long_Decimal_Array; Right : Long_Long_Decimal_Array) return Long_Long_Decimal_Array with Pure_Function;
--Array remainder, divide each respective element of Left and Right, keep the remainder
function "rem"(Left : Long_Long_Decimal_Array; Right : Long_Long_Decimal) return Long_Long_Decimal_Array with Pure_Function;
--Distributed remainder, divide each element of Left by Right, keep the remainder
function "rem"(Left : Long_Long_Decimal; Right : Long_Long_Decimal_Array) return Long_Long_Decimal_Array with Pure_Function;
--Distributed remainder, divide Left by each element of Right
function "mod"(Left : Long_Long_Decimal_Array; Right : Long_Long_Decimal_Array) return Long_Long_Decimal_Array with Pure_Function;
--Distributed modulus, divide each respective element of Left and Right, keep the remainder
function "mod"(Left : Long_Long_Decimal_Array; Right : Long_Long_Decimal) return Long_Long_Decimal_Array with Pure_Function;
--Distributed modulus, divide each element of Left by Right, keep the remainder
function "mod"(Left : Long_Long_Decimal; Right : Long_Long_Decimal_Array) return Long_Long_Decimal_Array with Pure_Function;
--Distributed modulus, divide Left by each element of Right
function "="(Left : Long_Long_Decimal_Array; Right : Long_Long_Decimal_Array) return Boolean with Pure_Function;
--Array equality, test each respective element of Left and Right
function "="(Left : Long_Long_Decimal_Array; Right : Long_Long_Decimal) return Boolean with Pure_Function;
--Distributed equality, test each element of Left with Right
function "="(Left : Long_Long_Decimal; Right : Long_Long_Decimal_Array) return Boolean with Pure_Function;
--Distributed equality, test Left with each element of Right
function "<"(Left : Long_Long_Decimal_Array; Right : Long_Long_Decimal_Array) return Boolean with Pure_Function;
--Distributed lesser, test each respective element of Left with Right
function "<"(Left : Long_Long_Decimal_Array; Right : Long_Long_Decimal) return Boolean with Pure_Function;
--Distributed lesser, test each element of Left with Right
function "<"(Left : Long_Long_Decimal; Right : Long_Long_Decimal_Array) return Boolean with Pure_Function;
--Distributed lesser, test Left with each element of Right
function ">"(Left : Long_Long_Decimal_Array; Right : Long_Long_Decimal_Array) return Boolean with Pure_Function;
--Distributed greater, test each respective element of Left with Right
function ">"(Left : Long_Long_Decimal_Array; Right : Long_Long_Decimal) return Boolean with Pure_Function;
--Distributed greater, test each element of Left with Right
function ">"(Left : Long_Long_Decimal; Right : Long_Long_Decimal_Array) return Boolean with Pure_Function;
--Distributed greater, test Left with each element of Right
function "<="(Left : Long_Long_Decimal_Array; Right : Long_Long_Decimal_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test each respective element of Left with Right
function "<="(Left : Long_Long_Decimal_Array; Right : Long_Long_Decimal) return Boolean with Pure_Function;
--Distributed lesser or equal, test each element of Left with Right
function "<="(Left : Long_Long_Decimal; Right : Long_Long_Decimal_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test Left with each element of Right
function ">="(Left : Long_Long_Decimal_Array; Right : Long_Long_Decimal_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test each respective element of Left with Right
function ">="(Left : Long_Long_Decimal_Array; Right : Long_Long_Decimal) return Boolean with Pure_Function;
--Distributed greater or equal, test each element of Left with Right
function ">="(Left : Long_Long_Decimal; Right : Long_Long_Decimal_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test Left with each element of Right
function Max is new Decimal_Max(Long_Long_Decimal, Long_Long_Decimal_Array) with Pure_Function;
--Find the maximum value of the array
function Min is new Decimal_Min(Long_Long_Decimal, Long_Long_Decimal_Array) with Pure_Function;
--Find the minimum value of the array
function Apply is new Decimal_Apply_Procedure(Long_Long_Decimal, Long_Long_Decimal_Array);
--Apply the procedure to each value of the array, returning the result
function Map(Value : Long_Long_Decimal_Array; Callback : access Procedure(Value : in out Long_Long_Decimal)) return Long_Long_Decimal_Array renames Apply;
function Apply is new Decimal_Apply_Function(Long_Long_Decimal, Long_Long_Decimal_Array);
--Apply the function to each value of the array, returning the result
function Map(Value : Long_Long_Decimal_Array; Callback : access Function(Value : Long_Long_Decimal) return Long_Long_Decimal) return Long_Long_Decimal_Array renames Apply;
function Fold is new Decimal_Fold(Long_Long_Decimal, Long_Long_Decimal_Array);
--Fold the array using the specified function
-----------------------
-- Short Float Array --
-----------------------
type Short_Float_Array is array(Positive range <>) of Short_Float;
function "+"(Value : Short_Float_Array) return Short_Float_Array with Pure_Function;
--Distributed assertion
function "-"(Value : Short_Float_Array) return Short_Float_Array with Pure_Function;
--Distributed negation
function "abs"(Value : Short_Float_Array) return Short_Float_Array with Pure_Function;
--Distributed absolute value
function "+"(Left : Short_Float_Array; Right : Short_Float_Array) return Short_Float_Array with Pure_Function;
--Array addition, add together each respective element of Left and Right
function "+"(Left : Short_Float_Array; Right : Short_Float) return Short_Float_Array with Pure_Function;
--Distributed addition, add each element of Left with Right
function "+"(Left : Short_Float; Right : Short_Float_Array) return Short_Float_Array with Pure_Function;
--Distributed addition, add Left with each element of Right
function "-"(Left : Short_Float_Array; Right : Short_Float_Array) return Short_Float_Array with Pure_Function;
--Array subtraction, subtract each respective element of Left and Right
function "-"(Left : Short_Float_Array; Right : Short_Float) return Short_Float_Array with Pure_Function;
--Distributed subtraction, subtract Right from each element of Left
function "-"(Left : Short_Float; Right : Short_Float_Array) return Short_Float_Array with Pure_Function;
--Distributed subtraction, subtract each element of Right from Left
function "*"(Left : Short_Float_Array; Right : Short_Float_Array) return Short_Float_Array with Pure_Function;
--Array multiplication, multiply together each respective element
function "*"(Left : Short_Float_Array; Right : Short_Float) return Short_Float_Array with Pure_Function;
--Distributed multiplication, multiply each element of Left with Right
function "*"(Left : Short_Float; Right : Short_Float_Array) return Short_Float_Array with Pure_Function;
--Distributed multiplication, multiply Left with each element of Right
function "/"(Left : Short_Float_Array; Right : Short_Float_Array) return Short_Float_Array with Pure_Function;
--Array division, divide each respective element of Left and Right
function "/"(Left : Short_Float_Array; Right : Short_Float) return Short_Float_Array with Pure_Function;
--Distributed division, divide each element of Left by Right
function "/"(Left : Short_Float; Right : Short_Float_Array) return Short_Float_Array with Pure_Function;
--Distributed division, each Left by each element of Right
function "rem"(Left : Short_Float_Array; Right : Short_Float_Array) return Short_Float_Array with Pure_Function;
--Array remainder, divide each respective element of Left and Right, keep the remainder
function "rem"(Left : Short_Float_Array; Right : Short_Float) return Short_Float_Array with Pure_Function;
--Distributed remainder, divide each element of Left by Right, keep the remainder
function "rem"(Left : Short_Float; Right : Short_Float_Array) return Short_Float_Array with Pure_Function;
--Distributed remainder, divide Left by each element of Right
function "mod"(Left : Short_Float_Array; Right : Short_Float_Array) return Short_Float_Array with Pure_Function;
--Distributed modulus, divide each respective element of Left and Right, keep the remainder
function "mod"(Left : Short_Float_Array; Right : Short_Float) return Short_Float_Array with Pure_Function;
--Distributed modulus, divide each element of Left by Right, keep the remainder
function "mod"(Left : Short_Float; Right : Short_Float_Array) return Short_Float_Array with Pure_Function;
--Distributed modulus, divide Left by each element of Right
function "="(Left : Short_Float_Array; Right : Short_Float_Array) return Boolean with Pure_Function;
--Array equality, test each respective element of Left and Right
function "="(Left : Short_Float_Array; Right : Short_Float) return Boolean with Pure_Function;
--Distributed equality, test each element of Left with Right
function "="(Left : Short_Float; Right : Short_Float_Array) return Boolean with Pure_Function;
--Distributed equality, test Left with each element of Right
function "<"(Left : Short_Float_Array; Right : Short_Float_Array) return Boolean with Pure_Function;
--Distributed lesser, test each respective element of Left with Right
function "<"(Left : Short_Float_Array; Right : Short_Float) return Boolean with Pure_Function;
--Distributed lesser, test each element of Left with Right
function "<"(Left : Short_Float; Right : Short_Float_Array) return Boolean with Pure_Function;
--Distributed lesser, test Left with each element of Right
function ">"(Left : Short_Float_Array; Right : Short_Float_Array) return Boolean with Pure_Function;
--Distributed greater, test each respective element of Left with Right
function ">"(Left : Short_Float_Array; Right : Short_Float) return Boolean with Pure_Function;
--Distributed greater, test each element of Left with Right
function ">"(Left : Short_Float; Right : Short_Float_Array) return Boolean with Pure_Function;
--Distributed greater, test Left with each element of Right
function "<="(Left : Short_Float_Array; Right : Short_Float_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test each respective element of Left with Right
function "<="(Left : Short_Float_Array; Right : Short_Float) return Boolean with Pure_Function;
--Distributed lesser or equal, test each element of Left with Right
function "<="(Left : Short_Float; Right : Short_Float_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test Left with each element of Right
function ">="(Left : Short_Float_Array; Right : Short_Float_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test each respective element of Left with Right
function ">="(Left : Short_Float_Array; Right : Short_Float) return Boolean with Pure_Function;
--Distributed greater or equal, test each element of Left with Right
function ">="(Left : Short_Float; Right : Short_Float_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test Left with each element of Right
function Max is new Float_Max(Short_Float, Short_Float_Array) with Pure_Function;
--Find the maximum value of the array
function Min is new Float_Min(Short_Float, Short_Float_Array) with Pure_Function;
--Find the minimum value of the array
function Apply is new Float_Apply_Procedure(Short_Float, Short_Float_Array);
--Apply the procedure to each value of the array, returning the result
function Map(Value : Short_Float_Array; Callback : access Procedure(Value : in out Short_Float)) return Short_Float_Array renames Apply;
function Apply is new Float_Apply_Function(Short_Float, Short_Float_Array);
--Apply the function to each value of the array, returning the result
function Map(Value : Short_Float_Array; Callback : access Function(Value : Short_Float) return Short_Float) return Short_Float_Array renames Apply;
function Fold is new Float_Fold(Short_Float, Short_Float_Array);
--Fold the array using the specified function
-----------------
-- Float Array --
-----------------
type Float_Array is array(Positive range <>) of Float;
function "+"(Value : Float_Array) return Float_Array with Pure_Function;
--Distributed assertion
function "-"(Value : Float_Array) return Float_Array with Pure_Function;
--Distributed negation
function "abs"(Value : Float_Array) return Float_Array with Pure_Function;
--Distributed absolute value
function "+"(Left : Float_Array; Right : Float_Array) return Float_Array with Pure_Function;
--Array addition, add together each respective element of Left and Right
function "+"(Left : Float_Array; Right : Float) return Float_Array with Pure_Function;
--Distributed addition, add each element of Left with Right
function "+"(Left : Float; Right : Float_Array) return Float_Array with Pure_Function;
--Distributed addition, add Left with each element of Right
function "-"(Left : Float_Array; Right : Float_Array) return Float_Array with Pure_Function;
--Array subtraction, subtract each respective element of Left and Right
function "-"(Left : Float_Array; Right : Float) return Float_Array with Pure_Function;
--Distributed subtraction, subtract Right from each element of Left
function "-"(Left : Float; Right : Float_Array) return Float_Array with Pure_Function;
--Distributed subtraction, subtract each element of Right from Left
function "*"(Left : Float_Array; Right : Float_Array) return Float_Array with Pure_Function;
--Array multiplication, multiply together each respective element
function "*"(Left : Float_Array; Right : Float) return Float_Array with Pure_Function;
--Distributed multiplication, multiply each element of Left with Right
function "*"(Left : Float; Right : Float_Array) return Float_Array with Pure_Function;
--Distributed multiplication, multiply Left with each element of Right
function "/"(Left : Float_Array; Right : Float_Array) return Float_Array with Pure_Function;
--Array division, divide each respective element of Left and Right
function "/"(Left : Float_Array; Right : Float) return Float_Array with Pure_Function;
--Distributed division, divide each element of Left by Right
function "/"(Left : Float; Right : Float_Array) return Float_Array with Pure_Function;
--Distributed division, each Left by each element of Right
function "rem"(Left : Float_Array; Right : Float_Array) return Float_Array with Pure_Function;
--Array remainder, divide each respective element of Left and Right, keep the remainder
function "rem"(Left : Float_Array; Right : Float) return Float_Array with Pure_Function;
--Distributed remainder, divide each element of Left by Right, keep the remainder
function "rem"(Left : Float; Right : Float_Array) return Float_Array with Pure_Function;
--Distributed remainder, divide Left by each element of Right
function "mod"(Left : Float_Array; Right : Float_Array) return Float_Array with Pure_Function;
--Distributed modulus, divide each respective element of Left and Right, keep the remainder
function "mod"(Left : Float_Array; Right : Float) return Float_Array with Pure_Function;
--Distributed modulus, divide each element of Left by Right, keep the remainder
function "mod"(Left : Float; Right : Float_Array) return Float_Array with Pure_Function;
--Distributed modulus, divide Left by each element of Right
function "="(Left : Float_Array; Right : Float_Array) return Boolean with Pure_Function;
--Array equality, test each respective element of Left and Right
function "="(Left : Float_Array; Right : Float) return Boolean with Pure_Function;
--Distributed equality, test each element of Left with Right
function "="(Left : Float; Right : Float_Array) return Boolean with Pure_Function;
--Distributed equality, test Left with each element of Right
function "<"(Left : Float_Array; Right : Float_Array) return Boolean with Pure_Function;
--Distributed lesser, test each respective element of Left with Right
function "<"(Left : Float_Array; Right : Float) return Boolean with Pure_Function;
--Distributed lesser, test each element of Left with Right
function "<"(Left : Float; Right : Float_Array) return Boolean with Pure_Function;
--Distributed lesser, test Left with each element of Right
function ">"(Left : Float_Array; Right : Float_Array) return Boolean with Pure_Function;
--Distributed greater, test each respective element of Left with Right
function ">"(Left : Float_Array; Right : Float) return Boolean with Pure_Function;
--Distributed greater, test each element of Left with Right
function ">"(Left : Float; Right : Float_Array) return Boolean with Pure_Function;
--Distributed greater, test Left with each element of Right
function "<="(Left : Float_Array; Right : Float_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test each respective element of Left with Right
function "<="(Left : Float_Array; Right : Float) return Boolean with Pure_Function;
--Distributed lesser or equal, test each element of Left with Right
function "<="(Left : Float; Right : Float_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test Left with each element of Right
function ">="(Left : Float_Array; Right : Float_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test each respective element of Left with Right
function ">="(Left : Float_Array; Right : Float) return Boolean with Pure_Function;
--Distributed greater or equal, test each element of Left with Right
function ">="(Left : Float; Right : Float_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test Left with each element of Right
function Max is new Float_Max(Float, Float_Array) with Pure_Function;
--Find the maximum value of the array
function Min is new Float_Min(Float, Float_Array) with Pure_Function;
--Find the minimum value of the array
function Apply is new Float_Apply_Procedure(Float, Float_Array);
--Apply the procedure to each value of the array, returning the result
function Map(Value : Float_Array; Callback : access Procedure(Value : in out Float)) return Float_Array renames Apply;
function Apply is new Float_Apply_Function(Float, Float_Array);
--Apply the function to each value of the array, returning the result
function Map(Value : Float_Array; Callback : access Function(Value : Float) return Float) return Float_Array renames Apply;
function Fold is new Float_Fold(Float, Float_Array);
--Fold the array using the specified function
----------------------
-- Long Float Array --
----------------------
type Long_Float_Array is array(Positive range <>) of Long_Float;
function "+"(Value : Long_Float_Array) return Long_Float_Array with Pure_Function;
--Distributed assertion
function "-"(Value : Long_Float_Array) return Long_Float_Array with Pure_Function;
--Distributed negation
function "abs"(Value : Long_Float_Array) return Long_Float_Array with Pure_Function;
--Distributed absolute value
function "+"(Left : Long_Float_Array; Right : Long_Float_Array) return Long_Float_Array with Pure_Function;
--Array addition, add together each respective element of Left and Right
function "+"(Left : Long_Float_Array; Right : Long_Float) return Long_Float_Array with Pure_Function;
--Distributed addition, add each element of Left with Right
function "+"(Left : Long_Float; Right : Long_Float_Array) return Long_Float_Array with Pure_Function;
--Distributed addition, add Left with each element of Right
function "-"(Left : Long_Float_Array; Right : Long_Float_Array) return Long_Float_Array with Pure_Function;
--Array subtraction, subtract each respective element of Left and Right
function "-"(Left : Long_Float_Array; Right : Long_Float) return Long_Float_Array with Pure_Function;
--Distributed subtraction, subtract Right from each element of Left
function "-"(Left : Long_Float; Right : Long_Float_Array) return Long_Float_Array with Pure_Function;
--Distributed subtraction, subtract each element of Right from Left
function "*"(Left : Long_Float_Array; Right : Long_Float_Array) return Long_Float_Array with Pure_Function;
--Array multiplication, multiply together each respective element
function "*"(Left : Long_Float_Array; Right : Long_Float) return Long_Float_Array with Pure_Function;
--Distributed multiplication, multiply each element of Left with Right
function "*"(Left : Long_Float; Right : Long_Float_Array) return Long_Float_Array with Pure_Function;
--Distributed multiplication, multiply Left with each element of Right
function "/"(Left : Long_Float_Array; Right : Long_Float_Array) return Long_Float_Array with Pure_Function;
--Array division, divide each respective element of Left and Right
function "/"(Left : Long_Float_Array; Right : Long_Float) return Long_Float_Array with Pure_Function;
--Distributed division, divide each element of Left by Right
function "/"(Left : Long_Float; Right : Long_Float_Array) return Long_Float_Array with Pure_Function;
--Distributed division, each Left by each element of Right
function "rem"(Left : Long_Float_Array; Right : Long_Float_Array) return Long_Float_Array with Pure_Function;
--Array remainder, divide each respective element of Left and Right, keep the remainder
function "rem"(Left : Long_Float_Array; Right : Long_Float) return Long_Float_Array with Pure_Function;
--Distributed remainder, divide each element of Left by Right, keep the remainder
function "rem"(Left : Long_Float; Right : Long_Float_Array) return Long_Float_Array with Pure_Function;
--Distributed remainder, divide Left by each element of Right
function "mod"(Left : Long_Float_Array; Right : Long_Float_Array) return Long_Float_Array with Pure_Function;
--Distributed modulus, divide each respective element of Left and Right, keep the remainder
function "mod"(Left : Long_Float_Array; Right : Long_Float) return Long_Float_Array with Pure_Function;
--Distributed modulus, divide each element of Left by Right, keep the remainder
function "mod"(Left : Long_Float; Right : Long_Float_Array) return Long_Float_Array with Pure_Function;
--Distributed modulus, divide Left by each element of Right
function "="(Left : Long_Float_Array; Right : Long_Float_Array) return Boolean with Pure_Function;
--Array equality, test each respective element of Left and Right
function "="(Left : Long_Float_Array; Right : Long_Float) return Boolean with Pure_Function;
--Distributed equality, test each element of Left with Right
function "="(Left : Long_Float; Right : Long_Float_Array) return Boolean with Pure_Function;
--Distributed equality, test Left with each element of Right
function "<"(Left : Long_Float_Array; Right : Long_Float_Array) return Boolean with Pure_Function;
--Distributed lesser, test each respective element of Left with Right
function "<"(Left : Long_Float_Array; Right : Long_Float) return Boolean with Pure_Function;
--Distributed lesser, test each element of Left with Right
function "<"(Left : Long_Float; Right : Long_Float_Array) return Boolean with Pure_Function;
--Distributed lesser, test Left with each element of Right
function ">"(Left : Long_Float_Array; Right : Long_Float_Array) return Boolean with Pure_Function;
--Distributed greater, test each respective element of Left with Right
function ">"(Left : Long_Float_Array; Right : Long_Float) return Boolean with Pure_Function;
--Distributed greater, test each element of Left with Right
function ">"(Left : Long_Float; Right : Long_Float_Array) return Boolean with Pure_Function;
--Distributed greater, test Left with each element of Right
function "<="(Left : Long_Float_Array; Right : Long_Float_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test each respective element of Left with Right
function "<="(Left : Long_Float_Array; Right : Long_Float) return Boolean with Pure_Function;
--Distributed lesser or equal, test each element of Left with Right
function "<="(Left : Long_Float; Right : Long_Float_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test Left with each element of Right
function ">="(Left : Long_Float_Array; Right : Long_Float_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test each respective element of Left with Right
function ">="(Left : Long_Float_Array; Right : Long_Float) return Boolean with Pure_Function;
--Distributed greater or equal, test each element of Left with Right
function ">="(Left : Long_Float; Right : Long_Float_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test Left with each element of Right
function Max is new Float_Max(Long_Float, Long_Float_Array) with Pure_Function;
--Find the maximum value of the array
function Min is new Float_Min(Long_Float, Long_Float_Array) with Pure_Function;
--Find the minimum value of the array
function Apply is new Float_Apply_Procedure(Long_Float, Long_Float_Array);
--Apply the procedure to each value of the array, returning the result
function Map(Value : Long_Float_Array; Callback : access Procedure(Value : in out Long_Float)) return Long_Float_Array renames Apply;
function Apply is new Float_Apply_Function(Long_Float, Long_Float_Array);
--Apply the function to each value of the array, returning the result
function Map(Value : Long_Float_Array; Callback : access Function(Value : Long_Float) return Long_Float) return Long_Float_Array renames Apply;
function Fold is new Float_Fold(Long_Float, Long_Float_Array);
--Fold the array using the specified function
---------------------------
-- Long Long Float Array --
---------------------------
type Long_Long_Float_Array is array(Positive range <>) of Long_Long_Float;
function "+"(Value : Long_Long_Float_Array) return Long_Long_Float_Array with Pure_Function;
--Distributed assertion
function "-"(Value : Long_Long_Float_Array) return Long_Long_Float_Array with Pure_Function;
--Distributed negation
function "abs"(Value : Long_Long_Float_Array) return Long_Long_Float_Array with Pure_Function;
--Distributed absolute value
function "+"(Left : Long_Long_Float_Array; Right : Long_Long_Float_Array) return Long_Long_Float_Array with Pure_Function;
--Array addition, add together each respective element of Left and Right
function "+"(Left : Long_Long_Float_Array; Right : Long_Long_Float) return Long_Long_Float_Array with Pure_Function;
--Distributed addition, add each element of Left with Right
function "+"(Left : Long_Long_Float; Right : Long_Long_Float_Array) return Long_Long_Float_Array with Pure_Function;
--Distributed addition, add Left with each element of Right
function "-"(Left : Long_Long_Float_Array; Right : Long_Long_Float_Array) return Long_Long_Float_Array with Pure_Function;
--Array subtraction, subtract each respective element of Left and Right
function "-"(Left : Long_Long_Float_Array; Right : Long_Long_Float) return Long_Long_Float_Array with Pure_Function;
--Distributed subtraction, subtract Right from each element of Left
function "-"(Left : Long_Long_Float; Right : Long_Long_Float_Array) return Long_Long_Float_Array with Pure_Function;
--Distributed subtraction, subtract each element of Right from Left
function "*"(Left : Long_Long_Float_Array; Right : Long_Long_Float_Array) return Long_Long_Float_Array with Pure_Function;
--Array multiplication, multiply together each respective element
function "*"(Left : Long_Long_Float_Array; Right : Long_Long_Float) return Long_Long_Float_Array with Pure_Function;
--Distributed multiplication, multiply each element of Left with Right
function "*"(Left : Long_Long_Float; Right : Long_Long_Float_Array) return Long_Long_Float_Array with Pure_Function;
--Distributed multiplication, multiply Left with each element of Right
function "/"(Left : Long_Long_Float_Array; Right : Long_Long_Float_Array) return Long_Long_Float_Array with Pure_Function;
--Array division, divide each respective element of Left and Right
function "/"(Left : Long_Long_Float_Array; Right : Long_Long_Float) return Long_Long_Float_Array with Pure_Function;
--Distributed division, divide each element of Left by Right
function "/"(Left : Long_Long_Float; Right : Long_Long_Float_Array) return Long_Long_Float_Array with Pure_Function;
--Distributed division, each Left by each element of Right
function "rem"(Left : Long_Long_Float_Array; Right : Long_Long_Float_Array) return Long_Long_Float_Array with Pure_Function;
--Array remainder, divide each respective element of Left and Right, keep the remainder
function "rem"(Left : Long_Long_Float_Array; Right : Long_Long_Float) return Long_Long_Float_Array with Pure_Function;
--Distributed remainder, divide each element of Left by Right, keep the remainder
function "rem"(Left : Long_Long_Float; Right : Long_Long_Float_Array) return Long_Long_Float_Array with Pure_Function;
--Distributed remainder, divide Left by each element of Right
function "mod"(Left : Long_Long_Float_Array; Right : Long_Long_Float_Array) return Long_Long_Float_Array with Pure_Function;
--Distributed modulus, divide each respective element of Left and Right, keep the remainder
function "mod"(Left : Long_Long_Float_Array; Right : Long_Long_Float) return Long_Long_Float_Array with Pure_Function;
--Distributed modulus, divide each element of Left by Right, keep the remainder
function "mod"(Left : Long_Long_Float; Right : Long_Long_Float_Array) return Long_Long_Float_Array with Pure_Function;
--Distributed modulus, divide Left by each element of Right
function "="(Left : Long_Long_Float_Array; Right : Long_Long_Float_Array) return Boolean with Pure_Function;
--Array equality, test each respective element of Left and Right
function "="(Left : Long_Long_Float_Array; Right : Long_Long_Float) return Boolean with Pure_Function;
--Distributed equality, test each element of Left with Right
function "="(Left : Long_Long_Float; Right : Long_Long_Float_Array) return Boolean with Pure_Function;
--Distributed equality, test Left with each element of Right
function "<"(Left : Long_Long_Float_Array; Right : Long_Long_Float_Array) return Boolean with Pure_Function;
--Distributed lesser, test each respective element of Left with Right
function "<"(Left : Long_Long_Float_Array; Right : Long_Long_Float) return Boolean with Pure_Function;
--Distributed lesser, test each element of Left with Right
function "<"(Left : Long_Long_Float; Right : Long_Long_Float_Array) return Boolean with Pure_Function;
--Distributed lesser, test Left with each element of Right
function ">"(Left : Long_Long_Float_Array; Right : Long_Long_Float_Array) return Boolean with Pure_Function;
--Distributed greater, test each respective element of Left with Right
function ">"(Left : Long_Long_Float_Array; Right : Long_Long_Float) return Boolean with Pure_Function;
--Distributed greater, test each element of Left with Right
function ">"(Left : Long_Long_Float; Right : Long_Long_Float_Array) return Boolean with Pure_Function;
--Distributed greater, test Left with each element of Right
function "<="(Left : Long_Long_Float_Array; Right : Long_Long_Float_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test each respective element of Left with Right
function "<="(Left : Long_Long_Float_Array; Right : Long_Long_Float) return Boolean with Pure_Function;
--Distributed lesser or equal, test each element of Left with Right
function "<="(Left : Long_Long_Float; Right : Long_Long_Float_Array) return Boolean with Pure_Function;
--Distributed lesser or equal, test Left with each element of Right
function ">="(Left : Long_Long_Float_Array; Right : Long_Long_Float_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test each respective element of Left with Right
function ">="(Left : Long_Long_Float_Array; Right : Long_Long_Float) return Boolean with Pure_Function;
--Distributed greater or equal, test each element of Left with Right
function ">="(Left : Long_Long_Float; Right : Long_Long_Float_Array) return Boolean with Pure_Function;
--Distributed greater or equal, test Left with each element of Right
function Max is new Float_Max(Long_Long_Float, Long_Long_Float_Array) with Pure_Function;
--Find the maximum value of the array
function Min is new Float_Min(Long_Long_Float, Long_Long_Float_Array) with Pure_Function;
--Find the minimum value of the array
function Apply is new Float_Apply_Procedure(Long_Long_Float, Long_Long_Float_Array);
--Apply the procedure to each value of the array, returning the result
function Map(Value : Long_Long_Float_Array; Callback : access Procedure(Value : in out Long_Long_Float)) return Long_Long_Float_Array renames Apply;
function Apply is new Float_Apply_Function(Long_Long_Float, Long_Long_Float_Array);
--Apply the function to each value of the array, returning the result
function Map(Value : Long_Long_Float_Array; Callback : access Function(Value : Long_Long_Float) return Long_Long_Float) return Long_Long_Float_Array renames Apply;
function Fold is new Float_Fold(Long_Long_Float, Long_Long_Float_Array);
--Fold the array using the specified function
end Mathematics.Arrays;
|
sungyeon/drake | Ada | 9,151 | adb | with Ada.Unchecked_Conversion;
with System.Address_To_Constant_Access_Conversions;
with System.Storage_Elements;
with C.stdint;
package body C.unwind_pe is
pragma Suppress (All_Checks);
use type System.Storage_Elements.Storage_Offset;
procedure unreachable
with Import,
Convention => Intrinsic, External_Name => "__builtin_unreachable";
pragma No_Return (unreachable);
package unsigned_char_const_ptr_Conv is
new System.Address_To_Constant_Access_Conversions (
C.unsigned_char,
C.unsigned_char_const_ptr);
function "+" (Left : C.unsigned_char_const_ptr; Right : C.ptrdiff_t)
return C.unsigned_char_const_ptr
with Convention => Intrinsic;
pragma Inline_Always ("+");
function "+" (Left : C.unsigned_char_const_ptr; Right : C.ptrdiff_t)
return C.unsigned_char_const_ptr is
begin
return unsigned_char_const_ptr_Conv.To_Pointer (
unsigned_char_const_ptr_Conv.To_Address (Left)
+ System.Storage_Elements.Storage_Offset (Right));
end "+";
-- implementation
function size_of_encoded_value (encoding : unsigned_char)
return unsigned_int is
begin
if encoding = DW_EH_PE_omit then
return 0;
end if;
case encoding and 16#07# is
when DW_EH_PE_absptr =>
return void_ptr'Size / Standard'Storage_Unit;
when DW_EH_PE_udata2 =>
return 2;
when DW_EH_PE_udata4 =>
return 4;
when DW_EH_PE_udata8 =>
return 8;
when others =>
null;
end case;
gxx_abort;
end size_of_encoded_value;
function base_of_encoded_value (
encoding : unsigned_char;
context : access unwind.struct_Unwind_Context)
return unwind.Unwind_Ptr is
begin
if encoding = DW_EH_PE_omit then
return 0;
end if;
case encoding and 16#70# is
when DW_EH_PE_absptr
| DW_EH_PE_pcrel
| DW_EH_PE_aligned =>
return 0;
when DW_EH_PE_textrel =>
return unwind.Unwind_GetTextRelBase (context);
when DW_EH_PE_datarel =>
return unwind.Unwind_GetDataRelBase (context);
when DW_EH_PE_funcrel =>
return unwind.Unwind_GetRegionStart (context);
when others =>
null;
end case;
gxx_abort;
end base_of_encoded_value;
function read_uleb128 (
p : access constant unsigned_char;
val : access unwind.uleb128_t)
return unsigned_char_const_ptr
is
Mutable_p : unsigned_char_const_ptr := unsigned_char_const_ptr (p);
shift : unsigned_int := 0;
byte : unsigned_char;
result : unwind.uleb128_t;
begin
result := 0;
loop
byte := Mutable_p.all;
Mutable_p := Mutable_p + 1;
if shift >= unwind.uleb128_t'Size then
unreachable;
end if;
result := result
or Shift_Left (
unwind.uleb128_t (byte) and 16#7f#,
Natural (shift));
shift := shift + 7;
exit when not ((byte and 16#80#) /= 0);
end loop;
val.all := result;
return Mutable_p;
end read_uleb128;
function read_sleb128 (
p : access constant unsigned_char;
val : access unwind.sleb128_t)
return unsigned_char_const_ptr
is
Mutable_p : unsigned_char_const_ptr := unsigned_char_const_ptr (p);
shift : unsigned_int := 0;
byte : unsigned_char;
result : unwind.uleb128_t;
begin
result := 0;
loop
byte := Mutable_p.all;
Mutable_p := Mutable_p + 1;
if shift >= unwind.uleb128_t'Size then
unreachable;
end if;
result := result
or Shift_Left (
unwind.uleb128_t (byte) and 16#7f#,
Natural (shift));
shift := shift + 7;
exit when not ((byte and 16#80#) /= 0);
end loop;
if shift < result'Size and then (byte and 16#40#) /= 0 then
result := result or (-Shift_Left (1, Natural (shift)));
end if;
val.all := unwind.sleb128_t (result);
return Mutable_p;
end read_sleb128;
function read_encoded_value_with_base (
encoding : unsigned_char;
base : unwind.Unwind_Ptr;
p : access constant unsigned_char;
val : access unwind.Unwind_Ptr)
return unsigned_char_const_ptr
is
function Cast is
new Ada.Unchecked_Conversion (void_ptr, unwind.Unwind_Internal_Ptr);
type Unwind_Internal_Ptr_ptr is access all unwind.Unwind_Internal_Ptr;
function Cast is
new Ada.Unchecked_Conversion (
unwind.Unwind_Internal_Ptr,
Unwind_Internal_Ptr_ptr);
Mutable_p : unsigned_char_const_ptr := unsigned_char_const_ptr (p);
type unaligned (unchecked_tag : unsigned_int := 0) is record
case unchecked_tag is
when 0 =>
ptr : void_ptr;
when DW_EH_PE_udata2 =>
u2 : stdint.uint16_t;
when DW_EH_PE_udata4 =>
u4 : stdint.uint32_t;
when DW_EH_PE_udata8 =>
u8 : stdint.uint64_t;
when DW_EH_PE_sdata2 =>
s2 : stdint.int16_t;
when DW_EH_PE_sdata4 =>
s4 : stdint.int32_t;
when others => -- DW_EH_PE_sdata8
s8 : stdint.int64_t;
end case;
end record;
pragma Unchecked_Union (unaligned);
type unaligned_ptr is access all unaligned;
function Cast is
new Ada.Unchecked_Conversion (unsigned_char_const_ptr, unaligned_ptr);
function Cast is
new Ada.Unchecked_Conversion (
unaligned_ptr,
unwind.Unwind_Internal_Ptr);
u : constant unaligned_ptr := Cast (Mutable_p);
result : unwind.Unwind_Internal_Ptr;
begin
if encoding = DW_EH_PE_aligned then
declare
a : unwind.Unwind_Internal_Ptr :=
unwind.Unwind_Internal_Ptr (
System.Storage_Elements.To_Integer (
unsigned_char_const_ptr_Conv.To_Address (Mutable_p)));
begin
a := (a + void_ptr'Size / Standard'Storage_Unit - 1)
and -(void_ptr'Size / Standard'Storage_Unit);
result := Cast (a).all;
Mutable_p := unsigned_char_const_ptr_Conv.To_Pointer (
System'To_Address (
System.Storage_Elements.Integer_Address (
a + void_ptr'Size / Standard'Storage_Unit)));
end;
else
case encoding and 16#0f# is
when DW_EH_PE_absptr =>
result := Cast (u.ptr);
Mutable_p := Mutable_p + void_ptr'Size / Standard'Storage_Unit;
when DW_EH_PE_uleb128 =>
declare
tmp : aliased unwind.uleb128_t;
begin
Mutable_p := read_uleb128 (Mutable_p, tmp'Access);
result := unwind.Unwind_Internal_Ptr (tmp);
end;
when DW_EH_PE_sleb128 =>
declare
tmp : aliased unwind.sleb128_t;
begin
Mutable_p := read_sleb128 (Mutable_p, tmp'Access);
result := unwind.Unwind_Internal_Ptr (tmp);
end;
when DW_EH_PE_udata2 =>
result := unwind.Unwind_Internal_Ptr (u.u2);
Mutable_p := Mutable_p + 2;
when DW_EH_PE_udata4 =>
result := unwind.Unwind_Internal_Ptr (u.u4);
Mutable_p := Mutable_p + 4;
when DW_EH_PE_udata8 =>
result := unwind.Unwind_Internal_Ptr (u.u8);
Mutable_p := Mutable_p + 8;
when DW_EH_PE_sdata2 =>
result := unwind.Unwind_Internal_Ptr (u.s2);
Mutable_p := Mutable_p + 2;
when DW_EH_PE_sdata4 =>
result := unwind.Unwind_Internal_Ptr (u.s4);
Mutable_p := Mutable_p + 4;
when DW_EH_PE_sdata8 =>
result := unwind.Unwind_Internal_Ptr (u.s8);
Mutable_p := Mutable_p + 8;
when others =>
gxx_abort;
end case;
if result /= 0 then
if (encoding and 16#70#) = DW_EH_PE_pcrel then
result := result + Cast (u);
else
result := result + base;
end if;
if (encoding and DW_EH_PE_indirect) /= 0 then
result := Cast (result).all;
end if;
end if;
end if;
val.all := result;
return Mutable_p;
end read_encoded_value_with_base;
function read_encoded_value (
context : access unwind.struct_Unwind_Context;
encoding : unsigned_char;
p : access constant unsigned_char;
val : access unwind.Unwind_Ptr)
return unsigned_char_const_ptr is
begin
return read_encoded_value_with_base (
encoding,
base_of_encoded_value (encoding, context),
p,
val);
end read_encoded_value;
end C.unwind_pe;
|
AdaCore/libadalang | Ada | 47 | adb | procedure Common is
begin
null;
end Common;
|
MinimSecure/unum-sdk | Ada | 912 | ads | -- Copyright 2011-2016 Free Software Foundation, Inc.
--
-- This program 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.
--
-- This program 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 this program. If not, see <http://www.gnu.org/licenses/>.
package Pck is
procedure Hello;
procedure There;
-- The name of that procedure needs to be greater (in terms
-- of alphabetical order) than the name of the procedure above.
end Pck;
|
reznikmm/matreshka | Ada | 3,683 | ads | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Open Document Toolkit --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2013, Vadim Godunko <[email protected]> --
-- 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 XML.DOM.Attributes;
package ODF.DOM.Attributes.Style.Justify_Single_Word is
type ODF_Style_Justify_Single_Word is
new XML.DOM.Attributes.DOM_Attribute with private;
private
type ODF_Style_Justify_Single_Word is
new XML.DOM.Attributes.DOM_Attribute with null record;
end ODF.DOM.Attributes.Style.Justify_Single_Word;
|
tum-ei-rcs/StratoX | Ada | 8,533 | ads | with Ada.Real_Time; use Ada.Real_Time;
with Ada.Numerics;
package Units with
Spark_Mode is
---------------------
-- The unit system
---------------------
type Unit_Type is new Float with -- As tagged Type? -> Generics with Unit_Type'Class
Dimension_System =>
((Unit_Name => Meter, Unit_Symbol => 'm', Dim_Symbol => 'L'),
(Unit_Name => Kilogram, Unit_Symbol => "kg", Dim_Symbol => 'M'),
(Unit_Name => Second, Unit_Symbol => 's', Dim_Symbol => 'T'),
(Unit_Name => Ampere, Unit_Symbol => 'A', Dim_Symbol => 'I'),
(Unit_Name => Kelvin, Unit_Symbol => 'K', Dim_Symbol => "Theta"),
(Unit_Name => Radian, Unit_Symbol => "Rad", Dim_Symbol => "A")),
Default_Value => 0.0; -- required for matrices
type Unit_Array is array (Natural range <>) of Unit_Type;
-- Base Units
subtype Length_Type is Unit_Type with
Dimension => (Symbol => 'm', Meter => 1, others => 0);
subtype Mass_Type is Unit_Type with
Dimension => (Symbol => "kg", Kilogram => 1, others => 0);
subtype Time_Type is Unit_Type with
Dimension => (Symbol => 's', Second => 1, others => 0);
subtype Current_Type is Unit_Type with
Dimension => (Symbol => 'A', Ampere => 1, others => 0);
subtype Temperature_Type is Unit_Type with
Dimension => (Symbol => 'K', Kelvin => 1, others => 0);
subtype Angle_Type is Unit_Type with
Dimension => (Symbol => "Rad", Radian => 1, others => 0);
-- Derived Units
subtype Length_Angle_Ratio_Type is Unit_Type with
Dimension => (Meter => 1, Radian => -1, others => 0);
-- mechanical
subtype Frequency_Type is Unit_Type with
Dimension => (Symbol => "Hz", Second => -1, others => 0);
subtype Force_Type is Unit_Type with
Dimension => (Symbol => "N", Kilogram => 1, Meter => 1, Second => -2, others => 0);
subtype Energy_Type is Unit_Type with
Dimension => (Symbol => "J", Kilogram => 1, Meter => 2, Second => -2, others => 0);
subtype Power_Type is Unit_Type with
Dimension => (Symbol => "W", Kilogram => 1, Meter => 2, Second => -3, others => 0);
subtype Pressure_Type is Unit_Type with
Dimension => (Symbol => "Pa", Kilogram => 1, Meter => -1, Second => -2, others => 0);
-- electromagnetic
subtype Voltage_Type is Unit_Type with
Dimension =>
(Symbol => 'V',
Meter => 2,
Kilogram => 1,
Second => -3,
Ampere => -1,
others => 0);
subtype Charge_Type is Unit_Type with
Dimension => (Symbol => 'C', Second => 1, Ampere => 1, others => 0);
subtype Capacity_Type is Unit_Type with
Dimension =>
(Symbol => 'F',
Kilogram => -1,
Meter => -2,
Second => 4,
Ampere => 2,
others => 0);
subtype Resistivity_Type is Unit_Type with
Dimension =>
(Symbol => "Ω",
Kilogram => 1,
Meter => 2,
Second => -2,
Ampere => -3,
others => 0);
subtype Inductivity_Type is Unit_Type with
Dimension =>
(Symbol => 'H',
Kilogram => 1,
Meter => 2,
Second => -2,
Ampere => -2,
others => 0);
subtype Electric_Field_Type is Unit_Type with
Dimension =>
(Meter => 1,
Kilogram => 1,
Second => -3,
Ampere => -1,
others => 0);
subtype Magnetic_Flux_Type is Unit_Type with
Dimension =>
(Symbol => "Wb",
Kilogram => 1,
Meter => 2,
Second => -2,
Ampere => -1,
others => 0);
subtype Magnetic_Flux_Density_Type is Unit_Type with
Dimension => (Symbol => 'T', Kilogram => 1, Second => -2, Ampere => -1, others => 0);
-- further important dimensions
subtype Area_Type is Unit_Type with
Dimension => (Symbol => "m^2", Meter => 2, others => 0);
subtype Volume_Type is Unit_Type with
Dimension => (Symbol => "m^3", Meter => 3, others => 0);
subtype Linear_Velocity_Type is Unit_Type with
Dimension => (Meter => 1, Second => -1, others => 0);
subtype Angular_Velocity_Type is Unit_Type with
Dimension => (Radian => 1, Second => -1, others => 0);
subtype Linear_Acceleration_Type is Unit_Type with
Dimension => (Meter => 1, Second => -2, others => 0);
subtype Angular_Acceleration_Type is Unit_Type with
Dimension => (Radian => 1, Second => -2, others => 0);
--------------------------
-- Prefixes for units
--------------------------
subtype Prefix_Type is Unit_Type;
--type Prefix_Type is digits 2 range 1.0e-24 .. 1.0e+24;
Yocto : constant Prefix_Type := Prefix_Type (1.0e-24);
Zepto : constant Prefix_Type := Prefix_Type (1.0e-21);
Atto : constant Prefix_Type := Prefix_Type (1.0e-18);
Femto : constant Prefix_Type := Prefix_Type (1.0e-15);
Pico : constant Prefix_Type := Prefix_Type (1.0e-12);
Nano : constant Prefix_Type := Prefix_Type (1.0e-9);
Micro : constant Prefix_Type := Prefix_Type (1.0e-6);
Milli : constant Prefix_Type := Prefix_Type (1.0e-3);
Centi : constant Prefix_Type := Prefix_Type (1.0e-2);
Deci : constant Prefix_Type := Prefix_Type (1.0e-1);
Deca : constant Prefix_Type := Prefix_Type (1.0e+1);
Hecto : constant Prefix_Type := Prefix_Type (1.0e+2);
Kilo : constant Prefix_Type := Prefix_Type (1.0e+3);
Mega : constant Prefix_Type := Prefix_Type (1.0e+6);
Giga : constant Prefix_Type := Prefix_Type (1.0e+9);
Tera : constant Prefix_Type := Prefix_Type (1.0e+12);
Peta : constant Prefix_Type := Prefix_Type (1.0e+15);
Exa : constant Prefix_Type := Prefix_Type (1.0e+18);
Zetta : constant Prefix_Type := Prefix_Type (1.0e+21);
Yotta : constant Prefix_Type := Prefix_Type (1.0e+24);
--------------------------
-- The units
--------------------------
-- Base units
Meter : constant Length_Type := Length_Type (1.0);
Kilogram : constant Mass_Type := Mass_Type (1.0);
Gram : constant Mass_Type := Mass_Type (1.0e-3);
Second : constant Time_Type := Time_Type (1.0);
Ampere : constant Current_Type := Current_Type (1.0);
Kelvin : constant Temperature_Type := Temperature_Type (1.0);
-- Angular Units
Radian : constant Angle_Type := Angle_Type (1.0);
Degree : constant Angle_Type := Angle_Type (2.0 * Ada.Numerics.Pi / 360.0);
Evolution : constant Angle_Type := Angle_Type (2.0 * Ada.Numerics.Pi);
-- Derived Units
Newton : constant Force_Type := Force_Type (1.0);
Joule : constant Energy_Type := Energy_Type (1.0);
Watt : constant Power_Type := Power_Type (1.0);
Ohm : constant Resistivity_Type := Resistivity_Type (1.0);
Pascal : constant Pressure_Type := Pressure_Type (1.0);
Volt : constant Voltage_Type := Voltage_Type (1.0);
Coulomb : constant Charge_Type := Charge_Type(1.0);
Farad : constant Capacity_Type := Capacity_Type(1.0);
Weber : constant Magnetic_Flux_Type := Magnetic_Flux_Type(1.0);
Tesla : constant Magnetic_Flux_Density_Type := Magnetic_Flux_Density_Type(1.0);
Henry : constant Inductivity_Type := Inductivity_Type(1.0);
Hertz : constant Frequency_Type := Frequency_Type (1.0);
-- Non SI but metric
Minute : constant Time_Type := 60.0 * Second;
Hour : constant Time_Type := 60.0 * Minute;
Day : constant Time_Type := 24.0 * Hour;
Tonne : constant Mass_Type := 1_000.0 * Kilogram;
Angstrom : constant Length_Type := 1.0 * Nano * Meter;
Litre : constant Volume_Type := 1.0 * (1.0 * Deci * Meter)**3;
Bar : constant Pressure_Type := 1_000.0 * Hecto * Pascal;
Gauss : constant Magnetic_Flux_Density_Type := 0.1 * Tesla;
--------------------------
-- Physical constants
--------------------------
-- Approximate gravity on the earth's surface
GRAVITY : constant Linear_Acceleration_Type := 9.81 * Meter / (Second**2);
CELSIUS_0 : constant Temperature_Type := 273.15 * Kelvin;
DEGREE_360 : constant Angle_Type := 360.0 * Degree;
RADIAN_2PI : constant Angle_Type := 2.0 * Radian;
-- Physical constants
SPEED_OF_LIGHT : constant Linear_Velocity_Type := 299_792_458.0 * Meter / Second;
PLANCK_CONSTANT : constant Unit_Type := 6.626_070_040 * Joule * Second;
GRAVITY_CONSTANT : constant Linear_Acceleration_Type := 127_137.6 * Kilo * Meter / (Hour**2);
end Units;
|
reznikmm/matreshka | Ada | 3,709 | ads | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Open Document Toolkit --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2014, Vadim Godunko <[email protected]> --
-- 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 XML.DOM.Attributes;
package ODF.DOM.Style_Volatile_Attributes is
pragma Preelaborate;
type ODF_Style_Volatile_Attribute is limited interface
and XML.DOM.Attributes.DOM_Attribute;
type ODF_Style_Volatile_Attribute_Access is
access all ODF_Style_Volatile_Attribute'Class
with Storage_Size => 0;
end ODF.DOM.Style_Volatile_Attributes;
|
faelys/natools | Ada | 3,090 | ads | ------------------------------------------------------------------------------
-- Copyright (c) 2015, Natacha Porté --
-- --
-- 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.S_Expressions.Special_Descriptors provides descriptors blocked --
-- in End_Of_Input or Error states. --
-- The global variables should be task-safe, since there is no actual --
-- change in any of the primitives. --
------------------------------------------------------------------------------
with Natools.S_Expressions.Lockable;
package Natools.S_Expressions.Special_Descriptors is
pragma Preelaborate;
subtype Control_Event is Events.Event with Static_Predicate
=> Control_Event in Events.Error | Events.End_Of_Input;
type Constant_Descriptor (Event : Control_Event) is new Lockable.Descriptor
with null record;
overriding function Current_Event (Object : in Constant_Descriptor)
return Events.Event;
overriding function Current_Atom (Object : in Constant_Descriptor)
return Atom;
overriding function Current_Level (Object : in Constant_Descriptor)
return Natural;
overriding procedure Query_Atom
(Object : in Constant_Descriptor;
Process : not null access procedure (Data : in Atom));
overriding procedure Read_Atom
(Object : in Constant_Descriptor;
Data : out Atom;
Length : out Count);
overriding procedure Next
(Object : in out Constant_Descriptor;
Event : out Events.Event);
overriding procedure Lock
(Object : in out Constant_Descriptor;
State : out Lockable.Lock_State);
overriding procedure Unlock
(Object : in out Constant_Descriptor;
State : in out Lockable.Lock_State;
Finish : in Boolean := True);
Empty_Descriptor : Constant_Descriptor (Events.End_Of_Input);
Error_Descriptor : Constant_Descriptor (Events.Error);
end Natools.S_Expressions.Special_Descriptors;
|
gitter-badger/libAnne | Ada | 608 | ads | package Text.Sources is
type Source(Length : Positive) is private;
function Length(Self : Source) return Positive;
function Peek(Self : Source) return Wide_Wide_Character;
function Peek(Self : Source; Count : Positive) return Wide_Wide_String;
function Read(Self : in out Source) return Wide_Wide_Character;
function Read(Self : in out Source; Count : Positive) return Wide_Wide_String;
function To_Source(Value : Wide_Wide_String) return Source;
private
type Source(Length : Positive) is record
Buffer : Wide_Wide_String(1 .. Length);
Position : Positive;
end record;
end Text.Sources; |
HackInvent/Ada_Drivers_Library | Ada | 33,743 | ads | -- This spec has been automatically generated from STM32H7x3.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with System;
package STM32_SVD.LTDC is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype SSCR_VSH_Field is STM32_SVD.UInt11;
subtype SSCR_HSW_Field is STM32_SVD.UInt10;
-- Synchronization Size Configuration Register
type SSCR_Register is record
-- Vertical Synchronization Height (in units of horizontal scan line)
VSH : SSCR_VSH_Field := 16#0#;
-- unspecified
Reserved_11_15 : STM32_SVD.UInt5 := 16#0#;
-- Horizontal Synchronization Width (in units of pixel clock period)
HSW : SSCR_HSW_Field := 16#0#;
-- unspecified
Reserved_26_31 : STM32_SVD.UInt6 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SSCR_Register use record
VSH at 0 range 0 .. 10;
Reserved_11_15 at 0 range 11 .. 15;
HSW at 0 range 16 .. 25;
Reserved_26_31 at 0 range 26 .. 31;
end record;
subtype BPCR_AVBP_Field is STM32_SVD.UInt11;
subtype BPCR_AHBP_Field is STM32_SVD.UInt12;
-- Back Porch Configuration Register
type BPCR_Register is record
-- Accumulated Vertical back porch (in units of horizontal scan line)
AVBP : BPCR_AVBP_Field := 16#0#;
-- unspecified
Reserved_11_15 : STM32_SVD.UInt5 := 16#0#;
-- Accumulated Horizontal back porch (in units of pixel clock period)
AHBP : BPCR_AHBP_Field := 16#0#;
-- unspecified
Reserved_28_31 : STM32_SVD.UInt4 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for BPCR_Register use record
AVBP at 0 range 0 .. 10;
Reserved_11_15 at 0 range 11 .. 15;
AHBP at 0 range 16 .. 27;
Reserved_28_31 at 0 range 28 .. 31;
end record;
subtype AWCR_AAH_Field is STM32_SVD.UInt11;
subtype AWCR_AAV_Field is STM32_SVD.UInt12;
-- Active Width Configuration Register
type AWCR_Register is record
-- Accumulated Active Height (in units of horizontal scan line)
AAH : AWCR_AAH_Field := 16#0#;
-- unspecified
Reserved_11_15 : STM32_SVD.UInt5 := 16#0#;
-- AAV
AAV : AWCR_AAV_Field := 16#0#;
-- unspecified
Reserved_28_31 : STM32_SVD.UInt4 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for AWCR_Register use record
AAH at 0 range 0 .. 10;
Reserved_11_15 at 0 range 11 .. 15;
AAV at 0 range 16 .. 27;
Reserved_28_31 at 0 range 28 .. 31;
end record;
subtype TWCR_TOTALH_Field is STM32_SVD.UInt11;
subtype TWCR_TOTALW_Field is STM32_SVD.UInt12;
-- Total Width Configuration Register
type TWCR_Register is record
-- Total Height (in units of horizontal scan line)
TOTALH : TWCR_TOTALH_Field := 16#0#;
-- unspecified
Reserved_11_15 : STM32_SVD.UInt5 := 16#0#;
-- Total Width (in units of pixel clock period)
TOTALW : TWCR_TOTALW_Field := 16#0#;
-- unspecified
Reserved_28_31 : STM32_SVD.UInt4 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for TWCR_Register use record
TOTALH at 0 range 0 .. 10;
Reserved_11_15 at 0 range 11 .. 15;
TOTALW at 0 range 16 .. 27;
Reserved_28_31 at 0 range 28 .. 31;
end record;
subtype GCR_DBW_Field is STM32_SVD.UInt3;
subtype GCR_DGW_Field is STM32_SVD.UInt3;
subtype GCR_DRW_Field is STM32_SVD.UInt3;
-- Global Control Register
type GCR_Register is record
-- LCD-TFT controller enable bit
LTDCEN : Boolean := False;
-- unspecified
Reserved_1_3 : STM32_SVD.UInt3 := 16#0#;
-- Read-only. Dither Blue Width
DBW : GCR_DBW_Field := 16#2#;
-- unspecified
Reserved_7_7 : STM32_SVD.Bit := 16#0#;
-- Read-only. Dither Green Width
DGW : GCR_DGW_Field := 16#2#;
-- unspecified
Reserved_11_11 : STM32_SVD.Bit := 16#0#;
-- Read-only. Dither Red Width
DRW : GCR_DRW_Field := 16#2#;
-- unspecified
Reserved_15_15 : STM32_SVD.Bit := 16#0#;
-- Dither Enable
DEN : Boolean := False;
-- unspecified
Reserved_17_27 : STM32_SVD.UInt11 := 16#0#;
-- Pixel Clock Polarity
PCPOL : Boolean := False;
-- Data Enable Polarity
DEPOL : Boolean := False;
-- Vertical Synchronization Polarity
VSPOL : Boolean := False;
-- Horizontal Synchronization Polarity
HSPOL : Boolean := False;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for GCR_Register use record
LTDCEN at 0 range 0 .. 0;
Reserved_1_3 at 0 range 1 .. 3;
DBW at 0 range 4 .. 6;
Reserved_7_7 at 0 range 7 .. 7;
DGW at 0 range 8 .. 10;
Reserved_11_11 at 0 range 11 .. 11;
DRW at 0 range 12 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
DEN at 0 range 16 .. 16;
Reserved_17_27 at 0 range 17 .. 27;
PCPOL at 0 range 28 .. 28;
DEPOL at 0 range 29 .. 29;
VSPOL at 0 range 30 .. 30;
HSPOL at 0 range 31 .. 31;
end record;
-- Shadow Reload Configuration Register
type SRCR_Register is record
-- Immediate Reload
IMR : Boolean := False;
-- Vertical Blanking Reload
VBR : Boolean := False;
-- unspecified
Reserved_2_31 : STM32_SVD.UInt30 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SRCR_Register use record
IMR at 0 range 0 .. 0;
VBR at 0 range 1 .. 1;
Reserved_2_31 at 0 range 2 .. 31;
end record;
subtype BCCR_BCBLUE_Field is STM32_SVD.Byte;
subtype BCCR_BCGREEN_Field is STM32_SVD.Byte;
subtype BCCR_BCRED_Field is STM32_SVD.Byte;
-- Background Color Configuration Register
type BCCR_Register is record
-- Background Color Blue value
BCBLUE : BCCR_BCBLUE_Field := 16#0#;
-- Background Color Green value
BCGREEN : BCCR_BCGREEN_Field := 16#0#;
-- Background Color Red value
BCRED : BCCR_BCRED_Field := 16#0#;
-- unspecified
Reserved_24_31 : STM32_SVD.Byte := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for BCCR_Register use record
BCBLUE at 0 range 0 .. 7;
BCGREEN at 0 range 8 .. 15;
BCRED at 0 range 16 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
-- Interrupt Enable Register
type IER_Register is record
-- Line Interrupt Enable
LIE : Boolean := False;
-- FIFO Underrun Interrupt Enable
FUIE : Boolean := False;
-- Transfer Error Interrupt Enable
TERRIE : Boolean := False;
-- Register Reload interrupt enable
RRIE : Boolean := False;
-- unspecified
Reserved_4_31 : STM32_SVD.UInt28 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for IER_Register use record
LIE at 0 range 0 .. 0;
FUIE at 0 range 1 .. 1;
TERRIE at 0 range 2 .. 2;
RRIE at 0 range 3 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
-- Interrupt Status Register
type ISR_Register is record
-- Read-only. Line Interrupt flag
LIF : Boolean;
-- Read-only. FIFO Underrun Interrupt flag
FUIF : Boolean;
-- Read-only. Transfer Error interrupt flag
TERRIF : Boolean;
-- Read-only. Register Reload Interrupt Flag
RRIF : Boolean;
-- unspecified
Reserved_4_31 : STM32_SVD.UInt28;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ISR_Register use record
LIF at 0 range 0 .. 0;
FUIF at 0 range 1 .. 1;
TERRIF at 0 range 2 .. 2;
RRIF at 0 range 3 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
-- Interrupt Clear Register
type ICR_Register is record
-- Write-only. Clears the Line Interrupt Flag
CLIF : Boolean := False;
-- Write-only. Clears the FIFO Underrun Interrupt flag
CFUIF : Boolean := False;
-- Write-only. Clears the Transfer Error Interrupt Flag
CTERRIF : Boolean := False;
-- Write-only. Clears Register Reload Interrupt Flag
CRRIF : Boolean := False;
-- unspecified
Reserved_4_31 : STM32_SVD.UInt28 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ICR_Register use record
CLIF at 0 range 0 .. 0;
CFUIF at 0 range 1 .. 1;
CTERRIF at 0 range 2 .. 2;
CRRIF at 0 range 3 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
subtype LIPCR_LIPOS_Field is STM32_SVD.UInt11;
-- Line Interrupt Position Configuration Register
type LIPCR_Register is record
-- Line Interrupt Position
LIPOS : LIPCR_LIPOS_Field := 16#0#;
-- unspecified
Reserved_11_31 : STM32_SVD.UInt21 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for LIPCR_Register use record
LIPOS at 0 range 0 .. 10;
Reserved_11_31 at 0 range 11 .. 31;
end record;
subtype CPSR_CYPOS_Field is STM32_SVD.UInt16;
subtype CPSR_CXPOS_Field is STM32_SVD.UInt16;
-- Current Position Status Register
type CPSR_Register is record
-- Read-only. Current Y Position
CYPOS : CPSR_CYPOS_Field;
-- Read-only. Current X Position
CXPOS : CPSR_CXPOS_Field;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CPSR_Register use record
CYPOS at 0 range 0 .. 15;
CXPOS at 0 range 16 .. 31;
end record;
-- Current Display Status Register
type CDSR_Register is record
-- Read-only. Vertical Data Enable display Status
VDES : Boolean;
-- Read-only. Horizontal Data Enable display Status
HDES : Boolean;
-- Read-only. Vertical Synchronization display Status
VSYNCS : Boolean;
-- Read-only. Horizontal Synchronization display Status
HSYNCS : Boolean;
-- unspecified
Reserved_4_31 : STM32_SVD.UInt28;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CDSR_Register use record
VDES at 0 range 0 .. 0;
HDES at 0 range 1 .. 1;
VSYNCS at 0 range 2 .. 2;
HSYNCS at 0 range 3 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
-- Layerx Control Register
type L1CR_Register is record
-- Layer Enable
LEN : Boolean := False;
-- Color Keying Enable
COLKEN : Boolean := False;
-- unspecified
Reserved_2_3 : STM32_SVD.UInt2 := 16#0#;
-- Color Look-Up Table Enable
CLUTEN : Boolean := False;
-- unspecified
Reserved_5_31 : STM32_SVD.UInt27 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for L1CR_Register use record
LEN at 0 range 0 .. 0;
COLKEN at 0 range 1 .. 1;
Reserved_2_3 at 0 range 2 .. 3;
CLUTEN at 0 range 4 .. 4;
Reserved_5_31 at 0 range 5 .. 31;
end record;
subtype L1WHPCR_WHSTPOS_Field is STM32_SVD.UInt12;
subtype L1WHPCR_WHSPPOS_Field is STM32_SVD.UInt12;
-- Layerx Window Horizontal Position Configuration Register
type L1WHPCR_Register is record
-- Window Horizontal Start Position
WHSTPOS : L1WHPCR_WHSTPOS_Field := 16#0#;
-- unspecified
Reserved_12_15 : STM32_SVD.UInt4 := 16#0#;
-- Window Horizontal Stop Position
WHSPPOS : L1WHPCR_WHSPPOS_Field := 16#0#;
-- unspecified
Reserved_28_31 : STM32_SVD.UInt4 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for L1WHPCR_Register use record
WHSTPOS at 0 range 0 .. 11;
Reserved_12_15 at 0 range 12 .. 15;
WHSPPOS at 0 range 16 .. 27;
Reserved_28_31 at 0 range 28 .. 31;
end record;
subtype L1WVPCR_WVSTPOS_Field is STM32_SVD.UInt11;
subtype L1WVPCR_WVSPPOS_Field is STM32_SVD.UInt11;
-- Layerx Window Vertical Position Configuration Register
type L1WVPCR_Register is record
-- Window Vertical Start Position
WVSTPOS : L1WVPCR_WVSTPOS_Field := 16#0#;
-- unspecified
Reserved_11_15 : STM32_SVD.UInt5 := 16#0#;
-- Window Vertical Stop Position
WVSPPOS : L1WVPCR_WVSPPOS_Field := 16#0#;
-- unspecified
Reserved_27_31 : STM32_SVD.UInt5 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for L1WVPCR_Register use record
WVSTPOS at 0 range 0 .. 10;
Reserved_11_15 at 0 range 11 .. 15;
WVSPPOS at 0 range 16 .. 26;
Reserved_27_31 at 0 range 27 .. 31;
end record;
subtype L1CKCR_CKBLUE_Field is STM32_SVD.Byte;
subtype L1CKCR_CKGREEN_Field is STM32_SVD.Byte;
subtype L1CKCR_CKRED_Field is STM32_SVD.Byte;
-- Layerx Color Keying Configuration Register
type L1CKCR_Register is record
-- Color Key Blue value
CKBLUE : L1CKCR_CKBLUE_Field := 16#0#;
-- Color Key Green value
CKGREEN : L1CKCR_CKGREEN_Field := 16#0#;
-- Color Key Red value
CKRED : L1CKCR_CKRED_Field := 16#0#;
-- unspecified
Reserved_24_31 : STM32_SVD.Byte := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for L1CKCR_Register use record
CKBLUE at 0 range 0 .. 7;
CKGREEN at 0 range 8 .. 15;
CKRED at 0 range 16 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
subtype L1PFCR_PF_Field is STM32_SVD.UInt3;
-- Layerx Pixel Format Configuration Register
type L1PFCR_Register is record
-- Pixel Format
PF : L1PFCR_PF_Field := 16#0#;
-- unspecified
Reserved_3_31 : STM32_SVD.UInt29 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for L1PFCR_Register use record
PF at 0 range 0 .. 2;
Reserved_3_31 at 0 range 3 .. 31;
end record;
subtype L1CACR_CONSTA_Field is STM32_SVD.Byte;
-- Layerx Constant Alpha Configuration Register
type L1CACR_Register is record
-- Constant Alpha
CONSTA : L1CACR_CONSTA_Field := 16#0#;
-- unspecified
Reserved_8_31 : STM32_SVD.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for L1CACR_Register use record
CONSTA at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype L1DCCR_DCBLUE_Field is STM32_SVD.Byte;
subtype L1DCCR_DCGREEN_Field is STM32_SVD.Byte;
subtype L1DCCR_DCRED_Field is STM32_SVD.Byte;
subtype L1DCCR_DCALPHA_Field is STM32_SVD.Byte;
-- Layerx Default Color Configuration Register
type L1DCCR_Register is record
-- Default Color Blue
DCBLUE : L1DCCR_DCBLUE_Field := 16#0#;
-- Default Color Green
DCGREEN : L1DCCR_DCGREEN_Field := 16#0#;
-- Default Color Red
DCRED : L1DCCR_DCRED_Field := 16#0#;
-- Default Color Alpha
DCALPHA : L1DCCR_DCALPHA_Field := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for L1DCCR_Register use record
DCBLUE at 0 range 0 .. 7;
DCGREEN at 0 range 8 .. 15;
DCRED at 0 range 16 .. 23;
DCALPHA at 0 range 24 .. 31;
end record;
subtype L1BFCR_BF2_Field is STM32_SVD.UInt3;
subtype L1BFCR_BF1_Field is STM32_SVD.UInt3;
-- Layerx Blending Factors Configuration Register
type L1BFCR_Register is record
-- Blending Factor 2
BF2 : L1BFCR_BF2_Field := 16#7#;
-- unspecified
Reserved_3_7 : STM32_SVD.UInt5 := 16#0#;
-- Blending Factor 1
BF1 : L1BFCR_BF1_Field := 16#6#;
-- unspecified
Reserved_11_31 : STM32_SVD.UInt21 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for L1BFCR_Register use record
BF2 at 0 range 0 .. 2;
Reserved_3_7 at 0 range 3 .. 7;
BF1 at 0 range 8 .. 10;
Reserved_11_31 at 0 range 11 .. 31;
end record;
subtype L1CFBLR_CFBLL_Field is STM32_SVD.UInt13;
subtype L1CFBLR_CFBP_Field is STM32_SVD.UInt13;
-- Layerx Color Frame Buffer Length Register
type L1CFBLR_Register is record
-- Color Frame Buffer Line Length
CFBLL : L1CFBLR_CFBLL_Field := 16#0#;
-- unspecified
Reserved_13_15 : STM32_SVD.UInt3 := 16#0#;
-- Color Frame Buffer Pitch in bytes
CFBP : L1CFBLR_CFBP_Field := 16#0#;
-- unspecified
Reserved_29_31 : STM32_SVD.UInt3 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for L1CFBLR_Register use record
CFBLL at 0 range 0 .. 12;
Reserved_13_15 at 0 range 13 .. 15;
CFBP at 0 range 16 .. 28;
Reserved_29_31 at 0 range 29 .. 31;
end record;
subtype L1CFBLNR_CFBLNBR_Field is STM32_SVD.UInt11;
-- Layerx ColorFrame Buffer Line Number Register
type L1CFBLNR_Register is record
-- Frame Buffer Line Number
CFBLNBR : L1CFBLNR_CFBLNBR_Field := 16#0#;
-- unspecified
Reserved_11_31 : STM32_SVD.UInt21 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for L1CFBLNR_Register use record
CFBLNBR at 0 range 0 .. 10;
Reserved_11_31 at 0 range 11 .. 31;
end record;
subtype L1CLUTWR_BLUE_Field is STM32_SVD.Byte;
subtype L1CLUTWR_GREEN_Field is STM32_SVD.Byte;
subtype L1CLUTWR_RED_Field is STM32_SVD.Byte;
subtype L1CLUTWR_CLUTADD_Field is STM32_SVD.Byte;
-- Layerx CLUT Write Register
type L1CLUTWR_Register is record
-- Write-only. Blue value
BLUE : L1CLUTWR_BLUE_Field := 16#0#;
-- Write-only. Green value
GREEN : L1CLUTWR_GREEN_Field := 16#0#;
-- Write-only. Red value
RED : L1CLUTWR_RED_Field := 16#0#;
-- Write-only. CLUT Address
CLUTADD : L1CLUTWR_CLUTADD_Field := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for L1CLUTWR_Register use record
BLUE at 0 range 0 .. 7;
GREEN at 0 range 8 .. 15;
RED at 0 range 16 .. 23;
CLUTADD at 0 range 24 .. 31;
end record;
-- Layerx Control Register
type L2CR_Register is record
-- Layer Enable
LEN : Boolean := False;
-- Color Keying Enable
COLKEN : Boolean := False;
-- unspecified
Reserved_2_3 : STM32_SVD.UInt2 := 16#0#;
-- Color Look-Up Table Enable
CLUTEN : Boolean := False;
-- unspecified
Reserved_5_31 : STM32_SVD.UInt27 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for L2CR_Register use record
LEN at 0 range 0 .. 0;
COLKEN at 0 range 1 .. 1;
Reserved_2_3 at 0 range 2 .. 3;
CLUTEN at 0 range 4 .. 4;
Reserved_5_31 at 0 range 5 .. 31;
end record;
subtype L2WHPCR_WHSTPOS_Field is STM32_SVD.UInt12;
subtype L2WHPCR_WHSPPOS_Field is STM32_SVD.UInt12;
-- Layerx Window Horizontal Position Configuration Register
type L2WHPCR_Register is record
-- Window Horizontal Start Position
WHSTPOS : L2WHPCR_WHSTPOS_Field := 16#0#;
-- unspecified
Reserved_12_15 : STM32_SVD.UInt4 := 16#0#;
-- Window Horizontal Stop Position
WHSPPOS : L2WHPCR_WHSPPOS_Field := 16#0#;
-- unspecified
Reserved_28_31 : STM32_SVD.UInt4 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for L2WHPCR_Register use record
WHSTPOS at 0 range 0 .. 11;
Reserved_12_15 at 0 range 12 .. 15;
WHSPPOS at 0 range 16 .. 27;
Reserved_28_31 at 0 range 28 .. 31;
end record;
subtype L2WVPCR_WVSTPOS_Field is STM32_SVD.UInt11;
subtype L2WVPCR_WVSPPOS_Field is STM32_SVD.UInt11;
-- Layerx Window Vertical Position Configuration Register
type L2WVPCR_Register is record
-- Window Vertical Start Position
WVSTPOS : L2WVPCR_WVSTPOS_Field := 16#0#;
-- unspecified
Reserved_11_15 : STM32_SVD.UInt5 := 16#0#;
-- Window Vertical Stop Position
WVSPPOS : L2WVPCR_WVSPPOS_Field := 16#0#;
-- unspecified
Reserved_27_31 : STM32_SVD.UInt5 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for L2WVPCR_Register use record
WVSTPOS at 0 range 0 .. 10;
Reserved_11_15 at 0 range 11 .. 15;
WVSPPOS at 0 range 16 .. 26;
Reserved_27_31 at 0 range 27 .. 31;
end record;
subtype L2CKCR_CKBLUE_Field is STM32_SVD.Byte;
subtype L2CKCR_CKGREEN_Field is STM32_SVD.Byte;
subtype L2CKCR_CKRED_Field is STM32_SVD.Byte;
-- Layerx Color Keying Configuration Register
type L2CKCR_Register is record
-- Color Key Blue value
CKBLUE : L2CKCR_CKBLUE_Field := 16#0#;
-- Color Key Green value
CKGREEN : L2CKCR_CKGREEN_Field := 16#0#;
-- Color Key Red value
CKRED : L2CKCR_CKRED_Field := 16#0#;
-- unspecified
Reserved_24_31 : STM32_SVD.Byte := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for L2CKCR_Register use record
CKBLUE at 0 range 0 .. 7;
CKGREEN at 0 range 8 .. 15;
CKRED at 0 range 16 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
subtype L2PFCR_PF_Field is STM32_SVD.UInt3;
-- Layerx Pixel Format Configuration Register
type L2PFCR_Register is record
-- Pixel Format
PF : L2PFCR_PF_Field := 16#0#;
-- unspecified
Reserved_3_31 : STM32_SVD.UInt29 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for L2PFCR_Register use record
PF at 0 range 0 .. 2;
Reserved_3_31 at 0 range 3 .. 31;
end record;
subtype L2CACR_CONSTA_Field is STM32_SVD.Byte;
-- Layerx Constant Alpha Configuration Register
type L2CACR_Register is record
-- Constant Alpha
CONSTA : L2CACR_CONSTA_Field := 16#0#;
-- unspecified
Reserved_8_31 : STM32_SVD.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for L2CACR_Register use record
CONSTA at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype L2DCCR_DCBLUE_Field is STM32_SVD.Byte;
subtype L2DCCR_DCGREEN_Field is STM32_SVD.Byte;
subtype L2DCCR_DCRED_Field is STM32_SVD.Byte;
subtype L2DCCR_DCALPHA_Field is STM32_SVD.Byte;
-- Layerx Default Color Configuration Register
type L2DCCR_Register is record
-- Default Color Blue
DCBLUE : L2DCCR_DCBLUE_Field := 16#0#;
-- Default Color Green
DCGREEN : L2DCCR_DCGREEN_Field := 16#0#;
-- Default Color Red
DCRED : L2DCCR_DCRED_Field := 16#0#;
-- Default Color Alpha
DCALPHA : L2DCCR_DCALPHA_Field := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for L2DCCR_Register use record
DCBLUE at 0 range 0 .. 7;
DCGREEN at 0 range 8 .. 15;
DCRED at 0 range 16 .. 23;
DCALPHA at 0 range 24 .. 31;
end record;
subtype L2BFCR_BF2_Field is STM32_SVD.UInt3;
subtype L2BFCR_BF1_Field is STM32_SVD.UInt3;
-- Layerx Blending Factors Configuration Register
type L2BFCR_Register is record
-- Blending Factor 2
BF2 : L2BFCR_BF2_Field := 16#7#;
-- unspecified
Reserved_3_7 : STM32_SVD.UInt5 := 16#0#;
-- Blending Factor 1
BF1 : L2BFCR_BF1_Field := 16#6#;
-- unspecified
Reserved_11_31 : STM32_SVD.UInt21 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for L2BFCR_Register use record
BF2 at 0 range 0 .. 2;
Reserved_3_7 at 0 range 3 .. 7;
BF1 at 0 range 8 .. 10;
Reserved_11_31 at 0 range 11 .. 31;
end record;
subtype L2CFBLR_CFBLL_Field is STM32_SVD.UInt13;
subtype L2CFBLR_CFBP_Field is STM32_SVD.UInt13;
-- Layerx Color Frame Buffer Length Register
type L2CFBLR_Register is record
-- Color Frame Buffer Line Length
CFBLL : L2CFBLR_CFBLL_Field := 16#0#;
-- unspecified
Reserved_13_15 : STM32_SVD.UInt3 := 16#0#;
-- Color Frame Buffer Pitch in bytes
CFBP : L2CFBLR_CFBP_Field := 16#0#;
-- unspecified
Reserved_29_31 : STM32_SVD.UInt3 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for L2CFBLR_Register use record
CFBLL at 0 range 0 .. 12;
Reserved_13_15 at 0 range 13 .. 15;
CFBP at 0 range 16 .. 28;
Reserved_29_31 at 0 range 29 .. 31;
end record;
subtype L2CFBLNR_CFBLNBR_Field is STM32_SVD.UInt11;
-- Layerx ColorFrame Buffer Line Number Register
type L2CFBLNR_Register is record
-- Frame Buffer Line Number
CFBLNBR : L2CFBLNR_CFBLNBR_Field := 16#0#;
-- unspecified
Reserved_11_31 : STM32_SVD.UInt21 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for L2CFBLNR_Register use record
CFBLNBR at 0 range 0 .. 10;
Reserved_11_31 at 0 range 11 .. 31;
end record;
subtype L2CLUTWR_BLUE_Field is STM32_SVD.Byte;
subtype L2CLUTWR_GREEN_Field is STM32_SVD.Byte;
subtype L2CLUTWR_RED_Field is STM32_SVD.Byte;
subtype L2CLUTWR_CLUTADD_Field is STM32_SVD.Byte;
-- Layerx CLUT Write Register
type L2CLUTWR_Register is record
-- Write-only. Blue value
BLUE : L2CLUTWR_BLUE_Field := 16#0#;
-- Write-only. Green value
GREEN : L2CLUTWR_GREEN_Field := 16#0#;
-- Write-only. Red value
RED : L2CLUTWR_RED_Field := 16#0#;
-- Write-only. CLUT Address
CLUTADD : L2CLUTWR_CLUTADD_Field := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for L2CLUTWR_Register use record
BLUE at 0 range 0 .. 7;
GREEN at 0 range 8 .. 15;
RED at 0 range 16 .. 23;
CLUTADD at 0 range 24 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- LCD-TFT Controller
type LTDC_Peripheral is record
-- Synchronization Size Configuration Register
SSCR : aliased SSCR_Register;
-- Back Porch Configuration Register
BPCR : aliased BPCR_Register;
-- Active Width Configuration Register
AWCR : aliased AWCR_Register;
-- Total Width Configuration Register
TWCR : aliased TWCR_Register;
-- Global Control Register
GCR : aliased GCR_Register;
-- Shadow Reload Configuration Register
SRCR : aliased SRCR_Register;
-- Background Color Configuration Register
BCCR : aliased BCCR_Register;
-- Interrupt Enable Register
IER : aliased IER_Register;
-- Interrupt Status Register
ISR : aliased ISR_Register;
-- Interrupt Clear Register
ICR : aliased ICR_Register;
-- Line Interrupt Position Configuration Register
LIPCR : aliased LIPCR_Register;
-- Current Position Status Register
CPSR : aliased CPSR_Register;
-- Current Display Status Register
CDSR : aliased CDSR_Register;
-- Layerx Control Register
L1CR : aliased L1CR_Register;
-- Layerx Window Horizontal Position Configuration Register
L1WHPCR : aliased L1WHPCR_Register;
-- Layerx Window Vertical Position Configuration Register
L1WVPCR : aliased L1WVPCR_Register;
-- Layerx Color Keying Configuration Register
L1CKCR : aliased L1CKCR_Register;
-- Layerx Pixel Format Configuration Register
L1PFCR : aliased L1PFCR_Register;
-- Layerx Constant Alpha Configuration Register
L1CACR : aliased L1CACR_Register;
-- Layerx Default Color Configuration Register
L1DCCR : aliased L1DCCR_Register;
-- Layerx Blending Factors Configuration Register
L1BFCR : aliased L1BFCR_Register;
-- Layerx Color Frame Buffer Address Register
L1CFBAR : aliased STM32_SVD.UInt32;
-- Layerx Color Frame Buffer Length Register
L1CFBLR : aliased L1CFBLR_Register;
-- Layerx ColorFrame Buffer Line Number Register
L1CFBLNR : aliased L1CFBLNR_Register;
-- Layerx CLUT Write Register
L1CLUTWR : aliased L1CLUTWR_Register;
-- Layerx Control Register
L2CR : aliased L2CR_Register;
-- Layerx Window Horizontal Position Configuration Register
L2WHPCR : aliased L2WHPCR_Register;
-- Layerx Window Vertical Position Configuration Register
L2WVPCR : aliased L2WVPCR_Register;
-- Layerx Color Keying Configuration Register
L2CKCR : aliased L2CKCR_Register;
-- Layerx Pixel Format Configuration Register
L2PFCR : aliased L2PFCR_Register;
-- Layerx Constant Alpha Configuration Register
L2CACR : aliased L2CACR_Register;
-- Layerx Default Color Configuration Register
L2DCCR : aliased L2DCCR_Register;
-- Layerx Blending Factors Configuration Register
L2BFCR : aliased L2BFCR_Register;
-- Layerx Color Frame Buffer Address Register
L2CFBAR : aliased STM32_SVD.UInt32;
-- Layerx Color Frame Buffer Length Register
L2CFBLR : aliased L2CFBLR_Register;
-- Layerx ColorFrame Buffer Line Number Register
L2CFBLNR : aliased L2CFBLNR_Register;
-- Layerx CLUT Write Register
L2CLUTWR : aliased L2CLUTWR_Register;
end record
with Volatile;
for LTDC_Peripheral use record
SSCR at 16#8# range 0 .. 31;
BPCR at 16#C# range 0 .. 31;
AWCR at 16#10# range 0 .. 31;
TWCR at 16#14# range 0 .. 31;
GCR at 16#18# range 0 .. 31;
SRCR at 16#24# range 0 .. 31;
BCCR at 16#2C# range 0 .. 31;
IER at 16#34# range 0 .. 31;
ISR at 16#38# range 0 .. 31;
ICR at 16#3C# range 0 .. 31;
LIPCR at 16#40# range 0 .. 31;
CPSR at 16#44# range 0 .. 31;
CDSR at 16#48# range 0 .. 31;
L1CR at 16#84# range 0 .. 31;
L1WHPCR at 16#88# range 0 .. 31;
L1WVPCR at 16#8C# range 0 .. 31;
L1CKCR at 16#90# range 0 .. 31;
L1PFCR at 16#94# range 0 .. 31;
L1CACR at 16#98# range 0 .. 31;
L1DCCR at 16#9C# range 0 .. 31;
L1BFCR at 16#A0# range 0 .. 31;
L1CFBAR at 16#AC# range 0 .. 31;
L1CFBLR at 16#B0# range 0 .. 31;
L1CFBLNR at 16#B4# range 0 .. 31;
L1CLUTWR at 16#C4# range 0 .. 31;
L2CR at 16#104# range 0 .. 31;
L2WHPCR at 16#108# range 0 .. 31;
L2WVPCR at 16#10C# range 0 .. 31;
L2CKCR at 16#110# range 0 .. 31;
L2PFCR at 16#114# range 0 .. 31;
L2CACR at 16#118# range 0 .. 31;
L2DCCR at 16#11C# range 0 .. 31;
L2BFCR at 16#120# range 0 .. 31;
L2CFBAR at 16#12C# range 0 .. 31;
L2CFBLR at 16#130# range 0 .. 31;
L2CFBLNR at 16#134# range 0 .. 31;
L2CLUTWR at 16#144# range 0 .. 31;
end record;
-- LCD-TFT Controller
LTDC_Periph : aliased LTDC_Peripheral
with Import, Address => LTDC_Base;
end STM32_SVD.LTDC;
|
reznikmm/matreshka | Ada | 3,593 | adb | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Examples Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <[email protected]> --
-- 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 AWF.Application;
with Demo.Main_Windows;
procedure Main is
W : Demo.Main_Windows.Main_Window_Access;
begin
AWF.Application.Initialize;
W := Demo.Main_Windows.Create;
AWF.Application.Execute;
AWF.Application.Finalize;
end Main;
|
francesco-bongiovanni/ewok-kernel | Ada | 7,525 | ads | --
-- Copyright 2018 The wookey project team <[email protected]>
-- - Ryad Benadjila
-- - Arnauld Michelizza
-- - Mathieu Renard
-- - Philippe Thierry
-- - Philippe Trebuchet
--
-- 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 ewok.tasks_shared; use ewok.tasks_shared;
with ewok.devices_shared;
with ewok.ipc;
with ewok.exported.dma;
with ewok.dma_shared;
package ewok.tasks
with spark_mode => off
is
subtype t_task_name is string (1 .. 8);
type t_task_state is (
-- No task in this slot
TASK_STATE_EMPTY,
-- Task can be elected by the scheduler with its standard priority
-- or an ISR is ready for execution
TASK_STATE_RUNNABLE,
-- Force the scheduler to choose that task
TASK_STATE_FORCED,
-- Pending syscall. Task can't be scheduled.
TASK_STATE_SVC_BLOCKED,
-- An ISR is finished
TASK_STATE_ISR_DONE,
-- Task currently has nothing to do, not schedulable
TASK_STATE_IDLE,
-- Task is sleeping
TASK_STATE_SLEEPING,
-- Task has generated an exception (memory fault, etc.), not
-- schedulable anymore
TASK_STATE_FAULT,
-- Task has return from its main() function. Yet its ISR handlers can
-- still be executed if needed
TASK_STATE_FINISHED,
-- Task has emitted a blocking send(target) and is waiting for that
-- the EndPoint shared with the receiver gets ready
TASK_STATE_IPC_SEND_BLOCKED,
-- Task has emitted a blocking recv(target) and is waiting for a
-- send()
TASK_STATE_IPC_RECV_BLOCKED,
-- Task has emitted a blocking send(target) and is waiting recv()
-- acknowledgement from the target task
TASK_STATE_IPC_WAIT_ACK,
-- Task has entered in a critical section. Related ISRs can't be executed
TASK_STATE_LOCKED);
type t_task_type is
(-- Kernel task
TASK_TYPE_KERNEL,
-- User task, being executed in user mode, with restricted access
TASK_TYPE_USER);
type t_main_context is record
frame_a : ewok.t_stack_frame_access;
end record;
type t_isr_context is record
entry_point : system_address;
device_id : ewok.devices_shared.t_device_id;
sched_policy : ewok.tasks_shared.t_scheduling_post_isr;
frame_a : ewok.t_stack_frame_access;
end record;
--
-- Tasks
--
MAX_DEVS_PER_TASK : constant := 4;
MAX_DMAS_PER_TASK : constant := 8;
MAX_INTERRUPTS_PER_TASK : constant := 8;
MAX_DMA_SHM_PER_TASK : constant := 4;
type t_registered_dma_index_list is array (unsigned_32 range <>) of
ewok.dma_shared.t_user_dma_index;
type t_dma_shm_info_list is array (unsigned_32 range <>) of
ewok.exported.dma.t_dma_shm_info;
type t_device_id_list is array (unsigned_8 range <>) of
ewok.devices_shared.t_device_id;
type t_task is record
name : t_task_name;
entry_point : system_address;
ttype : t_task_type;
mode : t_task_mode;
id : ewok.tasks_shared.t_task_id;
slot : unsigned_8; -- 1: first slot (0: unused)
num_slots : unsigned_8;
prio : unsigned_8;
#if CONFIG_KERNEL_DOMAIN
domain : unsigned_8;
#end if;
#if CONFIG_KERNEL_SCHED_DEBUG
count : unsigned_32;
force_count : unsigned_32;
isr_count : unsigned_32;
#end if;
#if CONFIG_KERNEL_DMA_ENABLE
num_dma_shms : unsigned_32 range 0 .. MAX_DMA_SHM_PER_TASK;
dma_shm : t_dma_shm_info_list (1 .. MAX_DMA_SHM_PER_TASK);
num_dma_id : unsigned_32 range 0 .. MAX_DMAS_PER_TASK;
dma_id : t_registered_dma_index_list (1 .. MAX_DMAS_PER_TASK);
#end if;
num_devs : unsigned_8 range 0 .. MAX_DEVS_PER_TASK;
num_devs_mmapped : unsigned_8;
device_id : t_device_id_list (1 .. MAX_DEVS_PER_TASK);
init_done : boolean;
data_slot_start : system_address;
data_slot_end : system_address;
txt_slot_start : system_address;
txt_slot_end : system_address;
stack_size : unsigned_16;
state : t_task_state;
isr_state : t_task_state;
ipc_endpoints : ewok.ipc.t_endpoints (ewok.tasks_shared.t_task_id'range);
ctx : aliased t_main_context;
isr_ctx : aliased t_isr_context;
end record;
type t_task_access is access all t_task;
type t_task_array is array (t_task_id range <>) of aliased t_task;
-------------
-- Globals --
-------------
-- The list of the running tasks
tasks_list : t_task_array (ID_APP1 .. ID_KERNEL);
softirq_task_name : aliased t_task_name := "SOFTIRQ" & " ";
idle_task_name : aliased t_task_name := "IDLE" & " ";
---------------
-- Functions --
---------------
procedure idle_task with no_return;
procedure finished_task with no_return;
procedure create_stack
(sp : in system_address;
pc : in system_address;
params : in ewok.t_parameters;
frame_a : out ewok.t_stack_frame_access);
-- Note: see ewok.tasks.interfaces
procedure set_default_values (tsk : out t_task);
procedure init_softirq_task;
procedure init_idle_task;
procedure init_apps;
function is_user (id : ewok.tasks_shared.t_task_id) return boolean;
function get_task (id : ewok.tasks_shared.t_task_id)
return t_task_access;
#if CONFIG_KERNEL_DOMAIN
function get_domain (id : in ewok.tasks_shared.t_task_id)
return unsigned_8
with inline;
#end if;
function get_task_id (name : t_task_name)
return ewok.tasks_shared.t_task_id;
-- FIXME - transitions between states
procedure set_state
(id : ewok.tasks_shared.t_task_id;
mode : t_task_mode;
state : t_task_state)
with inline;
function get_state
(id : ewok.tasks_shared.t_task_id;
mode : t_task_mode)
return t_task_state
with inline;
function get_mode
(id : in ewok.tasks_shared.t_task_id)
return t_task_mode
with
inline,
global => null;
procedure set_mode
(id : in ewok.tasks_shared.t_task_id;
mode : in ewok.tasks_shared.t_task_mode)
with
inline,
global => ( In_Out => tasks_list );
-- Set return value inside a syscall
-- Note: mode must be defined as a task can do a syscall while in ISR mode
-- or in THREAD mode
procedure set_return_value
(id : in ewok.tasks_shared.t_task_id;
mode : in t_task_mode;
val : in unsigned_32);
procedure task_init
with
convention => c,
export => true,
external_name => "task_init",
global => null;
function is_init_done
(id : ewok.tasks_shared.t_task_id)
return boolean;
end ewok.tasks;
|
charlie5/aShell | Ada | 23,864 | adb | with
POSIX.Signals,
POSIX.Process_Primitives.Extensions,
POSIX.Event_Management,
Gnat.OS_Lib,
Ada.Characters.Handling,
Ada.Strings.Fixed,
Ada.Exceptions,
Ada.IO_Exceptions,
Ada.Unchecked_Conversion;
with Ada.Text_IO;
-- use Ada.Text_IO;
package body Shell
is
--- Strings
--
function "+" (Item : in String) return Unbounded_String
is
begin
return To_Unbounded_String (Item);
end "+";
function "+" (Item : in Unbounded_String) return String
is
begin
return To_String (Item);
end "+";
--- Data
--
function To_String (From : in Data) return String
is
subtype My_Data is Data (From'Range);
subtype My_String is String (1 .. From'Length);
function Convert is new Ada.Unchecked_Conversion (My_Data, My_String);
begin
return Convert (From);
end To_String;
function To_Data (From : in String) return Data
is
subtype My_String is String (From'Range);
subtype My_Data is Data (0 .. From'Length - 1);
function Convert is new Ada.Unchecked_Conversion (My_String, My_Data);
begin
return Convert (From);
end To_Data;
--- Pipes
--
protected body Safe_Pipes
is
procedure Open (Pipe : out Shell.Pipe)
is
use POSIX.IO;
begin
Create_Pipe (Read_End => Pipe.Read_End,
Write_End => Pipe.Write_End);
exception
when POSIX.POSIX_Error =>
raise Too_Many_Pipes_Error;
end Open;
procedure Close (Pipe : in Shell.Pipe;
Only_Write_End : in Boolean := False;
Only_Read_End : in Boolean := False)
is
use POSIX.IO;
begin
if not Only_Write_End
and then Pipe.Read_End /= Null_File_Descriptor
and then Is_Open (Pipe.Read_End)
then
Close (File => Pipe.Read_End);
end if;
if not Only_Read_End
and then Pipe.Write_End /= Null_File_Descriptor
and then Is_Open (Pipe.Write_End)
then
Close (File => Pipe.Write_End);
end if;
end Close;
end Safe_Pipes;
function To_Pipe (Blocking : in Boolean := True) return Pipe
is
use POSIX.IO;
The_Pipe : Pipe;
begin
Safe_Pipes.Open (The_Pipe);
if not Blocking
then
Set_File_Control (The_Pipe.Read_End,
Non_Blocking);
end if;
return The_Pipe;
end To_Pipe;
procedure Check_Not_Null (Pipe : in Shell.Pipe)
is
begin
if Pipe = Null_Pipe
then
raise Null_Pipe_Error;
end if;
end Check_Not_Null;
procedure Close (Pipe : in Shell.Pipe;
Only_Write_End : in Boolean := False;
Only_Read_End : in Boolean := False)
is
use POSIX.IO;
begin
Check_Not_Null (Pipe);
if Only_Write_End
and Only_Read_End
then
raise Pipe_Error with "When closing a pipe, the 'Only_Write_End' and 'Only_Read_End' options are mutually exclusive.";
end if;
if Pipe /= Standard_Input
and Pipe /= Standard_Output
and Pipe /= Standard_Error
then
Safe_Pipes.Close (Pipe, Only_Write_End, Only_Read_End); -- TODO: Should 'write end' and 'read end' be set to Null_File_Descriptor when closed ?
end if;
end Close;
function Image (Pipe : in Shell.Pipe) return String
is
begin
if Pipe = Null_Pipe
then
return "Null_Pipe";
end if;
if Pipe = Standard_Input
then
return "Standard_Input";
end if;
if Pipe = Standard_Output
then
return "Standard_Output";
end if;
if Pipe = Standard_Error
then
return "Standard_Error";
end if;
return "(Write_End =>"
& Pipe.Write_End'Image
& ", Read_End =>"
& Pipe.Read_End'Image
& ")";
end Image;
function Is_Readable (Pipe : in Shell.Pipe) return Boolean
is
use POSIX.IO;
begin
Check_Not_Null (Pipe);
return Is_Open (Pipe.Read_End);
end Is_Readable;
function Is_Writeable (Pipe : in Shell.Pipe) return Boolean
is
use POSIX.IO;
begin
Check_Not_Null (Pipe);
return Is_Open (Pipe.Write_End);
end Is_Writeable;
function Is_Empty (Pipe : in Shell.Pipe;
Timeout : in Duration := 0.0) return Boolean
is
use POSIX.Event_Management,
POSIX.IO;
FDS_R : File_Descriptor_Set;
FDS_W : File_Descriptor_Set;
FDS_E : File_Descriptor_Set;
Count : Natural;
begin
Check_Not_Null (Pipe);
Make_Empty (FDS_R);
Make_Empty (FDS_W);
Make_Empty (FDS_E);
add (FDS_R, Pipe.Read_End);
Select_File (Read_Files => FDS_R,
Write_Files => FDS_W,
Except_Files => FDS_E,
Files_Selected => Count,
Timeout => Timeout);
return Count = 0;
end Is_Empty;
function Output_Of (Pipe : in Shell.Pipe) return Data
is
use POSIX.IO;
Max_Process_Output : constant := 200 * 1024;
Buffer : Data (1 .. Max_Process_Output);
Last : Stream_Element_Offset := 0;
begin
if not Is_Readable (Pipe)
then
log ("In Output_Of: pipe not readable " & Image (Pipe));
return No_Data;
end if;
if not Is_Empty (Pipe, Timeout => 0.01)
then
Read (File => Pipe.Read_End,
Buffer => Buffer,
Last => Last);
end if;
return Buffer (1 .. Last);
exception
when Ada.IO_Exceptions.End_Error =>
return No_Data;
end Output_Of;
procedure Write_To (Pipe : in Shell.Pipe; Input : in Data)
is
begin
Check_Not_Null (Pipe);
if Input'Length > 0
then
declare
subtype My_Data is Data (Input'Range);
procedure Write is new POSIX.IO.Generic_Write (My_Data);
begin
Write (Pipe.Write_End, Input);
end;
end if;
end Write_To;
procedure Close_Write_End (Pipe : in Shell.Pipe)
is
begin
Check_Not_Null (Pipe);
Safe_Pipes.Close (Pipe, Only_Write_End => True);
end Close_Write_End;
function Close_Write_End (Pipe : in Shell.Pipe) return Boolean
is
begin
Check_Not_Null (Pipe);
Safe_Pipes.Close (Pipe, Only_Write_End => True);
return True;
end Close_Write_End;
--- Pipe Streams
--
function Stream (Pipe : in Shell.Pipe) return Pipe_Stream
is
begin
Check_Not_Null (Pipe);
return (Root_Stream_Type with Pipe => Pipe);
end Stream;
overriding
procedure Read (Stream : in out Pipe_Stream;
Item : out Stream_Element_Array;
Last : out Stream_Element_Offset)
is
begin
POSIX.IO.Read (File => Stream.Pipe.Read_End,
Buffer => Item,
Last => Last);
end Read;
overriding
procedure Write (Stream : in out Pipe_Stream;
Item : in Stream_Element_Array)
is
Last : Ada.Streams.Stream_Element_Offset;
begin
POSIX.IO.Write (File => Stream.Pipe.Write_End,
Buffer => Item,
Last => Last);
end Write;
--- Processes
--
procedure Update_Status (Process : in out Shell.Process;
POSIX_Status : in POSIX.Process_Primitives.Termination_Status)
is
use POSIX.Process_Primitives;
begin
if Status_Available (POSIX_Status) -- A state change has occurred.
then
Process.Status := POSIX_Status;
declare
Cause : constant Termination_Cause := Termination_Cause_Of (POSIX_Status);
begin
case Process.State
is
when Not_Started =>
raise Program_Error with "Shell.Update_Status: Status is available for unstarted process.";
when Running =>
case Cause
is
when Exited =>
if Exit_Status_Of (POSIX_Status) = POSIX.Process_Primitives.Normal_Exit
then
Process.State := Normal_Exit;
else
Process.State := Failed_Exit;
end if;
when Terminated_By_Signal =>
declare
use POSIX.Signals;
Signal : constant POSIX.Signals.Signal := Termination_Signal_Of (POSIX_Status);
begin
if Signal = Signal_Interrupt then Process.State := Interrupted;
elsif Signal = Signal_Kill then Process.State := Killed;
else
raise Program_Error with "Shell.Update_Status: Unhandled termination signal (" & Signal'Image & ") while running.";
end if;
end;
when Stopped_By_Signal =>
declare
use POSIX.Signals;
Signal : constant POSIX.Signals.Signal := Stopping_Signal_Of (POSIX_Status);
begin
if Signal = Signal_Stop
-- if Signal = Signal_Terminal_Stop
then
Process.State := Paused;
else
raise Program_Error with "Shell.Update_Status: Unhandled stopping signal (" & Signal'Image & ") while running.";
end if;
end;
end case;
when Paused =>
case Cause
is
when Exited =>
raise Program_Error with "Shell.Update_Status: Paused process has exited.";
when Terminated_By_Signal =>
declare
use POSIX.Signals;
Signal : constant POSIX.Signals.Signal := Termination_Signal_Of (POSIX_Status);
begin
if Signal = Signal_Interrupt then Process.State := Interrupted;
elsif Signal = Signal_Kill then Process.State := Killed;
else
raise Program_Error with "Shell.Update_Status: Unhandled termination signal (" & Signal'Image &") while paused.";
end if;
end;
when Stopped_By_Signal =>
declare
use POSIX.Signals;
Signal : constant POSIX.Signals.Signal := Stopping_Signal_Of (POSIX_Status);
begin
raise Program_Error with "Shell.Update_Status: Unhandled stopping signal (" & Signal'Image &") while paused.";
end;
end case;
-- The following cases should never occur.
--
when Normal_Exit =>
raise Program_Error with "Shell.Update_Status: Process has already exited normally.";
when Failed_Exit =>
raise Program_Error with "Shell.Update_Status: Process has already exited due to failure.";
when Interrupted =>
raise Program_Error with "Shell.Update_Status: Process has already been interrupted.";
when Killed =>
raise Program_Error with "Shell.Update_Status: Process has already been killed.";
end case;
end;
end if;
end Update_Status;
function Status (Process : in out Shell.Process) return Process_State
is
use POSIX.Process_Primitives;
POSIX_Status : POSIX.Process_Primitives.Termination_Status;
begin
if Process.State not in Not_Started | Terminated
then
Wait_For_Child_Process (Status => POSIX_Status,
Child => Process.Id,
Block => False);
Update_Status (Process, POSIX_Status);
end if;
return Process.State;
end Status;
function Start (Program : in String;
Arguments : in String_Array;
Working_Directory : in String := ".";
Input : in Pipe := Standard_Input;
Output : in Pipe := Standard_Output;
Errors : in Pipe := Standard_Error;
Pipeline : in Boolean := False) return Process
is
use POSIX,
POSIX.Process_Primitives,
POSIX.Process_Primitives.Extensions,
Gnat.OS_Lib;
The_Template : Process_Template;
The_Process : Process;
The_Process_Id : Process_Id;
Args : POSIX_String_List;
Name : constant POSIX_String := To_POSIX_String (Program);
Pathname : String_Access := Locate_Exec_On_Path (Program);
begin
if Pathname = null
then
raise Process_Error with "Program '" & Program & "' not found on PATH";
else
Free (Pathname);
end if;
Open_Template (The_Template);
if Errors /= Standard_Error
then
Set_File_Action_To_Close (The_Template, Errors.Read_End);
Set_File_Action_To_Duplicate (The_Template, POSIX.IO.Standard_Error,
Errors.Write_End);
Set_File_Action_To_Close (The_Template, Errors.Write_End);
end if;
if Output /= Standard_Output
then
Set_File_Action_To_Close (The_Template, Output.Read_End);
Set_File_Action_To_Duplicate (The_Template, POSIX.IO.Standard_Output,
Output.Write_End);
Set_File_Action_To_Close (The_Template, Output.Write_End);
end if;
if Input /= Standard_Input
then
Set_File_Action_To_Close (The_Template, Input.Write_End);
Set_File_Action_To_Duplicate (The_Template, POSIX.IO.Standard_Input,
Input.Read_End);
Set_File_Action_To_Close (The_Template, Input.Read_End);
end if;
Append (Args, Name);
for i in Arguments'Range
loop
Append (Args, To_POSIX_String (+Arguments (i)));
end loop;
Start_Process:
begin
Start_Process_Search (The_Process_Id,
Name,
Working_Directory,
The_Template,
Args);
exception
when E : POSIX.POSIX_Error =>
Close_Template (The_Template);
if Ada.Exceptions.Exception_Message (E) = "RESOURCE_TEMPORARILY_UNAVAILABLE"
then
raise Too_Many_Processes_Error;
else
raise;
end if;
when others =>
Close_Template (The_Template);
raise;
end Start_Process;
Close_Template (The_Template);
Make_Empty (Args);
if Input /= Standard_Input
then
Safe_Pipes.Close (Input, Only_Read_End => True);
end if;
-- When in a pipeline of processes, the write ends of The_Process's 'Output' & 'Errors' pipes must remain open, in
-- the main process, until the next process in the pipeline (which uses the pipe as 'Input') is started (spawned).
--
if not Pipeline
then
if Output /= Standard_Output
then
Safe_Pipes.Close (Output, Only_Write_End => True);
end if;
if Errors /= Standard_Error
then
Safe_Pipes.Close (Errors, Only_Write_End => True);
end if;
end if;
The_Process.Id := The_Process_Id;
The_Process.State := Running;
return The_Process;
end Start;
function Start (Command : in String;
Working_Directory : in String := ".";
Input : in Pipe := Standard_Input;
Output : in Pipe := Standard_Output;
Errors : in Pipe := Standard_Error;
Pipeline : in Boolean := False) return Process
is
use Ada.Strings.Fixed,
Gnat.OS_Lib;
I : constant Natural := Index (Command, " ");
Program : constant String := (if I = 0 then Command else Command (Command'First .. I - 1));
Pathname : String_Access := Locate_Exec_On_Path (Program);
begin
if Pathname = null
then
raise Process_Error with "Program '" & Program & "' not found on PATH";
else
Free (Pathname);
end if;
return Start (Program => "/bin/sh",
Arguments => (+"-c",
+Command),
Working_Directory => Working_Directory,
Input => Input,
Output => Output,
Errors => Errors,
Pipeline => Pipeline);
end Start;
procedure Start (Process : in out Shell.Process;
Program : in String;
Arguments : in String_Array;
Working_Directory : in String := ".";
Input : in Pipe := Standard_Input;
Output : in Pipe := Standard_Output;
Errors : in Pipe := Standard_Error;
Pipeline : in Boolean := False)
is
begin
if Process.State /= Not_Started
then
raise Process_Already_Started;
end if;
Process := Start (Program, Arguments, Working_Directory, Input, Output, Errors, Pipeline);
end Start;
procedure Start (Process : in out Shell.Process;
Command : in String;
Working_Directory : in String := ".";
Input : in Pipe := Standard_Input;
Output : in Pipe := Standard_Output;
Errors : in Pipe := Standard_Error;
Pipeline : in Boolean := False)
is
begin
if Process.State /= Not_Started
then
raise Process_Already_Started;
end if;
Process := Start (Command, Working_Directory, Input, Output, Errors, Pipeline);
end Start;
procedure Wait_On (Process : in out Shell.Process)
is
use POSIX.Process_Primitives;
POSIX_Status : POSIX.Process_Primitives.Termination_Status;
begin
Wait_For_Child_Process (Status => POSIX_Status,
Child => Process.Id,
Block => True);
Update_Status (Process, POSIX_Status);
end Wait_On;
function Has_Terminated (Process : in out Shell.Process) return Boolean
is
use POSIX.Process_Primitives,
Ada.Characters.Handling,
Ada.Exceptions;
begin
Wait_For_Child_Process (Status => Process.Status,
Child => Process.Id,
Block => False);
return Status_Available (Process.Status);
exception
when E : POSIX.POSIX_Error =>
if To_Upper (Exception_Message (E)) = "NO_CHILD_PROCESS"
then
Log ("Has_Terminated ~ Child process is already dead (" & Image (Process) & ")");
return True;
else
raise;
end if;
end Has_Terminated;
function Normal_Exit (Process : in Shell.Process) return Boolean
is
use POSIX.Process_Primitives;
begin
if not Status_Available (Process.Status)
then
return False; -- TODO: Should this raise an exception ?
end if;
if Exit_Status_Of (Process.Status) = POSIX.Process_Primitives.Normal_Exit
then
return True;
end if;
return False;
end Normal_Exit;
function Image (Process : in Shell.Process) return String
is
use POSIX.Process_Identification;
begin
return
Image (Process.Id)
& " "
& Process.State'Image;
end Image;
procedure Kill (Process : in out Shell.Process)
is
use POSIX.Signals;
the_Status : Process_State := Status (Process);
begin
Send_Signal (Process.Id, Signal_Kill);
while the_Status /= Killed
loop
delay Duration'Small;
the_Status := Status (Process);
end loop;
end Kill;
procedure Interrupt (Process : in out Shell.Process)
is
use POSIX.Signals;
begin
Send_Signal (Process.Id, Signal_Interrupt);
while Status (Process) /= Interrupted
loop
delay Duration'Small;
end loop;
end Interrupt;
procedure Pause (Process : in out Shell.Process)
is
use POSIX.Signals;
begin
case Process.State
is
when Not_Started =>
raise Process_Not_Started;
when Running =>
Send_Signal (Process.Id, Signal_Stop);
while Status (Process) /= Paused
loop
delay Duration'Small;
end loop;
when Paused =>
raise Process_Already_Paused;
when Normal_Exit
| Failed_Exit
| Interrupted
| Killed =>
raise Process_Has_Terminated with "Status => " & Process.State'Image;
end case;
end Pause;
procedure Resume (Process : in out Shell.Process)
is
use POSIX.Signals;
begin
Send_Signal (Process.Id, Signal_Continue);
Process.State := Running;
end Resume;
--- Debugging
--
protected Logger
is
procedure Open (Name : in String);
procedure Close;
procedure Log (Message : in String);
private
Log_File : Ada.Text_IO.File_Type;
Log_Enabled : Boolean := False;
end Logger;
protected body Logger
is
procedure Open (Name : in String)
is
use Ada.Text_IO;
begin
if Log_Enabled
then
raise Program_Error with "Log is already open.";
end if;
Log_Enabled := True;
Create (Log_File, Out_File, Name);
end Open;
procedure Close
is
use Ada.Text_IO;
begin
if not Log_Enabled
then
raise Program_Error with "Log has not been opened.";
end if;
Log_Enabled := False;
Close (Log_File);
exception
when Device_Error =>
null;
end Close;
procedure Log (Message : in String)
is
use Ada.Text_IO;
begin
if Log_Enabled
then
Put_Line (Log_File, Message);
Flush (Log_File);
end if;
end Log;
end Logger;
procedure Open_Log (Name : in String)
is
begin
Logger.Open (Name);
end Open_Log;
procedure Close_Log
is
begin
Logger.Close;
end Close_Log;
procedure Log (Message : in String)
is
begin
Logger.Log (Message);
end Log;
function Log (Message : in String) return Boolean
is
begin
Log (Message);
return True;
end Log;
end Shell;
|
KLOC-Karsten/adaoled | Ada | 1,045 | ads |
with Bitmap_Graphics; use Bitmap_Graphics;
package Bitmap_Graphics.Icons is
Signal816: aliased Byte_Array := -- mobie singal
(
16#FE#, 16#02#, 16#92#, 16#0A#, 16#54#, 16#2A#, 16#38#, 16#AA#, 16#12#, 16#AA#, 16#12#, 16#AA#, 16#12#, 16#AA#, 16#12#, 16#AA#
);
Msg816: aliased Byte_Array := -- message
(
16#1F#, 16#F8#, 16#10#, 16#08#, 16#18#, 16#18#, 16#14#, 16#28#, 16#13#, 16#C8#, 16#10#, 16#08#, 16#10#, 16#08#, 16#1F#, 16#F8#
);
Bat816: aliased Byte_Array := -- batery
(
16#0F#, 16#FE#, 16#30#, 16#02#, 16#26#, 16#DA#, 16#26#, 16#DA#, 16#26#, 16#DA#, 16#26#, 16#DA#, 16#30#, 16#02#, 16#0F#, 16#FE#
);
Bluetooth88: aliased Byte_Array := -- bluetooth
(
16#18#, 16#54#, 16#32#, 16#1C#, 16#1C#, 16#32#, 16#54#, 16#18#
);
GPRS88: aliased Byte_Array := -- GPRS
(
16#C3#, 16#99#, 16#24#, 16#20#, 16#2C#, 16#24#, 16#99#, 16#C3#
);
Alarm88: aliased Byte_Array := -- alarm
(
16#C3#, 16#BD#, 16#42#, 16#52#, 16#4E#, 16#42#, 16#3C#, 16#C3#
);
end Bitmap_Graphics.Icons;
|
shintakezou/drake | Ada | 8,805 | adb | -- convert UCD/extracted/DerivedEastAsianWidth.txt
-- bin/ucd_eastasianwidth $UCD/extracted/DerivedEastAsianWidth.txt > ../source/strings/a-ueaswi.ads
with Ada.Command_Line; use Ada.Command_Line;
with Ada.Containers.Ordered_Maps;
with Ada.Integer_Text_IO; use Ada.Integer_Text_IO;
with Ada.Strings; use Ada.Strings;
with Ada.Strings.Bounded;
with Ada.Strings.Fixed; use Ada.Strings.Fixed;
with Ada.Strings.Maps.Constants; use Ada.Strings.Maps.Constants;
with Ada.Text_IO; use Ada.Text_IO;
procedure ucd_eastasianwidth is
function Value (S : String) return Wide_Wide_Character is
Img : constant String := "Hex_" & (1 .. 8 - S'Length => '0') & S;
begin
return Wide_Wide_Character'Value (Img);
end Value;
procedure Put_16 (Item : Integer) is
begin
if Item >= 16#10000# then
Put (Item, Width => 1, Base => 16);
else
declare
S : String (1 .. 8); -- "16#XXXX#"
begin
Put (S, Item, Base => 16);
S (1) := '1';
S (2) := '6';
S (3) := '#';
for I in reverse 4 .. 6 loop
if S (I) = '#' then
S (4 .. I) := (others => '0');
exit;
end if;
end loop;
Put (S);
end;
end if;
end Put_16;
package EAW_Property_Names is new Ada.Strings.Bounded.Generic_Bounded_Length (2);
use type EAW_Property_Names.Bounded_String;
package CP2EAW_Maps is
new Ada.Containers.Ordered_Maps (Wide_Wide_Character, EAW_Property_Names.Bounded_String);
use CP2EAW_Maps;
Table : aliased CP2EAW_Maps.Map;
type Bit is (In_XXXX, In_1XXXX, In_XXXXXXXX);
Num : array (Bit) of Natural;
begin
declare
File : Ada.Text_IO.File_Type;
begin
Open (File, In_File, Argument (1));
while not End_Of_File (File) loop
declare
Line : constant String := Get_Line (File);
P : Positive := Line'First;
Next : Natural;
Token_First : Positive;
Token_Last : Natural;
First, Last : Wide_Wide_Character;
EAW : EAW_Property_Names.Bounded_String;
begin
if Line'Length = 0 or else Line (P) = '#' then
null; -- comment
else
Find_Token (
Line (P .. Line'Last),
Hexadecimal_Digit_Set,
Inside,
Token_First,
Token_Last);
if Token_First /= P then
raise Data_Error with Line & " -- A";
end if;
First := Value (Line (Token_First .. Token_Last));
P := Token_Last + 1;
if Line (P) = '.' and then Line (P + 1) = '.' then
P := P + 2;
Find_Token (
Line (P .. Line'Last),
Hexadecimal_Digit_Set,
Inside,
Token_First,
Token_Last);
if Token_First /= P then
raise Data_Error with Line & " -- B";
end if;
Last := Value (Line (Token_First .. Token_Last));
P := Token_Last + 1;
else
Last := First;
end if;
Next := Index_Non_Blank (Line (P .. Line'Last));
if Next = 0 or else Line (Next) /= ';' then
raise Data_Error with Line & " -- C";
end if;
P := Next + 1; -- skip ';'
Next := Index_Non_Blank (Line (P .. Line'Last));
if Next = 0 then
raise Data_Error with Line & " -- D";
end if;
P := Next;
Find_Token (
Line (P .. Line'Last),
Letter_Set,
Inside,
Token_First,
Token_Last);
if Token_First /= P then
raise Data_Error with Line & " -- E";
end if;
EAW_Property_Names.Set_Bounded_String (
EAW,
Line (Token_First .. Token_Last));
if EAW /= "N" then
for I in First .. Last loop
Insert (Table, I, EAW);
end loop;
end if;
end if;
end;
end loop;
Close (File);
end;
declare
I : CP2EAW_Maps.Cursor := First (Table);
begin
for I in Num'Range loop
Num (I) := 0;
end loop;
while Has_Element (I) loop
declare
EAW : EAW_Property_Names.Bounded_String := Element (I);
L : CP2EAW_Maps.Cursor := I;
N : CP2EAW_Maps.Cursor := Next (I);
begin
while Has_Element (N)
and then Key (N) = Wide_Wide_Character'Succ (Key (L))
and then Element (N) = EAW
loop
L := N;
N := Next (N);
end loop;
if Key (L) <= Wide_Wide_Character'Val (16#FFFF#) then
Num (In_XXXX) := Num (In_XXXX)
+ Integer'(
Wide_Wide_Character'Pos (Key (L))
- Wide_Wide_Character'Pos (Key (I))
+ 1
+ (2 ** 13 - 1))
/ 2 ** 13;
elsif Key (L) <= Wide_Wide_Character'Val (16#1FFFF#) then
Num (In_1XXXX) := Num (In_1XXXX) + 1;
else
Num (In_XXXXXXXX) := Num (In_XXXXXXXX) + 1;
end if;
I := N;
end;
end loop;
end;
Put_Line ("pragma License (Unrestricted);");
Put_Line ("-- implementation unit, translated from DerivedEastAsianWidth.txt");
Put_Line ("package Ada.UCD.East_Asian_Width is");
Put_Line (" pragma Pure;");
New_Line;
Put_Line (" type Run_Length_13 is mod 2 ** 13;");
Put_Line (" type Run_Length_29 is mod 2 ** 29;");
New_Line;
Put_Line (" type Table_16_Item_Type is record");
Put_Line (" Start : UCS_2;");
Put_Line (" Length : Run_Length_13;");
Put_Line (" Width : East_Asian_Width_Type;");
Put_Line (" end record;");
Put_Line (" pragma Suppress_Initialization (Table_16_Item_Type);");
Put_Line (" for Table_16_Item_Type'Size use 32; -- 16 + 13 + 3");
Put_Line (" for Table_16_Item_Type use record");
Put_Line (" Start at 0 range 0 .. 15;");
Put_Line (" Length at 0 range 16 .. 28;");
Put_Line (" Width at 0 range 29 .. 31;");
Put_Line (" end record;");
New_Line;
Put_Line (" type Table_16_Type is array (Positive range <>) of Table_16_Item_Type;");
Put_Line (" pragma Suppress_Initialization (Table_16_Type);");
Put_Line (" for Table_16_Type'Component_Size use 32;");
New_Line;
Put_Line (" type Table_32_Item_Type is record");
Put_Line (" Start : UCS_4;");
Put_Line (" Length : Run_Length_29;");
Put_Line (" Width : East_Asian_Width_Type;");
Put_Line (" end record;");
Put_Line (" pragma Suppress_Initialization (Table_32_Item_Type);");
Put_Line (" for Table_32_Item_Type'Size use 64; -- 32 + 29 + 3");
Put_Line (" for Table_32_Item_Type use record");
Put_Line (" Start at 0 range 0 .. 31;");
Put_Line (" Length at 0 range 32 .. 60;");
Put_Line (" Width at 0 range 61 .. 63;");
Put_Line (" end record;");
New_Line;
Put_Line (" type Table_32_Type is array (Positive range <>) of Table_32_Item_Type;");
Put_Line (" pragma Suppress_Initialization (Table_32_Type);");
Put_Line (" for Table_32_Type'Component_Size use 64;");
New_Line;
Put (" subtype Table_XXXX_Type is Table_16_Type (1 .. ");
Put (Num (In_XXXX), Width => 1);
Put (");");
New_Line;
New_Line;
Put (" subtype Table_1XXXX_Type is Table_16_Type (");
Put (Num (In_XXXX) + 1, Width => 1);
Put (" .. ");
Put (Num (In_XXXX) + Num (In_1XXXX), Width => 1);
Put (");");
New_Line;
New_Line;
Put (" subtype Table_XXXXXXXX_Type is Table_32_Type (");
Put (Num (In_XXXX) + Num (In_1XXXX) + 1, Width => 1);
Put (" .. ");
Put (Num (In_XXXX) + Num (In_1XXXX) + Num (In_XXXXXXXX), Width => 1);
Put (");");
New_Line;
New_Line;
Put_Line (" Table_XXXX : constant Table_XXXX_Type := (");
declare
State : Bit := In_XXXX;
Offset : Integer := 0;
I : CP2EAW_Maps.Cursor := First (Table);
begin
while Has_Element (I) loop
declare
EAW : EAW_Property_Names.Bounded_String renames Table.Constant_Reference (I).Element.all;
L : CP2EAW_Maps.Cursor := I;
N : CP2EAW_Maps.Cursor := Next (I);
begin
while Has_Element (N)
and then Key (N) = Wide_Wide_Character'Succ (Key (L))
and then Element (N) = EAW
loop
L := N;
N := Next (N);
exit when State = In_XXXX
and then
Wide_Wide_Character'Pos (Key (L))
- Wide_Wide_Character'Pos (Key (I))
+ 1 = 2 ** 13 - 1;
end loop;
Put (" (");
Put_16 (Wide_Wide_Character'Pos (Key (I)) - Offset);
Put (", ");
Put (
Integer'(Wide_Wide_Character'Pos (Key (L)))
- Integer'(Wide_Wide_Character'Pos (Key (I)))
+ 1,
Width => 1);
Put (", ");
Put (EAW_Property_Names.To_String (EAW));
Put (")");
if Has_Element (N) then
if State = In_XXXX
and then Key (N) > Wide_Wide_Character'Val (16#FFFF#)
then
State := In_1XXXX;
Offset := 16#10000#;
Put (");");
New_Line;
New_Line;
Put_Line (" Table_1XXXX : constant Table_1XXXX_Type := (");
elsif State = In_1XXXX
and then Key (N) > Wide_Wide_Character'Val (16#1FFFF#)
then
State := In_XXXXXXXX;
Offset := 0;
Put (");");
New_Line;
New_Line;
Put_Line (" Table_XXXXXXXX : constant Table_XXXXXXXX_Type := (");
else
Put (",");
New_Line;
end if;
else
Put (");");
New_Line;
end if;
I := N;
end;
end loop;
end;
New_Line;
Put_Line ("end Ada.UCD.East_Asian_Width;");
end ucd_eastasianwidth;
|
davidkristola/vole | Ada | 12,265 | adb | with Ada.Streams.Stream_IO;
with Ada.Strings.Maps;
with Ada.Text_IO;
with String_Ops;
with kv.avm.Tuples;
package body kv.avm.Registers is
function "+"(S : String) return String_Type renames Ada.Strings.Unbounded.To_Unbounded_String;
function "+"(U : String_Type) return String renames Ada.Strings.Unbounded.To_String;
type Data_Kind_Lookup_Type is array (Data_Kind) of Character;
Data_Kind_Signatures : constant Data_Kind_Lookup_Type := (
Unset => 'E',
Signed_Integer => 'I',
Unsigned_Integer => 'U',
Floatingpoint => 'F',
Bit_Or_Boolean => 'B',
Tuple => 'T',
Tuple_Map => 'm',
Immutable_String => 'S',
Actor_Reference => 'R',
Actor_Definition => 'A',
Message_Definition => 'M',
Future => 'f',
Tuple_Definition => 'd');
-----------------------------------------------------------------------------
function Signature(Format : in Data_Kind) return Character is
begin
return Data_Kind_Signatures(Format);
end Signature;
-----------------------------------------------------------------------------
function Format(Signature : in Character) return Data_Kind is
begin
for Answer in Data_Kind loop
if Data_Kind_Signatures(Answer) = Signature then
return Answer;
end if;
end loop;
return Unset;
end Format;
-----------------------------------------------------------------------------
function Signature_To_String(Signature : in Signature_Type) return String is
Answer : String(1..Signature'LENGTH);
Index : Integer := 1;
begin
for Kind in Signature'RANGE loop
Answer(Index) := kv.avm.Registers.Signature(Signature(Kind));
Index := Index + 1;
end loop;
return Answer;
end Signature_To_String;
-----------------------------------------------------------------------------
function String_To_Signature(Signature : in String) return Signature_Type is
Answer : Signature_Type(1..Signature'LENGTH);
begin
for Index in 1..Signature'LENGTH loop
Answer(Index) := Format(Signature(Index + Signature'FIRST - 1));
end loop;
return Answer;
end String_To_Signature;
-----------------------------------------------------------------------------
function Reg_Img(Reg : Register_Type) return String is
Fmt : constant String := Data_Kind'IMAGE(Reg.Format);
begin
case Reg.Format is
when Signed_Integer =>
return " " & Interfaces.Integer_64'IMAGE(Reg.signed_value);
when Unsigned_Integer =>
return " uint:" & Interfaces.Unsigned_64'IMAGE(Reg.unsigned_value);
when Bit_Or_Boolean =>
return " " & Boolean'IMAGE(Reg.bit);
when Floatingpoint =>
return " " & Interfaces.IEEE_Float_64'IMAGE(Reg.value);
when Actor_Definition =>
return " Def:" & (+Reg.Actor_Kind);
when Immutable_String =>
return " '" & (+Reg.The_String) & "'";
when Message_Definition =>
return " Msg:" & (+Reg.Message_Name);
when Future =>
return " " & Fmt & Interfaces.Unsigned_32'IMAGE(Reg.ID);
when Tuple =>
return " [" & Reg.folded_tuple.To_String & "]";
when Actor_Reference =>
return " Ref:" & Reg.Instance.Image;
when others =>
null;
end case;
return Fmt;
end Reg_Img;
-----------------------------------------------------------------------------
procedure Register_Write(Stream : not null access Ada.Streams.Root_Stream_Type'CLASS; Item : in Register_Type) is
begin
Data_Kind'WRITE(Stream, Item.Format);
case Item.Format is
when Signed_Integer =>
Interfaces.Integer_64'WRITE(Stream, Item.signed_value);
when Unsigned_Integer =>
Interfaces.Unsigned_64'WRITE(Stream, Item.Unsigned_Value);
when Actor_Definition =>
String'OUTPUT(Stream, +Item.Actor_Kind);
when Message_Definition =>
String'OUTPUT(Stream, +Item.Message_Name);
when Immutable_String =>
String'OUTPUT(Stream, +Item.The_String);
when Tuple =>
kv.avm.Tuples.Tuple_Type'WRITE(Stream, Item.Folded_Tuple);
when Tuple_Map =>
kv.avm.Tuples.Map_Type'WRITE(Stream, Item.map);
when Bit_Or_Boolean =>
Boolean'OUTPUT(Stream, Item.bit);
when others =>
Ada.Text_IO.Put_Line("ERROR: Register_Write of " & Data_Kind'IMAGE(Item.Format) & " is not implemented yet.");
raise Unimplemented_Error;
end case;
end Register_Write;
-----------------------------------------------------------------------------
procedure Register_Read(Stream : not null access Ada.Streams.Root_Stream_Type'CLASS; Item : out Register_Type) is
Kind : Data_Kind;
begin
Data_Kind'READ(Stream, Kind);
case Kind is
when Signed_Integer =>
declare
Value : Interfaces.Integer_64;
begin
Interfaces.Integer_64'READ(Stream, Value);
Item := (Format => Signed_Integer, signed_value => Value);
end;
when Unsigned_Integer =>
declare
Value : Interfaces.Unsigned_64;
begin
Interfaces.Unsigned_64'READ(Stream, Value);
Item := (Format => Unsigned_Integer, Unsigned_Value => Value);
end;
when Actor_Definition =>
Item := (Format => Actor_Definition, Actor_Kind => +String'INPUT(Stream));
when Message_Definition =>
Item := (Format => Message_Definition, Message_Name => +String'INPUT(Stream), Send_Count => 0, Reply_Count => 0);
when Immutable_String =>
Item := (Format => Immutable_String, The_String => +String'INPUT(Stream));
when Tuple =>
declare
Value : kv.avm.Tuples.Tuple_Type;
begin
kv.avm.Tuples.Tuple_Type'READ(Stream, Value);
Item := (Format => Tuple, Folded_Tuple => Value);
end;
when Tuple_Map =>
declare
Value : kv.avm.Tuples.Map_Type;
begin
kv.avm.Tuples.Map_Type'READ(Stream, Value);
Item := (Format => Tuple_Map, map => Value);
end;
when Bit_Or_Boolean =>
Item := (Format => Bit_Or_Boolean, bit => Boolean'INPUT(Stream));
when others =>
Ada.Text_IO.Put_Line("ERROR: Register_Read of " & Data_Kind'IMAGE(Kind) & " is not implemented yet.");
raise Unimplemented_Error;
end case;
end Register_Read;
-----------------------------------------------------------------------------
function Bool(B : Boolean) return String is
begin
return " "&Boolean'IMAGE(B)(1..1);
end Bool;
-----------------------------------------------------------------------------
function Make_Tuple_Map(Value : kv.avm.references.Reference_Array_Type) return Register_Type is
Tuple_Layout : kv.avm.Tuples.Map_Type;
Fold_List : aliased constant kv.avm.references.Reference_Array_Type := Value;
use kv.avm.Registers;
begin
Tuple_Layout.Set(Fold_List'ACCESS);
return (format => Tuple_Map, Map => Tuple_Layout);
end Make_Tuple_Map;
Reference_Set : constant Ada.Strings.Maps.Character_Set :=
Ada.Strings.Maps.To_Set("SsIiLlAaFfCc0123456789");
-----------------------------------------------------------------------------
function Is_Reference_Character(C : in Character) return Boolean is
begin
return Ada.Strings.Maps.Is_In(C, Reference_Set);
end Is_Reference_Character;
-----------------------------------------------------------------------------
-- The *_First and *_Rest routines come from LISP car and cdr,
-- and provide easy parsing support.
--
function Reference_First
(Str : in String) return String is
S : Natural := Str'FIRST;
begin
while S < Str'LAST loop
exit when Is_Reference_Character(Str(S));
S := S + 1;
end loop;
for I in S .. Str'LAST loop
if not Is_Reference_Character(Str(I)) then
return Str(S..I-1);
end if;
end loop;
return Str; -- no blanks, return the whole string.
end Reference_First;
-----------------------------------------------------------------------------
function Reference_Rest
(Str : in String) return String is
B : Boolean := False; -- found a blank
S : Natural := Str'FIRST;
begin
while not Is_Reference_Character(Str(S)) loop
if S = Str'LAST then
return "";
end if;
S := S + 1;
end loop;
for I in S .. Str'LAST loop
if not Is_Reference_Character(Str(I)) then
B := True;
elsif B then
return Str(I..Str'LAST);
end if;
end loop;
return ""; -- there was no second part to Str
end Reference_Rest;
Foundation_For_Empty_Reference_Array : constant kv.avm.references.Reference_Array_Type := (kv.avm.references.Make_Reference("L9"), kv.avm.references.Make_Reference("L1"));
Empty_Reference_Array_Default : constant kv.avm.references.Reference_Array_Type := Foundation_For_Empty_Reference_Array(1..0);
-----------------------------------------------------------------------------
-- Tuple Maps should never be too long so a *simple* recursive parser will
-- do the job.
--
function String_To_Reference_Array_Type(Token : String; List : kv.avm.references.Reference_Array_Type := Empty_Reference_Array_Default) return kv.avm.references.Reference_Array_Type is
First : constant String := Reference_First(Token);
use Interfaces;
begin
--Ada.Text_IO.Put_Line("String_To_Reference_Array_Type '" & Token & "', len(List) = " & Natural'IMAGE(List'LENGTH));
if First = "" then
return List;
else
declare
Plus_One : kv.avm.references.Reference_Array_Type(1 .. List'LENGTH + 1);
begin
Plus_One(1 .. List'LENGTH) := List;
Plus_One(List'LENGTH + 1) := kv.avm.references.Make_Reference(First);
return String_To_Reference_Array_Type(Reference_Rest(Token), Plus_One);
end;
end if;
end String_To_Reference_Array_Type;
-----------------------------------------------------------------------------
function String_To_Tuple_Map(Token : String) return Register_Type is
Tuple_Layout : kv.avm.Tuples.Map_Type;
Fold_List : aliased constant kv.avm.references.Reference_Array_Type := String_To_Reference_Array_Type(Token);
begin
Tuple_Layout.Set(Fold_List'ACCESS);
return (format => Tuple_Map, Map => Tuple_Layout);
end String_To_Tuple_Map;
-----------------------------------------------------------------------------
function Make_S(Value : Interfaces.Integer_64) return Register_Type is
begin
return (format => Signed_Integer, signed_value => Value);
end Make_S;
-----------------------------------------------------------------------------
function Make_U(Value : Interfaces.Unsigned_64) return Register_Type is
begin
return (format => Unsigned_Integer, unsigned_value => Value);
end Make_U;
-----------------------------------------------------------------------------
function Make_String(Value : String) return Register_Type is
begin
return (Format => Immutable_String, The_String => +Value);
end Make_String;
-----------------------------------------------------------------------------
function Make_Tuple(Value : kv.avm.Tuples.Tuple_Type) return Register_Type is
begin
return (Format => Tuple, Folded_Tuple => Value);
end Make_Tuple;
-----------------------------------------------------------------------------
function Make_Ref(Value : kv.avm.Actor_References.Actor_Reference_Type) return Register_Type is
begin
return (Format => Actor_Reference, Instance => Value);
end Make_Ref;
end kv.avm.Registers;
|
pchapin/augusta | Ada | 1,072 | adb | ---------------------------------------------------------------------------
-- FILE : primary_suite.adb
-- SUBJECT : The main test suite of the Augusta standard library unit test program.
-- AUTHOR : (C) Copyright 2013 by Peter C. Chapin
--
-- Please send comments or bug reports to
--
-- Peter C. Chapin <[email protected]>
---------------------------------------------------------------------------
with Check_Characters_Handling;
with Check_Strings_Fixed;
package body Primary_Suite is
use AUnit.Test_Suites;
-- The suite itself.
Suite_Object : aliased Test_Suite;
-- The various tests in this suite. Low level tests should be done first.
Test_1 : aliased Check_Characters_Handling.Characters_Test;
Test_2 : aliased Check_Strings_Fixed.Strings_Test;
-- Function to return an access to the configured suite
function Suite return Access_Test_Suite is
begin
Add_Test(Suite_Object'Access, Test_1'Access);
Add_Test(Suite_Object'Access, Test_2'Access);
return Suite_Object'Access;
end Suite;
end Primary_Suite;
|
sungyeon/drake | Ada | 36 | ads | ../machine-apple-darwin/s-llcoty.ads |
vpodzime/ada-util | Ada | 4,245 | ads | -----------------------------------------------------------------------
-- util-encoders-base16 -- Encode/Decode a stream in hexadecimal
-- Copyright (C) 2009, 2010, 2011 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- 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.Streams;
-- The <b>Util.Encodes.Base16</b> packages encodes and decodes streams
-- in hexadecimal.
package Util.Encoders.Base16 is
pragma Preelaborate;
-- ------------------------------
-- Base16 encoder
-- ------------------------------
-- This <b>Encoder</b> translates the (binary) input stream into
-- an ascii hexadecimal stream. The encoding alphabet is: 0123456789ABCDEF.
type Encoder is new Util.Encoders.Transformer with private;
-- Encodes the binary input stream represented by <b>Data</b> into
-- the a base16 (hexadecimal) output stream <b>Into</b>.
--
-- If the transformer does not have enough room to write the result,
-- it must return in <b>Encoded</b> the index of the last encoded
-- position in the <b>Data</b> stream.
--
-- The transformer returns in <b>Last</b> the last valid position
-- in the output stream <b>Into</b>.
--
-- The <b>Encoding_Error</b> exception is raised if the input
-- stream cannot be transformed.
overriding
procedure Transform (E : in Encoder;
Data : in Ada.Streams.Stream_Element_Array;
Into : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset;
Encoded : out Ada.Streams.Stream_Element_Offset);
-- ------------------------------
-- Base16 decoder
-- ------------------------------
-- The <b>Decoder</b> decodes an hexadecimal stream into a binary stream.
type Decoder is new Util.Encoders.Transformer with private;
-- Decodes the base16 input stream represented by <b>Data</b> into
-- the binary output stream <b>Into</b>.
--
-- If the transformer does not have enough room to write the result,
-- it must return in <b>Encoded</b> the index of the last encoded
-- position in the <b>Data</b> stream.
--
-- The transformer returns in <b>Last</b> the last valid position
-- in the output stream <b>Into</b>.
--
-- The <b>Encoding_Error</b> exception is raised if the input
-- stream cannot be transformed.
overriding
procedure Transform (E : in Decoder;
Data : in Ada.Streams.Stream_Element_Array;
Into : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset;
Encoded : out Ada.Streams.Stream_Element_Offset);
private
type Encoder is new Util.Encoders.Transformer with null record;
type Decoder is new Util.Encoders.Transformer with null record;
generic
type Input_Char is (<>);
type Output_Char is (<>);
type Index is range <>;
type Output_Index is range <>;
type Input is array (Index range <>) of Input_Char;
type Output is array (Output_Index range <>) of Output_Char;
package Encoding is
procedure Encode (From : in Input;
Into : in out Output;
Last : out Output_Index;
Encoded : out Index);
procedure Decode (From : in Input;
Into : in out Output;
Last : out Output_Index;
Encoded : out Index);
end Encoding;
end Util.Encoders.Base16;
|
damaki/libkeccak | Ada | 4,380 | ads | -------------------------------------------------------------------------------
-- Copyright (c) 2019, Daniel King
-- 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.
-- * The name of the copyright holder may not 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 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 Keccak.Generic_Parallel_Sponge;
with Keccak.Padding;
pragma Elaborate_All (Keccak.Generic_Parallel_Sponge);
package Keccak.Parallel_Keccak_1600.Rounds_12
with SPARK_Mode => On
is
procedure Permute_All_P2 is new KeccakF_1600_P2.Permute_All
(First_Round => 12,
Num_Rounds => 12);
procedure Permute_All_P4 is new KeccakF_1600_P4.Permute_All
(Permute_All_P2);
procedure Permute_All_P8 is new KeccakF_1600_P8.Permute_All
(Permute_All_P2);
package Parallel_Sponge_P2 is new Keccak.Generic_Parallel_Sponge
(State_Size => 1600,
State_Type => KeccakF_1600_P2.Parallel_State,
Parallelism => 2,
Init => KeccakF_1600_P2.Init,
Permute_All => Permute_All_P2,
XOR_Bits_Into_State_Separate => KeccakF_1600_P2.XOR_Bits_Into_State_Separate,
XOR_Bits_Into_State_All => KeccakF_1600_P2.XOR_Bits_Into_State_All,
Extract_Bytes => KeccakF_1600_P2.Extract_Bytes,
Pad => Keccak.Padding.Pad101_Single_Block,
Min_Padding_Bits => Keccak.Padding.Pad101_Min_Bits);
package Parallel_Sponge_P4 is new Keccak.Generic_Parallel_Sponge
(State_Size => 1600,
State_Type => KeccakF_1600_P4.Parallel_State,
Parallelism => 4,
Init => KeccakF_1600_P4.Init,
Permute_All => Permute_All_P4,
XOR_Bits_Into_State_Separate => KeccakF_1600_P4.XOR_Bits_Into_State_Separate,
XOR_Bits_Into_State_All => KeccakF_1600_P4.XOR_Bits_Into_State_All,
Extract_Bytes => KeccakF_1600_P4.Extract_Bytes,
Pad => Keccak.Padding.Pad101_Single_Block,
Min_Padding_Bits => Keccak.Padding.Pad101_Min_Bits);
package Parallel_Sponge_P8 is new Keccak.Generic_Parallel_Sponge
(State_Size => 1600,
State_Type => KeccakF_1600_P8.Parallel_State,
Parallelism => 8,
Init => KeccakF_1600_P8.Init,
Permute_All => Permute_All_P8,
XOR_Bits_Into_State_Separate => KeccakF_1600_P8.XOR_Bits_Into_State_Separate,
XOR_Bits_Into_State_All => KeccakF_1600_P8.XOR_Bits_Into_State_All,
Extract_Bytes => KeccakF_1600_P8.Extract_Bytes,
Pad => Keccak.Padding.Pad101_Single_Block,
Min_Padding_Bits => Keccak.Padding.Pad101_Min_Bits);
end Keccak.Parallel_Keccak_1600.Rounds_12;
|
reznikmm/matreshka | Ada | 3,732 | adb | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- XML Processor --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <[email protected]> --
-- 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$
------------------------------------------------------------------------------
package body XML.Schema.Named_Maps.Internals is
------------
-- Create --
------------
function Create
(Node : Matreshka.XML_Schema.Named_Maps.Named_Map_Access)
return XS_Named_Map is
begin
Matreshka.XML_Schema.Named_Maps.Reference (Node);
return (Ada.Finalization.Controlled with Node => Node);
end Create;
end XML.Schema.Named_Maps.Internals;
|
Ximalas/synth | Ada | 5,609 | ads | -- This file is covered by the Internet Software Consortium (ISC) License
-- Reference: ../License.txt
with Terminal_Interface.Curses;
with Definitions; use Definitions;
package Display is
package TIC renames Terminal_Interface.Curses;
subtype history_origin is String (1 .. 45);
subtype history_elapsed is String (1 .. 8);
subtype history_action is String (1 .. 8);
subtype fivelong is String (1 .. 5);
type history_rec is
record
id : builders;
slavid : String (1 .. 2);
run_elapsed : history_elapsed;
action : history_action;
pkg_elapsed : history_elapsed;
origin : history_origin;
established : Boolean := False;
end record;
type summary_rec is
record
Initially : Natural;
Built : Natural;
Failed : Natural;
Ignored : Natural;
Skipped : Natural;
elapsed : history_elapsed;
impulse : Natural;
pkg_hour : Natural;
load : Float;
swap : Float;
end record;
type builder_rec is
record
id : builders;
shutdown : Boolean;
idle : Boolean;
slavid : String (1 .. 2);
Elapsed : history_elapsed;
LLines : String (1 .. 7);
phase : String (1 .. 15);
origin : String (1 .. 37);
end record;
action_shutdown : constant history_action := "shutdown";
action_skipped : constant history_action := "skipped ";
action_ignored : constant history_action := "ignored ";
action_success : constant history_action := "success ";
action_failure : constant history_action := "failure ";
-- Initialize the curses screen.
-- Returns False if no color support (curses not used at all)
function launch_monitor (num_builders : builders) return Boolean;
-- The build is done, return to the console
procedure terminate_monitor;
-- prints the summary header
procedure summarize (data : summary_rec);
-- Updates the status of a builder (contained in builder_rec)
procedure update_builder (BR : builder_rec);
-- After all the update_builder calls, call refresh to implement
procedure refresh_builder_window;
-- After all the history inserts, call refresh to implement
procedure refresh_history_window;
-- Insert history as builder finishes (shutdown, success, failure);
procedure insert_history (HR : history_rec);
-- Clears and redraws the static portion of builder and summary zones
-- (Realized when the regular zones are refreshed)
procedure set_full_redraw_next_update;
-- Expose helper function that formats float values for www report
function fmtpc (f : Float; percent : Boolean) return fivelong;
private
type palette_rec is
record
palette : TIC.Color_Pair;
attribute : TIC.Character_Attribute_Set;
end record;
type builder_palette is array (builders) of palette_rec;
type cyclic_range is range 1 .. 50;
type dim_history is array (cyclic_range) of history_rec;
type zones is (summary, builder, action);
subtype appline is TIC.Attributed_String (1 .. 79);
history : dim_history;
history_arrow : cyclic_range := cyclic_range'Last;
builders_used : Integer;
app_width : constant TIC.Column_Count := 80;
historyheight : TIC.Line_Position;
zone_summary : TIC.Window;
zone_builders : TIC.Window;
zone_actions : TIC.Window;
viewheight : TIC.Line_Count;
c_standard : TIC.Color_Pair;
c_slave : builder_palette;
c_success : TIC.Color_Pair;
c_failure : TIC.Color_Pair;
c_ignored : TIC.Color_Pair;
c_skipped : TIC.Color_Pair;
c_sumlabel : TIC.Color_Pair;
c_dashes : TIC.Color_Pair;
c_tableheader : TIC.Color_Pair;
c_elapsed : TIC.Color_Pair;
c_origin : TIC.Color_Pair;
c_bldphase : TIC.Color_Pair;
c_shutdown : TIC.Color_Pair;
c_advisory : TIC.Color_Pair;
cursor_vis : TIC.Cursor_Visibility := TIC.Invisible;
normal : constant TIC.Character_Attribute_Set :=
(others => False);
bright : constant TIC.Character_Attribute_Set :=
(Bold_Character => True, others => False);
dimmed : constant TIC.Character_Attribute_Set :=
(Dim_Character => True, others => False);
function launch_summary_zone return Boolean;
function launch_builders_zone return Boolean;
function launch_actions_zone return Boolean;
function inc (X : TIC.Line_Position; by : Integer) return TIC.Line_Position;
function zone_window (zone : zones) return TIC.Window;
function Start_Curses_Mode return Boolean;
function establish_colors return Boolean;
function blank_line return appline;
function shutdown_message return appline;
function emphasis (dimmed : Boolean) return TIC.Character_Attribute_Set;
function custom_message (message : String;
attribute : TIC.Character_Attribute_Set;
pen_color : TIC.Color_Pair) return TIC.Attributed_String;
procedure draw_static_summary_zone;
procedure draw_static_builders_zone;
procedure Scrawl
(zone : zones;
information : TIC.Attributed_String;
at_line : TIC.Line_Position;
at_column : TIC.Column_Position := 0);
procedure Return_To_Text_Mode;
procedure Refresh_Zone (zone : zones);
end Display;
|
reznikmm/matreshka | Ada | 4,567 | adb | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Open Document Toolkit --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2014, Vadim Godunko <[email protected]> --
-- 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.DOM_Documents;
with Matreshka.ODF_String_Constants;
with ODF.DOM.Iterators;
with ODF.DOM.Visitors;
package body Matreshka.ODF_Text.Fixed_Attributes is
------------
-- Create --
------------
overriding function Create
(Parameters : not null access Matreshka.DOM_Attributes.Attribute_L2_Parameters)
return Text_Fixed_Attribute_Node is
begin
return Self : Text_Fixed_Attribute_Node do
Matreshka.ODF_Text.Constructors.Initialize
(Self'Unchecked_Access,
Parameters.Document,
Matreshka.ODF_String_Constants.Text_Prefix);
end return;
end Create;
--------------------
-- Get_Local_Name --
--------------------
overriding function Get_Local_Name
(Self : not null access constant Text_Fixed_Attribute_Node)
return League.Strings.Universal_String
is
pragma Unreferenced (Self);
begin
return Matreshka.ODF_String_Constants.Fixed_Attribute;
end Get_Local_Name;
begin
Matreshka.DOM_Documents.Register_Attribute
(Matreshka.ODF_String_Constants.Text_URI,
Matreshka.ODF_String_Constants.Fixed_Attribute,
Text_Fixed_Attribute_Node'Tag);
end Matreshka.ODF_Text.Fixed_Attributes;
|
reznikmm/matreshka | Ada | 3,645 | ads | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <[email protected]> --
-- 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$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Elements.Generic_Hash;
function AMF.UMLDI.UML_Structure_Diagrams.Hash is
new AMF.Elements.Generic_Hash (UMLDI_UML_Structure_Diagram, UMLDI_UML_Structure_Diagram_Access);
|
Fabien-Chouteau/Ada_Drivers_Library | Ada | 9,949 | ads | -- This spec has been automatically generated from cortex_m-debug.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
with HAL;
with System;
package Cortex_M_SVD.Debug is
pragma Preelaborate;
---------------
-- Registers --
---------------
-- Debug Fault Status Register
type DFSR_Register is record
HALTED : Boolean := False;
-- BKPT instruction executed or breakpoint match in FPB.
BKPT : Boolean := False;
-- Data Watchpoint and Trace trap. Indicates that the core halted due to
-- at least one DWT trap event.
DWTTRAP : Boolean := False;
-- Vector catch triggered. Corresponding FSR will contain the primary
-- cause of the exception.
VCATCH : Boolean := False;
-- An asynchronous exception generated due to the assertion of EDBGRQ.
EXTERNAL : Boolean := False;
-- unspecified
Reserved_5_31 : HAL.UInt27 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DFSR_Register use record
HALTED at 0 range 0 .. 0;
BKPT at 0 range 1 .. 1;
DWTTRAP at 0 range 2 .. 2;
VCATCH at 0 range 3 .. 3;
EXTERNAL at 0 range 4 .. 4;
Reserved_5_31 at 0 range 5 .. 31;
end record;
-------------------------------
-- DHCSR cluster's Registers --
-------------------------------
type ReadDHCSR_Register is record
-- Read-only.
C_DEBUGGEN : Boolean;
-- Read-only.
C_HALT : Boolean;
-- Read-only.
C_STEP : Boolean;
-- Read-only.
C_MASKINTS : Boolean;
-- unspecified
Reserved_4_4 : HAL.Bit;
-- Read-only.
C_SNAPSTALL : Boolean;
-- unspecified
Reserved_6_15 : HAL.UInt10;
-- Read-only.
S_REGRDY : Boolean;
-- Read-only.
S_HALT : Boolean;
-- Read-only.
S_SLEEP : Boolean;
-- Read-only.
S_LOCKUP : Boolean;
-- unspecified
Reserved_20_23 : HAL.UInt4;
-- Read-only.
S_RETIRE_ST : Boolean;
-- Read-only.
S_RESET_ST : Boolean;
-- unspecified
Reserved_26_31 : HAL.UInt6;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ReadDHCSR_Register use record
C_DEBUGGEN at 0 range 0 .. 0;
C_HALT at 0 range 1 .. 1;
C_STEP at 0 range 2 .. 2;
C_MASKINTS at 0 range 3 .. 3;
Reserved_4_4 at 0 range 4 .. 4;
C_SNAPSTALL at 0 range 5 .. 5;
Reserved_6_15 at 0 range 6 .. 15;
S_REGRDY at 0 range 16 .. 16;
S_HALT at 0 range 17 .. 17;
S_SLEEP at 0 range 18 .. 18;
S_LOCKUP at 0 range 19 .. 19;
Reserved_20_23 at 0 range 20 .. 23;
S_RETIRE_ST at 0 range 24 .. 24;
S_RESET_ST at 0 range 25 .. 25;
Reserved_26_31 at 0 range 26 .. 31;
end record;
subtype WriteDHCSR_S_RESET_ST_Field is HAL.Short;
type WriteDHCSR_Register is record
-- Write-only.
C_DEBUGGEN : Boolean := False;
-- Write-only.
C_HALT : Boolean := False;
-- Write-only.
C_STEP : Boolean := False;
-- Write-only.
C_MASKINTS : Boolean := False;
-- unspecified
Reserved_4_4 : HAL.Bit := 16#0#;
-- Write-only.
C_SNAPSTALL : Boolean := False;
-- unspecified
Reserved_6_15 : HAL.UInt10 := 16#0#;
-- Write-only. Debug Key. The value 0xA05F must be written to enable
-- write accesses to bits [15:0], otherwise the write access will be
-- ignored. Read behavior of bits [31:16] is as listed below.
S_RESET_ST : WriteDHCSR_S_RESET_ST_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for WriteDHCSR_Register use record
C_DEBUGGEN at 0 range 0 .. 0;
C_HALT at 0 range 1 .. 1;
C_STEP at 0 range 2 .. 2;
C_MASKINTS at 0 range 3 .. 3;
Reserved_4_4 at 0 range 4 .. 4;
C_SNAPSTALL at 0 range 5 .. 5;
Reserved_6_15 at 0 range 6 .. 15;
S_RESET_ST at 0 range 16 .. 31;
end record;
type DHCSR_Disc is
(
Mode_1,
Mode_2);
-- Debug Halting Control and Status Register
type DHCSR_Cluster
(Discriminent : DHCSR_Disc := Mode_1)
is record
case Discriminent is
when Mode_1 =>
Read : ReadDHCSR_Register;
when Mode_2 =>
Write : WriteDHCSR_Register;
end case;
end record
with Unchecked_Union, Volatile, Size => 32;
for DHCSR_Cluster use record
Read at 0 range 0 .. 31;
Write at 0 range 0 .. 31;
end record;
type DCRSR_HALTED_Field is
(
Register_0,
Register_1,
Register_2,
Register_3,
Register_4,
Register_5,
Register_6,
Register_7,
Register_8,
Register_9,
Register_10,
Register_11,
Register_12,
Current_Sp,
Link_Rregister,
Debug_Return_Address,
XPsr,
Msp,
Psp,
Control_Faultmask_Basepri_Primask)
with Size => 5;
for DCRSR_HALTED_Field use
(Register_0 => 0,
Register_1 => 1,
Register_2 => 2,
Register_3 => 3,
Register_4 => 4,
Register_5 => 5,
Register_6 => 6,
Register_7 => 7,
Register_8 => 8,
Register_9 => 9,
Register_10 => 10,
Register_11 => 11,
Register_12 => 12,
Current_Sp => 13,
Link_Rregister => 14,
Debug_Return_Address => 15,
XPsr => 16,
Msp => 17,
Psp => 18,
Control_Faultmask_Basepri_Primask => 19);
type DCRSR_REGWnR_Field is
(
Read,
Write)
with Size => 1;
for DCRSR_REGWnR_Field use
(Read => 0,
Write => 1);
-- Debug Core Register Selector Register: The DCRSR write-only register
-- generates a handshake to the core to transfer the selected register
-- to/from the DCRDR. The DHCSR S_REGRDY bit is cleared when the DCRSR is
-- written, and remains clear until the core transaction completes. This
-- register is only accessible from Debug state.
type DCRSR_Register is record
-- Write-only.
HALTED : DCRSR_HALTED_Field := Cortex_M_SVD.Debug.Register_0;
-- unspecified
Reserved_5_15 : HAL.UInt11 := 16#0#;
-- Write-only.
REGWnR : DCRSR_REGWnR_Field := Cortex_M_SVD.Debug.Read;
-- unspecified
Reserved_17_31 : HAL.UInt15 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DCRSR_Register use record
HALTED at 0 range 0 .. 4;
Reserved_5_15 at 0 range 5 .. 15;
REGWnR at 0 range 16 .. 16;
Reserved_17_31 at 0 range 17 .. 31;
end record;
-- Debug Exception and Monitor Control Register
type DEMCR_Register is record
VC_CORERESET : Boolean := False;
-- unspecified
Reserved_1_3 : HAL.UInt3 := 16#0#;
VC_MMERR : Boolean := False;
VC_NOCPERR : Boolean := False;
VC_CHKERR : Boolean := False;
VC_STATERR : Boolean := False;
VC_BUSERR : Boolean := False;
VC_INTERR : Boolean := False;
VC_HARDERR : Boolean := False;
-- unspecified
Reserved_11_15 : HAL.UInt5 := 16#0#;
MON_EN : Boolean := False;
MON_PEND : Boolean := False;
MON_STEP : Boolean := False;
MON_REQ : Boolean := False;
-- unspecified
Reserved_20_23 : HAL.UInt4 := 16#0#;
TRCENA : Boolean := False;
-- unspecified
Reserved_25_31 : HAL.UInt7 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DEMCR_Register use record
VC_CORERESET at 0 range 0 .. 0;
Reserved_1_3 at 0 range 1 .. 3;
VC_MMERR at 0 range 4 .. 4;
VC_NOCPERR at 0 range 5 .. 5;
VC_CHKERR at 0 range 6 .. 6;
VC_STATERR at 0 range 7 .. 7;
VC_BUSERR at 0 range 8 .. 8;
VC_INTERR at 0 range 9 .. 9;
VC_HARDERR at 0 range 10 .. 10;
Reserved_11_15 at 0 range 11 .. 15;
MON_EN at 0 range 16 .. 16;
MON_PEND at 0 range 17 .. 17;
MON_STEP at 0 range 18 .. 18;
MON_REQ at 0 range 19 .. 19;
Reserved_20_23 at 0 range 20 .. 23;
TRCENA at 0 range 24 .. 24;
Reserved_25_31 at 0 range 25 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
type Debug_Peripheral is record
-- Debug Fault Status Register
DFSR : DFSR_Register;
-- Debug Halting Control and Status Register
DHCSR : DHCSR_Cluster;
-- Debug Core Register Selector Register: The DCRSR write-only register
-- generates a handshake to the core to transfer the selected register
-- to/from the DCRDR. The DHCSR S_REGRDY bit is cleared when the DCRSR
-- is written, and remains clear until the core transaction completes.
-- This register is only accessible from Debug state.
DCRSR : DCRSR_Register;
-- Debug Core Register Data Register
DCRDR : HAL.Word;
-- Debug Exception and Monitor Control Register
DEMCR : DEMCR_Register;
end record
with Volatile;
for Debug_Peripheral use record
DFSR at 48 range 0 .. 31;
DHCSR at 240 range 0 .. 31;
DCRSR at 244 range 0 .. 31;
DCRDR at 248 range 0 .. 31;
DEMCR at 252 range 0 .. 31;
end record;
Debug_Periph : aliased Debug_Peripheral
with Import, Address => Debug_Base;
end Cortex_M_SVD.Debug;
|
charlie5/cBound | Ada | 1,394 | ads | -- This file is generated by SWIG. Please do not modify by hand.
--
with Interfaces.C;
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_glx_get_booleanv_cookie_t is
-- Item
--
type Item is record
sequence : aliased Interfaces.C.unsigned;
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_glx_get_booleanv_cookie_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_get_booleanv_cookie_t.Item,
Element_Array => xcb.xcb_glx_get_booleanv_cookie_t.Item_Array,
Default_Terminator => (others => <>));
subtype Pointer is C_Pointers.Pointer;
-- Pointer_Array
--
type Pointer_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_glx_get_booleanv_cookie_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_get_booleanv_cookie_t.Pointer,
Element_Array => xcb.xcb_glx_get_booleanv_cookie_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_glx_get_booleanv_cookie_t;
|
clairvoyant/anagram | Ada | 15,831 | adb | -- Copyright (c) 2010-2017 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Anagram.Grammars.Scanners;
package body Anagram.Grammars.Scanner_Handler is
package T renames Ag_Tokens;
----------------------
-- Attributes_Token --
----------------------
procedure Attributes_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Rule);
begin
Skip := False;
Token := T.Attributes_Token;
Scanner.Set_Start_Condition (Anagram.Grammars.Scanner_Types.With_Regexp);
end Attributes_Token;
----------------------
-- Close_List_Token --
----------------------
procedure Close_List_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Scanner);
pragma Unreferenced (Rule);
begin
Skip := False;
Token := T.'}';
end Close_List_Token;
------------------------
-- Close_Option_Token --
------------------------
procedure Close_Option_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Scanner);
pragma Unreferenced (Rule);
begin
Skip := False;
Token := T.']';
end Close_Option_Token;
---------------------------
-- Close_Part_Name_Token --
---------------------------
procedure Close_Part_Name_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Scanner);
pragma Unreferenced (Rule);
begin
Skip := False;
Token := T.'>';
end Close_Part_Name_Token;
---------------------------------
-- Close_Production_Name_Token --
---------------------------------
procedure Close_Production_Name_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Scanner);
pragma Unreferenced (Rule);
begin
Skip := False;
Token := T.')';
end Close_Production_Name_Token;
----------------------
-- Close_Rule_Token --
----------------------
procedure Close_Rule_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Scanner);
pragma Unreferenced (Rule);
begin
Skip := False;
Token := T.Close_Rule_Token;
end Close_Rule_Token;
-----------------
-- Colon_Token --
-----------------
procedure Colon_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Scanner);
pragma Unreferenced (Rule);
begin
Skip := False;
Token := T.':';
end Colon_Token;
-----------------
-- Comma_Token --
-----------------
procedure Comma_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Scanner);
pragma Unreferenced (Rule);
begin
Skip := False;
Token := T.',';
end Comma_Token;
-----------------
-- Equal_Token --
-----------------
procedure Equal_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Rule);
begin
Skip := False;
Token := T.Equal_Token;
Scanner.Set_Start_Condition (Anagram.Grammars.Scanner_Types.INITIAL);
end Equal_Token;
---------------
-- Get_Line --
---------------
function Get_Line (Self : Handler) return Positive is
begin
return Self.Line;
end Get_Line;
----------------------
-- Identifier_Token --
----------------------
procedure Identifier_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Scanner);
pragma Unreferenced (Rule);
begin
Skip := False;
Token := T.Identifier_Token;
end Identifier_Token;
---------------------
-- Inherited_Token --
---------------------
procedure Inherited_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Scanner);
pragma Unreferenced (Rule);
begin
Skip := False;
Token := T.Inherited_Token;
end Inherited_Token;
-------------------
-- Integer_Token --
-------------------
procedure Integer_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Scanner);
pragma Unreferenced (Rule);
begin
Skip := False;
Token := T.Integer_Token;
end Integer_Token;
-----------------
-- Local_Token --
-----------------
procedure Local_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Scanner);
pragma Unreferenced (Rule);
begin
Skip := False;
Token := T.Local_Token;
end Local_Token;
--------------
-- New_Line --
--------------
procedure New_Line
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Token);
pragma Unreferenced (Rule);
begin
Self.Line := Self.Line + Scanner.Get_Token_Length;
Skip := True;
end New_Line;
---------------------
-- Open_List_Token --
---------------------
procedure Open_List_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Scanner);
pragma Unreferenced (Rule);
begin
Skip := False;
Token := T.'{';
end Open_List_Token;
-----------------------
-- Open_Option_Token --
-----------------------
procedure Open_Option_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Scanner);
pragma Unreferenced (Rule);
begin
Skip := False;
Token := T.'[';
end Open_Option_Token;
--------------------------
-- Open_Part_Name_Token --
--------------------------
procedure Open_Part_Name_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Scanner);
pragma Unreferenced (Rule);
begin
Skip := False;
Token := T.'<';
end Open_Part_Name_Token;
--------------------------------
-- Open_Production_Name_Token --
--------------------------------
procedure Open_Production_Name_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Scanner);
pragma Unreferenced (Rule);
begin
Skip := False;
Token := T.'(';
end Open_Production_Name_Token;
---------------------
-- Open_Rule_Token --
---------------------
procedure Open_Rule_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Rule);
begin
Skip := False;
Token := T.Open_Rule_Token;
Scanner.Set_Start_Condition (Anagram.Grammars.Scanner_Types.In_Rule);
end Open_Rule_Token;
--------------
-- Or_Token --
--------------
procedure Or_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Scanner);
pragma Unreferenced (Rule);
begin
Skip := False;
Token := T.'|';
end Or_Token;
--------------------
-- Priority_Token --
--------------------
procedure Priority_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Scanner);
pragma Unreferenced (Rule);
begin
Skip := False;
Token := T.Priority_Token;
end Priority_Token;
------------------
-- Regexp_Token --
------------------
procedure Regexp_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Scanner);
pragma Unreferenced (Rule);
begin
Skip := False;
Token := T.Regexp_Token;
end Regexp_Token;
---------------------
-- Rule_Body_Token --
---------------------
procedure Rule_Body_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Rule);
begin
Skip := False;
Token := T.Rule_Body_Token;
Scanner.Set_Start_Condition (Anagram.Grammars.Scanner_Types.INITIAL);
end Rule_Body_Token;
-----------------
-- Rules_Token --
-----------------
procedure Rules_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Rule);
pragma Unreferenced (Scanner);
begin
Skip := False;
Token := T.Rules_Token;
end Rules_Token;
---------------------
-- Semicolon_Token --
---------------------
procedure Semicolon_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Rule);
begin
Skip := False;
Token := T.';';
Scanner.Set_Start_Condition (Anagram.Grammars.Scanner_Types.With_Regexp);
end Semicolon_Token;
-----------------------
-- Synthesized_Token --
-----------------------
procedure Synthesized_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Scanner);
pragma Unreferenced (Rule);
begin
Skip := False;
Token := T.Synthesized_Token;
end Synthesized_Token;
-----------------
-- Token_Token --
-----------------
procedure Token_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Scanner);
pragma Unreferenced (Rule);
begin
Skip := False;
Token := T.Token_Token;
end Token_Token;
----------------
-- With_Token --
----------------
procedure With_Token
(Self : not null access Handler;
Scanner : not null access Anagram.Grammars.Scanners.Scanner'Class;
Rule : Anagram.Grammars.Scanner_Types.Rule_Index;
Token : out Ag_Tokens.Token;
Skip : in out Boolean)
is
pragma Unreferenced (Self);
pragma Unreferenced (Scanner);
pragma Unreferenced (Rule);
begin
Skip := False;
Token := T.With_Token;
end With_Token;
end Anagram.Grammars.Scanner_Handler;
|
stcarrez/ada-asf | Ada | 1,148 | ads | -----------------------------------------------------------------------
-- asf-principals -- Component and tag factory
-- Copyright (C) 2011, 2012 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- 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 Security;
package ASF.Principals is
-- ------------------------------
-- Principal
-- ------------------------------
subtype Principal is Security.Principal;
subtype Principal_Access is Security.Principal_Access;
end ASF.Principals;
|
msrLi/portingSources | Ada | 773 | ads | -- Copyright 2012-2014 Free Software Foundation, Inc.
--
-- This program 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.
--
-- This program 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 this program. If not, see <http://www.gnu.org/licenses/>.
package IO is
procedure Put_Line (S : String);
end IO;
|
zhmu/ananas | Ada | 423 | ads | generic
package Predicate6 is
type Price_Kind is (Infinitely_Small, Normal, Infinitely_Large);
subtype Infinite_Kind is Price_Kind with Static_Predicate =>
Infinite_Kind in Infinitely_Small | Infinitely_Large;
function "not" (Kind : Infinite_Kind) return Infinite_Kind is
(case Kind is when Infinitely_Small => Infinitely_Large,
when Infinitely_Large => Infinitely_Small);
procedure Foo;
end;
|
reznikmm/matreshka | Ada | 3,639 | ads | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Open Document Toolkit --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2014, Vadim Godunko <[email protected]> --
-- 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 XML.DOM.Elements;
package ODF.DOM.Text_Tab_Elements is
pragma Preelaborate;
type ODF_Text_Tab is limited interface
and XML.DOM.Elements.DOM_Element;
type ODF_Text_Tab_Access is
access all ODF_Text_Tab'Class
with Storage_Size => 0;
end ODF.DOM.Text_Tab_Elements;
|
mirror/ncurses | Ada | 3,635 | adb | ------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding --
-- --
-- Terminal_Interface.Curses.Forms.Field_Types.IPV4_Address --
-- --
-- B O D Y --
-- --
------------------------------------------------------------------------------
-- Copyright 2020 Thomas E. Dickey --
-- Copyright 1999-2011,2014 Free Software Foundation, Inc. --
-- --
-- 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, distribute with modifications, 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 ABOVE 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. --
-- --
-- Except as contained in this notice, the name(s) of the above copyright --
-- holders shall not be used in advertising or otherwise to promote the --
-- sale, use or other dealings in this Software without prior written --
-- authorization. --
------------------------------------------------------------------------------
-- Author: Juergen Pfeifer, 1996
-- Version Control:
-- $Revision: 1.14 $
-- $Date: 2020/02/02 23:34:34 $
-- Binding Version 01.00
------------------------------------------------------------------------------
with Terminal_Interface.Curses.Aux; use Terminal_Interface.Curses.Aux;
package body Terminal_Interface.Curses.Forms.Field_Types.IPV4_Address is
procedure Set_Field_Type (Fld : Field;
Typ : Internet_V4_Address_Field)
is
function Set_Fld_Type (F : Field := Fld)
return Eti_Error;
pragma Import (C, Set_Fld_Type, "set_field_type_ipv4");
begin
Eti_Exception (Set_Fld_Type);
Wrap_Builtin (Fld, Typ);
end Set_Field_Type;
end Terminal_Interface.Curses.Forms.Field_Types.IPV4_Address;
|
ekoeppen/STM32_Generic_Ada_Drivers | Ada | 154 | ads | with IRQ;
with Ada.Interrupts.Names; use Ada.Interrupts.Names;
package Peripherals is
Handler : IRQ.Controller (USART1_Interrupt);
end Peripherals;
|
onox/orka | Ada | 11,807 | ads | -- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2017 onox <[email protected]>
--
-- 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 Orka.Rendering.Buffers.Pointers;
package Orka.Rendering.Buffers.Mapped is
pragma Preelaborate;
type IO_Mode is (Read, Write);
type Mapped_Buffer
(Kind : Orka.Types.Element_Type;
Mode : IO_Mode) is abstract new Bindable_Buffer with private;
overriding
function Length (Object : Mapped_Buffer) return Positive;
-- Number of elements in the buffer
-----------------------------------------------------------------------------
overriding
procedure Bind
(Object : Mapped_Buffer;
Target : Indexed_Buffer_Target;
Index : Natural);
-- Bind the buffer object to the binding point at the given index of
-- the target
overriding
procedure Bind (Object : Mapped_Buffer; Target : Buffer_Target);
-- Bind the buffer object to the target
-----------------------------------------------------------------------------
procedure Write_Data
(Object : Mapped_Buffer;
Data : Unsigned_8_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Unsigned_16_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Unsigned_32_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Integer_8_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Integer_16_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Integer_32_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Float_16_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Float_32_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Float_64_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
-----------------------------------------------------------------------------
procedure Write_Data
(Object : Mapped_Buffer;
Data : Orka.Types.Singles.Vector4_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Orka.Types.Singles.Matrix4_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Orka.Types.Doubles.Vector4_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Orka.Types.Doubles.Matrix4_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Indirect.Arrays_Indirect_Command_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Indirect.Elements_Indirect_Command_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Indirect.Dispatch_Indirect_Command_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
-----------------------------------------------------------------------------
procedure Write_Data
(Object : Mapped_Buffer;
Value : Orka.Types.Singles.Vector4;
Offset : Natural)
with Pre => Object.Mode = Write and Offset < Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Value : Orka.Types.Singles.Matrix4;
Offset : Natural)
with Pre => Object.Mode = Write and Offset < Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Value : Orka.Types.Doubles.Vector4;
Offset : Natural)
with Pre => Object.Mode = Write and Offset < Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Value : Orka.Types.Doubles.Matrix4;
Offset : Natural)
with Pre => Object.Mode = Write and Offset < Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Value : Indirect.Arrays_Indirect_Command;
Offset : Natural)
with Pre => Object.Mode = Write and Offset < Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Value : Indirect.Elements_Indirect_Command;
Offset : Natural)
with Pre => Object.Mode = Write and Offset < Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Value : Indirect.Dispatch_Indirect_Command;
Offset : Natural)
with Pre => Object.Mode = Write and Offset < Object.Length;
-----------------------------------------------------------------------------
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Unsigned_8_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Unsigned_16_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Unsigned_32_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Integer_8_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Integer_16_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Integer_32_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Float_16_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Float_32_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Float_64_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
-----------------------------------------------------------------------------
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Orka.Types.Singles.Vector4_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Orka.Types.Singles.Matrix4_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Orka.Types.Doubles.Vector4_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Orka.Types.Doubles.Matrix4_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Indirect.Arrays_Indirect_Command_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Indirect.Elements_Indirect_Command_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Indirect.Dispatch_Indirect_Command_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
private
use Orka.Types;
type Mapped_Buffer
(Kind : Orka.Types.Element_Type; Mode : IO_Mode)
is new Bindable_Buffer with record
Buffer : Buffers.Buffer (Kind);
Offset : Natural;
-- Offset in number of elements to the start of the buffer
--
-- Initially zero and incremented by Length whenever the index is
-- advanced if the buffer is mapped persistent.
case Kind is
-- Numeric types
when UByte_Type =>
Pointer_UByte : Pointers.UByte.Pointer;
when UShort_Type =>
Pointer_UShort : Pointers.UShort.Pointer;
when UInt_Type =>
Pointer_UInt : Pointers.UInt.Pointer;
when Byte_Type =>
Pointer_Byte : Pointers.Byte.Pointer;
when Short_Type =>
Pointer_Short : Pointers.Short.Pointer;
when Int_Type =>
Pointer_Int : Pointers.Int.Pointer;
when Half_Type =>
Pointer_Half : Pointers.Half.Pointer;
when Single_Type =>
Pointer_Single : Pointers.Single.Pointer;
when Double_Type =>
Pointer_Double : Pointers.Double.Pointer;
-- Composite types
when Single_Vector_Type =>
Pointer_SV : Pointers.Single_Vector4.Pointer;
when Double_Vector_Type =>
Pointer_DV : Pointers.Double_Vector4.Pointer;
when Single_Matrix_Type =>
Pointer_SM : Pointers.Single_Matrix4.Pointer;
when Double_Matrix_Type =>
Pointer_DM : Pointers.Double_Matrix4.Pointer;
when Arrays_Command_Type =>
Pointer_AC : Pointers.Arrays_Command.Pointer;
when Elements_Command_Type =>
Pointer_EC : Pointers.Elements_Command.Pointer;
when Dispatch_Command_Type =>
Pointer_DC : Pointers.Dispatch_Command.Pointer;
end case;
end record;
procedure Map
(Object : in out Mapped_Buffer;
Length : Size;
Flags : GL.Objects.Buffers.Access_Bits);
end Orka.Rendering.Buffers.Mapped;
|
luk9400/nsi | Ada | 139 | adb | with Ada.Text_IO;
with Primes;
procedure Main is
N : Positive := 16;
begin
Ada.Text_IO.Put_Line (Primes.IsPrime (N)'Image);
end Main;
|
stcarrez/ada-ado | Ada | 15,472 | adb | -----------------------------------------------------------------------
-- Regtests.Images.Model -- Regtests.Images.Model
-----------------------------------------------------------------------
-- File generated by Dynamo DO NOT MODIFY
-- Template used: templates/model/package-body.xhtml
-- Ada Generator: https://github.com/stcarrez/dynamo Version 1.4.0
-----------------------------------------------------------------------
-- Copyright (C) 2022 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- 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.
-----------------------------------------------------------------------
pragma Warnings (Off);
with Ada.Unchecked_Deallocation;
with Util.Beans.Objects.Time;
pragma Warnings (On);
package body Regtests.Images.Model is
pragma Style_Checks ("-mrIu");
pragma Warnings (Off, "formal parameter * is not referenced");
pragma Warnings (Off, "use clause for type *");
pragma Warnings (Off, "use clause for private type *");
use type ADO.Objects.Object_Record_Access;
use type ADO.Objects.Object_Ref;
function Image_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key is
Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER,
Of_Class => IMAGE_DEF'Access);
begin
ADO.Objects.Set_Value (Result, Id);
return Result;
end Image_Key;
function Image_Key (Id : in String) return ADO.Objects.Object_Key is
Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER,
Of_Class => IMAGE_DEF'Access);
begin
ADO.Objects.Set_Value (Result, Id);
return Result;
end Image_Key;
function "=" (Left, Right : Image_Ref'Class) return Boolean is
begin
return ADO.Objects.Object_Ref'Class (Left) = ADO.Objects.Object_Ref'Class (Right);
end "=";
procedure Set_Field (Object : in out Image_Ref'Class;
Impl : out Image_Access) is
Result : ADO.Objects.Object_Record_Access;
begin
Object.Prepare_Modify (Result);
Impl := Image_Impl (Result.all)'Access;
end Set_Field;
-- Internal method to allocate the Object_Record instance
overriding
procedure Allocate (Object : in out Image_Ref) is
Impl : Image_Access;
begin
Impl := new Image_Impl;
Impl.Version := 0;
Impl.Create_Date := ADO.DEFAULT_TIME;
ADO.Objects.Set_Object (Object, Impl.all'Access);
end Allocate;
-- ----------------------------------------
-- Data object: Image
-- ----------------------------------------
procedure Set_Id (Object : in out Image_Ref;
Value : in ADO.Identifier) is
Impl : Image_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Key_Value (Impl.all, 1, Value);
end Set_Id;
function Get_Id (Object : in Image_Ref)
return ADO.Identifier is
Impl : constant Image_Access
:= Image_Impl (Object.Get_Object.all)'Access;
begin
return Impl.Get_Key_Value;
end Get_Id;
function Get_Version (Object : in Image_Ref)
return Integer is
Impl : constant Image_Access
:= Image_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Version;
end Get_Version;
procedure Set_Create_Date (Object : in out Image_Ref;
Value : in Ada.Calendar.Time) is
Impl : Image_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Time (Impl.all, 3, Impl.Create_Date, Value);
end Set_Create_Date;
function Get_Create_Date (Object : in Image_Ref)
return Ada.Calendar.Time is
Impl : constant Image_Access
:= Image_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Create_Date;
end Get_Create_Date;
procedure Set_Image (Object : in out Image_Ref;
Value : in ADO.Blob_Ref) is
Impl : Image_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Blob (Impl.all, 4, Impl.Image, Value);
end Set_Image;
function Get_Image (Object : in Image_Ref)
return ADO.Blob_Ref is
Impl : constant Image_Access
:= Image_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Image;
end Get_Image;
-- Copy of the object.
procedure Copy (Object : in Image_Ref;
Into : in out Image_Ref) is
Result : Image_Ref;
begin
if not Object.Is_Null then
declare
Impl : constant Image_Access
:= Image_Impl (Object.Get_Load_Object.all)'Access;
Copy : constant Image_Access
:= new Image_Impl;
begin
ADO.Objects.Set_Object (Result, Copy.all'Access);
Copy.Copy (Impl.all);
Copy.Version := Impl.Version;
Copy.Create_Date := Impl.Create_Date;
Copy.Image := Impl.Image;
end;
end if;
Into := Result;
end Copy;
overriding
procedure Find (Object : in out Image_Ref;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean) is
Impl : constant Image_Access := new Image_Impl;
begin
Impl.Find (Session, Query, Found);
if Found then
ADO.Objects.Set_Object (Object, Impl.all'Access);
else
ADO.Objects.Set_Object (Object, null);
Destroy (Impl);
end if;
end Find;
procedure Load (Object : in out Image_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier) is
Impl : constant Image_Access := new Image_Impl;
Found : Boolean;
Query : ADO.SQL.Query;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("id = ?");
Impl.Find (Session, Query, Found);
if not Found then
Destroy (Impl);
raise ADO.Objects.NOT_FOUND;
end if;
ADO.Objects.Set_Object (Object, Impl.all'Access);
end Load;
procedure Load (Object : in out Image_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier;
Found : out Boolean) is
Impl : constant Image_Access := new Image_Impl;
Query : ADO.SQL.Query;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("id = ?");
Impl.Find (Session, Query, Found);
if not Found then
Destroy (Impl);
else
ADO.Objects.Set_Object (Object, Impl.all'Access);
end if;
end Load;
procedure Reload (Object : in out Image_Ref;
Session : in out ADO.Sessions.Session'Class;
Updated : out Boolean) is
Result : ADO.Objects.Object_Record_Access;
Impl : Image_Access;
Query : ADO.SQL.Query;
Id : ADO.Identifier;
begin
if Object.Is_Null then
raise ADO.Objects.NULL_ERROR;
end if;
Object.Prepare_Modify (Result);
Impl := Image_Impl (Result.all)'Access;
Id := ADO.Objects.Get_Key_Value (Impl.all);
Query.Bind_Param (Position => 1, Value => Id);
Query.Bind_Param (Position => 2, Value => Impl.Version);
Query.Set_Filter ("id = ? AND version != ?");
declare
Stmt : ADO.Statements.Query_Statement
:= Session.Create_Statement (Query, IMAGE_DEF'Access);
begin
Stmt.Execute;
if Stmt.Has_Elements then
Updated := True;
Impl.Load (Stmt, Session);
else
Updated := False;
end if;
end;
end Reload;
overriding
procedure Save (Object : in out Image_Ref;
Session : in out ADO.Sessions.Master_Session'Class) is
Impl : ADO.Objects.Object_Record_Access := Object.Get_Object;
begin
if Impl = null then
Impl := new Image_Impl;
ADO.Objects.Set_Object (Object, Impl);
end if;
if not ADO.Objects.Is_Created (Impl.all) then
Impl.Create (Session);
else
Impl.Save (Session);
end if;
end Save;
overriding
procedure Delete (Object : in out Image_Ref;
Session : in out ADO.Sessions.Master_Session'Class) is
Impl : constant ADO.Objects.Object_Record_Access := Object.Get_Object;
begin
if Impl /= null then
Impl.Delete (Session);
end if;
end Delete;
-- --------------------
-- Free the object
-- --------------------
overriding
procedure Destroy (Object : access Image_Impl) is
type Image_Impl_Ptr is access all Image_Impl;
procedure Unchecked_Free is new Ada.Unchecked_Deallocation
(Image_Impl, Image_Impl_Ptr);
pragma Warnings (Off, "*redundant conversion*");
Ptr : Image_Impl_Ptr := Image_Impl (Object.all)'Access;
pragma Warnings (On, "*redundant conversion*");
begin
Unchecked_Free (Ptr);
end Destroy;
overriding
procedure Find (Object : in out Image_Impl;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean) is
Stmt : ADO.Statements.Query_Statement
:= Session.Create_Statement (Query, IMAGE_DEF'Access);
begin
Stmt.Execute;
if Stmt.Has_Elements then
Object.Load (Stmt, Session);
Stmt.Next;
Found := not Stmt.Has_Elements;
else
Found := False;
end if;
end Find;
overriding
procedure Load (Object : in out Image_Impl;
Session : in out ADO.Sessions.Session'Class) is
Found : Boolean;
Query : ADO.SQL.Query;
Id : constant ADO.Identifier := Object.Get_Key_Value;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("id = ?");
Object.Find (Session, Query, Found);
if not Found then
raise ADO.Objects.NOT_FOUND;
end if;
end Load;
overriding
procedure Save (Object : in out Image_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Stmt : ADO.Statements.Update_Statement
:= Session.Create_Statement (IMAGE_DEF'Access);
begin
if Object.Is_Modified (1) then
Stmt.Save_Field (Name => COL_0_1_NAME, -- id
Value => Object.Get_Key);
Object.Clear_Modified (1);
end if;
if Object.Is_Modified (4) then
Stmt.Save_Field (Name => COL_3_1_NAME, -- image
Value => Object.Image);
Object.Clear_Modified (4);
end if;
if Stmt.Has_Save_Fields then
Object.Version := Object.Version + 1;
Stmt.Save_Field (Name => "version",
Value => Object.Version);
Stmt.Set_Filter (Filter => "id = ? and version = ?");
Stmt.Add_Param (Value => Object.Get_Key);
Stmt.Add_Param (Value => Object.Version - 1);
declare
Result : Integer;
begin
Stmt.Execute (Result);
if Result /= 1 then
if Result /= 0 then
raise ADO.Objects.UPDATE_ERROR;
else
raise ADO.Objects.LAZY_LOCK;
end if;
end if;
end;
end if;
end Save;
overriding
procedure Create (Object : in out Image_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Query : ADO.Statements.Insert_Statement
:= Session.Create_Statement (IMAGE_DEF'Access);
Result : Integer;
begin
Object.Version := 1;
Session.Allocate (Id => Object);
Query.Save_Field (Name => COL_0_1_NAME, -- id
Value => Object.Get_Key);
Query.Save_Field (Name => COL_1_1_NAME, -- version
Value => Object.Version);
Query.Save_Field (Name => COL_2_1_NAME, -- create_date
Value => Object.Create_Date);
Query.Save_Field (Name => COL_3_1_NAME, -- image
Value => Object.Image);
Query.Execute (Result);
if Result /= 1 then
raise ADO.Objects.INSERT_ERROR;
end if;
ADO.Objects.Set_Created (Object);
end Create;
overriding
procedure Delete (Object : in out Image_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Stmt : ADO.Statements.Delete_Statement
:= Session.Create_Statement (IMAGE_DEF'Access);
begin
Stmt.Set_Filter (Filter => "id = ?");
Stmt.Add_Param (Value => Object.Get_Key);
Stmt.Execute;
end Delete;
-- ------------------------------
-- Get the bean attribute identified by the name.
-- ------------------------------
overriding
function Get_Value (From : in Image_Ref;
Name : in String) return Util.Beans.Objects.Object is
Obj : ADO.Objects.Object_Record_Access;
Impl : access Image_Impl;
begin
if From.Is_Null then
return Util.Beans.Objects.Null_Object;
end if;
Obj := From.Get_Load_Object;
Impl := Image_Impl (Obj.all)'Access;
if Name = "id" then
return ADO.Objects.To_Object (Impl.Get_Key);
elsif Name = "create_date" then
return Util.Beans.Objects.Time.To_Object (Impl.Create_Date);
end if;
return Util.Beans.Objects.Null_Object;
end Get_Value;
procedure List (Object : in out Image_Vector;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class) is
Stmt : ADO.Statements.Query_Statement
:= Session.Create_Statement (Query, IMAGE_DEF'Access);
begin
Stmt.Execute;
Image_Vectors.Clear (Object);
while Stmt.Has_Elements loop
declare
Item : Image_Ref;
Impl : constant Image_Access := new Image_Impl;
begin
Impl.Load (Stmt, Session);
ADO.Objects.Set_Object (Item, Impl.all'Access);
Object.Append (Item);
end;
Stmt.Next;
end loop;
end List;
-- ------------------------------
-- Load the object from current iterator position
-- ------------------------------
procedure Load (Object : in out Image_Impl;
Stmt : in out ADO.Statements.Query_Statement'Class;
Session : in out ADO.Sessions.Session'Class) is
pragma Unreferenced (Session);
begin
Object.Set_Key_Value (Stmt.Get_Identifier (0));
Object.Create_Date := Stmt.Get_Time (2);
Object.Image := Stmt.Get_Blob (3);
Object.Version := Stmt.Get_Integer (1);
ADO.Objects.Set_Created (Object);
end Load;
end Regtests.Images.Model;
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.