repo_name
stringlengths 9
74
| language
stringclasses 1
value | length_bytes
int64 11
9.34M
| extension
stringclasses 2
values | content
stringlengths 11
9.34M
|
|---|---|---|---|---|
hbarrientosg/cs-mp | Ada | 1,176 | adb | separate(Practica6)
procedure Extraer (L: in out Lista; V: in Integer) is
aux:Pnodo;
begin
aux := l.Inicio;
while Aux.info /= V loop
Aux := aux.siguiente;
if aux = null then
return;-- si llega al final de la lista y no lo ha encontrado sale de procedimiento
end if;
end loop;
-- si salgo es que encontrado elemento
if aux /= null then
if L.numelem = 1 then
-- si es el unico elemento vacio los punteros
L.inicio := null;
L.fin := Null;
else
if l.inicio = Aux then
--si es el primero el puntero inicio pasa al siguiente
l.inicio := aux.siguiente;
Aux.Anterior := null;
else
if l.fin = Aux then
-- si es el ultimo el puntero fin pasa al penultimo
l.fin := aux.Anterior;
Aux.siguiente := null;
else
--si esta en medio de la lista pues el anterio tendra que
--apuntar al siguiente que estoy apuntando
--y el otro tiene que apuntar al anterior
Aux.anterior.siguiente := Aux.siguiente;
Aux.siguiente.Anterior := aux.anterior;
end if;
end if;
end if;
l.NumElem := L.NumElem - 1;
-- decremento
liberar(Aux);
-- libero el elemento encontrado
end if;
return;
end Extraer;
|
reznikmm/matreshka | Ada | 3,714 | 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.Smil_Accelerate_Attributes is
pragma Preelaborate;
type ODF_Smil_Accelerate_Attribute is limited interface
and XML.DOM.Attributes.DOM_Attribute;
type ODF_Smil_Accelerate_Attribute_Access is
access all ODF_Smil_Accelerate_Attribute'Class
with Storage_Size => 0;
end ODF.DOM.Smil_Accelerate_Attributes;
|
AdaCore/gpr | Ada | 1,917 | adb | --
-- Copyright (C) 2019-2023, AdaCore
--
-- SPDX-License-Identifier: Apache-2.0
--
with Ada.Directories;
with Ada.Text_IO;
with Ada.Strings.Fixed;
with GPR2.Context;
with GPR2.Log;
with GPR2.Message;
with GPR2.Project.View;
with GPR2.Project.Tree;
with GPR2.Project.Attribute.Set;
with GPR2.Project.Variable.Set;
procedure Main is
use Ada;
use GPR2;
use GPR2.Project;
use type GPR2.Message.Level_Value;
procedure Display (Prj : Project.View.Object);
Prj : Project.Tree.Object;
Ctx : Context.Object;
-------------
-- Display --
-------------
procedure Display (Prj : Project.View.Object) is
begin
Text_IO.Put (String (Prj.Name) & " ");
Text_IO.Set_Col (10);
Text_IO.Put_Line (Prj.Qualifier'Img);
Text_IO.Put_Line (Image (Prj.Kind));
end Display;
--------------------
-- Print_Messages --
--------------------
procedure Print_Messages is
begin
if Prj.Log_Messages.Has_Element
(Information => False, Lint => False)
then
Text_IO.Put_Line ("Messages found:");
for M in Prj.Log_Messages.Iterate (Information => False) loop
declare
Mes : constant String := GPR2.Log.Element (M).Format;
L : constant Natural :=
Strings.Fixed.Index (Mes, "/demo");
begin
if L /= 0 then
Text_IO.Put_Line (Mes (L .. Mes'Last));
else
Text_IO.Put_Line (Mes);
end if;
end;
end loop;
end if;
end Print_Messages;
begin
Project.Tree.Load (Prj, Create ("demo.gpr"), Ctx);
Print_Messages;
-- Iterator
for P of Prj loop
Display (P);
end loop;
Prj.Unload;
Project.Tree.Load (Prj, Create ("demo2.gpr"), Ctx);
Print_Messages;
exception
when GPR2.Project_Error =>
Print_Messages;
end Main;
|
AdaCore/langkit | Ada | 562 | ads | --
-- Copyright (C) 2014-2022, AdaCore
-- SPDX-License-Identifier: Apache-2.0
--
-- Provide miscellaneous types to Langkit-generated libraries
with Interfaces;
package Langkit_Support.Types is
type Version_Number is new Interfaces.Unsigned_64;
-- Number associated to a resource. This number is supposed to be unique
-- for some class of resource. For instance unique in all analysis contexts
-- a process creates.
type Comparison_Relation is
(Less_Than, Less_Or_Equal, Greater_Than, Greater_Or_Equal);
end Langkit_Support.Types;
|
tum-ei-rcs/StratoX | Ada | 1,663 | ads | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . N U M E R I C S --
-- --
-- S p e c --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. In accordance with the copyright of that document, you can freely --
-- copy and modify this specification, provided that if you redistribute a --
-- modified version, any changes that you have made are clearly indicated. --
-- --
------------------------------------------------------------------------------
package Ada.Numerics with SPARK_Mode is
pragma Pure;
Argument_Error : exception;
Pi : constant :=
3.14159_26535_89793_23846_26433_83279_50288_41971_69399_37511;
["03C0"] : constant := Pi;
-- This is the Greek letter Pi (for Ada 2005 AI-388). Note that it is
-- conforming to have this constant present even in Ada 95 mode, as there
-- is no way for a normal mode Ada 95 program to reference this identifier.
e : constant :=
2.71828_18284_59045_23536_02874_71352_66249_77572_47093_69996;
end Ada.Numerics;
|
sonneveld/adazmq | Ada | 1,051 | adb | -- Simple message queuing broker
-- Same as request-reply broker but using shared queue proxy
with Ada.Command_Line;
with Ada.Text_IO;
with GNAT.Formatted_String;
with Ada.Calendar;
with ZMQ;
procedure MsgQueue is
use type Ada.Calendar.Time;
use type GNAT.Formatted_String.Formatted_String;
function Main return Ada.Command_Line.Exit_Status
is
begin
declare
Context : ZMQ.Context_Type := ZMQ.New_Context;
-- Socket facing clients
Frontend : ZMQ.Socket_Type'Class := Context.New_Socket (ZMQ.ZMQ_ROUTER);
-- Socket facing services
Backend : ZMQ.Socket_Type'Class := Context.New_Socket (ZMQ.ZMQ_DEALER);
begin
Frontend.Bind ("tcp://*:5559");
Backend.Bind ("tcp://*:5560");
-- Start the proxy
ZMQ.Proxy (Frontend, Backend);
-- We never get here...
Backend.Close;
Frontend.Close;
Context.Term;
end;
return 0;
end Main;
begin
Ada.Command_Line.Set_Exit_Status (Main);
end MsgQueue;
|
io7m/coreland-openal-ada | Ada | 24,386 | adb | with OpenAL.Thin;
with OpenAL.ALC_Thin;
package body OpenAL.Extension.EFX is
--
-- Auxiliary_Effect_Slot_Is_Valid
--
function Auxiliary_Effect_Slot_Is_Valid
(Extension : in Extension_t;
Slot : in Auxiliary_Effect_Slot_t) return Boolean is
begin
Check_Loaded (Extension);
return Boolean
(Extension.API.Is_Auxiliary_Effect_Slot (Types.Unsigned_Integer_t (Slot)));
end Auxiliary_Effect_Slot_Is_Valid;
--
-- Check_Loaded
--
use type Context.Context_t;
procedure Check_Loaded (Extension : in Extension_t) is
begin
if Extension.Loaded = False then
raise Program_Error with "extension not loaded";
end if;
if Extension.Owner_Context /= Context.Get_Current_Context then
raise Program_Error with "extension was not loaded in the current context";
end if;
end Check_Loaded;
--
-- Delete_*
--
procedure Delete_Auxiliary_Effect_Slots
(Extension : in Extension_t;
Slots : in Auxiliary_Effect_Slot_Array_t) is
begin
Check_Loaded (Extension);
Extension.API.Delete_Auxiliary_Effect_Slots
(Size => Slots'Length,
Slots => Slots (Slots'First)'Address);
end Delete_Auxiliary_Effect_Slots;
procedure Delete_Effects
(Extension : in Extension_t;
Effects : in Effect_Array_t) is
begin
Check_Loaded (Extension);
Extension.API.Delete_Effects
(Size => Effects'Length,
Effects => Effects (Effects'First)'Address);
end Delete_Effects;
procedure Delete_Filters
(Extension : in Extension_t;
Filters : in Filter_Array_t) is
begin
Check_Loaded (Extension);
Extension.API.Delete_Filters
(Size => Filters'Length,
Filters => Filters (Filters'First)'Address);
end Delete_Filters;
--
-- Effect_Is_Valid
--
function Effect_Is_Valid
(Extension : in Extension_t;
Effect : in Effect_t) return Boolean is
begin
Check_Loaded (Extension);
return Boolean (Extension.API.Is_Effect (Types.Unsigned_Integer_t (Effect)));
end Effect_Is_Valid;
--
-- Filter_Is_Valid
--
function Filter_Is_Valid
(Extension : in Extension_t;
Filter : in Filter_t) return Boolean is
begin
Check_Loaded (Extension);
return Boolean (Extension.API.Is_Filter (Types.Unsigned_Integer_t (Filter)));
end Filter_Is_Valid;
--
-- Generate_*
--
procedure Generate_Auxiliary_Effect_Slots
(Extension : in Extension_t;
Slots : in out Auxiliary_Effect_Slot_Array_t) is
begin
Check_Loaded (Extension);
Extension.API.Gen_Auxiliary_Effect_Slots
(Size => Slots'Length,
Slots => Slots (Slots'First)'Address);
end Generate_Auxiliary_Effect_Slots;
procedure Generate_Effects
(Extension : in Extension_t;
Effects : in out Effect_Array_t) is
begin
Check_Loaded (Extension);
Extension.API.Gen_Effects
(Size => Effects'Length,
Effects => Effects (Effects'First)'Address);
end Generate_Effects;
procedure Generate_Filters
(Extension : in Extension_t;
Filters : in out Filter_Array_t) is
begin
Check_Loaded (Extension);
Extension.API.Gen_Filters
(Size => Filters'Length,
Filters => Filters (Filters'First)'Address);
end Generate_Filters;
--
-- Get_Effect_Type
--
function Get_Effect_Type
(Extension : in Extension_t;
Effect : in Effect_t) return Effect_Type_t
is
Effect_Type : aliased Types.Integer_t;
begin
Check_Loaded (Extension);
Extension.API.Get_Effecti
(Effect => Types.Unsigned_Integer_t (Effect),
Parameter => EFX_Thin.AL_EFFECT_TYPE,
Value => Effect_Type'Address);
return Map_To_Effect_Type (Effect_Type);
end Get_Effect_Type;
--
-- Get_Filter_Type
--
function Get_Filter_Type
(Extension : in Extension_t;
Filter : in Filter_t) return Filter_Type_t
is
Filter_Type : aliased Types.Integer_t;
begin
Check_Loaded (Extension);
Extension.API.Get_Filteri
(Filter => Types.Unsigned_Integer_t (Filter),
Parameter => EFX_Thin.AL_FILTER_TYPE,
Value => Filter_Type'Address);
return Map_To_Filter_Type (Filter_Type);
end Get_Filter_Type;
--
-- Get_Major_Version
--
function Get_Major_Version
(Extension : in Extension_t) return Natural
is
Value : aliased Types.Integer_t := 0;
begin
Check_Loaded (Extension);
ALC_Thin.Get_Integerv
(Device => Context.Device_Data (Context.Get_Context_Device (Extension.Owner_Context)),
Token => EFX_Thin.ALC_EFX_MAJOR_VERSION,
Size => 1,
Data => Value'Address);
return Natural (Value);
end Get_Major_Version;
--
-- Get_Maximum_Auxiliary_Sends
--
function Get_Maximum_Auxiliary_Sends
(Extension : in Extension_t) return Source_Auxiliary_Send_t
is
Value : aliased Types.Integer_t := 0;
begin
Check_Loaded (Extension);
ALC_Thin.Get_Integerv
(Device => Context.Device_Data (Context.Get_Context_Device (Extension.Owner_Context)),
Token => EFX_Thin.ALC_MAX_AUXILIARY_SENDS,
Size => 1,
Data => Value'Address);
return Source_Auxiliary_Send_t (Value);
end Get_Maximum_Auxiliary_Sends;
--
-- Get_Minor_Version
--
function Get_Minor_Version
(Extension : in Extension_t) return Natural
is
Value : aliased Types.Integer_t := 0;
begin
Check_Loaded (Extension);
ALC_Thin.Get_Integerv
(Device => Context.Device_Data (Context.Get_Context_Device (Extension.Owner_Context)),
Token => EFX_Thin.ALC_EFX_MAJOR_VERSION,
Size => 1,
Data => Value'Address);
return Natural (Value);
end Get_Minor_Version;
--
-- Is_Present
--
function Is_Present (Device : in Context.Device_t) return Boolean is
begin
return Context.Is_Extension_Present
(Device => Device,
Name => "ALC_EXT_EFX");
end Is_Present;
--
-- Load_Extension
--
function Load_Extension return Extension_t is
Current_Context : Context.Context_t;
begin
Current_Context := Context.Get_Current_Context;
if Current_Context = Context.Invalid_Context then
raise Program_Error with "no current context";
end if;
return Extension_t'
(Owner_Context => Current_Context,
API => EFX_Thin.Load_API,
Loaded => True);
end Load_Extension;
--
-- Map_To_Effect_Type
--
function Map_To_Effect_Type (Effect_Type : in Types.Integer_t) return Effect_Type_t is
Value : Effect_Type_t;
begin
case Effect_Type is
when EFX_Thin.AL_EFFECT_NULL => Value := Null_Effect;
when EFX_Thin.AL_EFFECT_REVERB => Value := Reverb;
when EFX_Thin.AL_EFFECT_CHORUS => Value := Chorus;
when EFX_Thin.AL_EFFECT_DISTORTION => Value := Distortion;
when EFX_Thin.AL_EFFECT_ECHO => Value := Echo;
when EFX_Thin.AL_EFFECT_FLANGER => Value := Flanger;
when EFX_Thin.AL_EFFECT_FREQUENCY_SHIFTER => Value := Frequency_Shifter;
when EFX_Thin.AL_EFFECT_VOCAL_MORPHER => Value := Vocal_Morpher;
when EFX_Thin.AL_EFFECT_PITCH_SHIFTER => Value := Pitch_Shifter;
when EFX_Thin.AL_EFFECT_RING_MODULATOR => Value := Ring_Modulator;
when EFX_Thin.AL_EFFECT_AUTOWAH => Value := Autowah;
when EFX_Thin.AL_EFFECT_COMPRESSOR => Value := Compressor;
when EFX_Thin.AL_EFFECT_EQUALIZER => Value := Equalizer;
when EFX_Thin.AL_EFFECT_EAXREVERB => Value := EAX_Reverb;
when others => Value := Unknown_Effect;
end case;
return Value;
end Map_To_Effect_Type;
--
-- Map_To_Filter_Type
--
function Map_To_Filter_Type (Filter_Type : in Types.Integer_t) return Filter_Type_t is
Value : Filter_Type_t;
begin
case Filter_Type is
when EFX_Thin.AL_FILTER_NULL => Value := Null_Filter;
when EFX_Thin.AL_FILTER_LOWPASS => Value := Low_Pass_Filter;
when EFX_Thin.AL_FILTER_HIGHPASS => Value := High_Pass_Filter;
when EFX_Thin.AL_FILTER_BANDPASS => Value := Band_Pass_Filter;
when others => Value := Unknown_Filter;
end case;
return Value;
end Map_To_Filter_Type;
--
-- Set_Air_Absorption_Factor
--
procedure Set_Air_Absorption_Factor
(Extension : in Extension_t;
Source : in OpenAL.Source.Source_t;
Factor : in Air_Absorption_Factor_t) is
begin
Check_Loaded (Extension);
Thin.Sourcef
(Source_ID => OpenAL.Source.To_Integer (Source),
Parameter => EFX_Thin.AL_AIR_ABSORPTION_FACTOR,
Value => Types.Float_t (Factor));
end Set_Air_Absorption_Factor;
--
-- Set_Auxiliary_Effect_Slot_Auto_Send
--
procedure Set_Auxiliary_Effect_Slot_Auto_Send
(Extension : in Extension_t;
Slot : in Auxiliary_Effect_Slot_t;
Enable : in Boolean) is
begin
Check_Loaded (Extension);
Extension.API.Auxiliary_Effect_Sloti
(Slot => Types.Unsigned_Integer_t (Slot),
Parameter => EFX_Thin.AL_EFFECTSLOT_AUXILIARY_SEND_AUTO,
Value => Types.Integer_t (Boolean'Pos (Enable)));
end Set_Auxiliary_Effect_Slot_Auto_Send;
--
-- Set_Auxiliary_Effect_Slot_Effect
--
procedure Set_Auxiliary_Effect_Slot_Effect
(Extension : in Extension_t;
Slot : in Auxiliary_Effect_Slot_t;
Effect : in Effect_t) is
begin
Check_Loaded (Extension);
Extension.API.Auxiliary_Effect_Sloti
(Slot => Types.Unsigned_Integer_t (Slot),
Parameter => EFX_Thin.AL_EFFECTSLOT_EFFECT,
Value => Types.Integer_t (Effect));
end Set_Auxiliary_Effect_Slot_Effect;
--
-- Set_Auxiliary_Effect_Slot_Gain
--
procedure Set_Auxiliary_Effect_Slot_Gain
(Extension : in Extension_t;
Slot : in Auxiliary_Effect_Slot_t;
Gain : in Gain_t) is
begin
Check_Loaded (Extension);
Extension.API.Auxiliary_Effect_Slotf
(Slot => Types.Unsigned_Integer_t (Slot),
Parameter => EFX_Thin.AL_EFFECTSLOT_GAIN,
Value => Gain);
end Set_Auxiliary_Effect_Slot_Gain;
--
-- Set_Auxiliary_Send_Filter
--
procedure Set_Auxiliary_Send_Filter
(Extension : in Extension_t;
Source : in OpenAL.Source.Source_t;
Slot : in Auxiliary_Effect_Slot_t;
Source_Send : in Source_Auxiliary_Send_t := 0;
Filter : in Filter_t := No_Filter) is
begin
Check_Loaded (Extension);
Thin.Source_3i
(Source_ID => OpenAL.Source.To_Integer (Source),
Parameter => EFX_Thin.AL_AUXILIARY_SEND_FILTER,
Value_1 => Types.Integer_t (Slot),
Value_2 => Types.Integer_t (Source_Send),
Value_3 => Types.Integer_t (Filter));
end Set_Auxiliary_Send_Filter;
--
-- Set_Auxiliary_Send_Filter_Gain_Auto
--
procedure Set_Auxiliary_Send_Filter_Gain_Auto
(Extension : in Extension_t;
Source : in OpenAL.Source.Source_t;
Enable : in Boolean) is
begin
Check_Loaded (Extension);
Thin.Sourcei
(Source_ID => OpenAL.Source.To_Integer (Source),
Parameter => EFX_Thin.AL_AUXILIARY_SEND_FILTER_GAIN_AUTO,
Value => Types.Integer_t (Boolean'Pos (Enable)));
end Set_Auxiliary_Send_Filter_Gain_Auto;
--
-- Set_Auxiliary_Send_Filter_Gain_HF_Auto
--
procedure Set_Auxiliary_Send_Filter_Gain_HF_Auto
(Extension : in Extension_t;
Source : in OpenAL.Source.Source_t;
Enable : in Boolean) is
begin
Check_Loaded (Extension);
Thin.Sourcei
(Source_ID => OpenAL.Source.To_Integer (Source),
Parameter => EFX_Thin.AL_AUXILIARY_SEND_FILTER_GAINHF_AUTO,
Value => Types.Integer_t (Boolean'Pos (Enable)));
end Set_Auxiliary_Send_Filter_Gain_HF_Auto;
--
-- Set_Cone_Outer_Gain_HF
--
procedure Set_Cone_Outer_Gain_HF
(Extension : in Extension_t;
Source : in OpenAL.Source.Source_t;
Factor : in Cone_Outer_Gain_HF_Factor_t) is
begin
Check_Loaded (Extension);
Thin.Sourcef
(Source_ID => OpenAL.Source.To_Integer (Source),
Parameter => EFX_Thin.AL_CONE_OUTER_GAINHF,
Value => Types.Float_t (Factor));
end Set_Cone_Outer_Gain_HF;
--
-- Set_Direct_Filter
--
procedure Set_Direct_Filter
(Extension : in Extension_t;
Source : in OpenAL.Source.Source_t;
Filter : in Filter_t) is
begin
Check_Loaded (Extension);
Thin.Sourcei
(Source_ID => OpenAL.Source.To_Integer (Source),
Parameter => EFX_Thin.AL_DIRECT_FILTER,
Value => Types.Integer_t (Filter));
end Set_Direct_Filter;
--
-- Set_Direct_Filter_Gain_HF_Auto
--
procedure Set_Direct_Filter_Gain_HF_Auto
(Extension : in Extension_t;
Source : in OpenAL.Source.Source_t;
Enable : in Boolean) is
begin
Check_Loaded (Extension);
Thin.Sourcei
(Source_ID => OpenAL.Source.To_Integer (Source),
Parameter => EFX_Thin.AL_DIRECT_FILTER_GAINHF_AUTO,
Value => Types.Integer_t (Boolean'Pos (Enable)));
end Set_Direct_Filter_Gain_HF_Auto;
--
-- Set_Effect_Parameter
--
type Map_Effect_Parameter_t is array (Effect_Parameter_t) of Types.Enumeration_t;
Map_Effect_Parameter : constant Map_Effect_Parameter_t :=
(Autowah_Attack_Time => EFX_Thin.AL_AUTOWAH_ATTACK_TIME,
Autowah_Peak_Gain => EFX_Thin.AL_AUTOWAH_PEAK_GAIN,
Autowah_Release_Time => EFX_Thin.AL_AUTOWAH_RELEASE_TIME,
Autowah_Resonance => EFX_Thin.AL_AUTOWAH_RESONANCE,
Chorus_Delay => EFX_Thin.AL_CHORUS_DELAY,
Chorus_Depth => EFX_Thin.AL_CHORUS_DEPTH,
Chorus_Feedback => EFX_Thin.AL_CHORUS_FEEDBACK,
Chorus_Phase => EFX_Thin.AL_CHORUS_PHASE,
Chorus_Rate => EFX_Thin.AL_CHORUS_RATE,
Chorus_Waveform => EFX_Thin.AL_CHORUS_WAVEFORM,
Distortion_Edge => EFX_Thin.AL_DISTORTION_EDGE,
Distortion_EQ_Bandwidth => EFX_Thin.AL_DISTORTION_EQBANDWIDTH,
Distortion_EQ_Center => EFX_Thin.AL_DISTORTION_EQCENTER,
Distortion_Gain => EFX_Thin.AL_DISTORTION_GAIN,
Distortion_Lowpass_Cutoff => EFX_Thin.AL_DISTORTION_LOWPASS_CUTOFF,
EAX_Reverb_Air_Absorption_Gain_HF => EFX_Thin.AL_EAXREVERB_AIR_ABSORPTION_GAINHF,
EAX_Reverb_Decay_HF_Limit => EFX_Thin.AL_EAXREVERB_DECAY_HFLIMIT,
EAX_Reverb_Decay_HF_Ratio => EFX_Thin.AL_EAXREVERB_DECAY_HFRATIO,
EAX_Reverb_Decay_LF_Ratio => EFX_Thin.AL_EAXREVERB_DECAY_LFRATIO,
EAX_Reverb_Decay_Time => EFX_Thin.AL_EAXREVERB_DECAY_TIME,
EAX_Reverb_Density => EFX_Thin.AL_EAXREVERB_DENSITY,
EAX_Reverb_Diffusion => EFX_Thin.AL_EAXREVERB_DIFFUSION,
EAX_Reverb_Echo_Depth => EFX_Thin.AL_EAXREVERB_ECHO_DEPTH,
EAX_Reverb_Echo_Time => EFX_Thin.AL_EAXREVERB_ECHO_TIME,
EAX_Reverb_Gain => EFX_Thin.AL_EAXREVERB_GAIN,
EAX_Reverb_Gain_HF => EFX_Thin.AL_EAXREVERB_GAINHF,
EAX_Reverb_Gain_LF => EFX_Thin.AL_EAXREVERB_GAINLF,
EAX_Reverb_HF_Reference => EFX_Thin.AL_EAXREVERB_HFREFERENCE,
EAX_Reverb_Late_Reverb_Delay => EFX_Thin.AL_EAXREVERB_LATE_REVERB_DELAY,
EAX_Reverb_Late_Reverb_Gain => EFX_Thin.AL_EAXREVERB_LATE_REVERB_GAIN,
EAX_Reverb_Late_Reverb_Pan => EFX_Thin.AL_EAXREVERB_LATE_REVERB_PAN,
EAX_Reverb_LF_Reference => EFX_Thin.AL_EAXREVERB_LFREFERENCE,
EAX_Reverb_Modulation_Depth => EFX_Thin.AL_EAXREVERB_MODULATION_DEPTH,
EAX_Reverb_Modulation_Time => EFX_Thin.AL_EAXREVERB_MODULATION_TIME,
EAX_Reverb_Reflections_Delay => EFX_Thin.AL_EAXREVERB_REFLECTIONS_DELAY,
EAX_Reverb_Reflections_Gain => EFX_Thin.AL_EAXREVERB_REFLECTIONS_GAIN,
EAX_Reverb_Reflections_Pan => EFX_Thin.AL_EAXREVERB_REFLECTIONS_PAN,
EAX_Reverb_Room_Rolloff_Factor => EFX_Thin.AL_EAXREVERB_ROOM_ROLLOFF_FACTOR,
Echo_Damping => EFX_Thin.AL_ECHO_DAMPING,
Echo_Delay => EFX_Thin.AL_ECHO_DELAY,
Echo_Feedback => EFX_Thin.AL_ECHO_FEEDBACK,
Echo_LR_Delay => EFX_Thin.AL_ECHO_LRDELAY,
Echo_Spread => EFX_Thin.AL_ECHO_SPREAD,
Equalizer_High_Cutoff => EFX_Thin.AL_EQUALIZER_HIGH_CUTOFF,
Equalizer_High_Gain => EFX_Thin.AL_EQUALIZER_HIGH_GAIN,
Equalizer_Low_Cutoff => EFX_Thin.AL_EQUALIZER_LOW_CUTOFF,
Equalizer_Low_Gain => EFX_Thin.AL_EQUALIZER_LOW_GAIN,
Equalizer_Mid1_Center => EFX_Thin.AL_EQUALIZER_MID1_CENTER,
Equalizer_Mid1_Gain => EFX_Thin.AL_EQUALIZER_MID1_GAIN,
Equalizer_Mid1_Width => EFX_Thin.AL_EQUALIZER_MID1_WIDTH,
Equalizer_Mid2_Center => EFX_Thin.AL_EQUALIZER_MID2_CENTER,
Equalizer_Mid2_Gain => EFX_Thin.AL_EQUALIZER_MID2_GAIN,
Equalizer_Mid2_Width => EFX_Thin.AL_EQUALIZER_MID2_WIDTH,
Flanger_Delay => EFX_Thin.AL_FLANGER_DELAY,
Flanger_Depth => EFX_Thin.AL_FLANGER_DEPTH,
Flanger_Feedback => EFX_Thin.AL_FLANGER_FEEDBACK,
Flanger_Phase => EFX_Thin.AL_FLANGER_PHASE,
Flanger_Rate => EFX_Thin.AL_FLANGER_RATE,
Flanger_Waveform => EFX_Thin.AL_FLANGER_WAVEFORM,
Frequency_Shifter_Frequency => EFX_Thin.AL_FREQUENCY_SHIFTER_FREQUENCY,
Frequency_Shifter_Left_Direction => EFX_Thin.AL_FREQUENCY_SHIFTER_LEFT_DIRECTION,
Frequency_Shifter_Right_Direction => EFX_Thin.AL_FREQUENCY_SHIFTER_RIGHT_DIRECTION,
Pitch_Shifter_Coarse_Tune => EFX_Thin.AL_PITCH_SHIFTER_COARSE_TUNE,
Pitch_Shifter_Fine_Tune => EFX_Thin.AL_PITCH_SHIFTER_FINE_TUNE,
Reverb_Air_Absorption_Gain_HF => EFX_Thin.AL_REVERB_AIR_ABSORPTION_GAINHF,
Reverb_Decay_HF_Limit => EFX_Thin.AL_REVERB_DECAY_HFLIMIT,
Reverb_Decay_HF_Ratio => EFX_Thin.AL_REVERB_DECAY_HFRATIO,
Reverb_Decay_Time => EFX_Thin.AL_REVERB_DECAY_TIME,
Reverb_Density => EFX_Thin.AL_REVERB_DENSITY,
Reverb_Diffusion => EFX_Thin.AL_REVERB_DIFFUSION,
Reverb_Gain => EFX_Thin.AL_REVERB_GAIN,
Reverb_Gain_HF => EFX_Thin.AL_REVERB_GAINHF,
Reverb_Late_Reverb_Delay => EFX_Thin.AL_REVERB_LATE_REVERB_DELAY,
Reverb_Late_Reverb_Gain => EFX_Thin.AL_REVERB_LATE_REVERB_GAIN,
Reverb_Reflections_Delay => EFX_Thin.AL_REVERB_REFLECTIONS_DELAY,
Reverb_Reflections_Gain => EFX_Thin.AL_REVERB_REFLECTIONS_GAIN,
Reverb_Room_Rolloff_Factor => EFX_Thin.AL_REVERB_ROOM_ROLLOFF_FACTOR,
Ring_Modulator_Frequency => EFX_Thin.AL_RING_MODULATOR_FREQUENCY,
Ring_Modulator_Highpass_Cutoff => EFX_Thin.AL_RING_MODULATOR_HIGHPASS_CUTOFF,
Ring_Modulator_Waveform => EFX_Thin.AL_RING_MODULATOR_WAVEFORM,
Vocal_Morpher_Phoneme_A => EFX_Thin.AL_VOCAL_MORPHER_PHONEMEA,
Vocal_Morpher_Phoneme_A_Coarse_Tuning => EFX_Thin.AL_VOCAL_MORPHER_PHONEMEA_COARSE_TUNING,
Vocal_Morpher_Phoneme_B => EFX_Thin.AL_VOCAL_MORPHER_PHONEMEB,
Vocal_Morpher_Phoneme_B_Coarse_Tuning => EFX_Thin.AL_VOCAL_MORPHER_PHONEMEB_COARSE_TUNING,
Vocal_Morpher_Rate => EFX_Thin.AL_VOCAL_MORPHER_RATE,
Vocal_Morpher_Waveform => EFX_Thin.AL_VOCAL_MORPHER_WAVEFORM,
Compressor_On_Off => EFX_Thin.AL_COMPRESSOR_ONOFF);
procedure Set_Effect_Parameter
(Extension : in Extension_t;
Effect : in Effect_t;
Parameter : in Effect_Parameter_t;
Value : in Types.Float_t) is
begin
Check_Loaded (Extension);
Extension.API.Effectf
(Effect => Types.Unsigned_Integer_t (Effect),
Parameter => Map_Effect_Parameter (Parameter),
Value => Value);
end Set_Effect_Parameter;
--
-- Set_Effect_Type
--
type Map_Effect_Type_t is array (Valid_Effect_Type_t) of Types.Integer_t;
Map_Effect_Type : constant Map_Effect_Type_t :=
(Reverb => EFX_Thin.AL_EFFECT_REVERB,
Chorus => EFX_Thin.AL_EFFECT_CHORUS,
Distortion => EFX_Thin.AL_EFFECT_DISTORTION,
Echo => EFX_Thin.AL_EFFECT_ECHO,
Flanger => EFX_Thin.AL_EFFECT_FLANGER,
Frequency_Shifter => EFX_Thin.AL_EFFECT_FREQUENCY_SHIFTER,
Vocal_Morpher => EFX_Thin.AL_EFFECT_VOCAL_MORPHER,
Pitch_Shifter => EFX_Thin.AL_EFFECT_PITCH_SHIFTER,
Ring_Modulator => EFX_Thin.AL_EFFECT_RING_MODULATOR,
Autowah => EFX_Thin.AL_EFFECT_AUTOWAH,
Compressor => EFX_Thin.AL_EFFECT_COMPRESSOR,
Equalizer => EFX_Thin.AL_EFFECT_EQUALIZER,
EAX_Reverb => EFX_Thin.AL_EFFECT_EAXREVERB);
procedure Set_Effect_Type
(Extension : in Extension_t;
Effect : in Effect_t;
Effect_Type : in Valid_Effect_Type_t) is
begin
Check_Loaded (Extension);
Extension.API.Effecti
(Effect => Types.Unsigned_Integer_t (Effect),
Parameter => EFX_Thin.AL_EFFECT_TYPE,
Value => Map_Effect_Type (Effect_Type));
end Set_Effect_Type;
--
-- Set_Filter_Parameter
--
type Map_Filter_Parameter_t is array (Filter_Parameter_t) of Types.Enumeration_t;
Map_Filter_Parameter : constant Map_Filter_Parameter_t :=
(Low_Pass_Gain => EFX_Thin.AL_LOWPASS_GAIN,
Low_Pass_Gain_HF => EFX_Thin.AL_LOWPASS_GAINHF,
High_Pass_Gain => EFX_Thin.AL_HIGHPASS_GAIN,
High_Pass_Gain_LF => EFX_Thin.AL_HIGHPASS_GAINLF,
Band_Pass_Gain => EFX_Thin.AL_BANDPASS_GAIN,
Band_Pass_Gain_LF => EFX_Thin.AL_BANDPASS_GAINLF,
Band_Pass_Gain_HF => EFX_Thin.AL_BANDPASS_GAINHF);
procedure Set_Filter_Parameter
(Extension : in Extension_t;
Filter : in Filter_t;
Parameter : in Filter_Parameter_t;
Value : in Types.Float_t) is
begin
Check_Loaded (Extension);
Extension.API.Filterf
(Filter => Types.Unsigned_Integer_t (Filter),
Parameter => Map_Filter_Parameter (Parameter),
Value => Value);
end Set_Filter_Parameter;
--
-- Set_Filter_Type
--
type Map_Filter_Type_t is array (Valid_Filter_Type_t) of Types.Integer_t;
Map_Filter_Type : constant Map_Filter_Type_t :=
(Low_Pass_Filter => EFX_Thin.AL_FILTER_LOWPASS,
Band_Pass_Filter => EFX_Thin.AL_FILTER_BANDPASS,
High_Pass_Filter => EFX_Thin.AL_FILTER_HIGHPASS);
procedure Set_Filter_Type
(Extension : in Extension_t;
Filter : in Filter_t;
Filter_Type : in Valid_Filter_Type_t) is
begin
Check_Loaded (Extension);
Extension.API.Filteri
(Filter => Types.Unsigned_Integer_t (Filter),
Parameter => EFX_Thin.AL_FILTER_TYPE,
Value => Map_Filter_Type (Filter_Type));
end Set_Filter_Type;
--
-- Set_Meters_Per_Unit
--
procedure Set_Meters_Per_Unit
(Extension : in Extension_t;
Meters : in Meters_t) is
begin
Check_Loaded (Extension);
Thin.Listenerf
(Parameter => EFX_Thin.AL_METERS_PER_UNIT,
Value => Types.Float_t (Meters));
end Set_Meters_Per_Unit;
--
-- Set_Room_Rolloff_Factor
--
procedure Set_Room_Rolloff_Factor
(Extension : in Extension_t;
Source : in OpenAL.Source.Source_t;
Factor : in Room_Rolloff_Factor_t) is
begin
Check_Loaded (Extension);
Thin.Sourcef
(Source_ID => OpenAL.Source.To_Integer (Source),
Parameter => EFX_Thin.AL_ROOM_ROLLOFF_FACTOR,
Value => Types.Float_t (Factor));
end Set_Room_Rolloff_Factor;
end OpenAL.Extension.EFX;
|
onox/opus-ada | Ada | 1,013 | ads | -- Copyright (c) 2014 onox <[email protected]>
--
-- Permission to use, copy, modify, and/or distribute this software for any
-- purpose with or without fee is hereby granted, provided that the above
-- copyright notice and this permission notice appear in all copies.
--
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
with Ahven.Framework;
package Test_Opus is
type Test is new Ahven.Framework.Test_Case with null record;
overriding
procedure Initialize (T : in out Test);
private
procedure Test_Version;
end Test_Opus;
|
reznikmm/matreshka | Ada | 88,997 | adb | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- XML Processor --
-- --
-- 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: 3559 $ $Date: 2012-12-07 13:08:31 +0200 (Пт., 07 дек. 2012) $
------------------------------------------------------------------------------
with Ada.Text_IO;
with Ada.Strings.Wide_Wide_Fixed;
with Ada.Strings.Wide_Wide_Maps;
with Ada.Strings.Wide_Wide_Unbounded;
with League.Strings;
with XML.SAX.Input_Sources.Streams.Files;
with XML.SAX.Simple_Readers;
with XML.Schema.Model_Groups;
with XML.Schema.Objects.Particles;
with XML.Schema.Objects.Terms.Model_Groups;
with XML.Schema.Object_Lists;
with XML.Schema.Complex_Type_Definitions;
with XML.Schema.Simple_Type_Definitions;
with XML.Schema.Element_Declarations;
with XML.Schema.Objects.Type_Definitions.Complex_Type_Definitions;
use XML.Schema.Objects.Type_Definitions.Complex_Type_Definitions;
with XSD_To_Ada.Mappings;
with XSD_To_Ada.Mappings_XML;
with League.String_Vectors;
with XML.Schema.Named_Maps;
with XML.Schema.Models;
with XML.Schema.Objects;
with XSD_To_Ada.Writers;
use XSD_To_Ada.Writers;
with Ada.Characters.Wide_Wide_Latin_1;
with Ada.Wide_Wide_Text_IO;
package body XSD_To_Ada.Utils is
LF : constant Wide_Wide_Character := Ada.Characters.Wide_Wide_Latin_1.LF;
function Add_Separator
(Text : Wide_Wide_String) return Wide_Wide_String
is
subtype Upper_Char_List is Wide_Wide_Character range 'A' .. 'Z';
subtype Lower_Char_List is Wide_Wide_Character range 'a' .. 'z';
US_Text : League.Strings.Universal_String;
Uper_Count : Natural := 0;
begin
if Text = "" then
return "Add_Separator ERROR";
-- raise Constraint_Error with "Add_Separator ERROR";
end if;
US_Text.Append (Text (Text'First));
for J in 2 .. Text'Length - 1 loop
if Text (J) in Upper_Char_List
and then Text (J - 1) in Upper_Char_List
then
Uper_Count := Uper_Count + 1;
end if;
if Text (J) in Lower_Char_List
and then Text (J - 1) in Lower_Char_List
then
Uper_Count := 0;
end if;
if Text (J) in Lower_Char_List
and then Text (J + 1) in Upper_Char_List
then
US_Text.Append (Text (J));
US_Text.Append ("_");
Uper_Count := 0;
elsif Uper_Count > 1
and then Text (J) in Upper_Char_List
and then Text (J + 2) in Lower_Char_List
then
US_Text.Append (Text (J));
US_Text.Append ("_");
Uper_Count := 0;
else
US_Text.Append (Text (J));
end if;
end loop;
US_Text.Append (Text (Text'Last));
return US_Text.To_Wide_Wide_String;
end Add_Separator;
function Add_Separator
(Text : League.Strings.Universal_String) return Wide_Wide_String is
begin
return Add_Separator (Text.To_Wide_Wide_String);
end Add_Separator;
procedure Create_Element_Type
(Model : XML.Schema.Models.XS_Model;
Writer : in out XSD_To_Ada.Writers.Writer)
is
Element_Declarations : constant XML.Schema.Named_Maps.XS_Named_Map :=
Model.Get_Components_By_Namespace
(Object_Type => XML.Schema.Element_Declaration,
Namespace => Namespace);
Type_D : XML.Schema.Type_Definitions.XS_Type_Definition;
XS_Object : XML.Schema.Objects.XS_Object;
Print_Element : Boolean := True;
begin
for J in 1 .. Element_Declarations.Length loop
XS_Object := Element_Declarations.Item (J);
Print_Element := True;
for X in 1 .. Types_Table'Last loop
if Element_Declarations.Item (J).Get_Name.To_UTF_8_String
= Types_Table (X).Type_Name.To_UTF_8_String
then
Print_Element := False;
end if;
end loop;
if Print_Element
and Element_Declarations.Item (J).Get_Name.To_UTF_8_String
/= "Transaction"
and Element_Declarations.Item (J).Get_Name.To_UTF_8_String
/= "InstrumentUpdated"
then
declare
XS_Term : XML.Schema.Objects.Terms.XS_Term;
Decl : XML.Schema.Element_Declarations.XS_Element_Declaration;
Name : League.Strings.Universal_String;
begin
Decl := Element_Declarations.Item (J).To_Element_Declaration;
Type_D := Decl.Get_Type_Definition;
Name := Find_Type (Type_D.Get_Name, Map);
if Element_Declarations.Item (J).Get_Name.Length > 10
then
if League.Strings.Slice
(Element_Declarations.Item (J).Get_Name,
Element_Declarations.Item (J).Get_Name.Length - 7,
Element_Declarations.Item (J).Get_Name.Length).To_UTF_8_String = "Response"
then
null;
else
if XSD_To_Ada.Utils.Has_Element_Session
(Type_D.To_Type_Definition)
and then Type_D.Get_Base_Type.Get_Name.To_UTF_8_String = ""
then
Tag_Vector.Append (Decl.Get_Name);
Writers.P
(Spec_Writer,
" type " & Add_Separator (Decl.Get_Name) & "_Encoder is"
& LF
& " limited new Web_Services.SOAP.Payloads.Encoders.SOAP_Payload_Encoder"
& LF & " with null record;"
& LF & LF
& " overriding function Create"
& LF
& " (Dummy : not null access Boolean) return "
& LF
& " " & Add_Separator (Decl.Get_Name) & "_Encoder;"
& LF & LF
& " overriding procedure Encode" & LF
& " (Self : "
& Add_Separator (Decl.Get_Name)
& "_Encoder;" & LF
& " Message : Web_Services.SOAP.Payloads."
& "Abstract_SOAP_Payload'Class;" & LF
& " Writer : in out XML.SAX.Writers.SAX_Writer'Class);"
& LF);
Writers.P
(Writer,
" overriding function Create" & LF
& " (Dummy : not null access Boolean)" & LF
& " return " & Add_Separator (Decl.Get_Name) & "_Encoder"
& LF
& " is" & LF
& " pragma Unreferenced (Dummy);" & LF
& " begin" & LF
& " return X : "
& Add_Separator (Decl.Get_Name) & "_Encoder;"
& LF
& " end Create;" & LF);
Writers.P
(Writer,
" overriding procedure Encode" & LF
& " (Self : "
& Add_Separator (Decl.Get_Name)
& "_Encoder;" & LF
& " Message : Web_Services.SOAP.Payloads."
& "Abstract_SOAP_Payload'Class;" & LF
& " Writer : in out XML.SAX.Writers.SAX_Writer'Class)"
& LF
& " is" & LF
& " pragma Unreferenced (Self);" & LF & LF
& " use Ada.Strings.Unbounded;"
& LF
& " use Payloads;" & LF & LF
& " Data : Payloads."
& Add_Separator (Decl.Get_Name) & LF
& " renames Payloads."
& Add_Separator (Decl.Get_Name) & " (Message);"
& LF & LF
& " begin" & LF
& " Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);"
& LF & LF
& Write_Start_Element
(Decl.Get_Name).To_Wide_Wide_String);
XSD_To_Ada.Utils.Print_Type_Definition
(Type_D => Type_D,
Indent => "",
Writer => Writer, -- Top_Level_Writer (Level),
Name => Type_D.Get_Name,
Anonym_Name => League.Strings.Empty_Universal_String,
Full_Anonym_Name => League.Strings.Empty_Universal_String,
Base_Name => League.Strings.Empty_Universal_String,
Table => Types_Table);
Writers.P
(Writer,
" Writer.End_Element (IATS_URI, "
& Add_Separator (Decl.Get_Name) & "_Name);"
& LF
& " end Encode;"
& LF);
else
null;
if Element_Declarations.Item (J).Get_Name.To_UTF_8_String
/= "OpenSession2"
-- and then (Element_Declarations.Item (J).Get_Name.To_UTF_8_String
-- = "CreateStopOpenOrder"
-- or Element_Declarations.Item (J).Get_Name.To_UTF_8_String
-- = "CreateStopCloseOrder")
then
XSD_To_Ada.Utils.Gen_Proc_Header
(Writer,
XSD_To_Ada.Utils.Add_Separator (Decl.Get_Name));
Tag_Vector.Append (Decl.Get_Name);
Writers.P
(Spec_Writer,
" type " & Add_Separator (Decl.Get_Name) & "_Encoder is"
& LF
& " limited new Web_Services.SOAP.Payloads.Encoders.SOAP_Payload_Encoder"
& LF & " with null record;"
& LF & LF
& " overriding function Create"
& LF
& " (Dummy : not null access Boolean) return "
& LF
& " " & Add_Separator (Decl.Get_Name) & "_Encoder;"
& LF & LF
& " overriding procedure Encode" & LF
& " (Self : "
& Add_Separator (Decl.Get_Name)
& "_Encoder;" & LF
& " Message : Web_Services.SOAP.Payloads."
& "Abstract_SOAP_Payload'Class;" & LF
& " Writer : in out XML.SAX.Writers.SAX_Writer'Class);"
& LF);
Writers.P
(Writer,
" overriding function Create" & LF
& " (Dummy : not null access Boolean)" & LF
& " return " & Add_Separator (Decl.Get_Name) & "_Encoder"
& LF
& " is" & LF
& " pragma Unreferenced (Dummy);" & LF
& " begin" & LF
& " return X : "
& Add_Separator (Decl.Get_Name) & "_Encoder;"
& LF
& " end Create;" & LF);
Writers.P
(Writer,
" overriding procedure Encode" & LF
& " (Self : "
& Add_Separator (Decl.Get_Name)
& "_Encoder;" & LF
& " Message : Web_Services.SOAP.Payloads."
& "Abstract_SOAP_Payload'Class;" & LF
& " Writer : in out XML.SAX.Writers.SAX_Writer'Class)"
& LF
& " is" & LF
& " pragma Unreferenced (Self);" & LF & LF
& " use Ada.Strings.Unbounded;"
& LF
& " use Payloads;" & LF & LF
& " Data : Payloads."
& Add_Separator (Decl.Get_Name) & LF
& " renames Payloads."
& Add_Separator (Decl.Get_Name) & " (Message);"
& LF & LF
& " begin" & LF
& " Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);"
& LF & LF
& Write_Start_Element
(Decl.Get_Name).To_Wide_Wide_String);
XSD_To_Ada.Utils.Print_Type_Definition
(Type_D => Type_D,
Indent => "",
Writer => Writer, -- Top_Level_Writer (Level),
Name => Decl.Get_Name,
Anonym_Name => League.Strings.Empty_Universal_String,
Full_Anonym_Name => League.Strings.Empty_Universal_String,
Base_Name => League.Strings.Empty_Universal_String,
Table => Types_Table);
Writers.P
(Writer,
" Writer.End_Element (IATS_URI, "
& Add_Separator (Decl.Get_Name) & "_Name);"
& LF
& " end Encode;"
& LF);
end if;
end if;
end if;
end if;
end;
end if;
end loop;
end Create_Element_Type;
-------------------------
-- Create_Package_Name --
-------------------------
procedure Create_Package_Name
(Payload_Writer : in out XSD_To_Ada.Writers.Writer) is
begin
Writers.P
(Payload_Writer,
"with Ada.Containers.Indefinite_Vectors;" & LF
& "with League.Strings;" & LF
& "with Interfaces;" & LF
& "with ICTS.Types;" & LF
& "with ICTS.Forex;" & LF
& "with ICTSClient.Types;" & LF
& "with Web_Services.SOAP.Payloads;" & LF
& "with Ada.Strings.Unbounded;" & LF & LF
& "package Payloads is" & LF & LF
& " type Decimal_String is new Ada.Strings.Unbounded.Unbounded_String;"
& LF
& " Null_Decimal : constant Decimal_String :=" & LF
& " Decimal_String (Ada.Strings.Unbounded.Null_Unbounded_String);"
& LF & LF
& " type Rate_String is new Ada.Strings.Unbounded.Unbounded_String;" & LF
& " Null_Rate : constant Rate_String :=" & LF
& " Rate_String (Ada.Strings.Unbounded.Null_Unbounded_String);" & LF & LF
& " type TimeT is new Interfaces.Unsigned_64;" & LF & LF
& " type Diagnosis_Code is range 0 .. 2 ** 32 - 1;" & LF & LF
& " type Abstract_IATS_Responce is" & LF
& " abstract new Web_Services.SOAP.Payloads.Abstract_SOAP_Payload" & LF
& " with null record;" & LF);
end Create_Package_Name;
------------------------
-- Create_Simple_Type --
------------------------
procedure Create_Simple_Type
(Model : XML.Schema.Models.XS_Model;
Writer : in out XSD_To_Ada.Writers.Writer)
is
XS_Object : XML.Schema.Objects.XS_Object;
STD : XML.Schema.Simple_Type_Definitions.XS_Simple_Type_Definition;
XS_Base : XML.Schema.Type_Definitions.XS_Type_Definition;
Type_D : XML.Schema.Type_Definitions.XS_Type_Definition;
Simple_Types : constant XML.Schema.Named_Maps.XS_Named_Map :=
Model.Get_Components_By_Namespace
(Object_Type => XML.Schema.Simple_Type,
Namespace => Namespace);
begin
for J in 1 .. Simple_Types.Length loop
XS_Object := Simple_Types.Item (J);
Type_D := XS_Object.To_Type_Definition;
XS_Base := Type_D.Get_Base_Type;
STD := XS_Object.To_Simple_Type_Definition;
declare
List : constant League.String_Vectors.Universal_String_Vector
:= STD.Get_Lexical_Enumeration;
begin
if List.Is_Empty then
XSD_To_Ada.Writers.P
(Writer,
"type " &
XSD_To_Ada.Utils.Add_Separator (XS_Object.Get_Name)
& " is new "
& XSD_To_Ada.Utils.Add_Separator (XS_Base.Get_Name)
& ";" & Wide_Wide_Character'Val (10));
else
XSD_To_Ada.Writers.N
(Writer,
"type " &
XSD_To_Ada.Utils.Add_Separator (XS_Object.Get_Name)
& " is (");
for J in 1 .. List.Length loop
if J /= List.Length then
XSD_To_Ada.Writers.N
(Writer,
League.Strings.To_Lowercase
(List.Element (J)).To_Wide_Wide_String & ", ");
else
XSD_To_Ada.Writers.P
(Writer,
League.Strings.To_Lowercase
(List.Element (J)).To_Wide_Wide_String
& ");"
& Wide_Wide_Character'Val (10));
end if;
end loop;
end if;
end;
end loop;
end Create_Simple_Type;
procedure Create_Enumeration_Simple_Type
(Model : XML.Schema.Models.XS_Model;
Writer : in out XSD_To_Ada.Writers.Writer)
is
XS_Object : XML.Schema.Objects.XS_Object;
STD : XML.Schema.Simple_Type_Definitions.XS_Simple_Type_Definition;
XS_Base : XML.Schema.Type_Definitions.XS_Type_Definition;
Type_D : XML.Schema.Type_Definitions.XS_Type_Definition;
Simple_Types : constant XML.Schema.Named_Maps.XS_Named_Map :=
Model.Get_Components_By_Namespace
(Object_Type => XML.Schema.Simple_Type,
Namespace => Namespace);
begin
for J in 1 .. Simple_Types.Length loop
XS_Object := Simple_Types.Item (J);
Type_D := XS_Object.To_Type_Definition;
XS_Base := Type_D.Get_Base_Type;
STD := XS_Object.To_Simple_Type_Definition;
declare
List : constant League.String_Vectors.Universal_String_Vector
:= STD.Get_Lexical_Enumeration;
begin
if not List.Is_Empty then
XSD_To_Ada.Writers.N
(Writer,
" type " &
XSD_To_Ada.Utils.Add_Separator
(XS_Object.Get_Name.To_Wide_Wide_String) & " is "
& Wide_Wide_Character'Val (10) & " (");
for J in 1 .. List.Length loop
Ada.Text_IO.Put_Line (List.Element (J).To_UTF_8_String);
if J /= List.Length then
XSD_To_Ada.Writers.N
(Writer,
League.Strings.To_Lowercase
(List.Element (J)).To_Wide_Wide_String & ", ");
else
XSD_To_Ada.Writers.P
(Writer,
League.Strings.To_Lowercase
(List.Element (J)).To_Wide_Wide_String
& ");"
& Wide_Wide_Character'Val (10));
end if;
end loop;
end if;
end;
end loop;
end Create_Enumeration_Simple_Type;
-------------------------
-- Create_Complex_Type --
-------------------------
procedure Create_Complex_Type (Model : XML.Schema.Models.XS_Model)
is
XS_Object : XML.Schema.Objects.XS_Object;
Type_D : XML.Schema.Type_Definitions.XS_Type_Definition;
Complex_Types : constant XML.Schema.Named_Maps.XS_Named_Map :=
Model.Get_Components_By_Namespace
(Object_Type => XML.Schema.Complex_Type,
Namespace => Namespace);
Payload_Writer : XSD_To_Ada.Writers.Writer;
Current_Out_File : Ada.Text_IO.File_Type;
begin
Map :=
XSD_To_Ada.Utils.Read_Mapping
(League.Strings.To_Universal_String ("./mapping.xml"));
for J in 1 .. Complex_Types.Length loop
Types_Table (J).Type_Name := Complex_Types.Item (J).Get_Name;
Types_Table (J).Type_State := True;
end loop;
Put_Header (Payload_Writer);
-- Create_Package_Name (Payload_Writer);
-- Create_Enumeration_Simple_Type (Model, Payload_Writer);
for J in 1 .. Complex_Types.Length loop
XS_Object := Complex_Types.Item (J);
for J in 1 .. Anonyn_Vector'Last loop
Anonyn_Vector (J).Print_State := False;
Anonyn_Vector (J).Term_State := False;
end loop;
if Complex_Types.Item (J).Get_Name.To_UTF_8_String /= "OpenSession"
-- if Complex_Types.Item (J).Get_Name.To_UTF_8_String = "ModifyConditionalOrderBase"
-- or Complex_Types.Item (J).Get_Name.To_UTF_8_String = "ModifyOrderBase"
-- if Complex_Types.Item (J).Get_Name.To_UTF_8_String = "CreateOpenOrder"
-- if Complex_Types.Item (J).Get_Name.To_UTF_8_String = "BindOrders"
-- or Complex_Types.Item (J).Get_Name.To_UTF_8_String = "CreateCloseOrder"
then
Print_Type_Title
(XS_Object.To_Type_Definition,
"",
Payload_Writer,
Spec_Writer);
end if;
end loop;
-- for J in 1 .. Complex_Types.Length loop
-- Types_Table (J).Type_Name := Complex_Types.Item (J).Get_Name;
-- Types_Table (J).Type_State := True;
-- end loop;
Create_Element_Type (Model, Payload_Writer);
Writers.N (Payload_Writer, "end Encoder;");
Ada.Text_IO.Create
(Current_Out_File, Ada.Text_IO.Out_File, "./Encoder.adb");
Ada.Text_IO.Put_Line (Current_Out_File, "with Ada.Strings.Unbounded;");
Ada.Text_IO.Put_Line (Current_Out_File, "with Ada.Strings.Wide_Wide_Fixed;");
Ada.Text_IO.Put_Line (Current_Out_File, "with League.Strings;");
Ada.Text_IO.Put_Line (Current_Out_File, "with Payloads;");
Ada.Text_IO.Put_Line (Current_Out_File, "-- with ICTSClient.Types;");
Ada.Text_IO.Put_Line (Current_Out_File, "with ICTS.Forex;");
Ada.Text_IO.Put_Line (Current_Out_File, "with ICTS.Types;");
Ada.Text_IO.Put_Line (Current_Out_File, "with CLI.Ws_Utils;");
Ada.Text_IO.Put_Line (Current_Out_File, "package body Encoder is");
Ada.Text_IO.Put_Line
(Current_Out_File, " IATS_URI : constant League.Strings.Universal_String :=");
Ada.Text_IO.Put_Line
(Current_Out_File, " League.Strings.To_Universal_String (""http://www.actforex.com/iats"");");
Ada.Text_IO.Put_Line
(Current_Out_File, " IATS_Prefix : constant League.Strings.Universal_String :=");
Ada.Text_IO.Put_Line
(Current_Out_File, " League.Strings.To_Universal_String (""iats"");");
Ada.Text_IO.Put
(Current_Out_File, Element_Name.Text.To_UTF_8_String);
Ada.Text_IO.Put_Line
(Current_Out_File, Encoder_Top_Writer.Text.To_UTF_8_String);
Ada.Text_IO.Put_Line
(Current_Out_File, Payload_Writer.Text.To_UTF_8_String);
Ada.Text_IO.Put_Line (Current_Out_File, " begin");
for Index in 1 .. Tag_Vector.Length loop
Ada.Text_IO.Put_Line
(Current_Out_File,
" Web_Services.SOAP.Payloads.Encoders.Registry.Register");
Ada.Text_IO.Put_Line
(Current_Out_File,
" (Payloads."
& League.Strings.To_Universal_String
(Add_Separator (Tag_Vector.Element (Index))).To_UTF_8_String
& "'Tag, "
& League.Strings.To_Universal_String
(Add_Separator (Tag_Vector.Element (Index))).To_UTF_8_String
& "_Encoder'Tag);");
end loop;
Ada.Text_IO.Close (Current_Out_File);
Ada.Text_IO.Create
(Current_Out_File, Ada.Text_IO.Out_File, "./Encoder.ads");
Ada.Text_IO.Put_Line (Current_Out_File, "package Encoder is");
Ada.Text_IO.Put_Line
(Current_Out_File, Spec_Writer.Text.To_UTF_8_String);
Ada.Text_IO.Put_Line (Current_Out_File, "end Encoder;");
Ada.Text_IO.Close (Current_Out_File);
end Create_Complex_Type;
---------------------------
-- Create_Vector_Package --
---------------------------
procedure Create_Vector_Package
(Type_D_Name : League.Strings.Universal_String;
Writer : in out Writers.Writer;
Writer_types : in out Writers.Writer)
is
Added_Vector_Type : Boolean := False;
begin
Added_Vector_Type := True;
for J in 1 .. Is_Vector_Type.Length loop
if Type_D_Name.To_UTF_8_String
= Is_Vector_Type.Element (J).To_UTF_8_String
then
Added_Vector_Type := False;
exit;
else
Added_Vector_Type := True;
end if;
end loop;
if Added_Vector_Type then
Writers.P
(Writer_Types,
" package "
& Add_Separator (Type_D_Name) & "_Vectors is "
& Wide_Wide_Character'Val (10)
& Gen_Type_Line
(" new Ada.Containers.Indefinite_Vectors "
& "(Positive, "
& Add_Separator (Type_D_Name) & ");", 7)
& Wide_Wide_Character'Val (10)
& Wide_Wide_Character'Val (10)
& Gen_Type_Line
(" subtype " & Add_Separator (Type_D_Name)
& "s is " & Add_Separator (Type_D_Name)
& "_Vectors.Vector;", 5)
& Wide_Wide_Character'Val (10));
Is_Vector_Type.Append (Type_D_Name);
if not Is_Type_In_Map (Type_D_Name, Map) then
Writers.N (Writer, "s");
end if;
end if;
Writers.P (Writer, ";");
end Create_Vector_Package;
---------------
-- Find_Type --
---------------
function Find_Type
(Type_D_Name : League.Strings.Universal_String;
Map : XSD_To_Ada.Mappings_XML.Mapping_XML)
return League.Strings.Universal_String
is
begin
for j in 1 .. Map.Map_Vector.Length loop
if Type_D_Name.To_UTF_8_String =
Map.Map_Vector.Element (J).To_UTF_8_String
then
return Map.Ada_Vector.Element (J);
end if;
end loop;
return League.Strings.To_Universal_String
("Payloads." & XSD_To_Ada.Utils.Add_Separator (Type_D_Name));
end Find_Type;
--------------------
-- Is_Type_In_Map --
--------------------
function Is_Type_In_Map
(Type_D_Name : League.Strings.Universal_String;
Map : XSD_To_Ada.Mappings_XML.Mapping_XML)
return Boolean
is
begin
for j in 1 .. Map.Map_Vector.Length loop
if Type_D_Name.To_UTF_8_String =
Map.Map_Vector.Element (J).To_UTF_8_String
then
return True;
end if;
end loop;
return False;
end Is_Type_In_Map;
function Is_Type_In_Optional_Vector
(Type_Name : League.Strings.Universal_String)
return Boolean
is
begin
for Index in 1 .. Optional_Vector.Length loop
if Optional_Vector.Element (Index).To_Wide_Wide_String =
Type_Name.To_Wide_Wide_String
then
return True;
end if;
end loop;
Optional_Vector.Append (Type_Name);
return False;
end Is_Type_In_Optional_Vector;
---------------------
-- Gen_Access_Type --
---------------------
procedure Gen_Access_Type
(Self : in out XSD_To_Ada.Writers.Writer;
Name : Wide_Wide_String) is
begin
Writers.N
(Self,
" type " & Name & "_Access is access all "
& Wide_Wide_Character'Val (10)
& " " & Name & "'Class;"
& Wide_Wide_Character'Val (10) & Wide_Wide_Character'Val (10));
end Gen_Access_Type;
----------------
-- Gen_Line --
----------------
procedure Gen_Line
(Self : in out XSD_To_Ada.Writers.Writer; Str : Wide_Wide_String := "") is
use Ada.Strings.Wide_Wide_Unbounded;
use Ada.Strings.Wide_Wide_Maps;
Set : constant Wide_Wide_Character_Set := "or"
(To_Set (Span => ('(', '(')),
"or" (To_Set (Span => ('.', '.')), To_Set (Span => (' ', ' '))));
S : Unbounded_Wide_Wide_String := To_Unbounded_Wide_Wide_String (Str);
L : Natural;
Tab : constant Wide_Wide_String
(1 .. Index_Non_Blank (S) + 2) := (others => ' ');
In_Comment : Boolean := False;
procedure Put (Txt : Wide_Wide_String);
---------
-- Put --
---------
procedure Put (Txt : Wide_Wide_String) is
use Ada.Strings.Wide_Wide_Fixed;
begin
if In_Comment then
Self.P (Tab (Tab'First .. Tab'Last - 2) & "-- " & Txt
(Index_Non_Blank (Txt) .. Txt'Last));
else
In_Comment := Index (Txt, "--") >= 1;
Self.P (Txt);
end if;
end Put;
begin
if Length (S) > 79 then
loop
L := Index
(S, Set, Positive'Min (79, Length (S)),
Ada.Strings.Inside, Ada.Strings.Backward);
exit when L < 1;
if Element (S, L) = '.'
and then L + 3 <= Length (S)
and then Slice (S, L + 1, L + 3) = "all"
then
L := Index
(S, Set, L - 1, Ada.Strings.Inside, Ada.Strings.Backward);
exit when L < 1;
end if;
if Element (S, L) = ' ' then
Put (Slice
(S, 1, Index_Non_Blank (S, L - 1, Ada.Strings.Backward)));
elsif Element (S, L) = '(' then
L := L - 1;
Put
(Slice
(S, 1, Index_Non_Blank (S, L, Ada.Strings.Backward)));
else
Put (Slice (S, 1, L));
end if;
S := To_Unbounded_Wide_Wide_String
(Tab & Slice (S, L + 1, Length (S)));
exit when Length (S) < 80;
end loop;
if S /= Null_Unbounded_Wide_Wide_String then
Put (To_Wide_Wide_String (S));
end if;
else
Self.P (To_Wide_Wide_String (S));
end if;
end Gen_Line;
-------------------
-- Gen_Type_Line --
-------------------
function Gen_Type_Line
(Str : Wide_Wide_String := "";
Tab : Natural := 0)
return Wide_Wide_String
is
use Ada.Strings.Wide_Wide_Unbounded;
use Ada.Strings.Wide_Wide_Maps;
US : League.Strings.Universal_String
:= League.Strings.To_Universal_String (Str);
US_New : League.Strings.Universal_String;
Char_Count : Natural := US.Length + Tab;
Used_Char_Count : Natural := 0;
Tab_Count : Natural := Tab;
Index : Natural := 0;
begin
for J in 1 .. Tab_Count loop
US_New.Append (" ");
Used_Char_Count := Used_Char_Count + 1;
Char_Count := Char_Count - 1;
end loop;
for J in 1 .. US.Length loop
if Char_Count + Used_Char_Count > 78 then
if (US.Element (J).To_Wide_Wide_Character = ':'
and then J /= 1)
or (US.Element (J).To_Wide_Wide_Character = '('
and then J /= 1)
or (J + 4 < US.Length
and then US.Element (J).To_Wide_Wide_Character = ' '
and then US.Element (J + 1).To_Wide_Wide_Character = 'i'
and then US.Element (J + 2).To_Wide_Wide_Character = 's'
and then US.Element (J + 3).To_Wide_Wide_Character = ' ')
or (US.Element (J).To_Wide_Wide_Character = ' '
and then US.Element (J + 1).To_Wide_Wide_Character = '/'
and then US.Element (J + 2).To_Wide_Wide_Character = '='
and then US.Element (J + 3).To_Wide_Wide_Character = ' ')
or (J /= 1
and then J + 1 < US.Length
and then US.Element (J).To_Wide_Wide_Character = '.'
and then US.Element (J + 1).To_Wide_Wide_Character /= '.')
then
Tab_Count := Tab_Count + 2;
Char_Count := US.Length - J;
Used_Char_Count := Tab_Count;
-- US_New.Append
-- (League.Strings.From_UTF_8_String
-- (Char_Count'Img & " +" & Used_Char_Count'Img));
US_New.Append (LF);
for Count in 1 .. Tab_Count loop
US_New.Append (" ");
end loop;
US_New.Append (US.Element (J));
else
US_New.Append (US.Element (J));
end if;
else
US_New.Append (US.Element (J));
end if;
end loop;
return US_New.To_Wide_Wide_String;
end Gen_Type_Line;
---------------------
-- Gen_Proc_Header --
---------------------
procedure Gen_Proc_Header
(Self : in out XSD_To_Ada.Writers.Writer;
Name : Wide_Wide_String;
Offset : Positive := 3)
is
D : constant Wide_Wide_String (1 .. Name'Length + 6) := (others => '-');
O : constant Wide_Wide_String (1 .. Offset) := (others => ' ');
begin
if D'Length > 76 then
return;
end if;
Gen_Line (Self, O & D);
Gen_Line (Self, O & "-- " & Name & " --");
Gen_Line (Self, O & D);
Gen_Line (Self);
end Gen_Proc_Header;
---------------------------
-- Generate_Complex_Type --
---------------------------
procedure Generate_Complex_Type
(Type_D : XML.Schema.Type_Definitions.XS_Type_Definition;
Indent : String;
XS_Term : XML.Schema.Objects.Terms.XS_Term;
Type_Name : League.Strings.Universal_String;
Name : League.Strings.Universal_String;
Full_Anonym_Name : League.Strings.Universal_String;
Table : in out Types_Table_Type_Array;
Max_Occurs : in out Boolean;
Top_Max_Occurs : Boolean;
Choice : Boolean := False;
Writer : in out Writers.Writer;
-- Writer_types : in out Writers.Writer;
Level : Natural := 0)
is
use League.Strings;
begin
Ada.Text_IO.Put_Line ("###" & Level'Img);
if Has_Top_Level_Type (Type_D, Table) then
XSD_To_Ada.Utils.Print_Type_Title
(XS_Term,
" " & Indent,
Writer,
Spec_Writer,
Level);
end if;
if Max_Occurs then
Writers.P
(Writer,
" for Index in 1 .. Natural"
& LF
& Gen_Type_Line ("(Data."
& Full_Anonym_Name.To_Wide_Wide_String
& Add_Separator (XS_Term.Get_Name)
& ".Length) loop", 7));
Writers.P
(Writer,
Gen_Type_Line
("Encode (Data."
& Full_Anonym_Name.To_Wide_Wide_String
& Add_Separator (XS_Term.Get_Name)
& ".Element (Index),", 6)
& LF
& " Writer,"
& LF
& " League.Strings.To_Universal_String ("""
& XS_Term.Get_Name & """));");
Writers.P (Writer, " end loop;" & LF);
Max_Occurs := False;
elsif Top_Max_Occurs then
Writers.P
(Writer,
Gen_Type_Line
("Encode (Data."
& Full_Anonym_Name.To_Wide_Wide_String
& "Element (Index)."
& Add_Separator (XS_Term.Get_Name) & ",", 6)
& LF
& " Writer,"
& LF
& " League.Strings.To_Universal_String ("""
& XS_Term.Get_Name & """));");
else
Writers.P
(Writer,
Gen_Type_Line
("Encode (Data."
& Full_Anonym_Name.To_Wide_Wide_String
& Add_Separator (XS_Term.Get_Name) & ",", 6)
& LF
& " Writer,"
& LF
& " League.Strings.To_Universal_String ("""
& XS_Term.Get_Name & """));");
end if;
end Generate_Complex_Type;
-------------------
-- Generate_Type --
-------------------
procedure Generate_Type
(Type_D : XML.Schema.Type_Definitions.XS_Type_Definition;
Indent : String;
XS_Term : XML.Schema.Objects.Terms.XS_Term;
Type_Name : League.Strings.Universal_String;
Name : League.Strings.Universal_String;
Anonym_Name : League.Strings.Universal_String;
Full_Anonym_Name : League.Strings.Universal_String;
Base_Choice_Name : League.Strings.Universal_String;
Base_Name : League.Strings.Universal_String;
Table : in out Types_Table_Type_Array;
Max_Occurs : in out Boolean;
Top_Max_Occurs : Boolean;
Min_Occurs : in out Boolean;
Choice : Boolean;
Writer : in out Writers.Writer;
-- Writer_types : in out Writers.Writer;
Level : Natural := 0) is
begin
case Type_D.Get_Type_Category is
when XML.Schema.Complex_Type =>
Ada.Text_IO.Put_Line
("############# Generate_Complex_Type:"
& Type_D.Get_Name.To_UTF_8_String & "; "
& "Choice " & Choice'Img
& "; Top_Max_Occurs : " & Top_Max_Occurs'Img);
Generate_Complex_Type
(Type_D => Type_D,
Indent => Indent,
XS_Term => XS_Term,
Type_Name => Type_Name,
Name => Name,
Full_Anonym_Name => Full_Anonym_Name,
Table => Table,
Max_Occurs => Max_Occurs,
Top_Max_Occurs => Top_Max_Occurs,
Choice => Choice,
Writer => Writer,
-- Writer_types,
Level => Level);
when XML.Schema.Simple_Type =>
Generate_Simple_Type
(Type_D => Type_D,
XS_Term => XS_Term,
Type_Name => Type_Name,
Name => Name,
Anonym_Name => Anonym_Name,
Full_Anonym_Name => Full_Anonym_Name,
Base_Choice_Name => Base_Choice_Name,
Base_Name => Base_Name,
Max_Occurs => Max_Occurs,
Top_Max_Occurs => Top_Max_Occurs,
Min_Occurs => Min_Occurs,
Choice => Choice,
Writer => Writer);
-- Writer_types);
when XML.Schema.None =>
Ada.Text_IO.Put_Line ("NONE!!!");
end case;
end Generate_Type;
--------------------------
-- Generate_Simple_Type --
--------------------------
procedure Generate_Simple_Type
(Type_D : XML.Schema.Type_Definitions.XS_Type_Definition;
XS_Term : XML.Schema.Objects.Terms.XS_Term;
Type_Name : League.Strings.Universal_String;
Name : League.Strings.Universal_String;
Anonym_Name : League.Strings.Universal_String;
Full_Anonym_Name : League.Strings.Universal_String;
Base_Choice_Name : League.Strings.Universal_String;
Base_Name : League.Strings.Universal_String;
Max_Occurs : in out Boolean;
Top_Max_Occurs : Boolean;
Min_Occurs : in out Boolean;
Choice : Boolean;
Writer : in out Writers.Writer)
is
use League.Strings;
begin
if Type_D.Get_Base_Type.Get_Name.To_UTF_8_String = "string" then
if Min_Occurs then
if Top_Max_Occurs then
Writers.P
(Writer,
Gen_Type_Line
("if not Data."
& Full_Anonym_Name.To_Wide_Wide_String
& Base_Choice_Name.To_Wide_Wide_String
& "Element (Index)."
& Add_Separator (XS_Term.Get_Name) & "."
& Add_Separator (XS_Term.Get_Name)
& ".Is_Empty then", 5));
else
Writers.P
(Writer,
Gen_Type_Line
("if not Data."
& Full_Anonym_Name.To_Wide_Wide_String
& Base_Choice_Name.To_Wide_Wide_String
& Add_Separator (XS_Term.Get_Name) & "."
& Add_Separator (XS_Term.Get_Name)
& ".Is_Empty then", 5));
end if;
end if;
if Anonym_Name.To_UTF_8_String /= "" then
Writers.N (Writer, Write_Start_Element (Anonym_Name));
end if;
Writers.N (Writer, Write_Start_Element (XS_Term.Get_Name));
if not Type_D.To_Simple_Type_Definition.Get_Lexical_Enumeration
.Is_Empty
then
Writers.P
(Writer,
Gen_Type_Line
("Writer.Characters (League.Strings.From_UTF_8_String (Data."
& Full_Anonym_Name.To_Wide_Wide_String
& Base_Choice_Name.To_Wide_Wide_String
& Add_Separator (XS_Term.Get_Name)
& "'Img));", 6)
& LF & " -- "
& Add_Separator (Type_D.Get_Base_Type.Get_Name));
else
if Top_Max_Occurs then
if Min_Occurs then
Writers.P
(Writer,
" Writer.Characters"
& Gen_Type_Line
("(Data."
& Full_Anonym_Name.To_Wide_Wide_String
& Base_Choice_Name.To_Wide_Wide_String
& "Element (Index)."
& Add_Separator (XS_Term.Get_Name) & "."
& Add_Separator (XS_Term.Get_Name)
& ");", 13)
& LF & " -- "
& Add_Separator (Type_D.Get_Base_Type.Get_Name));
else
Writers.P
(Writer,
" Writer.Characters"
& Gen_Type_Line
("(Data."
& Full_Anonym_Name.To_Wide_Wide_String
& Base_Choice_Name.To_Wide_Wide_String
& "Element (Index)."
& Add_Separator (XS_Term.Get_Name)
& ");", 13)
& LF & " -- "
& Add_Separator (Type_D.Get_Base_Type.Get_Name));
end if;
else
if Min_Occurs then
Writers.P
(Writer,
" Writer.Characters"
& Gen_Type_Line
("(Data."
& Full_Anonym_Name.To_Wide_Wide_String
& Base_Choice_Name.To_Wide_Wide_String
& Add_Separator (XS_Term.Get_Name) & "."
& Add_Separator (XS_Term.Get_Name)
& ");", 13)
& LF & " -- "
& Add_Separator (Type_D.Get_Base_Type.Get_Name));
else
Writers.P
(Writer,
" Writer.Characters"
& Gen_Type_Line
("(Data."
& Full_Anonym_Name.To_Wide_Wide_String
& Base_Choice_Name.To_Wide_Wide_String
& Add_Separator (XS_Term.Get_Name)
& ");", 13)
& LF & " -- "
& Add_Separator (Type_D.Get_Base_Type.Get_Name));
end if;
end if;
end if;
Writers.P
(Writer,
" Writer.End_Element (IATS_URI, "
& Add_Separator (XS_Term.Get_Name)
& "_Name);"
& LF);
if Anonym_Name.To_UTF_8_String /= "" then
Writers.P
(Writer,
" Writer.End_Element (IATS_URI, "
& Add_Separator (Anonym_Name)
& "_Name);"
& LF);
end if;
if Min_Occurs then
Writers.P (Writer, " end if;");
end if;
elsif Type_D.Get_Base_Type.Get_Name.To_UTF_8_String = "decimal" then
if Min_Occurs then
if Top_Max_Occurs then
Writers.P
(Writer,
(Gen_Type_Line
("if Data."
& Full_Anonym_Name.To_Wide_Wide_String
& Base_Choice_Name.To_Wide_Wide_String
& "Element (Index)."
& Add_Separator (XS_Term.Get_Name)
& " /= Payloads.Null_Decimal", 5)
& LF
& " and then CLI.Ws_Utils.Is_Digits"
& LF
& " (Data."
& Full_Anonym_Name.To_Wide_Wide_String
& "Element (Index)."
& Base_Choice_Name.To_Wide_Wide_String
& Add_Separator (XS_Term.Get_Name) & ")"
& LF
& " then"));
else
Writers.P
(Writer,
(Gen_Type_Line
("if Data."
& Full_Anonym_Name.To_Wide_Wide_String
& Base_Choice_Name.To_Wide_Wide_String
& Add_Separator (XS_Term.Get_Name)
& " /= Payloads.Null_Decimal", 5)
& LF
& " and then CLI.Ws_Utils.Is_Digits"
& LF
& " (Data."
& Base_Choice_Name.To_Wide_Wide_String
& Add_Separator (XS_Term.Get_Name) & ")"
& LF
& " then"));
end if;
end if;
if Anonym_Name.To_UTF_8_String /= "" then
Writers.N (Writer, Write_Start_Element (Anonym_Name));
end if;
Writers.N (Writer, Write_Start_Element (XS_Term.Get_Name));
if Choice then
if Top_Max_Occurs then
Writers.P
(Writer,
" Writer.Characters" & LF
& " (League.Strings.From_UTF_8_String" & LF
& Gen_Type_Line
("(To_String (Data."
& Name.To_Wide_Wide_String & "."
& Base_Name.To_Wide_Wide_String
& "Element (Index)."
& Add_Separator (XS_Term.Get_Name)
& ")));", 13)
& LF & " -- "
& Type_D.Get_Base_Type.Get_Name);
else
Writers.P
(Writer,
" Writer.Characters" & LF
& " (League.Strings.From_UTF_8_String" & LF
& Gen_Type_Line
("(To_String (Data."
& Name.To_Wide_Wide_String & "."
& Base_Name.To_Wide_Wide_String
& Add_Separator (XS_Term.Get_Name)
& ")));", 13)
& LF & " -- "
& Type_D.Get_Base_Type.Get_Name);
end if;
else
if Top_Max_Occurs then
Writers.P
(Writer,
" Writer.Characters" & LF
& " (League.Strings.From_UTF_8_String" & LF
& Gen_Type_Line
("(To_String (Data."
& Full_Anonym_Name.To_Wide_Wide_String
& Base_Choice_Name.To_Wide_Wide_String
& "Element (Index)."
& Add_Separator (XS_Term.Get_Name)
& ")));", 13)
& LF & " -- "
& Type_D.Get_Base_Type.Get_Name);
else
Writers.P
(Writer,
" Writer.Characters" & LF
& " (League.Strings.From_UTF_8_String" & LF
& Gen_Type_Line
("(To_String (Data."
& Full_Anonym_Name.To_Wide_Wide_String
& Base_Choice_Name.To_Wide_Wide_String
& Add_Separator (XS_Term.Get_Name)
& ")));", 13)
& LF & " -- "
& Type_D.Get_Base_Type.Get_Name);
end if;
end if;
Writers.P
(Writer,
" Writer.End_Element (IATS_URI, "
& Add_Separator (XS_Term.Get_Name)
& "_Name);"
& LF);
if Anonym_Name.To_UTF_8_String /= "" then
Writers.P
(Writer,
" Writer.End_Element (IATS_URI, "
& Add_Separator (Anonym_Name)
& "_Name);");
end if;
if Min_Occurs then
Writers.P (Writer, " end if;");
end if;
elsif Type_D.Get_Base_Type.Get_Name.To_UTF_8_String = "positiveInteger" then
if Anonym_Name.To_UTF_8_String /= "" then
Writers.N (Writer, Write_Start_Element (Anonym_Name));
-- Writers.N (Writer, "--dvdvdv");
end if;
Writers.N (Writer, Write_Start_Element (XS_Term.Get_Name));
if Top_Max_Occurs then
Writers.P
(Writer,
" Writer.Characters" & LF
& " (League.Strings.To_Universal_String" & LF
& " (Ada.Strings.Wide_Wide_Fixed.Trim" & LF
& " (" & Find_Type (Type_D.Get_Name, Map)
& "'Wide_Wide_Image" & LF
& Gen_Type_Line
("(Data."
& Full_Anonym_Name.To_Wide_Wide_String
& Base_Choice_Name.To_Wide_Wide_String
& "Element (Index)."
& Add_Separator (XS_Term.Get_Name) & "),", 15)
& LF
& " Ada.Strings.Both)));"
& LF & " -- "
& Add_Separator (Type_D.Get_Base_Type.Get_Name));
else
Writers.P
(Writer,
" Writer.Characters" & LF
& " (League.Strings.To_Universal_String" & LF
& " (Ada.Strings.Wide_Wide_Fixed.Trim" & LF
& " (" & Find_Type (Type_D.Get_Name, Map)
& "'Wide_Wide_Image" & LF
& " (Data."
& Full_Anonym_Name & Base_Choice_Name
& Add_Separator (XS_Term.Get_Name) & ")," & LF
& " Ada.Strings.Both)));"
& LF & " -- "
& Add_Separator (Type_D.Get_Base_Type.Get_Name));
end if;
Writers.P
(Writer,
" Writer.End_Element (IATS_URI, "
& Add_Separator (XS_Term.Get_Name)
& "_Name);"
& LF);
if Anonym_Name.To_UTF_8_String /= "" then
Writers.P
(Writer,
" Writer.End_Element (IATS_URI, "
& Add_Separator (Anonym_Name)
& "_Name);"
& LF);
end if;
elsif Type_D.Get_Base_Type.Get_Name.To_UTF_8_String = "boolean" then
Writers.N (Writer, Write_Start_Element (XS_Term.Get_Name));
if Top_Max_Occurs then
Writers.P
(Writer,
" Writer.Characters (CLI.Ws_Utils.Image"
& LF
& " (Data."
& Full_Anonym_Name & Base_Choice_Name & "Element (Index)."
& Add_Separator (XS_Term.Get_Name)
& "));"
& LF & " -- "
& Type_D.Get_Base_Type.Get_Name);
else
Writers.P
(Writer,
" Writer.Characters (CLI.Ws_Utils.Image"
& LF
& " (Data."
& Full_Anonym_Name & Base_Choice_Name
& Add_Separator (XS_Term.Get_Name)
& "));"
& LF & " -- "
& Type_D.Get_Base_Type.Get_Name);
end if;
Writers.P
(Writer,
" Writer.End_Element (IATS_URI, "
& Add_Separator (XS_Term.Get_Name)
& "_Name);"
& LF);
else
Writers.N (Writer, Write_Start_Element (XS_Term.Get_Name));
if Top_Max_Occurs then
Writers.P
(Writer,
" Writer.Characters (IATS_URI, Data."
& Full_Anonym_Name & Base_Choice_Name & "Element (Index)."
& Add_Separator (XS_Term.Get_Name)
& "));"
& LF & " -- "
& Type_D.Get_Base_Type.Get_Name);
else
Writers.P
(Writer,
" Writer.Characters (IATS_URI, Data."
& Full_Anonym_Name & Base_Choice_Name
& Add_Separator (XS_Term.Get_Name)
& "));"
& LF & " -- "
& Type_D.Get_Base_Type.Get_Name);
end if;
Writers.P
(Writer,
" Writer.End_Element (IATS_URI, "
& Add_Separator (XS_Term.Get_Name)
& "_Name);"
& LF);
end if;
end Generate_Simple_Type;
------------------------
-- Has_Top_Level_Type --
------------------------
function Has_Top_Level_Type
(Type_D : XML.Schema.Type_Definitions.XS_Type_Definition;
Table : Types_Table_Type_Array)
return Boolean is
begin
for j in 1 .. Table'Last loop
if Type_D.Get_Name.To_Wide_Wide_String =
Table (J).Type_Name.To_Wide_Wide_String
and Table (J).Type_State
then
return True;
end if;
end loop;
return False;
end Has_Top_Level_Type;
--------------
-- New_Line --
--------------
procedure New_Line (Self : in out XSD_To_Ada.Writers.Writer) is
begin
Self.P ("");
end New_Line;
------------------------
-- Print_Content_Type --
------------------------
procedure Print_Content_Type
(Type_D : XML.Schema.Type_Definitions.XS_Type_Definition;
Indent : String := "";
Writer : in out Writers.Writer;
Writer_types : in out Writers.Writer;
Name : League.Strings.Universal_String;
Map : XSD_To_Ada.Mappings_XML.Mapping_XML)
is
use type XML.Schema.Type_Definitions.XS_Type_Definition;
XS_Particle : XML.Schema.Objects.Particles.XS_Particle;
XS_Term : XML.Schema.Objects.Terms.XS_Term;
CTD : XML.Schema.Complex_Type_Definitions.XS_Complex_Type_Definition;
STD : XML.Schema.Simple_Type_Definitions.XS_Simple_Type_Definition;
----------------
-- Print_Term --
----------------
procedure Print_Term
(XS_Term : XML.Schema.Objects.Terms.XS_Term;
Indent : String := "";
Writer : in out Writers.Writer;
Writer_types : in out Writers.Writer;
Name : League.Strings.Universal_String;
Map : XSD_To_Ada.Mappings_XML.Mapping_XML)
is
use type XML.Schema.Objects.Terms.Model_Groups.Compositor_Kinds;
XS_Model_Group : XML.Schema.Model_Groups.XS_Model_Group;
XS_List : XML.Schema.Object_Lists.XS_Object_List;
XS_Particle : XML.Schema.Objects.Particles.XS_Particle;
Decl : XML.Schema.Element_Declarations.XS_Element_Declaration;
Type_D : XML.Schema.Type_Definitions.XS_Type_Definition;
Type_Name : League.Strings.Universal_String;
begin
Ada.Text_IO.Put (Indent);
Ada.Text_IO.Put_Line ("Type " & XS_Term.Get_Type'Img);
Ada.Text_IO.Put (Indent);
Ada.Text_IO.Put_Line
("XS_Term.Get_Name =" & XS_Term.Get_Name.To_UTF_8_String);
if XS_Term.Is_Model_Group then
XS_Model_Group := XS_Term.To_Model_Group;
XS_List := XS_Model_Group.Get_Particles;
Ada.Text_IO.Put_Line (Indent & XS_Model_Group.Get_Compositor'Img);
for J in 1 .. XS_List.Get_Length loop
Ada.Text_IO.Put (Indent);
XS_Particle := XS_List.Item (J).To_Particle;
Print_Term
(XS_Particle.Get_Term,
Indent & " ", Writer, Writer_types, Name, Map);
end loop;
elsif XS_Term.Is_Element_Declaration then
Decl := XS_Term.To_Element_Declaration;
Type_D := Decl.Get_Type_Definition;
Type_Name := Find_Type (Type_D.Get_Name, Map);
case Type_D.Get_Type_Category is
when XML.Schema.Complex_Type | XML.Schema.Simple_Type =>
Writers.P
(Writer,
" "
& XSD_To_Ada.Utils.Add_Separator
(XS_Term.Get_Name)
& " : "
& Type_Name.To_Wide_Wide_String & "; -- gbgfbh");
when XML.Schema.None =>
Ada.Text_IO.Put_Line (Indent & "NONE!!!");
end case;
end if;
end Print_Term;
begin
if Type_D.Get_Base_Type.Get_Name.To_UTF_8_String /= "" then
Writers.P
(Writer,
Gen_Type_Line (" "
& Add_Separator (Type_D.Get_Base_Type.Get_Name.To_Wide_Wide_String)
& " : Payloads."
& Add_Separator (Type_D.Get_Base_Type.Get_Name.To_Wide_Wide_String)
& ";", 8));
end if;
case Type_D.Get_Type_Category is
when XML.Schema.Complex_Type =>
CTD := Type_D.To_Complex_Type_Definition;
if CTD.Get_Content_Type in Element_Only | Mixed then
Ada.Text_IO.Put_Line
(Indent & "Complex_Type :" & Type_D.Get_Name.To_UTF_8_String);
XS_Particle := CTD.Get_Particle;
XS_Term := XS_Particle.Get_Term;
Print_Term
(XS_Term, Indent & " ", Writer, Writer_types, Name, Map);
Ada.Text_IO.Put_Line
(Indent & "End Complex_Type :" & Type_D.Get_Name.To_UTF_8_String);
end if;
when XML.Schema.Simple_Type =>
Ada.Text_IO.Put
(Indent & "Simple_Type : " & Type_D.Get_Name.To_UTF_8_String);
STD := Type_D.To_Simple_Type_Definition;
when XML.Schema.None =>
Ada.Text_IO.Put_Line (Indent & "NONE!!!");
end case;
end Print_Content_Type;
----------------------
-- Print_Type_Title --
----------------------
procedure Print_Type_Title
(Type_D : XML.Schema.Type_Definitions.XS_Type_Definition;
Indent : String;
Writer : in out XSD_To_Ada.Writers.Writer;
Spec_Writer : in out XSD_To_Ada.Writers.Writer;
Level : Positive := 1)
is
use League.Strings;
Is_Record : Boolean := False;
US_Response : League.Strings.Universal_String;
Payload_Writer : XSD_To_Ada.Writers.Writer;
Payload_Type_Writer : XSD_To_Ada.Writers.Writer;
begin
Ada.Text_IO.Put_Line
("START Print_Type_Title Type_D=" & Type_D.Get_Name.To_UTF_8_String);
for J in 1 .. Types_Table'Last loop
if Type_D.Get_Name.To_UTF_8_String = Types_Table (J).Type_Name.To_UTF_8_String
and then Types_Table (J).Type_State
then
Types_Table (J).Type_State := False;
if Type_D.Get_Name.Length > 10 then
US_Response := League.Strings.Slice
(Type_D.Get_Name,
Type_D.Get_Name.Length - 7,
Type_D.Get_Name.Length);
end if;
if Type_D.Get_Name.Length > 10
and
US_Response.To_UTF_8_String = "Response"
then
null;
else
if XSD_To_Ada.Utils.Has_Element_Session
(Type_D.To_Type_Definition)
then
XSD_To_Ada.Utils.Gen_Proc_Header
(Writer, XSD_To_Ada.Utils.Add_Separator (Type_D.Get_Name));
Tag_Vector.Append (Type_D.Get_Name);
Writers.P
(Spec_Writer,
" type " & Add_Separator (Type_D.Get_Name) & "_Encoder is"
& LF
& " limited new Web_Services.SOAP.Payloads.Encoders.SOAP_Payload_Encoder"
& LF & " with null record;"
& LF & LF
& " overriding function Create"
& LF
& " (Dummy : not null access Boolean) return "
& LF
& " " & Add_Separator (Type_D.Get_Name) & "_Encoder;"
& LF & LF
& " overriding procedure Encode" & LF
& " (Self : "
& Add_Separator (Type_D.Get_Name)
& "_Encoder;" & LF
& " Message : Web_Services.SOAP.Payloads."
& "Abstract_SOAP_Payload'Class;" & LF
& " Writer : in out XML.SAX.Writers.SAX_Writer'Class);"
& LF);
Writers.P
(Top_Level_Writer (Level),
" overriding function Create" & LF
& " (Dummy : not null access Boolean)" & LF
& " return " & Add_Separator (Type_D.Get_Name) & "_Encoder"
& LF
& " is" & LF
& " pragma Unreferenced (Dummy);" & LF
& " begin" & LF
& " return X : "
& Add_Separator (Type_D.Get_Name) & "_Encoder;"
& LF
& " end Create;" & LF);
Writers.P
(Top_Level_Writer (Level),
" overriding procedure Encode" & LF
& " (Self : "
& Add_Separator (Type_D.Get_Name)
& "_Encoder;" & LF
& " Message : Web_Services.SOAP.Payloads."
& "Abstract_SOAP_Payload'Class;" & LF
& " Writer : in out XML.SAX.Writers.SAX_Writer'Class)"
& LF
& " is" & LF
& " pragma Unreferenced (Self);" & LF & LF
& " use Payloads;" & LF
& " use Ada.Strings.Unbounded;" & LF & LF
& " Data : Payloads."
& Add_Separator (Type_D.Get_Name) & LF
& " renames Payloads."
& Add_Separator (Type_D.Get_Name) & " (Message);"
& LF & LF
& " begin" & LF
& " Writer.Start_Prefix_Mapping (IATS_Prefix, IATS_URI);");
Writers.P
(Top_Level_Writer (Level),
XSD_To_Ada.Utils.Write_Start_Element (Type_D.Get_Name));
XSD_To_Ada.Utils.Print_Type_Definition
(Type_D => Type_D,
Indent => "",
Writer => Top_Level_Writer (Level), -- Top_Level_Writer (Level),
Name => Type_D.Get_Name,
Anonym_Name => League.Strings.Empty_Universal_String,
Full_Anonym_Name => League.Strings.Empty_Universal_String,
Base_Name => League.Strings.Empty_Universal_String,
Table => Types_Table);
Writers.P
(Top_Level_Writer (Level),
" Writer.End_Element (IATS_URI, "
& Add_Separator (Type_D.Get_Name) & "_Name);"
& LF
& " end Encode;"
& LF);
else
null;
Ada.Text_IO.Put_Line ("else 1408");
end if;
end if;
Writer.N (Top_Level_Writer (Level).Text);
Writer.N (Payload_Writer.Text);
Top_Level_Writer (Level).Text.Clear;
end if;
US_Response.Clear;
end loop;
Ada.Text_IO.Put_Line ("END Print_Type_Title");
end Print_Type_Title;
----------------------
-- Print_Type_Title --
----------------------
procedure Print_Type_Title
(XS_Term : XML.Schema.Objects.Terms.XS_Term;
Indent : String;
Writer : in out XSD_To_Ada.Writers.Writer;
Spec_Writer : in out XSD_To_Ada.Writers.Writer;
Level : Natural := 0)
is
use League.Strings;
Payload_Writer : XSD_To_Ada.Writers.Writer;
Payload_Type_Writer : XSD_To_Ada.Writers.Writer;
Decl : XML.Schema.Element_Declarations.XS_Element_Declaration;
Type_D : XML.Schema.Type_Definitions.XS_Type_Definition;
US_Response : League.Strings.Universal_String;
Mapping_Name : League.Strings.Universal_String;
begin
Decl := XS_Term.To_Element_Declaration;
Type_D := Decl.Get_Type_Definition;
Mapping_Name := Find_Type (Type_D.Get_Name, Map);
Ada.Text_IO.Put_Line
("START Print_Type_Title XS_Term Type_D=" & Type_D.Get_Name.To_UTF_8_String);
for J in 1 .. Types_Table'Last loop
if Type_D.Get_Name.To_UTF_8_String = Types_Table (J).Type_Name.To_UTF_8_String
and then Types_Table (J).Type_State
then
Types_Table (J).Type_State := False;
if Type_D.Get_Name.Length > 10 then
US_Response := League.Strings.Slice
(Type_D.Get_Name,
Type_D.Get_Name.Length - 7,
Type_D.Get_Name.Length);
end if;
if Type_D.Get_Name.Length > 10
and
US_Response.To_UTF_8_String = "Response"
then
null;
else
if XSD_To_Ada.Utils.Has_Element_Session
(Type_D.To_Type_Definition)
then
null;
else
Writers.P
(Top_Level_Writer (Level),
" procedure Encode" & LF
& " (Data : "
& Mapping_Name & ";" & LF
& " Writer : in out XML.SAX.Writers.SAX_Writer'Class;"
& LF
& " Name : League.Strings.Universal_String);"
& LF);
Writers.P
(Top_Level_Writer (Level),
" procedure Encode" & LF
& " (Data : "
& Mapping_Name & ";" & LF
& " Writer : in out XML.SAX.Writers.SAX_Writer'Class;"
& LF
& " Name : League.Strings.Universal_String)" & LF
& " is" & LF
& " use Payloads;" & LF
& " use Ada.Strings.Unbounded;" & LF
& " -- use ICTSClient.Types;" & LF
&" begin");
Writers.P
(Top_Level_Writer (Level),
" Writer.Start_Element (IATS_URI, Name);" & LF);
XSD_To_Ada.Utils.Print_Type_Definition
(Type_D => Type_D.To_Type_Definition,
Indent => Indent,
Writer => Top_Level_Writer (Level),
Name => Type_D.Get_Name,
Anonym_Name => League.Strings.Empty_Universal_String,
Full_Anonym_Name => League.Strings.Empty_Universal_String,
Base_Name => League.Strings.Empty_Universal_String,
Table => Types_Table);
Writers.P
(Top_Level_Writer (Level),
" Writer.End_Element (IATS_URI, Name);"
& LF);
Writers.P (Top_Level_Writer (Level), " end Encode;");
end if;
end if;
Encoder_Top_Writer.N (Top_Level_Writer (Level).Text);
Top_Level_Writer (Level).Text.Clear;
end if;
US_Response.Clear;
end loop;
Ada.Text_IO.Put_Line ("END Print_Type_Title");
end Print_Type_Title;
---------------------------
-- Print_Type_Definition --
---------------------------
procedure Print_Type_Definition
(Type_D : XML.Schema.Type_Definitions.XS_Type_Definition;
Indent : String := "";
Writer : in out Writers.Writer;
Name : League.Strings.Universal_String;
Anonym_Name : League.Strings.Universal_String;
Full_Anonym_Name : League.Strings.Universal_String;
Base_Name : League.Strings.Universal_String;
Table : in out Types_Table_Type_Array;
Is_Max_Occur : Boolean := False;
Is_Min_Occur : Boolean := False;
Top_Max_Occur : Boolean := False)
is
use type XML.Schema.Type_Definitions.XS_Type_Definition;
use League.Strings;
XS_Particle : XML.Schema.Objects.Particles.XS_Particle;
XS_Term : XML.Schema.Objects.Terms.XS_Term;
XS_Base : XML.Schema.Type_Definitions.XS_Type_Definition;
CTD : XML.Schema.Complex_Type_Definitions.XS_Complex_Type_Definition;
STD : XML.Schema.Simple_Type_Definitions.XS_Simple_Type_Definition;
Choice : Boolean := False;
Now_Add : Boolean := False;
Add_Choise : Boolean := False;
Add_Anonym : Boolean := False;
Max_Occurs : Boolean := False;
Min_Occurs : Boolean := False;
Base_Choice_Name : League.Strings.Universal_String;
Name_Kind : League.Strings.Universal_String;
Name_Case : League.Strings.Universal_String;
Anonym_Vector : League.Strings.Universal_String;
Vectop_US : League.Strings.Universal_String;
Anonym_Kind : Writers.Writer;
Vector_Package : Writers.Writer;
----------------
-- Print_Term --
----------------
procedure Print_Term
(XS_Term : XML.Schema.Objects.Terms.XS_Term;
Indent : String := "";
Writer : in out Writers.Writer;
Name : League.Strings.Universal_String;
Map : XSD_To_Ada.Mappings_XML.Mapping_XML;
Table : in out Types_Table_Type_Array)
is
use type XML.Schema.Objects.Terms.Model_Groups.Compositor_Kinds;
use type League.Strings.Universal_String;
XS_Model_Group : XML.Schema.Model_Groups.XS_Model_Group;
XS_List : XML.Schema.Object_Lists.XS_Object_List;
XS_Particle : XML.Schema.Objects.Particles.XS_Particle;
Decl : XML.Schema.Element_Declarations.XS_Element_Declaration;
Type_D : XML.Schema.Type_Definitions.XS_Type_Definition;
Type_Name : League.Strings.Universal_String;
begin
Now_Term_Level := Now_Term_Level + 1;
Ada.Text_IO.Put (Indent);
Ada.Text_IO.Put ("Type " & XS_Term.Get_Type'Img);
Ada.Text_IO.Put_Line (" / XS_Term.Get_Name =" & XS_Term.Get_Name.To_UTF_8_String);
if XS_Term.Is_Model_Group then
XS_Model_Group := XS_Term.To_Model_Group;
XS_List := XS_Model_Group.Get_Particles;
Ada.Text_IO.Put (Indent);
Ada.Text_IO.Put_Line (XS_Model_Group.Get_Compositor'Img);
if XS_Model_Group.Get_Compositor =
XML.Schema.Objects.Terms.Model_Groups.Compositor_Choice
then
Choice := True;
-- if Anonym_Name.To_UTF_8_String /= "" then
Base_Choice_Name :=
League.Strings.To_Universal_String
(Add_Separator (Name) & ".");
-- end if;
if Top_Max_Occur then
Writer.P
(Gen_Type_Line
("case Data."
& Add_Separator (Name) & "."
& Base_Name.To_Wide_Wide_String
& "Element (Index).Kind is", 5));
else
Writer.P
(Gen_Type_Line
("case Data."
& Add_Separator (Name) & "."
& Base_Name.To_Wide_Wide_String
& "Kind is", 5));
end if;
Ada.Text_IO.Put_Line ("!!!!!!!!!!! Choice := True;");
end if;
for J in 1 .. XS_List.Get_Length loop
Ada.Text_IO.Put (Indent);
XS_Particle := XS_List.Item (J).To_Particle;
if XS_Particle.Get_Max_Occurs.Unbounded
then
Max_Occurs := True;
Ada.Text_IO.Put ("Max_Occ <>;");
else
if XS_Particle.Get_Max_Occurs.Value > 1 then
Max_Occurs := True;
Ada.Text_IO.Put ("Max_Occ > 1;");
end if;
end if;
if XS_Particle.Get_Min_Occurs = 0 then
Ada.Text_IO.Put
(XS_Particle.Get_Term.Get_Name.To_UTF_8_String
& " = Min_Occ = 0;");
Min_Occurs := True;
else
Min_Occurs := False;
end if;
Print_Term
(XS_Particle.Get_Term,
Indent & " ", Writer, -- Writer_types,
Name, Map, Table);
if J /= XS_List.Get_Length and Choice then
Name_Kind.Append (", " & LF & " ") ;
end if;
end loop;
if Choice then
Choice := False;
Writer.P ( " end case;" & LF);
Base_Choice_Name.Clear;
end if;
elsif XS_Term.Is_Element_Declaration then
Decl := XS_Term.To_Element_Declaration;
Type_D := Decl.Get_Type_Definition;
Type_Name := Find_Type (Type_D.Get_Name, Map);
if Type_D.Get_Name.To_UTF_8_String = "" then
if Max_Occurs then
Writer.P
(" for Index in 1 .. Natural"
& LF
& " (Data."
& Add_Separator (Name & "_" & XS_Term.Get_Name)
& ".Length) loop");
end if;
Writers.N (Writer, Write_Start_Element (XS_Term.Get_Name));
Writers.P (Writer, "-- SSSSSSSSSSSS");
XSD_To_Ada.Utils.Print_Type_Definition
(Type_D => Type_D,
Indent => " " & Indent,
Writer => Writer,
Name => League.Strings.To_Universal_String
(Add_Separator ((Name) & "_" & XS_Term.Get_Name)),
Anonym_Name => League.Strings.To_Universal_String (""), -- must be deleted
Full_Anonym_Name => League.Strings.To_Universal_String
(Add_Separator ((Name) & "_" & XS_Term.Get_Name) & "."),
Base_Name => Base_Name,
Table => Types_Table,
Is_Max_Occur => False,
Is_Min_Occur => Min_Occurs,
Top_Max_Occur => Max_Occurs);
Anonyn_Vector (Now_Term_Level).Term_State := True;
Writers.P
(Writer,
" Writer.End_Element (IATS_URI, "
& Add_Separator (XS_Term.Get_Name)
& "_Name); -- EEEEEEEEE"
& LF);
if Max_Occurs then
Writer.P (" end loop;" & LF);
end if;
Add_Anonym := False;
end if;
if Choice then
null;
end if;
if Type_D.Get_Name.To_UTF_8_String /= ""
then
if Choice then
Writer.P
(" when Payloads."
& Add_Separator (XS_Term.Get_Name)
& "_Case =>");
end if;
Generate_Type
(Type_D => Type_D,
Indent => Indent,
XS_Term => XS_Term,
Type_Name => Type_Name,
Name => League.Strings.To_Universal_String
(Add_Separator (Name)),
Anonym_Name => Anonym_Name,
Full_Anonym_Name => Full_Anonym_Name,
Base_Choice_Name => Base_Choice_Name,
Base_Name => Base_Name,
Table => Table,
Max_Occurs => Max_Occurs,
Top_Max_Occurs => Top_Max_Occur,
Min_Occurs => Min_Occurs,
Choice => Choice,
Writer => Writer,
Level => Now_Term_Level);
end if;
end if;
Now_Term_Level := Now_Term_Level - 1;
end Print_Term;
begin
Min_Occurs := Is_Min_Occur;
Now_Print_Level := Now_Print_Level + 1;
XS_Base := Type_D.Get_Base_Type;
if XS_Base.Get_Type_Category in
XML.Schema.Complex_Type .. XML.Schema.Simple_Type
and XS_Base /= Type_D -- This is to filter predefined types
then
Ada.Text_IO.Put_Line (Indent & " is new");
Print_Type_Definition
(Type_D => XS_Base,
Indent => Indent & " ",
Writer => Writer, -- Writer_types,
Name => League.Strings.To_Universal_String
(Add_Separator (XS_Base.Get_Name)),
Anonym_Name => League.Strings.Empty_Universal_String,
Full_Anonym_Name => League.Strings.To_Universal_String
(Add_Separator (XS_Base.Get_Name) & "."),
Base_Name => League.Strings.To_Universal_String
(Add_Separator (XS_Base.Get_Name) & "."),
Table => Table);
end if;
case Type_D.Get_Type_Category is
when XML.Schema.Complex_Type =>
CTD := Type_D.To_Complex_Type_Definition;
if CTD.Get_Content_Type in Element_Only | Mixed then
Ada.Text_IO.Put_Line
(Indent & "Complex_Type :" & Type_D.Get_Name.To_UTF_8_String);
XS_Particle := CTD.Get_Particle;
XS_Term := XS_Particle.Get_Term;
Print_Term (XS_Term, Indent & " ", Writer, Name, Map, Table);
Ada.Text_IO.Put_Line
(Indent & "End Complex_Type :" & Type_D.Get_Name.To_UTF_8_String);
end if;
when XML.Schema.Simple_Type =>
Ada.Text_IO.Put
(Indent & "Simple_Type : " & Type_D.Get_Name.To_UTF_8_String);
STD := Type_D.To_Simple_Type_Definition;
when XML.Schema.None =>
Ada.Text_IO.Put_Line (Indent & "NONE!!!");
end case;
-- if Add_Choise then
-- Writers.P
-- (Writer_types,
-- Name_Kind.To_Wide_Wide_String & ");"
-- & Wide_Wide_Character'Val (10));
--
-- Writers.P
-- (Writer_types,
-- Name_Case.To_Wide_Wide_String
-- & " end case;" & Wide_Wide_Character'Val (10)
-- & " end record;" & Wide_Wide_Character'Val (10));
--
-- Name_Kind.Clear;
-- Name_Case.Clear;
-- Now_Add := False;
-- Add_Choise := False;
-- end if;
--
-- if Add_Anonym then
-- Writers.P
-- (Writer_types,
-- Anonym_Kind.Text.To_Wide_Wide_String
-- & " end record;"
-- & Wide_Wide_Character'Val (10));
--
-- Writers.P (Writer_types, Anonym_Vector);
--
-- Anonym_Kind.Text.Clear;
-- end if;
--
-- Writers.N (Writer_types, Vector_Package.Text);
Choice := False;
Now_Print_Level := Now_Print_Level - 1;
end Print_Type_Definition;
-------------------------
-- Has_Element_Session --
-------------------------
function Has_Element_Session
(Type_D : XML.Schema.Type_Definitions.XS_Type_Definition)
return Boolean
is
use type XML.Schema.Type_Definitions.XS_Type_Definition;
XS_Particle : XML.Schema.Objects.Particles.XS_Particle;
XS_Term : XML.Schema.Objects.Terms.XS_Term;
XS_Model_Group : XML.Schema.Model_Groups.XS_Model_Group;
XS_List : XML.Schema.Object_Lists.XS_Object_List;
Decl : XML.Schema.Element_Declarations.XS_Element_Declaration;
CTD : XML.Schema.Complex_Type_Definitions.XS_Complex_Type_Definition;
STD : XML.Schema.Simple_Type_Definitions.XS_Simple_Type_Definition;
begin
case Type_D.Get_Type_Category is
when XML.Schema.Complex_Type =>
CTD := Type_D.To_Complex_Type_Definition;
if CTD.Get_Content_Type in Element_Only | Mixed then
XS_Particle := CTD.Get_Particle;
XS_Term := XS_Particle.Get_Term;
XS_Model_Group := XS_Term.To_Model_Group;
XS_List := XS_Model_Group.Get_Particles;
for J in 1 .. XS_List.Get_Length loop
XS_Particle := XS_List.Item (J).To_Particle;
XS_Term := XS_Particle.Get_Term;
Decl := XS_Term.To_Element_Declaration;
if Decl.Get_Name.To_UTF_8_String = "Session" then
return True;
end if;
return Has_Element_Session (Decl.Get_Type_Definition);
end loop;
end if;
when XML.Schema.Simple_Type =>
STD := Type_D.To_Simple_Type_Definition;
when XML.Schema.None =>
null;
end case;
return False;
end Has_Element_Session;
----------------
-- Put_Header --
----------------
procedure Put_Header (Self : in out XSD_To_Ada.Writers.Writer) is
Lin : constant Wide_Wide_String (1 .. 77) := (others => '-');
begin
Self.P (Lin);
Self.P ("-- Copyright © 2013 ACTForex, Inc.");
Self.P ("-- All rights reserved.");
Self.P (Lin);
Self.P
("-- This file is generated by xsd_to_Ada, don't edit it.");
Self.P (Lin);
Self.P ("");
end Put_Header;
function Read_Mapping
(File_Name : League.Strings.Universal_String)
return XSD_To_Ada.Mappings_XML.Mapping_XML
is
Source : aliased XML.SAX.Input_Sources.Streams.Files.File_Input_Source;
Reader : aliased XML.SAX.Simple_Readers.SAX_Simple_Reader;
Handler : aliased XSD_To_Ada.Mappings_XML.Mapping_XML;
begin
Reader.Set_Content_Handler (Handler'Unchecked_Access);
Source.Open_By_File_Name (File_Name);
Reader.Parse (Source'Access);
return Handler;
end Read_Mapping;
function Write_Start_Element
(Name : League.Strings.Universal_String)
return League.Strings.Universal_String
is
use League.Strings;
Add : Boolean := False;
begin
for Index in 1 .. Element_Vector.Length loop
if Element_Vector.Element (Index).To_UTF_8_String
= Name.To_UTF_8_String
then
Add := True;
exit;
end if;
end loop;
if not Add then
Element_Vector.Append (Name);
Element_Name.P
(Gen_Type_Line
(Add_Separator (Name)
& "_Name : constant League.Strings.Universal_String :=", 3)
& LF
& " League.Strings.To_Universal_String ("""
& Name & """);" & LF);
end if;
return
League.Strings.To_Universal_String
(" Writer.Start_Element (IATS_URI, "
& Add_Separator (Name) & "_Name);" & LF);
end;
end XSD_To_Ada.Utils;
|
gagath/ada_menu | Ada | 963 | ads | with Ada.Strings.Unbounded;
with Ada.Containers.Vectors;
package Menu is
-- More convenient way to access unbounded strings
package SU renames Ada.Strings.Unbounded;
-- Access to procedure to call for items
type T_Func_Ptr is access procedure;
-- An item in the menu
type T_Item is
record
Symbol : Character;
Name : SU.Unbounded_String;
Func : T_Func_Ptr;
end record;
-- A collection of items
package T_Items is new Ada.Containers.Vectors
(Element_Type => T_Item,
Index_Type => Natural);
-- A menu
type T_Menu is
record
Title : SU.Unbounded_String;
Items : T_Items.Vector;
end record;
procedure Add_Item(M : in out T_Menu; Item : in T_Item);
-- Show a menu's title and all of its items
procedure Show(M : in T_Menu);
-- Show a menu, ask answer and call corresponding func
procedure Query(M : in T_Menu);
end Menu;
|
stcarrez/ada-util | Ada | 2,795 | adb | -----------------------------------------------------------------------
-- util-systems-io -- System low level and raw IO operations
-- Copyright (C) 2023 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.IO_Exceptions;
with Ada.Strings.UTF_Encoding.Strings;
with Ada.Strings.UTF_Encoding.Wide_Wide_Strings;
with System;
package body Util.Systems.IO is
use Ada.Strings.UTF_Encoding;
-- ------------------------------
-- Write the Latin-1 string and encode it in UTF-8.
-- ------------------------------
procedure Put (File : in File_Type;
Content : in String) is
S : constant UTF_8_String := Strings.Encode (Content);
begin
Put_Raw (File, S);
end Put;
procedure Put (File : in File_Type;
C : in Character) is
S : constant String (1 .. 1) := (others => C);
begin
Put (File, S);
end Put;
-- ------------------------------
-- Write the string or wide character content using UTF-8 encoding.
-- ------------------------------
procedure Put_UTF_8 (File : in File_Type;
Content : in Wide_Wide_String) is
S : constant UTF_8_String := Wide_Wide_Strings.Encode (Content);
begin
Put_Raw (File, S);
end Put_UTF_8;
procedure Put_UTF_8 (File : in File_Type;
C : in Wide_Wide_Character) is
S : constant Wide_Wide_String (1 .. 1) := (others => C);
begin
Put_UTF_8 (File, S);
end Put_UTF_8;
-- ------------------------------
-- Write the string considered as a sequence of bytes (no change).
-- ------------------------------
procedure Put_Raw (File : in File_Type;
Content : in Ada.Strings.UTF_Encoding.UTF_8_String) is
use Util.Systems.Os;
Res : aliased DWORD := 0;
Status : BOOL;
begin
Status := Write_File (File, Content'Address, Content'Length,
Res'Unchecked_Access, System.Null_Address);
if Status = 0 then
raise Ada.IO_Exceptions.Device_Error;
end if;
end Put_Raw;
end Util.Systems.IO;
|
reznikmm/matreshka | Ada | 4,568 | 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_Table.Name_Attributes is
------------
-- Create --
------------
overriding function Create
(Parameters : not null access Matreshka.DOM_Attributes.Attribute_L2_Parameters)
return Table_Name_Attribute_Node is
begin
return Self : Table_Name_Attribute_Node do
Matreshka.ODF_Table.Constructors.Initialize
(Self'Unchecked_Access,
Parameters.Document,
Matreshka.ODF_String_Constants.Table_Prefix);
end return;
end Create;
--------------------
-- Get_Local_Name --
--------------------
overriding function Get_Local_Name
(Self : not null access constant Table_Name_Attribute_Node)
return League.Strings.Universal_String
is
pragma Unreferenced (Self);
begin
return Matreshka.ODF_String_Constants.Name_Attribute;
end Get_Local_Name;
begin
Matreshka.DOM_Documents.Register_Attribute
(Matreshka.ODF_String_Constants.Table_URI,
Matreshka.ODF_String_Constants.Name_Attribute,
Table_Name_Attribute_Node'Tag);
end Matreshka.ODF_Table.Name_Attributes;
|
reznikmm/spawn | Ada | 10,206 | adb | --
-- Copyright (C) 2018-2023, AdaCore
--
-- SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
--
pragma Warnings (Off, "internal GNAT unit");
with System.OS_Interface;
pragma Warnings (On);
with Glib.Error;
with Glib.Spawn;
with Gtkada.Types;
with Spawn.Environments.Internal;
with Spawn.Posix;
package body Spawn.Internal is
type Process_Access is access all Process'Class;
function Spawn_Async_With_Fds is
new Glib.Spawn.Generic_Spawn_Async_With_Fds
(User_Data => Glib.Gint);
function Child_Watch is new Glib.Main.Generic_Child_Add_Watch
(User_Data => Internal.Process_Reference);
procedure My_Death_Callback
(pid : Glib.Spawn.GPid;
status : Glib.Gint;
data : access Internal.Process_Reference)
with Convention => C;
procedure Do_Start_Process (Self : aliased in out Process'Class);
procedure Setup_Child_Process (Fd : access Glib.Gint)
with Convention => C;
-- Setup session and controlling terminal when pseudoterminal is used
-- for interprocess communication.
package body Environments is
---------
-- "=" --
---------
function "=" (Left, Right : UTF_8_String) return Boolean is
begin
return Standard."=" (Left, Right);
end "=";
---------
-- "<" --
---------
function "<" (Left, Right : UTF_8_String) return Boolean is
begin
return Standard."<" (Left, Right);
end "<";
end Environments;
--------------------------
-- Close_Standard_Error --
--------------------------
procedure Close_Standard_Error (Self : in out Process'Class) is
begin
Spawn.Channels.Shutdown_Stderr (Self.Channels);
end Close_Standard_Error;
--------------------------
-- Close_Standard_Input --
--------------------------
procedure Close_Standard_Input (Self : in out Process'Class) is
begin
Spawn.Channels.Shutdown_Stdin (Self.Channels);
end Close_Standard_Input;
---------------------------
-- Close_Standard_Output --
---------------------------
procedure Close_Standard_Output (Self : in out Process'Class) is
begin
Spawn.Channels.Shutdown_Stdout (Self.Channels);
end Close_Standard_Output;
----------------------
-- Do_Start_Process --
----------------------
procedure Do_Start_Process (Self : aliased in out Process'Class) is
use Glib;
use type Interfaces.C.size_t;
procedure Prepare_Arguments (argv : out Gtkada.Types.Chars_Ptr_Array);
-- Allocate argumnets
-----------------------
-- Prepare_Arguments --
-----------------------
procedure Prepare_Arguments (argv : out Gtkada.Types.Chars_Ptr_Array) is
begin
argv (0) := Gtkada.Types.New_String (Self.Program);
for J in 1 .. Self.Arguments.Last_Index loop
argv (Interfaces.C.size_t (J)) := Gtkada.Types.New_String
(Self.Arguments.Element (J));
end loop;
argv (argv'Last) := Gtkada.Types.Null_Ptr;
end Prepare_Arguments;
pid : aliased Glib.Spawn.GPid
with Import, Address => Self.pid'Address;
dir : Gtkada.Types.Chars_Ptr :=
(if Self.Working_Directory'Length = 0 then Gtkada.Types.Null_Ptr
else Gtkada.Types.New_String (Self.Working_Directory));
argv : aliased Gtkada.Types.Chars_Ptr_Array :=
(0 .. Interfaces.C.size_t (Self.Arguments.Length) + 1 => <>);
envp : aliased Gtkada.Types.Chars_Ptr_Array :=
Spawn.Environments.Internal.Raw (Self.Environment);
Error : aliased Glib.Error.GError;
Status : Glib.Gboolean;
PTY : aliased Glib.Gint;
Child : Spawn.Channels.Pipe_Array;
begin
Self.Reference.Self := Self'Unchecked_Access;
Prepare_Arguments (argv);
Spawn.Channels.Setup_Channels (Self.Channels, Self.Use_PTY, Child);
PTY := Spawn.Channels.PTY_Slave (Self.Channels);
Status :=
Spawn_Async_With_Fds
(Working_Directory => dir,
Argv => argv'Access,
Envp => envp'Access,
Flags => Glib.Spawn.G_Spawn_Do_Not_Reap_Child,
Child_Setup => Setup_Child_Process'Access,
Data => PTY'Unchecked_Access,
Child_Pid => pid'Access,
Stdin_Fd => Child (Spawn.Common.Stdin),
Stdout_Fd => Child (Spawn.Common.Stdout),
Stderr_Fd => Child (Spawn.Common.Stderr),
Error => Error'Access);
Gtkada.Types.Free (argv);
Gtkada.Types.Free (envp);
Gtkada.Types.Free (dir);
Spawn.Channels.Close_Child_Descriptors (Self.Channels);
if Status = 0 then
Spawn.Channels.Shutdown_Channels (Self.Channels);
Self.Emit_Error_Occurred (Integer (Glib.Error.Get_Code (Error)));
return;
end if;
Self.Event := Child_Watch
(pid,
My_Death_Callback'Access,
Self.Reference'Access);
Self.Status := Running;
Self.Emit_Started;
Spawn.Channels.Start_Watch (Self.Channels);
end Do_Start_Process;
--------------
-- Finalize --
--------------
overriding procedure Finalize (Self : in out Process) is
use type Glib.Main.G_Source_Id;
begin
Spawn.Channels.Shutdown_Channels (Self.Channels);
if Self.Event /= Glib.Main.No_Source_Id then
Glib.Main.Remove (Self.Event);
Self.Event := Glib.Main.No_Source_Id;
end if;
Glib.Spawn.Spawn_Close_Pid (Glib.Spawn.GPid (Self.pid));
Self.pid := 0;
end Finalize;
----------------
-- Identifier --
----------------
function Identifier (Self : Process'Class) return String is
use type Interfaces.C.int;
Image : constant String := Self.pid'Image;
begin
return (if Self.pid = 0 then "" else Image (2 .. Image'Last));
end Identifier;
------------------
-- Kill_Process --
------------------
procedure Kill_Process (Self : in out Process'Class) is
use type Interfaces.C.int;
Code : constant Interfaces.C.int :=
Spawn.Posix.kill
(Self.pid, Interfaces.C.int (System.OS_Interface.SIGKILL));
begin
pragma Assert (Code = 0);
end Kill_Process;
-----------------------
-- My_Death_Callback --
-----------------------
procedure My_Death_Callback
(pid : Glib.Spawn.GPid;
status : Glib.Gint;
data : access Internal.Process_Reference)
is
use type Glib.GQuark;
function G_SPAWN_EXIT_ERROR return Glib.GQuark
with Import => True,
Convention => C,
External_Name => "g_spawn_exit_error_quark";
Self : constant Process_Access := Process_Access (data.Self);
Error : aliased Glib.Error.GError;
begin
Glib.Spawn.Spawn_Close_Pid (pid);
Self.Event := Glib.Main.No_Source_Id;
Self.pid := 0;
if Glib.Spawn.Spawn_Check_Exit_Status
(status, Error'Access)
then
Self.Exit_Status := Normal;
Self.Exit_Code := 0;
else
Self.Exit_Status :=
(if Glib.Error.Get_Domain (Error) = G_SPAWN_EXIT_ERROR
then Normal
else Crash);
Self.Exit_Code := Process_Exit_Code (Glib.Error.Get_Code (Error));
end if;
if Spawn.Channels.Is_Active (Self.Channels) then
Self.Pending_Finish := True;
return;
end if;
begin
Self.Status := Not_Running;
Self.Emit_Finished (Self.Exit_Status, Self.Exit_Code);
exception
when others =>
null;
end;
Spawn.Channels.Shutdown_Channels (Self.Channels);
exception
when E : others =>
Self.Emit_Exception_Occurred (E);
end My_Death_Callback;
-------------------------
-- Read_Standard_Error --
-------------------------
procedure Read_Standard_Error
(Self : in out Process'Class;
Data : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset;
Success : in out Boolean) is
begin
Spawn.Channels.Read_Stderr (Self.Channels, Data, Last, Success);
end Read_Standard_Error;
--------------------------
-- Read_Standard_Output --
--------------------------
procedure Read_Standard_Output
(Self : in out Process'Class;
Data : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset;
Success : in out Boolean) is
begin
Spawn.Channels.Read_Stdout (Self.Channels, Data, Last, Success);
end Read_Standard_Output;
-------------------------
-- Setup_Child_Process --
-------------------------
procedure Setup_Child_Process (Fd : access Glib.Gint) is
use type Glib.Gint;
Ignore : Interfaces.C.int;
-- Any failures are ignored.
begin
if Fd.all /= -1 then
Ignore := Spawn.Posix.setsid;
Ignore :=
Spawn.Posix.ioctl
(Interfaces.C.int (Fd.all), Spawn.Posix.TIOCSCTTY, 0);
end if;
end Setup_Child_Process;
-----------
-- Start --
-----------
procedure Start (Self : in out Process'Class) is
begin
Self.Status := Starting;
Self.Exit_Code := -1;
Do_Start_Process (Self);
end Start;
-----------------------
-- Terminate_Process --
-----------------------
procedure Terminate_Process (Self : in out Process'Class) is
use type Interfaces.C.int;
Code : constant Interfaces.C.int :=
Spawn.Posix.kill
(Self.pid, Interfaces.C.int (System.OS_Interface.SIGTERM));
begin
pragma Assert (Code = 0);
end Terminate_Process;
--------------------------
-- Write_Standard_Input --
--------------------------
procedure Write_Standard_Input
(Self : in out Process'Class;
Data : Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset;
Success : in out Boolean) is
begin
Spawn.Channels.Write_Stdin (Self.Channels, Data, Last, Success);
end Write_Standard_Input;
end Spawn.Internal;
|
msrLi/portingSources | Ada | 850 | ads | -- Copyright 2008-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/>.
with System;
package Pck is
function Ident (I : Integer) return Integer;
procedure Do_Nothing (A : System.Address);
end Pck;
|
AdaCore/Ada-IntelliJ | Ada | 105 | adb | WITH Ada.TeXt_iO;
ProCEDure HElLoworLd iS
beGin
ADA.tEXt_Io.PuT_liNE("Hello, World!");
ENd heLLoWORlD;
|
AdaCore/libadalang | Ada | 156 | adb | procedure Testderenum is
type En is (A, B, C);
type En2 is new En range B .. C;
E : En2 := B;
begin
null;
end Testderenum;
pragma Test_Block;
|
godunko/adawebpack | Ada | 3,182 | ads | ------------------------------------------------------------------------------
-- --
-- AdaWebPack --
-- --
------------------------------------------------------------------------------
-- Copyright © 2021, Vadim Godunko --
-- All rights reserved. --
-- --
-- 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 Web.HTML.Elements;
package Web.HTML.Opt_Groups is
pragma Preelaborate;
type HTML_Opt_Group_Element is
new Web.HTML.Elements.HTML_Element with null record;
function Get_Disabled (Self : HTML_Opt_Group_Element'Class) return Boolean;
procedure Set_Disabled
(Self : in out HTML_Opt_Group_Element'Class; To : Boolean);
-- Whether the form control is disabled
end Web.HTML.Opt_Groups;
|
reznikmm/matreshka | Ada | 4,049 | 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.Text_Use_Draw_Objects_Attributes;
package Matreshka.ODF_Text.Use_Draw_Objects_Attributes is
type Text_Use_Draw_Objects_Attribute_Node is
new Matreshka.ODF_Text.Abstract_Text_Attribute_Node
and ODF.DOM.Text_Use_Draw_Objects_Attributes.ODF_Text_Use_Draw_Objects_Attribute
with null record;
overriding function Create
(Parameters : not null access Matreshka.DOM_Attributes.Attribute_L2_Parameters)
return Text_Use_Draw_Objects_Attribute_Node;
overriding function Get_Local_Name
(Self : not null access constant Text_Use_Draw_Objects_Attribute_Node)
return League.Strings.Universal_String;
end Matreshka.ODF_Text.Use_Draw_Objects_Attributes;
|
reznikmm/matreshka | Ada | 4,065 | 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.Draw_Tile_Repeat_Offset_Attributes;
package Matreshka.ODF_Draw.Tile_Repeat_Offset_Attributes is
type Draw_Tile_Repeat_Offset_Attribute_Node is
new Matreshka.ODF_Draw.Abstract_Draw_Attribute_Node
and ODF.DOM.Draw_Tile_Repeat_Offset_Attributes.ODF_Draw_Tile_Repeat_Offset_Attribute
with null record;
overriding function Create
(Parameters : not null access Matreshka.DOM_Attributes.Attribute_L2_Parameters)
return Draw_Tile_Repeat_Offset_Attribute_Node;
overriding function Get_Local_Name
(Self : not null access constant Draw_Tile_Repeat_Offset_Attribute_Node)
return League.Strings.Universal_String;
end Matreshka.ODF_Draw.Tile_Repeat_Offset_Attributes;
|
sungyeon/drake | Ada | 1,034 | ads | pragma License (Unrestricted);
-- implementation unit required by compiler
with System.Packed_Arrays;
package System.Pack_14 is
pragma Preelaborate;
-- It can not be Pure, subprograms would become __attribute__((const)).
type Bits_14 is mod 2 ** 14;
for Bits_14'Size use 14;
package Indexing is new Packed_Arrays.Indexing (Bits_14);
-- required for accessing aligned arrays by compiler
function Get_14 (
Arr : Address;
N : Natural;
Rev_SSO : Boolean)
return Bits_14
renames Indexing.Get;
procedure Set_14 (
Arr : Address;
N : Natural;
E : Bits_14;
Rev_SSO : Boolean)
renames Indexing.Set;
-- required for accessing unaligned arrays by compiler
function GetU_14 (
Arr : Address;
N : Natural;
Rev_SSO : Boolean)
return Bits_14
renames Indexing.Get;
procedure SetU_14 (
Arr : Address;
N : Natural;
E : Bits_14;
Rev_SSO : Boolean)
renames Indexing.Set;
end System.Pack_14;
|
davidkristola/vole | Ada | 38,102 | adb | with Ada.Text_IO; use Ada.Text_IO;
with Ada.Streams;
with Ada.Streams.Stream_IO;
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Interfaces; use Interfaces;
with AUnit.Assertions; use AUnit.Assertions;
with kv.avm.references; use kv.avm.references;
with kv.avm.Memories;
with kv.avm.Assemblers;
with kv.avm.Instructions;
with kv.avm.Registers;
with kv.avm.Instances;
with kv.avm.Machines;
with kv.avm.Processors;
with kv.avm.Tuples;
with kv.avm.Actor_References;
with kv.avm.actor_pool;
with kv.avm.Actors;
with kv.avm.log;
with kv.avm.Methods;
with kv.avm.Control;
with kv.avm.Messages;
with kv.avm.Capabilities;
package body kv.avm.Asm_Tests is
-----------------------------------------------------------------------------
function U(Value : Interfaces.Unsigned_64) return kv.avm.Registers.Register_Type is
begin
return (format => kv.avm.Registers.Unsigned_Integer, unsigned_value => Value);
end U;
-----------------------------------------------------------------------------
function Name (T : Test_A1) return AUnit.Message_String is
pragma Unreferenced (T);
begin
return AUnit.Format ("test A1: basic parsing.");
end Name;
procedure Run_Test (T : in out Test_A1) is
Builder : aliased kv.avm.Assemblers.Assembler_Type;
Ref : Reference_Type;
use kv.avm.Instructions;
begin
Put_Line("test A1");
Ref := Make_Reference("C0");
Assert(Ref.Memory = Fixed, "Improperly built reference");
Assert(Ref.Index = 0, "Improperly built reference");
Ref := Make_Reference("I25");
Assert(Ref.Memory = Input, "Improperly built reference");
Assert(Ref.Index = 25, "Improperly built reference");
Ref := Make_Reference("I0");
Assert(Ref.Memory = Input, "Improperly built reference");
Assert(Ref.Index = 0, "Improperly built reference");
Ref := Make_Reference("a3");
Assert(Ref.Memory = Attribute, "Improperly built reference");
Assert(Ref.Index = 3, "Improperly built reference");
Ref := Make_Reference("L63");
Assert(Ref.Memory = Local, "Improperly built reference");
Assert(Ref.Index = 63, "Improperly built reference");
Builder.Initialize;
Assert(Builder.Lines_Parsed = 0, "Lines_Parsed");
Builder.Parse_Line("# comment");
Assert(Builder.Lines_Parsed = 1, "Lines_Parsed");
Builder.Parse_Line(""); -- blank
Assert(Builder.Lines_Parsed = 2, "Lines_Parsed");
Builder.Parse_Line("# comment");
Builder.Parse_Line(".actor Test_A1");
Assert(Builder.Actor.Name.all = "Test_A1", "Actor error");
Builder.Parse_Line(" C0 uint 0");
Builder.Parse_Line("..message CONSTRUCTOR");
Builder.Parse_Line(" REPLY C0"); -- Format 1
Assert(Builder.Actor.Message.Name.all = "CONSTRUCTOR", "Message Error");
Assert(Builder.Actor.Message.Count = 1, "Message Error");
Assert(Builder.Actor.Message.Code(0) = (op_code => REPLY, value => (memory => fixed, index => 0)), "Instruction Parsing Error");
Builder.Parse_Line(" terminate_program"); -- Format 0
Assert(Builder.Actor.Message.Code(1) = (op_code => TERMINATE_PROGRAM), "Instruction Parsing Error");
Builder.Parse_Line(" SET L3 C7"); -- Format 2
Assert(Builder.Actor.Message.Code(2) = (op_code => SET,
lhs => (memory => local, index => 3),
rhs => (memory => fixed, index => 7)), "Instruction Parsing Error");
Builder.Parse_Line(" trap L4 L3 C7"); -- Format 3
Assert(Builder.Actor.Message.Code(3) = (op_code => trap,
a => (memory => local, index => 4),
x => (memory => local, index => 3),
y => (memory => fixed, index => 7)), "Instruction Parsing Error");
Builder.Parse_Line(" EMIT I0"); -- Format 1
Assert(Builder.Actor.Message.Count = 5, "Instruction Count Error");
-- Format 3b
Builder.Parse_Line(" COMPUTE A1 := L1 * L2"); -- Format 3b
Assert(Builder.Actor.Message.Count = 6, "Instruction Count Error");
end Run_Test;
-----------------------------------------------------------------------------
function Name (T : Test_A2) return AUnit.Message_String is
pragma Unreferenced (T);
begin
return AUnit.Format ("test A2: a few more parsing tricks.");
end Name;
procedure Run_Test (T : in out Test_A2) is
Builder : aliased kv.avm.Assemblers.Assembler_Type;
use kv.avm.Registers;
begin
Put_Line("test A2");
Builder.Initialize;
Builder.Parse_Line(".actor Fred");
Builder.Parse_Line("..message Message_1");
Builder.Parse_Line("..message Message_2");
Builder.Parse_Line(".actor Wilma");
Builder.Parse_Line(" ");
Builder.Parse_Line(" C12 : uint := 347");
Builder.Parse_Line(" C13 adef Test_A1_Calculator");
Builder.Parse_Line(" C14 mdef Compute");
Assert(Builder.Actor.F_Max = 14, "Wrong fixed max");
Assert(Builder.Actor.Fixed(12).Format = Unsigned_Integer, "Expected Unsigned_Integer, found "&
Data_Kind'IMAGE(Builder.Actor.Fixed(12).Format));
Assert(Builder.Actor.Fixed(12).unsigned_value = 347, "Expected 347, found "&
Interfaces.Unsigned_64'IMAGE(Builder.Actor.Fixed(12).unsigned_value));
Assert(Builder.Actor.Fixed(13).Format = Actor_Definition, "Expected Actor_Definition, found "&
Data_Kind'IMAGE(Builder.Actor.Fixed(13).Format));
Assert(Builder.Actor.Fixed(14).Format = Message_Definition, "Expected Message_Definition, found "&
Data_Kind'IMAGE(Builder.Actor.Fixed(14).Format));
Assert((+Builder.Actor.Fixed(13).Actor_Kind) = "Test_A1_Calculator", "Expected Test_A1_Calculator, found "&
(+Builder.Actor.Fixed(13).Actor_Kind));
Assert((+Builder.Actor.Fixed(14).Message_Name) = "Compute", "Expected Compute, found "&
(+Builder.Actor.Fixed(14).Message_Name));
Assert(kv.avm.Assemblers.Make_Word_Code_Name("test_a1.volea") = "test_a1.volec", "Make_Word_Code_Name failed.");
Builder.Parse_Line("..message Message_3 # just another messageg");
-- Now append more constants onto the actor and make sure the last one is still 14.
Builder.Parse_Line("..constants # append some more constants");
Builder.Parse_Line(" C7 int64_t -13");
Assert(Builder.Actor.F_Max = 14, "Last constant is not longer 14");
Assert(Builder.Actor.Fixed(7).Format = Signed_Integer, "Expected Signed_Integer, found "&
Data_Kind'IMAGE(Builder.Actor.Fixed(7).Format));
Assert(Builder.Actor.Fixed(7).Signed_value = -13, "Expected -13, found "&
Interfaces.Integer_64'IMAGE(Builder.Actor.Fixed(7).Signed_value));
Builder.Parse_Line(" C8 : str := ""fr# ed""");
Assert(Builder.Actor.Fixed(8).Format = Immutable_String, "Expected Immutable_String, found "&
Data_Kind'IMAGE(Builder.Actor.Fixed(8).Format));
Assert(Builder.Actor.Fixed(8).The_String = +"fr# ed", "The string was wrong.");
Builder.Parse_Line(" C10 : TUPLE_MAP := [ L3, L6, L7] # ignore this comment");
Assert(Builder.Actor.Fixed(10).Format = Tuple_Map, "Expected Tuple_Map, found "&
Data_Kind'IMAGE(Builder.Actor.Fixed(10).Format));
end Run_Test;
-----------------------------------------------------------------------------
function Name (T : Test_A3) return AUnit.Message_String is
pragma Unreferenced (T);
begin
return AUnit.Format ("test A3: Parse a file.");
end Name;
procedure Run_Test (T : in out Test_A3) is
Builder : aliased kv.avm.Assemblers.Assembler_Type;
begin
Put_Line("test A3");
Builder.Initialize;
Builder.Parse_Input_File("test_a1.volea");
Assert(True, "All is good.");
end Run_Test;
-----------------------------------------------------------------------------
function Name (T : Test_A4) return AUnit.Message_String is
pragma Unreferenced (T);
begin
return AUnit.Format ("test A4: Load and execute asm.");
end Name;
procedure Run_Test (T : in out Test_A4) is
Builder : aliased kv.avm.Assemblers.Assembler_Type;
VM : aliased kv.avm.Machines.Machine_Type;
CPU : aliased kv.avm.Processors.Processor_Type;
Instance_Factory : aliased kv.avm.Instances.Instance_Factory;
Data : aliased kv.avm.Tuples.Tuple_Type;
Instance_1 : kv.avm.Actor_References.Actor_Reference_Type;
Registers : kv.avm.Memories.Register_Array_Type;
use kv.avm.Registers;
begin
Put_Line("test A4");
Builder.Initialize;
Builder.Parse_Input_File("test_a1.volea");
Builder.Transfer_Actors_To_Store;
VM.Initialize(CPU'UNCHECKED_ACCESS, Instance_Factory'UNCHECKED_ACCESS);
CPU.Initialize(VM'UNCHECKED_ACCESS);
Registers.Initialize((Make_U(0), Make_U(1)));
VM.Start_With("Test_A1", "Go", Registers);
while not VM.Done loop
VM.Step;
Assert(VM.Get_Steps < 200, "Too many steps have been taken.");
end loop;
Assert(VM.Get_Steps = 60, "Wrong step count."&Natural'IMAGE(VM.Get_Steps));
end Run_Test;
-----------------------------------------------------------------------------
function Name (T : Test_A5) return AUnit.Message_String is
pragma Unreferenced (T);
begin
return AUnit.Format ("test A5: Streams.");
end Name;
procedure Run_Test (T : in out Test_A5) is
pragma Unreferenced (T);
package SIO renames Ada.Streams.Stream_IO;
F : SIO.File_Type;
S : SIO.Stream_Access;
I : Integer;
begin
Put_Line("test A5");
SIO.Create(F, SIO.Out_File, "test_a5.volec");
S := SIO.Stream(F);
Integer'WRITE(S, 1127);
Integer'WRITE(S, 1349);
SIO.Close(F);
SIO.Open(F, SIO.In_File, "test_a5.volec");
S := SIO.Stream(F);
Integer'READ(S, I);
Assert(I = 1127, "1127");
Integer'READ(S, I);
Assert(I = 1349, "1349");
SIO.Close(F);
Assert(True, "All is good.");
end Run_Test;
-----------------------------------------------------------------------------
function Name (T : Test_A6) return AUnit.Message_String is
pragma Unreferenced (T);
begin
return AUnit.Format ("test A6: data stream.");
end Name;
procedure Run_Test (T : in out Test_A6) is
pragma Unreferenced (T);
Builder : aliased kv.avm.Assemblers.Assembler_Type;
Builder2 : aliased kv.avm.Assemblers.Assembler_Type;
package SIO renames Ada.Streams.Stream_IO;
F : SIO.File_Type;
S : SIO.Stream_Access;
use kv.avm.Assemblers;
use kv.avm.Registers;
use kv.avm.Instructions;
A1 : Actor_Pointer;
A2 : Actor_Pointer;
M1 : Message_Access;
M2 : Message_Access;
use kv.avm.Registers;
begin
Put_Line("test A6");
--kv.avm.log.verbose := True;
Builder.Initialize;
Builder.Parse_Input_File("test_a1.volea");
SIO.Create(F, SIO.Out_File, "test_a6.volec");
S := SIO.Stream(F);
Builder.Write_Word_Code(S);
SIO.Close(F);
Put_Line("test A6: reading back in the assembled word code.");
SIO.Open(F, SIO.In_File, "test_a6.volec");
S := SIO.Stream(F);
Builder2.Initialize;
Builder2.Read_Word_Code(S);
SIO.Close(F);
Put_Line("test A6: 2");
Assert(Builder.Actor_Count = Builder2.Actor_Count, "Actor count.");
Assert(Builder2.Actor /= null, "Actor list is null.");
A1 := Builder.Actor;
A2 := Builder2.Actor;
Assert(A1.Name.all = A2.Name.all, "Actor name.");
Assert(A1.F_Max = A2.F_Max, "Actor F_Max.");
for I in A1.Fixed'FIRST .. Interfaces.Unsigned_32(A1.F_Max) loop
Assert(A1.Fixed(I) = A2.Fixed(I), "Actor Fixed(I).");
end loop;
Assert(A1.M_Count = A2.M_Count, "Actor M_Count.");
M1 := A1.Message;
M2 := A2.Message;
Assert(M1.Name.all = M2.Name.all, "Message name.");
Assert(M1.Count = M2.Count, "Message (code) Count.");
for I in M1.Code'FIRST .. Interfaces.Unsigned_32(M1.Count-1) loop
Assert(M1.Code(I) = M2.Code(I), "Message code (I).");
end loop;
M1 := M1.Next;
M2 := M2.Next;
Assert(M1.Name.all = M2.Name.all, "Message name.");
Assert(M1.Count = M2.Count, "Message (code) Count.");
for I in M1.Code'FIRST .. Interfaces.Unsigned_32(M1.Count) loop
Assert(M1.Code(I) = M2.Code(I), "Message code (I).");
end loop;
A1 := A1.Next;
A2 := A2.Next;
Assert(A1.Name.all = A2.Name.all, "Actor name.");
Assert(A1.F_Max = A2.F_Max, "Actor F_Max.");
for I in A1.Fixed'FIRST .. Interfaces.Unsigned_32(A1.F_Max) loop
if A1.Fixed(I).Format = Unsigned_Integer then
Assert(A1.Fixed(I) = A2.Fixed(I), "Actor Fixed(I)."&Interfaces.Unsigned_32'IMAGE(I));
elsif A1.Fixed(I).Format = Actor_Definition then
Assert(+A1.Fixed(I).Actor_Kind = +A2.Fixed(I).Actor_Kind, "Actor Fixed(I) actor def."&Interfaces.Unsigned_32'IMAGE(I));
elsif A1.Fixed(I).Format = Message_Definition then
Assert(+A1.Fixed(I).Message_Name = +A2.Fixed(I).Message_Name, "Actor Fixed(I) msg def."&Interfaces.Unsigned_32'IMAGE(I));
end if;
end loop;
Assert(A1.M_Count = A2.M_Count, "Actor M_Count.");
M1 := A1.Message;
M2 := A2.Message;
Assert(M1.Name.all = M2.Name.all, "Message name.");
Assert(M1.Count = M2.Count, "Message (code) Count.");
for I in M1.Code'FIRST .. Interfaces.Unsigned_32(M1.Count-1) loop
Assert(M1.Code(I) = M2.Code(I), "Message code (I).");
end loop;
M1 := M1.Next;
M2 := M2.Next;
Assert(M1.Name.all = M2.Name.all, "Message name.");
Assert(M1.Count = M2.Count, "Message (code) Count.");
for I in M1.Code'FIRST .. Interfaces.Unsigned_32(M1.Count) loop
Assert(M1.Code(I) = M2.Code(I), "Message code (I).");
end loop;
end Run_Test;
-----------------------------------------------------------------------------
function Name (T : Test_A7) return AUnit.Message_String is
pragma Unreferenced (T);
begin
return AUnit.Format ("test A7: load and run a binary.");
end Name;
procedure Run_Test (T : in out Test_A7) is
pragma Unreferenced (T);
Builder2 : aliased kv.avm.Assemblers.Assembler_Type;
package SIO renames Ada.Streams.Stream_IO;
F : SIO.File_Type;
S : SIO.Stream_Access;
VM : aliased kv.avm.Machines.Machine_Type;
CPU : aliased kv.avm.Processors.Processor_Type;
Instance_Factory : aliased kv.avm.Instances.Instance_Factory;
Data : aliased kv.avm.Tuples.Tuple_Type;
Instance_1 : kv.avm.Actor_References.Actor_Reference_Type;
Registers : kv.avm.Memories.Register_Array_Type;
Status : kv.avm.Control.Status_Type;
Message : kv.avm.Messages.Message_Type;
use kv.avm.Assemblers;
begin
Put_Line("test A7");
--kv.avm.log.verbose := True;
kv.avm.actor_pool.Empty_Actor_Pool;
kv.avm.Actors.Empty_Actor_Map;
SIO.Open(F, SIO.In_File, "test_a6.volec");
S := SIO.Stream(F);
Builder2.Initialize;
Builder2.Read_Word_Code(S);
SIO.Close(F);
Builder2.Transfer_Actors_To_Store;
VM.Initialize(CPU'UNCHECKED_ACCESS, Instance_Factory'UNCHECKED_ACCESS);
CPU.Initialize(VM'UNCHECKED_ACCESS);
VM.New_Actor("Test_A1", Instance_1);
Registers.Initialize((U(0), U(1)));
Data.Initialize;
Data.Fold(Registers);
Message.Initialize
(Source => kv.avm.Actor_References.Null_Reference,
Reply_To => kv.avm.Actor_References.Null_Reference,
Destination => Instance_1,
Message_Name => "CONSTRUCTOR",
Data => Data,
Future => kv.avm.Control.NO_FUTURE);
VM.Post_Message
(Message => Message,
Status => Status);
Message.Finalize;
Message.Initialize
(Source => kv.avm.Actor_References.Null_Reference,
Reply_To => kv.avm.Actor_References.Null_Reference,
Destination => Instance_1,
Message_Name => "Go",
Data => Data,
Future => kv.avm.Control.NO_FUTURE);
VM.Post_Message
(Message => Message,
Status => Status);
while not VM.Done loop
VM.Step;
Assert(VM.Get_Steps < 200, "Too many steps have been taken.");
end loop;
Assert(VM.Get_Steps = 60, "Wrong step count."&Natural'IMAGE(VM.Get_Steps));
end Run_Test;
-----------------------------------------------------------------------------
function Name (T : Test_A8) return AUnit.Message_String is
pragma Unreferenced (T);
begin
return AUnit.Format ("test A8: Fibonacci debug.");
end Name;
procedure Run_Test (T : in out Test_A8) is
Builder : aliased kv.avm.Assemblers.Assembler_Type;
VM : aliased kv.avm.Machines.Machine_Type;
CPU : aliased kv.avm.Processors.Processor_Type;
Instance_Factory : aliased kv.avm.Instances.Instance_Factory;
Registers : kv.avm.Memories.Register_Array_Type;
use kv.avm.Registers;
begin
Put_Line("test A8");
Builder.Initialize;
Builder.Parse_Line(".actor FibonacciHelper");
Builder.Parse_Line(" C0 uint 0");
Builder.Parse_Line(" F1 uint 1");
Builder.Parse_Line(" F2 uint 2");
Builder.Parse_Line(" F3 uint 3");
Builder.Parse_Line(" F4 uint 4");
Builder.Parse_Line(" F5 mdef compute");
Builder.Parse_Line(" F6 : Tuple_Map := [L0, L1, L2]");
Builder.Parse_Line("..message CONSTRUCTOR # I0 = depth");
Builder.Parse_Line(" SET A0 := I0 # A0 = Self.Depth");
Builder.Parse_Line(" REPLY C0");
Builder.Parse_Line(" STOP_FRAME");
Builder.Parse_Line("..message compute # I0 = level, I1 = fibk, I2 = fibk1");
Builder.Parse_Line(" COMPUTE L9 := A0 != I0");
Builder.Parse_Line(" BRANCH_REL L9 2 # if Self.Depth != level then skip next two instructions");
Builder.Parse_Line(" SET L0 I2");
Builder.Parse_Line(" REPLY L0");
Builder.Parse_Line(" COMPUTE L0 := I0 + F1 # L0 := level + 1");
Builder.Parse_Line(" COMPUTE L1 := I1 + I2 # L1 := fibk + fibk1");
Builder.Parse_Line(" SET L2 I1 # L2 := fibk");
Builder.Parse_Line(" FOLD L4 := F6 # L4 := fold(L0, L1, L2)");
Builder.Parse_Line(" SELF_TAIL_CALL L4 => F5");
Builder.Parse_Line(" STOP_FRAME");
Builder.Parse_Line(".actor Fibonacci");
Builder.Parse_Line(" F0 uint 0");
Builder.Parse_Line(" F1 uint 1");
Builder.Parse_Line(" F2 uint 2");
Builder.Parse_Line(" F3 uint 3");
Builder.Parse_Line(" F4 uint 4");
Builder.Parse_Line(" F5 mdef compute");
Builder.Parse_Line(" F6 adef FibonacciHelper");
Builder.Parse_Line(" F7 : Tuple_Map := [L1, L2, L3]");
Builder.Parse_Line("..message CONSTRUCTOR");
Builder.Parse_Line(" REPLY F0");
Builder.Parse_Line(" STOP_FRAME");
Builder.Parse_Line("..message Compute");
Builder.Parse_Line(" EMIT S0");
Builder.Parse_Line(" NEW_ACTOR L0 S0 F6");
Builder.Parse_Line(" SET L1 F1");
Builder.Parse_Line(" SET L2 F1");
Builder.Parse_Line(" SET L3 F0");
Builder.Parse_Line(" FOLD L4 := F7");
Builder.Parse_Line(" ACTOR_CALL L5 := L4 => L0 . F5");
Builder.Parse_Line(" PEEK L6 L5 F0");
Builder.Parse_Line(" TRAP L7 F1 L6");
Builder.Parse_Line(" REPLY L6");
Builder.Parse_Line(" STOP_FRAME");
Builder.Transfer_Actors_To_Store;
VM.Initialize(CPU'UNCHECKED_ACCESS, Instance_Factory'UNCHECKED_ACCESS);
CPU.Initialize(VM'UNCHECKED_ACCESS);
Registers.Initialize((0 => U(6)));
VM.Start_With("Fibonacci", "Compute", Registers);
while not VM.Done loop
VM.Step;
Assert(VM.Get_Steps < 200, "Too many steps have been taken.");
end loop;
Assert(VM.Get_Steps = 56, "Wrong step count."&Natural'IMAGE(VM.Get_Steps));
end Run_Test;
-----------------------------------------------------------------------------
function Name (T : Test_A9) return AUnit.Message_String is
pragma Unreferenced (T);
begin
return AUnit.Format ("test A9: Test predicate parsing.");
end Name;
procedure Run_Test (T : in out Test_A9) is
Builder : aliased kv.avm.Assemblers.Assembler_Type;
Built_Actor : kv.avm.Actors.Actor_Access;
Test_Method : kv.avm.Methods.Method_Access;
Offset : constant kv.avm.References.Offset_Type := 13;
use kv.avm.Registers;
use kv.avm.Actors;
use kv.avm.Methods;
begin
Put_Line("test A9");
Builder.Initialize;
Builder.Parse_Line(".actor PredicateTest");
Builder.Parse_Line("..message CONSTRUCTOR");
Builder.Parse_Line(" STOP_FRAME");
Builder.Parse_Line("..message Message_1");
Builder.Parse_Line("...predicate 13");
Builder.Parse_Line(" STOP_FRAME");
Builder.Transfer_Actors_To_Store;
Built_Actor := kv.avm.Actors.Get_Actor_By_Name("PredicateTest");
Assert(Built_Actor /= null, "Failed to build PredicateTest actor");
Test_Method := Built_Actor.Get_Method("Message_1");
Assert(Test_Method /= null, "Failed to build Message_1");
Assert(Test_Method.Has_Predicate, "Message_1 does not have a predicate");
Assert(Test_Method.Get_Predicate = Offset, "Predicate has incorrect offset");
end Run_Test;
-----------------------------------------------------------------------------
function Name (T : Test_A10) return AUnit.Message_String is
pragma Unreferenced (T);
begin
return AUnit.Format ("test A10: Test more streaming.");
end Name;
procedure Run_Test (T : in out Test_A10) is
Builder : aliased kv.avm.Assemblers.Assembler_Type;
Builder2 : aliased kv.avm.Assemblers.Assembler_Type;
package SIO renames Ada.Streams.Stream_IO;
F : SIO.File_Type;
S : SIO.Stream_Access;
Built_Actor : kv.avm.Actors.Actor_Access;
Test_Method : kv.avm.Methods.Method_Access;
Offset : constant kv.avm.References.Offset_Type := 13;
use kv.avm.Registers;
use kv.avm.Actors;
use kv.avm.Methods;
begin
kv.avm.log.verbose := False;
Put_Line("test A10");
Builder.Initialize;
Builder.Parse_Line(".actor PredicateTest");
Builder.Parse_Line(" C0 : bit_or_boolean := False");
Builder.Parse_Line("..message CONSTRUCTOR");
Builder.Parse_Line(" SET A0 := C0");
Builder.Parse_Line(" STOP_FRAME");
Builder.Parse_Line("..message Message_1");
Builder.Parse_Line("...predicate 13");
Builder.Parse_Line(" STOP_FRAME");
SIO.Create(F, SIO.Out_File, "test_a10.volec");
S := SIO.Stream(F);
Builder.Write_Word_Code(S);
SIO.Close(F);
kv.avm.Actors.Empty_Actor_Map;
Put_Line("test A10: reading back in the assembled word code.");
SIO.Open(F, SIO.In_File, "test_a10.volec");
S := SIO.Stream(F);
Builder2.Initialize;
Builder2.Read_Word_Code(S);
SIO.Close(F);
Builder2.Transfer_Actors_To_Store;
Built_Actor := kv.avm.Actors.Get_Actor_By_Name("PredicateTest");
Assert(Built_Actor /= null, "Failed to build PredicateTest actor");
Test_Method := Built_Actor.Get_Method("Message_1");
Assert(Test_Method /= null, "Failed to build Message_1");
Assert(Test_Method.Has_Predicate, "Message_1 does not have a predicate");
Assert(Test_Method.Get_Predicate = Offset, "Predicate has incorrect offset");
end Run_Test;
-----------------------------------------------------------------------------
-----------------------------------------------------------------------------
package Test_Cap is
type Recorder_Cap_Type is new kv.avm.Capabilities.Capability_Interface with
record
Super_Constructor_Called : Boolean := False;
Super_Message_2_Called : Boolean := False;
Super_Run_It_Called : Boolean := False;
SubClass_Run_It_Called : Boolean := False;
end record;
overriding procedure Execute
(Self : in out Recorder_Cap_Type;
Machine : in out kv.avm.Control.Control_Interface'CLASS;
Input : in kv.avm.Registers.Register_Type;
Output : out kv.avm.Registers.Register_Type;
Status : out kv.avm.Control.Status_Type);
not overriding
procedure Initialize(Self : in out Recorder_Cap_Type);
Recorder : aliased Recorder_Cap_Type;
Pool : kv.avm.Capabilities.Capabilities_Type;
procedure Prep_Once;
end Test_Cap;
package body Test_Cap is
--------------------------------------------------------------------------
procedure Execute
(Self : in out Recorder_Cap_Type;
Machine : in out kv.avm.Control.Control_Interface'CLASS;
Input : in kv.avm.Registers.Register_Type;
Output : out kv.avm.Registers.Register_Type;
Status : out kv.avm.Control.Status_Type) is
begin
if Input.Unsigned_Value = 1 then
Self.Super_Constructor_Called := True;
elsif Input.Unsigned_Value = 2 then
Self.Super_Message_2_Called := True;
elsif Input.Unsigned_Value = 3 then
Self.Super_Run_It_Called := True;
elsif Input.Unsigned_Value = 4 then
Self.SubClass_Run_It_Called := True;
end if;
Output := kv.avm.Registers.Make_U(1397);
Status := kv.avm.Control.Active;
end Execute;
--------------------------------------------------------------------------
procedure Initialize(Self : in out Recorder_Cap_Type) is
begin
Self.Super_Constructor_Called := False;
Self.Super_Message_2_Called := False;
Self.Super_Run_It_Called := False;
Self.SubClass_Run_It_Called := False;
end Initialize;
--------------------------------------------------------------------------
Prep_Me : boolean := True;
procedure Prep_Once is
begin
if Prep_Me then
Test_Cap.Pool.Add("Recorder", Test_Cap.Recorder'UNCHECKED_ACCESS);
Prep_Me := False;
end if;
end Prep_Once;
end Test_Cap;
-----------------------------------------------------------------------------
procedure Set_Up (T : in out Superclass_Test_Case) is
begin
kv.avm.Log.Verbose := False;
T.Builder.Initialize;
Test_Cap.Recorder.Initialize;
end Set_Up;
-----------------------------------------------------------------------------
procedure Tear_Down (T : in out Superclass_Test_Case) is
begin
kv.avm.Actors.Empty_Actor_Map;
end Tear_Down;
-----------------------------------------------------------------------------
procedure Load (T : in out Superclass_Test_Case; Volea : in String) is
begin
T.Builder.Parse_Input_File(Volea);
T.Builder.Transfer_Actors_To_Store;
end Load;
-----------------------------------------------------------------------------
procedure Prep_VM
(T : in out Superclass_Test_Case;
VM : access kv.avm.Machines.Machine_Type;
Start_Actor : in String;
Start_Message : in String) is
use kv.avm.Registers;
begin
-- VM is passed in because when it is part of T something goes wrong and the
-- following line raises a CONSTRAINT_ERROR because the router isn't intitialized.
VM.Initialize(T.CPU'UNCHECKED_ACCESS, T.Instance_Factory'UNCHECKED_ACCESS);
T.CPU.Initialize(VM.all'UNCHECKED_ACCESS);
T.Registers.Initialize((Make_U(0), Make_U(1)));
VM.Start_With(Start_Actor, Start_Message, T.Registers);
end Prep_VM;
-----------------------------------------------------------------------------
procedure Run_VM (T : in out Superclass_Test_Case; VM : access kv.avm.Machines.Machine_Type; Steps : in Positive) is
begin
while not VM.Done loop
VM.Step;
Assert(VM.Get_Steps < Steps, "Too many steps have been taken.");
end loop;
end Run_VM;
-----------------------------------------------------------------------------
function Name (T : Test_A11) return AUnit.Message_String is
pragma Unreferenced (T);
begin
return AUnit.Format ("test A11: ..subclassof directive.");
end Name;
procedure Run_Test (T : in out Test_A11) is
Subclass : kv.avm.Actors.Actor_Access;
Superclass : kv.avm.Actors.Actor_Access;
use type kv.avm.Actors.Actor_Access;
begin
kv.avm.log.verbose := False;
Put_Line("test A11");
T.Load("test_a11.volea");
Subclass := kv.avm.Actors.Get_Actor_By_Name("SubClass");
Assert(Subclass /= null, "SubClass not loaded.");
Assert(Subclass.Get_Name = "SubClass", "SubClass not returned by Get_Actor_By_Name(SubClass), <" & Subclass.Get_Name & "> returned instead.");
Superclass := Subclass.Get_Parent;
Assert(Superclass /= null, "SubClass returned null for its parent.");
Assert(Superclass.Get_Name = "SuperClass", "SuperClass parent name unexpedcted, got <" & Superclass.Get_Name & ">.");
end Run_Test;
-----------------------------------------------------------------------------
function Name (T : Test_A12) return AUnit.Message_String is
pragma Unreferenced (T);
begin
return AUnit.Format ("test A12: dispatching to super class.");
end Name;
procedure Run_Test (T : in out Test_A12) is
Local_VM : aliased kv.avm.Machines.Machine_Type;
begin
kv.avm.log.verbose := False;
Put_Line("test A12");
T.Load("test_a11.volea");
Test_Cap.Prep_Once;
T.Prep_VM(Local_VM'ACCESS, "Test_A11", "Go");
Local_VM.Set_Capabilities(Test_Cap.Pool);
T.Run_VM(Local_VM'ACCESS, 200);
Assert(Test_Cap.Recorder.Super_Constructor_Called, "Super CONSTRUCTOR not called");
Assert(Test_Cap.Recorder.Super_Message_2_Called, "Super Message_2 not called");
Assert(Local_VM.Get_Steps = 21, "Wrong step count."&Natural'IMAGE(Local_VM.Get_Steps));
end Run_Test;
-----------------------------------------------------------------------------
function Name (T : Test_A13) return AUnit.Message_String is
pragma Unreferenced (T);
begin
return AUnit.Format ("test A13: dispatching to subclass.");
end Name;
procedure Run_Test (T : in out Test_A13) is
Local_VM : aliased kv.avm.Machines.Machine_Type;
begin
kv.avm.log.verbose := False;
Put_Line("test A13");
T.Load("test_a13.volea");
Test_Cap.Prep_Once;
T.Prep_VM(Local_VM'ACCESS, "Test_A13", "Go");
Local_VM.Set_Capabilities(Test_Cap.Pool);
T.Run_VM(Local_VM'ACCESS, 200);
Assert(Test_Cap.Recorder.Super_Constructor_Called, "Super CONSTRUCTOR not called");
Assert(Test_Cap.Recorder.Super_Message_2_Called, "Super Message_2 not called");
Assert(Test_Cap.Recorder.SubClass_Run_It_Called, "SubClass Run_It message not called");
Assert(not Test_Cap.Recorder.Super_Run_It_Called, "Super Run_It message WAS called");
Assert(Local_VM.Get_Steps = 21, "Wrong step count."&Natural'IMAGE(Local_VM.Get_Steps));
end Run_Test;
-----------------------------------------------------------------------------
function Name (T : Test_A14) return AUnit.Message_String is
pragma Unreferenced (T);
begin
return AUnit.Format ("test A14: Tuple Definition.");
end Name;
procedure Run_Test (T : in out Test_A14) is
Registers : kv.avm.Memories.Register_Array_Type;
Registers2 : kv.avm.Memories.Register_Array_Type;
Registers3 : kv.avm.Memories.Register_Array_Type;
Tuple : kv.avm.Tuples.Tuple_Type;
Tuple2 : kv.avm.Tuples.Tuple_Type;
Tuple3 : kv.avm.Tuples.Tuple_Type;
Def : kv.avm.Tuples.Definition_Type;
Def2 : kv.avm.Tuples.Definition_Type;
Def3 : kv.avm.Tuples.Definition_Type;
Def4 : kv.avm.Tuples.Definition_Type;
use kv.avm.Registers;
use kv.avm.Tuples;
begin
Registers.Initialize((Make_U(0), Make_S(1), Make_String("Hello")));
Tuple.Fold(Registers);
Def.Make(Tuple);
Assert(Def.Length = 3, "Tuple definition length wasn't 3, it was " & Natural'IMAGE(Def.Length) & ".");
Assert(Def.To_String = "UIS", "Tuple definition string wasn't 'UIS', it was '" & Def.To_String & "'.");
Def2 := Def;
Assert(Def2.Length = 3, "Tuple definition 2 length wasn't 3, it was " & Natural'IMAGE(Def2.Length) & ".");
Assert(Def2.To_String = "UIS", "Tuple definition 2 string wasn't 'UIS', it was '" & Def2.To_String & "'.");
Assert(Def = Def2, "Def /= Def2");
Registers2.Initialize((Make_U(8), Make_S(-33), Make_String("World")));
Tuple2.Fold(Registers2);
Def3.Make(Tuple2);
Assert(Def3.Length = 3, "Tuple definition 3 length wasn't 3, it was " & Natural'IMAGE(Def3.Length) & ".");
Assert(Def3.To_String = "UIS", "Tuple definition 3 string wasn't 'UIS', it was '" & Def3.To_String & "'.");
Assert(Def = Def3, "Def /= Def3");
Registers3.Initialize((Make_S(-8), Make_String("Yo"), Make_Tuple(Tuple), Make_U(100)));
Tuple3.Fold(Registers3);
Def4.Make(Tuple3);
Assert(Def4.Length = 4, "Tuple definition 4 length wasn't 4, it was " & Natural'IMAGE(Def4.Length) & ".");
Assert(Def4.To_String = "ISTU", "Tuple definition 4 string wasn't 'ISTU', it was '" & Def4.To_String & "'.");
Assert(Def /= Def4, "Def = Def4");
end Run_Test;
-----------------------------------------------------------------------------
function Name (T : Test_A15) return AUnit.Message_String is
pragma Unreferenced (T);
begin
return AUnit.Format ("test A15: Empty Tuple Definition.");
end Name;
procedure Run_Test (T : in out Test_A15) is
Tuple1 : kv.avm.Tuples.Tuple_Type;
Tuple2 : kv.avm.Tuples.Tuple_Type;
Def1 : kv.avm.Tuples.Definition_Type;
Def2 : kv.avm.Tuples.Definition_Type;
use kv.avm.Registers;
use kv.avm.Tuples;
begin
Tuple1.Fold_Empty;
Def1.Make(Tuple1);
Tuple2.Fold_Empty;
Def2.Make(Tuple2);
Assert(Def1 = Def2, "Def1 /= Def2");
Assert(Def1.Length = 0, "Tuple definition 1 length wasn't 0, it was " & Natural'IMAGE(Def1.Length) & ".");
Assert(Def1.To_String = "", "Tuple definition 1 string wasn't '', it was '" & Def1.To_String & "'.");
Assert(Def2.Length = 0, "Tuple definition 2 length wasn't 0, it was " & Natural'IMAGE(Def2.Length) & ".");
Assert(Def2.To_String = "", "Tuple definition 2 string wasn't '', it was '" & Def2.To_String & "'.");
end Run_Test;
-----------------------------------------------------------------------------
function Name (T : Test_A16) return AUnit.Message_String is
pragma Unreferenced (T);
begin
return AUnit.Format ("test A16: Data Kind Signatures.");
end Name;
procedure Run_Test (T : in out Test_A16) is
All_Kinds : constant String := "UITSEFfBMmRAd";
use kv.avm.Registers;
begin
for Kind in Data_Kind loop
Assert(Kind = Format(Signature(Kind)), "");
end loop;
Assert(All_Kinds = Signature_To_String(String_To_Signature(All_Kinds)), "");
end Run_Test;
-----------------------------------------------------------------------------
function Name (T : Test_A17) return AUnit.Message_String is
pragma Unreferenced (T);
begin
return AUnit.Format ("test A17: Saved and re-loaded, dispatching to superclass.");
end Name;
procedure Run_Test (T : in out Test_A17) is
Local_VM : aliased kv.avm.Machines.Machine_Type;
Builder2 : aliased kv.avm.Assemblers.Assembler_Type;
package SIO renames Ada.Streams.Stream_IO;
F : SIO.File_Type;
S : SIO.Stream_Access;
begin
kv.avm.log.verbose := True;
Put_Line("test A17");
T.Load("test_a11.volea");
SIO.Create(F, SIO.Out_File, "test_a11.volec");
S := SIO.Stream(F);
T.Builder.Write_Word_Code(S);
SIO.Close(F);
kv.avm.Actors.Empty_Actor_Map;
Put_Line("test A17: reading back in the assembled word code.");
SIO.Open(F, SIO.In_File, "test_a11.volec");
S := SIO.Stream(F);
Builder2.Initialize;
Builder2.Read_Word_Code(S);
SIO.Close(F);
Builder2.Transfer_Actors_To_Store;
Test_Cap.Prep_Once;
T.Prep_VM(Local_VM'ACCESS, "Test_A11", "Go");
Local_VM.Set_Capabilities(Test_Cap.Pool);
T.Run_VM(Local_VM'ACCESS, 200);
Assert(Test_Cap.Recorder.Super_Constructor_Called, "Super CONSTRUCTOR not called");
Assert(Test_Cap.Recorder.Super_Message_2_Called, "Super Message_2 not called");
Assert(Local_VM.Get_Steps = 21, "Wrong step count."&Natural'IMAGE(Local_VM.Get_Steps));
end Run_Test;
-----------------------------------------------------------------------------
function Name (T : Test_A18) return AUnit.Message_String is
pragma Unreferenced (T);
begin
return AUnit.Format ("test A18: XXX.");
end Name;
procedure Run_Test (T : in out Test_A18) is
begin
null;
end Run_Test;
-----------------------------------------------------------------------------
function Name (T : Test_A19) return AUnit.Message_String is
pragma Unreferenced (T);
begin
return AUnit.Format ("test A19: XXX.");
end Name;
procedure Run_Test (T : in out Test_A19) is
begin
null;
end Run_Test;
-----------------------------------------------------------------------------
function Name (T : Test_A20) return AUnit.Message_String is
pragma Unreferenced (T);
begin
return AUnit.Format ("test A20: XXX.");
end Name;
procedure Run_Test (T : in out Test_A20) is
begin
null;
end Run_Test;
end kv.avm.Asm_Tests;
|
reznikmm/matreshka | Ada | 3,674 | 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.Db_Table_Filter_Elements is
pragma Preelaborate;
type ODF_Db_Table_Filter is limited interface
and XML.DOM.Elements.DOM_Element;
type ODF_Db_Table_Filter_Access is
access all ODF_Db_Table_Filter'Class
with Storage_Size => 0;
end ODF.DOM.Db_Table_Filter_Elements;
|
charlie5/lace | Ada | 2,435 | ads | -- This file is generated by SWIG. Please do *not* modify by hand.
--
with Interfaces.C;
with Swig;
with Interfaces.C;
package osmesa_c is
-- GLenum
--
subtype GLenum is Interfaces.C.unsigned;
type GLenum_array is
array (Interfaces.C.size_t range <>) of aliased osmesa_c.GLenum;
-- GLint
--
subtype GLint is Interfaces.C.int;
type GLint_array is
array (Interfaces.C.size_t range <>) of aliased osmesa_c.GLint;
-- GLsizei
--
subtype GLsizei is Interfaces.C.int;
type GLsizei_array is
array (Interfaces.C.size_t range <>) of aliased osmesa_c.GLsizei;
-- GLboolean
--
subtype GLboolean is Interfaces.C.unsigned_char;
type GLboolean_array is
array (Interfaces.C.size_t range <>) of aliased osmesa_c.GLboolean;
-- OSMesaContext
--
subtype OSMesaContext is Swig.opaque_structure;
type OSMesaContext_array is
array (Interfaces.C.size_t range <>) of aliased osmesa_c.OSMesaContext;
-- OSMESAproc
--
type OSMESAproc is access
procedure;
pragma Convention (C, OSMESAproc);
-- OSMESAprocs
--
type OSMESAprocs is
array (Interfaces.C.size_t range <>) of aliased osmesa_c.OSMESAproc;
OSMESA_MAJOR_VERSION : constant := 11;
OSMESA_MINOR_VERSION : constant := 2;
OSMESA_PATCH_VERSION : constant := 0;
OSMESA_BGRA : constant := 16#1#;
OSMESA_ARGB : constant := 16#2#;
OSMESA_BGR : constant := 16#4#;
OSMESA_RGB_565 : constant := 16#5#;
OSMESA_ROW_LENGTH : constant := 16#10#;
OSMESA_Y_UP : constant := 16#11#;
OSMESA_WIDTH : constant := 16#20#;
OSMESA_HEIGHT : constant := 16#21#;
OSMESA_FORMAT : constant := 16#22#;
OSMESA_TYPE : constant := 16#23#;
OSMESA_MAX_WIDTH : constant := 16#24#;
OSMESA_MAX_HEIGHT : constant := 16#25#;
OSMESA_DEPTH_BITS : constant := 16#30#;
OSMESA_STENCIL_BITS : constant := 16#31#;
OSMESA_ACCUM_BITS : constant := 16#32#;
OSMESA_PROFILE : constant := 16#33#;
OSMESA_CORE_PROFILE : constant := 16#34#;
OSMESA_COMPAT_PROFILE : constant := 16#35#;
OSMESA_CONTEXT_MAJOR_VERSION : constant := 16#36#;
OSMESA_CONTEXT_MINOR_VERSION : constant := 16#37#;
end osmesa_c;
|
reznikmm/matreshka | Ada | 3,789 | adb | ------------------------------------------------------------------------------
-- --
-- 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 ODF.Constants;
package body Matreshka.ODF_Attributes.Style.Page_Layout_Name is
--------------------
-- Get_Local_Name --
--------------------
overriding function Get_Local_Name
(Self : not null access constant Style_Page_Layout_Name_Node)
return League.Strings.Universal_String is
begin
return ODF.Constants.Page_Layout_Name_Name;
end Get_Local_Name;
end Matreshka.ODF_Attributes.Style.Page_Layout_Name;
|
google-code/ada-util | Ada | 3,232 | ads | -----------------------------------------------------------------------
-- Util.Concurrent.Pools -- Concurrent Pools
-- Copyright (C) 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.Finalization;
-- The <b>Util.Concurrent.Pools</b> generic defines a pool of objects which
-- can be shared by multiple threads. First, the pool is configured to have
-- a number of objects by using the <b>Set_Size</b> procedure. Then, a thread
-- that needs an object uses the <b>Get_Instance</b> to get an object.
-- The object is removed from the pool. As soon as the thread has finished,
-- it puts back the object in the pool using the <b>Release</b> procedure.
--
-- The <b>Get_Instance</b> entry will block until an object is available.
generic
type Element_Type is private;
package Util.Concurrent.Pools is
pragma Preelaborate;
-- Pool of objects
type Pool is new Ada.Finalization.Limited_Controlled with private;
-- Get an element instance from the pool.
-- Wait until one instance gets available.
procedure Get_Instance (From : in out Pool;
Item : out Element_Type);
-- Put the element back to the pool.
procedure Release (Into : in out Pool;
Item : in Element_Type);
-- Set the pool size.
procedure Set_Size (Into : in out Pool;
Capacity : in Positive);
-- Release the pool elements.
overriding
procedure Finalize (Object : in out Pool);
private
-- To store the pool elements, we use an array which is allocated dynamically
-- by the <b>Set_Size</b> protected operation. The generated code is smaller
-- compared to the use of Ada vectors container.
type Element_Array is array (Positive range <>) of Element_Type;
type Element_Array_Access is access all Element_Array;
Null_Element_Array : constant Element_Array_Access := null;
-- Pool of objects
protected type Protected_Pool is
-- Get an element instance from the pool.
-- Wait until one instance gets available.
entry Get_Instance (Item : out Element_Type);
-- Put the element back to the pool.
procedure Release (Item : in Element_Type);
-- Set the pool size.
procedure Set_Size (Capacity : in Natural);
private
Available : Natural := 0;
Elements : Element_Array_Access := Null_Element_Array;
end Protected_Pool;
type Pool is new Ada.Finalization.Limited_Controlled with record
List : Protected_Pool;
end record;
end Util.Concurrent.Pools;
|
mfkiwl/ewok-kernel-security-OS | Ada | 639 | adb | package body System.Assertions is
procedure Ewok_Debug_Alert (S : String)
with
Convention => Ada,
Import => True,
External_name => "ewok_debug_alert";
procedure Ewok_Debug_Newline
with
Convention => Ada,
Import => True,
External_name => "ewok_debug_newline";
--------------------------
-- Raise_Assert_Failure --
--------------------------
procedure Raise_Assert_Failure (Msg : String) is
begin
Ewok_Debug_Alert (Msg);
Ewok_Debug_Newline;
loop
null;
end loop;
end Raise_Assert_Failure;
end System.Assertions;
|
OneWingedShark/Byron | Ada | 278 | ads | Pragma Ada_2012;
Pragma Assertion_Policy( Check );
With
Lexington.Search.Replace_Sequence;
-- Generate non-based float literals.
Procedure Lexington.Aux.P14 is new Search.Replace_Sequence(
Sequence => (li_Integer, ch_Period, li_Integer),
Item_Type => li_Float
);
|
OneWingedShark/Byron | Ada | 373 | ads | Pragma Ada_2012;
Pragma Assertion_Policy( Check );
with
Byron.Generics.Vector;
Generic
with Package Vector_Package is new Byron.Generics.Vector(<>);
with Procedure Operation(Item : in Vector_Package.Element_Type) is null;
Procedure Byron.Generics.Iterator(Input : Vector_Package.Vector)
with SPARK_Mode => On,
Global => Null,
Depends => (Null => Input)
;
|
persan/gprTools | Ada | 1,459 | adb | with GNAT.Spitbol;
with AWS.Status; use AWS.Status;
with Gprslaves.DB.JSON;
with GNATCOLL.JSON;
with AWS.Messages;
with Gprslaves.DB; use Gprslaves.DB;
package body GPR_Tools.Gprslaves.Nameserver.Server is
Store : Gprslaves.DB.Table;
--------------
-- Register --
--------------
procedure Register (Server : DB.Info_Struct) is
begin
Store.Register (Server.Host, Server.Keys);
end Register;
function Find (Keys : GNAT.Spitbol.Table_VString.Table) return DB.Host_Info_Vectors.Vector is
begin
return Store.Find (Keys);
end Find;
function Request (Request : AWS.Status.Data) return AWS.Response.Data is
Hosts : Host_Info_Vectors.Vector;
begin
case AWS.Status.Method (Request) is
when AWS.Status.PUT =>
Register (Gprslaves.DB.JSON.Get (GNATCOLL.JSON.Read (AWS.Status.Binary_Data (Request))));
return AWS.Response.Build ("", "OK");
when AWS.Status.GET =>
Hosts := Find (DB.JSON.Get (GNATCOLL.JSON.Read (AWS.Status.Binary_Data (Request))));
return AWS.Response.Build ("", String'(GNATCOLL.JSON.Write (DB.JSON.Create (Hosts))));
when others => null;
return AWS.Response.Build ("", "FAIL", Status_Code => AWS.Messages.S400);
end case;
exception
when others =>
return AWS.Response.Build ("", "FAIL", Status_Code => AWS.Messages.S400);
end Request;
end GPR_Tools.Gprslaves.Nameserver.Server;
|
zhmu/ananas | Ada | 810 | adb | -- { dg-do compile }
-- { dg-options "-O2 -gnatws" }
procedure Discr45 is
function Ident_Int (I : Integer) return Integer is
begin
return I;
end;
procedure Proc (Signal : Boolean) is
subtype Index is Integer range 1..10;
type My_Arr is array (Index range <>) OF Integer;
type Rec (D3 : Integer := Ident_Int(1)) is record
case D3 is
when -5..10 => C1 : My_Arr(D3..Ident_Int(11));
when Others => C2 : Integer := Ident_Int(5);
end case;
end record;
X : Rec;
function Value return Rec;
pragma No_Inline (Value);
function Value return Rec is
begin
return X;
end;
begin
if X /= Value then
raise Constraint_Error;
elsif Signal then
raise Program_Error;
end if;
end;
begin
Proc (True);
end;
|
xeenta/learning-ada | Ada | 684 | adb | with Ada.Text_IO; use Ada.Text_IO;
procedure Steps_2 is
task Step_By_Step is
entry Step_One;
entry Step_Two;
entry Step_Three;
end Step_By_Step;
task body Step_By_Step is
begin
select
accept Step_One do
Put_Line ("1");
end Step_One;
or
accept Step_Two do
Put_Line ("2");
end Step_Two;
or
accept Step_Three do
Put_Line ("3");
end Step_Three;
end select;
Put_Line ("Bye from Step_By_Step");
end Step_By_Step;
begin
delay 1.0;
Put_Line ("Bye?");
Step_By_Step.Step_Three;
delay 1.0;
Put_Line ("Bye!");
end;
|
reznikmm/matreshka | Ada | 4,193 | adb | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2015, 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 Forum.Categories is
------------
-- Decode --
------------
function Decode
(Image : League.Strings.Universal_String;
Value : out Category_Identifier) return Boolean is
begin
-- XXX This subprogram must be rewritter without use of exceptions.
Value := Category_Identifier'Wide_Wide_Value (Image.To_Wide_Wide_String);
return True;
exception
when Constraint_Error =>
return False;
end Decode;
------------
-- Encode --
------------
function Encode
(Item : Category_Identifier) return League.Strings.Universal_String
is
Aux : constant Wide_Wide_String
:= Category_Identifier'Wide_Wide_Image (Item);
begin
return
League.Strings.To_Universal_String (Aux (Aux'First + 1 .. Aux'Last));
end Encode;
end Forum.Categories;
|
reznikmm/matreshka | Ada | 4,599 | 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.Condition_Attributes is
------------
-- Create --
------------
overriding function Create
(Parameters : not null access Matreshka.DOM_Attributes.Attribute_L2_Parameters)
return Text_Condition_Attribute_Node is
begin
return Self : Text_Condition_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_Condition_Attribute_Node)
return League.Strings.Universal_String
is
pragma Unreferenced (Self);
begin
return Matreshka.ODF_String_Constants.Condition_Attribute;
end Get_Local_Name;
begin
Matreshka.DOM_Documents.Register_Attribute
(Matreshka.ODF_String_Constants.Text_URI,
Matreshka.ODF_String_Constants.Condition_Attribute,
Text_Condition_Attribute_Node'Tag);
end Matreshka.ODF_Text.Condition_Attributes;
|
reznikmm/matreshka | Ada | 4,363 | 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.
------------------------------------------------------------------------------
-- A sequence node is a structured activity node that executes its actions in
-- order.
------------------------------------------------------------------------------
limited with AMF.UML.Executable_Nodes.Collections;
with AMF.UML.Structured_Activity_Nodes;
package AMF.UML.Sequence_Nodes is
pragma Preelaborate;
type UML_Sequence_Node is limited interface
and AMF.UML.Structured_Activity_Nodes.UML_Structured_Activity_Node;
type UML_Sequence_Node_Access is
access all UML_Sequence_Node'Class;
for UML_Sequence_Node_Access'Storage_Size use 0;
not overriding function Get_Executable_Node
(Self : not null access constant UML_Sequence_Node)
return AMF.UML.Executable_Nodes.Collections.Ordered_Set_Of_UML_Executable_Node is abstract;
-- Getter of SequenceNode::executableNode.
--
-- An ordered set of executable nodes.
end AMF.UML.Sequence_Nodes;
|
AdaCore/libadalang | Ada | 56 | ads | package Simple is
type T is new Integer;
end Simple;
|
reznikmm/matreshka | Ada | 3,799 | 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.Table_Drill_Down_On_Double_Click_Attributes is
pragma Preelaborate;
type ODF_Table_Drill_Down_On_Double_Click_Attribute is limited interface
and XML.DOM.Attributes.DOM_Attribute;
type ODF_Table_Drill_Down_On_Double_Click_Attribute_Access is
access all ODF_Table_Drill_Down_On_Double_Click_Attribute'Class
with Storage_Size => 0;
end ODF.DOM.Table_Drill_Down_On_Double_Click_Attributes;
|
stcarrez/stm32-ui | Ada | 639 | ads | private package GID.Decoding_GIF is
--------------------
-- Image decoding --
--------------------
generic
type Primary_color_range is mod <>;
with procedure Set_X_Y (x, y: Natural);
with procedure Put_Pixel (
red, green, blue : Primary_color_range;
alpha : Primary_color_range
);
with procedure Raw_Byte (Byte : in U8);
with procedure Feedback (percents: Natural);
mode: Display_mode;
--
procedure Load (
image : in out Image_descriptor;
next_frame: out Ada.Calendar.Day_Duration
);
end GID.Decoding_GIF;
|
zhmu/ananas | Ada | 440 | adb | -- { dg-do compile }
-- { dg-options "-fdump-tree-gimple" }
package body Aggr30 is
Null_Constant : constant Rec := (Data => (others => 0),
Padding => (others => 0));
procedure Init is
begin
Instance := Null_Constant;
end;
procedure Init_Volatile is
begin
Instance_Volatile := Null_Constant;
end;
end Aggr30;
-- { dg-final { scan-tree-dump-times "= {}" 2 "gimple"} }
|
reznikmm/matreshka | Ada | 4,566 | 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_Svg.Height_Attributes is
------------
-- Create --
------------
overriding function Create
(Parameters : not null access Matreshka.DOM_Attributes.Attribute_L2_Parameters)
return Svg_Height_Attribute_Node is
begin
return Self : Svg_Height_Attribute_Node do
Matreshka.ODF_Svg.Constructors.Initialize
(Self'Unchecked_Access,
Parameters.Document,
Matreshka.ODF_String_Constants.Svg_Prefix);
end return;
end Create;
--------------------
-- Get_Local_Name --
--------------------
overriding function Get_Local_Name
(Self : not null access constant Svg_Height_Attribute_Node)
return League.Strings.Universal_String
is
pragma Unreferenced (Self);
begin
return Matreshka.ODF_String_Constants.Height_Attribute;
end Get_Local_Name;
begin
Matreshka.DOM_Documents.Register_Attribute
(Matreshka.ODF_String_Constants.Svg_URI,
Matreshka.ODF_String_Constants.Height_Attribute,
Svg_Height_Attribute_Node'Tag);
end Matreshka.ODF_Svg.Height_Attributes;
|
ekoeppen/STM32_Generic_Ada_Drivers | Ada | 676 | ads | with STM32_SVD; use STM32_SVD;
generic
I2C : Natural;
package STM32GD.I2C.Peripheral is
pragma Preelaborate;
procedure Init;
function Master_Transmit (Address : I2C_Address; Data : Byte;
Restart : Boolean := False) return Boolean;
function Master_Receive (Address : I2C_Address; Data : out Byte)
return Boolean;
function Master_Receive (Address : I2C_Address; Data : out I2C_Data)
return Boolean;
function Write_Register (Address : I2C_Address; Register : Byte;
Data : Byte) return Boolean;
function Read_Register (Address : I2C_Address; Register : Byte;
Data : out Byte) return Boolean;
end STM32GD.I2C.Peripheral;
|
jscparker/math_packages | Ada | 20,036 | adb |
-----------------------------------------------------------------------
-- package body Runge_8th, 8th order Prince and Dormand Runge-Kutta
-- Copyright (C) 2008-2018 Jonathan S. Parker.
--
-- Permission to use, copy, modify, and/or distribute this software for any
-- purpose with or without fee is hereby granted, provided that the above
-- copyright notice and this permission notice appear in all copies.
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
-----------------------------------------------------------------------
with Ada.Numerics.Generic_Elementary_Functions;
with Runge_Coeffs_PD_8;
package body Runge_8th is
Real_Small : constant Real := Two * Real'Small;
package mth is new Ada.Numerics.Generic_Elementary_Functions(Real);
use mth;
package Prince_Dormand_Coeffs is new Runge_Coeffs_PD_8 (Real);
use Prince_Dormand_Coeffs;
-- Package contains coefficients for the Prince-Dormand 8th
-- order, 13 stage Runge Kutta method with error control.
type K_type1 is array (RK_Range) of Real;
type K_type is array (Dyn_Index) of K_type1;
---------------
-- Runge_Sum --
---------------
-- Function to multiply vector G times matrix K.
--
-- This works only for the RKPD coefficients given above.
-- It's optimized to take into account all of
-- Zero's in array A; review A in the package above.
-- The general formula is:
--
-- Result := A(Stage)(0) * K(0);
-- for j in 1..Stage-1 loop
-- Result := Result + A(Stage)(j) * K(j);
-- end loop;
--
-- The above loop can be used for arbitrary RK coefficients.
-- See Runge_Sum0.
--
-- What follows is optimized for the Prince-Dormond Coefficients.
procedure Runge_Sum
(Y : in Dynamical_Variable;
Next_Y : out Dynamical_Variable;
Stage : in Stages;
K : in K_type)
is
Stage2 : Stages;
Sum : Real;
begin
case Stage is
when 1 =>
Stage2 := 1;
for l in Dyn_Index loop
Sum := A(Stage2)(0) * K(l)(0);
Next_Y(l) := Y(l) + Sum;
end loop;
when 2 =>
Stage2 := 2;
for l in Dyn_Index loop
Sum := A(Stage2)(0) * K(l)(0) + A(Stage2)(1) * K(l)(1);
Next_Y(l) := Y(l) + Sum;
end loop;
when 3 =>
Stage2 := 3;
for l in Dyn_Index loop
Sum := A(Stage2)(0) * K(l)(0) + A(Stage2)(2) * K(l)(2);
Next_Y(l) := Y(l) + Sum;
end loop;
when 4 =>
Stage2 := 4;
for l in Dyn_Index loop
Sum := A(Stage2)(0) * K(l)(0) +
-- A(Stage2)(1) * K(l)(1) +
A(Stage2)(2) * K(l)(2) +
A(Stage2)(3) * K(l)(3);
Next_Y(l) := Y(l) + Sum;
end loop;
when 5 =>
Stage2 := 5;
for l in Dyn_Index loop
Sum := A(Stage2)(0) * K(l)(0) +
-- A(Stage2)(1) * K(l)(1) + A(Stage2)(2) * K(l)(2) +
A(Stage2)(3) * K(l)(3) + A(Stage2)(4) * K(l)(4);
Next_Y(l) := Y(l) + Sum;
end loop;
when 6 =>
Stage2 := 6;
for l in Dyn_Index loop
Sum := A(Stage2)(0) * K(l)(0) +
-- A(Stage2)(1) * K(l)(1) + A(Stage2)(2) * K(l)(2) +
A(Stage2)(3) * K(l)(3) + A(Stage2)(4) * K(l)(4) +
A(Stage2)(5) * K(l)(5);
Next_Y(l) := Y(l) + Sum;
end loop;
when 7 =>
Stage2 := 7;
for l in Dyn_Index loop
Sum := A(Stage2)(0) * K(l)(0) +
-- A(Stage2)(1) * K(l)(1) + A(Stage2)(2) * K(l)(2) +
A(Stage2)(3) * K(l)(3) + A(Stage2)(4) * K(l)(4) +
A(Stage2)(5) * K(l)(5) + A(Stage2)(6) * K(l)(6);
Next_Y(l) := Y(l) + Sum;
end loop;
when 8 =>
Stage2 := 8;
for l in Dyn_Index loop
Sum := A(Stage2)(0) * K(l)(0) +
-- A(Stage2)(1) * K(l)(1) + A(Stage2)(2) * K(l)(2) +
A(Stage2)(3) * K(l)(3) + A(Stage2)(4) * K(l)(4) +
A(Stage2)(5) * K(l)(5) + A(Stage2)(6) * K(l)(6) +
A(Stage2)(7) * K(l)(7);
Next_Y(l) := Y(l) + Sum;
end loop;
when 9 =>
Stage2 := 9;
for l in Dyn_Index loop
Sum := A(Stage2)(0) * K(l)(0) +
-- A(Stage2)(1) * K(l)(1) + A(Stage2)(2) * K(l)(2) +
A(Stage2)(3) * K(l)(3) + A(Stage2)(4) * K(l)(4) +
A(Stage2)(5) * K(l)(5) + A(Stage2)(6) * K(l)(6) +
A(Stage2)(7) * K(l)(7) + A(Stage2)(8) * K(l)(8);
Next_Y(l) := Y(l) + Sum;
end loop;
when 10 =>
Stage2 := 10;
for l in Dyn_Index loop
Sum := A(Stage2)(0) * K(l)(0) +
-- A(Stage2)(1) * K(l)(1) + A(Stage2)(2) * K(l)(2) +
A(Stage2)(3) * K(l)(3) + A(Stage2)(4) * K(l)(4) +
A(Stage2)(5) * K(l)(5) + A(Stage2)(6) * K(l)(6) +
A(Stage2)(7) * K(l)(7) + A(Stage2)(8) * K(l)(8) +
A(Stage2)(9) * K(l)(9);
Next_Y(l) := Y(l) + Sum;
end loop;
when 11 =>
Stage2 := 11;
for l in Dyn_Index loop
Sum := A(Stage2)(0) * K(l)(0) +
-- A(Stage2)(1) * K(l)(1) + A(Stage2)(2) * K(l)(2) +
A(Stage2)(3) * K(l)(3) + A(Stage2)(4) * K(l)(4) +
A(Stage2)(5) * K(l)(5) + A(Stage2)(6) * K(l)(6) +
A(Stage2)(7) * K(l)(7) + A(Stage2)(8) * K(l)(8) +
A(Stage2)(9) * K(l)(9) + A(Stage2)(10) * K(l)(10);
Next_Y(l) := Y(l) + Sum;
end loop;
when 12 =>
Stage2 := 12;
for l in Dyn_Index loop
Sum := A(Stage2)(0) * K(l)(0) +
-- A(Stage2)(1) * K(l)(1) + A(Stage2)(2) * K(l)(2) +
A(Stage2)(3) * K(l)(3) + A(Stage2)(4) * K(l)(4) +
A(Stage2)(5) * K(l)(5) + A(Stage2)(6) * K(l)(6) +
A(Stage2)(7) * K(l)(7) + A(Stage2)(8) * K(l)(8) +
A(Stage2)(9) * K(l)(9) + A(Stage2)(10) * K(l)(10);
Next_Y(l) := Y(l) + Sum;
end loop;
when others =>
null;
end case;
end Runge_Sum;
pragma Inline (Runge_Sum);
----------------
-- Runge_Sum1 --
----------------
procedure Runge_Sum1
(Y : in Dynamical_Variable;
Next_Y : out Dynamical_Variable;
Stage : in Stages;
K : in K_type)
is
Stage2 : Stages;
Sum : Real;
begin
case Stage is
when 1 =>
Stage2 := 1;
for l in Dyn_Index loop
Sum := A(Stage2)(0) * K(l)(0);
Next_Y(l) := Y(l) + Sum;
end loop;
when 2 =>
Stage2 := 2;
for l in Dyn_Index loop
Sum := A(Stage2)(0) * K(l)(0) + A(Stage2)(1) * K(l)(1);
Next_Y(l) := Y(l) + Sum;
end loop;
when 3 =>
Stage2 := 3;
for l in Dyn_Index loop
Sum := A(Stage2)(0) * K(l)(0) + A(Stage2)(2) * K(l)(2);
Next_Y(l) := Y(l) + Sum;
end loop;
when 4 =>
Stage2 := 4;
for l in Dyn_Index loop
Sum := Zero;
for n in reverse RK_Range range 0..3 loop
Sum := Sum + A(Stage2)(n) * K(l)(n);
end loop;
Next_Y(l) := Y(l) + Sum;
end loop;
when 5 =>
Stage2 := 5;
for l in Dyn_Index loop
Sum := Zero;
for n in reverse RK_Range range 0..4 loop
Sum := Sum + A(Stage2)(n) * K(l)(n);
end loop;
Next_Y(l) := Y(l) + Sum;
end loop;
when 6 =>
Stage2 := 6;
for l in Dyn_Index loop
Sum := Zero;
for n in reverse RK_Range range 0..5 loop
Sum := Sum + A(Stage2)(n) * K(l)(n);
end loop;
Next_Y(l) := Y(l) + Sum;
end loop;
when 7 =>
Stage2 := 7;
for l in Dyn_Index loop
Sum := Zero;
for n in reverse RK_Range range 0..6 loop
Sum := Sum + A(Stage2)(n) * K(l)(n);
end loop;
Next_Y(l) := Y(l) + Sum;
end loop;
when 8 =>
Stage2 := 8;
for l in Dyn_Index loop
Sum := Zero;
for n in reverse RK_Range range 0..7 loop
Sum := Sum + A(Stage2)(n) * K(l)(n);
end loop;
Next_Y(l) := Y(l) + Sum;
end loop;
when 9 =>
Stage2 := 9;
for l in Dyn_Index loop
Sum := Zero;
for n in reverse RK_Range range 0..8 loop
Sum := Sum + A(Stage2)(n) * K(l)(n);
end loop;
Next_Y(l) := Y(l) + Sum;
end loop;
when 10 =>
Stage2 := 10;
for l in Dyn_Index loop
Sum := Zero;
for n in reverse RK_Range range 0..9 loop
Sum := Sum + A(Stage2)(n) * K(l)(n);
end loop;
Next_Y(l) := Y(l) + Sum;
end loop;
when 11 =>
Stage2 := 11;
for l in Dyn_Index loop
Sum := Zero;
for n in reverse RK_Range range 0..10 loop
Sum := Sum + A(Stage2)(n) * K(l)(n);
end loop;
Next_Y(l) := Y(l) + Sum;
--Sum := Zero; Sum2 := 0.0; n := RK_Range'first;
--for p in RK_Range range 0..4 loop
-- Sum := Sum + A(Stage2)(n) * K(l)(n);
-- Sum2 := Sum2 + A(Stage2)(n+1) * K(l)(n+1);
-- n := n+2;
--end loop;
--Next_Y(l) := Y(l) + Sum + Sum2 + A(Stage2)(10) * K(l)(10);
-- Sum := Zero; Sum2 := 0.0;
-- for n in reverse RK_Range range 0..10 loop
-- Sum := Sum + A(Stage2)(n) * K(l)(n);
-- Sum2 := Sum2 + A(Stage2)(n) * K(l)(m+1)(n);
-- end loop;
-- Next_Y(l) := Y(l) + Sum;
-- Result(l)(m+1) := Sum2;
-- m := m+2;
end loop;
when 12 =>
Stage2 := 12;
for l in Dyn_Index loop
Sum := Zero;
for n in reverse RK_Range range 0..10 loop
Sum := Sum + A(Stage2)(n) * K(l)(n);
end loop;
Next_Y(l) := Y(l) + Sum;
end loop;
when others =>
null;
end case;
end Runge_Sum1;
pragma Inline (Runge_Sum1);
----------------
-- Runge_Sum0 --
----------------
-- General formula for getting corrections K.
-- The Next_Y is the Y at which F(t, Y) is next evaluated.
procedure Runge_Sum0
(Y : in Dynamical_Variable;
Next_Y : out Dynamical_Variable;
Stage : in Stages;
K : in K_type)
is
Stage2 : Stages;
Sum : Real;
begin
Stage2 := Stage;
for l in Dyn_Index loop
Sum := 0.0;
for n in reverse RK_Range range 0..Stage2-1 loop -- Sum small 1st
Sum := Sum + A(Stage2)(n) * K(l)(n);
end loop;
Next_Y(l) := Y(l) + Sum;
end loop;
end Runge_Sum0;
---------------
-- Integrate --
---------------
-- Integrate to eighth order using the Prince-Dormond Coefficients.
procedure Integrate
(Final_State : out Dynamical_Variable;
Final_Time : in Real;
Initial_State : in Dynamical_Variable;
Initial_Time : in Real;
No_Of_Steps : in Step_Integer;
Error_Control_Desired : in Boolean := False;
Error_Tolerance : in Real := +1.0E-10)
is
N : constant Real := Real (No_Of_Steps);
Static_Delta_t : constant Real := (Final_Time - Initial_Time) / N;
Delta_t, Error : Real;
Present_t, Time1 : Real;
Y : Dynamical_Variable;
Error_Y : Dynamical_Variable;
Delta_Y : Dynamical_Variable;
This_Is_The_Final_Time_Step : Boolean := False;
-- Increments of Independent variable
-- so K(13) = Delta_t*F (Time + Dt(13), Y + SUM (A(13), K))
K : K_type;
Dt : Coefficient;
---------------------------
-- Seventh_Order_Delta_Y --
---------------------------
-- function to Sum Series For Delta Y efficiently
-- Force it sum small terms 1st. It hardly matters.
function Seventh_Order_Delta_Y
return Dynamical_Variable
is
Result : Dynamical_Variable;
Sum : Real;
begin
for l in Dyn_Index loop
Sum := B7(12) * K(l)(12);
Sum := Sum + B7(11) * K(l)(11);
Sum := Sum + B7(10) * K(l)(10);
Sum := Sum + B7(9) * K(l)(9);
Sum := Sum + B7(8) * K(l)(8);
Sum := Sum + B7(5) * K(l)(5);
Sum := Sum + B7(7) * K(l)(7);
Sum := Sum + B7(6) * K(l)(6);
Sum := Sum + B7(0) * K(l)(0);
Result(l) := Sum;
end loop;
return Result;
end Seventh_Order_Delta_Y;
--------------------------
-- Eighth_Order_Delta_Y --
--------------------------
-- function to Sum Series For Delta Y efficiently
-- Force it sum small terms 1st. It hardly matters.
function Eighth_Order_Delta_Y
return Dynamical_Variable
is
Result : Dynamical_Variable;
Sum : Real;
begin
for l in Dyn_Index loop
Sum := B8(12) * K(l)(12);
Sum := Sum + B8(11) * K(l)(11);
Sum := Sum + B8(10) * K(l)(10);
Sum := Sum + B8(9) * K(l)(9);
Sum := Sum + B8(8) * K(l)(8);
Sum := Sum + B8(5) * K(l)(5);
Sum := Sum + B8(7) * K(l)(7);
Sum := Sum + B8(6) * K(l)(6);
Sum := Sum + B8(0) * K(l)(0);
Result(l) := Sum;
end loop;
return Result;
end Eighth_Order_Delta_Y;
--------------------------------
-- Get_New_Y_to_Eighth_Order --
--------------------------------
-- Force it sum small terms 1st. It hardly matters.
procedure Get_New_Y_to_Eighth_Order
(Y : in out Dynamical_Variable)
is
Sum : Real;
begin
for l in Dyn_Index loop
Sum := B8(12) * K(l)(12);
Sum := Sum + B8(11) * K(l)(11);
Sum := Sum + B8(10) * K(l)(10);
Sum := Sum + B8(9) * K(l)(9);
Sum := Sum + B8(8) * K(l)(8);
Sum := Sum + B8(5) * K(l)(5);
Sum := Sum + B8(7) * K(l)(7);
Sum := Sum + B8(6) * K(l)(6);
Sum := Sum + B8(0) * K(l)(0);
Y(l) := Y(l) + Sum;
end loop;
end Get_New_Y_to_Eighth_Order;
-----------------------------
-- Get_New_Delta_t_and_Dt --
-----------------------------
-- Modifies Delta_t and Dt(i) as global variables.
Inverse_Error_Tolerance : constant Real := One / Error_Tolerance;
procedure Get_New_Delta_t_and_Dt
(Error : in Real;
Delta_t : in out Real;
Dt : out Coefficient)
is
Error_Epsilon : constant Real := Error_Tolerance * 1.0E-6 + Real_Small;
New_Delta_t_Factor : Real := One;
Delta_t_Fractional_Change : Real := One;
begin
Delta_t_Fractional_Change := Nine_Tenths * Exp (-One_Eighth * Log (
Inverse_Error_Tolerance * (Error + Error_Epsilon)));
if Delta_t_Fractional_Change < One_Eighth then
New_Delta_t_Factor := One_Eighth;
elsif Delta_t_Fractional_Change > Four then
New_Delta_t_Factor := Four;
else
New_Delta_t_Factor := Delta_t_Fractional_Change;
end if;
Delta_t := New_Delta_t_Factor * Delta_t;
for i in Stages Loop
Dt(i) := Delta_t * C(i);
end loop;
end Get_New_Delta_t_and_Dt;
begin
Y := Initial_State;
Present_t := Initial_Time;
Delta_t := Static_Delta_t;
for i in Stages loop
Dt(i) := Delta_t * C(i);
end loop;
Time_Steps: loop
-- First get DeltaY to 8th Order by calculating the
-- Runge-Kutta corrections K.
--
-- K(Stages'First) := Delta_t * F (Time, Y);
-- for Stage in Stages'First+1 .. Stages'Last loop
-- K(Stage) := Delta_t * F (Time + Dt(Stage), Y + Sum (Stage));
-- end loop;
Make_New_Corrections_K:
declare
Next_t : Real := Present_t;
Next_Deriv, Next_Y : Dynamical_Variable;
begin
Next_Deriv := F (Next_t, Y);
for l in Dyn_Index loop
K(l)(Stages'First) := Delta_t * Next_Deriv(l);
end loop;
for Stage in Stages'First+1 .. Stages'Last loop
Runge_Sum (Y, Next_Y, Stage, K);
Next_t := Present_t + Dt(Stage);
Next_Deriv := F (Next_t, Next_Y);
for l in Dyn_Index loop
K(l)(Stage) := Delta_t * Next_Deriv(l);
end loop;
end loop;
end Make_New_Corrections_K;
if This_Is_The_Final_Time_Step then --used only if error control is enabled.
Get_New_Y_to_Eighth_Order (Y);
exit Time_Steps;
end if;
-- Now increment Y and Time, and if desired, Delta_t.
-- There are two algorithms below: with and
-- without error control.
if not Error_Control_Desired then
-- Increment time and sum the Runge-Kutta series to increment Y.
-- With the new Y, we can exit if Time is very near Final_Time.
-- (Notice that Delta_t is negative if we integrate back in time.)
-- use globally updated K to get new Y:
Get_New_Y_to_Eighth_Order (Y);
Present_t := Present_t + Static_Delta_t;
exit Time_Steps when Abs (Final_Time-Present_t) < Abs (0.125*Static_Delta_t);
else
-- Error control desired, so first calculate error.
Delta_Y := Eighth_Order_Delta_Y;
Error_Y := Delta_Y - Seventh_Order_Delta_Y;
Error := Norm (Error_Y);
-- Error in 7th order Y really; scales as dt**8
-- Next increment Y and Time if error is OK.
if Error <= Error_Tolerance then -- error is OK.
Time1 := Present_t + Delta_t;
if Abs (Time1-Initial_Time) < Abs (Final_Time-Initial_Time) then
-- Increment both Time and Y. Afterwards
-- get the new step size Delta_t.
Present_t := Time1;
Y := Y + Delta_Y;
elsif Abs (Time1-Initial_Time) > Abs (Final_Time-Initial_Time) then
-- Have to go through the loop again even
-- though the error was small, because overshot
-- the end. Decrease Delta_t here, so there's
-- no need to check error again after final Loop.
This_Is_The_Final_Time_Step := True;
Delta_t := Final_Time - Present_t;
for i in Stages loop
Dt(i) := Delta_t * C(i);
end loop;
else
-- Time1 = Final_Time, to just about the maximum accuracy
-- of the floating point, so get the final Y and exit.
Y := Y + Delta_Y;
exit Time_Steps;
end if;
end if;
-- If this isn't the final loop, then want to adjust Delta_t.
-- We want to make Delta_t smaller if necessary for accuracy, and
-- larger if possible for speed. If function ** is too slow then
-- modify code so that this stuff is done only when we flunk
-- the error test above. But as is, it is done each time step.
if not This_Is_The_Final_Time_Step then
Get_New_Delta_t_and_Dt (Error, Delta_t, Dt);
end if;
end if; -- not error_control_desired
end loop Time_Steps;
Final_State := Y;
end Integrate;
begin
if Test_of_Runge_Coeffs_Desired then
Prince_Dormand_Coeffs.Test_Runge_Coeffs;
end if;
end Runge_8th;
|
gitter-badger/libAnne | Ada | 686 | ads | package Mathematics.Angles.Io is
--@Description Provides input/output operations for Mathematics.Angles
------------
-- Degree --
------------
function Image(Value : Degree) return String with Pure_Function;
function Wide_Image(Value : Degree) return Wide_String with Pure_Function;
function Wide_Wide_Image(Value : Degree) return Wide_Wide_String with Pure_Function;
-------------
-- Gradian --
-------------
function Image(Value : Gradian) return String with Pure_Function;
function Wide_Image(Value : Gradian) return Wide_String with Pure_Function;
function Wide_Wide_Image(Value : Gradian) return Wide_Wide_String with Pure_Function;
end Mathematics.Angles.Io;
|
reznikmm/matreshka | Ada | 3,842 | 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.List_Tab_Stop_Position is
type Text_List_Tab_Stop_Position_Node is
new Matreshka.ODF_Attributes.Text.Text_Node_Base with null record;
type Text_List_Tab_Stop_Position_Access is
access all Text_List_Tab_Stop_Position_Node'Class;
overriding function Get_Local_Name
(Self : not null access constant Text_List_Tab_Stop_Position_Node)
return League.Strings.Universal_String;
end Matreshka.ODF_Attributes.Text.List_Tab_Stop_Position;
|
reznikmm/matreshka | Ada | 3,647 | 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.Text.Start_Value is
type ODF_Text_Start_Value is
new XML.DOM.Attributes.DOM_Attribute with private;
private
type ODF_Text_Start_Value is
new XML.DOM.Attributes.DOM_Attribute with null record;
end ODF.DOM.Attributes.Text.Start_Value;
|
reznikmm/matreshka | Ada | 3,918 | 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.
------------------------------------------------------------------------------
package AMF.Internals.Tables.MOF_Metamodel.Properties is
procedure Initialize;
private
procedure Initialize_1;
procedure Initialize_2;
procedure Initialize_3;
procedure Initialize_4;
procedure Initialize_5;
procedure Initialize_6;
procedure Initialize_7;
procedure Initialize_8;
procedure Initialize_9;
procedure Initialize_10;
procedure Initialize_11;
end AMF.Internals.Tables.MOF_Metamodel.Properties;
|
sungyeon/drake | Ada | 359 | ads | pragma License (Unrestricted);
-- Ada 2012, specialized for Darwin (or FreeBSD)
package System.Multiprocessors is
pragma Preelaborate;
type CPU_Range is range 0 .. Integer'Last;
Not_A_Specific_CPU : constant CPU_Range := 0;
subtype CPU is CPU_Range range 1 .. CPU_Range'Last;
function Number_Of_CPUs return CPU;
end System.Multiprocessors;
|
sungyeon/drake | Ada | 44,187 | adb | with Ada.Exception_Identification.From_Here;
with Ada.Exceptions.Finally;
with Ada.Unchecked_Deallocation;
with System.Form_Parameters;
with System.Native_IO.Names;
with System.Standard_Allocators;
with System.Storage_Elements;
package body Ada.Streams.Naked_Stream_IO is
use Exception_Identification.From_Here;
use type IO_Modes.File_Mode;
use type IO_Modes.File_Shared_Spec;
use type Tags.Tag;
-- use type System.Address;
use type System.Native_IO.File_Mode;
-- use type System.Native_IO.Handle_Type;
use type System.Native_IO.Name_Pointer;
use type System.Storage_Elements.Storage_Offset;
procedure unreachable
with Import,
Convention => Intrinsic, External_Name => "__builtin_unreachable";
pragma No_Return (unreachable);
function To_Pointer (Value : System.Address)
return access Root_Stream_Type'Class
with Import, Convention => Intrinsic;
To_Native_Mode : constant
array (IO_Modes.File_Mode) of System.Native_IO.File_Mode := (
IO_Modes.In_File => System.Native_IO.Read_Only_Mode,
IO_Modes.Out_File => System.Native_IO.Write_Only_Mode,
IO_Modes.Append_File =>
System.Native_IO.Write_Only_Mode or System.Native_IO.Append_Mode);
Inout_To_Native_Mode : constant
array (IO_Modes.Inout_File_Mode) of System.Native_IO.File_Mode := (
IO_Modes.In_File => System.Native_IO.Read_Only_Mode,
IO_Modes.Inout_File => System.Native_IO.Read_Write_Mode,
IO_Modes.Out_File => System.Native_IO.Write_Only_Mode);
-- the parameter Form
procedure Set (
Form : in out System.Native_IO.Packed_Form;
Keyword : String;
Item : String) is
begin
if Keyword = "shared" then
if Item'Length > 0
and then (
Item (Item'First) = 'a' -- allow
or else Item (Item'First) = 'n' -- no, compatibility
or else Item (Item'First) = 'y') -- yes, compatibility
then
Form.Shared := IO_Modes.Allow;
elsif Item'Length > 0 and then Item (Item'First) = 'r' then -- read
Form.Shared := IO_Modes.Read_Only;
elsif Item'Length > 0 and then Item (Item'First) = 'd' then -- deny
Form.Shared := IO_Modes.Deny;
end if;
elsif Keyword = "wait" then
if Item'Length > 0 and then Item (Item'First) = 'f' then -- false
Form.Wait := False;
elsif Item'Length > 0 and then Item (Item'First) = 't' then -- true
Form.Wait := True;
end if;
elsif Keyword = "overwrite" then
if Item'Length > 0 and then Item (Item'First) = 'f' then -- false
Form.Overwrite := False;
elsif Item'Length > 0 and then Item (Item'First) = 't' then -- true
Form.Overwrite := True;
end if;
end if;
end Set;
function Pack (Form : String) return System.Native_IO.Packed_Form is
Keyword_First : Positive;
Keyword_Last : Natural;
Item_First : Positive;
Item_Last : Natural;
Last : Natural;
begin
return Result : System.Native_IO.Packed_Form := Default_Form do
Last := Form'First - 1;
while Last < Form'Last loop
System.Form_Parameters.Get (
Form (Last + 1 .. Form'Last),
Keyword_First,
Keyword_Last,
Item_First,
Item_Last,
Last);
Set (
Result,
Form (Keyword_First .. Keyword_Last),
Form (Item_First .. Item_Last));
end loop;
end return;
end Pack;
procedure Unpack (
Form : System.Native_IO.Packed_Form;
Result : out Form_String;
Last : out Natural)
is
New_Last : Natural;
begin
Last := Form_String'First - 1;
if Form.Shared /= IO_Modes.By_Mode then
case IO_Modes.File_Shared (Form.Shared) is
when IO_Modes.Allow =>
New_Last := Last + 10;
Result (Last + 1 .. New_Last) := "shared=yes";
Last := New_Last;
when IO_Modes.Read_Only =>
New_Last := Last + 11;
Result (Last + 1 .. New_Last) := "shared=read";
Last := New_Last;
when IO_Modes.Deny =>
New_Last := Last + 12;
Result (Last + 1 .. New_Last) := "shared=write";
Last := New_Last;
end case;
end if;
if Form.Wait then
if Last /= Form_String'First - 1 then
New_Last := Last + 1;
Result (New_Last) := ',';
Last := New_Last;
end if;
New_Last := Last + 9;
Result (Last + 1 .. New_Last) := "wait=true";
Last := New_Last;
end if;
if Form.Overwrite then
if Last /= Form_String'First - 1 then
New_Last := Last + 1;
Result (New_Last) := ',';
Last := New_Last;
end if;
New_Last := Last + 14;
Result (Last + 1 .. New_Last) := "overwrite=true";
Last := New_Last;
end if;
end Unpack;
-- non-controlled
function Allocate (
Handle : System.Native_IO.Handle_Type;
Mode : System.Native_IO.File_Mode;
Name : System.Native_IO.Name_Pointer;
Form : System.Native_IO.Packed_Form;
Kind : Stream_Kind;
Has_Full_Name : Boolean;
Closer : Close_Handler)
return Non_Controlled_File_Type;
function Allocate (
Handle : System.Native_IO.Handle_Type;
Mode : System.Native_IO.File_Mode;
Name : System.Native_IO.Name_Pointer;
Form : System.Native_IO.Packed_Form;
Kind : Stream_Kind;
Has_Full_Name : Boolean;
Closer : Close_Handler)
return Non_Controlled_File_Type is
begin
return new Stream_Type'(
Handle => Handle,
Mode => Mode,
Name => Name,
Form => Form,
Kind => Kind,
Has_Full_Name => Has_Full_Name,
Buffer_Inline => <>,
Buffer => System.Null_Address,
Buffer_Length => Uninitialized_Buffer,
Buffer_Index => 0,
Reading_Index => 0,
Writing_Index => 0,
Closer => Closer,
Dispatcher => (Tag => Tags.No_Tag, File => null));
end Allocate;
procedure Free (File : in out Non_Controlled_File_Type);
procedure Free (File : in out Non_Controlled_File_Type) is
use type System.Address;
procedure Raw_Free is
new Unchecked_Deallocation (Stream_Type, Non_Controlled_File_Type);
begin
if File.Buffer /= File.Buffer_Inline'Address then
System.Standard_Allocators.Free (File.Buffer);
end if;
System.Native_IO.Free (File.Name);
Raw_Free (File);
end Free;
type Scoped_Handle_And_File_And_Name is record
-- to cleanup
Handle : aliased System.Native_IO.Handle_Type;
File : aliased Non_Controlled_File_Type;
-- for Handle, and to cleanup when File = null
Name : aliased System.Native_IO.Name_Pointer;
-- for Handle
Closer : Close_Handler;
end record;
pragma Suppress_Initialization (Scoped_Handle_And_File_And_Name);
procedure Finally (X : in out Scoped_Handle_And_File_And_Name);
procedure Finally (X : in out Scoped_Handle_And_File_And_Name) is
use type System.Native_IO.Handle_Type;
begin
if X.Handle /= System.Native_IO.Invalid_Handle then
-- External_No_Close is not set to Scoped_Handle_And_File_And_Name
X.Closer (X.Handle, X.Name, Raise_On_Error => False);
end if;
if X.File /= null then
Free (X.File);
else
System.Native_IO.Free (X.Name);
end if;
end Finally;
procedure Set_Buffer_Index (
File : not null Non_Controlled_File_Type;
Buffer_Index : Stream_Element_Offset);
procedure Set_Buffer_Index (
File : not null Non_Controlled_File_Type;
Buffer_Index : Stream_Element_Offset) is
begin
if File.Buffer_Length = Uninitialized_Buffer then
File.Buffer_Index := Buffer_Index;
elsif File.Buffer_Length = 0 then
File.Buffer_Index := 0;
else
File.Buffer_Index := Buffer_Index
rem Stream_Element_Positive_Count'(File.Buffer_Length);
end if;
File.Reading_Index := File.Buffer_Index;
File.Writing_Index := File.Buffer_Index;
end Set_Buffer_Index;
procedure Set_Index_To_Append (File : not null Non_Controlled_File_Type);
procedure Set_Index_To_Append (File : not null Non_Controlled_File_Type) is
New_Index : Stream_Element_Offset;
begin
System.Native_IO.Set_Relative_Index (
File.Handle,
0,
System.Native_IO.From_End,
New_Index);
Set_Buffer_Index (File, New_Index);
end Set_Index_To_Append;
procedure Allocate_And_Open (
Method : System.Native_IO.Open_Method;
File : out Non_Controlled_File_Type;
Mode : System.Native_IO.File_Mode;
Name : String;
Form : System.Native_IO.Packed_Form);
procedure Allocate_And_Open (
Method : System.Native_IO.Open_Method;
File : out Non_Controlled_File_Type;
Mode : System.Native_IO.File_Mode;
Name : String;
Form : System.Native_IO.Packed_Form)
is
package Holder is
new Exceptions.Finally.Scoped_Holder (
Scoped_Handle_And_File_And_Name,
Finally);
Scoped : aliased Scoped_Handle_And_File_And_Name :=
(System.Native_IO.Invalid_Handle, null, null, null);
Kind : Stream_Kind;
begin
Holder.Assign (Scoped);
if Name /= "" then
Kind := Ordinary;
else
Kind := Temporary;
end if;
if Kind = Ordinary then
Scoped.Closer := System.Native_IO.Close_Ordinary'Access;
System.Native_IO.Names.Open_Ordinary (
Method => Method,
Handle => Scoped.Handle,
Mode => Mode,
Name => Name,
Out_Name => Scoped.Name,
Form => Form);
else
Scoped.Closer := System.Native_IO.Close_Temporary'Access;
System.Native_IO.Open_Temporary (Scoped.Handle, Scoped.Name);
end if;
Scoped.File := Allocate (
Handle => Scoped.Handle,
Mode => Mode,
Name => Scoped.Name,
Form => Form,
Kind => Kind,
Has_Full_Name => Scoped.Name /= null,
Closer => Scoped.Closer);
if Kind = Ordinary
and then (Mode and System.Native_IO.Append_Mode) /= 0
then
Set_Index_To_Append (Scoped.File); -- sets index to the last
end if;
File := Scoped.File;
-- complete
Holder.Clear;
end Allocate_And_Open;
procedure Allocate_External (
File : out Non_Controlled_File_Type;
Mode : System.Native_IO.File_Mode;
Handle : System.Native_IO.Handle_Type;
Name : String;
Form : System.Native_IO.Packed_Form;
To_Close : Boolean);
procedure Allocate_External (
File : out Non_Controlled_File_Type;
Mode : System.Native_IO.File_Mode;
Handle : System.Native_IO.Handle_Type;
Name : String;
Form : System.Native_IO.Packed_Form;
To_Close : Boolean)
is
package Name_Holder is
new Exceptions.Finally.Scoped_Holder (
System.Native_IO.Name_Pointer,
System.Native_IO.Free);
Kind : Stream_Kind;
Closer : Close_Handler;
Full_Name : aliased System.Native_IO.Name_Pointer;
begin
if To_Close then
Kind := External;
Closer := System.Native_IO.Close_Ordinary'Access;
else
Kind := External_No_Close;
Closer := null;
end if;
Name_Holder.Assign (Full_Name);
System.Native_IO.New_External_Name (Name, Full_Name); -- '*' & Name & NUL
File := Allocate (
Handle => Handle,
Mode => Mode,
Name => Full_Name,
Form => Form,
Kind => Kind,
Has_Full_Name => False,
Closer => Closer);
-- complete
Name_Holder.Clear;
end Allocate_External;
procedure Get_Full_Name (File : not null Non_Controlled_File_Type);
procedure Get_Full_Name (File : not null Non_Controlled_File_Type) is
begin
if not File.Has_Full_Name then
System.Native_IO.Names.Get_Full_Name (
File.Handle,
File.Has_Full_Name,
File.Name,
Is_Standard => File.Kind = Standard_Handle,
Raise_On_Error => File.Name = null);
end if;
end Get_Full_Name;
procedure Reset (
File : aliased in out Non_Controlled_File_Type;
Mode : System.Native_IO.File_Mode);
procedure Reset (
File : aliased in out Non_Controlled_File_Type;
Mode : System.Native_IO.File_Mode)
is
package Holder is
new Exceptions.Finally.Scoped_Holder (
Scoped_Handle_And_File_And_Name,
Finally);
Scoped : aliased Scoped_Handle_And_File_And_Name :=
(System.Native_IO.Invalid_Handle, null, null, File.Closer);
begin
Holder.Assign (Scoped);
case File.all.Kind is
when Ordinary =>
Get_Full_Name (File);
Scoped.Handle := File.Handle;
Scoped.File := File;
Scoped.Name := File.Name;
File := null;
Flush_Writing_Buffer (Scoped.File);
-- close explicitly in below
Scoped.Handle := System.Native_IO.Invalid_Handle;
System.Native_IO.Close_Ordinary (
Scoped.File.Handle,
Scoped.File.Name,
Raise_On_Error => True);
Scoped.File.Buffer_Index := 0;
Scoped.File.Reading_Index := Scoped.File.Buffer_Index;
Scoped.File.Writing_Index := Scoped.File.Buffer_Index;
System.Native_IO.Open_Ordinary (
Method => System.Native_IO.Reset,
Handle => Scoped.Handle,
Mode => Mode,
Name => Scoped.File.Name,
Form => Scoped.File.Form);
Scoped.File.Handle := Scoped.Handle;
Scoped.File.Mode := Mode;
if (Mode and System.Native_IO.Append_Mode) /= 0 then
Set_Index_To_Append (Scoped.File);
end if;
when Temporary =>
Scoped.Handle := File.Handle;
Scoped.File := File;
Scoped.Name := File.Name;
File := null;
Scoped.File.Mode := Mode;
if (Mode and System.Native_IO.Append_Mode) /= 0 then
Flush_Writing_Buffer (Scoped.File);
Set_Index_To_Append (Scoped.File);
else
Set_Index (Scoped.File, 1);
end if;
when External | External_No_Close | Standard_Handle =>
pragma Check (Pre, Boolean'(raise Status_Error));
unreachable;
end case;
File := Scoped.File;
-- complete
Holder.Clear;
end Reset;
procedure Get_Buffer (File : not null Non_Controlled_File_Type);
procedure Get_Buffer (File : not null Non_Controlled_File_Type) is
begin
if File.Buffer_Length = Uninitialized_Buffer then
File.Buffer_Length := System.Native_IO.Block_Size (File.Handle);
if File.Buffer_Length = 0 then
File.Buffer := File.Buffer_Inline'Address;
File.Buffer_Index := 0;
else
File.Buffer := System.Standard_Allocators.Allocate (
System.Storage_Elements.Storage_Offset (File.Buffer_Length));
File.Buffer_Index := File.Buffer_Index
rem Stream_Element_Positive_Count'(File.Buffer_Length);
end if;
File.Reading_Index := File.Buffer_Index;
File.Writing_Index := File.Buffer_Index;
end if;
end Get_Buffer;
procedure Ready_Reading_Buffer (
File : not null Non_Controlled_File_Type;
Error : out Boolean);
procedure Ready_Reading_Buffer (
File : not null Non_Controlled_File_Type;
Error : out Boolean)
is
Buffer_Length : constant Stream_Element_Positive_Count :=
Stream_Element_Offset'Max (1, File.Buffer_Length);
begin
-- reading buffer is from File.Reading_Index until File.Buffer_Index
File.Buffer_Index := File.Buffer_Index rem Buffer_Length;
File.Reading_Index := File.Buffer_Index;
declare
Read_Length : Stream_Element_Offset;
begin
System.Native_IO.Read (
File.Handle,
File.Buffer
+ System.Storage_Elements.Storage_Offset (File.Buffer_Index),
Buffer_Length - File.Buffer_Index,
Read_Length);
Error := Read_Length < 0;
if not Error then
File.Buffer_Index := File.Buffer_Index + Read_Length;
end if;
end;
File.Writing_Index := File.Buffer_Index;
end Ready_Reading_Buffer;
procedure Reset_Reading_Buffer (File : not null Non_Controlled_File_Type);
procedure Reset_Reading_Buffer (File : not null Non_Controlled_File_Type) is
Dummy_New_Index : Stream_Element_Offset;
begin
System.Native_IO.Set_Relative_Index (
File.Handle,
File.Reading_Index - File.Buffer_Index,
System.Native_IO.From_Current,
Dummy_New_Index);
File.Buffer_Index := File.Reading_Index;
File.Writing_Index := File.Buffer_Index;
end Reset_Reading_Buffer;
procedure Ready_Writing_Buffer (File : not null Non_Controlled_File_Type);
procedure Ready_Writing_Buffer (File : not null Non_Controlled_File_Type) is
begin
-- writing buffer is from File.Buffer_Index until File.Writing_Index
File.Buffer_Index := File.Buffer_Index
rem Stream_Element_Positive_Count'(File.Buffer_Length);
File.Writing_Index := File.Buffer_Index;
File.Reading_Index := File.Buffer_Index;
end Ready_Writing_Buffer;
function Offset_Of_Buffer (File : not null Non_Controlled_File_Type)
return Stream_Element_Offset;
function Offset_Of_Buffer (File : not null Non_Controlled_File_Type)
return Stream_Element_Offset is
begin
return (File.Writing_Index - File.Buffer_Index)
- (File.Buffer_Index - File.Reading_Index);
end Offset_Of_Buffer;
procedure Read_From_Buffer (
File : not null Non_Controlled_File_Type;
Item : out Stream_Element_Array;
Last : out Stream_Element_Offset);
procedure Read_From_Buffer (
File : not null Non_Controlled_File_Type;
Item : out Stream_Element_Array;
Last : out Stream_Element_Offset)
is
Taking_Length : constant Stream_Element_Offset :=
Stream_Element_Offset'Min (
Item'Last - Item'First + 1,
File.Buffer_Index - File.Reading_Index);
Buffer : Stream_Element_Array (
0 .. Stream_Element_Offset'Max (0, File.Buffer_Length - 1));
for Buffer'Address use File.Buffer;
begin
Last := Item'First + (Taking_Length - 1);
Item (Item'First .. Last) :=
Buffer (File.Reading_Index .. File.Reading_Index + Taking_Length - 1);
File.Reading_Index := File.Reading_Index + Taking_Length;
end Read_From_Buffer;
procedure Write_To_Buffer (
File : not null Non_Controlled_File_Type;
Item : Stream_Element_Array;
Last : out Stream_Element_Offset);
procedure Write_To_Buffer (
File : not null Non_Controlled_File_Type;
Item : Stream_Element_Array;
Last : out Stream_Element_Offset)
is
Taking_Length : constant Stream_Element_Offset :=
Stream_Element_Offset'Min (
Item'Last - Item'First + 1,
File.Buffer_Length - File.Writing_Index);
Buffer : Stream_Element_Array (
0 .. Stream_Element_Offset'Max (0, File.Buffer_Length - 1));
for Buffer'Address use File.Buffer;
begin
Last := Item'First + (Taking_Length - 1);
Buffer (File.Writing_Index .. File.Writing_Index + Taking_Length - 1) :=
Item (Item'First .. Last);
File.Writing_Index := File.Writing_Index + Taking_Length;
end Write_To_Buffer;
function End_Of_Ordinary_File (File : not null Non_Controlled_File_Type)
return Boolean;
function End_Of_Ordinary_File (File : not null Non_Controlled_File_Type)
return Boolean
is
Size : constant Stream_Element_Count :=
System.Native_IO.Size (File.Handle);
Index : constant Stream_Element_Offset :=
System.Native_IO.Index (File.Handle) + Offset_Of_Buffer (File);
begin
return Index > Size;
-- The writing buffer can be expanded over the file size.
end End_Of_Ordinary_File;
procedure Close_And_Deallocate (
File : aliased in out Non_Controlled_File_Type;
Raise_On_Error : Boolean);
procedure Close_And_Deallocate (
File : aliased in out Non_Controlled_File_Type;
Raise_On_Error : Boolean)
is
use type System.Native_IO.Handle_Type;
package Holder is
new Exceptions.Finally.Scoped_Holder (
Scoped_Handle_And_File_And_Name,
Finally);
Scoped : aliased Scoped_Handle_And_File_And_Name :=
(System.Native_IO.Invalid_Handle, null, null, File.Closer);
Freeing_File : constant Non_Controlled_File_Type := File;
begin
Holder.Assign (Scoped);
File := null;
declare
Kind : constant Stream_Kind := Freeing_File.Kind;
begin
if Kind /= Standard_Handle then
if Kind /= External_No_Close then
Scoped.Handle := Freeing_File.Handle;
end if;
Scoped.File := Freeing_File;
Scoped.Name := Freeing_File.Name;
else
-- The standard files are statically allocated.
if Freeing_File.Has_Full_Name then
Scoped.Name := Freeing_File.Name;
-- The standard files may be double-finalized
-- from Ada.Streams.Stream_IO.Standard_Files and Ada.Text_IO.
Freeing_File.Name := null;
Freeing_File.Has_Full_Name := False;
end if;
end if;
if Kind /= Temporary then
Flush_Writing_Buffer (
Freeing_File,
Raise_On_Error => Raise_On_Error);
end if;
end;
if Scoped.Handle /= System.Native_IO.Invalid_Handle then
-- close explicitly in below
Scoped.Handle := System.Native_IO.Invalid_Handle;
Freeing_File.Closer (
Freeing_File.Handle,
Freeing_File.Name,
Raise_On_Error => Raise_On_Error);
end if;
end Close_And_Deallocate;
-- implementation of non-controlled
procedure Create (
File : in out Non_Controlled_File_Type;
Mode : IO_Modes.File_Mode := IO_Modes.Out_File;
Name : String := "";
Form : System.Native_IO.Packed_Form := Default_Form)
is
pragma Check (Pre,
Check => not Is_Open (File) or else raise Status_Error);
begin
Allocate_And_Open (
Method => System.Native_IO.Create,
File => File,
Mode => To_Native_Mode (Mode),
Name => Name,
Form => Form);
end Create;
procedure Create (
File : in out Non_Controlled_File_Type;
Mode : IO_Modes.Inout_File_Mode := IO_Modes.Out_File;
Name : String := "";
Form : System.Native_IO.Packed_Form := Default_Form)
is
pragma Check (Pre,
Check => not Is_Open (File) or else raise Status_Error);
begin
Allocate_And_Open (
Method => System.Native_IO.Create,
File => File,
Mode => Inout_To_Native_Mode (Mode),
Name => Name,
Form => Form);
end Create;
procedure Open (
File : in out Non_Controlled_File_Type;
Mode : IO_Modes.File_Mode;
Name : String;
Form : System.Native_IO.Packed_Form := Default_Form)
is
pragma Check (Pre,
Check => not Is_Open (File) or else raise Status_Error);
begin
Allocate_And_Open (
Method => System.Native_IO.Open,
File => File,
Mode => To_Native_Mode (Mode),
Name => Name,
Form => Form);
end Open;
procedure Open (
File : in out Non_Controlled_File_Type;
Mode : IO_Modes.Inout_File_Mode;
Name : String;
Form : System.Native_IO.Packed_Form := Default_Form)
is
pragma Check (Pre,
Check => not Is_Open (File) or else raise Status_Error);
begin
Allocate_And_Open (
Method => System.Native_IO.Open,
File => File,
Mode => Inout_To_Native_Mode (Mode),
Name => Name,
Form => Form);
end Open;
procedure Close (
File : aliased in out Non_Controlled_File_Type;
Raise_On_Error : Boolean := True)
is
pragma Check (Pre,
Check => Is_Open (File) or else raise Status_Error);
begin
Close_And_Deallocate (File, Raise_On_Error => Raise_On_Error);
end Close;
procedure Delete (File : aliased in out Non_Controlled_File_Type) is
pragma Check (Pre,
Check => Is_Open (File) or else raise Status_Error);
begin
case File.Kind is
when Ordinary =>
Get_Full_Name (File);
File.Closer := System.Native_IO.Delete_Ordinary'Access;
Close_And_Deallocate (File, Raise_On_Error => True);
when Temporary =>
Close_And_Deallocate (File, Raise_On_Error => True);
when External | External_No_Close | Standard_Handle =>
pragma Check (Pre, Boolean'(raise Status_Error));
unreachable;
end case;
end Delete;
procedure Reset (
File : aliased in out Non_Controlled_File_Type;
Mode : IO_Modes.File_Mode)
is
pragma Check (Pre,
Check => Is_Open (File) or else raise Status_Error);
begin
Reset (File, To_Native_Mode (Mode));
end Reset;
procedure Reset (
File : aliased in out Non_Controlled_File_Type;
Mode : IO_Modes.Inout_File_Mode)
is
pragma Check (Pre,
Check => Is_Open (File) or else raise Status_Error);
begin
Reset (File, Inout_To_Native_Mode (Mode));
end Reset;
function Mode (File : not null Non_Controlled_File_Type)
return IO_Modes.File_Mode is
begin
if File.Mode = System.Native_IO.Read_Only_Mode then
return IO_Modes.In_File;
elsif File.Mode = System.Native_IO.Write_Only_Mode then
return IO_Modes.Out_File;
else
return IO_Modes.Append_File; -- implies Inout_File
end if;
end Mode;
function Mode (File : not null Non_Controlled_File_Type)
return IO_Modes.Inout_File_Mode is
begin
if File.Mode = System.Native_IO.Read_Only_Mode then
return IO_Modes.In_File;
elsif File.Mode /= System.Native_IO.Write_Only_Mode then
return IO_Modes.Inout_File; -- implies Append_File
else
return IO_Modes.Out_File;
end if;
end Mode;
function Mode (File : not null Non_Controlled_File_Type)
return System.Native_IO.File_Mode is
begin
return File.Mode;
end Mode;
function Name (File : not null Non_Controlled_File_Type) return String is
begin
Get_Full_Name (File);
return System.Native_IO.Value (File.Name);
end Name;
function Form (File : Non_Controlled_File_Type)
return System.Native_IO.Packed_Form is
begin
return File.Form;
end Form;
function Is_Open (File : Non_Controlled_File_Type) return Boolean is
begin
return File /= null;
end Is_Open;
function End_Of_File (File : not null Non_Controlled_File_Type)
return Boolean is
begin
Get_Buffer (File);
if File.Buffer_Length = 0 then -- not ordinary file
if File.Reading_Index = File.Buffer_Index then
declare
Error : Boolean;
begin
Ready_Reading_Buffer (File, Error);
if Error then
Raise_Exception (Device_Error'Identity);
end if;
end;
end if;
return File.Reading_Index = File.Buffer_Index;
else
return End_Of_Ordinary_File (File);
end if;
end End_Of_File;
function Stream (File : not null Non_Controlled_File_Type)
return not null access Root_Stream_Type'Class is
begin
if File.Dispatcher.Tag = Tags.No_Tag then
if not System.Native_IO.Is_Seekable (File.Handle) then
File.Dispatcher.Tag := Dispatchers.Root_Dispatcher'Tag;
else
File.Dispatcher.Tag := Dispatchers.Seekable_Dispatcher'Tag;
end if;
File.Dispatcher.File := File;
end if;
return To_Pointer (File.Dispatcher'Address);
end Stream;
procedure Read (
File : not null Non_Controlled_File_Type;
Item : out Stream_Element_Array;
Last : out Stream_Element_Offset)
is
Index : Stream_Element_Offset := Item'First;
begin
if File.Reading_Index < File.Buffer_Index then
declare
Temp_Last : Stream_Element_Offset;
begin
Read_From_Buffer (File, Item, Temp_Last);
if Temp_Last = Item'Last then
Last := Temp_Last;
return;
end if;
Index := Temp_Last + 1;
end;
else
if File.Writing_Index > File.Buffer_Index then
Flush_Writing_Buffer (File);
end if;
if Index > Item'Last then
Last := Index - 1;
return;
end if;
end if;
Get_Buffer (File);
declare
Error : Boolean := False;
Buffer_Length : constant Stream_Element_Count := File.Buffer_Length;
begin
declare
Taking_Length : Stream_Element_Count;
begin
Taking_Length := Item'Last - Index + 1;
if Buffer_Length > 0 then
declare
Misaligned : constant Stream_Element_Count :=
(Buffer_Length - File.Buffer_Index) rem Buffer_Length;
begin
if Taking_Length < Misaligned then
Taking_Length := 0; -- to use reading buffer
else
Taking_Length := Taking_Length - Misaligned;
Taking_Length := Taking_Length
- Taking_Length rem Buffer_Length;
Taking_Length := Taking_Length + Misaligned;
end if;
end;
end if;
if Taking_Length > 0 then
declare
Read_Size : Stream_Element_Offset;
begin
System.Native_IO.Read (
File.Handle,
Item (Index)'Address,
Taking_Length,
Read_Size);
Error := Read_Size < 0;
if not Error then
Index := Index + Read_Size;
-- update indexes
if Buffer_Length > 0 then
File.Buffer_Index :=
(File.Buffer_Index + Read_Size) rem Buffer_Length;
else
File.Buffer_Index := 0;
end if;
File.Reading_Index := File.Buffer_Index;
File.Writing_Index := File.Buffer_Index;
end if;
end;
end if;
end;
if not Error
and then Index <= Item'Last
and then File.Buffer_Length > 0
then
Ready_Reading_Buffer (File, Error); -- reading buffer is empty
if not Error and then File.Reading_Index < File.Buffer_Index then
declare
Temp_Last : Stream_Element_Offset;
begin
Read_From_Buffer (
File,
Item (Index .. Item'Last),
Temp_Last);
Index := Temp_Last + 1;
end;
end if;
end if;
if Index <= Item'First then
-- RM 13.13.1(8/2), Item'First - 1 is returned in Last for EOF.
if Error then
Raise_Exception (Device_Error'Identity);
elsif Index = Stream_Element_Offset'First then
raise Constraint_Error; -- AARM 13.13.1(11/2)
end if;
end if;
end;
Last := Index - 1;
end Read;
procedure Write (
File : not null Non_Controlled_File_Type;
Item : Stream_Element_Array)
is
First : Stream_Element_Offset := Item'First;
begin
if File.Writing_Index > File.Buffer_Index then
-- append to writing buffer
declare
Temp_Last : Stream_Element_Offset;
begin
Write_To_Buffer (File, Item, Temp_Last);
if File.Writing_Index = File.Buffer_Length then
Flush_Writing_Buffer (File);
end if;
if Temp_Last >= Item'Last then
return;
end if;
First := Temp_Last + 1;
end;
else
if File.Reading_Index < File.Buffer_Index then
-- reset reading buffer
Reset_Reading_Buffer (File);
end if;
if First > Item'Last then
return;
end if;
end if;
Get_Buffer (File);
declare
Buffer_Length : constant Stream_Element_Count := File.Buffer_Length;
begin
declare
Taking_Length : Stream_Element_Count;
begin
Taking_Length := Item'Last - First + 1;
if Buffer_Length > 0 then
declare
Misaligned : constant Stream_Element_Count :=
(Buffer_Length - File.Buffer_Index) rem Buffer_Length;
begin
if Taking_Length < Misaligned then
Taking_Length := 0; -- to use writing buffer
else
Taking_Length := Taking_Length - Misaligned;
Taking_Length := Taking_Length
- Taking_Length rem Buffer_Length;
Taking_Length := Taking_Length + Misaligned;
end if;
end;
end if;
if Taking_Length > 0 then
declare
Written_Length : Stream_Element_Offset;
begin
System.Native_IO.Write (
File.Handle,
Item (First)'Address,
Taking_Length,
Written_Length);
if Written_Length < 0 then
Raise_Exception (Device_Error'Identity);
end if;
end;
First := First + Taking_Length;
-- update indexes
if Buffer_Length > 0 then
File.Buffer_Index :=
(File.Buffer_Index + Taking_Length) rem Buffer_Length;
File.Reading_Index := File.Buffer_Index;
File.Writing_Index := File.Buffer_Index;
end if;
end if;
end;
if First <= Item'Last and then Buffer_Length > 0 then
Ready_Writing_Buffer (File);
declare
Temp_Last : Stream_Element_Offset;
begin
Write_To_Buffer (File, Item (First .. Item'Last), Temp_Last);
end;
end if;
end;
end Write;
procedure Set_Index (
File : not null Non_Controlled_File_Type;
To : Stream_Element_Positive_Count)
is
Dummy_New_Index : Stream_Element_Offset;
Z_Index : constant Stream_Element_Offset := To - 1; -- zero based
begin
Flush_Writing_Buffer (File);
if (File.Mode and System.Native_IO.Append_Mode) /= 0 then
System.Native_IO.Unset (
File.Handle,
Mask => not System.Native_IO.Append_Mode);
end if;
System.Native_IO.Set_Relative_Index (
File.Handle,
Z_Index,
System.Native_IO.From_Begin,
Dummy_New_Index);
Set_Buffer_Index (File, Z_Index);
end Set_Index;
function Index (File : not null Non_Controlled_File_Type)
return Stream_Element_Positive_Count is
begin
return System.Native_IO.Index (File.Handle) + Offset_Of_Buffer (File);
end Index;
function Size (File : not null Non_Controlled_File_Type)
return Stream_Element_Count is
begin
Flush_Writing_Buffer (File);
return System.Native_IO.Size (File.Handle);
end Size;
procedure Set_Mode (
File : aliased in out Non_Controlled_File_Type;
Mode : IO_Modes.File_Mode)
is
pragma Check (Pre,
Check => Is_Open (File) or else raise Status_Error);
package Holder is
new Exceptions.Finally.Scoped_Holder (
Scoped_Handle_And_File_And_Name,
Finally);
Scoped : aliased Scoped_Handle_And_File_And_Name :=
(System.Native_IO.Invalid_Handle, null, null, File.Closer);
Current : Stream_Element_Positive_Count;
Native_Mode : System.Native_IO.File_Mode;
begin
Holder.Assign (Scoped);
Native_Mode := To_Native_Mode (Mode);
case File.all.Kind is
when Ordinary =>
Get_Full_Name (File);
Scoped.Handle := File.Handle;
Scoped.File := File;
Scoped.Name := File.Name;
File := null;
Current := Index (Scoped.File);
Flush_Writing_Buffer (Scoped.File);
-- close explicitly in below
Scoped.Handle := System.Native_IO.Invalid_Handle;
System.Native_IO.Close_Ordinary (
Scoped.File.Handle,
Scoped.File.Name,
Raise_On_Error => True);
System.Native_IO.Open_Ordinary (
Method => System.Native_IO.Reset,
Handle => Scoped.Handle,
Mode => Native_Mode,
Name => Scoped.File.Name,
Form => Scoped.File.Form);
Scoped.File.Handle := Scoped.Handle;
Scoped.File.Mode := Native_Mode;
when Temporary =>
Scoped.Handle := File.Handle;
Scoped.File := File;
Scoped.Name := File.Name;
File := null;
Current := Index (Scoped.File);
Flush_Writing_Buffer (Scoped.File);
Scoped.File.Mode := Native_Mode;
when External | External_No_Close | Standard_Handle =>
pragma Check (Pre, Boolean'(raise Status_Error));
unreachable;
end case;
if (Native_Mode and System.Native_IO.Append_Mode) /= 0 then
Set_Index_To_Append (Scoped.File);
else
Set_Index (Scoped.File, Current);
end if;
File := Scoped.File;
-- complete
Holder.Clear;
end Set_Mode;
procedure Flush (File : not null Non_Controlled_File_Type) is
begin
Flush_Writing_Buffer (File);
System.Native_IO.Flush (File.Handle);
end Flush;
procedure Flush_Writing_Buffer (
File : not null Non_Controlled_File_Type;
Raise_On_Error : Boolean := True) is
begin
if File.Writing_Index > File.Buffer_Index then
declare
Error : Boolean := False;
Written_Length : Stream_Element_Offset;
begin
System.Native_IO.Write (
File.Handle,
File.Buffer
+ System.Storage_Elements.Storage_Offset (File.Buffer_Index),
File.Writing_Index - File.Buffer_Index,
Written_Length);
if Written_Length < 0 then
if Raise_On_Error then
Raise_Exception (Device_Error'Identity);
end if;
Error := True;
end if;
if not Error then
File.Buffer_Index := File.Writing_Index
rem Stream_Element_Positive_Count'(File.Buffer_Length);
File.Writing_Index := File.Buffer_Index;
File.Reading_Index := File.Buffer_Index;
end if;
end;
end if;
end Flush_Writing_Buffer;
-- implementation of handle for non-controlled
procedure Open (
File : in out Non_Controlled_File_Type;
Mode : IO_Modes.File_Mode;
Handle : System.Native_IO.Handle_Type;
Name : String := "";
Form : System.Native_IO.Packed_Form := Default_Form;
To_Close : Boolean := False)
is
pragma Check (Pre,
Check => not Is_Open (File) or else raise Status_Error);
begin
Allocate_External (
File => File,
Mode => To_Native_Mode (Mode),
Handle => Handle,
Name => Name,
Form => Form,
To_Close => To_Close);
end Open;
procedure Open (
File : in out Non_Controlled_File_Type;
Mode : IO_Modes.Inout_File_Mode;
Handle : System.Native_IO.Handle_Type;
Name : String := "";
Form : System.Native_IO.Packed_Form := Default_Form;
To_Close : Boolean := False)
is
pragma Check (Pre,
Check => not Is_Open (File) or else raise Status_Error);
begin
Allocate_External (
File => File,
Mode => Inout_To_Native_Mode (Mode),
Handle => Handle,
Name => Name,
Form => Form,
To_Close => To_Close);
end Open;
function Handle (File : not null Non_Controlled_File_Type)
return System.Native_IO.Handle_Type is
begin
return File.Handle;
end Handle;
function Is_Standard (File : not null Non_Controlled_File_Type)
return Boolean is
begin
return File.Kind = Standard_Handle;
end Is_Standard;
package body Dispatchers is
overriding procedure Read (
Stream : in out Root_Dispatcher;
Item : out Stream_Element_Array;
Last : out Stream_Element_Offset)
is
pragma Check (Pre,
Check =>
(Stream.File.Mode and System.Native_IO.Read_Write_Mask) /=
System.Native_IO.Write_Only_Mode
or else raise Mode_Error);
begin
Read (Stream.File, Item, Last);
end Read;
overriding procedure Write (
Stream : in out Root_Dispatcher;
Item : Stream_Element_Array)
is
pragma Check (Pre,
Check =>
(Stream.File.Mode and System.Native_IO.Read_Write_Mask) /=
System.Native_IO.Read_Only_Mode
or else raise Mode_Error);
begin
Write (Stream.File, Item);
end Write;
overriding procedure Read (
Stream : in out Seekable_Dispatcher;
Item : out Stream_Element_Array;
Last : out Stream_Element_Offset)
is
pragma Check (Pre,
Check =>
(Stream.File.Mode and System.Native_IO.Read_Write_Mask) /=
System.Native_IO.Write_Only_Mode
or else raise Mode_Error);
begin
Read (Stream.File, Item, Last);
end Read;
overriding procedure Write (
Stream : in out Seekable_Dispatcher;
Item : Stream_Element_Array)
is
pragma Check (Pre,
Check =>
(Stream.File.Mode and System.Native_IO.Read_Write_Mask) /=
System.Native_IO.Read_Only_Mode
or else raise Mode_Error);
begin
Write (Stream.File, Item);
end Write;
overriding procedure Set_Index (
Stream : in out Seekable_Dispatcher;
To : Stream_Element_Positive_Count) is
begin
Set_Index (Stream.File, To);
end Set_Index;
overriding function Index (Stream : Seekable_Dispatcher)
return Stream_Element_Positive_Count is
begin
return Index (Stream.File);
end Index;
overriding function Size (Stream : Seekable_Dispatcher)
return Stream_Element_Count is
begin
return Size (Stream.File);
end Size;
end Dispatchers;
end Ada.Streams.Naked_Stream_IO;
|
onedigitallife-net/Byron | Ada | 1,668 | adb | pragma Wide_Character_Encoding(UTF8);
with
-- Lexington dependencies; mainlt for printing/debugging.
Lexington.Aux,
Lexington.Token_Vector_Pkg,
-- Actual Byron dependencies.
Byron.Lexer,
Byron.Reader,
Byron.Internals.Types,
-- Wide_Wide_Text_IO for debugging.
Ada.Wide_Wide_Text_IO.Text_Streams;
Procedure Compiler is
-- Returns the file "test.adb", already opened.
Function Test_File return Ada.Wide_Wide_Text_IO.File_Type is
use Ada.Wide_Wide_Text_IO;
Begin
return Result : File_Type do
Open( Result, Name => "test.adb", Mode => In_File);
end return;
End Test_File;
-- A visual separator.
Page_Break : constant Wide_Wide_String:=
"------------------------------------------";
File : Ada.Wide_Wide_Text_IO.File_Type:= Test_File;
Stream : aliased Ada.Wide_Wide_Text_IO.Text_Streams.Stream_Access:=
Ada.Wide_Wide_Text_IO.Text_Streams.Stream(File);
Tokens : Lexington.Token_Vector_Pkg.Vector;
Begin
TOKENIZING:
Declare
Use Byron.Internals.Types;
File_Stream : constant Stream_Class := Stream_Class(Stream);
Begin
Ada.Wide_Wide_Text_IO.Put_Line( Page_Break );
Tokens:= Byron.Lexer( Input => Byron.Reader(File_Stream) );
End TOKENIZING;
-- Print the tokens!
PRINTING:
For Token of Tokens loop
declare
use all type Lexington.Aux.Token_Pkg.Token;
begin
Ada.Wide_Wide_Text_IO.Put_Line( Lexington.Aux.Token_Pkg.Print(Token) );
end;
End Loop PRINTING;
-- Clean-up!
Ada.Wide_Wide_Text_IO.Close(File);
Ada.Wide_Wide_Text_IO.Put_Line( Page_Break );
Ada.Wide_Wide_Text_IO.Put_Line( "Done." );
End Compiler;
|
reznikmm/matreshka | Ada | 4,559 | 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.
------------------------------------------------------------------------------
-- For showing text about NamedElements.
------------------------------------------------------------------------------
limited with AMF.UML.Named_Elements;
with AMF.UMLDI.UML_Labels;
package AMF.UMLDI.UML_Name_Labels is
pragma Preelaborate;
type UMLDI_UML_Name_Label is limited interface
and AMF.UMLDI.UML_Labels.UMLDI_UML_Label;
type UMLDI_UML_Name_Label_Access is
access all UMLDI_UML_Name_Label'Class;
for UMLDI_UML_Name_Label_Access'Storage_Size use 0;
not overriding function Get_Mode_Element
(Self : not null access constant UMLDI_UML_Name_Label)
return AMF.UML.Named_Elements.UML_Named_Element_Access is abstract;
-- Getter of UMLNameLabel::modeElement.
--
-- Restricts UMLNameLabels to be notation for NamedElements.
not overriding procedure Set_Mode_Element
(Self : not null access UMLDI_UML_Name_Label;
To : AMF.UML.Named_Elements.UML_Named_Element_Access) is abstract;
-- Setter of UMLNameLabel::modeElement.
--
-- Restricts UMLNameLabels to be notation for NamedElements.
end AMF.UMLDI.UML_Name_Labels;
|
AaronC98/PlaneSystem | Ada | 6,327 | adb | ------------------------------------------------------------------------------
-- Ada Web Server --
-- --
-- Copyright (C) 2000-2015, AdaCore --
-- --
-- This library is free software; you can redistribute it and/or modify --
-- it under terms of the GNU General Public License as published by the --
-- Free Software Foundation; either version 3, or (at your option) any --
-- later version. This library is distributed in the hope that it will be --
-- useful, but WITHOUT ANY WARRANTY; without even the implied warranty of --
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- --
-- --
-- --
-- --
-- --
-- --
------------------------------------------------------------------------------
pragma Ada_2012;
-- This package is based on Tree_Reader from the XMLada package
with DOM.Core.Documents; use DOM.Core.Documents;
with DOM.Core.Elements; use DOM.Core.Elements;
with DOM.Core.Nodes; use DOM.Core.Nodes;
with Sax.Attributes; use Sax.Attributes;
with Unicode; use Unicode;
with Unicode.CES; use Unicode.CES;
with SOAP.Utils;
package body SOAP.Message.Reader is
----------------
-- Characters --
----------------
overriding procedure Characters
(Handler : in out Tree_Reader;
Ch : Unicode.CES.Byte_Sequence)
is
Tmp : Node with Unreferenced;
begin
declare
-- Ch comes from the SAX parser and is Utf8 encoded. We convert
-- it back to Basic_8bit (standard Ada strings). Depending on
-- Ch's value this could raise an exception. For example if
-- Ch is Utf32 encoded and contains characters outside the
-- Basic_8bit encoding.
S : constant String_Access := Utils.From_Utf8 (Ch);
begin
Tmp := Append_Child
(Handler.Current_Node,
Create_Text_Node (Handler.Tree, DOM_String_Access (S)));
end;
exception
when Unicode.CES.Invalid_Encoding =>
-- Here we had a problem decoding the string, just keep Ch as-is
Tmp := Append_Child
(Handler.Current_Node, Create_Text_Node (Handler.Tree, Ch));
end Characters;
-----------------
-- End_Element --
-----------------
overriding procedure End_Element
(Handler : in out Tree_Reader;
Namespace_URI : Unicode.CES.Byte_Sequence := "";
Local_Name : Unicode.CES.Byte_Sequence := "";
Qname : Unicode.CES.Byte_Sequence := "")
is
pragma Unreferenced (Namespace_URI);
pragma Unreferenced (Local_Name);
pragma Unreferenced (Qname);
begin
Handler.Current_Node := Parent_Node (Handler.Current_Node);
end End_Element;
--------------
-- Get_Tree --
--------------
function Get_Tree (Read : Tree_Reader) return DOM.Core.Document is
begin
return Read.Tree;
end Get_Tree;
--------------------------
-- Ignorable_Whitespace --
--------------------------
overriding procedure Ignorable_Whitespace
(Handler : in out Tree_Reader;
Ch : Unicode.CES.Byte_Sequence)
is
Tmp : Node with Unreferenced;
begin
-- Ignore these white spaces at the toplevel
if Ch'Length >= 1
and then Ch (Ch'First) /= ASCII.LF
and then Handler.Current_Node /= Handler.Tree
then
Tmp := Append_Child
(Handler.Current_Node, Create_Text_Node (Handler.Tree, Ch));
end if;
end Ignorable_Whitespace;
--------------------
-- Start_Document --
--------------------
overriding procedure Start_Document (Handler : in out Tree_Reader) is
Implementation : DOM_Implementation;
begin
Handler.Tree := Create_Document (Implementation);
Handler.Current_Node := Handler.Tree;
end Start_Document;
-------------------
-- Start_Element --
-------------------
overriding procedure Start_Element
(Handler : in out Tree_Reader;
Namespace_URI : Unicode.CES.Byte_Sequence := "";
Local_Name : Unicode.CES.Byte_Sequence := "";
Qname : Unicode.CES.Byte_Sequence := "";
Atts : Sax.Attributes.Attributes'Class)
is
pragma Unreferenced (Local_Name);
begin
Handler.Current_Node := Append_Child
(Handler.Current_Node,
Create_Element_NS (Handler.Tree,
Namespace_URI => Namespace_URI,
Qualified_Name => Qname));
-- Insert the attributes in the right order
for J in 0 .. Get_Length (Atts) - 1 loop
Set_Attribute_NS
(Handler.Current_Node,
Get_URI (Atts, J),
Get_Qname (Atts, J),
Get_Value (Atts, J));
end loop;
end Start_Element;
begin
DOM.Core.Set_Node_List_Growth_Factor (1.0);
end SOAP.Message.Reader;
|
notdb/LC-Practice | Ada | 182 | adb | with Ada.Text_IO; use Ada.Text_IO;
procedure Greet_No_Op is
begin
for I in reverse 5 .. 1 loop
Put_Line ("Hello, World!" & Integer'Image (I));
end loop;
end Greet_No_Op; |
stcarrez/dynamo | Ada | 3,804 | adb | -----------------------------------------------------------------------
-- gen-artifacts-distribs-concat -- Concatenate based distribution artifact
-- Copyright (C) 2012, 2020 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.Directories;
with Ada.Streams.Stream_IO;
with Ada.Exceptions;
with Ada.IO_Exceptions;
with Util.Log.Loggers;
with Util.Streams;
with Util.Streams.Files;
package body Gen.Artifacts.Distribs.Concat is
use Util.Log;
Log : constant Loggers.Logger := Loggers.Create ("Gen.Artifacts.Distribs.Concat");
-- ------------------------------
-- Create a distribution rule to copy a set of files or directories.
-- ------------------------------
function Create_Rule (Node : in DOM.Core.Node) return Distrib_Rule_Access is
pragma Unreferenced (Node);
Result : constant Concat_Rule_Access := new Concat_Rule;
begin
return Result.all'Access;
end Create_Rule;
-- ------------------------------
-- Get a name to qualify the installation rule (used for logs).
-- ------------------------------
overriding
function Get_Install_Name (Rule : in Concat_Rule) return String is
pragma Unreferenced (Rule);
begin
return "concat";
end Get_Install_Name;
-- ------------------------------
-- Install the file <b>File</b> according to the distribution rule.
-- Concatenate the files listed in <b>Files</b> in the target path specified by <b>Path</b>.
-- ------------------------------
overriding
procedure Install (Rule : in Concat_Rule;
Path : in String;
Files : in File_Vector;
Context : in out Generator'Class) is
procedure Concat_File (File : in File_Record);
Dir : constant String := Ada.Directories.Containing_Directory (Path);
Output : Util.Streams.Files.File_Stream;
-- ------------------------------
-- Append the file to the output
-- ------------------------------
procedure Concat_File (File : in File_Record) is
File_Path : constant String := Rule.Get_Source_Path (File);
Input : Util.Streams.Files.File_Stream;
begin
if Rule.Level >= Util.Log.INFO_LEVEL then
Log.Info (" concat {0} to {1}", File_Path, Path);
end if;
Input.Open (Name => File_Path, Mode => Ada.Streams.Stream_IO.In_File);
Util.Streams.Copy (From => Input, Into => Output);
Input.Close;
exception
when Ex : Ada.IO_Exceptions.Name_Error =>
Context.Error ("Cannot read {0}: ", File_Path,
Ada.Exceptions.Exception_Message (Ex));
end Concat_File;
Iter : File_Cursor := Files.First;
begin
Ada.Directories.Create_Path (Dir);
Output.Create (Name => Path, Mode => Ada.Streams.Stream_IO.Out_File);
while File_Record_Vectors.Has_Element (Iter) loop
File_Record_Vectors.Query_Element (Iter, Concat_File'Access);
File_Record_Vectors.Next (Iter);
end loop;
Output.Close;
end Install;
end Gen.Artifacts.Distribs.Concat;
|
reznikmm/matreshka | Ada | 4,274 | 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.Generic_Collections;
package AMF.OCL.Unlimited_Natural_Exps.Collections is
pragma Preelaborate;
package OCL_Unlimited_Natural_Exp_Collections is
new AMF.Generic_Collections
(OCL_Unlimited_Natural_Exp,
OCL_Unlimited_Natural_Exp_Access);
type Set_Of_OCL_Unlimited_Natural_Exp is
new OCL_Unlimited_Natural_Exp_Collections.Set with null record;
type Ordered_Set_Of_OCL_Unlimited_Natural_Exp is
new OCL_Unlimited_Natural_Exp_Collections.Ordered_Set with null record;
type Bag_Of_OCL_Unlimited_Natural_Exp is
new OCL_Unlimited_Natural_Exp_Collections.Bag with null record;
type Sequence_Of_OCL_Unlimited_Natural_Exp is
new OCL_Unlimited_Natural_Exp_Collections.Sequence with null record;
end AMF.OCL.Unlimited_Natural_Exps.Collections;
|
Rodeo-McCabe/orka | Ada | 4,034 | adb | -- 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 GL.Drawing;
package body Orka.Rendering.Drawing is
use GL.Types;
procedure Draw
(Mode : GL.Types.Connection_Mode;
Offset, Count : Natural;
Instances : Positive := 1) is
begin
GL.Drawing.Draw_Arrays
(Mode,
Offset => Size (Offset),
Count => Size (Count),
Instances => Size (Instances));
end Draw;
procedure Draw_Indexed
(Mode : GL.Types.Connection_Mode;
Index_Buffer : Buffers.Buffer;
Offset, Count : Natural;
Instances : Positive := 1)
is
use all type Rendering.Buffers.Buffer_Target;
begin
Index_Buffer.Bind (Index);
GL.Drawing.Draw_Elements
(Mode,
Count => Size (Count),
Index_Kind => Orka.Types.Convert (Index_Buffer.Kind),
Index_Offset => Offset,
Instances => Size (Instances));
end Draw_Indexed;
-----------------------------------------------------------------------------
procedure Draw_Indirect
(Mode : GL.Types.Connection_Mode;
Buffer : Buffers.Buffer;
Offset, Count : Natural)
is
use all type Rendering.Buffers.Buffer_Target;
begin
Buffer.Bind (Draw_Indirect);
GL.Drawing.Draw_Multiple_Arrays_Indirect
(Mode, Count => Size (Count), Offset => Size (Offset));
end Draw_Indirect;
procedure Draw_Indirect
(Mode : GL.Types.Connection_Mode;
Buffer : Buffers.Buffer) is
begin
Draw_Indirect (Mode, Buffer, Offset => 0, Count => Buffer.Length);
end Draw_Indirect;
procedure Draw_Indirect
(Mode : GL.Types.Connection_Mode;
Buffer, Count : Buffers.Buffer)
is
use all type Rendering.Buffers.Buffer_Target;
begin
Buffer.Bind (Draw_Indirect);
Count.Bind (Parameter);
GL.Drawing.Draw_Multiple_Arrays_Indirect_Count
(Mode, GL.Types.Size (Buffer.Length));
end Draw_Indirect;
-----------------------------------------------------------------------------
procedure Draw_Indexed_Indirect
(Mode : GL.Types.Connection_Mode;
Index_Buffer : Buffers.Buffer;
Buffer : Buffers.Buffer;
Offset, Count : Natural)
is
use all type Rendering.Buffers.Buffer_Target;
begin
Index_Buffer.Bind (Index);
Buffer.Bind (Draw_Indirect);
GL.Drawing.Draw_Multiple_Elements_Indirect
(Mode, Orka.Types.Convert (Index_Buffer.Kind),
Count => Size (Count), Offset => Size (Offset));
end Draw_Indexed_Indirect;
procedure Draw_Indexed_Indirect
(Mode : GL.Types.Connection_Mode;
Index_Buffer : Buffers.Buffer;
Buffer : Buffers.Buffer) is
begin
Draw_Indexed_Indirect (Mode, Index_Buffer, Buffer, Offset => 0, Count => Buffer.Length);
end Draw_Indexed_Indirect;
procedure Draw_Indexed_Indirect
(Mode : GL.Types.Connection_Mode;
Index_Buffer : Buffers.Buffer;
Buffer, Count : Buffers.Buffer)
is
use all type Rendering.Buffers.Buffer_Target;
begin
Index_Buffer.Bind (Index);
Buffer.Bind (Draw_Indirect);
Count.Bind (Parameter);
GL.Drawing.Draw_Multiple_Elements_Indirect_Count
(Mode, Orka.Types.Convert (Index_Buffer.Kind), GL.Types.Size (Buffer.Length));
end Draw_Indexed_Indirect;
end Orka.Rendering.Drawing;
|
reznikmm/matreshka | Ada | 3,915 | 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.
------------------------------------------------------------------------------
with League.Holders;
package AMF.Internals.Tables.CMOF_Reflection is
function Get
(Self : AMF.Internals.AMF_Element;
Property : CMOF_Element) return League.Holders.Holder;
function Get_Meta_Class
(Self : AMF.Internals.AMF_Element) return CMOF_Element;
procedure Set
(Self : AMF.Internals.AMF_Element;
Property : CMOF_Element;
Value : League.Holders.Holder);
end AMF.Internals.Tables.CMOF_Reflection;
|
AdaCore/training_material | Ada | 891 | adb | with Ada.Text_IO; use Ada.Text_IO;
procedure Main is
type Days_Of_Week_T is (Mon, Tue, Wed, Thu, Fri, Sat, Sun);
-- type Unconstrained_Array_T is ?
-- Constant_Array : ?
-- Array2 : ?
-- type Name_T is ? (array of characters)
-- Weekly_Staff : ? (2-dimensional array using day and counter as indices)
begin
Put_Line ("Array Types");
-- Copy Constant_Array to Array2
-- For every item of Array2
-- Print the item
-- Initialize Array2 via aggregate
-- For every item of Array2
-- Print the array index and the item
-- Copy part of Constant_Array to part of Array2
-- Set another part of Array2 to a known value
-- For every item of Array2
-- Print the item
-- Initialize Weekly_Staff using nested aggregates
-- For every day of the week
-- Print the day of the week
-- Print each staff member
end Main;
|
zhmu/ananas | Ada | 98 | ads | package Inline9_Pkg is
procedure Test (I : Integer);
pragma Inline (Test);
end Inline9_Pkg;
|
AdaCore/Ada_Drivers_Library | Ada | 9,714 | ads | -- This spec has been automatically generated from STM32F7x.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.LPTIM is
pragma Preelaborate;
---------------
-- Registers --
---------------
-- Interrupt and Status Register
type ISR_Register is record
-- Read-only. Compare match
CMPM : Boolean;
-- Read-only. Autoreload match
ARRM : Boolean;
-- Read-only. External trigger edge event
EXTTRIG : Boolean;
-- Read-only. Compare register update OK
CMPOK : Boolean;
-- Read-only. Autoreload register update OK
ARROK : Boolean;
-- Read-only. Counter direction change down to up
UP : Boolean;
-- Read-only. Counter direction change up to down
DOWN : Boolean;
-- unspecified
Reserved_7_31 : HAL.UInt25;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ISR_Register use record
CMPM at 0 range 0 .. 0;
ARRM at 0 range 1 .. 1;
EXTTRIG at 0 range 2 .. 2;
CMPOK at 0 range 3 .. 3;
ARROK at 0 range 4 .. 4;
UP at 0 range 5 .. 5;
DOWN at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
-- Interrupt Clear Register
type ICR_Register is record
-- Write-only. compare match Clear Flag
CMPMCF : Boolean := False;
-- Write-only. Autoreload match Clear Flag
ARRMCF : Boolean := False;
-- Write-only. External trigger valid edge Clear Flag
EXTTRIGCF : Boolean := False;
-- Write-only. Compare register update OK Clear Flag
CMPOKCF : Boolean := False;
-- Write-only. Autoreload register update OK Clear Flag
ARROKCF : Boolean := False;
-- Write-only. Direction change to UP Clear Flag
UPCF : Boolean := False;
-- Write-only. Direction change to down Clear Flag
DOWNCF : Boolean := False;
-- unspecified
Reserved_7_31 : HAL.UInt25 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ICR_Register use record
CMPMCF at 0 range 0 .. 0;
ARRMCF at 0 range 1 .. 1;
EXTTRIGCF at 0 range 2 .. 2;
CMPOKCF at 0 range 3 .. 3;
ARROKCF at 0 range 4 .. 4;
UPCF at 0 range 5 .. 5;
DOWNCF at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
-- Interrupt Enable Register
type IER_Register is record
-- Compare match Interrupt Enable
CMPMIE : Boolean := False;
-- Autoreload match Interrupt Enable
ARRMIE : Boolean := False;
-- External trigger valid edge Interrupt Enable
EXTTRIGIE : Boolean := False;
-- Compare register update OK Interrupt Enable
CMPOKIE : Boolean := False;
-- Autoreload register update OK Interrupt Enable
ARROKIE : Boolean := False;
-- Direction change to UP Interrupt Enable
UPIE : Boolean := False;
-- Direction change to down Interrupt Enable
DOWNIE : Boolean := False;
-- unspecified
Reserved_7_31 : HAL.UInt25 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IER_Register use record
CMPMIE at 0 range 0 .. 0;
ARRMIE at 0 range 1 .. 1;
EXTTRIGIE at 0 range 2 .. 2;
CMPOKIE at 0 range 3 .. 3;
ARROKIE at 0 range 4 .. 4;
UPIE at 0 range 5 .. 5;
DOWNIE at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
subtype CFGR_CKPOL_Field is HAL.UInt2;
subtype CFGR_CKFLT_Field is HAL.UInt2;
subtype CFGR_TRGFLT_Field is HAL.UInt2;
subtype CFGR_PRESC_Field is HAL.UInt3;
subtype CFGR_TRIGSEL_Field is HAL.UInt3;
subtype CFGR_TRIGEN_Field is HAL.UInt2;
-- Configuration Register
type CFGR_Register is record
-- Clock selector
CKSEL : Boolean := False;
-- Clock Polarity
CKPOL : CFGR_CKPOL_Field := 16#0#;
-- Configurable digital filter for external clock
CKFLT : CFGR_CKFLT_Field := 16#0#;
-- unspecified
Reserved_5_5 : HAL.Bit := 16#0#;
-- Configurable digital filter for trigger
TRGFLT : CFGR_TRGFLT_Field := 16#0#;
-- unspecified
Reserved_8_8 : HAL.Bit := 16#0#;
-- Clock prescaler
PRESC : CFGR_PRESC_Field := 16#0#;
-- unspecified
Reserved_12_12 : HAL.Bit := 16#0#;
-- Trigger selector
TRIGSEL : CFGR_TRIGSEL_Field := 16#0#;
-- unspecified
Reserved_16_16 : HAL.Bit := 16#0#;
-- Trigger enable and polarity
TRIGEN : CFGR_TRIGEN_Field := 16#0#;
-- Timeout enable
TIMOUT : Boolean := False;
-- Waveform shape
WAVE : Boolean := False;
-- Waveform shape polarity
WAVPOL : Boolean := False;
-- Registers update mode
PRELOAD : Boolean := False;
-- counter mode enabled
COUNTMODE : Boolean := False;
-- Encoder mode enable
ENC : 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 CFGR_Register use record
CKSEL at 0 range 0 .. 0;
CKPOL at 0 range 1 .. 2;
CKFLT at 0 range 3 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
TRGFLT at 0 range 6 .. 7;
Reserved_8_8 at 0 range 8 .. 8;
PRESC at 0 range 9 .. 11;
Reserved_12_12 at 0 range 12 .. 12;
TRIGSEL at 0 range 13 .. 15;
Reserved_16_16 at 0 range 16 .. 16;
TRIGEN at 0 range 17 .. 18;
TIMOUT at 0 range 19 .. 19;
WAVE at 0 range 20 .. 20;
WAVPOL at 0 range 21 .. 21;
PRELOAD at 0 range 22 .. 22;
COUNTMODE at 0 range 23 .. 23;
ENC at 0 range 24 .. 24;
Reserved_25_31 at 0 range 25 .. 31;
end record;
-- Control Register
type CR_Register is record
-- LPTIM Enable
ENABLE : Boolean := False;
-- LPTIM start in single mode
SNGSTRT : Boolean := False;
-- Timer start in continuous mode
CNTSTRT : Boolean := False;
-- unspecified
Reserved_3_31 : HAL.UInt29 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR_Register use record
ENABLE at 0 range 0 .. 0;
SNGSTRT at 0 range 1 .. 1;
CNTSTRT at 0 range 2 .. 2;
Reserved_3_31 at 0 range 3 .. 31;
end record;
subtype CMP_CMP_Field is HAL.UInt16;
-- Compare Register
type CMP_Register is record
-- Compare value
CMP : CMP_CMP_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CMP_Register use record
CMP at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype ARR_ARR_Field is HAL.UInt16;
-- Autoreload Register
type ARR_Register is record
-- Auto reload value
ARR : ARR_ARR_Field := 16#1#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ARR_Register use record
ARR at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CNT_CNT_Field is HAL.UInt16;
-- Counter Register
type CNT_Register is record
-- Read-only. Counter value
CNT : CNT_CNT_Field;
-- unspecified
Reserved_16_31 : HAL.UInt16;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CNT_Register use record
CNT at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Low power timer
type LPTIM1_Peripheral is record
-- Interrupt and Status Register
ISR : aliased ISR_Register;
-- Interrupt Clear Register
ICR : aliased ICR_Register;
-- Interrupt Enable Register
IER : aliased IER_Register;
-- Configuration Register
CFGR : aliased CFGR_Register;
-- Control Register
CR : aliased CR_Register;
-- Compare Register
CMP : aliased CMP_Register;
-- Autoreload Register
ARR : aliased ARR_Register;
-- Counter Register
CNT : aliased CNT_Register;
end record
with Volatile;
for LPTIM1_Peripheral use record
ISR at 16#0# range 0 .. 31;
ICR at 16#4# range 0 .. 31;
IER at 16#8# range 0 .. 31;
CFGR at 16#C# range 0 .. 31;
CR at 16#10# range 0 .. 31;
CMP at 16#14# range 0 .. 31;
ARR at 16#18# range 0 .. 31;
CNT at 16#1C# range 0 .. 31;
end record;
-- Low power timer
LPTIM1_Periph : aliased LPTIM1_Peripheral
with Import, Address => System'To_Address (16#40002400#);
end STM32_SVD.LPTIM;
|
reznikmm/matreshka | Ada | 12,931 | ads | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2010, 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.Internals.Regexps.Compiler is
pragma Preelaborate;
type YY_Errors is
(No_Error,
Unexpected_End_Of_Literal,
Unexpected_End_Of_Character_Class,
Unexpected_Character_in_Multiplicity_Specifier,
Unexpected_End_Of_Multiplicity_Specifier,
Unexpected_End_Of_Property_Specification,
Unrecognized_Character_In_Property_Specification,
Unescaped_Pattern_Syntax_Character,
Expression_Syntax_Error);
type YY_Error_Information is record
Error : YY_Errors;
Index : Natural;
end record;
type Property_Specification_Keyword is
(ASCII_Hex_Digit, -- Names of binary properties
Alphabetic,
Bidi_Control,
-- Bidi_Mirrored,
Cased,
Case_Ignorable,
Changes_When_Casefolded,
Changes_When_Casemapped,
Changes_When_NFKC_Casefolded,
Changes_When_Lowercased,
Changes_When_Titlecased,
Changes_When_Uppercased,
Composition_Exclusion,
Full_Composition_Exclusion,
Dash,
Deprecated,
Default_Ignorable_Code_Point,
Diacritic,
Extender,
Grapheme_Base,
Grapheme_Extend,
Grapheme_Link,
Hex_Digit,
Hyphen,
ID_Continue,
Ideographic,
ID_Start,
IDS_Binary_Operator,
IDS_Trinary_Operator,
Join_Control,
Logical_Order_Exception,
Lowercase,
Math,
Noncharacter_Code_Point,
Other_Alphabetic,
Other_Default_Ignorable_Code_Point,
Other_Grapheme_Extend,
Other_ID_Continue,
Other_ID_Start,
Other_Lowercase,
Other_Math,
Other_Uppercase,
Pattern_Syntax,
Pattern_White_Space,
Quotation_Mark,
Radical,
Soft_Dotted,
STerm,
Terminal_Punctuation,
Unified_Ideograph,
Uppercase,
Variation_Selector,
White_Space,
XID_Continue,
XID_Start,
Expands_On_NFC,
Expands_On_NFD,
Expands_On_NFKC,
Expands_On_NFKD,
Other, -- Values of the General Category
Control,
Format,
Unassigned,
Private_Use,
Surrogate,
Letter,
Cased_Letter,
Lowercase_Letter,
Modifier_Letter,
Other_Letter,
Titlecase_Letter,
Uppercase_Letter,
Mark,
Spacing_Mark,
Enclosing_Mark,
Nonspacing_Mark,
Number,
Decimal_Number,
Letter_Number,
Other_Number,
Punctuation,
Connector_Punctuation,
Dash_Punctuation,
Close_Punctuation,
Final_Punctuation,
Initial_Punctuation,
Other_Punctuation,
Open_Punctuation,
Symbol,
Currency_Symbol,
Modifier_Symbol,
Math_Symbol,
Other_Symbol,
Separator,
Line_Separator,
Paragraph_Separator,
Space_Separator);
type Kinds is
(None,
Match_Code_Point,
Number,
Property_Keyword,
AST_Node);
type YYSType (Kind : Kinds := None) is record
case Kind is
when None =>
null;
when Match_Code_Point =>
Code : Wide_Wide_Character;
when Number =>
Value : Natural;
when Property_Keyword =>
Keyword : Property_Specification_Keyword;
when AST_Node =>
Node : Positive;
end case;
end record;
type Token is
(End_Of_Input,
Error,
Token_Code_Point,
Token_Any_Code_Point,
Token_Alternation,
Token_Optional_Greedy,
Token_Optional_Lazy,
Token_Zero_Or_More_Greedy,
Token_Zero_Or_More_Lazy,
Token_One_Or_More_Greedy,
Token_One_Or_More_Lazy,
Token_Character_Class_Begin,
Token_Character_Class_End,
Token_Negate_Character_Class,
Token_Character_Class_Range,
Token_Multiplicity_Begin,
Token_Multiplicity_End_Greedy,
Token_Multiplicity_End_Lazy,
Token_Multiplicity_Comma,
Token_Multiplicity_Number,
Token_Subexpression_Capture_Begin,
Token_Subexpression_Begin,
Token_Subexpression_End,
Token_Property_Begin_Positive,
Token_Property_Begin_Negative,
Token_Property_End,
Token_Property_Keyword,
Token_Start_Of_Line,
Token_End_Of_Line);
-- Here is global state of the compiler. At the first stage of
-- refactoring all global state variables must be moved to here.
-- Later, they will be wrapped by record type to allow to have
-- several compiler in the different threads at the same time.
type Compiler_State is record
Data : Matreshka.Internals.Strings.Shared_String_Access;
YY_Start_State : Integer := 1;
YY_Current_Position : Matreshka.Internals.Utf16.Utf16_String_Index := 0;
YY_Current_Index : Positive := 1;
YY_Error : YY_Error_Information := (No_Error, 0);
YYLVal : YYSType;
YYVal : YYSType;
Character_Class_Mode : Boolean := False;
-- Recognition of the Unicode property specification is done in the
-- separate scanner's mode; this variable is used to switch back to
-- original mode.
end record;
procedure YYError
(Self : not null access Compiler_State;
Error : YY_Errors;
Index : Natural);
-- Report error.
procedure Attach
(Pattern : in out Shared_Pattern; Head : Positive; Node : Positive);
-- Attach Node to the list of nodes, started by Head.
function Compile
(Expression : not null Matreshka.Internals.Strings.Shared_String_Access)
return not null Shared_Pattern_Access;
function Create_Alternative
(Pattern : not null Shared_Pattern_Access;
Prefered : Positive;
Alternative : Positive) return Positive;
pragma Inline (Create_Alternative);
function Create_Anchor_End_Of_Line
(Pattern : not null Shared_Pattern_Access) return Positive;
pragma Inline (Create_Anchor_End_Of_Line);
function Create_Anchor_Start_Of_Line
(Pattern : not null Shared_Pattern_Access) return Positive;
pragma Inline (Create_Anchor_Start_Of_Line);
function Create_Character_Class
(Pattern : not null Shared_Pattern_Access) return Positive;
pragma Inline (Create_Character_Class);
function Create_Match_Any
(Pattern : not null Shared_Pattern_Access) return Positive;
pragma Inline (Create_Match_Any);
function Create_Match_Character
(Pattern : not null Shared_Pattern_Access;
Character : Matreshka.Internals.Unicode.Code_Point) return Positive;
pragma Inline (Create_Match_Character);
function Create_Match_Property
(Pattern : not null Shared_Pattern_Access;
Value : Matreshka.Internals.Unicode.Ucd.Boolean_Properties;
Negative : Boolean) return Positive;
pragma Inline (Create_Match_Property);
function Create_Match_Property
(Pattern : not null Shared_Pattern_Access;
Value : General_Category_Flags;
Negative : Boolean) return Positive;
pragma Inline (Create_Match_Property);
procedure Create_Member_Character
(Pattern : not null Shared_Pattern_Access;
Class : Positive;
Character : Matreshka.Internals.Unicode.Code_Point);
pragma Inline (Create_Member_Character);
procedure Create_Member_Property
(Pattern : not null Shared_Pattern_Access;
Class : Positive;
Value : Matreshka.Internals.Unicode.Ucd.Boolean_Properties;
Negative : Boolean);
pragma Inline (Create_Member_Property);
procedure Create_Member_Property
(Pattern : not null Shared_Pattern_Access;
Class : Positive;
Value : General_Category_Flags;
Negative : Boolean);
pragma Inline (Create_Member_Property);
procedure Create_Member_Range
(Pattern : not null Shared_Pattern_Access;
Class : Positive;
Low : Matreshka.Internals.Unicode.Code_Point;
High : Matreshka.Internals.Unicode.Code_Point);
pragma Inline (Create_Member_Range);
function Create_Repetition
(Pattern : not null Shared_Pattern_Access;
Expression : Positive;
Lower : Natural;
Upper : Natural;
Greedy : Boolean) return Positive;
pragma Inline (Create_Repetition);
function Create_Subexpression
(Pattern : not null Shared_Pattern_Access;
Expression : Positive;
Capture : Boolean) return Positive;
pragma Inline (Create_Subexpression);
function Get_Preferred
(Pattern : not null Shared_Pattern_Access;
Node : Positive) return Natural;
pragma Inline (Get_Preferred);
function Get_Fallback
(Pattern : not null Shared_Pattern_Access;
Node : Positive) return Natural;
pragma Inline (Get_Fallback);
function Get_Members
(Pattern : not null Shared_Pattern_Access;
Node : Positive) return Natural;
pragma Inline (Get_Members);
function Get_Expression
(Pattern : not null Shared_Pattern_Access;
Node : Positive) return Natural;
pragma Inline (Get_Expression);
function Get_Lower_Bound
(Pattern : not null Shared_Pattern_Access;
Node : Positive) return Natural;
pragma Inline (Get_Lower_Bound);
function Get_Upper_Bound
(Pattern : not null Shared_Pattern_Access;
Node : Positive) return Natural;
pragma Inline (Get_Upper_Bound);
function Get_Previous_Sibling
(Pattern : not null Shared_Pattern_Access;
Node : Positive) return Natural;
pragma Inline (Get_Previous_Sibling);
function Get_Next_Sibling
(Pattern : not null Shared_Pattern_Access;
Node : Positive) return Natural;
pragma Inline (Get_Next_Sibling);
end Matreshka.Internals.Regexps.Compiler;
|
reznikmm/matreshka | Ada | 4,035 | 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_Use_Wildcards_Attributes;
package Matreshka.ODF_Table.Use_Wildcards_Attributes is
type Table_Use_Wildcards_Attribute_Node is
new Matreshka.ODF_Table.Abstract_Table_Attribute_Node
and ODF.DOM.Table_Use_Wildcards_Attributes.ODF_Table_Use_Wildcards_Attribute
with null record;
overriding function Create
(Parameters : not null access Matreshka.DOM_Attributes.Attribute_L2_Parameters)
return Table_Use_Wildcards_Attribute_Node;
overriding function Get_Local_Name
(Self : not null access constant Table_Use_Wildcards_Attribute_Node)
return League.Strings.Universal_String;
end Matreshka.ODF_Table.Use_Wildcards_Attributes;
|
burratoo/Acton | Ada | 4,887 | adb | ------------------------------------------------------------------------------------------
-- --
-- OAKLAND COMPONENTS --
-- --
-- OAKLAND.TASKS --
-- --
-- Copyright (C) 2011-2021, Patrick Bernardi --
-- --
------------------------------------------------------------------------------------------
with Oak.Agent.Kernel; use Oak.Agent.Kernel;
with Oak.Agent.Oak_Agent; use Oak.Agent.Oak_Agent;
with Oak.Core; use Oak.Core;
with Oak.States; use Oak.States;
with Oak.Oak_Time; use Oak.Oak_Time;
with Oak.Core_Support_Package.Task_Support;
package body Oakland.Tasks is
--------------------
-- Activate_Tasks --
--------------------
-- Called by the Activator
procedure Activate_Tasks (Activation_Chain : in Task_List) is
Self : constant Oak_Agent_Id := Current_Agent (This_Oak_Kernel);
Activation_Pending_Message : Oak_Message :=
(Message_Type => Activation_Pending,
Activation_List => Activation_Chain);
Activation_Complete_Message : Oak_Message :=
(Message_Type => Activation_Complete);
begin
-- TODO: The check and transfer of tasks from chain to Activation list
-- should occur in Oak not here.
-- Need to check elaboration here.
Yield_Processor_To_Kernel
(With_Message => Activation_Pending_Message);
if State (Self) = Activation_Successful then
Yield_Processor_To_Kernel
(With_Message => Activation_Complete_Message);
else
raise Tasking_Error with "Failure during activation";
end if;
end Activate_Tasks;
procedure Begin_Cycles_Stage is
Message : Oak_Message := (Message_Type => Setup_Cycles);
begin
Yield_Processor_To_Kernel (With_Message => Message);
end Begin_Cycles_Stage;
-----------------------------
-- Complete_Activation --
-----------------------------
-- Called by the Activatee
procedure Complete_Activation is
Self : constant Oak_Agent_Id := Current_Agent (This_Oak_Kernel);
Activation_Successful_Message : Oak_Message :=
(Message_Type => Activation_Successful);
begin
-- Why do we send the message twice?? And we never send a failure
-- message.
Yield_Processor_To_Kernel
(With_Message => Activation_Successful_Message);
if State (Self) /= Runnable then
-- Need to include a cleanup routine here, though for a Ravenscar
-- Profile system that isn't required as no tasks will be running on
-- the system.
raise Tasking_Error with "Failure during activation";
end if;
end Complete_Activation;
-- Trival complete task.
procedure Complete_Task is
Message : Oak_Message :=
(Message_Type => Sleeping,
Wake_Up_At => Time_Last,
Remove_From_Charge_List => True);
begin
Yield_Processor_To_Kernel (With_Message => Message);
end Complete_Task;
procedure Change_Cycle_Period (New_Period : in Time_Span) is
Message : Oak_Message :=
(Message_Type => Update_Task_Property,
Update_Task => Current_Agent (This_Oak_Kernel),
Property_To_Update =>
(Property => Cycle_Period,
Cycle_Period => New_Period));
begin
Yield_Processor_To_Kernel (With_Message => Message);
end Change_Cycle_Period;
procedure Change_Relative_Deadline (New_Deadline : in Time_Span)
is
Message : Oak_Message :=
(Message_Type => Update_Task_Property,
Update_Task => Current_Agent (This_Oak_Kernel),
Property_To_Update =>
(Property => Relative_Deadline,
Deadline_Span => New_Deadline));
begin
Yield_Processor_To_Kernel (With_Message => Message);
end Change_Relative_Deadline;
procedure New_Cycle is
Message : Oak_Message := (Message_Type => New_Cycle);
begin
Yield_Processor_To_Kernel (With_Message => Message);
end New_Cycle;
procedure Yield_Processor_To_Kernel
(With_Message : in out Oak_Message)
is
begin
Oak.Core_Support_Package.Task_Support.Context_Switch_To_Oak
(Reason_For_Run => Agent_Request,
Message => With_Message);
end Yield_Processor_To_Kernel;
end Oakland.Tasks;
|
rveenker/sdlada | Ada | 1,945 | adb | --------------------------------------------------------------------------------------------------------------------
-- Copyright (c) 2013-2020, 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.
--------------------------------------------------------------------------------------------------------------------
-- SDL_Suites
--
-- Tests to check the Ada 2012 bindings for correctness.
--------------------------------------------------------------------------------------------------------------------
with AUnit; use AUnit;
with Pixel_Format_Test_Cases; use Pixel_Format_Test_Cases;
with Colour_Test_Cases; use Colour_Test_Cases;
package body SDL_Suites is
use Test_Suites;
Pixel_Tests : aliased Pixel_Format_Test_Cases.Pixel_Format_Test_Case;
Colour_Tests : aliased Colour_Test_Cases.Colour_Test_Case;
function Suite return Access_Test_Suite is
Result : Access_Test_Suite := AUnit.Test_Suites.New_Suite;
begin
Result.Add_Test (Pixel_Tests'Access);
Result.Add_Test (Colour_Tests'Access);
return Result;
end Suite;
end SDL_Suites;
|
docandrew/sdlada | Ada | 2,262 | ads | --------------------------------------------------------------------------------------------------------------------
-- Copyright (c) 2013-2020, 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.
--------------------------------------------------------------------------------------------------------------------
-- SDL.C_Pointers
--
-- This private package contains all the types representing the internal C pointers for various objects.
--------------------------------------------------------------------------------------------------------------------
private package SDL.C_Pointers is
type Windows is null record;
type Windows_Pointer is access all Windows with
Convention => C;
type Renderers is null record;
type Renderer_Pointer is access all Renderers with
Convention => C;
type Textures is null record;
type Texture_Pointer is access all Textures with
Convention => C;
type GL_Contexts is null record;
type GL_Context_Pointer is access all GL_Contexts with
Convention => C;
type Joysticks is null record;
type Joystick_Pointer is access all Joysticks with
Convention => C;
type Game_Controller is null record;
type Game_Controller_Pointer is access all Game_Controller with
Convention => C;
type Cursors is null record;
type Cursor_Pointer is access all Cursors with
Convention => C;
end SDL.C_Pointers;
|
stcarrez/stm32-ui | Ada | 397,448 | ads | with UI.Images;
package Gallery.Picture3 is
Descriptor : constant UI.Images.Image_Descriptor;
private
Palette : aliased constant UI.Images.Color_Array := (
(0, 0, 0), (1, 1, 1), (2, 2, 2),
(3, 3, 3), (4, 4, 4), (5, 5, 5), (6, 6, 6),
(7, 7, 7), (8, 8, 8), (9, 9, 9), (10, 10, 10),
(11, 11, 11), (12, 12, 12), (13, 13, 13), (14, 14, 14),
(15, 15, 15), (16, 16, 16), (17, 17, 17), (18, 18, 18),
(19, 19, 19), (20, 20, 20), (21, 21, 21), (22, 22, 22),
(23, 23, 23), (24, 24, 24), (25, 25, 25), (26, 26, 26),
(27, 27, 27), (28, 28, 28), (29, 29, 29), (30, 30, 30),
(31, 31, 31), (32, 32, 32), (33, 33, 33), (34, 34, 34),
(35, 35, 35), (36, 36, 36), (37, 37, 37), (38, 38, 38),
(39, 39, 39), (40, 40, 40), (41, 41, 41), (42, 42, 42),
(43, 43, 43), (44, 44, 44), (45, 45, 45), (46, 46, 46),
(47, 47, 47), (48, 48, 48), (49, 49, 49), (50, 50, 50),
(51, 51, 51), (52, 52, 52), (53, 53, 53), (54, 54, 54),
(55, 55, 55), (56, 56, 56), (57, 57, 57), (58, 58, 58),
(59, 59, 59), (60, 60, 60), (61, 61, 61), (62, 62, 62),
(63, 63, 63), (64, 64, 64), (65, 65, 65), (66, 66, 66),
(67, 67, 67), (68, 68, 68), (69, 69, 69), (70, 70, 70),
(71, 71, 71), (72, 72, 72), (73, 73, 73), (74, 74, 74),
(75, 75, 75), (76, 76, 76), (77, 77, 77), (78, 78, 78),
(79, 79, 79), (80, 80, 80), (81, 81, 81), (82, 82, 82),
(83, 83, 83), (84, 84, 84), (85, 85, 85), (86, 86, 86),
(87, 87, 87), (88, 88, 88), (89, 89, 89), (90, 90, 90),
(91, 91, 91), (92, 92, 92), (93, 93, 93), (94, 94, 94),
(95, 95, 95), (96, 96, 96), (97, 97, 97), (98, 98, 98),
(99, 99, 99), (100, 100, 100), (101, 101, 101), (102, 102, 102),
(103, 103, 103), (104, 104, 104), (105, 105, 105), (106, 106, 106),
(107, 107, 107), (108, 108, 108), (109, 109, 109), (110, 110, 110),
(111, 111, 111), (112, 112, 112), (113, 113, 113), (114, 114, 114),
(115, 115, 115), (116, 116, 116), (117, 117, 117), (118, 118, 118),
(119, 119, 119), (120, 120, 120), (121, 121, 121), (122, 122, 122),
(123, 123, 123), (124, 124, 124), (125, 125, 125), (126, 126, 126),
(127, 127, 127), (128, 128, 128), (129, 129, 129), (130, 130, 130),
(131, 131, 131), (132, 132, 132), (133, 133, 133), (134, 134, 134),
(135, 135, 135), (136, 136, 136), (137, 137, 137), (138, 138, 138),
(139, 139, 139), (140, 140, 140), (141, 141, 141), (142, 142, 142),
(143, 143, 143), (144, 144, 144), (145, 145, 145), (146, 146, 146),
(147, 147, 147), (148, 148, 148), (149, 149, 149), (150, 150, 150),
(151, 151, 151), (152, 152, 152), (153, 153, 153), (154, 154, 154),
(155, 155, 155), (156, 156, 156), (157, 157, 157), (158, 158, 158),
(159, 159, 159), (160, 160, 160), (161, 161, 161), (162, 162, 162),
(163, 163, 163), (164, 164, 164), (165, 165, 165), (166, 166, 166),
(167, 167, 167), (168, 168, 168), (169, 169, 169), (170, 170, 170),
(171, 171, 171), (172, 172, 172), (173, 173, 173), (174, 174, 174),
(175, 175, 175), (176, 176, 176), (177, 177, 177), (178, 178, 178),
(179, 179, 179), (180, 180, 180), (181, 181, 181), (182, 182, 182),
(183, 183, 183), (184, 184, 184), (185, 185, 185), (186, 186, 186),
(187, 187, 187), (188, 188, 188), (189, 189, 189), (190, 190, 190),
(191, 191, 191), (192, 192, 192), (193, 193, 193), (194, 194, 194),
(195, 195, 195), (196, 196, 196), (197, 197, 197), (198, 198, 198),
(199, 199, 199), (200, 200, 200), (201, 201, 201), (202, 202, 202),
(203, 203, 203), (204, 204, 204), (205, 205, 205), (206, 206, 206),
(207, 207, 207), (208, 208, 208), (209, 209, 209), (210, 210, 210),
(211, 211, 211), (212, 212, 212), (213, 213, 213), (214, 214, 214),
(215, 215, 215), (216, 216, 216), (217, 217, 217), (218, 218, 218),
(219, 219, 219), (220, 220, 220), (221, 221, 221), (222, 222, 222),
(223, 223, 223), (224, 224, 224), (225, 225, 225), (226, 226, 226),
(227, 227, 227), (228, 228, 228), (229, 229, 229), (230, 230, 230),
(231, 231, 231), (232, 232, 232), (233, 233, 233), (234, 234, 234),
(235, 235, 235), (236, 236, 236), (237, 237, 237), (238, 238, 238),
(239, 239, 239), (240, 240, 240), (241, 241, 241), (242, 242, 242),
(243, 243, 243), (244, 244, 244), (245, 245, 245), (246, 246, 246),
(247, 247, 247), (248, 248, 248), (249, 249, 249), (250, 250, 250),
(251, 251, 251), (252, 252, 252), (253, 253, 253), (254, 254, 254),
(255, 255, 255) );
-- 256 colors
Data : aliased constant UI.Images.Bitmap_Array := (
33, 249, 4, 0, 0, 0, 0, 0,
33, 254, 75, 70, 105, 108, 101, 32,
115, 111, 117, 114, 99, 101, 58, 32,
104, 116, 116, 112, 58, 47, 47, 99,
111, 109, 109, 111, 110, 115, 46, 119,
105, 107, 105, 109, 101, 100, 105, 97,
46, 111, 114, 103, 47, 119, 105, 107,
105, 47, 70, 105, 108, 101, 58, 82,
101, 112, 114, 111, 103, 114, 97, 109,
109, 105, 110, 103, 95, 69, 78, 73,
65, 67, 46, 112, 110, 103, 0, 33,
255, 11, 73, 109, 97, 103, 101, 77,
97, 103, 105, 99, 107, 14, 103, 97,
109, 109, 97, 61, 48, 46, 52, 53,
52, 53, 52, 53, 0, 44, 0, 0,
0, 0, 161, 1, 16, 1, 0, 8,
254, 0, 129, 208, 152, 49, 131, 134,
15, 32, 62, 104, 12, 156, 209, 130,
160, 66, 130, 16, 27, 46, 108, 209,
98, 69, 11, 31, 87, 186, 72, 145,
226, 100, 163, 148, 43, 78, 66, 98,
25, 121, 229, 35, 201, 43, 35, 177,
160, 12, 67, 166, 37, 203, 53, 44,
201, 172, 33, 19, 166, 75, 151, 147,
87, 80, 230, 252, 232, 145, 163, 19,
148, 88, 110, 166, 76, 153, 19, 101,
151, 146, 59, 55, 22, 221, 137, 212,
99, 211, 158, 28, 149, 40, 33, 66,
149, 8, 16, 132, 64, 148, 56, 209,
26, 85, 201, 198, 144, 84, 149, 92,
29, 139, 208, 199, 65, 179, 8, 105,
232, 208, 161, 118, 225, 196, 134, 20,
41, 50, 148, 75, 23, 162, 66, 181,
62, 216, 174, 157, 91, 17, 110, 139,
19, 43, 2, 11, 166, 56, 184, 226,
137, 17, 39, 58, 116, 24, 193, 120,
68, 134, 12, 29, 14, 51, 94, 172,
184, 67, 133, 199, 149, 31, 159, 128,
28, 248, 176, 226, 19, 18, 117, 172,
80, 140, 24, 240, 137, 195, 168, 227,
142, 80, 12, 249, 113, 134, 211, 143,
39, 147, 94, 140, 122, 178, 235, 213,
184, 75, 7, 110, 200, 80, 112, 99,
198, 167, 37, 143, 16, 60, 152, 56,
232, 130, 107, 217, 170, 213, 225, 131,
96, 223, 192, 191, 117, 119, 70, 93,
92, 240, 233, 21, 158, 87, 187, 110,
46, 151, 6, 213, 135, 200, 215, 254,
38, 156, 104, 247, 173, 142, 140, 29,
75, 134, 244, 216, 17, 203, 87, 165,
74, 145, 6, 173, 105, 19, 75, 152,
251, 93, 102, 118, 193, 63, 148, 232,
210, 143, 69, 205, 167, 18, 73, 91,
253, 4, 148, 123, 60, 37, 8, 85,
82, 72, 169, 247, 85, 71, 28, 69,
56, 149, 85, 90, 133, 180, 149, 84,
85, 17, 33, 21, 66, 204, 153, 229,
33, 16, 86, 157, 149, 156, 114, 17,
205, 229, 28, 68, 37, 194, 101, 151,
114, 6, 41, 167, 67, 111, 125, 205,
101, 17, 97, 187, 197, 197, 27, 138,
12, 33, 199, 151, 141, 20, 13, 84,
99, 92, 51, 34, 182, 22, 13, 125,
117, 55, 228, 116, 146, 33, 9, 152,
101, 15, 60, 144, 65, 5, 15, 84,
80, 129, 4, 2, 84, 249, 128, 4,
18, 76, 249, 128, 1, 15, 36, 32,
65, 151, 6, 8, 96, 64, 2, 15,
136, 57, 102, 2, 9, 140, 153, 229,
147, 79, 74, 128, 102, 147, 92, 54,
249, 229, 149, 87, 94, 86, 1, 107,
177, 157, 86, 23, 95, 5, 85, 84,
154, 112, 171, 5, 135, 29, 98, 192,
129, 6, 23, 118, 158, 125, 150, 216,
154, 9, 169, 200, 220, 66, 225, 13,
217, 40, 111, 122, 189, 72, 145, 14,
16, 2, 152, 158, 130, 14, 114, 196,
20, 131, 73, 205, 39, 19, 77, 52,
221, 84, 223, 77, 37, 73, 113, 210,
72, 100, 168, 148, 95, 24, 254, 57,
169, 180, 149, 81, 54, 161, 42, 159,
74, 73, 197, 183, 212, 122, 81, 117,
196, 171, 79, 82, 85, 216, 19, 88,
99, 101, 104, 150, 94, 62, 80, 5,
162, 88, 121, 13, 185, 35, 143, 40,
66, 26, 215, 137, 14, 221, 133, 99,
69, 157, 209, 104, 29, 96, 51, 66,
59, 99, 65, 62, 214, 152, 227, 91,
42, 242, 166, 208, 98, 45, 242, 169,
3, 135, 199, 238, 216, 45, 97, 112,
153, 102, 219, 157, 151, 145, 182, 154,
148, 118, 94, 214, 230, 147, 111, 54,
137, 38, 154, 89, 118, 32, 129, 1,
103, 166, 153, 38, 193, 99, 38, 76,
103, 147, 12, 75, 0, 217, 105, 148,
185, 118, 153, 99, 83, 126, 137, 165,
155, 117, 74, 236, 26, 100, 139, 53,
22, 177, 190, 29, 60, 89, 39, 91,
54, 130, 75, 228, 12, 67, 182, 197,
86, 142, 18, 61, 244, 151, 14, 38,
73, 65, 86, 134, 26, 86, 232, 107,
130, 169, 246, 106, 210, 126, 45, 149,
90, 43, 127, 8, 2, 56, 210, 126,
176, 126, 100, 171, 131, 65, 217, 68,
31, 73, 67, 247, 183, 84, 131, 77,
89, 200, 107, 206, 235, 221, 172, 83,
73, 86, 129, 88, 51, 17, 199, 174,
117, 213, 65, 89, 55, 107, 233, 158,
55, 86, 219, 214, 64, 119, 65, 138,
163, 142, 240, 202, 37, 35, 182, 51,
76, 138, 109, 96, 39, 26, 198, 35,
182, 120, 207, 64, 183, 254, 67, 4,
57, 214, 109, 142, 5, 37, 116, 208,
85, 106, 241, 101, 81, 111, 135, 27,
142, 232, 112, 167, 33, 134, 40, 109,
149, 65, 28, 25, 197, 119, 14, 71,
121, 6, 140, 97, 246, 152, 157, 155,
67, 25, 112, 102, 148, 229, 182, 90,
102, 143, 93, 156, 37, 148, 4, 139,
217, 165, 151, 111, 174, 137, 175, 148,
88, 74, 41, 39, 148, 105, 86, 73,
176, 165, 124, 154, 88, 158, 181, 128,
59, 135, 45, 70, 60, 5, 59, 213,
132, 97, 93, 40, 188, 212, 24, 102,
101, 117, 170, 234, 105, 229, 149, 20,
202, 22, 171, 213, 21, 176, 2, 181,
223, 81, 42, 113, 149, 105, 81, 17,
234, 186, 148, 172, 61, 81, 29, 18,
213, 240, 177, 183, 169, 175, 86, 213,
140, 97, 215, 30, 38, 171, 236, 177,
188, 151, 189, 162, 120, 201, 225, 165,
215, 184, 104, 183, 75, 173, 137, 126,
21, 100, 56, 96, 188, 49, 23, 224,
220, 70, 28, 139, 156, 198, 68, 208,
169, 192, 8, 224, 213, 59, 131, 192,
111, 108, 5, 124, 23, 162, 184, 197,
45, 220, 108, 139, 80, 191, 169, 140,
6, 35, 67, 144, 19, 76, 233, 97,
187, 145, 140, 101, 72, 7, 25, 66,
201, 139, 113, 19, 4, 78, 200, 158,
164, 24, 9, 68, 6, 74, 91, 138,
82, 236, 90, 195, 166, 141, 117, 46,
3, 167, 11, 89, 5, 12, 38, 128,
4, 12, 132, 46, 254, 211, 58, 17,
139, 20, 210, 2, 105, 29, 170, 5,
68, 8, 154, 133, 124, 242, 30, 0,
41, 37, 37, 74, 91, 85, 211, 176,
231, 31, 238, 117, 69, 120, 74, 200,
72, 73, 186, 32, 19, 152, 124, 133,
42, 104, 41, 11, 251, 196, 248, 161,
193, 13, 238, 42, 233, 211, 154, 134,
50, 132, 161, 154, 77, 45, 66, 33,
105, 163, 178, 70, 4, 54, 44, 206,
113, 101, 40, 42, 162, 91, 12, 242,
181, 15, 9, 100, 57, 10, 17, 15,
136, 242, 66, 68, 252, 201, 47, 90,
106, 59, 217, 238, 240, 55, 23, 34,
94, 103, 55, 29, 236, 192, 10, 250,
52, 3, 32, 232, 32, 136, 68, 122,
142, 97, 130, 115, 29, 194, 72, 134,
147, 34, 68, 140, 39, 129, 35, 155,
13, 210, 230, 4, 6, 161, 193, 102,
58, 54, 201, 133, 52, 110, 54, 164,
65, 77, 5, 255, 244, 72, 207, 72,
12, 75, 143, 217, 18, 153, 234, 36,
37, 88, 126, 108, 77, 53, 228, 216,
148, 210, 212, 165, 149, 149, 204, 119,
22, 9, 228, 67, 238, 2, 68, 63,
1, 1, 36, 62, 145, 154, 212, 116,
101, 146, 161, 93, 111, 40, 181, 186,
230, 125, 104, 130, 159, 250, 48, 79,
37, 70, 131, 34, 27, 216, 176, 134,
153, 148, 243, 62, 75, 123, 90, 53,
159, 86, 148, 173, 240, 228, 66, 75,
220, 136, 28, 179, 86, 149, 44, 222,
4, 62, 74, 254, 240, 16, 139, 32,
194, 156, 172, 100, 109, 44, 7, 73,
14, 65, 134, 88, 30, 100, 213, 113,
60, 105, 203, 203, 3, 247, 210, 157,
194, 89, 235, 135, 124, 59, 164, 115,
208, 86, 45, 147, 141, 13, 111, 106,
73, 12, 202, 44, 89, 73, 32, 228,
142, 147, 53, 154, 224, 97, 58, 51,
186, 210, 120, 236, 148, 131, 66, 76,
232, 74, 26, 178, 142, 129, 230, 69,
137, 105, 12, 221, 10, 231, 28, 232,
160, 208, 34, 43, 24, 78, 74, 107,
137, 29, 60, 77, 9, 118, 115, 210,
146, 157, 72, 83, 66, 214, 84, 172,
151, 43, 220, 92, 150, 98, 87, 55,
183, 29, 242, 161, 190, 43, 89, 7,
128, 0, 44, 169, 20, 232, 170, 191,
50, 9, 173, 234, 19, 148, 164, 213,
132, 62, 232, 244, 153, 55, 133, 102,
189, 164, 117, 129, 156, 229, 100, 67,
28, 226, 48, 78, 180, 114, 51, 172,
163, 234, 89, 92, 93, 66, 6, 54,
112, 179, 139, 163, 170, 201, 80, 114,
162, 52, 165, 209, 100, 64, 238, 17,
94, 205, 176, 162, 161, 173, 172, 81,
89, 85, 33, 139, 37, 83, 166, 204,
229, 128, 141, 107, 141, 93, 151, 62,
9, 121, 35, 115, 165, 173, 45, 69,
114, 234, 180, 224, 162, 54, 148, 241,
206, 119, 122, 83, 205, 2, 1, 169,
132, 75, 242, 143, 91, 208, 50, 76,
113, 98, 106, 154, 87, 98, 46, 56,
133, 2, 254, 206, 36, 245, 180, 25,
220, 0, 166, 55, 38, 196, 206, 36,
235, 71, 178, 138, 32, 14, 58, 34,
252, 228, 72, 33, 246, 164, 215, 181,
233, 117, 32, 179, 97, 113, 149, 138,
57, 204, 24, 117, 135, 94, 90, 166,
219, 170, 133, 199, 202, 238, 8, 70,
29, 192, 200, 241, 108, 230, 171, 120,
2, 101, 171, 84, 220, 42, 88, 137,
70, 31, 174, 246, 167, 171, 214, 100,
107, 91, 217, 218, 197, 114, 186, 4,
157, 49, 105, 201, 76, 228, 75, 147,
249, 186, 183, 174, 227, 44, 231, 76,
194, 48, 31, 184, 202, 181, 37, 71,
25, 171, 86, 157, 242, 221, 6, 57,
209, 154, 87, 60, 236, 240, 132, 133,
53, 53, 22, 86, 44, 254, 108, 86,
32, 71, 68, 191, 174, 157, 232, 108,
153, 220, 19, 181, 208, 102, 45, 21,
57, 7, 49, 38, 235, 211, 221, 32,
153, 71, 109, 237, 38, 167, 130, 26,
84, 39, 127, 164, 183, 21, 227, 180,
113, 56, 213, 173, 146, 60, 28, 191,
134, 44, 78, 132, 160, 43, 212, 102,
98, 51, 2, 5, 174, 96, 99, 82,
114, 46, 199, 148, 26, 228, 227, 186,
102, 49, 173, 89, 42, 65, 193, 101,
217, 181, 241, 9, 72, 57, 133, 89,
176, 174, 250, 160, 37, 66, 40, 85,
73, 59, 239, 208, 240, 211, 205, 165,
101, 25, 189, 80, 220, 242, 90, 199,
57, 102, 249, 174, 245, 190, 44, 9,
235, 254, 75, 240, 218, 179, 152, 188,
68, 191, 46, 81, 90, 24, 220, 107,
78, 253, 194, 100, 64, 66, 177, 34,
89, 157, 182, 17, 179, 214, 4, 154,
85, 181, 89, 248, 96, 53, 77, 169,
81, 37, 142, 138, 253, 26, 97, 209,
104, 21, 241, 152, 177, 67, 41, 163,
176, 216, 28, 221, 172, 99, 29, 43,
52, 36, 242, 223, 181, 162, 245, 156,
9, 218, 84, 182, 136, 10, 233, 218,
42, 123, 184, 77, 254, 197, 113, 127,
17, 215, 221, 130, 8, 36, 21, 186,
116, 116, 147, 155, 12, 227, 76, 154,
84, 205, 37, 183, 200, 149, 9, 178,
109, 230, 149, 165, 241, 12, 49, 145,
224, 178, 75, 238, 8, 147, 1, 41,
31, 26, 42, 153, 106, 226, 19, 193,
169, 147, 41, 162, 243, 122, 208, 54,
149, 53, 245, 58, 31, 165, 173, 193,
14, 118, 80, 171, 122, 243, 75, 206,
255, 250, 44, 190, 243, 125, 47, 124,
229, 11, 19, 106, 19, 109, 174, 244,
157, 201, 128, 98, 245, 93, 0, 5,
40, 86, 171, 18, 112, 149, 167, 124,
101, 85, 5, 165, 87, 221, 141, 35,
17, 44, 68, 188, 12, 41, 150, 158,
0, 237, 227, 89, 240, 210, 62, 51,
134, 17, 68, 140, 214, 16, 225, 248,
136, 21, 197, 162, 229, 159, 143, 174,
84, 218, 252, 167, 204, 27, 169, 172,
82, 7, 239, 48, 106, 219, 246, 45,
242, 168, 54, 113, 17, 25, 13, 155,
254, 58, 70, 114, 143, 13, 231, 47,
141, 75, 204, 198, 88, 211, 82, 60,
57, 215, 50, 151, 73, 249, 160, 216,
84, 1, 177, 73, 88, 211, 133, 44,
79, 84, 129, 84, 129, 243, 4, 75,
10, 251, 113, 79, 60, 153, 232, 17,
251, 28, 37, 86, 217, 84, 179, 156,
191, 202, 213, 165, 255, 204, 175, 118,
96, 235, 90, 213, 123, 230, 112, 183,
25, 190, 112, 206, 235, 210, 233, 43,
86, 242, 182, 215, 206, 118, 53, 149,
80, 72, 226, 238, 101, 215, 10, 204,
184, 74, 74, 129, 166, 28, 161, 140,
224, 74, 223, 244, 142, 35, 191, 245,
125, 216, 53, 34, 92, 107, 14, 7,
104, 135, 206, 114, 240, 98, 33, 188,
120, 83, 41, 75, 194, 199, 66, 60,
231, 217, 49, 108, 10, 77, 188, 226,
41, 189, 198, 227, 73, 40, 33, 160,
117, 72, 164, 37, 94, 72, 191, 72,
196, 44, 153, 204, 41, 74, 113, 204,
74, 138, 112, 146, 98, 183, 169, 181,
190, 126, 218, 185, 53, 197, 82, 59,
45, 165, 223, 62, 221, 162, 115, 181,
89, 254, 199, 62, 223, 247, 74, 52,
226, 149, 95, 89, 237, 203, 102, 229,
25, 169, 72, 245, 108, 158, 193, 119,
206, 111, 245, 43, 27, 176, 109, 7,
61, 68, 125, 173, 81, 71, 235, 124,
221, 60, 42, 59, 203, 119, 220, 205,
95, 126, 239, 223, 172, 95, 109, 179,
225, 171, 247, 73, 123, 73, 180, 254,
47, 20, 254, 138, 253, 232, 185, 146,
38, 149, 215, 211, 60, 199, 251, 170,
66, 86, 157, 16, 134, 22, 252, 119,
154, 209, 19, 241, 7, 247, 163, 223,
9, 15, 150, 196, 134, 5, 177, 91,
91, 191, 96, 223, 71, 199, 100, 145,
241, 177, 53, 67, 116, 195, 226, 44,
188, 179, 28, 20, 198, 28, 191, 182,
97, 152, 23, 23, 122, 98, 35, 192,
37, 24, 81, 5, 29, 180, 17, 91,
141, 81, 84, 37, 5, 107, 23, 168,
82, 129, 162, 122, 19, 23, 81, 200,
225, 50, 221, 225, 73, 25, 160, 93,
94, 1, 20, 209, 196, 93, 109, 247,
101, 166, 66, 31, 114, 85, 125, 203,
103, 19, 113, 182, 31, 247, 245, 86,
229, 164, 7, 124, 112, 131, 122, 144,
131, 198, 151, 109, 249, 5, 103, 118,
86, 103, 120, 229, 131, 105, 53, 131,
105, 22, 86, 230, 68, 102, 218, 6,
19, 46, 129, 43, 79, 212, 32, 80,
116, 118, 182, 226, 68, 236, 193, 17,
110, 116, 33, 15, 130, 126, 63, 1,
33, 88, 85, 127, 194, 195, 104, 120,
247, 79, 248, 55, 21, 125, 23, 61,
102, 244, 111, 249, 183, 53, 203, 66,
111, 243, 164, 62, 27, 194, 33, 201,
161, 80, 255, 231, 62, 251, 38, 104,
109, 151, 19, 78, 64, 72, 202, 100,
81, 203, 196, 97, 37, 242, 44, 32,
168, 90, 207, 1, 74, 123, 19, 64,
154, 215, 49, 191, 17, 28, 254, 26,
164, 27, 49, 85, 25, 209, 81, 82,
98, 243, 89, 253, 83, 68, 150, 244,
35, 114, 209, 25, 35, 136, 5, 108,
7, 18, 252, 134, 130, 170, 50, 118,
167, 242, 51, 111, 245, 117, 113, 246,
123, 187, 55, 138, 50, 97, 131, 55,
40, 8, 56, 184, 131, 219, 214, 86,
105, 213, 86, 202, 183, 6, 228, 52,
78, 120, 149, 95, 248, 85, 138, 50,
49, 139, 216, 134, 124, 113, 160, 132,
217, 199, 60, 220, 195, 52, 99, 7,
102, 80, 193, 68, 240, 100, 88, 92,
241, 21, 86, 181, 41, 77, 100, 104,
235, 119, 127, 105, 148, 104, 90, 163,
21, 233, 83, 141, 133, 213, 112, 103,
132, 70, 89, 65, 60, 96, 179, 44,
128, 7, 97, 97, 177, 127, 104, 212,
62, 100, 180, 46, 197, 210, 120, 211,
164, 43, 78, 224, 134, 4, 184, 79,
30, 8, 81, 207, 210, 76, 214, 49,
74, 164, 196, 98, 122, 163, 82, 175,
81, 27, 38, 149, 27, 181, 100, 114,
141, 72, 25, 122, 225, 122, 117, 67,
45, 133, 241, 91, 63, 230, 3, 93,
96, 60, 107, 135, 69, 84, 182, 87,
217, 52, 118, 114, 53, 103, 246, 85,
110, 211, 23, 95, 227, 198, 6, 55,
152, 145, 25, 105, 124, 72, 168, 86,
179, 56, 102, 73, 248, 131, 61, 248,
138, 36, 217, 130, 178, 168, 86, 196,
55, 117, 173, 194, 85, 236, 4, 111,
240, 150, 101, 242, 6, 254, 31, 114,
7, 22, 21, 178, 19, 210, 196, 41,
68, 183, 118, 247, 135, 104, 246, 167,
88, 233, 55, 33, 9, 151, 88, 97,
228, 111, 129, 7, 70, 62, 32, 71,
203, 168, 112, 245, 180, 96, 64, 153,
141, 125, 132, 119, 106, 180, 96, 225,
24, 31, 235, 104, 73, 128, 20, 108,
77, 85, 50, 242, 72, 28, 126, 17,
106, 40, 38, 75, 55, 117, 56, 216,
209, 16, 215, 209, 90, 42, 101, 136,
220, 98, 29, 159, 17, 29, 166, 145,
34, 199, 212, 23, 14, 196, 22, 165,
149, 56, 115, 147, 24, 62, 144, 95,
88, 64, 3, 239, 194, 79, 9, 213,
112, 105, 72, 111, 59, 161, 125, 5,
102, 69, 240, 230, 87, 50, 97, 7,
171, 136, 138, 124, 96, 124, 82, 7,
146, 200, 151, 146, 179, 216, 109, 117,
165, 95, 173, 232, 124, 242, 53, 78,
196, 151, 146, 236, 245, 137, 44, 25,
32, 128, 149, 77, 93, 101, 96, 240,
81, 18, 232, 119, 60, 225, 23, 62,
228, 163, 140, 78, 112, 104, 93, 232,
126, 209, 83, 79, 97, 113, 142, 61,
57, 120, 208, 88, 90, 58, 112, 127,
118, 132, 126, 117, 71, 60, 130, 167,
141, 180, 137, 70, 134, 69, 51, 201,
120, 135, 67, 226, 44, 1, 132, 55,
205, 196, 27, 50, 54, 35, 133, 145,
66, 164, 100, 82, 156, 228, 73, 112,
115, 73, 211, 225, 24, 104, 105, 66,
194, 37, 75, 54, 254, 5, 143, 155,
54, 45, 35, 34, 5, 62, 48, 73,
53, 181, 56, 64, 160, 7, 130, 32,
8, 100, 0, 24, 35, 112, 37, 166,
119, 100, 140, 24, 40, 56, 117, 114,
102, 227, 3, 127, 241, 129, 4, 1,
63, 229, 178, 81, 78, 16, 6, 152,
169, 138, 28, 9, 139, 63, 152, 110,
176, 216, 124, 146, 73, 110, 39, 169,
124, 177, 120, 132, 141, 57, 117, 97,
55, 109, 230, 69, 20, 214, 100, 77,
222, 84, 96, 74, 49, 147, 11, 246,
19, 229, 115, 101, 100, 151, 42, 22,
2, 18, 234, 227, 154, 137, 117, 119,
233, 23, 61, 105, 24, 142, 245, 20,
156, 140, 150, 79, 127, 25, 142, 51,
137, 155, 195, 243, 62, 101, 72, 51,
218, 248, 154, 10, 38, 44, 92, 131,
59, 17, 1, 101, 246, 40, 35, 157,
209, 45, 50, 102, 24, 162, 211, 24,
181, 65, 27, 47, 134, 98, 204, 65,
150, 143, 19, 107, 252, 104, 91, 160,
116, 136, 69, 162, 105, 17, 56, 45,
153, 231, 163, 136, 146, 1, 64, 192,
7, 138, 64, 8, 107, 176, 2, 68,
114, 28, 48, 211, 5, 68, 176, 22,
57, 145, 23, 64, 128, 5, 97, 122,
155, 50, 99, 22, 90, 241, 53, 249,
84, 68, 71, 249, 67, 1, 53, 3,
220, 50, 66, 69, 68, 4, 107, 160,
131, 139, 185, 6, 26, 225, 41, 76,
228, 118, 80, 248, 167, 77, 3, 147,
124, 21, 109, 254, 63, 131, 118, 231,
198, 86, 222, 71, 109, 218, 151, 118,
90, 21, 43, 238, 6, 53, 188, 50,
147, 115, 231, 20, 60, 209, 85, 100,
96, 19, 208, 100, 33, 97, 192, 7,
235, 24, 142, 109, 36, 149, 9, 55,
162, 250, 39, 88, 76, 217, 133, 202,
3, 142, 133, 231, 60, 200, 51, 79,
201, 147, 104, 114, 228, 155, 255, 52,
51, 254, 150, 23, 121, 52, 158, 205,
233, 84, 122, 51, 40, 213, 97, 64,
96, 41, 107, 38, 23, 28, 100, 41,
107, 116, 3, 4, 176, 213, 56, 24,
244, 39, 142, 147, 150, 254, 152, 171,
147, 68, 35, 252, 3, 47, 144, 4,
36, 105, 105, 165, 88, 170, 165, 43,
96, 41, 96, 19, 7, 132, 16, 6,
28, 113, 131, 82, 160, 4, 93, 160,
165, 33, 17, 6, 219, 138, 18, 55,
232, 30, 87, 32, 8, 118, 112, 5,
224, 186, 173, 171, 121, 167, 87, 160,
33, 215, 183, 22, 78, 192, 6, 32,
129, 145, 130, 144, 131, 108, 112, 19,
1, 232, 19, 70, 161, 102, 17, 217,
87, 160, 41, 69, 43, 88, 94, 224,
100, 154, 186, 215, 52, 223, 154, 126,
90, 136, 60, 85, 120, 140, 193, 98,
162, 108, 132, 33, 85, 51, 62, 184,
82, 43, 220, 147, 79, 249, 145, 120,
0, 85, 112, 124, 135, 88, 178, 10,
155, 207, 168, 126, 95, 56, 88, 211,
104, 60, 116, 24, 156, 203, 184, 33,
134, 7, 254, 155, 16, 119, 142, 110,
168, 70, 122, 55, 93, 33, 39, 65,
161, 165, 59, 169, 230, 128, 158, 103,
150, 148, 97, 47, 191, 113, 173, 45,
64, 40, 138, 225, 35, 114, 10, 91,
58, 182, 98, 60, 165, 143, 171, 161,
90, 200, 36, 46, 3, 228, 73, 160,
225, 27, 235, 233, 3, 122, 64, 8,
138, 192, 6, 43, 96, 149, 21, 114,
167, 216, 131, 109, 57, 65, 174, 107,
128, 18, 108, 64, 8, 151, 26, 6,
130, 176, 173, 88, 64, 6, 138, 160,
7, 42, 193, 6, 147, 16, 182, 82,
160, 7, 138, 64, 6, 57, 65, 8,
122, 176, 21, 225, 74, 6, 82, 160,
173, 132, 144, 167, 55, 97, 85, 170,
130, 116, 165, 104, 78, 87, 231, 117,
219, 132, 103, 112, 181, 95, 122, 197,
161, 85, 19, 20, 151, 90, 20, 194,
226, 61, 185, 66, 111, 248, 102, 120,
17, 251, 96, 134, 199, 30, 133, 85,
32, 142, 186, 19, 150, 132, 5, 78,
224, 104, 230, 200, 142, 46, 226, 177,
21, 54, 89, 98, 180, 46, 253, 132,
128, 201, 82, 33, 37, 26, 112, 127,
57, 60, 41, 170, 126, 72, 41, 148,
100, 164, 119, 253, 116, 22, 99, 65,
157, 154, 245, 164, 132, 145, 171, 79,
70, 137, 210, 106, 172, 37, 69, 188,
140, 193, 156, 40, 199, 165, 69, 155,
66, 32, 117, 98, 105, 73, 65, 159,
167, 83, 148, 120, 114, 63, 82, 121,
158, 254, 54, 40, 29, 96, 0, 58,
128, 165, 143, 16, 7, 43, 144, 16,
48, 163, 42, 118, 32, 8, 181, 178,
152, 48, 168, 8, 118, 112, 138, 147,
16, 7, 44, 161, 8, 115, 59, 103,
147, 192, 7, 54, 161, 7, 154, 192,
6, 65, 193, 7, 143, 176, 146, 118,
171, 18, 100, 64, 182, 123, 171, 8,
143, 192, 7, 118, 0, 19, 93, 224,
21, 17, 234, 184, 164, 66, 184, 92,
22, 95, 87, 87, 94, 105, 134, 110,
168, 130, 108, 63, 145, 31, 105, 55,
61, 123, 21, 161, 122, 70, 169, 83,
8, 44, 228, 71, 126, 224, 212, 167,
238, 244, 41, 241, 74, 4, 113, 80,
192, 141, 167, 155, 238, 215, 70, 91,
225, 96, 129, 135, 141, 205, 178, 187,
3, 113, 155, 207, 179, 185, 58, 224,
24, 140, 163, 39, 38, 210, 165, 101,
99, 93, 3, 217, 172, 156, 213, 89,
49, 124, 70, 220, 49, 55, 243, 120,
98, 162, 244, 45, 215, 91, 137, 155,
4, 40, 129, 34, 75, 32, 165, 156,
201, 20, 180, 198, 161, 99, 165, 102,
28, 204, 185, 45, 39, 96, 144, 158,
135, 156, 129, 17, 46, 16, 3, 99,
42, 151, 0, 62, 192, 7, 147, 48,
9, 88, 11, 190, 70, 35, 8, 148,
112, 125, 100, 64, 9, 138, 112, 31,
113, 160, 9, 124, 160, 86, 130, 48,
10, 233, 187, 6, 147, 160, 9, 189,
24, 7, 163, 240, 182, 107, 192, 7,
254, 164, 192, 7, 229, 244, 8, 245,
187, 31, 147, 64, 8, 55, 193, 6,
143, 16, 182, 118, 64, 8, 143, 160,
174, 118, 21, 6, 78, 48, 52, 220,
100, 19, 250, 5, 124, 149, 236, 87,
107, 86, 138, 70, 216, 94, 165, 2,
62, 16, 194, 21, 105, 203, 95, 57,
81, 130, 70, 247, 144, 89, 246, 52,
39, 193, 41, 234, 129, 85, 145, 235,
17, 83, 97, 62, 50, 105, 21, 97,
16, 7, 236, 250, 96, 210, 100, 120,
146, 202, 193, 113, 164, 127, 0, 183,
111, 103, 74, 3, 64, 128, 161, 207,
35, 5, 52, 224, 38, 81, 123, 196,
143, 36, 48, 140, 49, 49, 33, 227,
58, 25, 179, 84, 2, 243, 0, 48,
231, 48, 244, 226, 66, 175, 113, 155,
20, 98, 21, 63, 166, 107, 61, 86,
47, 165, 131, 47, 154, 99, 25, 152,
225, 49, 202, 85, 92, 159, 3, 57,
11, 68, 64, 193, 113, 143, 50, 197,
196, 142, 35, 181, 195, 193, 16, 60,
219, 1, 4, 209, 163, 59, 59, 24,
0, 164, 98, 42, 151, 172, 33, 243,
0, 62, 32, 8, 147, 64, 9, 118,
240, 189, 107, 97, 52, 132, 160, 199,
115, 70, 9, 143, 192, 18, 124, 44,
8, 107, 16, 7, 138, 176, 10, 115,
172, 7, 156, 96, 199, 195, 183, 10,
245, 203, 6, 138, 192, 10, 130, 160,
86, 148, 64, 10, 189, 200, 6, 154,
240, 8, 35, 65, 210, 182, 220, 254,
200, 138, 144, 175, 233, 203, 173, 73,
35, 110, 39, 25, 87, 240, 5, 131,
49, 97, 117, 86, 151, 110, 159, 204,
19, 40, 145, 130, 159, 204, 174, 63,
209, 95, 156, 121, 52, 129, 42, 194,
54, 41, 119, 148, 219, 60, 127, 89,
177, 208, 67, 21, 53, 129, 140, 170,
186, 137, 63, 89, 104, 185, 220, 111,
119, 23, 155, 10, 177, 111, 227, 115,
19, 62, 112, 25, 62, 0, 158, 149,
36, 5, 47, 210, 213, 68, 48, 16,
8, 97, 17, 235, 226, 91, 2, 33,
36, 69, 91, 16, 138, 81, 16, 168,
65, 36, 35, 84, 1, 39, 224, 127,
195, 12, 61, 63, 38, 27, 163, 129,
37, 45, 4, 76, 171, 68, 122, 71,
133, 67, 100, 50, 76, 87, 18, 38,
170, 131, 38, 150, 97, 0, 35, 0,
121, 10, 129, 29, 3, 35, 59, 114,
130, 37, 235, 249, 47, 100, 114, 49,
90, 18, 37, 82, 146, 0, 248, 130,
49, 33, 183, 206, 34, 133, 106, 32,
5, 106, 135, 145, 1, 15, 176, 189,
3, 109, 7, 23, 193, 28, 67, 83,
181, 164, 146, 165, 45, 17, 7, 148,
32, 200, 218, 202, 9, 122, 16, 7,
122, 64, 9, 154, 16, 117, 122, 48,
10, 107, 44, 209, 20, 29, 209, 147,
192, 9, 228, 20, 199, 143, 144, 200,
122, 124, 5, 42, 173, 138, 189, 168,
183, 253, 149, 102, 175, 184, 77, 111,
229, 220, 155, 60, 153, 61, 254, 184,
102, 225, 166, 168, 4, 187, 95, 71,
209, 30, 133, 234, 116, 41, 241, 108,
232, 245, 31, 83, 40, 77, 234, 129,
53, 246, 23, 79, 196, 66, 4, 77,
189, 178, 21, 171, 134, 41, 59, 213,
69, 25, 162, 107, 74, 214, 94, 225,
21, 92, 180, 213, 21, 64, 85, 150,
148, 69, 150, 148, 68, 165, 69, 3,
83, 113, 213, 78, 48, 16, 62, 112,
135, 69, 212, 166, 89, 75, 159, 223,
171, 4, 12, 161, 3, 249, 116, 2,
152, 109, 0, 29, 112, 155, 32, 18,
71, 127, 129, 16, 12, 81, 214, 223,
235, 3, 137, 33, 204, 133, 115, 73,
167, 241, 34, 140, 193, 22, 155, 65,
150, 175, 49, 16, 144, 81, 17, 21,
96, 0, 80, 34, 0, 35, 208, 22,
152, 183, 25, 161, 253, 26, 61, 246,
26, 68, 224, 65, 165, 99, 205, 80,
130, 47, 78, 146, 1, 7, 227, 38,
92, 114, 40, 116, 115, 106, 206, 21,
207, 41, 134, 207, 137, 49, 218, 248,
171, 9, 122, 80, 73, 201, 114, 19,
100, 32, 208, 243, 149, 165, 112, 76,
9, 31, 221, 200, 148, 96, 124, 122,
48, 208, 107, 101, 209, 235, 43, 209,
164, 240, 209, 18, 173, 199, 190, 157,
191, 249, 241, 8, 108, 240, 191, 143,
176, 210, 217, 22, 182, 231, 6, 124,
178, 24, 7, 101, 123, 78, 97, 69,
139, 248, 149, 86, 82, 103, 211, 182,
184, 132, 14, 25, 20, 254, 203, 135,
174, 126, 38, 176, 66, 241, 125, 229,
133, 42, 35, 33, 203, 15, 242, 17,
235, 65, 187, 84, 209, 61, 136, 54,
225, 122, 187, 140, 86, 198, 93, 233,
216, 140, 12, 121, 185, 85, 177, 142,
94, 227, 79, 64, 23, 6, 53, 158,
93, 235, 120, 148, 241, 154, 44, 241,
186, 22, 82, 225, 53, 99, 173, 22,
74, 128, 54, 28, 117, 218, 21, 193,
28, 11, 222, 28, 29, 16, 37, 9,
144, 1, 194, 124, 16, 94, 65, 4,
57, 5, 30, 174, 222, 2, 34, 158,
197, 9, 97, 214, 122, 121, 173, 114,
42, 236, 142, 225, 121, 246, 108, 73,
146, 212, 28, 21, 32, 0, 110, 34,
0, 246, 204, 16, 203, 49, 28, 151,
20, 25, 3, 113, 26, 194, 28, 180,
198, 30, 172, 81, 219, 1, 20, 209,
99, 58, 245, 26, 68, 220, 25, 35,
116, 24, 49, 151, 29, 47, 150, 114,
138, 33, 198, 9, 205, 9, 130, 192,
228, 68, 192, 51, 132, 192, 9, 119,
92, 198, 135, 57, 10, 87, 43, 209,
163, 160, 174, 118, 160, 9, 163, 192,
86, 122, 160, 209, 107, 69, 8, 172,
64, 8, 107, 53, 9, 164, 160, 7,
106, 165, 9, 148, 112, 169, 120, 108,
203, 122, 240, 8, 135, 156, 175, 189,
152, 17, 219, 36, 145, 117, 149, 190,
185, 104, 87, 116, 21, 125, 118, 21,
160, 116, 246, 230, 118, 54, 232, 98,
103, 241, 173, 210, 254, 30, 94, 229,
123, 65, 247, 144, 215, 195, 18, 129,
126, 116, 2, 104, 140, 242, 52, 178,
57, 201, 44, 32, 162, 183, 158, 42,
126, 80, 221, 161, 72, 129, 60, 80,
173, 194, 144, 37, 204, 219, 40, 5,
44, 225, 4, 216, 161, 4, 102, 74,
85, 96, 154, 44, 220, 122, 21, 37,
129, 16, 63, 65, 166, 224, 201, 28,
235, 168, 22, 132, 83, 73, 169, 30,
55, 2, 193, 227, 90, 47, 89, 195,
188, 21, 57, 149, 195, 224, 209, 98,
54, 214, 128, 50, 118, 114, 20, 179,
66, 46, 244, 197, 71, 46, 0, 41,
206, 236, 102, 163, 74, 25, 48, 26,
74, 170, 40, 180, 54, 57, 167, 212,
179, 245, 146, 26, 6, 36, 164, 73,
2, 115, 145, 35, 189, 0, 100, 172,
247, 253, 8, 156, 192, 9, 124, 48,
3, 89, 195, 51, 106, 60, 192, 107,
240, 8, 249, 123, 167, 156, 112, 181,
141, 28, 200, 107, 197, 239, 81, 199,
7, 172, 192, 9, 107, 37, 8, 172,
160, 8, 5, 207, 10, 115, 108, 7,
163, 160, 9, 112, 44, 239, 88, 32,
183, 143, 64, 8, 249, 106, 87, 66,
15, 110, 193, 189, 230, 174, 184, 95,
108, 86, 125, 145, 57, 146, 7, 218,
139, 114, 174, 87, 181, 50, 153, 250,
97, 52, 109, 30, 131, 210, 230, 125,
92, 36, 19, 186, 159, 103, 197, 8,
71, 202, 24, 177, 197, 204, 30, 132,
7, 186, 234, 254, 115, 85, 145, 43,
126, 82, 200, 243, 226, 215, 70, 101,
209, 79, 139, 222, 18, 78, 192, 16,
87, 64, 6, 91, 129, 5, 107, 144,
79, 82, 176, 175, 251, 118, 169, 76,
237, 253, 251, 150, 244, 239, 46, 51,
231, 1, 214, 52, 224, 4, 93, 32,
16, 101, 90, 227, 14, 147, 0, 35,
32, 195, 232, 71, 16, 103, 138, 41,
127, 100, 21, 173, 142, 224, 0, 49,
195, 135, 15, 26, 45, 10, 158, 104,
161, 163, 197, 8, 132, 43, 78, 48,
156, 225, 112, 197, 138, 17, 15, 4,
72, 48, 32, 160, 130, 65, 29, 52,
58, 82, 28, 209, 97, 196, 72, 145,
15, 71, 158, 48, 57, 82, 101, 6,
134, 35, 50, 176, 236, 80, 161, 66,
134, 14, 29, 90, 220, 116, 136, 210,
228, 137, 152, 18, 42, 212, 60, 121,
98, 34, 202, 147, 46, 31, 0, 121,
164, 73, 19, 31, 26, 74, 128, 16,
9, 19, 134, 140, 160, 73, 108, 214,
196, 121, 244, 104, 205, 26, 61, 154,
20, 197, 177, 67, 104, 20, 33, 61,
118, 52, 141, 138, 19, 135, 15, 41,
74, 105, 9, 173, 34, 148, 118, 18,
41, 61, 108, 236, 112, 210, 68, 38,
12, 27, 77, 122, 176, 232, 81, 20,
88, 17, 31, 59, 107, 164, 116, 33,
67, 102, 171, 85, 187, 118, 226, 176,
129, 252, 152, 77, 98, 54, 130, 234,
66, 142, 156, 22, 44, 102, 201, 108,
30, 219, 254, 97, 172, 151, 76, 23,
210, 81, 201, 196, 217, 170, 23, 11,
98, 169, 82, 21, 235, 13, 67, 90,
246, 236, 214, 164, 177, 172, 238, 130,
229, 138, 20, 41, 78, 124, 243, 190,
178, 155, 183, 111, 37, 74, 136, 16,
81, 2, 60, 120, 111, 34, 79, 137,
92, 41, 174, 196, 9, 111, 222, 210,
123, 15, 191, 222, 123, 250, 116, 237,
190, 189, 255, 38, 30, 253, 169, 143,
241, 199, 175, 172, 33, 227, 100, 70,
139, 195, 78, 148, 92, 233, 98, 220,
9, 25, 44, 210, 99, 27, 95, 125,
92, 9, 150, 230, 207, 157, 0, 241,
161, 55, 32, 116, 120, 207, 7, 29,
128, 184, 2, 136, 19, 18, 168, 192,
128, 14, 124, 48, 142, 8, 39, 160,
155, 129, 6, 41, 0, 244, 1, 186,
129, 164, 80, 162, 32, 32, 148, 88,
15, 8, 41, 136, 208, 97, 6, 34,
124, 152, 193, 196, 18, 91, 104, 46,
196, 255, 12, 242, 97, 5, 139, 30,
200, 168, 131, 20, 61, 250, 168, 66,
135, 102, 40, 113, 133, 22, 6, 186,
73, 33, 161, 14, 66, 168, 160, 137,
28, 98, 200, 161, 14, 16, 194, 201,
71, 158, 94, 146, 192, 167, 12, 100,
18, 169, 166, 37, 135, 82, 233, 132,
12, 18, 240, 65, 145, 81, 56, 97,
170, 191, 196, 214, 32, 68, 19, 198,
40, 161, 100, 43, 61, 56, 137, 203,
14, 69, 72, 33, 196, 142, 174, 70,
41, 254, 107, 173, 73, 192, 34, 132,
149, 175, 226, 152, 100, 21, 62, 60,
27, 133, 18, 189, 214, 208, 196, 14,
44, 220, 124, 68, 17, 66, 4, 1,
77, 10, 215, 200, 192, 204, 51, 199,
64, 211, 140, 49, 62, 24, 237, 76,
210, 180, 64, 139, 180, 82, 200, 182,
138, 173, 180, 46, 76, 123, 44, 177,
48, 224, 27, 213, 180, 212, 162, 202,
237, 54, 87, 75, 131, 237, 54, 81,
175, 224, 142, 187, 219, 130, 19, 238,
59, 243, 174, 88, 77, 183, 238, 156,
192, 66, 59, 234, 104, 45, 238, 59,
247, 146, 235, 110, 55, 239, 134, 51,
246, 216, 226, 144, 115, 98, 160, 230,
140, 187, 34, 49, 41, 90, 152, 193,
137, 46, 220, 131, 207, 9, 34, 28,
165, 85, 91, 44, 124, 131, 207, 169,
247, 78, 244, 193, 189, 19, 139, 27,
240, 67, 3, 159, 210, 161, 3, 1,
18, 208, 136, 60, 104, 57, 196, 86,
7, 125, 201, 27, 16, 199, 245, 60,
74, 241, 192, 18, 121, 44, 136, 96,
26, 8, 110, 97, 5, 143, 10, 158,
161, 34, 1, 44, 18, 32, 3, 108,
105, 56, 216, 200, 22, 80, 34, 120,
5, 129, 80, 76, 40, 97, 133, 35,
58, 1, 96, 141, 103, 224, 9, 39,
161, 24, 122, 72, 40, 158, 58, 152,
242, 165, 10, 124, 26, 41, 131, 7,
36, 232, 0, 75, 162, 182, 244, 65,
172, 81, 248, 208, 225, 56, 34, 198,
254, 124, 132, 148, 56, 32, 229, 132,
19, 244, 236, 88, 69, 145, 202, 20,
145, 37, 78, 59, 70, 97, 133, 15,
61, 248, 96, 101, 20, 199, 20, 161,
69, 145, 171, 52, 105, 58, 173, 81,
52, 137, 42, 14, 58, 15, 85, 36,
81, 65, 4, 121, 12, 190, 196, 32,
117, 76, 210, 182, 211, 226, 12, 172,
205, 60, 219, 212, 142, 183, 225, 238,
44, 53, 189, 100, 147, 21, 49, 208,
214, 8, 35, 88, 44, 162, 50, 205,
212, 218, 2, 119, 21, 183, 84, 115,
19, 213, 87, 92, 93, 197, 53, 55,
98, 181, 235, 59, 88, 41, 130, 227,
54, 60, 233, 52, 223, 124, 243, 240,
164, 176, 188, 214, 102, 221, 115, 86,
66, 0, 143, 115, 15, 139, 173, 164,
40, 168, 90, 14, 85, 47, 78, 138,
56, 194, 152, 14, 61, 222, 194, 48,
76, 66, 218, 129, 0, 98, 92, 222,
119, 51, 240, 220, 3, 47, 92, 80,
2, 141, 14, 68, 125, 196, 245, 12,
212, 215, 41, 138, 13, 12, 24, 122,
26, 6, 42, 232, 96, 31, 111, 196,
118, 189, 155, 176, 189, 24, 37, 9,
18, 200, 32, 35, 137, 43, 172, 184,
5, 150, 175, 196, 105, 251, 132, 19,
22, 10, 164, 148, 179, 140, 249, 39,
145, 130, 202, 73, 164, 150, 59, 128,
153, 34, 43, 71, 56, 242, 164, 154,
30, 208, 1, 33, 56, 65, 10, 65,
64, 8, 57, 107, 43, 147, 85, 254,
226, 128, 166, 207, 140, 226, 17, 118,
16, 132, 34, 224, 34, 39, 168, 241,
193, 130, 85, 179, 27, 214, 8, 113,
21, 74, 200, 66, 16, 118, 249, 90,
84, 144, 198, 135, 43, 132, 133, 16,
138, 226, 3, 106, 224, 179, 149, 53,
176, 161, 44, 118, 41, 11, 88, 228,
4, 55, 198, 56, 166, 133, 154, 121,
12, 14, 29, 3, 183, 22, 130, 138,
112, 177, 121, 21, 25, 108, 24, 27,
208, 41, 70, 85, 232, 249, 33, 171,
42, 151, 42, 220, 40, 145, 87, 187,
225, 213, 173, 112, 85, 29, 207, 225,
10, 62, 196, 66, 206, 126, 56, 84,
172, 44, 26, 103, 115, 191, 34, 221,
229, 126, 179, 156, 238, 120, 46, 58,
242, 209, 143, 132, 222, 179, 186, 131,
57, 138, 55, 136, 25, 209, 21, 216,
176, 45, 41, 0, 174, 55, 138, 233,
141, 235, 36, 180, 173, 15, 233, 6,
64, 135, 49, 215, 184, 78, 96, 128,
10, 212, 107, 90, 151, 83, 2, 182,
78, 52, 60, 34, 120, 196, 56, 20,
3, 66, 180, 166, 247, 72, 26, 0,
161, 96, 212, 251, 145, 66, 20, 6,
160, 124, 205, 160, 3, 15, 216, 146,
0, 70, 176, 30, 242, 209, 64, 34,
66, 49, 72, 65, 12, 18, 17, 31,
117, 207, 36, 53, 65, 9, 80, 230,
183, 36, 88, 134, 132, 127, 230, 155,
73, 149, 246, 247, 144, 146, 180, 47,
37, 49, 225, 146, 32, 52, 254, 193,
137, 2, 122, 75, 9, 184, 91, 3,
31, 40, 129, 153, 71, 220, 73, 45,
94, 177, 155, 88, 200, 194, 7, 78,
248, 233, 82, 164, 224, 132, 30, 0,
163, 39, 199, 244, 233, 79, 102, 73,
211, 105, 250, 114, 168, 19, 38, 42,
133, 107, 184, 194, 163, 42, 117, 41,
199, 76, 45, 134, 158, 201, 76, 167,
232, 86, 55, 185, 61, 166, 135, 137,
33, 205, 222, 112, 115, 149, 161, 141,
230, 48, 173, 81, 12, 18, 97, 99,
26, 86, 197, 230, 135, 165, 145, 138,
109, 186, 176, 27, 221, 232, 134, 87,
215, 33, 157, 23, 185, 115, 185, 221,
120, 241, 57, 227, 210, 156, 186, 166,
35, 156, 236, 92, 135, 163, 151, 163,
142, 177, 206, 152, 69, 222, 21, 75,
91, 182, 235, 72, 123, 128, 69, 134,
235, 172, 97, 92, 82, 240, 231, 63,
221, 115, 152, 17, 129, 206, 41, 18,
138, 86, 186, 174, 112, 34, 9, 249,
96, 65, 13, 202, 128, 15, 244, 83,
157, 155, 48, 79, 168, 29, 233, 89,
191, 200, 131, 84, 222, 29, 172, 35,
41, 50, 80, 245, 140, 84, 73, 31,
116, 50, 124, 248, 147, 128, 194, 6,
70, 177, 137, 116, 111, 5, 29, 41,
170, 38, 15, 82, 51, 94, 250, 136,
34, 88, 210, 152, 87, 121, 201, 50,
154, 240, 111, 40, 71, 66, 146, 73,
134, 242, 74, 153, 229, 236, 44, 130,
208, 193, 177, 198, 228, 254, 37, 201,
104, 162, 45, 106, 33, 133, 210, 244,
240, 22, 69, 76, 173, 154, 82, 19,
196, 42, 72, 97, 65, 69, 232, 9,
44, 148, 96, 5, 163, 238, 162, 9,
244, 176, 129, 18, 122, 232, 2, 96,
178, 162, 8, 180, 177, 33, 157, 1,
5, 75, 157, 44, 163, 77, 65, 16,
102, 82, 155, 210, 131, 220, 232, 38,
167, 73, 189, 211, 158, 147, 97, 213,
108, 112, 115, 26, 212, 248, 115, 84,
99, 122, 141, 169, 82, 149, 91, 244,
12, 244, 182, 179, 105, 213, 109, 64,
231, 208, 144, 122, 7, 57, 212, 1,
14, 135, 144, 243, 161, 192, 29, 75,
87, 210, 177, 156, 114, 104, 69, 70,
144, 50, 107, 59, 191, 242, 98, 231,
122, 163, 58, 116, 234, 75, 117, 189,
233, 130, 97, 128, 53, 187, 9, 177,
225, 84, 142, 34, 3, 116, 210, 57,
162, 253, 68, 75, 68, 255, 129, 80,
130, 14, 164, 4, 29, 140, 64, 2,
21, 233, 64, 36, 239, 229, 132, 138,
237, 11, 64, 30, 97, 222, 190, 244,
53, 224, 131, 165, 40, 149, 5, 150,
200, 245, 12, 156, 176, 10, 128, 47,
1, 6, 8, 153, 190, 40, 102, 74,
182, 38, 9, 174, 20, 211, 37, 203,
84, 82, 146, 144, 204, 239, 33, 32,
161, 136, 204, 30, 240, 0, 254, 161,
178, 171, 219, 203, 73, 251, 114, 66,
146, 6, 3, 65, 17, 195, 196, 171,
23, 247, 42, 180, 254, 171, 20, 45,
45, 84, 123, 132, 103, 8, 65, 139,
56, 241, 1, 106, 83, 195, 90, 100,
249, 240, 136, 92, 8, 86, 19, 89,
147, 211, 42, 70, 161, 24, 61, 44,
22, 11, 124, 40, 91, 162, 226, 20,
135, 207, 66, 106, 106, 165, 101, 231,
165, 78, 40, 181, 212, 66, 70, 155,
245, 172, 155, 221, 84, 139, 25, 36,
134, 74, 161, 179, 29, 98, 24, 64,
231, 26, 169, 244, 22, 137, 183, 101,
33, 122, 122, 27, 80, 223, 158, 185,
87, 171, 33, 150, 116, 134, 138, 29,
234, 88, 116, 66, 100, 192, 236, 178,
156, 75, 46, 221, 144, 6, 138, 213,
21, 150, 119, 148, 245, 155, 236, 154,
148, 161, 144, 193, 194, 64, 246, 66,
171, 53, 216, 97, 55, 93, 224, 131,
97, 174, 160, 7, 195, 72, 193, 133,
106, 198, 2, 27, 56, 84, 199, 157,
66, 5, 11, 3, 74, 39, 128, 148,
16, 159, 19, 208, 172, 2, 35, 112,
78, 114, 118, 163, 47, 116, 125, 139,
68, 6, 164, 181, 18, 12, 68, 30,
130, 16, 172, 66, 81, 165, 24, 78,
166, 215, 145, 131, 153, 143, 102, 223,
11, 89, 41, 41, 12, 20, 95, 62,
100, 122, 182, 204, 112, 133, 159, 180,
146, 157, 184, 100, 74, 63, 65, 73,
43, 213, 151, 190, 156, 176, 175, 74,
45, 46, 19, 49, 33, 244, 148, 54,
11, 144, 82, 147, 104, 139, 29, 214,
146, 99, 55, 254, 201, 162, 176, 130,
128, 90, 105, 9, 33, 11, 63, 81,
37, 23, 15, 92, 83, 145, 167, 70,
138, 81, 64, 134, 106, 132, 192, 244,
36, 4, 158, 149, 63, 125, 246, 42,
83, 227, 114, 89, 212, 77, 8, 66,
72, 77, 204, 96, 158, 231, 166, 36,
227, 169, 50, 31, 116, 161, 171, 1,
116, 109, 187, 176, 102, 220, 65, 202,
42, 44, 220, 155, 107, 220, 28, 208,
123, 198, 22, 55, 193, 201, 77, 84,
152, 101, 46, 9, 13, 235, 58, 200,
153, 150, 18, 214, 16, 12, 59, 136,
52, 118, 211, 185, 13, 171, 172, 200,
209, 237, 136, 14, 56, 190, 57, 206,
83, 242, 136, 5, 218, 70, 90, 7,
68, 159, 206, 105, 130, 21, 6, 59,
164, 87, 142, 46, 13, 117, 28, 22,
218, 5, 207, 174, 113, 92, 171, 78,
80, 134, 194, 112, 34, 109, 17, 161,
34, 39, 120, 245, 135, 144, 243, 208,
13, 73, 107, 167, 250, 234, 141, 129,
46, 215, 174, 157, 122, 68, 146, 121,
253, 47, 244, 102, 16, 73, 75, 126,
200, 147, 6, 200, 0, 178, 75, 153,
35, 26, 64, 132, 32, 62, 26, 8,
138, 14, 50, 178, 135, 240, 104, 33,
38, 219, 94, 251, 106, 105, 97, 238,
169, 79, 123, 40, 86, 25, 77, 106,
82, 1, 34, 40, 162, 104, 132, 144,
80, 115, 144, 41, 8, 78, 156, 155,
18, 237, 36, 197, 3, 221, 196, 138,
73, 8, 254, 130, 16, 164, 112, 119,
4, 89, 225, 167, 50, 229, 130, 18,
151, 226, 196, 189, 45, 72, 10, 82,
56, 134, 106, 138, 32, 131, 50, 53,
49, 137, 68, 213, 133, 232, 139, 177,
155, 54, 237, 6, 153, 133, 143, 86,
225, 56, 156, 167, 219, 34, 245, 169,
129, 26, 52, 184, 24, 183, 27, 224,
198, 133, 170, 54, 91, 101, 109, 62,
196, 109, 156, 73, 190, 182, 86, 5,
55, 229, 27, 47, 93, 132, 144, 251,
242, 88, 79, 231, 17, 113, 72, 180,
177, 14, 243, 123, 32, 62, 49, 87,
61, 223, 14, 174, 194, 35, 116, 138,
134, 33, 45, 252, 1, 130, 98, 116,
115, 154, 148, 207, 238, 54, 86, 137,
141, 173, 96, 156, 244, 186, 28, 250,
40, 142, 221, 248, 157, 157, 18, 170,
104, 169, 136, 17, 72, 128, 252, 34,
157, 43, 218, 53, 126, 105, 142, 119,
225, 29, 222, 57, 17, 72, 26, 16,
29, 136, 42, 14, 36, 8, 138, 33,
31, 9, 243, 181, 45, 145, 25, 7,
9, 24, 164, 186, 137, 134, 57, 1,
242, 153, 136, 96, 211, 24, 137, 56,
24, 148, 208, 151, 132, 177, 158, 21,
180, 158, 139, 73, 18, 161, 88, 176,
244, 73, 145, 30, 68, 177, 161, 176,
18, 150, 65, 138, 162, 17, 4, 233,
48, 14, 72, 89, 131, 198, 66, 155,
56, 176, 177, 56, 16, 4, 86, 56,
63, 59, 120, 4, 90, 120, 4, 62,
120, 254, 139, 34, 51, 61, 122, 187,
20, 77, 240, 133, 165, 224, 60, 95,
152, 132, 75, 89, 133, 85, 112, 140,
39, 124, 132, 48, 80, 38, 74, 144,
178, 212, 66, 12, 126, 178, 155, 132,
11, 190, 75, 193, 178, 212, 178, 155,
135, 91, 173, 58, 220, 33, 50, 75,
162, 198, 145, 149, 211, 248, 184, 141,
227, 56, 100, 98, 179, 181, 121, 20,
146, 139, 51, 144, 219, 27, 198, 233,
190, 112, 209, 156, 227, 0, 41, 204,
249, 15, 177, 179, 14, 61, 160, 29,
48, 202, 163, 203, 25, 28, 32, 90,
168, 229, 120, 40, 245, 227, 13, 221,
0, 143, 230, 192, 196, 106, 121, 12,
254, 32, 2, 187, 200, 13, 181, 200,
141, 169, 88, 131, 81, 33, 12, 210,
136, 3, 74, 84, 29, 67, 73, 39,
169, 235, 141, 216, 112, 15, 210, 144,
143, 4, 105, 53, 7, 132, 53, 69,
203, 13, 125, 193, 64, 8, 161, 47,
161, 106, 142, 11, 52, 170, 0, 163,
24, 2, 187, 17, 242, 241, 65, 31,
217, 18, 252, 17, 128, 144, 1, 176,
143, 56, 31, 157, 80, 177, 200, 3,
138, 18, 27, 137, 250, 65, 153, 160,
216, 9, 148, 216, 158, 245, 56, 146,
124, 1, 152, 244, 97, 31, 149, 8,
137, 202, 227, 132, 177, 136, 36, 227,
104, 33, 54, 120, 132, 168, 241, 140,
118, 140, 197, 60, 169, 10, 61, 32,
178, 42, 20, 4, 82, 160, 5, 121,
254, 163, 5, 186, 16, 38, 99, 232,
11, 106, 10, 134, 215, 163, 154, 85,
240, 12, 65, 160, 194, 48, 16, 4,
52, 49, 155, 20, 66, 140, 121, 130,
32, 109, 146, 67, 11, 50, 61, 11,
138, 33, 214, 194, 67, 60, 60, 62,
201, 152, 179, 36, 10, 156, 40, 178,
191, 201, 208, 139, 233, 24, 21, 57,
195, 45, 58, 91, 201, 67, 60, 68,
216, 2, 46, 87, 233, 13, 35, 124,
150, 227, 114, 28, 222, 64, 29, 96,
233, 130, 88, 92, 14, 248, 3, 15,
208, 145, 156, 40, 114, 168, 39, 2,
143, 9, 137, 34, 64, 20, 16, 9,
121, 34, 33, 178, 131, 46, 104, 14,
187, 16, 33, 62, 8, 156, 169, 152,
163, 169, 176, 131, 216, 144, 147, 209,
112, 66, 250, 8, 3, 74, 12, 142,
201, 112, 143, 189, 240, 150, 243, 112,
2, 25, 241, 69, 100, 1, 150, 192,
209, 151, 82, 35, 130, 109, 25, 136,
96, 105, 14, 96, 33, 145, 231, 208,
181, 116, 17, 60, 167, 232, 8, 231,
169, 36, 167, 168, 16, 75, 138, 70,
140, 88, 1, 230, 153, 176, 174, 66,
165, 98, 235, 36, 108, 108, 54, 84,
242, 170, 147, 72, 49, 244, 121, 188,
155, 64, 37, 30, 105, 170, 198, 131,
171, 35, 233, 0, 34, 152, 11, 56,
249, 16, 251, 104, 33, 1, 170, 11,
59, 64, 55, 187, 129, 183, 71, 208,
38, 166, 121, 61, 120, 99, 133, 254,
134, 123, 194, 122, 155, 4, 95, 56,
205, 216, 123, 160, 132, 20, 77, 119,
115, 200, 97, 154, 132, 192, 144, 200,
78, 145, 19, 210, 42, 173, 43, 59,
27, 46, 171, 67, 225, 147, 161, 224,
220, 33, 30, 234, 45, 219, 32, 28,
135, 66, 12, 123, 58, 201, 42, 3,
57, 189, 17, 141, 197, 152, 179, 56,
131, 167, 68, 108, 156, 192, 217, 162,
240, 32, 29, 41, 234, 149, 235, 90,
13, 199, 32, 46, 248, 243, 40, 94,
9, 46, 77, 132, 28, 228, 138, 34,
78, 196, 201, 72, 90, 74, 187, 225,
15, 39, 128, 74, 166, 92, 69, 78,
243, 155, 166, 179, 191, 217, 161, 58,
62, 24, 13, 251, 219, 150, 106, 1,
191, 193, 137, 29, 167, 148, 145, 14,
48, 128, 17, 248, 22, 148, 220, 56,
3, 241, 22, 71, 116, 138, 116, 241,
150, 15, 241, 22, 161, 26, 17, 90,
43, 145, 158, 137, 170, 230, 232, 136,
15, 193, 144, 19, 33, 80, 252, 49,
128, 175, 146, 48, 174, 226, 145, 22,
28, 144, 32, 225, 152, 24, 252, 152,
137, 224, 64, 133, 8, 182, 17, 88,
165, 134, 136, 204, 20, 57, 177, 237,
153, 164, 126, 241, 193, 38, 137, 37,
34, 160, 4, 197, 34, 132, 205, 60,
38, 72, 241, 18, 78, 179, 172, 206,
3, 44, 132, 156, 4, 89, 160, 132,
19, 138, 55, 43, 92, 61, 134, 155,
132, 92, 208, 4, 211, 27, 254, 5,
42, 180, 66, 218, 35, 140, 39, 196,
189, 112, 83, 67, 178, 48, 20, 22,
114, 33, 11, 210, 50, 206, 186, 20,
193, 56, 155, 209, 218, 205, 135, 35,
206, 135, 227, 33, 147, 179, 13, 242,
172, 180, 143, 83, 51, 248, 40, 156,
236, 131, 13, 58, 85, 12, 5, 18,
179, 138, 35, 40, 39, 18, 180, 3,
148, 10, 89, 33, 162, 137, 10, 142,
193, 40, 46, 236, 224, 142, 224, 88,
141, 192, 137, 173, 54, 77, 174, 225,
186, 201, 17, 81, 202, 220, 224, 10,
67, 65, 14, 23, 210, 11, 176, 88,
197, 63, 25, 149, 178, 72, 12, 187,
25, 148, 166, 27, 149, 217, 217, 13,
127, 210, 201, 237, 84, 130, 21, 120,
53, 18, 179, 14, 242, 148, 130, 12,
125, 10, 177, 235, 143, 88, 197, 144,
129, 32, 176, 9, 11, 152, 9, 155,
48, 164, 42, 48, 252, 2, 204, 1,
27, 176, 134, 169, 9, 179, 98, 159,
134, 112, 8, 246, 169, 76, 184, 194,
198, 18, 83, 153, 145, 241, 152, 236,
73, 193, 158, 49, 142, 168, 50, 48,
25, 93, 49, 37, 152, 139, 164, 209,
47, 37, 184, 211, 35, 253, 19, 177,
33, 5, 187, 152, 55, 48, 81, 166,
92, 40, 189, 71, 88, 133, 92, 32,
139, 32, 139, 32, 74, 112, 205, 193,
26, 133, 96, 40, 87, 122, 43, 77,
90, 152, 4, 50, 81, 10, 222, 27,
140, 166, 196, 29, 207, 254, 208, 131,
223, 132, 50, 41, 51, 189, 19, 90,
148, 132, 211, 38, 133, 107, 45, 142,
204, 33, 230, 27, 168, 94, 145, 211,
74, 147, 12, 250, 24, 28, 222, 82,
73, 189, 209, 155, 125, 149, 19, 11,
2, 13, 128, 2, 28, 194, 121, 179,
96, 249, 14, 76, 140, 10, 242, 108,
46, 65, 133, 41, 62, 88, 40, 97,
233, 40, 208, 65, 185, 244, 82, 34,
153, 116, 185, 39, 250, 185, 17, 17,
145, 116, 74, 39, 240, 148, 144, 173,
100, 58, 62, 216, 63, 66, 152, 35,
50, 105, 74, 64, 19, 4, 192, 113,
66, 151, 2, 180, 244, 10, 53, 116,
114, 2, 220, 25, 181, 244, 154, 129,
10, 0, 59, 3, 165, 14, 225, 114,
187, 105, 129, 14, 222, 33, 142, 44,
26, 8, 13, 13, 60, 9, 35, 48,
14, 124, 30, 0, 33, 182, 25, 144,
153, 79, 130, 48, 95, 245, 136, 139,
97, 9, 200, 108, 31, 238, 57, 43,
37, 209, 9, 148, 225, 137, 87, 155,
188, 249, 73, 65, 182, 189, 158, 186,
37, 144, 7, 5, 16, 3, 179, 158,
137, 88, 199, 73, 24, 133, 192, 130,
57, 39, 56, 27, 54, 232, 147, 207,
60, 11, 176, 96, 26, 48, 17, 38,
40, 165, 138, 115, 45, 45, 69, 200,
5, 214, 163, 132, 96, 136, 210, 211,
35, 200, 178, 161, 5, 89, 80, 92,
114, 93, 131, 164, 80, 195, 172, 104,
184, 59, 5, 11, 254, 57, 100, 56,
193, 96, 56, 129, 205, 200, 224, 19,
62, 49, 99, 221, 130, 61, 62, 133,
45, 168, 219, 160, 140, 186, 72, 11,
250, 8, 175, 79, 241, 210, 143, 187,
62, 235, 91, 12, 181, 56, 155, 219,
61, 168, 214, 48, 185, 153, 92, 150,
116, 10, 156, 81, 33, 141, 141, 26,
191, 240, 82, 179, 209, 153, 16, 76,
84, 94, 217, 242, 21, 233, 162, 168,
68, 227, 157, 228, 218, 139, 56, 224,
15, 153, 3, 85, 54, 208, 207, 116,
210, 131, 209, 176, 74, 169, 200, 202,
157, 148, 202, 213, 16, 213, 163, 221,
13, 169, 200, 35, 218, 89, 129, 172,
186, 175, 3, 197, 185, 86, 213, 1,
182, 172, 90, 4, 129, 142, 111, 145,
130, 129, 216, 143, 98, 252, 15, 125,
129, 47, 2, 209, 53, 2, 161, 21,
14, 236, 144, 177, 181, 136, 19, 240,
85, 3, 241, 17, 83, 74, 8, 176,
154, 59, 75, 226, 145, 21, 49, 18,
141, 17, 18, 32, 108, 54, 82, 66,
49, 103, 77, 24, 30, 201, 188, 69,
226, 224, 183, 122, 8, 37, 120, 132,
81, 112, 160, 119, 148, 2, 82, 208,
4, 172, 160, 11, 207, 24, 38, 57,
153, 71, 98, 106, 61, 78, 8, 12,
82, 192, 194, 32, 59, 33, 77, 176,
220, 19, 90, 133, 131, 108, 38, 89,
224, 177, 33, 163, 215, 207, 229, 4,
74, 224, 189, 71, 104, 184, 237, 13,
190, 210, 58, 254, 27, 193, 80, 148,
68, 65, 33, 131, 237, 200, 215, 117,
39, 140, 109, 27, 22, 218, 211, 54,
84, 11, 49, 51, 47, 72, 1, 73,
198, 248, 184, 212, 112, 179, 202, 2,
83, 194, 176, 62, 194, 153, 222, 54,
36, 141, 236, 40, 150, 195, 64, 78,
225, 170, 174, 199, 57, 47, 232, 189,
156, 147, 253, 161, 68, 132, 162, 67,
35, 163, 69, 243, 223, 141, 242, 195,
248, 248, 25, 169, 155, 69, 220, 197,
79, 33, 50, 175, 146, 140, 138, 171,
8, 21, 59, 74, 167, 255, 244, 88,
162, 146, 223, 17, 72, 14, 114, 57,
224, 10, 182, 23, 12, 12, 58, 222,
217, 53, 78, 22, 176, 125, 137, 42,
96, 227, 151, 125, 161, 129, 104, 108,
16, 16, 69, 42, 29, 32, 204, 143,
249, 96, 17, 116, 65, 195, 172, 144,
139, 49, 43, 183, 250, 176, 30, 36,
165, 137, 216, 65, 16, 54, 142, 1,
97, 165, 31, 100, 31, 34, 56, 225,
192, 114, 208, 43, 192, 38, 172, 136,
172, 88, 68, 225, 126, 157, 97, 211,
211, 132, 92, 224, 4, 37, 94, 5,
42, 36, 132, 41, 116, 183, 71, 168,
220, 81, 80, 132, 62, 33, 200, 73,
224, 26, 30, 35, 132, 39, 109, 139,
164, 216, 189, 178, 25, 93, 126, 154,
154, 129, 53, 189, 178, 81, 148, 117,
30, 216, 214, 213, 140, 224, 83, 183,
75, 57, 227, 224, 204, 33, 143, 3,
149, 171, 254, 136, 103, 169, 153, 29,
143, 211, 221, 202, 146, 51, 138, 237,
173, 88, 20, 62, 221, 93, 27, 171,
24, 156, 22, 50, 218, 91, 65, 217,
54, 181, 141, 241, 164, 40, 133, 38,
14, 159, 156, 34, 56, 107, 69, 225,
74, 207, 158, 52, 212, 72, 220, 40,
109, 185, 191, 167, 0, 139, 216, 136,
197, 76, 5, 156, 220, 147, 186, 156,
213, 11, 75, 29, 149, 171, 44, 64,
240, 115, 223, 141, 2, 145, 10, 64,
213, 19, 224, 95, 149, 117, 2, 97,
148, 22, 189, 109, 208, 173, 29, 48,
90, 53, 91, 96, 195, 85, 102, 20,
219, 251, 106, 176, 8, 94, 152, 18,
233, 48, 191, 213, 182, 196, 107, 37,
95, 226, 176, 249, 25, 1, 153, 96,
9, 23, 221, 182, 187, 205, 30, 143,
240, 25, 94, 78, 106, 197, 188, 204,
73, 24, 32, 69, 208, 95, 44, 192,
11, 62, 241, 160, 169, 81, 44, 117,
35, 50, 48, 33, 4, 118, 181, 225,
121, 12, 134, 192, 120, 82, 116, 125,
49, 99, 32, 166, 35, 77, 6, 78,
64, 183, 92, 144, 133, 169, 105, 205,
52, 121, 49, 187, 110, 166, 210, 34,
93, 11, 74, 221, 19, 82, 231, 192,
0, 216, 222, 28, 190, 173, 64, 45,
45, 187, 72, 139, 124, 161, 72, 121,
141, 22, 202, 231, 87, 108, 67, 222,
141, 199, 143, 27, 227, 235, 139, 69,
23, 178, 33, 232, 20, 168, 196, 136,
174, 254, 100, 185, 52, 217, 136, 10,
203, 57, 52, 233, 98, 68, 237, 16,
14, 40, 114, 168, 218, 144, 162, 235,
181, 34, 239, 96, 151, 153, 125, 52,
238, 253, 22, 57, 17, 33, 204, 66,
140, 15, 74, 140, 20, 90, 13, 43,
4, 156, 176, 224, 74, 169, 188, 156,
201, 224, 13, 72, 225, 144, 106, 73,
36, 23, 157, 223, 168, 5, 158, 222,
153, 150, 221, 33, 2, 221, 16, 197,
43, 240, 95, 90, 177, 90, 12, 137,
208, 158, 89, 164, 111, 169, 75, 167,
120, 106, 172, 194, 17, 28, 89, 145,
139, 153, 152, 138, 161, 30, 237, 81,
239, 110, 75, 48, 13, 254, 176, 109,
227, 158, 102, 148, 204, 104, 101, 24,
143, 41, 86, 146, 1, 230, 174, 158,
238, 116, 58, 98, 41, 92, 44, 43,
68, 225, 75, 89, 102, 69, 160, 4,
90, 208, 132, 102, 98, 133, 96, 80,
226, 214, 228, 177, 184, 38, 166, 102,
174, 107, 74, 224, 194, 92, 56, 155,
202, 53, 147, 71, 104, 71, 36, 126,
132, 179, 1, 190, 128, 85, 148, 114,
74, 98, 129, 83, 20, 127, 213, 103,
204, 136, 195, 223, 44, 211, 130, 45,
206, 200, 24, 233, 28, 114, 236, 166,
67, 66, 223, 237, 103, 200, 184, 83,
22, 218, 77, 77, 153, 140, 222, 106,
51, 216, 48, 180, 238, 80, 14, 109,
89, 99, 140, 26, 191, 97, 225, 40,
140, 22, 74, 95, 25, 156, 160, 12,
254, 23, 138, 154, 34, 237, 40, 142,
129, 240, 141, 66, 211, 140, 109, 177,
139, 147, 182, 79, 64, 155, 35, 166,
107, 197, 46, 200, 74, 251, 27, 223,
168, 152, 163, 224, 8, 217, 207, 154,
174, 250, 104, 152, 248, 165, 100, 101,
121, 162, 13, 233, 143, 253, 125, 15,
153, 77, 59, 9, 213, 181, 204, 35,
143, 93, 54, 160, 224, 57, 59, 253,
122, 106, 176, 147, 128, 21, 37, 48,
194, 251, 42, 234, 169, 164, 70, 34,
152, 142, 232, 181, 31, 177, 164, 84,
90, 159, 130, 96, 136, 186, 197, 101,
14, 38, 165, 249, 202, 64, 91, 38,
199, 19, 147, 2, 74, 32, 133, 164,
105, 203, 193, 9, 20, 125, 92, 5,
121, 67, 225, 116, 94, 133, 40, 37,
112, 89, 216, 61, 78, 96, 5, 114,
253, 102, 90, 160, 5, 36, 126, 87,
82, 224, 102, 89, 72, 6, 108, 194,
97, 114, 37, 240, 96, 232, 60, 12,
199, 11, 129, 43, 45, 124, 238, 215,
105, 102, 103, 2, 23, 184, 129, 51,
155, 50, 117, 184, 221, 196, 72, 121,
54, 61, 227, 139, 161, 46, 179, 62,
48, 102, 173, 47, 187, 173, 49, 185,
236, 103, 127, 201, 122, 106, 12, 187,
184, 93, 47, 213, 113, 143, 53, 22,
248, 248, 167, 202, 121, 227, 70, 29,
46, 53, 199, 14, 68, 21, 46, 156,
107, 114, 69, 99, 114, 72, 44, 14,
14, 220, 104, 251, 131, 160, 244, 254,
136, 197, 147, 30, 223, 22, 66, 155,
168, 168, 11, 172, 180, 207, 42, 15,
213, 56, 29, 13, 49, 63, 175, 224,
0, 145, 81, 170, 153, 247, 96, 237,
83, 75, 170, 146, 122, 150, 154, 228,
29, 90, 195, 16, 78, 230, 105, 174,
237, 228, 93, 235, 136, 167, 94, 129,
188, 219, 24, 17, 12, 49, 169, 102,
219, 21, 84, 111, 16, 212, 158, 86,
66, 86, 36, 25, 137, 248, 206, 30,
91, 94, 31, 14, 252, 175, 9, 115,
244, 35, 57, 1, 39, 160, 4, 20,
86, 132, 85, 227, 244, 190, 40, 240,
193, 232, 199, 197, 82, 61, 180, 166,
4, 40, 141, 117, 95, 72, 20, 118,
237, 194, 185, 72, 134, 85, 176, 102,
89, 255, 154, 216, 3, 195, 23, 195,
117, 61, 224, 234, 175, 201, 138, 94,
7, 222, 116, 54, 236, 192, 64, 19,
53, 140, 178, 17, 23, 236, 129, 5,
83, 44, 3, 211, 118, 86, 241, 29,
90, 27, 143, 83, 55, 133, 243, 44,
131, 3, 232, 178, 103, 12, 185, 185,
236, 73, 41, 173, 132, 237, 161, 246,
3, 35, 157, 68, 149, 224, 192, 39,
147, 250, 196, 213, 174, 94, 78, 20,
89, 111, 103, 114, 114, 71, 84, 140,
62, 22, 242, 184, 99, 71, 97, 173,
109, 81, 183, 168, 176, 66, 243, 61,
191, 196, 64, 155, 193, 49, 61, 161,
21, 4, 69, 229, 180, 219, 80, 33,
82, 12, 22, 215, 105, 152, 254, 22,
128, 105, 149, 221, 123, 6, 69, 142,
141, 27, 187, 11, 121, 71, 85, 83,
151, 241, 24, 70, 0, 241, 100, 99,
220, 218, 154, 104, 1, 141, 247, 64,
98, 91, 129, 146, 192, 9, 3, 99,
86, 5, 123, 121, 99, 197, 65, 167,
30, 71, 14, 46, 152, 86, 94, 24,
16, 28, 152, 74, 71, 18, 204, 252,
18, 66, 64, 248, 48, 80, 50, 59,
232, 32, 178, 72, 44, 186, 176, 66,
83, 31, 44, 118, 213, 132, 111, 150,
133, 182, 62, 225, 96, 176, 220, 29,
101, 6, 86, 152, 121, 90, 96, 134,
3, 231, 97, 95, 96, 184, 202, 229,
4, 172, 64, 97, 74, 8, 12, 134,
243, 55, 134, 75, 20, 41, 158, 230,
97, 151, 98, 124, 181, 12, 43, 76,
221, 50, 53, 118, 101, 47, 11, 216,
205, 226, 130, 6, 136, 53, 113, 244,
216, 41, 200, 230, 10, 150, 48, 97,
200, 48, 36, 179, 134, 204, 66, 134,
107, 216, 76, 52, 232, 144, 77, 28,
59, 122, 50, 218, 161, 184, 230, 33,
196, 46, 87, 174, 72, 41, 233, 68,
137, 147, 148, 8, 165, 116, 17, 137,
133, 33, 22, 37, 40, 83, 58, 25,
89, 18, 33, 73, 39, 82, 16, 98,
105, 217, 5, 203, 21, 157, 59, 71,
146, 36, 90, 242, 166, 81, 154, 78,
136, 16, 233, 217, 69, 74, 24, 141,
118, 186, 40, 209, 216, 37, 140, 30,
66, 31, 227, 16, 138, 254, 51, 177,
235, 75, 62, 130, 214, 68, 229, 19,
38, 161, 30, 50, 61, 237, 172, 25,
57, 17, 104, 151, 53, 78, 102, 140,
152, 81, 161, 5, 75, 44, 59, 129,
18, 81, 66, 149, 136, 147, 48, 75,
137, 252, 100, 138, 16, 8, 16, 168,
82, 12, 19, 65, 44, 69, 9, 16,
31, 75, 117, 232, 112, 210, 197, 137,
15, 34, 82, 128, 140, 168, 112, 66,
66, 130, 22, 62, 124, 80, 214, 65,
99, 69, 139, 25, 168, 105, 144, 158,
65, 3, 177, 142, 25, 62, 104, 204,
152, 97, 122, 70, 11, 29, 145, 83,
211, 110, 145, 186, 197, 137, 19, 181,
127, 15, 175, 93, 156, 6, 101, 26,
180, 141, 227, 110, 177, 226, 196, 136,
17, 29, 128, 60, 226, 196, 73, 80,
98, 150, 172, 70, 217, 161, 196, 138,
144, 30, 62, 164, 72, 241, 225, 163,
72, 214, 40, 62, 132, 40, 5, 27,
165, 104, 146, 172, 96, 148, 38, 141,
10, 22, 108, 21, 167, 85, 204, 100,
113, 26, 149, 43, 25, 37, 143, 176,
23, 204, 35, 138, 176, 199, 9, 87,
163, 140, 162, 73, 129, 138, 16, 130,
145, 32, 132, 16, 242, 136, 132, 138,
88, 248, 200, 36, 143, 96, 168, 97,
134, 138, 8, 242, 33, 33, 14, 74,
40, 136, 88, 36, 154, 248, 33, 31,
4, 169, 24, 7, 27, 13, 157, 229,
208, 64, 5, 117, 132, 69, 66, 18,
217, 216, 208, 68, 254, 24, 25, 244,
145, 64, 44, 178, 72, 209, 66, 31,
65, 20, 198, 79, 54, 153, 116, 146,
78, 35, 181, 68, 227, 66, 79, 233,
148, 210, 94, 67, 1, 53, 229, 85,
52, 22, 25, 212, 80, 60, 1, 37,
5, 148, 69, 221, 196, 37, 77, 125,
33, 36, 18, 25, 225, 77, 165, 4,
27, 118, 40, 100, 199, 131, 107, 216,
193, 135, 87, 108, 8, 18, 199, 154,
122, 180, 152, 38, 145, 97, 176, 113,
150, 158, 97, 144, 164, 208, 81, 49,
205, 32, 92, 6, 51, 92, 241, 147,
83, 88, 0, 1, 24, 83, 74, 60,
166, 4, 96, 144, 246, 5, 217, 164,
141, 45, 26, 217, 165, 64, 232, 48,
26, 105, 125, 105, 138, 24, 13, 35,
72, 112, 66, 5, 15, 200, 54, 26,
101, 170, 61, 119, 194, 10, 174, 81,
230, 67, 100, 165, 25, 215, 91, 11,
175, 197, 214, 27, 106, 181, 157, 224,
91, 106, 205, 13, 71, 156, 171, 201,
253, 234, 92, 112, 209, 73, 71, 157,
130, 132, 72, 182, 83, 134, 122, 80,
34, 139, 32, 225, 173, 178, 74, 121,
132, 160, 103, 158, 38, 193, 144, 34,
160, 44, 198, 112, 162, 9, 39, 193,
24, 179, 138, 38, 250, 109, 71, 138,
47, 201, 104, 66, 73, 182, 198, 4,
168, 137, 49, 220, 41, 66, 10, 126,
243, 105, 168, 81, 132, 19, 94, 168,
136, 134, 243, 101, 136, 97, 134, 35,
150, 7, 34, 254, 33, 39, 146, 88,
98, 138, 4, 201, 200, 150, 139, 61,
85, 148, 166, 29, 113, 88, 121, 149,
67, 66, 62, 20, 70, 142, 24, 181,
248, 16, 143, 26, 123, 4, 18, 67,
10, 1, 69, 210, 145, 42, 145, 84,
228, 75, 12, 145, 124, 19, 141, 68,
49, 153, 144, 72, 74, 182, 92, 18,
141, 19, 143, 156, 101, 81, 64, 9,
117, 18, 17, 135, 182, 180, 134, 30,
31, 174, 33, 69, 120, 10, 169, 247,
16, 155, 94, 173, 17, 45, 67, 229,
181, 24, 7, 31, 100, 92, 229, 21,
145, 45, 2, 181, 80, 80, 135, 206,
213, 129, 93, 39, 56, 49, 242, 146,
163, 201, 36, 211, 21, 99, 167, 4,
169, 164, 176, 170, 61, 26, 98, 145,
173, 109, 26, 114, 165, 165, 154, 129,
4, 43, 116, 80, 193, 169, 168, 210,
208, 66, 7, 25, 116, 176, 2, 224,
202, 221, 102, 26, 106, 190, 9, 231,
92, 225, 192, 141, 224, 91, 116, 172,
182, 234, 28, 226, 185, 250, 86, 91,
220, 183, 13, 235, 27, 224, 193, 77,
247, 72, 178, 203, 74, 193, 145, 38,
185, 40, 242, 38, 43, 172, 104, 68,
72, 46, 242, 114, 226, 237, 123, 178,
36, 67, 74, 127, 198, 188, 174, 9,
43, 209, 160, 231, 31, 51, 154, 76,
2, 175, 187, 143, 104, 146, 204, 40,
113, 76, 66, 239, 40, 148, 4, 168,
136, 30, 65, 135, 200, 47, 191, 28,
26, 255, 254, 111, 131, 2, 15, 252,
33, 245, 5, 31, 76, 98, 242, 201,
23, 228, 21, 68, 16, 37, 84, 17,
71, 7, 141, 185, 208, 199, 56, 98,
244, 35, 200, 14, 145, 113, 62, 247,
22, 75, 61, 115, 78, 51, 245, 228,
51, 141, 234, 231, 60, 241, 72, 86,
46, 228, 39, 82, 69, 150, 116, 149,
79, 106, 166, 23, 153, 45, 137, 100,
58, 97, 10, 75, 166, 22, 33, 69,
28, 68, 44, 11, 17, 132, 34, 32,
18, 7, 6, 98, 140, 16, 81, 91,
67, 136, 40, 146, 21, 34, 149, 105,
13, 52, 98, 145, 94, 62, 66, 18,
44, 28, 164, 5, 133, 242, 140, 20,
90, 54, 63, 88, 149, 13, 37, 151,
1, 130, 18, 72, 2, 169, 148, 68,
38, 82, 108, 179, 20, 166, 46, 69,
26, 32, 76, 102, 83, 52, 232, 192,
168, 42, 32, 1, 209, 144, 230, 54,
193, 57, 98, 171, 92, 163, 28, 32,
236, 205, 54, 189, 105, 142, 228, 88,
69, 172, 93, 169, 170, 112, 128, 75,
34, 175, 92, 133, 28, 229, 20, 135,
87, 153, 59, 193, 230, 70, 65, 10,
69, 248, 96, 39, 82, 152, 72, 28,
30, 177, 10, 65, 104, 132, 94, 4,
33, 4, 45, 56, 97, 7, 65, 100,
75, 19, 173, 11, 198, 183, 178, 133,
199, 252, 48, 99, 140, 148, 200, 69,
238, 12, 100, 140, 96, 76, 130, 16,
191, 227, 132, 179, 88, 177, 138, 81,
76, 254, 34, 96, 201, 203, 87, 243,
52, 244, 158, 73, 248, 171, 65, 22,
146, 80, 137, 168, 23, 161, 234, 129,
40, 97, 225, 73, 30, 139, 132, 244,
34, 129, 108, 4, 148, 8, 81, 200,
71, 40, 162, 190, 32, 157, 143, 13,
20, 113, 101, 199, 126, 180, 49, 30,
93, 108, 102, 102, 132, 82, 79, 190,
214, 18, 140, 65, 228, 126, 136, 162,
210, 46, 139, 50, 190, 152, 189, 228,
98, 34, 19, 160, 83, 150, 180, 165,
146, 24, 102, 34, 100, 96, 147, 128,
226, 32, 5, 177, 124, 229, 17, 20,
73, 154, 67, 192, 179, 62, 9, 181,
104, 142, 100, 121, 166, 90, 186, 96,
181, 43, 48, 100, 39, 93, 32, 195,
92, 234, 210, 1, 188, 160, 12, 40,
176, 122, 84, 77, 208, 38, 67, 30,
58, 193, 49, 75, 225, 20, 98, 80,
165, 27, 34, 20, 145, 135, 68, 216,
20, 105, 128, 184, 130, 7, 60, 32,
55, 166, 49, 13, 112, 160, 195, 42,
219, 140, 134, 53, 255, 164, 220, 114,
92, 211, 43, 220, 184, 70, 53, 190,
209, 1, 230, 118, 133, 185, 218, 0,
110, 114, 202, 17, 92, 68, 121, 133,
184, 224, 100, 128, 8, 156, 27, 99,
98, 72, 114, 190, 160, 69, 140, 77,
138, 72, 17, 31, 10, 84, 30, 206,
101, 136, 62, 164, 120, 222, 42, 110,
74, 9, 78, 240, 71, 64, 171, 144,
133, 238, 56, 65, 11, 90, 76, 194,
254, 64, 180, 208, 132, 32, 40, 49,
45, 70, 206, 231, 165, 98, 9, 209,
132, 48, 20, 32, 227, 61, 239, 120,
5, 146, 144, 245, 80, 180, 73, 172,
230, 203, 130, 217, 75, 17, 139, 66,
198, 39, 50, 64, 45, 60, 124, 152,
10, 197, 92, 89, 62, 137, 196, 161,
173, 173, 76, 229, 43, 61, 82, 49,
30, 189, 111, 101, 71, 201, 31, 22,
190, 102, 165, 139, 101, 109, 76, 2,
12, 160, 94, 164, 180, 63, 159, 236,
79, 33, 68, 82, 102, 79, 14, 235,
61, 44, 245, 229, 37, 174, 204, 138,
131, 218, 34, 150, 108, 82, 226, 177,
163, 251, 8, 137, 190, 210, 21, 55,
9, 98, 79, 207, 244, 32, 9, 249,
167, 144, 162, 132, 65, 9, 51, 40,
212, 223, 44, 227, 18, 189, 140, 230,
36, 40, 121, 20, 74, 36, 37, 147,
70, 241, 19, 85, 249, 44, 205, 108,
74, 35, 56, 184, 133, 170, 110, 21,
8, 13, 167, 140, 120, 183, 17, 116,
244, 54, 81, 60, 220, 8, 52, 42,
185, 142, 58, 103, 113, 29, 205, 149,
175, 32, 231, 155, 45, 10, 142, 57,
184, 185, 98, 177, 76, 170, 9, 247,
104, 38, 133, 231, 219, 94, 91, 53,
146, 189, 228, 61, 117, 121, 252, 10,
144, 134, 210, 11, 176, 2, 81, 210,
120, 224, 26, 5, 39, 138, 202, 188,
245, 140, 7, 190, 241, 125, 105, 208,
242, 37, 213, 0, 181, 183, 146, 254,
26, 194, 170, 192, 170, 87, 33, 11,
114, 85, 123, 27, 225, 94, 72, 190,
55, 199, 160, 165, 168, 123, 2, 81,
235, 43, 57, 230, 177, 182, 250, 200,
173, 176, 180, 152, 144, 164, 230, 191,
187, 154, 51, 40, 61, 161, 209, 67,
158, 34, 37, 101, 238, 242, 39, 119,
61, 148, 68, 242, 116, 21, 195, 158,
37, 81, 2, 60, 172, 206, 92, 123,
206, 137, 40, 239, 32, 82, 136, 208,
66, 20, 193, 9, 13, 78, 34, 14,
235, 123, 4, 31, 4, 162, 33, 175,
240, 97, 18, 119, 122, 80, 75, 236,
20, 148, 137, 4, 165, 11, 210, 156,
193, 58, 43, 176, 130, 188, 24, 133,
133, 99, 187, 12, 217, 202, 166, 153,
178, 193, 240, 49, 139, 130, 84, 219,
108, 171, 41, 135, 106, 170, 52, 125,
91, 65, 169, 100, 115, 219, 189, 117,
160, 3, 196, 229, 77, 108, 48, 247,
28, 212, 60, 199, 139, 185, 25, 20,
157, 161, 243, 197, 36, 94, 183, 207,
170, 65, 142, 109, 148, 72, 155, 219,
100, 20, 58, 68, 208, 241, 40, 8,
17, 195, 145, 180, 85, 97, 20, 54,
107, 121, 8, 50, 144, 241, 6, 237,
191, 33, 18, 144, 38, 214, 69, 73,
78, 248, 139, 93, 186, 139, 30, 137,
188, 67, 138, 5, 221, 151, 188, 16,
180, 80, 123, 1, 70, 85, 78, 140,
135, 94, 164, 208, 180, 243, 252, 229,
160, 233, 97, 79, 70, 174, 254, 20,
235, 207, 216, 192, 96, 177, 4, 57,
71, 21, 86, 107, 44, 33, 230, 163,
136, 89, 216, 125, 25, 134, 241, 81,
190, 164, 51, 133, 180, 36, 100, 36,
179, 89, 162, 90, 114, 63, 167, 16,
105, 98, 231, 44, 224, 148, 70, 166,
165, 24, 107, 134, 98, 97, 224, 138,
34, 134, 134, 133, 242, 100, 243, 17,
52, 86, 132, 87, 210, 24, 228, 9,
62, 130, 69, 49, 125, 90, 103, 215,
196, 6, 26, 185, 242, 79, 79, 222,
85, 6, 90, 160, 215, 155, 96, 134,
48, 51, 36, 195, 163, 164, 214, 152,
150, 64, 230, 10, 126, 234, 246, 82,
148, 144, 215, 200, 4, 69, 83, 44,
81, 66, 101, 174, 192, 25, 207, 84,
160, 2, 175, 89, 20, 63, 247, 166,
28, 212, 100, 166, 159, 62, 168, 77,
107, 100, 179, 28, 181, 201, 230, 159,
194, 217, 27, 106, 164, 152, 69, 95,
81, 244, 163, 46, 119, 162, 19, 17,
55, 2, 37, 112, 46, 209, 10, 31,
137, 43, 57, 210, 210, 93, 55, 248,
80, 31, 44, 8, 4, 255, 139, 33,
89, 48, 35, 25, 246, 57, 170, 189,
40, 249, 105, 17, 145, 72, 19, 178,
88, 100, 166, 103, 93, 162, 168, 178,
235, 95, 6, 50, 158, 49, 210, 161,
117, 173, 127, 35, 26, 209, 216, 79,
48, 138, 30, 140, 92, 112, 130, 15,
215, 180, 158, 194, 58, 162, 52, 133,
172, 175, 173, 234, 49, 254, 145, 30,
20, 162, 214, 98, 79, 36, 99, 204,
198, 10, 27, 65, 89, 86, 22, 185,
100, 197, 204, 222, 18, 77, 190, 4,
149, 144, 132, 88, 152, 2, 244, 121,
137, 89, 12, 146, 12, 115, 140, 44,
103, 193, 137, 203, 106, 230, 191, 178,
169, 118, 13, 226, 204, 32, 80, 234,
238, 38, 182, 180, 210, 149, 196, 158,
244, 143, 194, 234, 76, 22, 227, 111,
76, 78, 136, 141, 14, 132, 99, 240,
152, 5, 101, 52, 150, 154, 148, 76,
74, 2, 153, 148, 52, 138, 103, 99,
163, 109, 14, 119, 8, 153, 77, 105,
234, 4, 25, 88, 65, 6, 44, 206,
20, 166, 144, 230, 163, 173, 138, 219,
22, 111, 165, 156, 233, 26, 167, 161,
178, 33, 220, 112, 18, 103, 56, 62,
247, 138, 55, 92, 132, 232, 224, 226,
172, 26, 154, 39, 107, 209, 88, 160,
112, 75, 101, 68, 222, 179, 146, 129,
40, 87, 32, 68, 127, 22, 73, 47,
77, 140, 154, 25, 233, 248, 70, 54,
162, 225, 11, 127, 53, 210, 234, 34,
42, 152, 119, 114, 154, 233, 162, 42,
111, 121, 148, 108, 164, 170, 237, 78,
52, 220, 67, 62, 20, 96, 60, 132,
195, 32, 85, 67, 50, 40, 18, 124,
105, 66, 90, 96, 193, 26, 92, 85,
180, 124, 158, 40, 181, 157, 143, 68,
11, 138, 176, 93, 143, 196, 73, 92,
105, 76, 76, 0, 193, 21, 64, 16,
27, 16, 194, 36, 254, 60, 149, 153,
156, 222, 162, 36, 132, 97, 5, 150,
73, 164, 208, 178, 105, 216, 144, 32,
5, 79, 228, 207, 79, 236, 210, 36,
40, 210, 42, 12, 21, 45, 200, 130,
44, 148, 78, 15, 230, 212, 36, 164,
133, 72, 100, 137, 149, 212, 76, 81,
164, 68, 79, 72, 141, 29, 56, 8,
27, 208, 12, 142, 208, 146, 42, 85,
140, 91, 69, 204, 133, 185, 136, 138,
33, 214, 50, 125, 92, 234, 205, 192,
57, 157, 133, 73, 20, 17, 172, 52,
138, 217, 220, 94, 99, 188, 94, 95,
12, 159, 165, 112, 138, 26, 110, 74,
114, 140, 192, 239, 85, 28, 13, 220,
30, 108, 32, 14, 246, 125, 84, 69,
65, 17, 115, 85, 31, 18, 57, 78,
226, 204, 217, 111, 164, 6, 70, 241,
6, 69, 5, 139, 160, 25, 71, 11,
40, 193, 36, 88, 135, 32, 196, 208,
90, 124, 146, 248, 73, 69, 194, 144,
197, 46, 65, 140, 70, 68, 218, 122,
228, 2, 252, 85, 67, 53, 228, 130,
166, 213, 159, 36, 89, 136, 131, 36,
213, 180, 172, 2, 187, 4, 72, 120,
72, 72, 122, 213, 84, 253, 205, 7,
37, 36, 131, 214, 157, 67, 56, 100,
67, 46, 80, 2, 41, 12, 146, 3,
118, 132, 139, 232, 193, 36, 160, 136,
194, 16, 196, 133, 73, 24, 132, 228,
87, 212, 84, 76, 154, 80, 152, 44,
101, 68, 121, 96, 1, 236, 17, 134,
239, 72, 12, 254, 100, 0, 129, 171,
0, 193, 75, 172, 160, 48, 209, 224,
201, 180, 88, 72, 84, 163, 139, 213,
224, 57, 177, 194, 55, 124, 227, 57,
132, 99, 56, 134, 3, 57, 102, 67,
48, 200, 2, 37, 232, 193, 71, 136,
24, 94, 25, 33, 81, 156, 4, 66,
40, 33, 191, 72, 211, 215, 68, 196,
92, 57, 196, 196, 176, 157, 212, 104,
152, 182, 37, 4, 204, 144, 152, 45,
249, 128, 104, 156, 0, 13, 172, 143,
212, 140, 4, 102, 188, 10, 83, 184,
214, 25, 214, 22, 27, 162, 10, 172,
184, 13, 62, 73, 100, 112, 21, 31,
13, 4, 223, 103, 72, 192, 12, 52,
36, 168, 4, 71, 174, 44, 135, 224,
240, 202, 242, 101, 206, 21, 229, 217,
17, 21, 203, 227, 136, 148, 32, 202,
134, 18, 124, 28, 115, 216, 161, 160,
113, 209, 10, 112, 159, 123, 232, 213,
247, 201, 72, 120, 45, 76, 121, 36,
140, 120, 101, 210, 123, 80, 72, 117,
144, 66, 233, 76, 203, 168, 229, 81,
37, 117, 8, 133, 24, 210, 80, 102,
90, 129, 244, 95, 129, 164, 34, 253,
81, 18, 41, 236, 96, 15, 194, 142,
123, 5, 200, 242, 4, 152, 5, 237,
228, 212, 193, 201, 177, 97, 132, 121,
168, 135, 54, 17, 163, 49, 86, 88,
70, 124, 8, 157, 192, 83, 24, 136,
224, 101, 64, 36, 96, 196, 5, 179,
73, 219, 80, 176, 132, 90, 168, 86,
144, 16, 254, 137, 224, 185, 160, 228,
253, 4, 25, 232, 71, 52, 84, 67,
54, 4, 102, 54, 124, 35, 252, 49,
195, 42, 120, 200, 35, 197, 1, 150,
216, 132, 81, 204, 15, 164, 28, 202,
89, 216, 65, 35, 53, 225, 215, 72,
68, 42, 241, 200, 21, 156, 97, 23,
136, 229, 155, 208, 137, 94, 212, 208,
72, 196, 101, 13, 6, 164, 108, 156,
128, 15, 96, 132, 229, 229, 132, 219,
124, 217, 217, 64, 10, 13, 128, 145,
148, 237, 19, 27, 162, 92, 116, 184,
217, 70, 182, 77, 99, 4, 151, 105,
156, 89, 154, 33, 198, 240, 65, 163,
227, 104, 209, 117, 101, 64, 240, 249,
141, 177, 16, 103, 197, 73, 71, 223,
84, 192, 223, 156, 228, 225, 252, 202,
114, 56, 7, 13, 148, 4, 70, 249,
138, 29, 62, 17, 225, 28, 26, 184,
40, 154, 83, 232, 136, 206, 137, 31,
87, 78, 143, 255, 237, 148, 123, 101,
26, 184, 172, 203, 40, 228, 84, 3,
238, 31, 253, 81, 136, 211, 149, 14,
124, 21, 149, 88, 130, 226, 191, 180,
87, 125, 122, 90, 41, 214, 95, 192,
220, 31, 38, 161, 200, 83, 57, 136,
76, 177, 5, 93, 13, 68, 136, 100,
5, 27, 97, 12, 132, 25, 163, 231,
133, 95, 91, 209, 18, 26, 133, 213,
97, 237, 146, 139, 84, 9, 11, 166,
80, 181, 249, 93, 72, 112, 201, 137,
253, 210, 146, 116, 129, 30, 236, 215,
186, 254, 172, 139, 81, 34, 102, 246,
12, 141, 25, 225, 12, 57, 29, 92,
83, 92, 27, 187, 13, 205, 215, 88,
76, 43, 145, 129, 18, 188, 134, 102,
8, 155, 213, 44, 197, 160, 129, 96,
92, 70, 27, 81, 16, 1, 114, 152,
230, 250, 88, 30, 141, 44, 134, 111,
206, 196, 108, 205, 40, 16, 13, 81,
2, 201, 222, 108, 180, 192, 111, 37,
128, 70, 162, 97, 62, 197, 10, 105,
0, 159, 9, 73, 128, 14, 160, 97,
99, 16, 75, 171, 248, 16, 110, 140,
128, 1, 8, 128, 0, 36, 192, 10,
108, 145, 225, 180, 89, 2, 136, 169,
0, 120, 198, 170, 0, 206, 175, 212,
134, 229, 160, 134, 14, 64, 220, 68,
61, 31, 23, 121, 212, 222, 40, 129,
34, 108, 103, 207, 252, 92, 75, 61,
26, 87, 106, 213, 2, 157, 87, 127,
100, 26, 167, 137, 232, 183, 176, 26,
236, 244, 7, 171, 89, 199, 186, 28,
15, 237, 176, 2, 127, 196, 23, 144,
69, 85, 35, 249, 75, 166, 217, 75,
122, 149, 226, 163, 110, 200, 37, 97,
149, 135, 8, 106, 36, 61, 2, 137,
168, 210, 6, 102, 5, 129, 89, 16,
249, 168, 21, 120, 129, 159, 218, 101,
132, 199, 176, 143, 92, 53, 68, 200,
36, 24, 201, 48, 230, 221, 25, 150,
247, 36, 219, 80, 32, 74, 1, 209,
96, 144, 164, 207, 144, 12, 150, 94,
36, 201, 200, 236, 165, 138, 162, 88,
254, 84, 240, 11, 27, 164, 132, 56,
109, 76, 206, 185, 210, 83, 168, 144,
149, 228, 15, 151, 188, 150, 193, 93,
161, 139, 241, 133, 108, 116, 0, 13,
232, 137, 227, 17, 201, 51, 202, 4,
148, 184, 214, 199, 117, 148, 18, 121,
145, 116, 184, 161, 223, 208, 40, 14,
189, 141, 14, 116, 6, 240, 97, 169,
164, 68, 6, 109, 232, 89, 173, 124,
84, 11, 128, 169, 0, 24, 64, 2,
100, 128, 177, 180, 153, 16, 165, 169,
154, 254, 77, 73, 166, 164, 113, 8,
75, 194, 198, 70, 29, 90, 14, 110,
244, 134, 73, 245, 135, 34, 244, 76,
75, 132, 87, 78, 86, 98, 132, 100,
82, 121, 189, 199, 78, 173, 39, 85,
109, 87, 127, 140, 154, 130, 180, 154,
130, 172, 139, 36, 241, 212, 180, 236,
31, 242, 132, 72, 123, 101, 106, 166,
66, 15, 134, 152, 103, 210, 21, 21,
84, 65, 213, 160, 242, 75, 253, 97,
149, 157, 40, 205, 86, 204, 81, 193,
96, 18, 130, 230, 92, 70, 80, 152,
198, 148, 37, 132, 101, 140, 131, 114,
76, 247, 44, 150, 145, 156, 18, 92,
24, 214, 197, 220, 210, 94, 32, 19,
162, 140, 79, 221, 233, 106, 92, 34,
27, 203, 20, 225, 135, 209, 8, 74,
24, 28, 89, 232, 129, 133, 152, 168,
147, 117, 32, 176, 117, 12, 210, 170,
207, 210, 90, 97, 132, 254, 146, 196,
173, 128, 15, 16, 228, 250, 180, 254,
72, 147, 80, 74, 224, 61, 9, 237,
149, 97, 219, 80, 36, 64, 41, 228,
222, 230, 30, 101, 116, 192, 3, 248,
222, 3, 208, 192, 25, 146, 198, 199,
121, 228, 29, 162, 220, 10, 40, 103,
155, 25, 167, 114, 214, 166, 223, 60,
23, 177, 180, 28, 114, 56, 159, 33,
194, 164, 109, 40, 95, 19, 73, 20,
34, 90, 199, 35, 52, 5, 141, 48,
104, 65, 16, 68, 38, 249, 231, 242,
8, 200, 78, 125, 203, 165, 150, 167,
162, 42, 8, 236, 194, 174, 202, 234,
216, 211, 189, 154, 238, 172, 108, 172,
153, 103, 166, 62, 101, 204, 26, 165,
166, 102, 136, 241, 92, 213, 133, 244,
75, 35, 89, 15, 221, 9, 196, 155,
68, 11, 38, 49, 68, 232, 13, 173,
91, 61, 232, 175, 29, 237, 19, 210,
85, 173, 214, 149, 25, 57, 173, 193,
225, 136, 202, 156, 168, 203, 240, 196,
228, 57, 12, 247, 136, 166, 223, 13,
161, 203, 116, 40, 94, 34, 4, 18,
98, 140, 135, 142, 237, 255, 60, 216,
47, 194, 213, 133, 121, 76, 134, 209,
42, 174, 193, 88, 205, 104, 138, 15,
172, 128, 14, 232, 73, 139, 132, 204,
108, 61, 201, 92, 30, 137, 145, 74,
74, 67, 206, 22, 198, 233, 109, 109,
21, 209, 15, 13, 238, 3, 208, 171,
167, 180, 70, 227, 238, 202, 71, 241,
150, 170, 240, 161, 21, 29, 108, 155,
94, 17, 68, 177, 198, 152, 254, 181,
220, 29, 246, 10, 107, 184, 220, 116,
209, 6, 34, 78, 203, 36, 244, 233,
21, 12, 237, 194, 152, 213, 136, 104,
146, 165, 178, 11, 167, 173, 34, 43,
26, 143, 24, 141, 236, 120, 168, 103,
12, 23, 72, 164, 234, 84, 134, 68,
72, 191, 100, 170, 81, 222, 231, 238,
60, 42, 43, 138, 81, 78, 141, 26,
122, 201, 23, 128, 74, 210, 78, 74,
26, 247, 52, 90, 181, 140, 165, 198,
44, 76, 40, 193, 47, 209, 194, 149,
131, 50, 132, 42, 69, 161, 247, 220,
140, 207, 140, 132, 139, 68, 109, 10,
181, 35, 149, 60, 158, 57, 157, 147,
42, 177, 152, 223, 85, 155, 150, 148,
88, 23, 46, 137, 179, 54, 201, 18,
10, 2, 58, 177, 4, 210, 110, 177,
251, 66, 235, 217, 210, 111, 247, 20,
86, 0, 141, 196, 63, 9, 228, 254,
194, 18, 70, 160, 83, 95, 128, 137,
81, 24, 144, 82, 240, 204, 25, 186,
22, 1, 107, 169, 219, 248, 16, 221,
172, 128, 4, 60, 64, 150, 206, 22,
4, 235, 89, 176, 16, 218, 117, 69,
142, 156, 209, 217, 170, 56, 14, 113,
109, 46, 156, 222, 22, 229, 56, 172,
109, 228, 166, 110, 57, 209, 76, 78,
194, 42, 176, 194, 9, 215, 76, 248,
125, 21, 193, 108, 210, 2, 57, 79,
166, 174, 218, 199, 110, 215, 168, 209,
203, 40, 218, 215, 241, 160, 95, 237,
86, 221, 35, 132, 71, 254, 191, 236,
242, 254, 61, 170, 50, 187, 87, 122,
18, 37, 124, 145, 39, 206, 74, 32,
245, 168, 136, 173, 61, 196, 89, 90,
79, 131, 93, 68, 233, 74, 90, 92,
17, 173, 133, 37, 232, 173, 209, 82,
197, 172, 210, 175, 142, 201, 78, 216,
99, 12, 250, 28, 181, 73, 30, 27,
67, 166, 218, 186, 200, 144, 36, 216,
95, 173, 24, 55, 14, 105, 2, 145,
197, 28, 147, 45, 132, 197, 234, 209,
166, 210, 243, 70, 225, 252, 218, 200,
223, 145, 4, 19, 9, 242, 183, 221,
201, 158, 140, 141, 163, 236, 69, 254,
228, 4, 146, 208, 196, 216, 92, 107,
189, 30, 48, 100, 232, 211, 108, 0,
81, 11, 128, 6, 13, 240, 140, 219,
12, 138, 116, 76, 148, 15, 105, 159,
156, 73, 209, 156, 173, 74, 114, 37,
151, 66, 85, 23, 114, 64, 10, 226,
90, 228, 245, 73, 198, 238, 93, 223,
242, 17, 193, 240, 172, 194, 36, 40,
220, 79, 108, 115, 37, 150, 200, 167,
98, 149, 243, 236, 206, 170, 149, 172,
117, 244, 135, 13, 11, 229, 17, 63,
115, 129, 208, 81, 85, 18, 115, 208,
0, 239, 199, 26, 101, 39, 82, 149,
241, 112, 194, 80, 62, 51, 13, 83,
2, 243, 48, 143, 160, 170, 136, 47,
110, 5, 100, 13, 76, 212, 32, 232,
54, 127, 179, 172, 70, 111, 43, 41,
141, 250, 184, 207, 223, 101, 91, 79,
112, 201, 140, 173, 254, 18, 151, 88,
27, 140, 209, 115, 98, 81, 76, 138,
193, 51, 67, 80, 104, 17, 254, 241,
59, 38, 144, 4, 149, 135, 137, 242,
175, 55, 151, 101, 243, 58, 239, 199,
4, 52, 60, 19, 9, 65, 203, 134,
254, 26, 36, 198, 144, 5, 218, 212,
68, 206, 204, 224, 34, 67, 244, 147,
40, 180, 150, 170, 114, 112, 117, 6,
223, 20, 238, 164, 196, 202, 151, 142,
242, 41, 167, 43, 118, 121, 100, 40,
163, 244, 73, 159, 180, 254, 242, 86,
98, 200, 4, 166, 184, 180, 114, 248,
128, 163, 180, 228, 109, 152, 41, 77,
11, 229, 36, 212, 99, 23, 148, 174,
140, 12, 204, 128, 85, 72, 243, 200,
112, 136, 50, 106, 200, 42, 136, 117,
136, 209, 13, 143, 7, 235, 122, 8,
79, 41, 18, 121, 62, 194, 28, 197,
172, 50, 15, 53, 123, 78, 245, 183,
236, 212, 43, 215, 151, 42, 98, 117,
192, 96, 72, 168, 50, 216, 35, 69,
11, 171, 170, 71, 181, 208, 177, 158,
76, 154, 70, 112, 32, 244, 114, 4,
97, 119, 158, 198, 168, 117, 132, 90,
219, 53, 10, 244, 94, 236, 210, 223,
17, 150, 79, 72, 232, 176, 234, 35,
72, 16, 107, 0, 249, 132, 48, 161,
196, 247, 232, 201, 100, 237, 196, 220,
18, 246, 159, 186, 42, 78, 2, 27,
44, 61, 33, 173, 182, 24, 17, 136,
70, 99, 211, 237, 254, 184, 86, 77,
104, 155, 249, 254, 149, 107, 185, 206,
4, 146, 76, 244, 235, 97, 92, 27,
222, 133, 224, 26, 46, 152, 53, 84,
227, 18, 151, 203, 217, 97, 73, 151,
54, 116, 160, 180, 71, 42, 20, 138,
187, 92, 119, 45, 70, 114, 32, 159,
109, 240, 80, 73, 104, 202, 172, 108,
223, 240, 192, 178, 194, 209, 136, 35,
66, 177, 38, 133, 98, 84, 109, 170,
84, 159, 167, 121, 50, 170, 200, 214,
151, 24, 229, 17, 133, 8, 130, 127,
60, 221, 118, 5, 72, 116, 39, 226,
116, 191, 215, 80, 231, 81, 161, 142,
108, 241, 164, 218, 39, 54, 72, 81,
97, 15, 88, 189, 137, 217, 229, 200,
155, 188, 212, 38, 81, 68, 163, 105,
15, 7, 154, 37, 111, 183, 170, 91,
197, 249, 62, 139, 146, 175, 22, 33,
84, 68, 68, 139, 244, 93, 97, 169,
216, 21, 54, 219, 61, 230, 9, 31,
159, 197, 104, 230, 55, 249, 6, 69,
96, 244, 137, 156, 104, 133, 129, 199,
185, 130, 107, 207, 10, 19, 91, 231,
101, 49, 140, 8, 73, 75, 0, 1,
220, 142, 192, 183, 134, 24, 198, 8,
198, 66, 182, 140, 249, 105, 168, 134,
26, 169, 134, 159, 141, 148, 182, 141,
107, 34, 7, 70, 151, 10, 137, 39,
176, 71, 119, 0, 21, 197, 100, 21,
241, 97, 177, 72, 135, 71, 26, 206,
172, 243, 150, 225, 202, 94, 198, 77,
48, 220, 72, 198, 82, 48, 145, 241,
1, 142, 254, 73, 41, 200, 35, 252,
56, 22, 56, 98, 71, 204, 81, 138,
204, 145, 133, 148, 199, 36, 69, 8,
187, 144, 170, 142, 93, 247, 118, 21,
15, 45, 66, 29, 81, 115, 90, 240,
146, 72, 148, 227, 7, 39, 52, 165,
32, 72, 85, 162, 18, 181, 81, 31,
113, 136, 138, 172, 117, 236, 162, 128,
212, 20, 137, 212, 236, 132, 132, 200,
178, 135, 215, 199, 164, 201, 187, 31,
140, 154, 103, 4, 155, 135, 94, 209,
126, 167, 10, 123, 51, 251, 60, 239,
71, 84, 91, 62, 234, 133, 62, 210,
173, 247, 250, 49, 161, 19, 22, 31,
175, 45, 143, 92, 104, 50, 237, 168,
233, 101, 235, 158, 176, 137, 86, 128,
113, 89, 130, 215, 248, 165, 29, 21,
3, 124, 142, 212, 221, 22, 191, 79,
132, 115, 70, 166, 115, 208, 158, 36,
156, 11, 154, 95, 78, 156, 104, 101,
131, 201, 145, 14, 95, 189, 54, 212,
110, 254, 158, 70, 227, 16, 98, 200,
220, 174, 192, 141, 18, 93, 23, 40,
71, 78, 227, 28, 215, 17, 1, 218,
18, 153, 17, 196, 241, 186, 224, 100,
70, 153, 209, 6, 173, 172, 0, 16,
40, 130, 130, 220, 52, 79, 24, 216,
248, 137, 5, 100, 89, 143, 129, 20,
149, 239, 232, 206, 132, 20, 42, 47,
219, 46, 241, 100, 90, 201, 94, 229,
75, 249, 135, 34, 109, 87, 179, 8,
66, 127, 133, 108, 78, 177, 2, 45,
208, 254, 11, 43, 192, 14, 124, 213,
87, 41, 250, 142, 182, 23, 115, 184,
59, 200, 168, 214, 26, 221, 233, 218,
132, 80, 79, 144, 145, 21, 71, 176,
249, 91, 249, 26, 78, 182, 148, 142,
20, 62, 248, 201, 213, 133, 74, 104,
94, 173, 88, 134, 201, 245, 221, 229,
247, 221, 93, 204, 42, 233, 106, 144,
174, 181, 132, 82, 104, 13, 254, 15,
89, 125, 155, 132, 180, 5, 57, 9,
109, 78, 134, 7, 223, 123, 210, 194,
252, 169, 208, 202, 47, 44, 157, 69,
200, 203, 198, 166, 223, 229, 99, 0,
6, 50, 109, 137, 151, 128, 73, 101,
147, 171, 66, 19, 176, 26, 206, 6,
103, 255, 214, 156, 14, 223, 104, 168,
70, 112, 0, 162, 75, 171, 100, 157,
77, 206, 17, 145, 50, 151, 234, 239,
4, 227, 120, 76, 199, 228, 229, 22,
145, 229, 252, 198, 10, 68, 172, 77,
27, 123, 218, 137, 190, 45, 103, 101,
112, 75, 55, 184, 16, 245, 200, 142,
34, 248, 247, 114, 81, 26, 106, 128,
68, 185, 219, 155, 162, 217, 55, 82,
181, 147, 194, 15, 110, 7, 171, 193,
87, 122, 42, 183, 38, 248, 130, 2,
30, 85, 133, 12, 234, 165, 129, 226,
135, 100, 15, 21, 190, 146, 216, 2,
25, 64, 8, 34, 36, 136, 13, 153,
56, 118, 236, 240, 17, 196, 71, 79,
28, 54, 113, 24, 118, 193, 210, 37,
12, 25, 139, 113, 226, 144, 169, 72,
254, 102, 205, 195, 140, 28, 61, 242,
225, 179, 70, 99, 24, 137, 19, 195,
152, 148, 66, 177, 34, 73, 147, 93,
96, 166, 76, 9, 147, 38, 77, 44,
27, 45, 178, 33, 52, 105, 18, 33,
146, 32, 215, 152, 196, 50, 148, 37,
204, 137, 19, 187, 72, 113, 66, 49,
78, 152, 56, 132, 124, 94, 185, 25,
148, 141, 29, 135, 113, 244, 240, 25,
72, 72, 145, 162, 173, 130, 244, 32,
180, 163, 39, 172, 29, 54, 15, 207,
162, 93, 179, 198, 161, 73, 34, 51,
128, 180, 240, 65, 134, 141, 75, 146,
82, 148, 40, 145, 66, 148, 47, 150,
43, 127, 255, 42, 85, 234, 132, 176,
20, 165, 74, 8, 35, 118, 162, 132,
8, 17, 194, 62, 32, 235, 232, 32,
161, 69, 5, 9, 58, 26, 19, 1,
2, 121, 198, 137, 19, 43, 90, 204,
208, 177, 153, 134, 14, 29, 52, 102,
164, 110, 1, 90, 117, 139, 208, 52,
124, 104, 166, 225, 122, 117, 11, 26,
183, 111, 235, 64, 76, 196, 244, 105,
211, 185, 77, 111, 62, 221, 90, 53,
145, 71, 156, 72, 81, 114, 50, 244,
202, 216, 177, 89, 5, 69, 87, 216,
149, 235, 163, 71, 60, 39, 81, 162,
164, 73, 211, 40, 78, 156, 70, 141,
34, 181, 138, 20, 41, 86, 172, 86,
157, 95, 149, 158, 21, 169, 240, 225,
53, 61, 26, 149, 75, 22, 43, 240,
147, 30, 217, 33, 68, 137, 39, 254,
165, 81, 235, 211, 91, 15, 188, 81,
184, 251, 143, 20, 78, 184, 99, 37,
23, 90, 72, 209, 132, 58, 65, 188,
162, 142, 43, 168, 20, 17, 228, 57,
140, 210, 74, 72, 145, 73, 4, 130,
170, 174, 177, 180, 26, 104, 33, 134,
192, 162, 136, 37, 141, 206, 50, 41,
12, 146, 58, 90, 227, 38, 142, 28,
18, 105, 45, 139, 78, 66, 10, 139,
149, 54, 250, 137, 168, 152, 74, 138,
169, 166, 19, 73, 178, 131, 21, 99,
140, 97, 229, 163, 25, 95, 162, 73,
166, 162, 134, 50, 172, 11, 131, 200,
176, 163, 43, 23, 41, 90, 11, 43,
135, 16, 82, 8, 194, 174, 42, 132,
10, 44, 145, 194, 194, 80, 44, 135,
206, 2, 138, 140, 46, 156, 160, 1,
136, 21, 116, 160, 107, 173, 22, 175,
80, 234, 38, 163, 142, 162, 115, 40,
191, 12, 139, 83, 170, 27, 157, 48,
108, 49, 188, 136, 208, 75, 138, 198,
54, 27, 129, 178, 12, 36, 240, 129,
49, 66, 79, 91, 129, 181, 210, 72,
211, 193, 135, 217, 102, 64, 205, 182,
219, 92, 147, 52, 182, 197, 40, 157,
237, 181, 219, 68, 115, 76, 137, 73,
115, 43, 237, 52, 72, 129, 24, 206,
210, 212, 224, 82, 100, 20, 89, 52,
81, 66, 162, 230, 200, 34, 171, 67,
47, 161, 178, 78, 145, 235, 178, 219,
78, 19, 74, 190, 27, 80, 188, 241,
214, 67, 111, 189, 241, 208, 254, 123,
143, 64, 87, 233, 99, 69, 19, 78,
240, 147, 146, 191, 236, 196, 11, 207,
61, 4, 131, 253, 174, 188, 81, 180,
235, 22, 63, 175, 114, 213, 149, 171,
93, 43, 4, 19, 35, 12, 215, 16,
233, 186, 113, 9, 113, 72, 143, 234,
188, 138, 14, 194, 129, 106, 173, 213,
170, 115, 17, 34, 211, 161, 181, 210,
58, 107, 70, 141, 136, 74, 201, 47,
150, 86, 180, 104, 38, 148, 44, 58,
179, 38, 21, 101, 202, 9, 194, 71,
70, 90, 17, 73, 137, 96, 50, 120,
35, 161, 176, 32, 140, 41, 50, 244,
232, 138, 141, 42, 171, 18, 139, 172,
132, 194, 45, 151, 203, 17, 25, 194,
200, 185, 115, 235, 226, 151, 36, 52,
71, 107, 129, 8, 55, 217, 114, 232,
10, 194, 174, 160, 115, 97, 148, 152,
3, 76, 10, 169, 226, 244, 51, 177,
188, 20, 11, 84, 179, 17, 58, 160,
33, 131, 10, 124, 72, 12, 8, 225,
92, 195, 77, 82, 220, 44, 13, 141,
213, 171, 97, 243, 1, 136, 81, 93,
3, 205, 181, 212, 128, 203, 43, 213,
74, 129, 235, 77, 211, 83, 41, 157,
161, 133, 19, 128, 152, 132, 20, 90,
40, 81, 98, 34, 41, 64, 20, 105,
94, 112, 201, 181, 238, 186, 95, 183,
243, 181, 187, 96, 173, 45, 239, 216,
193, 221, 11, 143, 19, 74, 228, 163,
111, 149, 238, 16, 215, 227, 17, 77,
176, 171, 86, 188, 85, 254, 188, 203,
22, 57, 247, 248, 158, 246, 145, 129,
30, 217, 181, 243, 8, 79, 102, 200,
42, 143, 226, 72, 151, 143, 13, 39,
36, 136, 141, 142, 193, 93, 72, 58,
215, 69, 138, 125, 228, 145, 243, 245,
168, 223, 150, 223, 212, 200, 40, 153,
94, 180, 232, 39, 142, 20, 166, 168,
71, 37, 23, 158, 49, 247, 134, 129,
103, 184, 165, 137, 155, 148, 130, 35,
59, 56, 246, 248, 201, 154, 241, 5,
81, 194, 14, 173, 243, 50, 171, 148,
197, 186, 23, 119, 151, 176, 24, 245,
45, 37, 216, 34, 233, 32, 54, 14,
203, 25, 169, 154, 142, 98, 206, 176,
159, 13, 187, 49, 232, 195, 136, 102,
140, 232, 198, 214, 214, 97, 132, 12,
128, 88, 108, 177, 167, 117, 240, 41,
180, 129, 74, 53, 88, 35, 219, 104,
180, 54, 41, 218, 56, 138, 54, 97,
83, 194, 216, 42, 53, 64, 77, 77,
234, 84, 87, 99, 155, 219, 86, 49,
9, 185, 253, 37, 33, 242, 234, 16,
222, 62, 103, 29, 236, 100, 231, 87,
223, 169, 156, 9, 135, 69, 158, 241,
148, 135, 133, 149, 131, 28, 41, 124,
65, 11, 251, 32, 104, 18, 239, 154,
214, 179, 170, 53, 30, 101, 125, 71,
19, 58, 228, 14, 118, 62, 215, 21,
93, 129, 107, 92, 209, 201, 138, 89,
206, 130, 33, 117, 81, 162, 136, 107,
233, 160, 136, 20, 82, 175, 216, 41,
4, 76, 101, 241, 254, 94, 93, 110,
231, 47, 224, 249, 40, 38, 126, 201,
209, 67, 214, 16, 147, 138, 164, 164,
36, 202, 19, 35, 71, 254, 149, 48,
156, 244, 168, 97, 45, 226, 93, 23,
254, 66, 23, 61, 172, 65, 63, 237,
146, 88, 247, 178, 116, 186, 206, 65,
133, 66, 80, 217, 158, 30, 192, 50,
38, 171, 140, 142, 69, 46, 9, 131,
18, 102, 240, 22, 34, 176, 37, 39,
13, 225, 83, 206, 22, 134, 177, 147,
4, 109, 126, 243, 75, 140, 209, 22,
101, 63, 205, 172, 96, 4, 52, 232,
64, 7, 28, 211, 39, 198, 140, 237,
53, 3, 172, 26, 216, 168, 102, 182,
169, 209, 166, 107, 86, 51, 13, 100,
0, 8, 170, 223, 204, 210, 108, 166,
42, 205, 109, 86, 208, 182, 85, 200,
130, 18, 68, 0, 12, 32, 61, 200,
46, 66, 4, 81, 111, 248, 185, 206,
118, 132, 149, 173, 192, 173, 112, 88,
219, 2, 79, 124, 72, 17, 12, 250,
124, 7, 63, 142, 251, 213, 36, 112,
184, 194, 109, 29, 168, 114, 195, 226,
22, 118, 184, 228, 149, 206, 137, 203,
75, 40, 107, 136, 149, 172, 162, 144,
71, 80, 34, 66, 130, 176, 8, 48,
7, 194, 16, 41, 218, 109, 138, 124,
16, 153, 88, 178, 72, 166, 227, 253,
72, 37, 18, 171, 25, 149, 132, 39,
147, 153, 8, 84, 160, 104, 68, 146,
26, 213, 200, 48, 223, 253, 206, 37,
74, 225, 200, 254, 28, 227, 0, 33,
54, 84, 164, 42, 219, 179, 219, 134,
122, 18, 79, 216, 85, 49, 43, 86,
60, 23, 134, 234, 82, 198, 52, 33,
114, 145, 165, 51, 72, 67, 146, 242,
51, 46, 30, 108, 71, 112, 124, 159,
208, 12, 115, 191, 69, 25, 13, 8,
132, 66, 154, 100, 50, 224, 75, 161,
241, 198, 82, 146, 250, 13, 1, 65,
37, 53, 85, 66, 102, 54, 172, 81,
91, 212, 124, 3, 25, 31, 156, 202,
55, 101, 107, 106, 169, 76, 211, 25,
31, 184, 141, 22, 156, 144, 219, 68,
110, 37, 76, 33, 142, 115, 87, 35,
188, 142, 50, 189, 99, 184, 203, 109,
43, 112, 97, 37, 208, 35, 162, 25,
195, 239, 116, 174, 99, 220, 121, 86,
119, 210, 67, 86, 242, 16, 72, 91,
228, 57, 28, 79, 136, 25, 196, 174,
116, 8, 118, 222, 59, 8, 86, 32,
196, 161, 9, 173, 5, 144, 90, 34,
75, 21, 25, 66, 197, 41, 90, 17,
68, 250, 34, 147, 191, 254, 117, 18,
31, 93, 33, 97, 229, 91, 67, 206,
6, 74, 176, 151, 16, 20, 39, 12,
213, 93, 242, 144, 103, 188, 127, 133,
65, 42, 116, 225, 67, 85, 60, 180,
162, 213, 77, 81, 32, 235, 204, 104,
116, 246, 8, 150, 176, 188, 75, 182,
247, 186, 215, 190, 70, 171, 4, 26,
140, 175, 69, 116, 193, 136, 95, 164,
82, 80, 151, 216, 132, 38, 128, 9,
76, 156, 254, 46, 153, 153, 76, 6,
202, 9, 68, 56, 65, 6, 102, 208,
1, 254, 229, 137, 48, 78, 0, 2,
106, 68, 19, 25, 91, 146, 13, 55,
217, 157, 160, 214, 104, 192, 192, 175,
233, 224, 128, 175, 92, 170, 111, 200,
107, 42, 162, 222, 50, 168, 195, 89,
1, 17, 38, 193, 10, 90, 104, 194,
9, 127, 193, 2, 95, 41, 20, 206,
16, 118, 85, 132, 189, 226, 142, 229,
130, 85, 56, 101, 237, 208, 59, 110,
51, 70, 12, 207, 250, 136, 182, 254,
234, 89, 224, 97, 230, 122, 12, 103,
184, 194, 241, 237, 115, 223, 34, 215,
174, 248, 232, 193, 134, 168, 44, 157,
173, 21, 136, 87, 206, 82, 43, 197,
46, 100, 158, 35, 218, 222, 115, 178,
164, 175, 36, 226, 150, 121, 147, 253,
73, 71, 44, 50, 149, 49, 54, 12,
121, 23, 51, 40, 139, 44, 134, 36,
50, 118, 182, 35, 5, 73, 73, 105,
233, 248, 16, 129, 196, 129, 34, 171,
147, 98, 117, 62, 71, 161, 236, 161,
204, 75, 162, 203, 23, 203, 114, 155,
200, 22, 0, 161, 199, 22, 177, 138,
252, 52, 91, 176, 141, 40, 169, 103,
198, 69, 238, 98, 100, 58, 74, 163,
173, 0, 186, 72, 211, 169, 208, 82,
117, 170, 4, 214, 50, 168, 192, 81,
106, 214, 22, 248, 53, 238, 162, 247,
108, 179, 188, 77, 100, 42, 40, 212,
217, 40, 65, 19, 178, 152, 175, 94,
164, 254, 242, 225, 129, 132, 211, 115,
158, 19, 33, 175, 180, 227, 214, 110,
2, 110, 192, 102, 125, 15, 130, 30,
177, 10, 99, 4, 163, 170, 14, 82,
196, 233, 248, 3, 44, 19, 18, 11,
64, 97, 101, 225, 132, 175, 163, 171,
16, 142, 115, 143, 124, 164, 23, 22,
197, 50, 157, 75, 99, 248, 32, 35,
146, 151, 221, 100, 91, 79, 89, 211,
238, 42, 42, 126, 108, 65, 0, 246,
36, 133, 189, 120, 45, 97, 144, 113,
193, 124, 167, 145, 228, 49, 244, 77,
191, 75, 216, 177, 219, 216, 227, 50,
253, 248, 10, 78, 52, 72, 87, 136,
220, 5, 211, 89, 116, 75, 124, 4,
221, 94, 229, 197, 21, 42, 134, 201,
44, 80, 54, 24, 73, 223, 235, 145,
142, 132, 5, 142, 193, 37, 40, 197,
206, 164, 59, 247, 1, 13, 104, 131,
65, 76, 253, 48, 73, 132, 22, 116,
64, 127, 211, 253, 25, 114, 121, 211,
155, 216, 8, 71, 149, 66, 133, 229,
82, 21, 88, 27, 171, 93, 138, 106,
218, 189, 101, 83, 123, 99, 170, 60,
79, 205, 9, 154, 160, 133, 47, 52,
65, 132, 189, 132, 193, 218, 227, 26,
167, 49, 183, 58, 194, 68, 255, 23,
60, 155, 118, 48, 11, 41, 215, 76,
248, 160, 53, 25, 148, 118, 79, 53,
21, 145, 232, 202, 17, 235, 60, 231,
217, 150, 10, 67, 126, 56, 254, 136,
80, 136, 223, 42, 245, 171, 79, 251,
254, 16, 17, 15, 243, 17, 15, 83,
4, 86, 98, 135, 50, 217, 65, 39,
177, 90, 114, 29, 173, 89, 6, 210,
36, 134, 244, 37, 6, 3, 94, 143,
13, 89, 18, 224, 29, 187, 183, 149,
45, 182, 22, 69, 155, 80, 223, 161,
171, 36, 113, 170, 8, 244, 226, 224,
149, 166, 116, 193, 200, 135, 141, 206,
184, 136, 232, 37, 175, 132, 136, 66,
36, 126, 242, 99, 13, 233, 4, 204,
36, 178, 42, 88, 36, 119, 252, 4,
106, 34, 37, 9, 101, 86, 94, 134,
95, 117, 23, 19, 40, 120, 59, 55,
105, 159, 4, 194, 251, 170, 171, 4,
125, 63, 109, 51, 90, 227, 183, 155,
97, 169, 25, 31, 132, 134, 149, 95,
83, 124, 122, 21, 206, 93, 170, 217,
50, 225, 178, 156, 84, 195, 31, 30,
113, 149, 246, 145, 75, 164, 214, 155,
231, 122, 213, 31, 6, 227, 176, 193,
158, 214, 230, 228, 90, 200, 9, 69,
144, 98, 210, 180, 40, 240, 36, 236,
176, 206, 237, 116, 115, 61, 245, 145,
133, 93, 29, 28, 242, 107, 65, 11,
156, 135, 46, 180, 116, 162, 136, 68,
172, 100, 133, 231, 119, 179, 168, 172,
181, 114, 88, 48, 5, 157, 163, 181,
123, 200, 109, 61, 98, 150, 224, 233,
90, 35, 111, 2, 99, 24, 103, 108,
245, 156, 104, 255, 233, 111, 194, 45,
238, 142, 125, 236, 180, 56, 196, 233,
55, 251, 122, 148, 160, 13, 147, 254,
213, 213, 109, 43, 105, 231, 202, 66,
68, 36, 68, 168, 152, 235, 182, 251,
18, 233, 214, 116, 99, 117, 234, 226,
124, 110, 100, 47, 22, 230, 71, 38,
169, 203, 126, 70, 126, 110, 198, 127,
234, 7, 222, 230, 77, 127, 58, 64,
80, 6, 163, 185, 244, 205, 241, 54,
227, 105, 180, 107, 241, 52, 99, 51,
90, 163, 242, 90, 224, 17, 186, 0,
53, 164, 230, 106, 192, 102, 56, 126,
42, 225, 244, 109, 5, 148, 128, 19,
252, 140, 19, 250, 68, 42, 180, 226,
218, 74, 79, 111, 120, 165, 87, 50,
109, 227, 26, 204, 114, 154, 201, 61,
216, 3, 194, 100, 143, 246, 212, 10,
114, 106, 40, 229, 52, 205, 59, 4,
199, 229, 78, 168, 227, 192, 131, 114,
174, 137, 39, 60, 103, 230, 130, 136,
143, 58, 138, 15, 176, 164, 33, 62,
172, 39, 226, 133, 118, 254, 168, 232,
234, 197, 94, 190, 112, 100, 62, 202,
182, 84, 134, 76, 116, 167, 98, 12,
166, 199, 48, 162, 215, 128, 13, 141,
42, 203, 160, 130, 77, 13, 91, 134,
253, 210, 168, 178, 208, 194, 44, 130,
162, 34, 110, 70, 218, 244, 32, 74,
174, 195, 14, 82, 194, 200, 236, 102,
208, 76, 173, 66, 94, 109, 68, 248,
136, 158, 186, 13, 93, 122, 205, 34,
228, 78, 222, 74, 10, 213, 226, 160,
0, 33, 105, 125, 124, 196, 70, 124,
198, 190, 240, 4, 47, 242, 254, 2,
204, 4, 175, 19, 223, 162, 240, 78,
192, 151, 130, 166, 79, 136, 192, 241,
180, 166, 3, 81, 49, 205, 24, 111,
107, 24, 47, 128, 190, 134, 242, 212,
102, 5, 30, 129, 13, 134, 131, 108,
14, 104, 243, 52, 5, 56, 160, 138,
188, 156, 192, 5, 171, 42, 48, 164,
96, 253, 240, 200, 162, 112, 5, 214,
140, 238, 131, 192, 37, 132, 160, 48,
111, 120, 98, 88, 34, 173, 228, 170,
234, 174, 118, 162, 64, 88, 168, 229,
208, 227, 90, 118, 72, 88, 8, 164,
248, 174, 169, 115, 44, 108, 115, 4,
66, 36, 172, 226, 156, 72, 198, 65,
248, 104, 144, 114, 199, 101, 220, 176,
144, 66, 106, 70, 202, 132, 215, 138,
77, 199, 94, 2, 37, 94, 12, 45,
222, 81, 180, 140, 103, 161, 246, 145,
95, 210, 98, 30, 139, 141, 234, 148,
205, 199, 52, 194, 235, 216, 96, 36,
244, 128, 39, 0, 49, 12, 14, 146,
138, 42, 174, 156, 60, 104, 196, 198,
49, 118, 222, 238, 31, 199, 72, 238,
128, 0, 46, 232, 34, 137, 238, 110,
1, 137, 139, 139, 140, 66, 79, 224,
103, 47, 10, 16, 240, 222, 237, 1,
17, 169, 147, 70, 224, 4, 150, 99,
19, 7, 165, 3, 91, 177, 166, 26,
3, 224, 182, 38, 47, 50, 163, 49,
200, 235, 168, 212, 70, 39, 5, 97,
13, 114, 242, 53, 34, 136, 205, 58,
207, 84, 88, 229, 52, 254, 90, 224,
23, 101, 33, 23, 70, 97, 160, 230,
17, 45, 40, 10, 35, 70, 38, 31,
59, 130, 195, 198, 240, 32, 234, 70,
44, 200, 32, 85, 136, 128, 16, 220,
227, 17, 88, 129, 25, 40, 77, 60,
238, 99, 64, 56, 173, 62, 230, 170,
174, 134, 15, 65, 188, 227, 87, 66,
173, 171, 48, 78, 175, 160, 200, 182,
204, 2, 144, 214, 169, 156, 246, 101,
125, 44, 70, 69, 248, 201, 70, 88,
194, 47, 152, 227, 78, 206, 136, 98,
36, 139, 251, 248, 101, 13, 13, 42,
164, 128, 194, 31, 11, 162, 183, 6,
242, 197, 220, 144, 234, 18, 179, 101,
44, 194, 32, 17, 242, 15, 139, 108,
123, 206, 14, 34, 113, 206, 213, 180,
98, 232, 68, 231, 175, 250, 165, 36,
30, 17, 46, 216, 162, 219, 16, 34,
165, 48, 75, 48, 77, 164, 30, 93,
82, 48, 132, 17, 240, 18, 15, 204,
154, 107, 5, 78, 64, 7, 78, 96,
2, 251, 238, 47, 24, 3, 224, 134,
82, 82, 158, 166, 49, 138, 198, 104,
206, 107, 243, 76, 133, 15, 200, 96,
127, 58, 96, 5, 68, 131, 189, 36,
168, 187, 184, 139, 54, 83, 227, 4,
248, 204, 207, 72, 161, 232, 68, 164,
226, 72, 100, 75, 178, 237, 58, 139,
9, 59, 18, 173, 91, 184, 99, 90,
38, 129, 15, 128, 224, 4, 90, 192,
121, 248, 192, 43, 153, 225, 192, 88,
65, 22, 214, 202, 254, 87, 144, 3,
64, 62, 109, 192, 76, 232, 112, 194,
211, 152, 134, 168, 208, 242, 139, 16,
68, 167, 33, 116, 46, 44, 20, 98,
152, 232, 165, 15, 225, 136, 33, 65,
106, 42, 91, 102, 233, 20, 52, 45,
18, 106, 141, 28, 83, 119, 124, 109,
1, 95, 228, 31, 55, 18, 31, 255,
81, 233, 64, 98, 14, 185, 110, 30,
159, 142, 31, 91, 228, 119, 226, 232,
32, 215, 192, 113, 242, 67, 254, 58,
8, 191, 92, 39, 34, 145, 17, 118,
78, 44, 95, 188, 199, 144, 164, 128,
6, 148, 96, 202, 212, 226, 74, 92,
74, 42, 140, 66, 140, 114, 180, 239,
94, 170, 71, 253, 228, 71, 101, 19,
47, 102, 128, 77, 78, 96, 4, 136,
224, 40, 0, 67, 51, 134, 244, 185,
62, 105, 105, 50, 128, 109, 222, 199,
184, 94, 202, 1, 237, 231, 55, 137,
128, 15, 186, 64, 2, 4, 64, 0,
42, 64, 46, 104, 137, 56, 43, 133,
85, 102, 99, 4, 70, 64, 57, 39,
176, 207, 124, 97, 21, 248, 243, 180,
12, 10, 238, 210, 69, 156, 114, 5,
175, 214, 233, 173, 126, 104, 163, 6,
17, 42, 126, 133, 15, 124, 224, 51,
204, 44, 14, 100, 161, 228, 98, 200,
89, 28, 4, 155, 76, 8, 64, 40,
39, 246, 172, 101, 64, 196, 115, 18,
54, 68, 136, 48, 138, 81, 247, 202,
110, 236, 197, 123, 162, 164, 213, 192,
100, 162, 252, 254, 130, 12, 236, 41,
140, 202, 109, 79, 74, 43, 100, 198,
228, 163, 190, 231, 76, 190, 108, 79,
112, 226, 10, 30, 104, 51, 150, 195,
183, 220, 145, 116, 136, 145, 17, 63,
42, 101, 200, 2, 238, 208, 239, 198,
36, 243, 77, 42, 230, 32, 87, 39,
254, 200, 14, 152, 50, 115, 59, 145,
79, 75, 190, 98, 232, 186, 71, 84,
27, 74, 81, 114, 9, 45, 232, 194,
42, 202, 173, 165, 144, 34, 73, 124,
205, 103, 242, 164, 20, 43, 176, 79,
220, 173, 186, 222, 98, 4, 58, 227,
189, 238, 36, 48, 124, 128, 147, 42,
160, 2, 12, 64, 2, 200, 245, 1,
30, 96, 4, 148, 224, 203, 118, 163,
19, 217, 85, 185, 84, 145, 16, 186,
224, 1, 182, 52, 1, 70, 32, 170,
164, 134, 56, 219, 108, 5, 62, 233,
51, 206, 84, 65, 86, 97, 68, 194,
192, 74, 193, 140, 49, 156, 32, 61,
247, 115, 132, 72, 200, 173, 30, 129,
12, 254, 242, 140, 226, 128, 59, 248,
192, 54, 63, 105, 37, 177, 224, 43,
39, 45, 23, 236, 131, 157, 176, 233,
191, 136, 229, 211, 200, 10, 57, 170,
229, 9, 223, 146, 81, 79, 111, 87,
240, 47, 158, 102, 203, 42, 22, 10,
34, 58, 10, 16, 111, 36, 93, 244,
0, 11, 4, 239, 20, 3, 229, 105,
176, 224, 32, 144, 238, 175, 74, 199,
95, 194, 224, 20, 35, 175, 166, 250,
228, 73, 254, 176, 160, 166, 194, 171,
127, 176, 224, 251, 84, 171, 102, 214,
79, 196, 144, 232, 201, 98, 135, 63,
195, 162, 95, 74, 71, 180, 72, 103,
30, 83, 130, 45, 44, 36, 61, 21,
97, 33, 1, 203, 212, 202, 169, 117,
158, 150, 58, 226, 101, 219, 92, 116,
144, 144, 232, 46, 20, 69, 102, 174,
228, 250, 236, 32, 165, 80, 162, 30,
41, 102, 125, 188, 140, 146, 74, 17,
54, 19, 35, 241, 58, 35, 188, 140,
244, 78, 128, 75, 50, 44, 163, 3,
18, 128, 92, 45, 227, 1, 164, 83,
41, 208, 230, 108, 96, 67, 51, 50,
163, 241, 150, 138, 16, 176, 192, 0,
182, 212, 0, 58, 32, 76, 245, 236,
94, 187, 75, 95, 59, 160, 76, 51,
64, 9, 40, 65, 65, 170, 83, 36,
200, 64, 185, 16, 111, 57, 180, 22,
237, 250, 235, 152, 186, 165, 22, 131,
231, 98, 216, 98, 59, 4, 193, 7,
164, 43, 3, 62, 137, 8, 86, 129,
25, 146, 193, 24, 234, 99, 89, 54,
54, 155, 230, 106, 133, 230, 42, 112,
16, 36, 115, 78, 207, 152, 48, 14,
87, 232, 133, 144, 242, 16, 70, 172,
112, 100, 36, 66, 9, 200, 0, 44,
10, 208, 47, 93, 51, 12, 194, 144,
177, 146, 174, 11, 242, 194, 221, 118,
195, 9, 86, 4, 11, 74, 195, 53,
32, 195, 9, 220, 164, 36, 10, 226,
31, 59, 98, 144, 162, 178, 162, 128,
201, 254, 158, 2, 201, 42, 207, 167,
216, 106, 45, 164, 202, 228, 73, 198,
34, 107, 187, 162, 15, 79, 42, 68,
4, 205, 107, 69, 164, 181, 50, 44,
34, 105, 135, 12, 247, 229, 10, 154,
38, 151, 176, 226, 94, 200, 162, 89,
185, 79, 53, 119, 196, 103, 220, 199,
71, 43, 80, 49, 234, 103, 53, 116,
192, 81, 90, 242, 47, 137, 0, 105,
144, 230, 1, 36, 160, 2, 150, 166,
2, 86, 32, 49, 176, 75, 81, 22,
3, 108, 100, 50, 51, 148, 74, 7,
4, 225, 10, 32, 119, 75, 59, 192,
106, 150, 83, 225, 240, 117, 72, 201,
212, 51, 50, 160, 225, 88, 193, 23,
72, 225, 143, 62, 74, 250, 166, 227,
58, 104, 176, 191, 82, 143, 212, 12,
237, 208, 178, 35, 98, 195, 181, 3,
60, 88, 9, 72, 193, 118, 141, 65,
134, 26, 100, 67, 220, 10, 135, 172,
5, 230, 66, 78, 114, 158, 233, 89,
120, 197, 248, 244, 230, 117, 62, 19,
49, 167, 135, 45, 172, 240, 94, 110,
68, 9, 216, 32, 144, 250, 143, 101,
234, 70, 182, 202, 34, 76, 48, 100,
103, 225, 144, 140, 114, 226, 10, 86,
195, 81, 68, 131, 123, 153, 142, 33,
115, 7, 139, 170, 146, 109, 59, 42,
128, 57, 204, 57, 164, 246, 118, 172,
2, 252, 14, 130, 125, 25, 181, 15,
217, 194, 86, 76, 109, 94, 62, 140,
136, 184, 196, 120, 155, 204, 201, 102,
254, 245, 177, 174, 96, 107, 18, 201,
125, 197, 194, 109, 105, 140, 71, 250,
210, 190, 132, 241, 222, 234, 235, 71,
175, 245, 126, 134, 116, 242, 70, 177,
165, 176, 183, 142, 79, 192, 50, 92,
57, 3, 88, 80, 41, 96, 82, 242,
94, 233, 132, 125, 246, 149, 4, 65,
10, 32, 215, 0, 12, 160, 147, 196,
148, 189, 136, 115, 56, 214, 134, 54,
91, 96, 4, 112, 152, 65, 144, 15,
158, 74, 102, 171, 182, 34, 92, 250,
75, 59, 250, 99, 45, 131, 55, 120,
51, 141, 15, 104, 64, 2, 150, 70,
2, 58, 192, 9, 106, 151, 25, 2,
245, 172, 252, 166, 62, 255, 3, 64,
148, 80, 114, 174, 165, 91, 16, 167,
208, 200, 37, 158, 228, 105, 86, 113,
167, 200, 58, 194, 201, 154, 34, 78,
206, 120, 28, 165, 227, 176, 102, 75,
177, 190, 16, 33, 184, 237, 144, 61,
202, 77, 157, 96, 73, 205, 83, 70,
221, 228, 35, 178, 207, 95, 66, 166,
146, 73, 199, 57, 80, 44, 45, 192,
100, 44, 166, 246, 124, 239, 48, 106,
97, 2, 107, 79, 135, 39, 20, 185,
162, 230, 101, 92, 122, 226, 97, 196,
81, 66, 46, 172, 143, 72, 172, 94,
158, 140, 13, 174, 64, 55, 50, 89,
100, 238, 46, 184, 202, 104, 198, 186,
8, 71, 123, 102, 1, 41, 73, 41,
144, 75, 104, 74, 120, 5, 80, 217,
151, 2, 42, 41, 102, 131, 188, 254,
38, 35, 92, 51, 0, 150, 21, 195,
79, 138, 38, 3, 21, 183, 166, 24,
23, 8, 114, 121, 75, 183, 116, 4,
46, 69, 243, 132, 10, 189, 82, 67,
188, 70, 64, 10, 40, 97, 151, 72,
65, 219, 96, 45, 87, 136, 136, 156,
172, 205, 45, 17, 118, 7, 153, 80,
230, 180, 67, 16, 104, 128, 131, 43,
224, 1, 182, 121, 21, 0, 181, 61,
190, 99, 63, 0, 7, 133, 12, 100,
151, 218, 67, 133, 154, 9, 65, 50,
205, 194, 214, 185, 127, 171, 104, 116,
10, 66, 34, 172, 36, 144, 30, 130,
12, 226, 36, 93, 38, 100, 255, 64,
4, 101, 94, 103, 164, 255, 72, 165,
91, 22, 164, 200, 68, 10, 86, 227,
147, 108, 195, 121, 119, 214, 31, 149,
14, 45, 116, 246, 163, 172, 210, 141,
145, 168, 63, 237, 224, 234, 106, 244,
156, 42, 58, 162, 32, 132, 63, 70,
66, 142, 28, 249, 226, 68, 109, 66,
54, 71, 237, 34, 25, 138, 100, 199,
250, 76, 90, 7, 70, 10, 197, 102,
181, 89, 215, 168, 140, 152, 68, 178,
54, 17, 79, 42, 169, 186, 34, 88,
109, 226, 34, 149, 223, 22, 123, 79,
128, 85, 12, 197, 73, 133, 186, 48,
232, 103, 81, 98, 50, 51, 124, 202,
7, 150, 154, 169, 79, 64, 23, 153,
74, 134, 167, 38, 109, 138, 217, 170,
205, 99, 20, 154, 44, 51, 39, 36,
66, 240, 74, 201, 134, 200, 254, 59,
141, 73, 172, 235, 147, 193, 40, 193,
154, 5, 32, 112, 3, 23, 8, 56,
193, 23, 22, 196, 174, 52, 1, 174,
193, 170, 138, 3, 228, 61, 98, 79,
230, 160, 112, 208, 244, 175, 145, 107,
203, 255, 134, 226, 124, 237, 41, 95,
24, 182, 217, 62, 76, 94, 204, 142,
63, 193, 34, 219, 88, 203, 237, 52,
121, 82, 161, 76, 178, 87, 82, 91,
117, 3, 198, 132, 77, 105, 19, 20,
161, 87, 140, 179, 193, 16, 75, 198,
228, 123, 160, 174, 42, 74, 167, 180,
193, 34, 229, 198, 243, 124, 1, 41,
255, 14, 251, 100, 246, 55, 232, 82,
199, 196, 58, 138, 179, 209, 135, 6,
210, 132, 8, 150, 15, 58, 244, 0,
142, 16, 198, 233, 206, 112, 38, 226,
182, 83, 253, 174, 71, 251, 164, 48,
116, 11, 46, 244, 245, 72, 247, 100,
34, 148, 96, 37, 39, 219, 131, 63,
88, 58, 253, 231, 48, 140, 102, 113,
173, 148, 113, 85, 248, 10, 152, 58,
1, 86, 160, 52, 178, 171, 166, 240,
204, 108, 180, 235, 168, 186, 187, 135,
88, 97, 20, 34, 53, 64, 45, 46,
227, 34, 185, 45, 85, 156, 132, 250,
3, 112, 56, 14, 157, 221, 219, 92,
19, 32, 167, 30, 33, 25, 146, 129,
133, 16, 100, 67, 34, 12, 135, 62,
142, 172, 158, 165, 191, 53, 199, 193,
35, 100, 198, 147, 121, 116, 10, 146,
178, 116, 14, 162, 231, 254, 217, 9,
214, 128, 58, 140, 78, 88, 181, 36,
156, 52, 138, 138, 138, 177, 88, 75,
154, 13, 156, 128, 149, 149, 147, 124,
206, 88, 17, 38, 74, 49, 113, 199,
118, 16, 58, 84, 203, 48, 137, 10,
57, 216, 146, 173, 202, 42, 250, 32,
109, 72, 19, 4, 225, 42, 152, 15,
192, 29, 245, 65, 110, 197, 213, 54,
211, 201, 210, 216, 164, 103, 224, 211,
129, 128, 101, 153, 175, 199, 127, 102,
35, 159, 174, 32, 248, 50, 1, 253,
18, 184, 54, 241, 102, 108, 250, 200,
43, 56, 128, 184, 53, 184, 134, 2,
8, 144, 230, 54, 195, 213, 149, 37,
0, 93, 71, 119, 166, 20, 247, 202,
53, 16, 224, 86, 152, 169, 123, 153,
108, 20, 165, 102, 85, 201, 167, 126,
99, 39, 231, 237, 10, 226, 147, 19,
134, 105, 59, 205, 123, 171, 70, 173,
152, 180, 3, 209, 118, 111, 209, 58,
14, 153, 204, 186, 131, 131, 154, 5,
39, 225, 28, 194, 193, 193, 248, 99,
152, 120, 8, 9, 15, 68, 135, 142,
165, 112, 40, 167, 227, 158, 176, 231,
166, 104, 66, 18, 171, 67, 200, 113,
126, 255, 66, 181, 172, 136, 13, 248,
132, 13, 196, 182, 51, 55, 106, 127,
249, 26, 12, 205, 54, 84, 85, 221,
194, 247, 231, 203, 45, 91, 22, 140,
65, 145, 125, 11, 178, 94, 222, 137,
32, 26, 33, 44, 244, 67, 35, 250,
49, 23, 10, 141, 254, 124, 237, 73,
206, 216, 134, 40, 161, 39, 197, 216,
145, 65, 232, 65, 146, 17, 214, 132,
78, 33, 84, 253, 177, 164, 192, 182,
167, 44, 33, 102, 107, 33, 208, 228,
10, 78, 231, 72, 18, 102, 71, 125,
109, 96, 248, 86, 74, 69, 18, 166,
12, 99, 242, 174, 107, 6, 228, 38,
110, 101, 22, 105, 244, 181, 131, 165,
188, 2, 188, 61, 130, 129, 19, 20,
109, 18, 133, 77, 131, 15, 30, 151,
169, 181, 181, 82, 96, 41, 205, 244,
141, 169, 102, 17, 52, 138, 244, 10,
252, 99, 113, 66, 100, 67, 122, 46,
177, 61, 90, 175, 136, 9, 63, 228,
84, 212, 196, 214, 208, 184, 67, 16,
116, 32, 173, 43, 224, 133, 165, 64,
19, 216, 33, 28, 158, 133, 18, 54,
76, 17, 194, 179, 90, 10, 213, 60,
128, 240, 63, 20, 254, 174, 196, 69,
177, 125, 88, 118, 252, 47, 90, 121,
190, 33, 240, 176, 0, 215, 0, 237,
8, 1, 122, 46, 115, 193, 169, 136,
177, 57, 157, 69, 26, 70, 34, 84,
11, 125, 50, 224, 1, 100, 23, 52,
184, 55, 14, 114, 161, 26, 4, 97,
140, 58, 52, 97, 60, 252, 141, 245,
137, 49, 55, 210, 216, 54, 60, 253,
108, 223, 137, 0, 233, 136, 13, 92,
25, 11, 173, 115, 144, 143, 198, 181,
36, 64, 83, 182, 12, 89, 236, 10,
112, 60, 165, 231, 168, 37, 128, 139,
16, 52, 1, 254, 215, 130, 109, 71,
227, 22, 104, 12, 166, 70, 142, 2,
130, 47, 121, 183, 134, 244, 72, 37,
43, 12, 156, 192, 60, 105, 179, 73,
183, 93, 58, 111, 134, 80, 206, 235,
19, 111, 114, 107, 52, 67, 82, 0,
34, 142, 19, 1, 4, 5, 140, 152,
65, 131, 134, 14, 29, 62, 26, 42,
244, 161, 35, 161, 66, 26, 51, 90,
156, 24, 177, 98, 68, 7, 41, 147,
40, 145, 162, 164, 135, 16, 33, 78,
178, 86, 233, 193, 114, 229, 10, 150,
53, 147, 62, 42, 34, 164, 232, 145,
162, 153, 52, 99, 62, 146, 249, 136,
80, 28, 50, 93, 194, 172, 233, 210,
133, 204, 79, 54, 148, 52, 241, 161,
33, 193, 128, 129, 12, 51, 164, 80,
74, 247, 77, 19, 37, 62, 78, 136,
92, 33, 164, 73, 170, 38, 82, 156,
186, 142, 34, 5, 150, 211, 168, 174,
94, 71, 153, 149, 58, 73, 38, 204,
153, 132, 248, 232, 97, 19, 39, 174,
30, 61, 118, 230, 198, 93, 179, 134,
167, 202, 48, 108, 236, 196, 97, 147,
247, 138, 19, 37, 107, 102, 222, 124,
20, 70, 137, 15, 34, 88, 236, 60,
154, 68, 72, 16, 31, 65, 148, 249,
240, 169, 75, 183, 110, 28, 59, 97,
86, 74, 249, 188, 230, 138, 18, 44,
100, 216, 232, 145, 242, 64, 66, 135,
14, 43, 102, 56, 33, 19, 39, 87,
52, 62, 61, 195, 8, 150, 114, 37,
140, 208, 254, 53, 128, 121, 227, 101,
3, 23, 238, 206, 188, 100, 138, 11,
5, 76, 38, 140, 110, 159, 121, 149,
11, 77, 14, 52, 185, 105, 65, 154,
56, 9, 210, 109, 154, 15, 161, 195,
143, 103, 66, 182, 108, 89, 178, 219,
185, 224, 181, 235, 217, 28, 247, 47,
92, 188, 120, 165, 184, 166, 65, 36,
14, 221, 43, 16, 165, 96, 249, 108,
199, 78, 94, 226, 120, 161, 135, 1,
138, 69, 128, 42, 229, 86, 92, 103,
1, 2, 136, 219, 103, 87, 124, 230,
132, 14, 45, 0, 65, 195, 10, 163,
169, 84, 155, 18, 35, 104, 148, 65,
7, 25, 100, 80, 129, 4, 25, 156,
224, 132, 20, 78, 64, 148, 16, 66,
64, 124, 166, 4, 17, 74, 164, 72,
68, 139, 64, 52, 20, 134, 15, 4,
37, 240, 192, 65, 20, 49, 212, 80,
68, 10, 69, 180, 80, 68, 21, 105,
116, 81, 6, 78, 60, 66, 9, 39,
147, 232, 65, 217, 40, 180, 152, 180,
160, 20, 61, 61, 66, 202, 36, 49,
41, 34, 37, 77, 220, 217, 164, 136,
32, 108, 36, 39, 212, 127, 62, 241,
69, 201, 36, 130, 232, 32, 129, 0,
6, 116, 48, 195, 21, 79, 69, 53,
201, 26, 8, 41, 33, 72, 152, 69,
114, 146, 213, 88, 97, 117, 149, 85,
117, 100, 229, 153, 22, 76, 34, 101,
41, 200, 92, 231, 213, 5, 222, 121,
189, 117, 150, 82, 23, 107, 216, 1,
220, 254, 127, 87, 168, 200, 70, 90,
52, 177, 209, 5, 110, 100, 8, 50,
201, 36, 147, 77, 22, 153, 100, 122,
184, 149, 95, 126, 113, 40, 199, 134,
19, 41, 117, 54, 218, 162, 124, 96,
241, 64, 2, 27, 174, 208, 130, 20,
188, 209, 50, 27, 128, 68, 48, 52,
154, 113, 251, 253, 198, 94, 111, 200,
61, 39, 148, 122, 197, 17, 39, 84,
79, 92, 118, 6, 96, 95, 88, 141,
114, 157, 162, 118, 76, 134, 83, 78,
52, 5, 42, 104, 161, 130, 86, 123,
94, 122, 188, 245, 102, 156, 20, 52,
40, 49, 131, 15, 166, 177, 65, 196,
12, 51, 88, 149, 210, 93, 181, 213,
166, 92, 23, 40, 225, 134, 82, 74,
184, 1, 245, 31, 22, 238, 202, 251,
89, 190, 78, 56, 65, 195, 9, 64,
204, 176, 2, 16, 183, 201, 171, 3,
135, 21, 60, 80, 65, 135, 18, 84,
240, 161, 169, 82, 188, 72, 4, 16,
11, 133, 40, 5, 139, 85, 173, 168,
196, 139, 62, 56, 209, 66, 65, 6,
140, 208, 130, 185, 52, 188, 184, 80,
66, 37, 247, 104, 110, 11, 25, 93,
56, 194, 21, 143, 112, 242, 17, 146,
88, 145, 194, 172, 122, 117, 21, 73,
201, 77, 88, 26, 246, 88, 90, 135,
181, 21, 158, 120, 226, 41, 18, 38,
31, 64, 100, 144, 218, 135, 68, 60,
114, 78, 84, 136, 189, 201, 199, 77,
29, 137, 101, 214, 87, 85, 107, 146,
254, 105, 81, 116, 82, 82, 84, 149,
148, 85, 246, 41, 121, 207, 94, 203,
40, 163, 121, 221, 103, 239, 162, 120,
253, 55, 152, 18, 108, 252, 76, 25,
93, 242, 9, 34, 210, 120, 159, 142,
119, 153, 168, 127, 225, 21, 215, 113,
192, 165, 55, 23, 22, 29, 164, 198,
90, 154, 179, 70, 163, 71, 79, 244,
69, 4, 4, 105, 203, 21, 184, 156,
110, 196, 109, 57, 236, 174, 128, 125,
105, 28, 79, 64, 245, 20, 111, 79,
249, 97, 5, 18, 169, 207, 10, 242,
146, 72, 127, 18, 146, 25, 182, 153,
213, 197, 186, 95, 234, 241, 74, 92,
24, 13, 58, 177, 130, 14, 125, 173,
225, 3, 70, 39, 166, 20, 231, 168,
202, 117, 214, 238, 187, 184, 13, 184,
224, 21, 0, 6, 24, 175, 130, 12,
238, 235, 237, 12, 64, 180, 208, 129,
192, 77, 134, 72, 67, 194, 9, 36,
32, 1, 246, 26, 86, 176, 130, 195,
131, 237, 187, 226, 96, 42, 70, 220,
98, 249, 64, 188, 120, 66, 5, 5,
9, 208, 65, 200, 51, 232, 0, 68,
196, 39, 211, 144, 35, 69, 176, 174,
208, 193, 8, 23, 113, 164, 201, 40,
147, 216, 65, 183, 181, 148, 46, 50,
55, 89, 203, 97, 94, 98, 152, 162,
228, 108, 59, 8, 228, 217, 1, 187,
131, 58, 31, 72, 32, 53, 220, 35,
194, 36, 206, 145, 13, 77, 60, 130,
12, 45, 160, 129, 20, 226, 0, 254,
19, 34, 85, 237, 43, 164, 88, 197,
40, 178, 242, 8, 78, 21, 240, 49,
210, 178, 204, 181, 94, 40, 55, 244,
4, 39, 57, 162, 49, 30, 25, 206,
115, 54, 220, 56, 97, 13, 72, 18,
207, 181, 10, 5, 28, 225, 4, 113,
111, 192, 242, 201, 229, 214, 144, 158,
189, 225, 197, 9, 39, 200, 94, 6,
90, 160, 3, 210, 172, 129, 86, 39,
177, 205, 191, 194, 133, 133, 118, 253,
46, 115, 186, 41, 98, 23, 217, 211,
159, 223, 53, 231, 63, 209, 65, 149,
19, 130, 82, 23, 69, 100, 133, 15,
62, 153, 219, 215, 232, 198, 150, 182,
8, 10, 51, 171, 11, 149, 222, 130,
19, 68, 246, 232, 198, 61, 74, 104,
129, 184, 24, 5, 132, 139, 156, 72,
68, 152, 162, 84, 240, 142, 199, 32,
149, 216, 11, 37, 139, 68, 94, 130,
242, 5, 73, 17, 233, 32, 96, 45,
24, 129, 18, 54, 119, 47, 29, 116,
72, 41, 52, 170, 192, 246, 78, 64,
132, 125, 129, 79, 124, 228, 59, 223,
249, 124, 112, 74, 28, 173, 143, 32,
21, 56, 65, 200, 20, 162, 177, 29,
245, 72, 7, 230, 170, 200, 9, 110,
185, 130, 19, 72, 225, 101, 81, 18,
4, 145, 138, 114, 194, 76, 69, 38,
50, 147, 161, 82, 86, 184, 70, 9,
99, 110, 45, 83, 213, 57, 102, 152,
178, 86, 36, 173, 16, 66, 7, 102,
98, 24, 40, 153, 150, 141, 254, 156,
133, 97, 5, 18, 98, 3, 31, 168,
52, 39, 170, 133, 229, 152, 157, 34,
93, 207, 164, 21, 40, 59, 214, 69,
50, 161, 218, 140, 95, 158, 243, 19,
209, 216, 39, 12, 140, 130, 78, 188,
226, 96, 153, 237, 68, 38, 75, 84,
146, 18, 233, 252, 36, 153, 186, 205,
49, 108, 97, 195, 204, 101, 92, 152,
31, 41, 100, 96, 41, 39, 104, 205,
74, 216, 192, 10, 102, 156, 164, 11,
87, 184, 162, 192, 218, 69, 47, 159,
112, 73, 87, 205, 57, 78, 229, 198,
24, 188, 189, 64, 71, 68, 65, 145,
143, 34, 198, 114, 157, 48, 196, 129,
50, 195, 52, 157, 233, 92, 72, 30,
187, 105, 38, 137, 113, 241, 11, 183,
158, 35, 187, 115, 133, 203, 52, 113,
32, 66, 134, 6, 233, 4, 184, 144,
1, 121, 25, 117, 36, 188, 140, 69,
81, 162, 34, 47, 37, 76, 149, 215,
190, 250, 5, 161, 22, 56, 129, 140,
239, 34, 83, 6, 18, 192, 73, 15,
173, 198, 95, 138, 116, 151, 136, 244,
21, 62, 17, 181, 109, 124, 30, 51,
83, 6, 184, 25, 178, 134, 56, 132,
71, 61, 162, 72, 200, 114, 153, 203,
19, 92, 97, 18, 163, 88, 69, 152,
196, 105, 215, 19, 134, 4, 104, 190,
156, 132, 158, 158, 153, 181, 99, 86,
7, 44, 52, 27, 5, 37, 100, 225,
11, 86, 140, 133, 44, 211, 92, 24,
107, 86, 176, 180, 112, 254, 68, 69,
17, 88, 64, 8, 17, 200, 160, 29,
104, 10, 214, 44, 105, 241, 167, 1,
51, 37, 45, 57, 214, 148, 80, 140,
146, 203, 91, 246, 83, 156, 74, 153,
42, 139, 122, 232, 40, 218, 240, 57,
25, 79, 9, 2, 128, 47, 49, 103,
78, 226, 160, 40, 61, 64, 6, 147,
0, 244, 148, 58, 77, 51, 71, 133,
38, 32, 127, 43, 160, 129, 20, 87,
145, 140, 137, 86, 20, 150, 4, 234,
162, 22, 251, 163, 43, 205, 105, 116,
87, 107, 32, 35, 70, 131, 82, 221,
74, 73, 1, 59, 113, 56, 41, 179,
122, 178, 82, 186, 5, 240, 159, 157,
154, 139, 65, 205, 235, 58, 249, 136,
42, 136, 55, 125, 14, 31, 25, 226,
77, 59, 16, 161, 137, 58, 168, 138,
192, 42, 21, 191, 121, 233, 198, 168,
123, 169, 151, 189, 82, 178, 72, 119,
9, 104, 120, 249, 138, 144, 196, 116,
112, 201, 38, 173, 136, 6, 215, 43,
8, 246, 36, 160, 145, 232, 45, 82,
37, 131, 177, 143, 88, 29, 246, 162,
243, 17, 161, 33, 234, 91, 223, 3,
182, 250, 62, 84, 250, 96, 71, 245,
139, 72, 11, 84, 118, 75, 141, 236,
242, 43, 68, 162, 25, 214, 40, 65,
29, 69, 108, 166, 52, 208, 10, 19,
221, 30, 195, 21, 241, 98, 170, 127,
95, 225, 132, 233, 70, 33, 139, 81,
100, 41, 154, 99, 122, 128, 1, 30,
240, 33, 31, 40, 254, 2, 131, 201,
12, 67, 69, 128, 16, 134, 144, 28,
16, 180, 68, 146, 18, 76, 36, 67,
58, 191, 62, 147, 45, 190, 213, 91,
92, 254, 246, 43, 227, 96, 97, 181,
198, 59, 173, 152, 187, 32, 31, 186,
24, 7, 128, 71, 148, 25, 109, 128,
0, 192, 71, 104, 226, 45, 68, 144,
2, 109, 7, 181, 134, 3, 185, 11,
188, 2, 233, 144, 39, 67, 54, 213,
53, 144, 34, 24, 113, 48, 30, 22,
110, 133, 96, 236, 238, 134, 163, 27,
141, 29, 115, 122, 147, 158, 228, 96,
39, 140, 35, 149, 162, 95, 20, 209,
21, 65, 228, 101, 165, 87, 174, 173,
76, 60, 69, 151, 23, 122, 185, 47,
232, 149, 225, 110, 216, 115, 133, 111,
41, 196, 155, 61, 197, 95, 113, 41,
226, 188, 73, 62, 200, 9, 43, 201,
243, 129, 136, 234, 223, 120, 233, 89,
192, 248, 10, 17, 191, 90, 80, 46,
96, 47, 8, 124, 183, 74, 64, 5,
18, 64, 16, 8, 227, 111, 67, 62,
32, 77, 23, 104, 217, 144, 15, 146,
193, 9, 64, 160, 245, 21, 244, 7,
69, 34, 208, 224, 32, 25, 48, 147,
1, 4, 96, 236, 15, 133, 248, 192,
179, 44, 153, 253, 184, 121, 130, 252,
205, 117, 20, 138, 85, 146, 44, 248,
73, 137, 85, 68, 230, 52, 118, 32,
68, 71, 176, 230, 24, 89, 232, 219,
23, 171, 144, 55, 31, 120, 124, 194,
203, 8, 194, 254, 127, 138, 224, 3,
108, 70, 162, 9, 65, 248, 0, 171,
75, 241, 224, 35, 190, 81, 13, 49,
85, 118, 100, 81, 254, 103, 77, 12,
51, 64, 150, 18, 9, 107, 50, 169,
173, 120, 218, 233, 23, 215, 245, 102,
87, 60, 177, 15, 74, 194, 192, 7,
192, 244, 133, 72, 5, 207, 79, 226,
116, 35, 136, 56, 8, 104, 135, 114,
171, 148, 105, 52, 195, 134, 0, 201,
39, 231, 111, 11, 77, 23, 244, 176,
193, 49, 155, 234, 104, 18, 80, 54,
176, 237, 197, 9, 95, 216, 129, 52,
100, 136, 216, 198, 72, 163, 114, 228,
80, 119, 234, 187, 241, 149, 77, 123,
181, 183, 56, 100, 215, 120, 124, 185,
52, 74, 55, 205, 210, 55, 18, 19,
84, 173, 91, 93, 18, 239, 54, 168,
108, 229, 17, 48, 87, 112, 13, 20,
241, 201, 134, 163, 229, 239, 150, 29,
56, 1, 253, 104, 128, 166, 19, 41,
138, 12, 20, 242, 18, 189, 130, 210,
147, 205, 5, 111, 169, 95, 109, 30,
184, 78, 160, 4, 6, 173, 72, 219,
29, 72, 72, 6, 70, 64, 132, 48,
52, 111, 100, 93, 0, 204, 182, 81,
137, 133, 85, 85, 4, 193, 68, 40,
46, 174, 16, 237, 131, 25, 156, 192,
200, 216, 171, 0, 200, 68, 12, 145,
89, 166, 222, 173, 185, 212, 223, 10,
176, 48, 137, 85, 208, 34, 23, 179,
151, 5, 33, 0, 211, 133, 156, 92,
198, 9, 254, 113, 248, 101, 90, 72,
231, 204, 76, 209, 197, 79, 132, 208,
15, 108, 90, 34, 19, 190, 101, 69,
16, 64, 88, 152, 4, 78, 208, 5,
234, 64, 252, 17, 39, 65, 229, 21,
104, 139, 19, 2, 230, 100, 152, 66,
35, 29, 209, 184, 236, 67, 242, 144,
141, 117, 125, 25, 45, 112, 214, 70,
26, 67, 241, 161, 40, 172, 224, 132,
34, 204, 214, 57, 90, 210, 207, 7,
176, 1, 14, 23, 141, 243, 187, 67,
43, 225, 250, 146, 207, 61, 33, 248,
222, 32, 22, 145, 48, 220, 3, 69,
41, 225, 4, 163, 16, 12, 118, 96,
104, 229, 115, 73, 139, 242, 101, 96,
212, 94, 209, 21, 28, 95, 54, 68,
232, 145, 30, 71, 244, 55, 250, 129,
105, 163, 128, 58, 207, 34, 64, 0,
245, 53, 117, 132, 25, 237, 180, 25,
5, 149, 102, 134, 50, 114, 121, 230,
3, 244, 225, 54, 161, 209, 2, 12,
163, 33, 23, 145, 63, 80, 148, 17,
45, 160, 4, 93, 36, 96, 130, 71,
70, 61, 177, 54, 152, 20, 47, 195,
70, 49, 16, 114, 43, 231, 146, 47,
137, 247, 60, 173, 161, 34, 100, 240,
24, 244, 17, 63, 103, 196, 19, 51,
112, 86, 15, 130, 5, 43, 96, 0,
174, 82, 59, 74, 64, 74, 45, 50,
2, 11, 177, 97, 11, 245, 0, 31,
6, 69, 36, 83, 110, 38, 67, 3,
42, 131, 86, 140, 177, 6, 190, 196,
10, 254, 193, 144, 11, 172, 64, 9,
100, 112, 132, 151, 116, 31, 68, 176,
40, 153, 161, 29, 44, 148, 66, 161,
113, 5, 124, 135, 133, 131, 1, 33,
58, 112, 5, 151, 145, 115, 185, 81,
36, 138, 64, 4, 29, 224, 73, 74,
246, 21, 225, 80, 13, 143, 16, 7,
82, 176, 24, 107, 96, 111, 29, 161,
64, 247, 230, 51, 82, 34, 53, 207,
196, 53, 84, 38, 53, 58, 195, 51,
60, 115, 58, 116, 99, 25, 54, 21,
23, 160, 2, 66, 35, 209, 114, 127,
113, 104, 241, 67, 75, 230, 2, 136,
188, 113, 129, 96, 212, 28, 93, 160,
4, 240, 99, 74, 64, 112, 131, 218,
198, 16, 0, 131, 136, 117, 215, 65,
86, 177, 47, 171, 32, 81, 196, 150,
34, 123, 248, 55, 242, 161, 30, 66,
244, 27, 163, 53, 90, 161, 150, 58,
230, 5, 141, 25, 40, 40, 221, 213,
99, 69, 33, 21, 92, 131, 22, 208,
20, 38, 56, 129, 113, 16, 244, 39,
3, 84, 78, 48, 181, 94, 90, 23,
26, 88, 120, 2, 25, 194, 26, 126,
228, 3, 33, 83, 109, 161, 7, 4,
138, 242, 43, 191, 131, 73, 206, 181,
131, 247, 210, 84, 96, 181, 47, 42,
210, 135, 166, 226, 32, 253, 130, 38,
163, 17, 6, 18, 83, 134, 68, 16,
120, 218, 6, 107, 219, 134, 108, 53,
2, 108, 95, 34, 24, 74, 240, 0,
174, 4, 108, 68, 48, 2, 2, 128,
254, 100, 29, 196, 16, 11, 145, 122,
8, 81, 34, 0, 211, 65, 198, 179,
127, 186, 81, 101, 122, 208, 32, 12,
97, 17, 238, 3, 63, 185, 2, 28,
177, 21, 55, 89, 55, 68, 117, 177,
6, 242, 183, 86, 93, 208, 21, 138,
96, 33, 171, 97, 65, 171, 64, 10,
16, 55, 21, 93, 16, 63, 63, 23,
40, 177, 5, 19, 29, 209, 113, 220,
1, 90, 153, 82, 148, 151, 200, 141,
253, 116, 64, 13, 52, 19, 212, 82,
130, 45, 39, 42, 129, 162, 27, 95,
102, 27, 38, 39, 24, 17, 179, 32,
149, 183, 37, 213, 165, 71, 245, 114,
43, 37, 210, 65, 39, 166, 33, 176,
146, 98, 81, 248, 74, 62, 144, 120,
163, 144, 12, 118, 160, 86, 168, 84,
103, 165, 33, 28, 34, 151, 68, 132,
226, 66, 150, 225, 78, 49, 85, 71,
117, 116, 118, 55, 161, 7, 138, 192,
10, 172, 80, 88, 139, 213, 63, 91,
147, 39, 199, 148, 22, 200, 132, 152,
157, 101, 148, 70, 57, 64, 165, 35,
30, 46, 68, 6, 223, 130, 5, 22,
209, 80, 8, 129, 74, 9, 113, 34,
25, 99, 21, 20, 232, 104, 98, 180,
31, 191, 227, 119, 40, 97, 143, 247,
56, 60, 85, 201, 119, 10, 81, 73,
32, 51, 2, 101, 200, 50, 140, 129,
18, 226, 163, 153, 14, 82, 1, 71,
246, 68, 8, 230, 108, 82, 160, 26,
17, 210, 1, 161, 4, 61, 32, 254,
131, 35, 56, 146, 35, 35, 38, 122,
185, 20, 69, 21, 229, 36, 89, 196,
119, 21, 165, 50, 101, 216, 80, 104,
233, 36, 188, 241, 41, 219, 177, 137,
146, 2, 142, 88, 70, 25, 107, 176,
109, 176, 194, 16, 151, 213, 17, 138,
32, 5, 45, 34, 5, 100, 224, 17,
163, 80, 13, 201, 32, 71, 91, 2,
116, 89, 98, 94, 115, 163, 22, 164,
243, 147, 112, 164, 51, 34, 17, 118,
120, 67, 30, 66, 99, 55, 162, 56,
142, 113, 194, 7, 43, 245, 63, 127,
225, 37, 247, 241, 61, 255, 149, 34,
239, 24, 26, 231, 179, 120, 88, 24,
49, 7, 54, 156, 238, 67, 63, 51,
112, 33, 173, 113, 142, 117, 151, 75,
191, 24, 120, 154, 64, 11, 216, 105,
46, 209, 22, 20, 194, 193, 140, 233,
17, 91, 218, 241, 39, 212, 178, 41,
229, 1, 141, 50, 197, 58, 235, 167,
41, 132, 192, 21, 114, 178, 88, 87,
19, 77, 10, 132, 22, 48, 106, 141,
128, 133, 152, 155, 120, 64, 242, 105,
151, 156, 209, 80, 7, 134, 139, 42,
98, 31, 13, 137, 133, 0, 214, 25,
105, 214, 101, 119, 121, 117, 92, 100,
68, 228, 200, 27, 85, 23, 44, 197,
161, 117, 211, 163, 143, 25, 99, 74,
229, 227, 34, 78, 151, 35, 17, 49,
2, 74, 161, 26, 29, 180, 24, 11,
67, 17, 26, 17, 34, 19, 138, 74,
24, 153, 160, 36, 242, 86, 254, 51,
192, 23, 62, 65, 23, 108, 32, 5,
11, 65, 153, 50, 216, 2, 87, 0,
23, 161, 178, 158, 15, 216, 131, 202,
1, 160, 98, 181, 97, 42, 243, 62,
87, 128, 23, 163, 19, 80, 202, 68,
39, 204, 224, 11, 59, 38, 88, 121,
130, 39, 99, 177, 88, 120, 226, 51,
200, 116, 141, 222, 177, 141, 52, 33,
159, 196, 103, 157, 47, 49, 30, 174,
67, 71, 5, 149, 31, 72, 84, 93,
247, 97, 31, 247, 146, 47, 89, 68,
109, 251, 119, 104, 11, 65, 50, 213,
118, 62, 38, 55, 96, 85, 129, 16,
47, 8, 134, 174, 193, 67, 184, 165,
9, 185, 192, 166, 64, 160, 17, 51,
128, 5, 232, 145, 94, 33, 23, 114,
229, 65, 58, 236, 134, 147, 253, 198,
129, 227, 81, 130, 171, 115, 45, 50,
71, 79, 159, 162, 158, 111, 97, 7,
213, 33, 11, 180, 64, 11, 172, 128,
147, 39, 100, 141, 123, 162, 39, 99,
209, 76, 82, 99, 24, 213, 145, 51,
234, 169, 117, 20, 85, 60, 18, 105,
122, 35, 115, 62, 209, 183, 10, 137,
101, 7, 20, 85, 82, 107, 80, 49,
125, 97, 78, 157, 18, 138, 116, 67,
6, 25, 195, 34, 88, 240, 70, 63,
105, 55, 48, 101, 40, 213, 5, 29,
155, 99, 47, 245, 66, 33, 194, 147,
47, 138, 212, 32, 29, 160, 20, 25,
130, 142, 21, 112, 62, 43, 144, 33,
212, 6, 69, 175, 4, 254, 63, 45,
146, 49, 194, 73, 17, 83, 101, 127,
135, 134, 119, 28, 146, 1, 11, 113,
17, 62, 16, 101, 40, 184, 117, 21,
99, 160, 165, 81, 21, 109, 99, 170,
241, 227, 34, 163, 193, 6, 190, 116,
24, 214, 120, 173, 39, 164, 9, 132,
74, 29, 130, 217, 76, 48, 83, 53,
120, 66, 53, 120, 162, 53, 127, 41,
172, 91, 65, 88, 92, 211, 51, 89,
163, 22, 23, 39, 90, 127, 163, 146,
151, 218, 78, 231, 231, 37, 160, 233,
40, 131, 65, 32, 35, 134, 74, 231,
227, 4, 75, 23, 158, 231, 199, 27,
146, 247, 60, 77, 161, 4, 249, 19,
46, 55, 68, 23, 93, 64, 9, 180,
96, 7, 67, 181, 2, 72, 230, 3,
248, 52, 142, 187, 186, 78, 148, 113,
82, 193, 144, 12, 209, 192, 12, 204,
80, 13, 198, 224, 126, 172, 83, 130,
116, 26, 91, 118, 240, 142, 47, 33,
37, 97, 3, 27, 36, 193, 12, 209,
96, 12, 198, 192, 134, 75, 66, 22,
35, 68, 66, 38, 244, 21, 171, 128,
53, 156, 176, 137, 213, 161, 158, 100,
240, 157, 180, 116, 98, 39, 6, 48,
13, 5, 136, 74, 232, 11, 223, 144,
14, 236, 112, 14, 190, 0, 99, 127,
18, 6, 245, 245, 31, 81, 211, 39,
23, 231, 29, 207, 166, 16, 230, 34,
5, 113, 116, 175, 213, 178, 146, 35,
151, 90, 246, 226, 175, 7, 66, 70,
77, 69, 187, 136, 254, 50, 34, 22,
241, 109, 6, 112, 142, 241, 3, 133,
2, 160, 75, 71, 56, 156, 192, 121,
62, 176, 182, 127, 129, 184, 116, 45,
144, 61, 3, 24, 48, 253, 66, 144,
157, 234, 135, 47, 178, 145, 163, 97,
47, 151, 241, 23, 219, 229, 28, 188,
129, 25, 230, 68, 137, 82, 145, 179,
102, 65, 53, 154, 96, 12, 180, 240,
111, 139, 85, 173, 86, 35, 22, 116,
146, 21, 235, 235, 184, 90, 179, 10,
210, 42, 11, 164, 160, 39, 38, 116,
141, 155, 104, 163, 24, 87, 91, 118,
145, 30, 249, 177, 41, 119, 3, 30,
127, 161, 30, 6, 194, 46, 120, 90,
49, 166, 50, 177, 88, 136, 27, 108,
32, 59, 88, 112, 126, 67, 21, 108,
26, 65, 144, 229, 226, 60, 31, 187,
116, 3, 199, 192, 97, 208, 47, 220,
131, 114, 252, 235, 78, 46, 87, 159,
153, 37, 11, 193, 64, 184, 190, 80,
190, 144, 17, 106, 207, 114, 169, 0,
76, 6, 81, 116, 30, 243, 218, 56,
213, 21, 7, 91, 1, 173, 178, 32,
173, 96, 17, 163, 121, 226, 178, 46,
91, 37, 234, 201, 58, 124, 232, 143,
11, 227, 73, 231, 136, 17, 177, 50,
9, 185, 144, 12, 225, 192, 14, 247,
112, 15, 249, 112, 15, 225, 96, 12,
171, 32, 22, 147, 240, 108, 43, 2,
4, 152, 5, 106, 154, 154, 31, 99,
150, 160, 2, 115, 183, 238, 68, 83,
125, 145, 71, 254, 33, 37, 24, 77,
130, 47, 144, 36, 74, 20, 3, 47,
13, 9, 33, 233, 99, 0, 43, 32,
1, 240, 51, 3, 179, 41, 1, 62,
32, 5, 233, 67, 199, 175, 166, 145,
25, 186, 138, 88, 224, 3, 136, 120,
48, 170, 145, 63, 24, 17, 46, 194,
41, 50, 13, 17, 63, 137, 167, 72,
235, 56, 85, 202, 177, 67, 31, 42,
118, 219, 247, 24, 200, 180, 53, 93,
3, 180, 185, 176, 10, 118, 64, 37,
120, 184, 29, 82, 49, 201, 146, 242,
39, 155, 248, 39, 146, 178, 125, 54,
81, 37, 165, 156, 37, 99, 87, 25,
216, 75, 142, 187, 65, 129, 52, 149,
140, 177, 83, 60, 170, 53, 60, 35,
114, 145, 225, 114, 74, 86, 58, 62,
147, 52, 119, 118, 183, 97, 117, 118,
43, 145, 167, 117, 83, 75, 8, 121,
118, 5, 17, 193, 77, 74, 0, 27,
217, 242, 104, 249, 33, 28, 161, 246,
77, 47, 129, 76, 239, 167, 30, 163,
21, 42, 28, 154, 106, 161, 148, 49,
39, 182, 49, 185, 65, 151, 233, 68,
130, 111, 113, 23, 28, 202, 94, 122,
36, 178, 16, 194, 176, 7, 211, 42,
74, 113, 100, 170, 113, 16, 118, 96,
12, 231, 192, 14, 75, 156, 15, 245,
156, 15, 236, 144, 13, 198, 128, 201,
143, 224, 24, 222, 73, 113, 154, 179,
57, 0, 6, 160, 24, 83, 140, 206,
193, 180, 206, 145, 131, 123, 198, 84,
98, 213, 254, 135, 13, 109, 62, 137,
252, 208, 40, 75, 110, 181, 52, 3,
121, 215, 2, 72, 243, 97, 117, 182,
24, 41, 98, 31, 87, 36, 50, 97,
122, 17, 19, 132, 100, 217, 147, 63,
190, 168, 3, 42, 98, 60, 138, 114,
151, 61, 148, 56, 57, 98, 131, 89,
148, 134, 65, 235, 51, 166, 252, 75,
237, 75, 39, 87, 227, 184, 147, 80,
18, 231, 139, 179, 213, 161, 168, 84,
163, 168, 117, 245, 151, 96, 161, 190,
216, 186, 190, 61, 118, 22, 235, 91,
152, 58, 220, 51, 168, 11, 40, 196,
7, 213, 225, 136, 67, 67, 69, 33,
165, 129, 91, 219, 182, 61, 34, 173,
85, 11, 147, 33, 69, 252, 142, 140,
162, 4, 223, 130, 95, 141, 193, 70,
142, 193, 27, 93, 64, 144, 58, 224,
47, 152, 53, 118, 110, 193, 82, 223,
40, 18, 241, 246, 151, 172, 240, 172,
163, 240, 8, 214, 25, 64, 33, 68,
124, 45, 12, 66, 117, 241, 48, 88,
176, 34, 89, 132, 70, 112, 20, 194,
149, 129, 101, 8, 20, 66, 124, 208,
169, 144, 168, 145, 77, 244, 109, 216,
83, 133, 215, 163, 85, 29, 100, 7,
204, 208, 185, 76, 156, 15, 252, 80,
207, 247, 112, 14, 229, 201, 9, 142,
193, 12, 201, 64, 6, 173, 17, 104,
86, 187, 140, 228, 210, 86, 58, 16,
101, 173, 99, 129, 74, 196, 30, 146,
118, 93, 180, 123, 32, 247, 200, 60,
105, 254, 108, 219, 163, 65, 59, 126,
36, 122, 225, 226, 160, 52, 242, 0,
103, 91, 23, 48, 193, 40, 180, 209,
138, 128, 232, 3, 185, 52, 200, 35,
80, 109, 65, 21, 144, 112, 129, 36,
49, 225, 87, 100, 33, 78, 164, 64,
8, 21, 147, 24, 52, 160, 7, 94,
49, 191, 115, 109, 195, 253, 214, 111,
127, 105, 195, 207, 10, 173, 208, 234,
11, 185, 96, 222, 178, 144, 116, 180,
224, 151, 180, 55, 222, 226, 61, 222,
236, 109, 222, 190, 16, 12, 243, 205,
222, 38, 92, 222, 229, 59, 194, 185,
224, 11, 190, 64, 11, 250, 54, 215,
210, 250, 221, 56, 121, 39, 92, 161,
21, 239, 155, 152, 136, 185, 148, 165,
227, 173, 91, 194, 131, 6, 87, 134,
29, 128, 108, 235, 99, 0, 12, 211,
74, 239, 67, 144, 125, 41, 99, 144,
120, 210, 15, 195, 24, 184, 37, 8,
164, 240, 164, 104, 150, 16, 151, 4,
116, 29, 55, 37, 219, 177, 152, 126,
197, 10, 180, 16, 12, 209, 144, 12,
111, 155, 11, 254, 35, 211, 223, 59,
157, 228, 130, 21, 111, 17, 17, 251,
210, 56, 146, 75, 6, 127, 34, 22,
154, 0, 221, 50, 173, 64, 214, 72,
10, 143, 240, 19, 212, 6, 48, 0,
51, 155, 222, 38, 217, 223, 182, 48,
167, 23, 7, 201, 208, 185, 236, 144,
14, 241, 208, 196, 155, 13, 197, 255,
195, 10, 223, 192, 12, 107, 112, 33,
254, 62, 208, 5, 33, 247, 193, 99,
99, 144, 8, 161, 3, 61, 14, 67,
30, 172, 45, 41, 40, 105, 129, 7,
32, 2, 246, 46, 195, 134, 198, 162,
180, 93, 78, 128, 17, 161, 215, 1,
240, 19, 33, 126, 102, 59, 196, 244,
8, 128, 49, 103, 2, 41, 48, 103,
157, 49, 9, 81, 103, 217, 77, 8,
97, 0, 112, 94, 65, 212, 36, 84,
66, 154, 192, 174, 202, 225, 26, 88,
209, 63, 225, 237, 223, 54, 12, 222,
116, 173, 111, 179, 7, 223, 208, 106,
222, 180, 64, 18, 239, 198, 10, 180,
167, 111, 37, 33, 222, 159, 62, 222,
158, 94, 222, 185, 80, 234, 253, 221,
221, 171, 80, 18, 43, 254, 234, 222,
77, 88, 2, 78, 224, 203, 100, 148,
190, 39, 148, 231, 116, 226, 166, 243,
70, 163, 72, 44, 109, 234, 35, 112,
117, 17, 175, 244, 62, 141, 227, 77,
117, 131, 181, 52, 48, 85, 252, 178,
24, 80, 118, 29, 161, 212, 5, 180,
67, 81, 178, 226, 125, 148, 122, 113,
82, 35, 212, 60, 171, 65, 220, 120,
24, 41, 158, 37, 88, 16, 69, 146,
167, 4, 11, 85, 59, 161, 84, 107,
128, 173, 204, 194, 36, 103, 97, 18,
163, 67, 94, 20, 197, 60, 102, 58,
16, 97, 28, 242, 133, 74, 49, 35,
143, 221, 74, 58, 16, 158, 171, 144,
13, 24, 84, 13, 231, 16, 15, 245,
204, 15, 252, 112, 15, 217, 176, 254,
223, 112, 43, 11, 110, 226, 74, 59,
100, 127, 191, 129, 28, 109, 19, 62,
90, 57, 129, 156, 73, 114, 92, 180,
103, 132, 55, 231, 223, 131, 133, 8,
122, 160, 43, 162, 3, 171, 81, 92,
27, 11, 33, 26, 145, 48, 45, 179,
169, 148, 130, 102, 109, 231, 74, 244,
131, 27, 183, 210, 122, 249, 115, 131,
42, 161, 101, 53, 138, 137, 139, 89,
104, 43, 209, 71, 63, 135, 36, 114,
166, 195, 51, 10, 163, 215, 122, 212,
63, 237, 184, 241, 27, 39, 149, 28,
88, 205, 100, 211, 216, 218, 76, 149,
56, 37, 108, 177, 113, 134, 57, 157,
153, 66, 19, 51, 29, 66, 159, 54,
159, 63, 105, 169, 65, 19, 55, 41,
188, 94, 196, 241, 40, 3, 218, 132,
200, 147, 69, 182, 97, 42, 83, 185,
19, 88, 40, 181, 120, 65, 81, 125,
212, 26, 203, 105, 50, 148, 114, 73,
30, 216, 82, 47, 229, 102, 134, 170,
64, 252, 52, 111, 12, 164, 22, 243,
150, 174, 81, 164, 23, 218, 38, 122,
190, 40, 167, 128, 157, 27, 164, 6,
162, 46, 229, 39, 220, 152, 114, 178,
67, 239, 72, 134, 209, 17, 62, 35,
15, 0, 110, 13, 211, 22, 163, 144,
11, 223, 16, 14, 209, 144, 13, 236,
144, 217, 5, 207, 15, 241, 144, 14,
231, 16, 12, 97, 210, 83, 23, 65,
3, 123, 8, 79, 219, 194, 6, 143,
146, 97, 86, 1, 27, 73, 254, 100,
181, 93, 84, 32, 5, 82, 187, 63,
40, 34, 225, 179, 143, 4, 205, 34,
18, 27, 63, 207, 147, 1, 117, 92,
1, 240, 65, 239, 22, 30, 34, 91,
2, 216, 225, 41, 5, 149, 244, 33,
131, 19, 200, 19, 196, 48, 21, 76,
23, 133, 177, 152, 44, 36, 64, 51,
209, 250, 88, 160, 7, 97, 96, 131,
123, 69, 36, 101, 65, 66, 35, 4,
22, 223, 173, 233, 238, 253, 172, 237,
231, 11, 239, 6, 235, 165, 46, 173,
224, 93, 234, 236, 15, 224, 222, 237,
162, 57, 243, 24, 154, 224, 221, 241,
91, 66, 52, 3, 212, 55, 27, 212,
214, 234, 76, 154, 8, 16, 148, 38,
13, 124, 84, 208, 224, 35, 69, 138,
8, 45, 20, 36, 136, 143, 32, 50,
64, 124, 232, 160, 168, 99, 13, 33,
65, 11, 9, 41, 18, 20, 135, 12,
153, 53, 113, 244, 196, 193, 130, 69,
162, 20, 61, 27, 9, 197, 241, 241,
32, 65, 133, 25, 74, 200, 196, 145,
242, 49, 140, 157, 73, 148, 116, 14,
212, 169, 73, 224, 192, 156, 164, 124,
5, 51, 150, 203, 151, 47, 86, 156,
56, 249, 164, 228, 83, 147, 79, 160,
5, 217, 0, 17, 68, 73, 209, 35,
59, 93, 128, 172, 56, 65, 67, 7,
16, 41, 108, 244, 164, 228, 196, 74,
147, 162, 166, 76, 123, 106, 82, 170,
116, 146, 30, 54, 97, 148, 180, 200,
80, 161, 238, 3, 3, 254, 2, 244,
26, 72, 144, 192, 128, 129, 12, 43,
128, 32, 156, 196, 234, 91, 58, 102,
193, 194, 221, 227, 215, 152, 95, 62,
118, 204, 226, 132, 137, 115, 69, 199,
138, 17, 39, 124, 144, 177, 163, 135,
143, 231, 135, 132, 176, 232, 152, 81,
154, 134, 148, 134, 124, 84, 171, 182,
211, 154, 13, 155, 53, 32, 101, 135,
161, 221, 197, 118, 151, 146, 88, 164,
56, 145, 210, 123, 119, 111, 39, 188,
133, 11, 87, 162, 68, 10, 150, 25,
25, 36, 56, 201, 160, 131, 183, 15,
62, 138, 216, 196, 177, 202, 135, 16,
27, 39, 107, 20, 173, 41, 78, 132,
244, 138, 14, 117, 79, 40, 193, 169,
137, 149, 47, 74, 118, 72, 173, 34,
213, 190, 253, 40, 78, 238, 73, 61,
10, 115, 229, 17, 37, 41, 51, 226,
76, 210, 196, 158, 150, 47, 90, 104,
201, 37, 23, 1, 9, 52, 202, 168,
161, 130, 81, 112, 65, 99, 146, 49,
38, 24, 95, 86, 73, 134, 150, 71,
100, 25, 234, 40, 12, 19, 132, 80,
65, 4, 125, 25, 48, 23, 89, 88,
161, 69, 150, 245, 86, 81, 106, 149,
243, 2, 12, 48, 68, 86, 66, 92,
229, 69, 246, 218, 131, 113, 20, 26,
105, 36, 101, 148, 167, 158, 210, 105,
199, 29, 39, 121, 196, 199, 130, 38,
73, 104, 200, 132, 40, 89, 131, 6,
36, 125, 240, 129, 8, 156, 130, 220,
17, 35, 59, 96, 254, 35, 35, 140,
146, 128, 152, 1, 8, 177, 236, 240,
72, 9, 176, 128, 184, 98, 141, 207,
136, 112, 98, 38, 66, 216, 90, 106,
45, 29, 123, 42, 203, 151, 6, 135,
50, 134, 196, 51, 115, 76, 19, 168,
73, 200, 32, 34, 37, 216, 124, 104,
161, 5, 26, 100, 90, 131, 59, 38,
249, 32, 131, 16, 179, 208, 146, 243,
41, 78, 106, 164, 81, 19, 62, 90,
11, 67, 207, 204, 58, 144, 64, 128,
188, 4, 232, 107, 47, 9, 78, 104,
193, 14, 74, 244, 160, 133, 157, 123,
206, 169, 38, 157, 124, 28, 123, 44,
30, 90, 156, 80, 194, 36, 26, 48,
235, 160, 3, 32, 214, 208, 163, 51,
213, 28, 50, 105, 34, 31, 128, 192,
98, 181, 89, 199, 114, 237, 207, 216,
194, 248, 104, 202, 46, 194, 40, 22,
183, 146, 174, 184, 194, 55, 223, 134,
11, 238, 217, 221, 138, 11, 174, 213,
17, 156, 24, 129, 136, 43, 228, 154,
100, 148, 53, 216, 32, 69, 19, 216,
224, 10, 67, 143, 48, 128, 32, 66,
137, 47, 163, 188, 66, 9, 39, 226,
248, 81, 144, 71, 88, 33, 100, 141,
81, 96, 140, 209, 61, 26, 141, 188,
194, 142, 81, 248, 160, 129, 8, 120,
41, 161, 81, 196, 2, 11, 252, 144,
192, 2, 49, 28, 208, 195, 11, 105,
33, 101, 194, 120, 9, 148, 69, 197,
137, 11, 150, 69, 98, 89, 50, 102,
133, 21, 24, 254, 191, 213, 49, 167,
178, 66, 100, 113, 70, 51, 105, 108,
75, 41, 168, 248, 91, 138, 167, 168,
136, 124, 4, 35, 66, 30, 178, 14,
163, 90, 63, 35, 87, 138, 226, 216,
197, 98, 13, 59, 106, 29, 146, 102,
62, 226, 210, 77, 10, 34, 74, 67,
247, 10, 44, 186, 184, 130, 13, 65,
148, 182, 205, 137, 211, 186, 96, 250,
160, 132, 22, 50, 232, 170, 31, 183,
125, 15, 62, 166, 130, 60, 8, 33,
132, 56, 146, 194, 7, 222, 148, 32,
98, 5, 9, 30, 168, 96, 5, 29,
148, 108, 161, 3, 34, 226, 152, 76,
164, 232, 194, 86, 104, 161, 159, 57,
154, 117, 50, 37, 72, 107, 225, 132,
12, 92, 210, 75, 237, 7, 44, 205,
32, 3, 88, 245, 160, 164, 154, 124,
242, 185, 7, 84, 83, 27, 139, 71,
22, 43, 191, 186, 194, 9, 34, 90,
24, 97, 5, 39, 132, 53, 150, 54,
50, 148, 86, 86, 138, 43, 186, 248,
115, 88, 144, 186, 93, 131, 182, 218,
74, 178, 45, 233, 220, 148, 29, 61,
56, 118, 115, 102, 87, 213, 115, 205,
53, 155, 8, 222, 125, 64, 82, 135,
43, 50, 240, 225, 10, 50, 148, 120,
68, 147, 48, 156, 176, 35, 140, 222,
220, 29, 72, 144, 53, 164, 208, 161,
79, 202, 234, 227, 29, 136, 233, 149,
96, 254, 10, 69, 160, 10, 187, 160,
171, 20, 33, 169, 139, 135, 164, 15,
227, 238, 254, 133, 248, 203, 113, 41,
68, 81, 70, 180, 198, 165, 226, 71,
153, 18, 86, 70, 169, 234, 204, 30,
121, 218, 241, 80, 159, 216, 7, 106,
127, 74, 196, 135, 19, 105, 241, 223,
144, 126, 116, 21, 31, 1, 101, 72,
4, 201, 90, 216, 48, 226, 144, 140,
164, 166, 53, 99, 241, 149, 103, 38,
72, 134, 101, 45, 171, 55, 60, 163,
160, 204, 26, 226, 153, 89, 145, 65,
10, 184, 241, 14, 22, 196, 50, 150,
46, 216, 225, 17, 177, 105, 13, 22,
100, 50, 174, 141, 32, 208, 110, 5,
233, 73, 79, 76, 6, 31, 246, 229,
8, 77, 107, 17, 200, 26, 136, 64,
134, 145, 216, 97, 13, 93, 80, 194,
8, 42, 144, 182, 4, 192, 10, 11,
113, 136, 18, 25, 196, 18, 193, 135,
232, 193, 33, 122, 112, 225, 21, 244,
160, 183, 46, 204, 4, 54, 107, 184,
2, 16, 70, 208, 151, 7, 32, 14,
113, 18, 232, 192, 8, 58, 208, 2,
29, 240, 33, 27, 165, 114, 92, 169,
30, 211, 152, 124, 196, 131, 21, 115,
41, 77, 77, 200, 224, 4, 236, 117,
14, 89, 161, 35, 93, 110, 110, 131,
58, 96, 117, 43, 74, 221, 210, 67,
108, 62, 2, 172, 97, 25, 235, 117,
184, 233, 141, 236, 72, 215, 172, 219,
9, 199, 133, 43, 152, 1, 182, 4,
3, 4, 175, 96, 33, 121, 88, 88,
87, 113, 116, 96, 58, 32, 18, 66,
72, 254, 118, 112, 2, 159, 36, 2,
4, 84, 98, 242, 10, 124, 176, 77,
3, 177, 150, 19, 31, 101, 165, 11,
132, 88, 225, 15, 5, 193, 137, 4,
138, 228, 69, 27, 227, 101, 47, 55,
134, 162, 22, 5, 115, 99, 25, 147,
197, 42, 52, 241, 45, 69, 172, 130,
22, 195, 228, 37, 49, 51, 22, 32,
132, 173, 104, 98, 25, 99, 83, 50,
18, 211, 32, 99, 0, 72, 99, 35,
91, 207, 47, 111, 148, 168, 81, 108,
237, 94, 137, 250, 38, 251, 118, 162,
147, 239, 17, 41, 134, 9, 97, 212,
110, 52, 216, 46, 74, 196, 112, 134,
6, 153, 4, 31, 198, 197, 134, 46,
56, 129, 13, 234, 155, 196, 184, 52,
17, 7, 65, 12, 196, 14, 196, 219,
207, 83, 20, 165, 137, 26, 201, 168,
155, 208, 12, 70, 46, 136, 82, 76,
246, 188, 104, 61, 19, 181, 215, 40,
226, 224, 4, 62, 60, 66, 16, 118,
72, 90, 125, 124, 83, 156, 20, 110,
52, 36, 76, 180, 78, 66, 192, 166,
8, 61, 40, 193, 7, 82, 32, 132,
82, 8, 161, 60, 252, 173, 112, 5,
71, 60, 92, 5, 58, 176, 130, 195,
29, 174, 43, 113, 136, 70, 60, 26,
215, 184, 200, 197, 49, 25, 118, 152,
158, 41, 59, 199, 188, 53, 184, 144,
51, 147, 73, 154, 210, 176, 144, 186,
143, 136, 100, 111, 114, 211, 146, 72,
4, 49, 43, 67, 6, 146, 117, 173,
254, 227, 164, 236, 70, 71, 58, 13,
254, 166, 55, 34, 212, 148, 151, 190,
162, 164, 233, 200, 205, 35, 108, 24,
168, 18, 30, 18, 165, 233, 92, 37,
102, 113, 136, 203, 186, 128, 192, 46,
65, 144, 98, 36, 171, 192, 145, 153,
200, 57, 138, 71, 176, 97, 103, 203,
43, 154, 15, 148, 176, 79, 78, 172,
34, 37, 11, 131, 144, 135, 62, 164,
162, 1, 25, 236, 96, 30, 162, 5,
39, 100, 193, 9, 69, 88, 8, 97,
145, 125, 236, 133, 28, 75, 89, 1,
253, 199, 154, 209, 200, 70, 50, 146,
81, 13, 102, 20, 69, 154, 191, 228,
229, 46, 249, 154, 80, 27, 117, 204,
61, 243, 131, 138, 64, 190, 119, 82,
240, 33, 112, 160, 188, 41, 137, 62,
237, 22, 62, 122, 250, 136, 92, 174,
33, 222, 125, 172, 114, 147, 71, 196,
129, 16, 58, 225, 232, 76, 64, 166,
40, 112, 134, 243, 175, 237, 153, 24,
128, 140, 242, 90, 249, 80, 212, 181,
156, 176, 147, 176, 120, 51, 131, 19,
128, 69, 86, 49, 75, 234, 186, 144,
22, 150, 206, 72, 49, 111, 118, 160,
193, 12, 124, 160, 7, 151, 42, 97,
13, 143, 8, 154, 20, 146, 151, 129,
4, 184, 228, 1, 18, 72, 192, 224,
42, 96, 83, 206, 105, 34, 25, 164,
114, 163, 169, 26, 199, 14, 95, 120,
196, 9, 164, 249, 23, 233, 134, 213,
144, 164, 77, 103, 144, 61, 19, 254,
68, 23, 149, 171, 8, 92, 94, 213,
58, 66, 170, 149, 19, 233, 26, 155,
219, 32, 43, 131, 192, 225, 13, 137,
85, 37, 45, 104, 157, 141, 146, 87,
248, 221, 26, 72, 65, 9, 135, 196,
65, 190, 148, 168, 15, 91, 112, 164,
136, 48, 240, 1, 198, 104, 225, 131,
244, 90, 64, 73, 26, 12, 74, 88,
76, 145, 147, 91, 178, 130, 74, 29,
188, 205, 85, 242, 141, 206, 77, 130,
233, 204, 214, 218, 171, 151, 48, 26,
230, 42, 126, 164, 209, 122, 145, 66,
152, 246, 138, 145, 68, 57, 182, 75,
86, 200, 136, 203, 242, 57, 153, 156,
118, 146, 147, 157, 28, 4, 100, 3,
108, 138, 109, 53, 154, 154, 8, 206,
106, 130, 141, 2, 97, 103, 232, 154,
60, 176, 114, 50, 36, 173, 161, 85,
122, 65, 163, 7, 12, 10, 18, 105,
118, 104, 200, 64, 129, 232, 68, 213,
32, 11, 76, 180, 172, 154, 92, 77,
170, 17, 141, 252, 136, 71, 183, 157,
196, 70, 212, 44, 144, 166, 137, 201,
59, 78, 240, 193, 12, 40, 226, 94,
227, 96, 210, 52, 232, 162, 12, 92,
94, 195, 196, 214, 144, 129, 46, 39,
232, 66, 67, 34, 130, 45, 37, 128,
87, 115, 121, 169, 148, 94, 48, 37,
129, 12, 140, 160, 146, 124, 72, 198,
57, 210, 193, 152, 160, 230, 227, 28,
169, 157, 207, 26, 36, 98, 216, 238,
32, 141, 8, 88, 160, 85, 254, 28,
198, 75, 8, 41, 0, 1, 160, 240,
98, 34, 91, 29, 242, 144, 139, 234,
64, 123, 114, 11, 221, 34, 187, 250,
206, 18, 239, 134, 118, 68, 56, 14,
230, 110, 199, 59, 49, 149, 198, 7,
96, 154, 132, 150, 216, 64, 132, 53,
104, 130, 59, 147, 64, 17, 41, 38,
177, 175, 73, 100, 68, 39, 130, 120,
84, 87, 12, 123, 133, 101, 103, 68,
35, 13, 65, 105, 232, 188, 51, 145,
21, 172, 224, 109, 45, 184, 235, 179,
114, 76, 193, 140, 40, 2, 72, 58,
178, 113, 56, 73, 1, 78, 25, 141,
130, 35, 24, 137, 79, 56, 191, 252,
158, 137, 106, 23, 204, 245, 211, 132,
65, 218, 28, 207, 50, 37, 144, 106,
8, 145, 103, 144, 26, 45, 105, 58,
189, 236, 170, 123, 251, 51, 93, 217,
74, 87, 181, 190, 230, 53, 249, 60,
87, 113, 106, 194, 196, 177, 200, 44,
232, 170, 41, 228, 96, 249, 173, 207,
141, 240, 91, 44, 51, 81, 4, 31,
50, 200, 134, 132, 36, 208, 182, 180,
4, 31, 164, 55, 162, 190, 0, 186,
25, 124, 95, 171, 58, 27, 228, 59,
171, 171, 114, 49, 201, 238, 237, 19,
91, 105, 99, 197, 142, 120, 152, 208,
150, 246, 87, 24, 87, 217, 17, 241,
230, 103, 34, 51, 168, 181, 173, 241,
66, 198, 240, 108, 238, 52, 122, 16,
112, 60, 34, 23, 185, 120, 164, 227,
28, 201, 16, 4, 246, 254, 72, 99,
198, 21, 76, 4, 44, 203, 18, 83,
72, 214, 160, 167, 210, 173, 171, 79,
217, 114, 161, 19, 112, 227, 197, 205,
17, 161, 11, 76, 156, 210, 86, 185,
218, 84, 77, 70, 219, 7, 88, 208,
131, 86, 122, 110, 110, 227, 144, 102,
6, 52, 240, 129, 34, 45, 131, 146,
46, 208, 160, 11, 82, 220, 40, 42,
23, 60, 60, 206, 44, 68, 136, 79,
76, 42, 213, 175, 194, 150, 127, 226,
204, 43, 72, 162, 193, 93, 143, 227,
58, 219, 124, 164, 88, 123, 14, 40,
37, 214, 35, 50, 1, 125, 150, 40,
198, 104, 80, 48, 230, 151, 11, 234,
27, 131, 25, 14, 82, 80, 131, 172,
233, 160, 236, 155, 54, 25, 16, 202,
152, 199, 137, 169, 87, 54, 212, 43,
70, 240, 99, 95, 162, 220, 167, 9,
31, 5, 16, 135, 31, 3, 146, 66,
26, 2, 69, 162, 131, 198, 102, 158,
193, 10, 30, 167, 167, 164, 249, 122,
8, 65, 64, 159, 24, 90, 8, 114,
97, 26, 62, 144, 49, 237, 16, 146,
63, 1, 52, 29, 19, 141, 210, 89,
46, 52, 73, 19, 219, 170, 192, 158,
184, 145, 122, 129, 15, 253, 225, 17,
166, 0, 10, 25, 99, 131, 70, 177,
167, 41, 81, 149, 20, 250, 8, 140,
120, 13, 17, 2, 19, 65, 9, 9,
245, 18, 18, 37, 48, 128, 17, 32,
3, 254, 160, 4, 116, 17, 4, 175,
67, 183, 73, 177, 254, 181, 193, 193,
181, 19, 40, 141, 61, 65, 35, 34,
32, 4, 198, 9, 42, 3, 115, 156,
120, 48, 6, 65, 112, 33, 31, 112,
149, 19, 224, 10, 182, 105, 175, 22,
88, 61, 240, 162, 36, 204, 208, 20,
214, 35, 2, 236, 169, 164, 5, 147,
148, 14, 24, 190, 125, 137, 139, 207,
81, 164, 219, 208, 13, 179, 153, 129,
17, 200, 0, 120, 35, 130, 6, 179,
188, 117, 193, 157, 177, 235, 193, 182,
241, 29, 153, 184, 130, 25, 232, 128,
38, 228, 138, 50, 178, 139, 10, 200,
140, 240, 154, 165, 122, 90, 150, 224,
40, 22, 166, 49, 15, 78, 192, 39,
41, 104, 175, 175, 224, 45, 17, 83,
150, 220, 40, 9, 39, 178, 131, 133,
72, 63, 86, 96, 185, 128, 178, 172,
4, 17, 63, 238, 27, 133, 48, 155,
132, 92, 48, 173, 6, 73, 45, 234,
195, 196, 236, 11, 197, 237, 203, 166,
17, 225, 4, 250, 138, 3, 180, 160,
4, 54, 144, 2, 243, 144, 40, 12,
92, 148, 248, 184, 56, 224, 219, 137,
138, 235, 43, 239, 41, 8, 149, 192,
191, 171, 74, 47, 94, 81, 141, 53,
192, 156, 187, 226, 146, 28, 19, 64,
134, 104, 136, 129, 35, 23, 50, 160,
179, 227, 128, 151, 237, 48, 59, 61,
120, 139, 64, 20, 37, 174, 195, 154,
70, 195, 27, 75, 139, 185, 220, 50,
41, 25, 74, 8, 91, 89, 54, 44,
224, 180, 38, 254, 156, 129, 206, 177,
14, 27, 116, 2, 51, 252, 151, 10,
240, 129, 19, 170, 15, 169, 233, 25,
59, 0, 2, 75, 193, 130, 0, 154,
4, 115, 137, 11, 168, 41, 190, 47,
210, 65, 189, 120, 137, 10, 56, 129,
175, 128, 66, 29, 176, 3, 102, 0,
182, 159, 250, 187, 199, 120, 156, 108,
240, 5, 61, 64, 199, 191, 57, 129,
240, 88, 1, 164, 193, 2, 34, 232,
65, 37, 33, 130, 78, 67, 163, 92,
17, 19, 233, 25, 1, 51, 82, 142,
253, 74, 188, 22, 168, 0, 37, 112,
54, 39, 136, 188, 219, 49, 155, 37,
60, 129, 38, 60, 195, 14, 152, 129,
31, 107, 27, 115, 49, 23, 85, 1,
130, 61, 161, 36, 98, 185, 35, 32,
16, 34, 156, 122, 149, 192, 233, 11,
187, 8, 140, 19, 224, 195, 217, 179,
65, 195, 202, 34, 182, 66, 168, 73,
96, 170, 152, 144, 141, 110, 115, 170,
98, 33, 180, 145, 80, 46, 90, 234,
136, 7, 164, 162, 203, 81, 21, 41,
216, 143, 147, 73, 148, 23, 57, 38,
77, 32, 4, 233, 178, 49, 140, 11,
39, 28, 114, 63, 147, 25, 32, 31,
17, 20, 168, 193, 150, 226, 185, 147,
107, 75, 13, 155, 161, 21, 95, 105,
13, 185, 73, 43, 187, 188, 75, 67,
218, 170, 206, 243, 54, 70, 108, 29,
70, 226, 146, 92, 89, 146, 17, 242,
163, 69, 194, 13, 13, 194, 66, 101,
161, 34, 254, 224, 233, 150, 173, 204,
138, 48, 192, 142, 222, 161, 188, 48,
56, 29, 207, 113, 157, 142, 250, 136,
180, 154, 9, 15, 18, 34, 64, 178,
76, 42, 177, 43, 43, 185, 11, 195,
97, 27, 223, 25, 74, 52, 210, 129,
12, 16, 0, 37, 122, 157, 146, 160,
13, 34, 232, 0, 189, 160, 129, 200,
196, 2, 174, 152, 1, 204, 48, 154,
19, 40, 156, 189, 208, 193, 191, 144,
0, 74, 250, 177, 152, 120, 4, 95,
72, 6, 210, 242, 59, 132, 76, 200,
199, 97, 6, 121, 19, 70, 205, 25,
1, 231, 80, 41, 157, 226, 138, 17,
160, 1, 62, 33, 55, 37, 65, 151,
221, 81, 195, 10, 120, 137, 226, 59,
129, 10, 144, 54, 50, 200, 149, 103,
161, 157, 228, 248, 10, 138, 192, 30,
205, 249, 175, 240, 216, 195, 210, 16,
19, 204, 80, 56, 38, 202, 34, 60,
66, 169, 21, 80, 155, 180, 249, 11,
1, 216, 47, 92, 195, 47, 9, 168,
128, 59, 225, 32, 72, 132, 18, 74,
192, 10, 144, 64, 146, 56, 248, 140,
213, 161, 14, 64, 171, 15, 44, 128,
63, 141, 162, 132, 16, 169, 44, 39,
74, 15, 143, 218, 141, 246, 250, 23,
32, 112, 2, 215, 65, 175, 188, 2,
151, 145, 8, 14, 216, 17, 150, 189,
180, 9, 208, 9, 157, 164, 177, 175,
98, 193, 2, 223, 145, 130, 110, 17,
137, 33, 74, 150, 203, 57, 47, 118,
233, 254, 163, 101, 233, 42, 37, 232,
128, 35, 194, 181, 87, 57, 35, 164,
81, 150, 147, 228, 36, 224, 120, 164,
224, 0, 171, 113, 19, 147, 206, 1,
137, 215, 24, 162, 12, 2, 68, 72,
146, 136, 147, 252, 147, 56, 84, 146,
153, 208, 138, 78, 67, 37, 251, 138,
141, 233, 128, 13, 110, 51, 29, 155,
227, 148, 112, 66, 145, 23, 193, 62,
8, 89, 133, 160, 65, 36, 212, 145,
13, 67, 66, 199, 192, 169, 0, 126,
20, 128, 12, 200, 14, 190, 193, 41,
26, 144, 149, 154, 3, 56, 26, 24,
1, 253, 122, 211, 12, 224, 147, 46,
208, 1, 29, 228, 77, 74, 217, 139,
192, 216, 19, 26, 224, 208, 48, 88,
156, 111, 240, 169, 228, 132, 163, 123,
8, 21, 102, 224, 132, 201, 88, 176,
213, 179, 78, 39, 116, 73, 247, 98,
184, 250, 48, 14, 19, 26, 34, 196,
164, 1, 151, 128, 9, 26, 56, 156,
146, 60, 68, 142, 124, 36, 31, 24,
1, 100, 35, 27, 230, 153, 59, 37,
193, 41, 187, 16, 19, 225, 212, 12,
204, 193, 35, 253, 96, 131, 19, 160,
148, 190, 200, 11, 188, 176, 148, 255,
52, 163, 17, 104, 129, 217, 195, 130,
141, 114, 34, 216, 232, 12, 177, 104,
9, 41, 136, 34, 144, 72, 38, 74,
144, 27, 78, 58, 19, 235, 232, 38,
77, 136, 8, 116, 252, 10, 37, 144,
26, 190, 153, 30, 150, 178, 138, 82,
254, 210, 1, 25, 164, 132, 216, 219,
140, 251, 91, 39, 172, 153, 33, 111,
140, 18, 38, 154, 4, 89, 192, 15,
44, 88, 5, 102, 136, 134, 237, 99,
133, 2, 61, 198, 133, 200, 63, 1,
52, 198, 48, 112, 83, 126, 124, 128,
21, 16, 11, 38, 186, 75, 157, 219,
162, 68, 10, 157, 78, 226, 208, 108,
17, 152, 196, 210, 9, 65, 233, 188,
48, 172, 13, 162, 33, 30, 39, 202,
28, 136, 156, 1, 202, 64, 142, 132,
211, 129, 31, 162, 27, 57, 235, 25,
155, 113, 198, 1, 244, 133, 120, 149,
215, 7, 97, 134, 112, 248, 6, 102,
200, 133, 121, 25, 150, 233, 24, 150,
11, 115, 57, 154, 24, 129, 55, 21,
128, 22, 32, 131, 15, 18, 34, 39,
208, 12, 165, 233, 22, 109, 181, 12,
225, 244, 129, 19, 224, 85, 26, 56,
129, 76, 209, 129, 119, 211, 79, 190,
216, 139, 74, 249, 207, 155, 98, 71,
248, 179, 3, 89, 8, 60, 118, 104,
84, 3, 123, 212, 115, 8, 6, 86,
196, 156, 44, 58, 196, 43, 185, 130,
84, 93, 146, 43, 193, 153, 210, 81,
169, 44, 194, 141, 46, 200, 15, 205,
233, 211, 221, 36, 201, 226, 81, 21,
70, 92, 23, 156, 218, 28, 79, 115,
81, 175, 197, 205, 128, 228, 138, 182,
201, 205, 228, 224, 193, 87, 81, 146,
19, 240, 139, 4, 144, 128, 191, 232,
47, 75, 177, 169, 6, 195, 30, 254,
79, 157, 151, 250, 232, 28, 128, 194,
2, 188, 104, 23, 33, 234, 42, 242,
161, 141, 104, 147, 34, 65, 33, 183,
209, 1, 218, 87, 25, 199, 226, 99,
54, 42, 234, 52, 50, 40, 80, 37,
176, 169, 208, 125, 4, 41, 208, 20,
234, 224, 33, 167, 160, 191, 2, 109,
186, 177, 120, 4, 90, 136, 6, 90,
240, 136, 85, 56, 135, 120, 120, 156,
112, 48, 6, 248, 179, 173, 240, 193,
70, 149, 144, 43, 126, 211, 211, 255,
252, 207, 192, 176, 136, 169, 4, 58,
119, 67, 83, 67, 226, 163, 37, 106,
174, 112, 146, 133, 96, 184, 56, 136,
88, 29, 208, 89, 94, 42, 225, 141,
97, 185, 130, 191, 201, 128, 32, 203,
10, 240, 224, 147, 214, 19, 9, 250,
154, 48, 137, 227, 137, 221, 61, 173,
108, 168, 134, 104, 24, 63, 102, 200,
134, 111, 88, 72, 65, 112, 167, 48,
112, 136, 250, 200, 49, 82, 160, 133,
85, 152, 24, 179, 208, 3, 26, 152,
89, 253, 128, 30, 85, 132, 158, 175,
72, 42, 210, 120, 0, 29, 40, 9,
41, 48, 35, 52, 26, 73, 56, 85,
130, 60, 45, 190, 63, 157, 217, 189,
232, 11, 92, 155, 1, 65, 8, 134,
100, 152, 152, 53, 130, 28, 170, 173,
90, 118, 200, 6, 78, 64, 199, 118,
9, 3, 29, 208, 20, 34, 170, 128,
7, 176, 195, 62, 49, 142, 46, 168,
72, 61, 250, 83, 175, 192, 254, 35,
187, 64, 27, 3, 232, 128, 200, 91,
220, 164, 97, 177, 127, 44, 35, 204,
48, 151, 86, 41, 90, 210, 0, 28,
192, 201, 128, 174, 16, 94, 151, 48,
0, 50, 34, 90, 3, 56, 226, 90,
27, 220, 17, 24, 33, 26, 232, 128,
49, 217, 73, 54, 216, 147, 249, 13,
154, 221, 100, 205, 155, 228, 19, 51,
252, 177, 61, 209, 148, 210, 0, 156,
255, 82, 142, 240, 200, 181, 204, 179,
3, 50, 32, 141, 217, 35, 3, 214,
179, 14, 34, 240, 200, 46, 16, 18,
41, 64, 163, 253, 64, 179, 167, 128,
37, 130, 208, 8, 153, 209, 142, 7,
145, 84, 168, 173, 134, 120, 8, 228,
116, 200, 93, 92, 2, 138, 117, 186,
87, 100, 100, 8, 123, 138, 194, 187,
194, 66, 37, 209, 167, 10, 114, 136,
244, 154, 100, 189, 140, 141, 139, 192,
95, 186, 122, 132, 251, 93, 38, 78,
40, 164, 206, 27, 150, 96, 177, 141,
203, 41, 219, 63, 133, 200, 205, 200,
138, 161, 212, 181, 209, 3, 162, 38,
90, 150, 53, 152, 65, 227, 210, 9,
102, 56, 135, 112, 96, 6, 212, 10,
6, 91, 126, 223, 96, 96, 131, 68,
172, 9, 149, 90, 182, 56, 40, 139,
110, 90, 133, 244, 0, 2, 65, 181,
53, 253, 224, 131, 101, 75, 136, 48,
248, 151, 40, 209, 1, 51, 2, 72,
114, 235, 65, 78, 27, 1, 9, 32,
35, 137, 96, 184, 187, 254, 90, 1,
223, 180, 59, 187, 216, 175, 17, 136,
131, 1, 171, 134, 96, 200, 134, 115,
56, 231, 14, 46, 66, 199, 185, 135,
108, 80, 4, 231, 160, 43, 31, 8,
12, 42, 153, 129, 151, 64, 163, 13,
53, 29, 47, 130, 228, 46, 168, 195,
25, 216, 13, 35, 122, 155, 192, 213,
1, 42, 17, 161, 154, 184, 170, 175,
165, 13, 29, 128, 21, 203, 56, 195,
22, 88, 149, 88, 171, 84, 152, 148,
158, 61, 4, 199, 112, 156, 129, 238,
124, 128, 194, 209, 79, 91, 51, 128,
22, 208, 225, 10, 160, 77, 32, 32,
159, 233, 81, 82, 29, 152, 148, 74,
73, 0, 247, 178, 201, 90, 243, 11,
140, 158, 129, 143, 160, 129, 255, 170,
128, 134, 246, 34, 139, 136, 131, 139,
115, 130, 196, 147, 130, 129, 170, 89,
62, 0, 2, 59, 236, 130, 2, 229,
34, 34, 128, 58, 73, 59, 179, 7,
226, 51, 185, 1, 33, 12, 83, 13,
74, 48, 134, 112, 200, 134, 219, 101,
7, 118, 56, 7, 99, 192, 17, 254,
168, 52, 185, 34, 186, 68, 190, 215,
48, 192, 77, 79, 83, 61, 109, 99,
171, 213, 176, 142, 213, 184, 191, 171,
218, 40, 156, 11, 40, 179, 112, 136,
81, 248, 15, 15, 153, 68, 54, 248,
228, 19, 237, 182, 112, 36, 30, 219,
160, 216, 154, 37, 9, 240, 204, 140,
196, 203, 149, 175, 246, 157, 125, 249,
197, 158, 73, 134, 254, 147, 205, 134,
108, 72, 12, 91, 78, 95, 95, 8,
131, 96, 141, 194, 60, 85, 229, 93,
177, 191, 251, 27, 168, 92, 229, 71,
26, 120, 13, 112, 37, 4, 61, 160,
195, 184, 209, 131, 57, 22, 86, 33,
26, 218, 22, 192, 194, 21, 64, 226,
76, 57, 165, 61, 225, 87, 90, 211,
11, 153, 6, 232, 10, 208, 129, 81,
8, 135, 116, 136, 134, 81, 9, 135,
104, 152, 90, 118, 88, 140, 116, 126,
12, 199, 97, 7, 99, 192, 160, 43,
186, 130, 46, 20, 139, 209, 29, 129,
190, 57, 84, 166, 81, 130, 19, 216,
151, 172, 176, 219, 101, 25, 73, 220,
180, 139, 229, 126, 26, 44, 216, 136,
169, 96, 181, 237, 160, 139, 31, 138,
77, 88, 129, 13, 128, 19, 147, 101,
1, 2, 42, 201, 181, 46, 88, 197,
56, 104, 1, 151, 16, 92, 192, 245,
139, 193, 57, 23, 196, 97, 27, 147,
0, 130, 30, 139, 66, 204, 249, 47,
188, 248, 139, 7, 216, 25, 41, 144,
205, 253, 124, 149, 252, 18, 128, 43,
248, 22, 39, 8, 163, 117, 99, 20,
31, 40, 239, 204, 26, 5, 85, 193,
32, 34, 72, 30, 249, 74, 213, 17,
136, 99, 69, 136, 146, 184, 121, 153,
2, 100, 136, 145, 80, 82, 84, 99,
131, 101, 145, 65, 99, 56, 140, 115,
248, 6, 80, 137, 135, 169, 54, 134,
2, 189, 178, 70, 35, 186, 177, 126,
8, 28, 251, 254, 219, 191, 128, 65,
67, 221, 39, 13, 27, 139, 41, 186,
63, 161, 211, 176, 3, 66, 32, 20,
17, 144, 140, 105, 55, 186, 58, 164,
129, 5, 22, 61, 99, 158, 216, 252,
199, 200, 148, 130, 73, 217, 195, 191,
89, 96, 79, 187, 171, 44, 82, 157,
37, 213, 3, 95, 168, 6, 42, 143,
6, 8, 241, 62, 164, 240, 100, 37,
88, 177, 213, 81, 149, 193, 186, 10,
103, 68, 142, 55, 157, 129, 89, 249,
164, 22, 198, 164, 13, 93, 29, 223,
209, 164, 136, 128, 195, 127, 161, 129,
10, 222, 13, 104, 182, 230, 213, 182,
181, 51, 50, 34, 155, 146, 130, 92,
160, 229, 237, 123, 234, 100, 152, 218,
124, 248, 134, 111, 0, 54, 222, 78,
206, 198, 9, 60, 78, 216, 25, 124,
66, 163, 41, 73, 142, 25, 104, 225,
225, 89, 26, 41, 88, 1, 116, 201,
149, 190, 25, 158, 73, 151, 0, 240,
218, 175, 240, 52, 29, 78, 34, 131,
112, 76, 104, 237, 81, 238, 204, 0,
47, 29, 61, 84, 76, 194, 22, 251,
218, 158, 56, 176, 104, 39, 184, 162,
165, 252, 177, 161, 197, 181, 205, 81,
56, 174, 104, 129, 221, 112, 47, 140,
188, 28, 37, 160, 162, 132, 91, 194,
51, 74, 184, 238, 172, 89, 124, 226,
230, 7, 24, 1, 101, 9, 218, 7,
112, 49, 252, 48, 128, 25, 208, 142,
179, 8, 11, 172, 137, 131, 98, 145,
177, 17, 254, 208, 21, 183, 177, 139,
48, 168, 52, 186, 218, 202, 74, 19,
184, 152, 73, 13, 95, 49, 196, 18,
139, 3, 89, 200, 134, 116, 72, 247,
111, 136, 134, 112, 56, 231, 115, 200,
134, 92, 72, 203, 218, 130, 10, 142,
144, 180, 130, 168, 214, 159, 180, 181,
10, 230, 3, 179, 216, 145, 151, 49,
32, 140, 240, 26, 207, 88, 160, 248,
131, 159, 120, 2, 159, 107, 163, 165,
181, 236, 25, 42, 98, 43, 175, 93,
205, 12, 216, 60, 41, 200, 11, 146,
148, 136, 141, 26, 158, 238, 225, 132,
171, 82, 4, 77, 148, 133, 127, 34,
4, 89, 48, 173, 96, 120, 17, 90,
16, 121, 144, 25, 16, 26, 156, 1,
111, 145, 5, 110, 209, 21, 197, 161,
215, 171, 202, 143, 186, 19, 128, 25,
232, 140, 92, 49, 190, 78, 59, 96,
22, 237, 211, 22, 56, 201, 21, 176,
206, 46, 180, 146, 19, 24, 33, 113,
228, 10, 252, 218, 104, 189, 64, 156,
20, 214, 143, 89, 142, 6, 0, 49,
231, 116, 152, 218, 199, 96, 135, 116,
184, 93, 160, 50, 244, 198, 185, 135,
223, 246, 90, 60, 162, 129, 203, 25,
1, 3, 120, 109, 141, 101, 30, 230,
225, 28, 22, 187, 194, 108, 45, 162,
96, 93, 77, 36, 214, 1, 27, 117,
96, 140, 236, 0, 195, 194, 205, 31,
67, 188, 226, 213, 156, 19, 224, 240,
44, 178, 19, 167, 251, 232, 82, 59,
18, 254, 31, 216, 168, 67, 253, 81,
218, 137, 67, 141, 244, 146, 164, 217,
236, 151, 84, 207, 21, 144, 213, 43,
81, 158, 53, 224, 230, 92, 187, 130,
86, 167, 217, 98, 177, 147, 240, 92,
158, 44, 138, 21, 3, 28, 158, 66,
202, 80, 221, 32, 190, 214, 83, 113,
207, 192, 27, 93, 172, 16, 95, 104,
87, 193, 226, 13, 54, 184, 15, 12,
171, 6, 95, 203, 6, 99, 160, 133,
114, 22, 244, 12, 38, 5, 99, 136,
134, 245, 93, 5, 69, 96, 5, 79,
204, 133, 74, 163, 5, 234, 243, 133,
81, 80, 124, 65, 213, 181, 43, 225,
3, 1, 225, 152, 183, 120, 132, 26,
169, 39, 190, 115, 11, 186, 82, 31,
70, 185, 8, 167, 88, 65, 52, 19,
31, 21, 106, 138, 73, 24, 162, 1,
228, 36, 138, 164, 11, 56, 165, 12,
39, 224, 213, 190, 233, 130, 78, 62,
112, 77, 156, 196, 53, 16, 132, 252,
197, 100, 59, 88, 5, 137, 225, 136,
20, 161, 5, 66, 176, 3, 78, 136,
16, 70, 193, 28, 78, 49, 166, 170,
186, 34, 128, 16, 196, 134, 141, 148,
25, 25, 30, 8, 16, 80, 161, 194,
12, 54, 107, 104, 180, 240, 33, 229,
138, 143, 22, 52, 38, 2, 73, 144,
97, 132, 15, 44, 43, 116, 204, 48,
240, 96, 5, 68, 37, 87, 156, 248,
152, 65, 99, 198, 136, 12, 18, 36,
8, 120, 96, 192, 192, 136, 21, 42,
254, 165, 112, 250, 22, 142, 89, 54,
99, 204, 238, 241, 11, 42, 52, 223,
189, 112, 231, 242, 9, 77, 26, 52,
31, 211, 124, 217, 8, 97, 161, 161,
68, 10, 141, 43, 68, 50, 36, 144,
48, 98, 6, 145, 53, 74, 176, 72,
89, 97, 210, 7, 16, 26, 58, 148,
40, 105, 113, 98, 134, 65, 145, 18,
116, 56, 113, 130, 133, 136, 77, 41,
82, 44, 250, 56, 177, 130, 228, 202,
22, 35, 90, 232, 104, 209, 33, 131,
157, 48, 88, 200, 232, 81, 178, 70,
207, 138, 17, 87, 236, 144, 153, 184,
70, 147, 32, 34, 64, 2, 159, 24,
113, 194, 162, 14, 34, 78, 194, 172,
57, 233, 67, 137, 30, 39, 15, 36,
180, 80, 169, 210, 7, 13, 136, 52,
248, 116, 25, 161, 48, 195, 9, 37,
29, 18, 16, 9, 67, 68, 199, 138,
14, 52, 216, 116, 1, 226, 57, 142,
32, 62, 124, 216, 232, 89, 195, 114,
69, 139, 220, 64, 190, 118, 33, 19,
39, 206, 26, 50, 93, 214, 112, 162,
21, 44, 24, 39, 59, 124, 70, 81,
226, 19, 70, 74, 23, 69, 178, 130,
25, 243, 37, 136, 146, 206, 106, 204,
86, 77, 10, 246, 45, 91, 53, 99,
148, 56, 69, 115, 207, 140, 20, 31,
90, 213, 130, 249, 66, 203, 35, 143,
248, 18, 12, 45, 172, 80, 98, 199,
21, 29, 36, 20, 19, 16, 93, 92,
161, 132, 32, 7, 78, 162, 201, 254,
35, 122, 220, 167, 200, 36, 148, 8,
162, 8, 39, 143, 40, 162, 200, 116,
148, 76, 66, 200, 35, 132, 240, 49,
9, 136, 138, 16, 194, 134, 29, 37,
10, 130, 162, 30, 40, 242, 113, 162,
30, 44, 134, 1, 4, 22, 113, 216,
150, 64, 7, 59, 74, 97, 128, 143,
74, 156, 69, 8, 39, 192, 41, 130,
152, 38, 171, 112, 146, 32, 33, 172,
208, 66, 202, 40, 138, 232, 193, 137,
44, 171, 144, 242, 200, 139, 180, 200,
194, 138, 38, 107, 152, 167, 73, 24,
51, 180, 192, 6, 43, 190, 192, 135,
69, 24, 222, 9, 66, 134, 14, 39,
200, 148, 129, 75, 191, 241, 72, 67,
24, 108, 96, 161, 196, 12, 64, 216,
5, 196, 65, 39, 248, 112, 197, 94,
39, 100, 181, 86, 11, 22, 17, 65,
158, 20, 68, 204, 176, 89, 6, 13,
10, 144, 65, 11, 207, 233, 145, 204,
57, 225, 164, 195, 78, 50, 223, 32,
165, 84, 80, 241, 0, 229, 169, 82,
68, 157, 67, 73, 23, 58, 248, 224,
132, 89, 51, 32, 228, 227, 9, 82,
176, 17, 6, 25, 100, 80, 196, 219,
164, 62, 140, 6, 68, 69, 141, 137,
84, 129, 68, 88, 204, 213, 154, 20,
145, 249, 213, 1, 115, 204, 209, 144,
82, 11, 43, 156, 32, 65, 6, 143,
56, 20, 134, 32, 186, 241, 17, 149,
30, 211, 146, 229, 68, 97, 168, 26,
36, 128, 1, 25, 72, 117, 254, 5,
176, 96, 169, 218, 1, 16, 113, 232,
144, 128, 144, 18, 84, 176, 145, 156,
28, 117, 229, 196, 8, 90, 105, 38,
175, 4, 218, 62, 4, 231, 111, 177,
234, 64, 131, 103, 209, 133, 161, 42,
75, 198, 250, 176, 6, 17, 122, 1,
22, 215, 68, 185, 113, 194, 9, 33,
122, 204, 117, 5, 25, 178, 82, 226,
139, 47, 204, 36, 67, 10, 43, 193,
36, 19, 76, 53, 190, 140, 226, 75,
52, 28, 51, 211, 37, 51, 198, 248,
196, 74, 195, 40, 3, 88, 97, 50,
204, 208, 18, 165, 34, 164, 228, 66,
10, 25, 35, 172, 219, 129, 19, 19,
75, 193, 7, 43, 132, 196, 49, 9,
41, 25, 146, 193, 135, 38, 156, 140,
50, 73, 24, 93, 176, 17, 162, 136,
210, 54, 60, 137, 64, 113, 240, 161,
72, 135, 107, 116, 17, 199, 137, 79,
191, 248, 8, 31, 180, 166, 42, 94,
7, 15, 252, 184, 134, 19, 34, 117,
0, 146, 20, 138, 252, 220, 5, 138,
79, 230, 50, 10, 41, 132, 76, 22,
12, 43, 147, 204, 184, 74, 122, 225,
61, 194, 138, 49, 193, 200, 50, 137,
29, 164, 252, 157, 224, 162, 122, 172,
194, 74, 205, 164, 144, 34, 184, 67,
88, 232, 208, 193, 8, 12, 206, 176,
134, 29, 40, 57, 36, 133, 172, 87,
92, 17, 71, 24, 25, 204, 96, 88,
92, 51, 116, 208, 193, 9, 39, 16,
65, 70, 104, 154, 219, 254, 193, 6,
25, 121, 218, 214, 160, 144, 9, 124,
52, 137, 81, 231, 196, 19, 79, 52,
233, 136, 218, 123, 239, 68, 177, 195,
10, 173, 68, 92, 65, 131, 4, 6,
36, 36, 210, 9, 87, 64, 200, 70,
135, 201, 161, 148, 168, 18, 150, 153,
117, 66, 7, 18, 72, 78, 124, 23,
83, 1, 17, 122, 28, 93, 16, 177,
149, 18, 41, 177, 197, 22, 72, 141,
74, 160, 136, 29, 118, 96, 97, 135,
32, 52, 116, 97, 7, 16, 132, 76,
194, 199, 21, 155, 73, 161, 68, 75,
22, 29, 148, 192, 228, 166, 11, 199,
50, 44, 201, 205, 8, 100, 50, 19,
111, 93, 239, 1, 25, 136, 11, 17,
104, 224, 146, 189, 52, 103, 94, 218,
178, 67, 96, 182, 178, 6, 130, 96,
134, 36, 130, 49, 23, 16, 78, 55,
131, 130, 41, 193, 127, 165, 99, 206,
21, 116, 163, 3, 41, 56, 129, 60,
122, 216, 80, 224, 248, 176, 187, 112,
252, 71, 19, 172, 176, 20, 51, 184,
51, 138, 106, 156, 163, 26, 201, 160,
5, 39, 124, 241, 141, 111, 36, 99,
135, 171, 240, 225, 199, 86, 65, 137,
92, 100, 227, 27, 185, 48, 226, 40,
114, 1, 56, 54, 172, 192, 128, 18,
200, 13, 22, 156, 192, 7, 78, 212,
8, 74, 67, 163, 4, 152, 176, 68,
34, 66, 40, 226, 104, 50, 34, 196,
40, 152, 244, 8, 169, 241, 193, 68,
122, 56, 227, 36, 254, 26, 6, 70,
16, 181, 241, 17, 29, 162, 210, 21,
98, 5, 167, 7, 96, 129, 13, 33,
164, 201, 12, 156, 48, 9, 40, 61,
162, 11, 154, 240, 69, 46, 44, 70,
10, 90, 44, 81, 22, 190, 96, 197,
33, 11, 100, 12, 90, 140, 66, 59,
219, 161, 5, 150, 104, 70, 200, 196,
141, 162, 52, 97, 224, 195, 42, 208,
99, 32, 66, 76, 68, 58, 107, 40,
136, 1, 90, 96, 57, 37, 0, 129,
32, 82, 48, 17, 25, 216, 64, 153,
14, 72, 1, 90, 68, 128, 16, 179,
14, 133, 133, 37, 37, 71, 117, 130,
240, 218, 120, 112, 38, 187, 7, 160,
142, 21, 151, 98, 71, 62, 226, 145,
141, 120, 248, 46, 153, 67, 1, 30,
43, 78, 242, 21, 34, 28, 79, 36,
147, 203, 64, 160, 24, 149, 155, 56,
180, 46, 50, 168, 172, 200, 12, 76,
210, 133, 46, 204, 69, 97, 154, 195,
2, 16, 82, 8, 172, 19, 60, 39,
53, 141, 170, 201, 74, 102, 176, 2,
9, 184, 46, 14, 118, 81, 4, 22,
90, 16, 25, 50, 168, 79, 127, 62,
152, 152, 18, 104, 112, 130, 100, 141,
109, 4, 237, 90, 129, 19, 172, 114,
24, 44, 108, 175, 2, 15, 88, 200,
3, 18, 240, 128, 135, 74, 234, 117,
51, 168, 128, 255, 136, 16, 7, 44,
16, 106, 4, 118, 72, 154, 20, 80,
117, 2, 236, 168, 72, 32, 105, 41,
93, 77, 246, 254, 242, 160, 235, 72,
97, 108, 111, 177, 11, 243, 70, 227,
33, 237, 228, 71, 62, 104, 194, 84,
54, 162, 17, 142, 108, 24, 101, 39,
201, 48, 70, 54, 206, 145, 67, 140,
49, 35, 28, 225, 248, 134, 49, 242,
131, 211, 157, 248, 194, 24, 201, 72,
98, 52, 16, 153, 212, 142, 173, 130,
12, 45, 168, 192, 76, 124, 5, 22,
29, 32, 78, 22, 49, 131, 228, 35,
52, 161, 8, 74, 144, 66, 19, 132,
56, 26, 210, 40, 51, 86, 164, 141,
226, 68, 148, 208, 132, 38, 40, 65,
8, 59, 116, 149, 173, 138, 224, 131,
32, 54, 68, 9, 42, 213, 245, 174,
227, 209, 223, 67, 227, 165, 145, 67,
17, 129, 16, 119, 213, 3, 25, 8,
33, 11, 89, 176, 149, 18, 171, 200,
69, 205, 238, 67, 179, 92, 32, 22,
105, 5, 202, 5, 37, 70, 97, 37,
198, 82, 226, 62, 180, 88, 36, 100,
164, 128, 133, 71, 200, 34, 173, 124,
112, 66, 96, 58, 18, 135, 88, 117,
161, 56, 68, 168, 38, 22, 74, 132,
207, 81, 240, 97, 5, 130, 20, 68,
9, 187, 160, 150, 170, 92, 145, 63,
167, 141, 145, 138, 208, 37, 147, 228,
209, 102, 5, 100, 48, 198, 55, 210,
193, 148, 120, 132, 163, 83, 202, 244,
29, 83, 238, 17, 143, 85, 172, 97,
105, 87, 144, 66, 75, 4, 106, 172,
14, 112, 165, 123, 201, 162, 1, 16,
172, 243, 254, 166, 180, 209, 96, 4,
35, 56, 33, 66, 243, 244, 153, 60,
157, 196, 34, 151, 217, 147, 249, 250,
165, 206, 212, 168, 5, 88, 100, 232,
231, 26, 226, 160, 18, 39, 16, 52,
161, 43, 0, 66, 9, 101, 245, 77,
39, 16, 97, 122, 113, 233, 103, 11,
76, 194, 185, 22, 56, 171, 95, 18,
112, 168, 179, 58, 208, 130, 185, 32,
171, 76, 156, 192, 66, 6, 42, 16,
134, 141, 145, 2, 124, 139, 146, 130,
220, 6, 196, 138, 85, 60, 34, 14,
101, 121, 78, 252, 248, 128, 77, 219,
10, 64, 2, 88, 16, 132, 30, 166,
219, 16, 95, 84, 35, 27, 50, 102,
70, 46, 162, 17, 141, 100, 184, 167,
144, 50, 206, 70, 13, 103, 24, 227,
145, 105, 39, 198, 53, 125, 36, 142,
163, 65, 227, 67, 50, 35, 63, 201,
64, 80, 46, 80, 182, 68, 65, 200,
235, 183, 2, 208, 129, 139, 237, 192,
138, 195, 14, 237, 90, 77, 26, 108,
28, 50, 91, 34, 207, 25, 73, 19,
120, 91, 76, 98, 9, 75, 134, 71,
172, 21, 42, 88, 168, 209, 137, 198,
19, 7, 22, 41, 194, 182, 2, 117,
232, 12, 186, 32, 133, 10, 148, 84,
7, 118, 32, 68, 24, 152, 87, 165,
85, 180, 233, 59, 138, 27, 69, 28,
244, 48, 138, 46, 173, 66, 15, 118,
224, 4, 99, 101, 49, 87, 77, 28,
86, 22, 148, 192, 16, 150, 104, 161,
9, 254, 61, 140, 199, 9, 3, 57,
12, 105, 79, 224, 173, 17, 40, 129,
12, 123, 86, 132, 217, 2, 28, 134,
11, 217, 97, 21, 178, 224, 67, 232,
218, 72, 216, 142, 210, 160, 181, 154,
24, 197, 165, 5, 97, 217, 10, 209,
205, 7, 82, 22, 192, 95, 104, 160,
136, 104, 124, 3, 84, 197, 52, 238,
114, 151, 123, 143, 116, 104, 194, 59,
102, 195, 2, 91, 198, 215, 27, 218,
0, 134, 120, 78, 208, 21, 172, 216,
112, 133, 192, 172, 224, 32, 21, 152,
84, 158, 164, 130, 74, 174, 128, 165,
53, 168, 130, 136, 174, 38, 117, 190,
25, 128, 68, 45, 62, 216, 30, 91,
194, 160, 132, 12, 244, 70, 35, 131,
25, 77, 74, 164, 130, 208, 111, 130,
165, 123, 45, 217, 200, 9, 129, 192,
237, 56, 92, 5, 162, 251, 245, 44,
126, 203, 73, 4, 74, 176, 162, 11,
21, 160, 65, 197, 124, 33, 11, 16,
173, 193, 108, 113, 240, 234, 40, 140,
225, 158, 96, 36, 141, 67, 33, 2,
26, 251, 102, 32, 128, 4, 148, 135,
15, 68, 80, 75, 28, 120, 74, 31,
95, 52, 172, 26, 243, 137, 198, 220,
100, 81, 13, 27, 211, 130, 126, 201,
176, 113, 50, 210, 138, 196, 106, 212,
135, 68, 51, 79, 143, 38, 226, 192,
10, 35, 239, 208, 56, 49, 99, 5,
108, 231, 130, 144, 6, 197, 154, 34,
62, 11, 107, 253, 202, 99, 161, 185,
254, 182, 242, 174, 44, 94, 218, 128,
8, 33, 136, 56, 20, 54, 60, 83,
95, 3, 26, 77, 92, 88, 62, 216,
65, 209, 69, 51, 241, 250, 108, 35,
39, 96, 218, 69, 78, 200, 18, 117,
235, 238, 100, 135, 182, 42, 226, 17,
14, 251, 106, 91, 63, 100, 36, 70,
166, 149, 18, 90, 149, 69, 88, 5,
145, 157, 43, 101, 50, 59, 144, 84,
68, 192, 252, 213, 5, 85, 101, 0,
121, 9, 73, 64, 11, 234, 24, 246,
226, 60, 239, 17, 144, 229, 67, 103,
220, 198, 98, 200, 20, 109, 21, 180,
254, 26, 27, 38, 1, 30, 46, 234,
233, 232, 9, 145, 0, 58, 241, 99,
220, 230, 34, 179, 216, 252, 80, 238,
168, 238, 113, 14, 193, 181, 73, 9,
40, 169, 74, 21, 123, 35, 185, 230,
96, 193, 7, 141, 113, 112, 29, 169,
3, 161, 20, 78, 215, 7, 4, 3,
137, 108, 249, 96, 48, 92, 181, 147,
53, 39, 224, 150, 58, 109, 130, 154,
105, 79, 212, 95, 239, 60, 77, 2,
212, 37, 150, 8, 173, 96, 33, 31,
17, 140, 66, 23, 10, 186, 209, 208,
133, 79, 211, 205, 254, 66, 90, 176,
54, 169, 233, 161, 44, 62, 8, 3,
173, 201, 128, 58, 82, 44, 178, 147,
185, 16, 92, 28, 174, 64, 136, 237,
240, 244, 27, 47, 143, 134, 163, 79,
36, 136, 108, 122, 156, 1, 132, 156,
15, 108, 132, 29, 160, 76, 129, 254,
80, 18, 43, 148, 140, 44, 68, 67,
46, 244, 144, 49, 172, 130, 118, 176,
194, 12, 81, 82, 33, 157, 71, 48,
68, 160, 16, 25, 131, 164, 29, 82,
4, 26, 3, 120, 112, 73, 226, 212,
207, 204, 112, 66, 23, 36, 0, 164,
232, 0, 22, 88, 133, 32, 172, 130,
34, 176, 193, 88, 77, 130, 212, 96,
211, 25, 157, 136, 235, 32, 199, 140,
120, 78, 28, 16, 130, 26, 97, 193,
26, 236, 96, 113, 24, 70, 138, 88,
93, 116, 221, 72, 26, 1, 71, 208,
232, 193, 155, 28, 132, 4, 248, 75,
77, 148, 79, 29, 13, 136, 139, 132,
1, 253, 112, 2, 91, 177, 216, 36,
104, 158, 28, 41, 194, 16, 65, 22,
136, 113, 2, 202, 140, 2, 253, 200,
194, 78, 105, 213, 137, 228, 194, 146,
77, 130, 134, 180, 24, 89, 76, 212,
209, 101, 197, 10, 84, 81, 68, 116,
206, 46, 181, 17, 41, 96, 209, 87,
68, 28, 25, 65, 214, 149, 25, 8,
41, 40, 218, 31, 53, 142, 29, 140,
220, 59, 205, 4, 242, 224, 153, 20,
176, 66, 54, 220, 195, 113, 177, 67,
168, 44, 23, 81, 252, 142, 235, 65,
139, 30, 224, 73, 24, 44, 77, 159,
25, 132, 164, 104, 6, 127, 209, 192,
94, 116, 83, 103, 88, 162, 10, 46,
138, 3, 157, 134, 88, 76, 15, 13,
56, 1, 132, 16, 201, 161, 180, 70,
107, 160, 91, 59, 149, 15, 254, 13,
248, 8, 107, 176, 10, 106, 180, 192,
163, 56, 84, 171, 140, 128, 191, 236,
6, 115, 232, 73, 131, 44, 84, 11,
196, 5, 16, 148, 133, 94, 192, 155,
59, 153, 14, 13, 172, 65, 227, 180,
146, 32, 174, 77, 181, 232, 158, 19,
40, 206, 87, 21, 210, 42, 80, 134,
231, 116, 210, 82, 37, 131, 86, 241,
223, 14, 62, 12, 100, 176, 65, 11,
120, 139, 219, 232, 129, 241, 140, 64,
28, 160, 92, 24, 241, 20, 202, 124,
200, 166, 48, 131, 195, 153, 72, 46,
212, 7, 45, 176, 136, 60, 158, 76,
204, 17, 130, 60, 194, 99, 127, 212,
144, 44, 96, 17, 39, 4, 17, 98,
97, 19, 41, 216, 77, 24, 156, 224,
9, 10, 64, 210, 41, 193, 21, 81,
34, 39, 48, 73, 26, 58, 196, 209,
196, 160, 162, 21, 33, 69, 162, 25,
250, 217, 129, 135, 112, 194, 229, 241,
193, 125, 200, 17, 27, 104, 205, 93,
129, 93, 208, 124, 136, 18, 176, 203,
241, 108, 133, 246, 53, 135, 161, 217,
97, 161, 61, 66, 25, 25, 145, 198,
40, 78, 220, 112, 2, 148, 76, 214,
24, 238, 148, 14, 37, 78, 147, 253,
205, 153, 56, 28, 202, 64, 9, 122,
212, 140, 136, 181, 128, 226, 53, 72,
229, 60, 68, 99, 20, 216, 103, 84,
77, 136, 8, 194, 46, 121, 227, 87,
113, 2, 41, 236, 157, 170, 77, 22,
209, 65, 5, 33, 138, 254, 196, 183,
172, 0, 27, 248, 194, 57, 220, 67,
81, 236, 14, 235, 37, 19, 59, 164,
222, 82, 44, 5, 83, 148, 10, 93,
153, 88, 159, 229, 15, 13, 40, 148,
177, 76, 14, 87, 160, 133, 236, 157,
132, 230, 20, 207, 216, 44, 196, 186,
152, 95, 190, 17, 65, 47, 198, 218,
248, 152, 79, 63, 145, 9, 4, 161,
91, 249, 217, 196, 109, 76, 147, 76,
32, 228, 72, 20, 208, 86, 36, 11,
163, 116, 64, 5, 24, 11, 186, 225,
138, 166, 117, 193, 7, 237, 12, 248,
36, 74, 42, 25, 17, 134, 204, 77,
26, 130, 83, 248, 72, 1, 252, 113,
130, 134, 172, 130, 170, 209, 141, 29,
196, 193, 23, 86, 3, 41, 184, 82,
201, 236, 160, 137, 173, 129, 137, 137,
163, 0, 148, 71, 18, 226, 25, 58,
38, 195, 25, 202, 88, 48, 140, 76,
197, 125, 195, 59, 26, 3, 100, 21,
85, 46, 80, 18, 112, 222, 152, 47,
116, 204, 25, 86, 3, 151, 16, 164,
141, 25, 3, 148, 228, 66, 146, 109,
99, 165, 1, 165, 65, 198, 68, 66,
192, 207, 181, 197, 1, 173, 213, 164,
63, 182, 145, 152, 49, 14, 154, 145,
72, 91, 129, 81, 12, 178, 149, 212,
152, 103, 21, 198, 72, 136, 196, 32,
139, 233, 193, 140, 188, 85, 216, 209,
149, 213, 97, 129, 64, 37, 4, 217,
176, 139, 77, 0, 193, 122, 180, 21,
54, 77, 194, 97, 254, 37, 77, 226,
32, 18, 36, 133, 231, 97, 165, 166,
35, 5, 200, 16, 109, 71, 48, 228,
194, 198, 160, 76, 122, 200, 194, 132,
66, 232, 36, 224, 23, 164, 36, 132,
112, 145, 193, 94, 172, 192, 104, 236,
12, 120, 8, 206, 157, 116, 8, 136,
96, 90, 23, 184, 221, 181, 104, 200,
209, 140, 130, 220, 64, 215, 9, 28,
196, 66, 117, 128, 15, 40, 66, 50,
164, 195, 61, 100, 3, 3, 146, 37,
115, 125, 3, 59, 36, 133, 114, 17,
69, 58, 144, 130, 29, 140, 210, 155,
124, 232, 178, 100, 128, 177, 208, 70,
233, 28, 138, 74, 160, 202, 95, 162,
5, 45, 166, 6, 115, 168, 196, 95,
250, 64, 5, 85, 216, 62, 89, 5,
68, 156, 5, 68, 48, 11, 4, 125,
215, 228, 168, 5, 237, 80, 85, 86,
28, 29, 188, 61, 138, 183, 108, 198,
178, 212, 210, 161, 0, 198, 21, 128,
29, 121, 128, 228, 137, 190, 142, 142,
164, 81, 140, 196, 136, 215, 133, 193,
155, 16, 1, 125, 234, 65, 26, 133,
136, 29, 160, 40, 72, 174, 194, 126,
228, 99, 52, 176, 66, 113, 96, 157,
137, 196, 129, 56, 38, 64, 24, 80,
9, 1, 158, 0, 27, 212, 24, 206,
189, 28, 115, 222, 24, 51, 232, 80,
117, 218, 152, 145, 53, 217, 203, 48,
195, 201, 156, 199, 223, 88, 204, 153,
40, 21, 198, 44, 18, 122, 176, 140,
226, 20, 200, 254, 118, 172, 130, 9,
54, 84, 245, 233, 0, 132, 40, 99,
139, 86, 97, 137, 208, 207, 27, 225,
149, 162, 141, 228, 134, 12, 72, 26,
10, 214, 128, 216, 8, 140, 236, 224,
116, 80, 199, 116, 72, 7, 37, 98,
83, 253, 17, 138, 183, 120, 139, 1,
84, 128, 94, 196, 154, 234, 76, 204,
155, 89, 150, 28, 165, 166, 170, 33,
214, 209, 220, 71, 210, 204, 90, 25,
169, 76, 118, 80, 37, 114, 46, 150,
170, 49, 22, 148, 180, 40, 148, 80,
66, 61, 105, 168, 66, 160, 18, 246,
116, 132, 116, 176, 77, 25, 9, 194,
161, 16, 92, 116, 228, 15, 176, 88,
226, 172, 184, 72, 140, 236, 32, 85,
66, 209, 100, 106, 134, 18, 140, 194,
238, 156, 131, 223, 196, 195, 142, 246,
78, 60, 48, 131, 143, 14, 197, 82,
132, 101, 56, 36, 70, 63, 73, 206,
233, 200, 137, 164, 192, 40, 91, 112,
68, 39, 14, 6, 73, 233, 133, 97,
66, 4, 124, 185, 147, 245, 44, 216,
182, 161, 27, 170, 244, 11, 153, 144,
201, 154, 166, 198, 74, 116, 31, 179,
84, 192, 59, 37, 79, 5, 192, 132,
1, 44, 24, 2, 149, 197, 241, 188,
132, 67, 225, 153, 18, 220, 137, 87,
72, 129, 229, 232, 65, 23, 196, 105,
57, 73, 135, 32, 68, 220, 105, 253,
215, 94, 88, 34, 211, 56, 132, 139,
204, 39, 221, 0, 75, 72, 142, 2,
35, 185, 254, 32, 104, 84, 77, 136,
121, 218, 3, 224, 83, 57, 106, 69,
28, 40, 18, 202, 236, 212, 102, 189,
12, 33, 41, 210, 203, 97, 76, 113,
38, 25, 198, 36, 195, 34, 53, 218,
149, 17, 164, 147, 5, 136, 223, 164,
135, 19, 109, 12, 132, 18, 40, 22,
60, 84, 245, 189, 69, 184, 145, 65,
21, 202, 145, 113, 120, 199, 181, 40,
154, 139, 176, 38, 117, 176, 193, 25,
61, 37, 24, 209, 143, 113, 24, 135,
14, 146, 157, 30, 80, 135, 117, 12,
68, 117, 196, 138, 234, 88, 91, 246,
45, 84, 242, 140, 68, 99, 248, 236,
55, 133, 1, 213, 16, 7, 139, 81,
198, 26, 53, 206, 213, 45, 6, 139,
196, 32, 114, 36, 214, 144, 26, 26,
223, 37, 170, 29, 80, 66, 148, 36,
234, 20, 210, 194, 186, 122, 156, 134,
62, 192, 161, 80, 166, 84, 76, 199,
122, 100, 150, 29, 124, 80, 172, 228,
69, 39, 142, 134, 73, 32, 212, 172,
88, 78, 214, 62, 194, 102, 233, 193,
200, 62, 152, 203, 157, 195, 59, 30,
133, 234, 241, 131, 238, 156, 229, 50,
133, 101, 54, 176, 193, 101, 244, 70,
77, 60, 74, 5, 244, 203, 100, 70,
4, 174, 8, 102, 178, 236, 94, 233,
60, 84, 77, 92, 15, 233, 245, 203,
9, 208, 44, 237, 172, 86, 191, 112,
105, 95, 44, 203, 149, 182, 83, 228,
160, 141, 95, 80, 149, 81, 254, 146,
86, 254, 168, 196, 9, 32, 143, 226,
137, 68, 6, 104, 206, 248, 156, 144,
172, 156, 22, 169, 77, 207, 21, 212,
166, 250, 12, 132, 235, 140, 71, 187,
61, 109, 4, 63, 158, 212, 204, 23,
159, 68, 7, 181, 50, 205, 46, 197,
72, 24, 12, 48, 164, 10, 239, 110,
94, 89, 226, 28, 210, 153, 32, 82,
106, 158, 73, 3, 106, 30, 132, 118,
140, 63, 66, 137, 170, 113, 130, 138,
96, 9, 33, 97, 81, 19, 85, 40,
124, 52, 47, 148, 220, 141, 209, 144,
2, 22, 28, 36, 66, 164, 96, 65,
144, 129, 107, 245, 160, 178, 162, 104,
252, 184, 8, 214, 48, 77, 70, 38,
73, 252, 200, 145, 212, 146, 193, 213,
61, 12, 138, 254, 159, 234, 216, 197,
5, 73, 7, 88, 136, 26, 179, 197,
37, 76, 36, 128, 201, 110, 69, 170,
164, 104, 209, 184, 96, 12, 134, 238,
135, 132, 221, 55, 197, 157, 38, 204,
205, 219, 133, 213, 237, 26, 90, 5,
174, 194, 88, 69, 73, 151, 132, 17,
101, 201, 11, 164, 32, 207, 9, 128,
19, 87, 192, 133, 130, 144, 135, 184,
224, 151, 19, 36, 137, 14, 156, 75,
24, 84, 68, 170, 120, 150, 172, 96,
238, 141, 120, 222, 118, 16, 2, 111,
208, 64, 28, 32, 81, 58, 216, 212,
34, 42, 172, 168, 20, 197, 34, 142,
74, 115, 69, 67, 102, 194, 104, 146,
86, 216, 67, 89, 207, 105, 248, 6,
254, 174, 40, 75, 103, 242, 6, 179,
168, 203, 75, 200, 132, 2, 89, 79,
146, 14, 134, 191, 232, 0, 72, 232,
5, 153, 168, 5, 188, 185, 98, 99,
64, 196, 76, 72, 64, 163, 248, 175,
134, 190, 178, 66, 37, 79, 131, 100,
5, 19, 246, 23, 66, 229, 143, 19,
44, 6, 57, 41, 129, 243, 128, 209,
83, 26, 71, 113, 16, 68, 234, 196,
157, 211, 192, 103, 12, 130, 72, 97,
116, 143, 20, 236, 89, 87, 181, 104,
178, 189, 91, 242, 76, 33, 5, 53,
70, 28, 88, 227, 239, 118, 9, 202,
209, 85, 77, 50, 39, 61, 105, 66,
219, 66, 96, 161, 105, 71, 106, 94,
29, 219, 192, 223, 42, 156, 150, 34,
157, 199, 35, 212, 141, 22, 33, 199,
135, 117, 1, 131, 8, 137, 0, 172,
155, 19, 180, 0, 164, 10, 130, 230,
252, 95, 125, 5, 225, 113, 176, 102,
30, 93, 93, 135, 128, 100, 91, 237,
210, 113, 104, 136, 14, 134, 152, 32,
92, 218, 98, 92, 208, 91, 33, 6,
117, 60, 165, 23, 239, 46, 206, 224,
89, 0, 59, 240, 181, 12, 238, 35,
48, 9, 152, 16, 157, 149, 76, 66,
226, 102, 150, 230, 205, 110, 132, 82,
210, 77, 159, 135, 47, 52, 146, 19,
129, 204, 98, 33, 18, 101, 41, 65,
5, 180, 235, 10, 232, 198, 21, 168,
207, 105, 113, 78, 3, 157, 142, 248,
134, 70, 11, 116, 1, 154, 61, 254,
140, 228, 78, 23, 138, 238, 171, 229,
120, 72, 133, 38, 195, 36, 16, 137,
149, 93, 234, 233, 53, 197, 114, 197,
195, 55, 56, 98, 90, 134, 229, 61,
24, 67, 241, 248, 197, 63, 145, 69,
11, 32, 68, 1, 187, 132, 86, 156,
206, 95, 220, 178, 123, 141, 205, 76,
84, 95, 245, 45, 212, 86, 16, 99,
68, 76, 155, 15, 236, 70, 203, 178,
197, 94, 152, 69, 178, 176, 226, 65,
234, 103, 187, 106, 232, 65, 59, 171,
183, 168, 203, 250, 50, 205, 26, 84,
81, 128, 165, 81, 139, 153, 196, 14,
207, 141, 137, 68, 210, 208, 196, 10,
226, 116, 33, 197, 21, 167, 63, 186,
213, 12, 171, 202, 157, 240, 1, 41,
192, 71, 163, 58, 24, 76, 60, 128,
8, 243, 198, 164, 98, 137, 113, 68,
32, 205, 32, 200, 153, 40, 78, 205,
105, 66, 81, 105, 71, 220, 208, 194,
200, 80, 165, 100, 5, 3, 205, 88,
218, 24, 70, 168, 195, 249, 77, 50,
236, 228, 33, 65, 96, 23, 164, 105,
66, 80, 153, 19, 132, 14, 154, 197,
93, 253, 172, 193, 226, 126, 228, 140,
0, 170, 75, 158, 81, 210, 172, 81,
26, 118, 51, 253, 132, 200, 133, 176,
129, 227, 94, 29, 213, 176, 24, 31,
64, 140, 63, 101, 64, 247, 104, 5,
115, 52, 16, 22, 152, 200, 92, 177,
24, 12, 130, 137, 148, 72, 73, 220,
129, 171, 202, 104, 66, 204, 254, 104,
21, 173, 105, 21, 114, 18, 93, 33,
109, 71, 205, 204, 36, 100, 113, 53,
76, 200, 142, 1, 172, 64, 3, 249,
32, 93, 53, 205, 35, 204, 138, 20,
228, 5, 109, 252, 133, 20, 172, 80,
93, 89, 200, 113, 88, 181, 35, 47,
198, 35, 192, 223, 203, 76, 216, 26,
80, 130, 129, 228, 66, 238, 128, 138,
39, 43, 19, 59, 84, 67, 194, 254,
40, 81, 56, 87, 48, 72, 184, 63,
61, 199, 44, 237, 177, 66, 232, 138,
120, 25, 75, 179, 56, 203, 66, 184,
196, 174, 57, 171, 4, 124, 132, 236,
141, 28, 159, 48, 10, 174, 232, 242,
102, 144, 73, 202, 142, 239, 12, 32,
184, 4, 136, 158, 98, 59, 235, 9,
22, 162, 186, 56, 182, 2, 149, 19,
10, 85, 30, 136, 196, 193, 180, 145,
1, 164, 29, 22, 221, 200, 221, 4,
114, 194, 116, 40, 194, 161, 45, 209,
140, 68, 18, 114, 106, 66, 71, 94,
217, 36, 108, 57, 186, 165, 208, 149,
42, 134, 251, 197, 4, 62, 201, 143,
63, 173, 1, 80, 55, 25, 79, 107,
117, 16, 113, 201, 223, 172, 106, 82,
157, 170, 3, 106, 85, 80, 87, 45,
151, 164, 176, 12, 125, 88, 106, 186,
241, 222, 33, 22, 133, 33, 164, 0,
244, 145, 158, 252, 173, 152, 165, 161,
113, 172, 8, 149, 172, 17, 139, 40,
106, 161, 157, 86, 196, 109, 186, 113,
204, 39, 136, 160, 247, 254, 239, 90,
205, 83, 94, 203, 137, 204, 166, 109,
249, 197, 248, 200, 9, 67, 88, 5,
105, 216, 8, 210, 206, 72, 155, 144,
145, 148, 136, 149, 231, 201, 205, 208,
64, 218, 149, 81, 146, 162, 239, 157,
224, 197, 140, 3, 102, 43, 148, 112,
53, 85, 37, 143, 33, 110, 69, 65,
57, 196, 219, 41, 77, 109, 66, 204,
10, 164, 152, 245, 116, 83, 170, 188,
89, 12, 66, 200, 6, 91, 238, 139,
140, 33, 206, 37, 234, 36, 244, 118,
143, 198, 67, 166, 160, 120, 50, 25,
83, 194, 2, 105, 83, 196, 131, 49,
156, 10, 91, 120, 150, 112, 92, 91,
75, 16, 20, 105, 17, 223, 233, 12,
138, 233, 192, 232, 48, 87, 148, 236,
177, 134, 48, 118, 20, 73, 164, 196,
94, 212, 4, 124, 53, 41, 147, 79,
85, 242, 44, 152, 143, 67, 121, 33,
254, 239, 38, 14, 203, 105, 97, 183,
10, 214, 166, 12, 133, 214, 172, 177,
21, 150, 184, 113, 129, 30, 136, 9,
215, 164, 202, 68, 224, 4, 126, 152,
226, 66, 72, 159, 253, 237, 42, 240,
193, 214, 22, 86, 105, 40, 193, 10,
172, 129, 79, 18, 18, 37, 109, 22,
114, 242, 221, 16, 113, 9, 224, 29,
232, 4, 162, 182, 217, 106, 213, 153,
200, 60, 35, 189, 228, 12, 111, 200,
31, 133, 160, 151, 92, 65, 140, 38,
196, 12, 228, 79, 229, 172, 149, 212,
76, 245, 128, 228, 254, 233, 166, 179,
152, 64, 104, 49, 232, 66, 110, 216,
73, 174, 168, 99, 211, 120, 147, 247,
181, 208, 200, 83, 134, 65, 111, 188,
138, 188, 8, 201, 12, 76, 246, 38,
37, 245, 142, 184, 143, 168, 113, 253,
93, 205, 21, 213, 180, 213, 134, 164,
81, 25, 89, 161, 223, 33, 86, 102,
207, 174, 21, 54, 205, 195, 57, 65,
179, 62, 171, 99, 187, 47, 42, 73,
76, 212, 119, 115, 248, 60, 8, 116,
99, 69, 7, 16, 65, 30, 217, 193,
162, 48, 15, 135, 79, 156, 199, 36,
81, 56, 180, 173, 34, 158, 117, 35,
150, 187, 168, 32, 197, 61, 144, 245,
39, 187, 56, 51, 172, 1, 107, 140,
70, 21, 205, 120, 191, 128, 31, 174,
212, 245, 149, 210, 175, 89, 172, 192,
0, 187, 161, 41, 162, 5, 72, 0,
88, 191, 220, 178, 43, 206, 126, 43,
178, 133, 44, 246, 70, 242, 76, 230,
67, 181, 43, 149, 39, 123, 172, 206,
196, 67, 145, 94, 68, 160, 104, 26,
42, 26, 248, 96, 1, 37, 200, 29,
98, 101, 36, 77, 146, 66, 155, 212,
164, 12, 249, 161, 145, 104, 30, 15,
193, 85, 252, 129, 216, 223, 82, 86,
139, 66, 198, 97, 233, 129, 108, 60,
234, 255, 97, 95, 203, 23, 18, 99,
241, 80, 226, 168, 140, 101, 29, 18,
130, 14, 77, 37, 29, 141, 27, 215,
140, 67, 46, 209, 129, 52, 137, 230,
105, 72, 253, 254, 140, 213, 75, 74,
29, 71, 13, 240, 209, 231, 143, 81,
3, 196, 35, 65, 108, 200, 8, 210,
99, 71, 207, 154, 48, 118, 12, 18,
138, 19, 166, 96, 194, 48, 82, 174,
116, 9, 195, 38, 14, 22, 44, 107,
244, 196, 209, 67, 6, 75, 24, 61,
108, 236, 196, 177, 168, 71, 15, 31,
62, 93, 174, 196, 33, 212, 101, 133,
132, 14, 82, 176, 204, 144, 144, 161,
5, 22, 39, 39, 116, 176, 121, 84,
178, 203, 154, 56, 130, 132, 198, 145,
210, 229, 17, 33, 66, 143, 200, 132,
121, 52, 233, 145, 38, 59, 97, 38,
145, 162, 196, 137, 15, 153, 73, 171,
40, 141, 122, 20, 231, 17, 87, 77,
138, 214, 240, 25, 165, 232, 202, 138,
4, 2, 4, 36, 120, 32, 224, 193,
131, 10, 35, 86, 100, 24, 49, 67,
135, 148, 162, 118, 216, 92, 113, 82,
49, 204, 21, 34, 52, 78, 208, 93,
177, 162, 69, 11, 29, 78, 66, 146,
17, 202, 41, 218, 185, 116, 236, 226,
85, 142, 151, 15, 51, 63, 205, 152,
243, 105, 246, 252, 153, 95, 190, 116,
217, 46, 103, 14, 205, 249, 94, 53,
59, 68, 148, 116, 113, 66, 4, 136,
15, 29, 178, 137, 96, 129, 45, 155,
198, 12, 26, 58, 116, 204, 0, 34,
133, 6, 141, 22, 107, 19, 72, 72,
96, 32, 193, 138, 219, 88, 128, 204,
80, 146, 123, 70, 244, 232, 58, 174,
232, 200, 254, 13, 125, 134, 15, 1,
35, 58, 176, 21, 96, 192, 128, 119,
241, 223, 189, 131, 111, 251, 54, 124,
219, 155, 116, 137, 92, 81, 100, 7,
139, 96, 29, 100, 56, 77, 226, 180,
74, 207, 149, 73, 178, 56, 221, 143,
115, 69, 19, 82, 52, 89, 133, 20,
59, 236, 152, 100, 148, 81, 100, 33,
37, 37, 89, 86, 81, 144, 18, 59,
20, 228, 132, 20, 78, 200, 96, 131,
148, 81, 226, 232, 238, 129, 46, 4,
177, 227, 10, 37, 86, 32, 35, 65,
74, 204, 98, 37, 192, 73, 248, 176,
35, 64, 82, 86, 153, 196, 37, 174,
56, 81, 132, 140, 56, 40, 161, 132,
20, 86, 178, 154, 132, 150, 85, 100,
209, 196, 177, 4, 21, 33, 132, 13,
44, 236, 160, 68, 17, 77, 8, 193,
162, 11, 77, 38, 113, 34, 61, 182,
90, 112, 66, 68, 15, 245, 248, 107,
69, 54, 244, 8, 195, 9, 59, 8,
73, 41, 14, 39, 60, 156, 42, 12,
37, 156, 80, 168, 198, 46, 148, 32,
195, 14, 199, 202, 196, 34, 14, 50,
46, 140, 47, 14, 54, 132, 154, 168,
198, 180, 110, 18, 211, 135, 10, 36,
88, 65, 10, 37, 78, 160, 97, 161,
53, 20, 234, 2, 163, 166, 88, 234,
194, 64, 59, 248, 64, 73, 37, 61,
12, 210, 131, 16, 69, 4, 121, 212,
81, 165, 8, 17, 68, 16, 66, 86,
172, 51, 142, 56, 30, 149, 226, 4,
241, 254, 12, 88, 239, 132, 25, 70,
40, 174, 131, 17, 90, 0, 2, 139,
11, 155, 226, 11, 162, 48, 176, 144,
226, 53, 44, 148, 232, 192, 207, 17,
244, 130, 104, 13, 54, 204, 10, 166,
154, 115, 216, 185, 135, 179, 206, 62,
83, 22, 52, 208, 206, 137, 6, 89,
102, 243, 65, 246, 158, 123, 190, 185,
178, 34, 37, 98, 155, 109, 54, 34,
164, 144, 141, 55, 232, 130, 163, 193,
7, 34, 172, 27, 142, 45, 240, 12,
120, 224, 4, 34, 104, 195, 139, 8,
233, 18, 147, 174, 183, 25, 18, 67,
44, 58, 1, 42, 232, 110, 188, 126,
77, 77, 224, 56, 243, 210, 139, 43,
46, 156, 136, 112, 2, 136, 113, 137,
224, 136, 143, 77, 153, 172, 116, 83,
65, 186, 240, 240, 82, 78, 85, 218,
20, 226, 135, 26, 238, 212, 210, 74,
57, 5, 145, 13, 78, 201, 24, 161,
173, 48, 62, 244, 107, 133, 48, 174,
154, 138, 18, 86, 186, 154, 68, 216,
81, 42, 36, 229, 189, 71, 80, 212,
36, 66, 62, 156, 68, 240, 17, 61,
90, 238, 47, 66, 22, 39, 185, 52,
14, 142, 20, 73, 233, 163, 56, 20,
225, 67, 137, 40, 5, 88, 129, 74,
29, 98, 37, 163, 11, 89, 229, 108,
138, 13, 130, 220, 116, 76, 209, 43,
152, 236, 66, 163, 248, 38, 190, 149,
34, 150, 174, 56, 251, 236, 248, 208,
182, 245, 86, 85, 71, 16, 19, 136,
254, 10, 146, 83, 130, 136, 22, 88,
115, 130, 34, 191, 192, 238, 66, 10,
34, 194, 176, 21, 88, 59, 73, 218,
210, 177, 172, 237, 44, 107, 141, 11,
19, 55, 84, 161, 191, 87, 76, 92,
137, 12, 210, 21, 64, 2, 26, 128,
232, 77, 9, 29, 0, 54, 110, 223,
19, 128, 184, 226, 34, 190, 18, 15,
99, 98, 139, 168, 6, 98, 133, 125,
157, 122, 212, 80, 146, 194, 10, 38,
27, 201, 144, 109, 214, 51, 209, 226,
161, 61, 30, 210, 226, 169, 54, 51,
204, 170, 13, 231, 17, 176, 3, 61,
152, 136, 226, 129, 136, 205, 135, 227,
125, 72, 126, 121, 112, 121, 211, 33,
177, 82, 195, 67, 110, 4, 119, 125,
160, 97, 133, 114, 119, 179, 110, 183,
232, 176, 179, 215, 222, 21, 40, 231,
119, 114, 127, 203, 11, 239, 184, 241,
36, 144, 224, 1, 153, 174, 63, 225,
132, 21, 124, 251, 139, 201, 191, 107,
172, 159, 116, 211, 57, 34, 93, 78,
136, 228, 44, 171, 41, 84, 11, 67,
176, 18, 149, 56, 132, 92, 168, 11,
28, 10, 3, 31, 250, 226, 132, 22,
116, 65, 41, 6, 242, 152, 82, 20,
161, 136, 73, 76, 66, 17, 143, 24,
210, 83, 42, 168, 148, 75, 33, 77,
82, 155, 58, 72, 73, 74, 82, 39,
195, 97, 164, 104, 97, 136, 3, 95,
200, 0, 4, 167, 77, 169, 120, 19,
187, 66, 214, 192, 22, 182, 144, 254,
212, 176, 11, 9, 241, 154, 218, 174,
112, 148, 255, 56, 1, 111, 64, 84,
130, 18, 226, 100, 38, 92, 81, 9,
111, 82, 56, 10, 124, 66, 212, 130,
17, 156, 224, 40, 68, 88, 223, 10,
232, 230, 131, 16, 5, 49, 80, 20,
193, 21, 16, 28, 195, 36, 181, 49,
73, 84, 164, 11, 201, 223, 98, 53,
18, 69, 141, 209, 126, 107, 40, 137,
156, 148, 240, 150, 242, 116, 96, 5,
39, 144, 192, 189, 58, 144, 129, 10,
100, 0, 143, 29, 56, 129, 15, 216,
48, 9, 77, 36, 133, 15, 22, 212,
224, 151, 214, 32, 133, 22, 100, 192,
7, 122, 120, 196, 79, 6, 72, 18,
77, 228, 162, 88, 233, 40, 13, 237,
52, 147, 140, 96, 220, 163, 89, 236,
168, 198, 55, 38, 67, 25, 212, 84,
235, 28, 156, 40, 154, 216, 72, 23,
40, 32, 152, 233, 53, 119, 83, 98,
108, 88, 83, 60, 31, 204, 96, 48,
228, 105, 139, 231, 128, 96, 46, 203,
197, 230, 120, 74, 192, 205, 242, 50,
183, 61, 29, 36, 140, 114, 165, 42,
143, 249, 250, 21, 37, 55, 198, 229,
38, 39, 64, 24, 98, 44, 167, 4,
154, 196, 135, 73, 33, 91, 148, 173,
170, 38, 20, 69, 176, 193, 34, 127,
3, 150, 75, 226, 100, 17, 211, 41,
78, 40, 17, 124, 72, 119, 18, 208,
5, 6, 6, 42, 101, 124, 9, 36,
9, 81, 210, 78, 62, 92, 254, 138,
16, 42, 74, 9, 166, 74, 34, 8,
74, 28, 228, 81, 69, 83, 72, 195,
178, 102, 168, 171, 249, 179, 32, 132,
176, 195, 26, 136, 224, 52, 168, 57,
129, 6, 103, 211, 75, 145, 208, 70,
17, 30, 118, 33, 78, 26, 233, 33,
174, 40, 18, 24, 42, 81, 148, 74,
61, 76, 98, 241, 188, 229, 23, 37,
146, 45, 94, 122, 20, 147, 18, 42,
80, 129, 132, 218, 134, 6, 74, 240,
154, 161, 184, 164, 68, 57, 85, 13,
107, 7, 89, 225, 10, 63, 197, 151,
144, 85, 108, 69, 154, 218, 20, 31,
56, 24, 65, 32, 176, 101, 45, 223,
57, 213, 113, 100, 194, 45, 225, 220,
235, 4, 9, 160, 129, 30, 52, 241,
71, 69, 112, 66, 19, 156, 64, 210,
138, 4, 101, 128, 10, 92, 161, 82,
8, 153, 138, 26, 5, 49, 10, 99,
48, 227, 28, 213, 138, 214, 236, 52,
115, 15, 95, 228, 226, 118, 204, 178,
214, 42, 56, 193, 140, 201, 164, 35,
29, 99, 141, 71, 56, 40, 97, 167,
175, 85, 36, 80, 72, 20, 204, 193,
140, 120, 188, 84, 210, 77, 7, 171,
178, 11, 250, 218, 85, 60, 188, 44,
239, 120, 167, 180, 14, 242, 6, 51,
174, 217, 216, 36, 3, 52, 112, 35,
49, 135, 105, 62, 240, 36, 96, 46,
52, 16, 34, 253, 188, 54, 49, 255,
5, 171, 117, 39, 92, 225, 8, 13,
52, 211, 148, 124, 16, 254, 33, 243,
180, 24, 199, 52, 72, 35, 114, 98,
97, 36, 130, 57, 1, 156, 68, 213,
51, 153, 162, 48, 181, 146, 90, 154,
129, 14, 210, 91, 65, 12, 9, 105,
113, 74, 156, 225, 88, 234, 217, 0,
6, 43, 84, 45, 124, 33, 149, 102,
112, 133, 166, 216, 15, 108, 108, 219,
91, 168, 236, 244, 220, 53, 212, 80,
10, 11, 41, 90, 0, 81, 130, 145,
235, 186, 73, 162, 16, 173, 147, 66,
164, 176, 130, 7, 204, 164, 76, 118,
228, 163, 32, 194, 160, 217, 26, 93,
101, 18, 118, 160, 201, 35, 40, 209,
41, 129, 40, 98, 20, 80, 157, 17,
33, 154, 58, 9, 74, 40, 197, 69,
154, 24, 197, 31, 115, 36, 179, 81,
92, 101, 192, 81, 213, 131, 14, 198,
19, 176, 182, 140, 64, 7, 42, 141,
15, 66, 159, 136, 61, 3, 80, 145,
12, 122, 176, 160, 176, 134, 196, 135,
53, 164, 238, 59, 52, 80, 218, 138,
110, 85, 56, 65, 112, 66, 22, 209,
144, 164, 101, 120, 87, 86, 102, 36,
3, 147, 159, 185, 199, 57, 114, 225,
71, 20, 39, 35, 27, 225, 96, 199,
180, 230, 26, 60, 210, 217, 202, 91,
58, 25, 222, 107, 84, 170, 75, 51,
85, 81, 179, 213, 145, 91, 6, 146,
58, 75, 214, 248, 192, 85, 179, 97,
30, 183, 156, 215, 189, 232, 32, 102,
4, 136, 148, 28, 101, 185, 252, 157,
7, 20, 103, 4, 254, 62, 32, 195,
82, 118, 74, 65, 12, 86, 202, 143,
249, 117, 82, 84, 101, 86, 161, 171,
80, 232, 65, 56, 27, 133, 143, 88,
81, 161, 57, 203, 130, 22, 180, 96,
5, 133, 88, 33, 11, 89, 176, 98,
20, 107, 144, 156, 4, 204, 217, 151,
42, 45, 101, 145, 150, 210, 240, 144,
58, 156, 36, 156, 81, 34, 41, 148,
216, 153, 165, 52, 193, 138, 7, 13,
184, 82, 29, 155, 20, 106, 87, 40,
233, 11, 254, 132, 8, 227, 153, 210,
115, 168, 226, 164, 69, 38, 4, 33,
227, 5, 203, 32, 61, 92, 35, 193,
13, 144, 83, 96, 210, 18, 167, 56,
165, 144, 209, 81, 109, 35, 89, 171,
211, 78, 206, 155, 93, 39, 140, 160,
2, 243, 73, 8, 107, 46, 84, 193,
21, 245, 144, 167, 239, 125, 4, 31,
38, 33, 41, 168, 10, 66, 158, 126,
20, 196, 31, 143, 116, 22, 39, 233,
161, 42, 150, 130, 143, 57, 201, 32,
62, 241, 172, 15, 125, 56, 185, 178,
252, 42, 0, 158, 14, 180, 160, 3,
9, 200, 192, 98, 68, 5, 209, 255,
254, 103, 4, 113, 105, 75, 94, 116,
217, 2, 31, 132, 68, 40, 26, 206,
197, 55, 194, 145, 141, 106, 88, 50,
25, 58, 14, 199, 100, 194, 193, 172,
207, 196, 35, 26, 82, 113, 221, 190,
39, 51, 227, 73, 92, 200, 86, 126,
241, 154, 16, 127, 115, 68, 186, 225,
13, 54, 214, 254, 17, 19, 17, 178,
92, 199, 114, 39, 224, 4, 85, 35,
66, 252, 202, 165, 188, 228, 229, 18,
177, 203, 107, 44, 246, 170, 183, 229,
46, 167, 107, 178, 233, 66, 142, 4,
102, 208, 5, 11, 38, 8, 131, 254,
85, 4, 124, 43, 157, 95, 82, 88,
101, 64, 156, 152, 243, 204, 46, 237,
102, 86, 88, 186, 207, 63, 119, 208,
157, 231, 188, 103, 10, 145, 130, 13,
131, 246, 144, 81, 68, 180, 6, 5,
101, 72, 64, 54, 115, 144, 165, 253,
200, 10, 90, 228, 72, 70, 25, 106,
42, 33, 56, 145, 139, 92, 244, 153,
22, 24, 228, 224, 36, 190, 164, 148,
211, 218, 33, 42, 79, 225, 4, 33,
66, 45, 158, 22, 4, 234, 129, 59,
95, 218, 127, 131, 226, 24, 208, 170,
132, 47, 14, 65, 163, 80, 216, 132,
220, 129, 80, 87, 105, 219, 102, 146,
156, 66, 2, 58, 54, 93, 193, 137,
29, 112, 174, 19, 74, 74, 3, 68,
249, 5, 8, 136, 250, 80, 173, 156,
144, 97, 103, 46, 69, 82, 160, 139,
74, 32, 255, 70, 118, 104, 179, 65,
10, 76, 141, 39, 31, 90, 66, 22,
39, 204, 224, 142, 215, 11, 106, 121,
2, 230, 22, 185, 249, 203, 0, 29,
80, 213, 190, 156, 3, 17, 146, 20,
146, 6, 233, 94, 203, 186, 206, 219,
129, 86, 45, 38, 86, 225, 60, 176,
141, 47, 200, 137, 62, 39, 67, 146,
148, 12, 254, 77, 52, 222, 83, 18,
61, 208, 194, 88, 241, 56, 7, 37,
18, 7, 182, 166, 104, 244, 40, 26,
1, 226, 248, 129, 120, 155, 228, 125,
75, 110, 55, 97, 95, 5, 160, 200,
28, 197, 28, 57, 149, 84, 170, 77,
172, 116, 213, 30, 154, 144, 170, 122,
228, 123, 57, 184, 251, 85, 156, 68,
18, 105, 218, 254, 75, 19, 4, 225,
66, 228, 76, 71, 50, 236, 192, 18,
100, 160, 8, 97, 207, 86, 65, 19,
178, 38, 170, 156, 15, 70, 244, 224,
231, 86, 97, 21, 166, 130, 15, 122,
4, 69, 12, 165, 101, 54, 132, 114,
10, 173, 111, 78, 128, 12, 112, 134,
83, 4, 140, 16, 242, 171, 82, 172,
130, 191, 4, 130, 18, 100, 33, 209,
30, 133, 18, 252, 139, 43, 236, 169,
198, 150, 38, 84, 98, 208, 64, 228,
132, 13, 142, 70, 131, 12, 229, 143,
234, 206, 59, 70, 45, 239, 8, 16,
41, 38, 129, 116, 128, 8, 78, 66,
166, 47, 174, 224, 100, 160, 41, 40,
46, 34, 62, 200, 128, 129, 20, 194,
107, 116, 200, 47, 172, 72, 137, 66,
196, 7, 164, 128, 12, 94, 15, 143,
184, 208, 9, 50, 32, 1, 102, 32,
86, 158, 99, 5, 116, 128, 81, 92,
3, 34, 240, 134, 57, 124, 0, 81,
18, 7, 136, 60, 34, 107, 4, 131,
77, 104, 104, 77, 20, 137, 44, 142,
2, 161, 100, 227, 4, 42, 160, 5,
36, 254, 160, 152, 36, 96, 95, 234,
40, 3, 208, 167, 164, 238, 136, 125,
214, 141, 6, 50, 64, 38, 178, 71,
165, 250, 6, 122, 102, 64, 45, 216,
66, 46, 128, 237, 1, 172, 234, 85,
156, 9, 81, 60, 98, 20, 130, 33,
26, 152, 33, 24, 30, 144, 236, 140,
225, 28, 118, 199, 224, 54, 35, 30,
104, 1, 218, 18, 130, 15, 130, 129,
50, 206, 129, 41, 64, 34, 10, 245,
128, 111, 216, 112, 75, 112, 5, 149,
228, 175, 121, 154, 3, 61, 46, 209,
170, 148, 163, 151, 106, 73, 136, 134,
136, 24, 79, 201, 36, 0, 107, 97,
174, 64, 143, 136, 64, 255, 184, 204,
0, 226, 13, 247, 124, 165, 82, 52,
34, 158, 146, 68, 15, 96, 75, 170,
4, 12, 155, 8, 193, 42, 164, 202,
7, 247, 140, 20, 152, 194, 14, 244,
107, 21, 20, 1, 44, 0, 77, 1,
227, 64, 65, 100, 6, 102, 4, 193,
71, 244, 64, 114, 58, 36, 33, 250,
38, 101, 254, 203, 78, 240, 139, 16,
234, 203, 34, 112, 134, 82, 200, 224,
10, 248, 128, 102, 4, 33, 35, 156,
194, 130, 68, 233, 10, 108, 70, 32,
140, 226, 32, 191, 98, 13, 94, 99,
129, 236, 224, 104, 68, 79, 16, 128,
144, 45, 102, 128, 30, 165, 96, 160,
106, 201, 64, 92, 163, 57, 142, 2,
34, 152, 227, 10, 20, 226, 175, 158,
233, 86, 148, 96, 140, 116, 194, 91,
254, 192, 166, 135, 204, 5, 149, 170,
200, 91, 68, 100, 142, 156, 75, 9,
4, 177, 230, 176, 64, 123, 102, 160,
243, 204, 36, 68, 88, 163, 24, 25,
67, 163, 110, 136, 111, 116, 50, 108,
148, 40, 12, 136, 68, 9, 46, 194,
137, 104, 128, 57, 168, 136, 100, 190,
195, 45, 112, 130, 6, 184, 131, 201,
254, 80, 95, 182, 7, 8, 14, 73,
247, 2, 171, 125, 26, 81, 54, 84,
69, 2, 232, 194, 152, 250, 112, 93,
58, 192, 7, 228, 207, 153, 68, 162,
19, 163, 33, 26, 140, 65, 17, 76,
102, 206, 104, 33, 25, 190, 33, 198,
150, 37, 31, 178, 225, 17, 160, 42,
107, 30, 33, 26, 122, 172, 135, 152,
100, 136, 248, 198, 107, 220, 165, 111,
238, 15, 37, 41, 194, 153, 98, 3,
93, 214, 5, 60, 190, 210, 36, 139,
7, 111, 64, 167, 179, 240, 230, 251,
16, 234, 115, 198, 207, 7, 50, 128,
138, 154, 145, 178, 190, 242, 18, 251,
175, 5, 110, 74, 157, 30, 197, 32,
28, 165, 99, 58, 204, 131, 60, 70,
16, 6, 105, 167, 54, 230, 183, 146,
34, 131, 32, 230, 157, 58, 72, 132,
36, 133, 18, 226, 160, 2, 224, 194,
156, 10, 137, 8, 86, 0, 11, 150,
102, 13, 96, 139, 83, 204, 209, 185,
62, 232, 26, 215, 171, 36, 26, 210,
72, 68, 37, 63, 156, 64, 82, 82,
40, 187, 248, 130, 47, 240, 102, 254,
113, 36, 70, 9, 130, 133, 12, 148,
96, 60, 112, 114, 55, 127, 195, 200,
20, 234, 53, 126, 3, 109, 60, 106,
194, 198, 47, 111, 148, 200, 161, 206,
230, 162, 210, 102, 162, 168, 100, 136,
134, 177, 110, 70, 0, 86, 202, 228,
38, 22, 227, 47, 156, 96, 121, 126,
201, 107, 76, 210, 47, 198, 239, 96,
188, 6, 48, 170, 38, 127, 156, 80,
48, 248, 38, 54, 118, 35, 110, 158,
49, 176, 214, 197, 59, 182, 210, 87,
186, 32, 222, 212, 237, 4, 222, 162,
3, 154, 73, 182, 94, 133, 227, 192,
173, 96, 0, 70, 168, 188, 99, 253,
58, 224, 203, 82, 197, 13, 113, 5,
54, 214, 132, 15, 186, 162, 190, 60,
34, 73, 234, 99, 18, 152, 97, 118,
146, 5, 89, 210, 193, 43, 100, 193,
28, 227, 96, 21, 206, 97, 251, 102,
35, 249, 174, 96, 55, 188, 102, 121,
16, 195, 36, 25, 226, 91, 40, 226,
66, 18, 6, 93, 100, 233, 1, 170,
71, 111, 244, 194, 36, 164, 144, 75,
196, 36, 35, 154, 131, 6, 136, 32,
40, 84, 234, 1, 166, 132, 100, 210,
195, 60, 112, 207, 227, 156, 134, 45,
230, 200, 127, 254, 7, 77, 24, 71,
215, 176, 45, 33, 86, 200, 81, 96,
4, 84, 148, 134, 44, 112, 235, 67,
70, 11, 37, 172, 79, 37, 48, 133,
36, 236, 32, 129, 62, 80, 135, 148,
32, 39, 248, 64, 184, 228, 254, 68,
84, 174, 203, 159, 128, 34, 249, 174,
198, 34, 8, 232, 80, 250, 135, 140,
80, 162, 106, 162, 171, 86, 88, 2,
112, 194, 224, 167, 196, 67, 179, 128,
96, 143, 200, 111, 162, 196, 179, 108,
84, 50, 108, 206, 70, 120, 152, 164,
34, 106, 8, 36, 240, 10, 116, 110,
229, 86, 254, 194, 53, 38, 236, 57,
112, 210, 34, 218, 104, 12, 245, 71,
62, 254, 98, 116, 66, 2, 111, 184,
164, 53, 192, 134, 13, 72, 167, 78,
176, 13, 36, 46, 132, 110, 182, 4,
47, 154, 35, 203, 78, 5, 143, 130,
234, 1, 204, 11, 46, 114, 194, 14,
108, 162, 125, 128, 13, 179, 78, 160,
5, 124, 35, 94, 172, 72, 71, 103,
224, 4, 166, 199, 152, 166, 231, 59,
244, 72, 110, 230, 98, 5, 18, 202,
47, 232, 70, 47, 46, 101, 20, 188,
206, 23, 206, 234, 71, 20, 137, 25,
142, 69, 172, 118, 167, 90, 216, 65,
22, 246, 227, 1, 217, 128, 16, 162,
33, 28, 38, 97, 54, 2, 101, 98,
178, 67, 91, 156, 41, 123, 98, 35,
107, 84, 10, 161, 206, 166, 44, 105,
96, 246, 210, 101, 4, 0, 43, 115,
40, 162, 44, 217, 32, 115, 170, 35,
56, 182, 53, 58, 218, 195, 7, 176,
19, 106, 52, 147, 152, 150, 44, 74,
168, 21, 80, 26, 227, 106, 10, 39,
180, 180, 4, 43, 212, 232, 86, 153,
66, 215, 180, 228, 35, 254, 72, 139,
183, 16, 2, 83, 230, 233, 81, 72,
43, 78, 186, 131, 208, 116, 200, 129,
176, 128, 36, 166, 112, 188, 16, 66,
75, 6, 42, 195, 180, 198, 239, 192,
41, 185, 88, 10, 226, 98, 69, 50,
107, 164, 77, 182, 171, 240, 28, 67,
59, 32, 85, 10, 128, 0, 62, 91,
170, 73, 225, 144, 188, 84, 104, 80,
189, 6, 155, 16, 69, 35, 12, 197,
185, 4, 168, 47, 170, 70, 72, 245,
6, 9, 117, 5, 37, 159, 131, 6,
42, 138, 164, 104, 46, 62, 178, 171,
111, 16, 43, 108, 192, 198, 153, 80,
178, 61, 254, 166, 154, 198, 209, 23,
234, 234, 86, 106, 73, 39, 12, 116,
6, 236, 72, 67, 163, 68, 203, 12,
224, 4, 102, 130, 105, 140, 131, 201,
34, 244, 43, 117, 35, 58, 20, 163,
34, 96, 67, 152, 40, 203, 170, 24,
209, 248, 252, 4, 80, 190, 207, 153,
216, 160, 236, 98, 71, 50, 210, 161,
223, 40, 129, 62, 152, 33, 28, 206,
33, 28, 54, 183, 115, 37, 227, 28,
80, 68, 64, 212, 201, 23, 152, 129,
13, 90, 192, 114, 116, 32, 142, 246,
72, 229, 118, 211, 58, 206, 80, 54,
50, 167, 111, 21, 163, 57, 92, 142,
67, 155, 181, 85, 14, 3, 49, 152,
21, 47, 202, 36, 46, 206, 205, 94,
244, 104, 5, 72, 166, 122, 110, 83,
60, 58, 51, 16, 41, 231, 124, 210,
3, 80, 236, 103, 254, 187, 132, 34,
88, 58, 66, 40, 14, 40, 75, 218,
164, 37, 6, 130, 36, 66, 4, 76,
26, 134, 33, 154, 205, 75, 62, 100,
41, 68, 19, 37, 4, 162, 77, 92,
118, 33, 200, 0, 87, 242, 244, 157,
244, 20, 82, 68, 5, 123, 101, 106,
69, 6, 104, 75, 132, 69, 78, 58,
66, 36, 76, 130, 35, 106, 40, 74,
147, 11, 40, 46, 194, 34, 138, 164,
11, 30, 213, 59, 50, 47, 94, 24,
195, 153, 178, 8, 135, 194, 134, 127,
60, 107, 98, 10, 245, 111, 70, 39,
113, 146, 111, 80, 227, 35, 48, 178,
75, 111, 116, 133, 111, 240, 226, 47,
186, 208, 79, 166, 36, 36, 3, 131,
160, 148, 131, 37, 168, 144, 73, 178,
203, 38, 157, 192, 36, 6, 232, 72,
100, 193, 23, 162, 193, 23, 20, 65,
39, 16, 230, 149, 200, 101, 90, 43,
171, 45, 238, 136, 93, 166, 149, 8,
200, 226, 110, 159, 40, 66, 215, 133,
46, 236, 5, 194, 188, 230, 114, 40,
182, 255, 110, 162, 5, 166, 149, 111,
175, 86, 48, 90, 130, 20, 170, 161,
147, 226, 129, 29, 210, 33, 26, 138,
198, 21, 239, 33, 29, 56, 247, 27,
212, 146, 25, 254, 173, 62, 18, 196,
195, 244, 96, 21, 88, 1, 79, 119,
195, 188, 8, 81, 89, 9, 38, 203,
218, 167, 142, 142, 3, 51, 91, 224,
48, 250, 208, 178, 26, 241, 48, 236,
136, 89, 81, 254, 39, 46, 230, 226,
137, 124, 24, 16, 225, 211, 120, 189,
131, 59, 252, 229, 38, 74, 10, 121,
145, 163, 45, 90, 32, 12, 174, 201,
39, 166, 2, 219, 214, 192, 158, 106,
245, 183, 184, 144, 70, 172, 22, 8,
72, 194, 112, 142, 135, 132, 158, 234,
100, 225, 238, 17, 66, 6, 210, 222,
201, 64, 34, 37, 12, 204, 183, 77,
240, 110, 33, 217, 196, 166, 76, 72,
112, 60, 130, 132, 234, 164, 41, 132,
235, 121, 9, 130, 86, 32, 194, 163,
32, 194, 149, 89, 104, 78, 130, 194,
133, 196, 3, 8, 194, 192, 93, 216,
48, 107, 215, 192, 107, 30, 2, 162,
108, 5, 129, 12, 37, 36, 76, 130,
106, 159, 112, 35, 22, 197, 31, 193,
6, 111, 248, 134, 38, 134, 104, 139,
150, 73, 74, 101, 242, 54, 59, 224,
151, 190, 243, 57, 232, 130, 92, 172,
7, 121, 2, 37, 56, 154, 39, 74,
37, 68, 16, 100, 33, 27, 162, 129,
21, 200, 224, 62, 161, 103, 96, 191,
3, 16, 115, 47, 203, 224, 231, 84,
156, 32, 144, 174, 160, 15, 75, 138,
125, 214, 3, 142, 182, 21, 87, 102,
192, 67, 95, 14, 46, 74, 106, 248,
30, 168, 86, 93, 3, 162, 218, 42,
138, 231, 106, 20, 224, 36, 26, 58,
99, 90, 238, 33, 30, 44, 55, 28,
140, 129, 237, 238, 242, 17, 108, 133,
69, 244, 160, 89, 205, 248, 1, 196,
80, 95, 254, 6, 54, 144, 219, 162,
16, 5, 32, 3, 194, 7, 49, 234,
194, 124, 138, 3, 126, 82, 231, 72,
251, 86, 114, 172, 202, 67, 159, 72,
90, 215, 98, 5, 128, 0, 16, 203,
163, 2, 98, 14, 158, 71, 32, 202,
172, 227, 110, 53, 148, 93, 22, 200,
34, 36, 230, 122, 19, 25, 134, 133,
133, 245, 66, 146, 141, 188, 5, 35,
4, 50, 45, 174, 64, 82, 4, 130,
72, 86, 196, 98, 30, 101, 41, 198,
162, 83, 154, 141, 82, 194, 64, 114,
42, 32, 135, 26, 114, 228, 186, 4,
155, 132, 197, 33, 132, 37, 33, 82,
130, 171, 48, 130, 72, 46, 226, 35,
16, 2, 34, 6, 74, 133, 38, 98,
128, 6, 179, 106, 71, 184, 116, 212,
228, 47, 102, 64, 212, 96, 99, 55,
16, 139, 92, 184, 167, 157, 255, 186,
55, 130, 227, 176, 120, 67, 55, 12,
155, 112, 125, 218, 167, 227, 71, 119,
125, 248, 4, 50, 0, 142, 10, 163,
142, 156, 32, 48, 184, 132, 156, 0,
230, 56, 46, 17, 96, 128, 245, 203,
110, 194, 142, 236, 70, 7, 120, 165,
85, 224, 24, 11, 164, 234, 156, 191,
225, 28, 104, 129, 157, 101, 3, 61,
76, 165, 3, 214, 15, 117, 109, 66,
0, 164, 128, 190, 52, 33, 14, 108,
66, 16, 91, 5, 178, 15, 227, 151,
208, 13, 121, 187, 172, 56, 114, 218,
0, 116, 160, 251, 246, 102, 28, 105,
33, 254, 28, 44, 35, 30, 140, 129,
15, 138, 178, 224, 122, 103, 51, 242,
129, 25, 208, 4, 33, 252, 66, 84,
216, 249, 168, 34, 187, 164, 119, 90,
60, 236, 194, 59, 188, 59, 3, 100,
215, 177, 59, 128, 75, 39, 7, 51,
205, 75, 221, 134, 247, 74, 91, 229,
72, 93, 101, 203, 110, 186, 164, 41,
49, 158, 207, 155, 18, 217, 47, 121,
134, 3, 60, 224, 211, 91, 162, 102,
49, 128, 0, 110, 22, 198, 38, 181,
37, 161, 202, 171, 122, 72, 7, 155,
104, 64, 2, 142, 210, 80, 212, 196,
111, 0, 212, 200, 30, 248, 185, 42,
248, 10, 124, 96, 45, 42, 160, 32,
250, 98, 228, 116, 192, 92, 14, 134,
73, 94, 67, 254, 88, 163, 150, 148,
199, 150, 186, 71, 177, 81, 218, 248,
110, 58, 169, 64, 187, 164, 240, 72,
159, 191, 12, 57, 184, 84, 57, 18,
38, 58, 40, 182, 48, 190, 163, 48,
242, 152, 56, 150, 108, 95, 122, 188,
125, 210, 71, 61, 50, 160, 125, 190,
76, 46, 130, 202, 197, 191, 178, 132,
93, 35, 221, 36, 96, 93, 222, 25,
247, 138, 53, 94, 214, 71, 143, 58,
64, 9, 20, 4, 219, 160, 56, 26,
40, 33, 128, 205, 219, 144, 191, 187,
55, 42, 32, 58, 252, 228, 1, 226,
192, 69, 24, 4, 160, 247, 229, 137,
114, 151, 189, 117, 163, 41, 5, 154,
18, 103, 15, 11, 154, 13, 36, 220,
254, 69, 29, 87, 225, 27, 42, 131,
29, 206, 97, 20, 8, 144, 19, 210,
65, 250, 194, 97, 238, 250, 199, 93,
50, 108, 13, 148, 128, 59, 184, 131,
87, 194, 67, 200, 197, 99, 46, 166,
71, 178, 43, 0, 106, 8, 99, 4,
152, 220, 190, 7, 6, 126, 152, 28,
204, 225, 7, 96, 224, 120, 59, 236,
165, 201, 236, 102, 167, 223, 194, 56,
202, 103, 51, 95, 69, 137, 25, 147,
157, 141, 227, 12, 83, 188, 125, 18,
3, 145, 116, 32, 85, 238, 246, 163,
185, 99, 80, 86, 69, 253, 146, 21,
143, 34, 43, 55, 40, 219, 142, 60,
142, 167, 5, 160, 3, 164, 80, 152,
13, 125, 4, 162, 148, 25, 237, 219,
205, 253, 229, 12, 145, 253, 229, 156,
195, 7, 154, 213, 94, 254, 24, 144,
249, 101, 46, 134, 239, 201, 129, 202,
90, 101, 233, 188, 53, 155, 125, 134,
149, 106, 64, 199, 9, 120, 197, 201,
147, 215, 59, 18, 224, 85, 130, 47,
203, 70, 160, 11, 242, 107, 218, 130,
33, 25, 114, 193, 42, 70, 217, 56,
206, 27, 124, 224, 88, 110, 12, 64,
9, 184, 113, 21, 248, 0, 214, 93,
133, 87, 236, 34, 215, 243, 104, 85,
104, 47, 217, 43, 128, 15, 116, 196,
144, 158, 72, 140, 105, 225, 27, 216,
129, 50, 152, 1, 42, 214, 128, 21,
216, 129, 118, 58, 131, 29, 130, 33,
24, 178, 226, 58, 107, 99, 42, 254,
124, 128, 141, 245, 40, 167, 23, 61,
188, 229, 104, 253, 14, 195, 222, 36,
113, 4, 20, 244, 218, 37, 32, 85,
0, 241, 1, 236, 165, 5, 252, 68,
117, 159, 6, 117, 228, 56, 165, 72,
91, 150, 182, 67, 152, 226, 226, 188,
195, 99, 91, 217, 199, 0, 214, 205,
129, 20, 221, 7, 250, 48, 229, 95,
222, 248, 132, 35, 142, 64, 26, 144,
39, 209, 193, 66, 122, 12, 109, 194,
45, 224, 226, 179, 97, 188, 95, 130,
221, 195, 66, 132, 89, 35, 204, 208,
147, 93, 160, 147, 152, 203, 128, 220,
95, 136, 128, 12, 122, 99, 117, 7,
94, 60, 2, 250, 60, 152, 253, 134,
173, 149, 75, 131, 74, 67, 195, 187,
142, 162, 180, 47, 244, 240, 144, 122,
158, 212, 225, 254, 18, 217, 165, 120,
86, 128, 44, 31, 65, 207, 72, 65,
22, 100, 70, 22, 140, 33, 27, 104,
1, 11, 140, 99, 178, 192, 227, 72,
227, 104, 91, 25, 81, 46, 0, 100,
21, 30, 97, 39, 166, 28, 216, 184,
131, 160, 47, 124, 178, 62, 58, 217,
71, 0, 35, 96, 189, 111, 87, 128,
15, 88, 184, 225, 165, 184, 93, 61,
5, 173, 104, 7, 148, 136, 69, 148,
10, 61, 108, 177, 137, 8, 236, 194,
137, 136, 53, 1, 38, 29, 46, 194,
3, 210, 213, 79, 247, 10, 55, 137,
129, 205, 56, 220, 162, 246, 126, 31,
179, 236, 173, 111, 193, 188, 254, 198,
79, 90, 85, 148, 67, 18, 249, 218,
114, 152, 252, 157, 193, 251, 205, 87,
58, 230, 1, 38, 3, 14, 38, 167,
31, 192, 92, 254, 228, 163, 91, 128,
93, 244, 8, 160, 7, 54, 57, 98,
218, 141, 112, 191, 114, 112, 90, 125,
70, 253, 98, 1, 25, 113, 252, 66,
49, 126, 73, 80, 114, 222, 235, 253,
133, 253, 188, 62, 60, 224, 211, 142,
244, 162, 55, 146, 202, 190, 153, 126,
67, 137, 233, 38, 130, 10, 32, 12,
36, 16, 64, 176, 194, 3, 130, 2,
18, 116, 72, 240, 96, 224, 8, 29,
58, 148, 56, 97, 131, 69, 74, 69,
26, 21, 12, 24, 64, 200, 49, 225,
70, 142, 12, 13, 74, 104, 225, 68,
138, 15, 44, 178, 88, 141, 162, 164,
232, 17, 173, 108, 233, 226, 133, 91,
69, 164, 67, 198, 7, 15, 50, 140,
56, 113, 66, 130, 132, 19, 21, 18,
72, 48, 32, 65, 7, 161, 81, 147,
216, 204, 24, 145, 161, 66, 135, 12,
18, 50, 240, 204, 112, 240, 35, 84,
129, 2, 136, 114, 60, 225, 227, 68,
67, 142, 6, 42, 100, 205, 57, 98,
6, 161, 92, 190, 194, 197, 139, 247,
141, 165, 32, 78, 190, 216, 241, 227,
151, 239, 222, 90, 118, 233, 210, 157,
51, 246, 45, 151, 158, 53, 82, 116,
72, 89, 3, 120, 197, 137, 21, 45,
86, 72, 120, 48, 98, 5, 212, 21,
138, 51, 180, 232, 240, 254, 116, 68,
139, 25, 137, 13, 183, 240, 65, 99,
196, 78, 131, 15, 58, 172, 96, 218,
161, 172, 18, 29, 52, 102, 204, 160,
65, 99, 69, 135, 25, 64, 80, 43,
1, 178, 89, 64, 234, 132, 139, 65,
14, 68, 168, 177, 35, 65, 3, 84,
19, 36, 200, 64, 132, 200, 110, 9,
64, 148, 140, 172, 112, 130, 105, 11,
9, 141, 197, 114, 148, 250, 251, 35,
65, 201, 53, 121, 55, 196, 105, 157,
183, 128, 17, 52, 214, 240, 89, 131,
197, 201, 12, 29, 39, 116, 248, 144,
224, 219, 247, 110, 239, 237, 175, 31,
244, 221, 157, 99, 5, 214, 64, 174,
0, 33, 210, 37, 76, 236, 21, 241,
9, 240, 192, 70, 192, 101, 80, 31,
71, 81, 53, 180, 145, 4, 210, 1,
55, 224, 128, 9, 140, 192, 144, 70,
92, 21, 7, 4, 27, 87, 88, 164,
196, 12, 25, 8, 167, 209, 135, 21,
100, 80, 26, 83, 243, 141, 181, 211,
9, 45, 180, 160, 68, 24, 107, 144,
178, 10, 33, 118, 156, 21, 14, 59,
119, 125, 195, 137, 19, 142, 117, 112,
66, 107, 77, 61, 192, 220, 118, 68,
141, 176, 198, 36, 143, 196, 225, 131,
112, 25, 92, 245, 192, 97, 61, 217,
199, 94, 123, 9, 16, 17, 134, 14,
1, 50, 36, 26, 16, 143, 228, 194,
23, 59, 236, 48, 163, 8, 31, 147,
200, 66, 75, 56, 233, 132, 83, 77,
50, 190, 156, 115, 254, 79, 62, 252,
220, 147, 77, 54, 201, 240, 17, 134,
73, 82, 132, 129, 161, 15, 168, 169,
199, 161, 101, 35, 116, 208, 66, 106,
151, 141, 166, 227, 10, 170, 97, 118,
25, 13, 45, 156, 152, 36, 98, 45,
28, 166, 154, 15, 87, 248, 80, 156,
14, 251, 117, 117, 194, 106, 64, 56,
177, 33, 13, 25, 232, 0, 224, 3,
51, 116, 128, 144, 135, 29, 5, 5,
22, 65, 9, 16, 21, 225, 21, 78,
216, 244, 128, 4, 52, 40, 177, 2,
162, 61, 29, 198, 220, 8, 67, 109,
149, 1, 65, 64, 26, 192, 216, 82,
213, 189, 186, 216, 64, 214, 169, 42,
129, 18, 93, 172, 161, 7, 25, 21,
17, 65, 67, 7, 64, 0, 81, 162,
111, 56, 241, 246, 145, 64, 169, 82,
251, 100, 119, 3, 198, 215, 129, 18,
224, 150, 116, 69, 23, 82, 204, 214,
194, 168, 34, 14, 229, 167, 65, 126,
118, 86, 1, 131, 58, 81, 38, 162,
163, 141, 150, 181, 212, 78, 51, 184,
198, 224, 98, 62, 14, 152, 94, 180,
68, 196, 33, 133, 69, 78, 232, 48,
66, 5, 158, 65, 85, 65, 5, 179,
170, 7, 132, 15, 45, 44, 108, 16,
195, 133, 182, 160, 3, 17, 88, 232,
241, 87, 28, 171, 48, 163, 214, 90,
241, 164, 147, 13, 37, 179, 41, 97,
146, 87, 72, 246, 164, 145, 80, 25,
40, 33, 8, 33, 113, 80, 41, 128,
79, 169, 38, 254, 176, 176, 4, 239,
5, 72, 80, 81, 82, 0, 88, 29,
72, 33, 182, 32, 133, 38, 190, 36,
51, 227, 57, 193, 144, 34, 8, 43,
204, 176, 178, 10, 39, 148, 208, 226,
11, 45, 233, 204, 69, 215, 57, 223,
84, 243, 72, 24, 88, 16, 49, 48,
96, 68, 0, 193, 26, 17, 232, 73,
213, 20, 98, 134, 229, 219, 232, 83,
144, 97, 118, 162, 142, 151, 93, 70,
196, 105, 151, 81, 170, 4, 22, 62,
248, 176, 95, 73, 230, 121, 118, 241,
21, 88, 196, 214, 129, 193, 4, 57,
86, 234, 124, 4, 26, 68, 96, 182,
26, 225, 100, 111, 98, 33, 206, 144,
55, 13, 64, 156, 144, 65, 168, 141,
45, 100, 29, 194, 67, 133, 5, 213,
171, 25, 16, 154, 81, 84, 84, 145,
46, 177, 142, 149, 149, 86, 231, 26,
118, 116, 129, 5, 171, 7, 227, 185,
17, 67, 56, 137, 132, 48, 174, 81,
121, 214, 39, 138, 144, 37, 42, 34,
105, 141, 50, 122, 24, 13, 120, 182,
32, 85, 168, 35, 206, 48, 183, 19,
78, 0, 206, 172, 18, 68, 204, 64,
16, 120, 97, 235, 32, 249, 105, 152,
58, 91, 232, 106, 214, 175, 198, 26,
103, 170, 65, 20, 62, 106, 174, 133,
100, 24, 123, 35, 228, 173, 131, 19,
118, 48, 127, 81, 146, 153, 135, 24,
186, 222, 251, 145, 221, 156, 229, 208,
29, 74, 3, 165, 115, 99, 65, 70,
28, 148, 254, 224, 132, 44, 152, 81,
141, 108, 156, 201, 23, 156, 136, 3,
25, 174, 64, 131, 197, 224, 140, 49,
150, 3, 203, 8, 194, 240, 23, 29,
72, 167, 58, 43, 75, 213, 181, 158,
68, 31, 203, 32, 46, 43, 12, 25,
11, 220, 186, 48, 138, 92, 48, 227,
28, 236, 168, 6, 39, 190, 148, 140,
116, 36, 131, 72, 89, 10, 6, 45,
226, 97, 181, 124, 200, 228, 28, 154,
72, 22, 215, 156, 16, 6, 39, 0,
76, 82, 209, 194, 19, 106, 0, 181,
25, 33, 234, 224, 79, 120, 218, 31,
68, 242, 20, 173, 228, 12, 204, 135,
148, 187, 194, 2, 103, 227, 53, 13,
97, 134, 114, 82, 184, 194, 105, 210,
183, 171, 248, 108, 174, 79, 66, 9,
10, 78, 112, 38, 144, 134, 232, 4,
50, 7, 219, 209, 10, 136, 32, 41,
196, 160, 39, 110, 137, 209, 221, 10,
40, 133, 167, 188, 157, 39, 122, 231,
65, 77, 30, 87, 163, 55, 31, 168,
38, 83, 172, 42, 14, 17, 154, 183,
134, 56, 84, 4, 11, 58, 96, 16,
68, 114, 34, 62, 202, 229, 173, 143,
16, 105, 98, 222, 246, 3, 61, 11,
61, 108, 86, 0, 131, 158, 122, 76,
166, 4, 31, 16, 74, 108, 172, 33,
222, 32, 179, 152, 44, 138, 248, 112,
6, 13, 217, 76, 16, 213, 67, 182,
253, 73, 228, 145, 121, 226, 140, 18,
33, 162, 190, 33, 122, 143, 120, 51,
56, 254, 140, 197, 18, 115, 41, 11,
97, 129, 13, 131, 212, 34, 202, 18,
224, 40, 235, 181, 32, 57, 208, 155,
13, 103, 172, 215, 24, 66, 237, 239,
153, 196, 203, 84, 23, 200, 160, 135,
71, 76, 226, 154, 68, 34, 196, 35,
30, 209, 5, 149, 9, 133, 44, 28,
252, 141, 20, 40, 2, 132, 21, 148,
232, 90, 68, 57, 200, 80, 126, 226,
19, 5, 77, 39, 98, 191, 249, 13,
67, 24, 210, 24, 26, 112, 204, 23,
209, 56, 71, 58, 152, 65, 136, 48,
60, 226, 27, 236, 136, 198, 53, 31,
225, 11, 99, 248, 130, 134, 115, 169,
203, 55, 210, 193, 10, 214, 217, 129,
12, 82, 32, 87, 106, 58, 25, 182,
65, 14, 210, 9, 206, 162, 156, 215,
156, 149, 196, 73, 198, 70, 136, 251,
171, 35, 37, 163, 119, 130, 187, 149,
196, 143, 18, 185, 2, 30, 103, 85,
28, 63, 174, 0, 8, 225, 172, 82,
51, 155, 210, 148, 16, 189, 10, 39,
100, 129, 76, 105, 98, 69, 73, 177,
133, 141, 53, 235, 139, 22, 246, 102,
160, 4, 86, 153, 140, 85, 88, 232,
66, 114, 74, 226, 58, 77, 5, 243,
117, 18, 25, 24, 171, 152, 135, 81,
41, 252, 111, 78, 78, 144, 10, 16,
176, 16, 6, 149, 94, 33, 12, 92,
187, 2, 224, 94, 55, 176, 44, 2,
238, 172, 128, 243, 33, 223, 212, 35,
46, 178, 74, 132, 171, 228, 202, 34,
254, 22, 230, 218, 31, 174, 209, 53,
12, 113, 120, 104, 224, 60, 181, 2,
31, 80, 149, 121, 89, 196, 168, 184,
2, 217, 68, 101, 210, 239, 162, 18,
73, 44, 184, 56, 89, 73, 147, 73,
1, 163, 197, 113, 2, 25, 216, 160,
34, 253, 208, 84, 2, 175, 217, 79,
36, 247, 211, 196, 135, 225, 201, 80,
231, 81, 98, 106, 128, 58, 68, 191,
234, 129, 18, 172, 40, 218, 155, 100,
17, 134, 93, 9, 71, 64, 243, 241,
144, 80, 32, 21, 61, 3, 181, 199,
65, 89, 17, 128, 84, 222, 165, 163,
230, 224, 100, 56, 207, 18, 72, 177,
124, 20, 47, 29, 240, 65, 22, 193,
168, 6, 10, 171, 161, 136, 48, 112,
98, 70, 193, 192, 166, 49, 12, 42,
23, 171, 221, 67, 185, 193, 224, 3,
31, 8, 177, 134, 46, 136, 21, 81,
170, 225, 232, 99, 153, 135, 189, 165,
250, 80, 61, 209, 132, 158, 103, 107,
169, 30, 245, 216, 49, 3, 62, 80,
102, 190, 230, 38, 5, 34, 64, 102,
71, 229, 233, 10, 241, 170, 114, 160,
142, 252, 206, 83, 97, 164, 221, 171,
152, 99, 49, 26, 92, 234, 110, 3,
131, 30, 16, 59, 74, 188, 226, 109,
198, 152, 248, 41, 215, 40, 157, 48,
87, 54, 122, 13, 112, 93, 200, 176,
22, 59, 43, 84, 50, 216, 129, 107,
62, 16, 205, 138, 200, 64, 134, 48,
252, 207, 14, 108, 0, 43, 25, 254,
214, 80, 226, 48, 244, 135, 196, 132,
33, 49, 25, 148, 74, 132, 13, 115,
149, 69, 107, 176, 235, 100, 9, 83,
87, 176, 130, 213, 117, 98, 21, 43,
22, 226, 0, 24, 167, 10, 117, 172,
174, 99, 145, 119, 111, 28, 214, 241,
26, 213, 107, 204, 203, 144, 88, 165,
90, 86, 86, 141, 215, 34, 25, 174,
175, 14, 184, 74, 134, 17, 120, 141,
54, 207, 12, 109, 138, 250, 40, 196,
186, 81, 10, 34, 154, 172, 227, 102,
141, 185, 19, 29, 104, 2, 38, 92,
10, 217, 55, 100, 177, 134, 19, 140,
170, 140, 100, 108, 72, 89, 38, 67,
172, 140, 160, 10, 55, 32, 209, 9,
129, 71, 51, 148, 7, 188, 84, 84,
238, 137, 202, 83, 116, 224, 18, 99,
84, 99, 70, 225, 96, 133, 30, 100,
145, 23, 89, 92, 147, 18, 201, 8,
198, 65, 19, 74, 23, 102, 100, 131,
25, 130, 16, 132, 38, 226, 192, 181,
48, 120, 18, 49, 100, 227, 42, 223,
10, 166, 60, 170, 106, 79, 149, 97,
107, 226, 18, 31, 73, 235, 80, 1,
193, 36, 214, 123, 233, 220, 196, 6,
25, 31, 244, 208, 143, 197, 233, 175,
110, 178, 98, 152, 89, 141, 206, 32,
194, 65, 24, 161, 114, 169, 147, 245,
141, 185, 193, 164, 141, 117, 216, 230,
152, 33, 33, 158, 103, 63, 96, 45,
207, 192, 80, 51, 183, 168, 186, 53,
153, 139, 85, 130, 135, 215, 254, 224,
4, 203, 232, 45, 178, 65, 174, 200,
88, 201, 154, 161, 164, 206, 245, 174,
24, 5, 223, 220, 36, 101, 178, 40,
115, 149, 48, 46, 158, 171, 144, 95,
231, 238, 12, 147, 216, 117, 239, 78,
106, 127, 94, 204, 186, 20, 219, 137,
15, 122, 96, 3, 97, 20, 222, 159,
238, 114, 53, 14, 20, 193, 43, 27,
92, 151, 215, 238, 78, 179, 197, 38,
86, 120, 15, 93, 71, 134, 146, 106,
241, 110, 1, 15, 140, 95, 201, 155,
230, 53, 180, 132, 13, 108, 208, 132,
38, 40, 66, 228, 217, 148, 39, 53,
15, 91, 74, 24, 104, 129, 194, 120,
208, 40, 29, 223, 160, 133, 32, 148,
208, 19, 240, 0, 229, 73, 10, 9,
17, 101, 14, 50, 156, 119, 141, 113,
97, 19, 162, 140, 178, 45, 230, 26,
199, 237, 7, 209, 163, 178, 217, 128,
66, 4, 132, 73, 248, 130, 25, 209,
0, 40, 59, 124, 161, 136, 96, 224,
133, 20, 148, 120, 132, 38, 152, 17,
140, 92, 200, 133, 77, 249, 200, 71,
50, 140, 1, 106, 62, 112, 130, 15,
222, 237, 2, 196, 48, 21, 17, 77,
169, 23, 81, 241, 45, 78, 190, 80,
68, 63, 88, 46, 113, 214, 15, 59,
98, 6, 110, 109, 199, 244, 64, 79,
10, 64, 200, 101, 124, 227, 155, 28,
31, 232, 108, 103, 210, 25, 92, 122,
80, 121, 83, 155, 237, 196, 48, 54,
241, 83, 126, 34, 59, 254, 55, 54,
82, 202, 238, 97, 243, 43, 87, 187,
6, 216, 12, 65, 121, 164, 68, 197,
176, 192, 53, 60, 229, 250, 74, 164,
144, 100, 128, 72, 183, 197, 149, 69,
179, 214, 41, 223, 47, 38, 242, 26,
20, 206, 58, 61, 40, 112, 199, 46,
102, 67, 194, 149, 69, 8, 62, 176,
33, 175, 9, 71, 185, 194, 101, 28,
99, 230, 179, 24, 227, 48, 102, 49,
139, 143, 207, 251, 71, 56, 45, 41,
147, 88, 5, 37, 200, 112, 20, 77,
136, 103, 20, 9, 180, 131, 38, 70,
97, 135, 56, 112, 130, 20, 154, 152,
177, 143, 77, 12, 227, 37, 39, 117,
4, 183, 110, 158, 138, 103, 92, 223,
26, 103, 248, 254, 253, 209, 196, 35,
20, 17, 135, 56, 16, 130, 187, 93,
192, 6, 100, 128, 81, 87, 112, 68,
199, 228, 4, 141, 18, 30, 193, 16,
19, 118, 193, 14, 231, 144, 13, 193,
64, 126, 100, 35, 5, 45, 144, 45,
9, 65, 21, 190, 66, 21, 188, 34,
44, 11, 211, 20, 66, 225, 39, 134,
113, 41, 148, 130, 25, 6, 241, 47,
80, 87, 29, 194, 49, 28, 29, 64,
4, 154, 144, 92, 6, 164, 23, 180,
240, 8, 204, 16, 15, 231, 0, 126,
147, 48, 118, 190, 96, 118, 105, 151,
118, 247, 128, 38, 113, 34, 8, 163,
160, 8, 21, 161, 84, 225, 67, 54,
244, 230, 67, 15, 67, 60, 139, 149,
75, 230, 150, 132, 254, 196, 147, 39,
169, 113, 30, 144, 52, 25, 126, 101,
71, 115, 196, 113, 82, 16, 43, 93,
176, 33, 69, 37, 5, 210, 243, 120,
17, 82, 21, 41, 242, 39, 84, 241,
46, 151, 2, 62, 6, 118, 2, 249,
193, 34, 115, 50, 77, 93, 224, 4,
120, 178, 81, 74, 228, 4, 60, 166,
41, 247, 150, 99, 17, 197, 126, 128,
179, 134, 133, 68, 24, 133, 4, 113,
202, 167, 112, 188, 103, 72, 157, 103,
39, 40, 134, 114, 118, 144, 136, 16,
167, 136, 113, 160, 9, 178, 32, 11,
154, 64, 8, 171, 64, 11, 171, 160,
8, 163, 64, 11, 172, 160, 8, 147,
64, 11, 49, 72, 8, 172, 64, 11,
154, 32, 8, 171, 144, 11, 58, 167,
136, 137, 72, 125, 43, 22, 99, 11,
199, 6, 118, 192, 98, 46, 166, 98,
236, 87, 98, 165, 212, 93, 97, 64,
9, 171, 240, 8, 253, 164, 49, 112,
167, 7, 118, 192, 7, 87, 208, 127,
112, 183, 123, 173, 19, 6, 49, 146,
126, 3, 87, 87, 50, 118, 86, 73,
245, 82, 245, 37, 89, 36, 214, 85,
78, 22, 139, 36, 198, 6, 164, 48,
10, 143, 160, 44, 154, 144, 20, 118,
64, 9, 147, 48, 100, 154, 160, 7,
53, 102, 89, 52, 112, 5, 107, 64,
8, 190, 192, 128, 33, 243, 128, 209,
224, 11, 163, 32, 8, 87, 224, 21,
9, 241, 30, 27, 241, 21, 2, 194,
16, 12, 130, 254, 116, 161, 1, 25,
132, 162, 3, 108, 48, 9, 107, 32,
54, 34, 152, 55, 35, 32, 108, 69,
231, 4, 163, 96, 12, 111, 162, 92,
145, 54, 9, 213, 64, 131, 231, 247,
8, 148, 80, 13, 198, 64, 53, 105,
71, 23, 249, 16, 13, 198, 16, 12,
26, 51, 10, 163, 128, 5, 69, 53,
27, 227, 232, 98, 250, 177, 6, 130,
144, 84, 43, 86, 17, 143, 229, 3,
59, 161, 81, 197, 161, 94, 146, 212,
83, 151, 212, 41, 184, 150, 128, 37,
54, 128, 199, 212, 5, 68, 112, 76,
90, 116, 130, 167, 130, 42, 79, 81,
16, 125, 242, 44, 62, 210, 1, 148,
211, 73, 168, 241, 26, 20, 102, 39,
90, 164, 148, 97, 131, 5, 95, 178,
33, 64, 64, 6, 147, 16, 106, 130,
48, 9, 132, 160, 8, 164, 0, 137,
130, 64, 9, 41, 113, 77, 154, 40,
8, 196, 152, 136, 98, 185, 93, 166,
88, 126, 173, 56, 89, 205, 82, 84,
202, 162, 49, 137, 200, 150, 253, 119,
124, 118, 32, 38, 232, 39, 106, 148,
64, 9, 113, 112, 77, 223, 168, 77,
147, 128, 98, 87, 169, 8, 118, 160,
8, 75, 35, 8, 253, 183, 123, 188,
39, 99, 207, 216, 135, 194, 151, 99,
25, 70, 87, 2, 199, 53, 47, 230,
98, 93, 176, 137, 154, 32, 39, 147,
64, 9, 130, 16, 153, 156, 240, 8,
88, 240, 8, 80, 131, 5, 124, 128,
126, 20, 254, 68, 10, 172, 160, 9,
142, 249, 138, 144, 249, 134, 97, 128,
44, 88, 192, 21, 179, 193, 67, 217,
70, 94, 204, 131, 127, 25, 230, 79,
96, 183, 123, 154, 176, 125, 82, 249,
8, 82, 52, 9, 122, 112, 55, 178,
226, 39, 131, 116, 33, 198, 64, 35,
54, 87, 38, 223, 240, 105, 8, 180,
6, 51, 128, 51, 30, 248, 33, 244,
4, 20, 34, 145, 36, 162, 193, 119,
108, 32, 8, 133, 212, 49, 180, 64,
8, 5, 56, 89, 122, 115, 46, 241,
193, 24, 21, 160, 4, 156, 16, 12,
223, 112, 156, 56, 7, 118, 217, 192,
14, 54, 82, 137, 17, 57, 145, 236,
128, 118, 118, 193, 12, 190, 32, 11,
26, 35, 154, 56, 121, 74, 51, 16,
128, 25, 146, 41, 228, 150, 33, 10,
100, 84, 58, 160, 35, 64, 36, 72,
179, 17, 68, 15, 35, 73, 16, 35,
147, 49, 119, 41, 88, 64, 24, 93,
177, 2, 234, 101, 17, 62, 96, 91,
143, 151, 19, 120, 54, 56, 34, 17,
33, 5, 102, 61, 29, 224, 3, 143,
69, 142, 118, 184, 133, 97, 163, 7,
218, 135, 72, 198, 181, 10, 8, 71,
162, 172, 48, 9, 164, 64, 10, 111,
167, 9, 231, 247, 50, 16, 169, 9,
67, 22, 7, 188, 152, 87, 189, 200,
139, 229, 199, 138, 127, 193, 34, 145,
98, 85, 193, 103, 7, 190, 215, 127,
128, 8, 136, 199, 37, 11, 43, 241,
8, 254, 213, 184, 151, 28, 249, 162,
171, 48, 10, 113, 176, 52, 218, 167,
8, 171, 32, 11, 185, 240, 127, 227,
241, 124, 235, 55, 155, 172, 83, 72,
124, 160, 64, 64, 102, 86, 227, 194,
44, 236, 231, 58, 93, 160, 8, 41,
65, 8, 145, 169, 52, 88, 32, 106,
124, 48, 17, 83, 249, 75, 251, 103,
98, 45, 209, 58, 115, 245, 99, 179,
185, 133, 255, 232, 93, 45, 80, 69,
92, 198, 44, 98, 117, 55, 82, 36,
136, 40, 215, 127, 101, 137, 98, 2,
119, 55, 128, 241, 75, 78, 192, 19,
224, 209, 40, 51, 96, 7, 45, 116,
23, 56, 119, 156, 209, 144, 12, 178,
160, 8, 229, 102, 24, 158, 161, 60,
88, 32, 164, 118, 128, 5, 207, 33,
21, 47, 37, 8, 128, 57, 9, 201,
53, 93, 213, 80, 158, 171, 96, 30,
86, 69, 57, 118, 230, 17, 29, 97,
51, 21, 0, 4, 148, 16, 12, 225,
96, 158, 42, 68, 9, 233, 105, 35,
74, 243, 8, 103, 98, 118, 13, 248,
128, 180, 144, 18, 122, 112, 20, 178,
176, 133, 41, 73, 18, 129, 3, 41,
118, 176, 115, 10, 167, 7, 93, 5,
146, 151, 211, 68, 22, 194, 70, 66,
52, 73, 180, 118, 2, 68, 137, 120,
71, 132, 34, 87, 160, 7, 37, 25,
17, 88, 149, 98, 185, 212, 32, 253,
149, 130, 43, 99, 104, 51, 32, 28,
67, 225, 20, 206, 116, 68, 146, 162,
254, 3, 211, 52, 74, 42, 53, 129,
222, 21, 54, 172, 248, 8, 51, 22,
35, 83, 201, 141, 69, 162, 114, 223,
168, 112, 124, 64, 163, 255, 147, 87,
134, 202, 136, 9, 11, 99, 108, 196,
34, 188, 71, 152, 212, 167, 165, 133,
52, 10, 50, 20, 118, 159, 200, 155,
142, 200, 9, 127, 249, 52, 81, 90,
141, 251, 71, 9, 43, 161, 8, 138,
32, 173, 117, 149, 99, 207, 183, 98,
160, 26, 165, 190, 151, 99, 38, 166,
98, 187, 55, 89, 167, 56, 89, 122,
192, 7, 130, 185, 98, 10, 167, 82,
129, 199, 26, 116, 152, 138, 171, 40,
125, 60, 187, 112, 3, 184, 6, 244,
106, 30, 80, 38, 69, 44, 54, 46,
228, 50, 99, 54, 138, 163, 66, 170,
139, 52, 75, 179, 218, 121, 82, 69,
69, 4, 212, 52, 37, 163, 49, 71,
60, 65, 3, 130, 192, 12, 52, 130,
23, 88, 99, 169, 104, 146, 64, 174,
35, 30, 44, 42, 11, 57, 72, 11,
164, 176, 6, 137, 113, 76, 138, 224,
105, 217, 240, 13, 40, 164, 23, 231,
48, 183, 209, 64, 8, 78, 0, 113,
241, 53, 3, 4, 66, 31, 12, 114,
5, 68, 19, 14, 16, 200, 12, 185,
176, 127, 185, 16, 13, 209, 53, 10,
124, 0, 172, 19, 201, 128, 118, 145,
14, 193, 16, 12, 244, 105, 137, 172,
240, 134, 225, 122, 5, 151, 17, 27,
51, 176, 179, 23, 245, 88, 245, 254,
149, 120, 212, 51, 73, 177, 6, 133,
161, 5, 77, 205, 145, 185, 197, 195,
19, 53, 102, 39, 97, 128, 49, 90,
196, 85, 54, 145, 51, 29, 129, 21,
40, 8, 30, 187, 226, 43, 26, 177,
116, 108, 68, 60, 58, 153, 88, 143,
21, 27, 17, 69, 6, 94, 179, 10,
190, 64, 10, 212, 68, 11, 29, 73,
6, 82, 67, 9, 36, 234, 11, 146,
182, 6, 200, 226, 142, 228, 184, 163,
212, 183, 124, 133, 164, 113, 204, 194,
31, 134, 170, 49, 221, 101, 163, 26,
67, 164, 134, 250, 50, 130, 192, 139,
51, 219, 163, 178, 248, 85, 189, 167,
77, 87, 41, 152, 226, 42, 8, 124,
128, 98, 126, 40, 140, 40, 22, 165,
8, 215, 190, 190, 39, 128, 38, 246,
124, 187, 199, 98, 49, 91, 72, 49,
75, 98, 161, 154, 120, 60, 145, 24,
82, 176, 44, 210, 232, 138, 44, 194,
179, 43, 70, 46, 97, 48, 3, 169,
217, 167, 205, 168, 100, 95, 5, 56,
228, 65, 125, 68, 90, 126, 76, 171,
136, 83, 182, 31, 93, 51, 24, 91,
136, 25, 162, 177, 39, 70, 193, 12,
233, 128, 23, 225, 80, 194, 229, 201,
12, 153, 134, 137, 86, 26, 12, 108,
23, 13, 204, 240, 194, 201, 64, 9,
38, 57, 9, 198, 128, 66, 113, 6,
50, 122, 81, 38, 185, 176, 99, 224,
146, 72, 123, 11, 22, 57, 17, 6,
37, 4, 183, 242, 201, 10, 254, 164,
64, 195, 225, 16, 12, 132, 48, 153,
147, 144, 13, 198, 32, 11, 236, 112,
15, 107, 114, 15, 46, 100, 12, 164,
16, 35, 89, 57, 167, 134, 148, 40,
226, 35, 17, 204, 19, 61, 235, 35,
97, 136, 178, 107, 21, 21, 122, 106,
246, 61, 121, 50, 26, 36, 65, 54,
75, 65, 148, 168, 33, 124, 102, 5,
87, 221, 98, 45, 96, 241, 77, 238,
122, 41, 162, 242, 17, 169, 146, 59,
233, 147, 25, 115, 20, 88, 205, 115,
175, 44, 230, 67, 93, 64, 8, 147,
192, 7, 143, 69, 100, 146, 194, 189,
219, 245, 37, 203, 162, 41, 131, 204,
6, 218, 5, 190, 197, 167, 49, 227,
123, 179, 20, 22, 165, 236, 171, 93,
31, 70, 65, 236, 107, 201, 66, 250,
201, 41, 154, 136, 138, 64, 17, 237,
86, 95, 254, 180, 93, 155, 60, 164,
26, 243, 201, 173, 72, 24, 54, 218,
138, 226, 122, 136, 249, 219, 98, 61,
54, 89, 37, 118, 124, 44, 75, 164,
203, 7, 86, 172, 118, 75, 170, 25,
112, 175, 147, 110, 194, 236, 145, 205,
115, 2, 100, 224, 73, 27, 229, 161,
31, 135, 120, 37, 81, 84, 235, 182,
152, 2, 247, 110, 227, 133, 81, 249,
225, 67, 79, 214, 40, 58, 65, 21,
68, 169, 8, 70, 51, 183, 231, 144,
171, 6, 20, 13, 151, 154, 12, 228,
92, 13, 209, 80, 13, 232, 92, 206,
172, 64, 9, 185, 144, 254, 12, 202,
69, 156, 118, 49, 207, 94, 123, 14,
204, 160, 7, 146, 194, 60, 33, 54,
45, 28, 193, 24, 108, 80, 66, 54,
76, 118, 201, 48, 10, 70, 227, 11,
75, 172, 7, 111, 230, 11, 171, 160,
38, 243, 156, 14, 151, 202, 9, 226,
186, 10, 172, 128, 139, 16, 101, 48,
68, 137, 40, 94, 140, 81, 162, 164,
41, 180, 65, 84, 224, 178, 107, 235,
5, 133, 179, 228, 41, 141, 17, 45,
169, 65, 25, 148, 211, 2, 13, 234,
88, 201, 178, 6, 176, 43, 32, 167,
18, 70, 150, 97, 56, 168, 34, 16,
81, 193, 19, 175, 81, 108, 52, 32,
112, 76, 21, 56, 227, 180, 133, 236,
163, 93, 122, 0, 135, 243, 22, 95,
87, 208, 18, 155, 108, 124, 75, 41,
48, 36, 25, 106, 72, 237, 180, 190,
247, 80, 183, 87, 157, 79, 171, 93,
24, 210, 5, 51, 43, 150, 56, 138,
124, 51, 107, 168, 221, 37, 101, 245,
117, 5, 199, 247, 165, 11, 135, 176,
218, 53, 125, 51, 54, 155, 96, 21,
177, 138, 137, 146, 128, 85, 18, 116,
149, 44, 37, 150, 33, 118, 98, 192,
115, 85, 46, 225, 118, 81, 83, 86,
18, 79, 20, 85, 98, 245, 214, 126,
37, 43, 100, 96, 96, 153, 18, 45,
25, 82, 84, 216, 92, 95, 17, 5,
112, 102, 138, 127, 96, 5, 24, 9,
182, 85, 90, 180, 64, 227, 162, 4,
107, 35, 18, 29, 254, 42, 8, 193,
144, 13, 224, 124, 156, 9, 73, 206,
160, 189, 206, 201, 176, 118, 25, 25,
13, 35, 60, 194, 32, 19, 15, 118,
129, 195, 122, 49, 50, 117, 228, 4,
6, 102, 129, 190, 49, 2, 159, 25,
12, 231, 96, 115, 235, 152, 12, 153,
153, 12, 87, 170, 188, 154, 208, 23,
207, 165, 218, 82, 124, 14, 107, 199,
9, 255, 231, 162, 16, 215, 53, 184,
82, 33, 68, 229, 106, 88, 196, 70,
28, 66, 3, 216, 74, 41, 65, 20,
74, 169, 225, 76, 133, 114, 63, 221,
233, 26, 233, 67, 4, 233, 67, 27,
78, 64, 46, 38, 195, 27, 187, 33,
219, 177, 187, 29, 179, 42, 157, 150,
147, 47, 144, 241, 211, 61, 196, 55,
91, 5, 76, 249, 33, 191, 192, 187,
88, 214, 147, 31, 224, 43, 212, 24,
50, 223, 3, 35, 150, 127, 105, 150,
229, 7, 179, 107, 13, 203, 76, 75,
100, 229, 81, 215, 177, 200, 216, 125,
152, 138, 92, 83, 86, 112, 237, 176,
8, 203, 138, 161, 102, 112, 128, 154,
110, 25, 246, 135, 178, 232, 93, 181,
87, 86, 182, 215, 31, 229, 65, 4,
108, 192, 141, 31, 150, 184, 122, 48,
78, 236, 43, 69, 132, 0, 150, 229,
216, 79, 87, 80, 149, 118, 192, 204,
65, 86, 86, 39, 145, 120, 100, 208,
40, 235, 83, 28, 90, 20, 81, 224,
98, 122, 24, 38, 155, 141, 109, 39,
37, 94, 41, 254, 177, 50, 55, 16,
133, 180, 149, 19, 28, 2, 178, 35,
122, 224, 11, 223, 80, 194, 111, 235,
217, 234, 28, 229, 232, 140, 194, 198,
96, 206, 233, 89, 156, 52, 34, 197,
90, 174, 218, 92, 162, 23, 225, 32,
11, 120, 227, 161, 58, 208, 69, 7,
2, 42, 146, 104, 12, 49, 193, 14,
217, 32, 11, 47, 66, 6, 162, 73,
8, 156, 240, 22, 217, 0, 138, 225,
176, 218, 247, 16, 14, 211, 101, 149,
111, 65, 9, 93, 229, 93, 6, 35,
221, 112, 56, 100, 167, 184, 216, 129,
115, 24, 213, 227, 94, 201, 17, 27,
179, 20, 74, 147, 51, 26, 215, 99,
61, 40, 66, 41, 159, 180, 70, 208,
3, 25, 243, 36, 34, 238, 1, 31,
244, 241, 42, 242, 18, 148, 207, 66,
148, 69, 53, 39, 22, 178, 101, 93,
51, 74, 57, 54, 55, 25, 44, 77,
127, 168, 124, 111, 40, 221, 111, 184,
85, 143, 77, 152, 50, 54, 77, 90,
180, 224, 202, 7, 113, 68, 70, 127,
7, 188, 98, 24, 199, 126, 132, 73,
30, 111, 93, 18, 16, 183, 123, 227,
251, 172, 41, 62, 236, 138, 153, 167,
107, 189, 213, 249, 22, 227, 114, 101,
101, 254, 163, 31, 62, 224, 118, 143,
192, 7, 109, 90, 124, 119, 75, 179,
146, 165, 7, 128, 249, 180, 91, 216,
139, 130, 32, 221, 65, 150, 33, 219,
118, 5, 171, 17, 6, 174, 1, 27,
155, 84, 254, 69, 126, 85, 46, 183,
54, 238, 83, 38, 101, 227, 226, 98,
118, 119, 26, 175, 212, 140, 25, 98,
30, 138, 51, 16, 8, 211, 2, 108,
64, 11, 171, 154, 144, 77, 158, 53,
235, 76, 229, 154, 70, 64, 105, 206,
37, 82, 188, 131, 90, 222, 128, 94,
11, 106, 80, 134, 17, 223, 89, 20,
143, 176, 10, 104, 190, 22, 107, 110,
141, 82, 185, 10, 110, 202, 9, 115,
70, 9, 223, 160, 218, 170, 253, 13,
204, 96, 12, 255, 103, 7, 55, 136,
55, 253, 97, 217, 79, 168, 3, 30,
70, 6, 85, 185, 167, 203, 210, 167,
112, 248, 72, 177, 17, 45, 67, 132,
94, 251, 131, 243, 142, 97, 49, 213,
211, 24, 176, 209, 26, 71, 84, 78,
54, 81, 104, 152, 213, 2, 215, 226,
30, 195, 209, 27, 89, 65, 49, 40,
98, 134, 162, 17, 160, 8, 35, 221,
93, 165, 55, 172, 209, 44, 30, 38,
100, 194, 39, 152, 211, 68, 179, 78,
173, 8, 255, 135, 237, 17, 49, 99,
64, 16, 128, 242, 139, 112, 239, 187,
186, 200, 82, 147, 188, 204, 138, 16,
7, 141, 205, 23, 99, 38, 246, 98,
100, 48, 30, 235, 133, 39, 78, 80,
179, 64, 187, 123, 109, 223, 203, 235,
199, 34, 22, 188, 124, 21, 65, 85,
22, 65, 86, 73, 121, 26, 211, 254,
8, 173, 152, 49, 132, 145, 49, 16,
167, 4, 200, 103, 149, 133, 196, 31,
189, 254, 72, 8, 224, 242, 58, 62,
214, 44, 136, 180, 34, 137, 145, 75,
13, 83, 41, 200, 20, 27, 25, 205,
225, 118, 199, 215, 174, 230, 67, 139,
151, 55, 18, 145, 187, 29, 176, 183,
6, 192, 173, 200, 76, 10, 198, 112,
206, 81, 238, 194, 6, 159, 11, 102,
27, 13, 51, 130, 23, 90, 190, 131,
60, 40, 197, 56, 140, 53, 163, 208,
26, 142, 241, 33, 218, 226, 4, 148,
64, 10, 34, 204, 37, 120, 46, 154,
156, 192, 137, 91, 105, 7, 163, 144,
13, 19, 221, 144, 192, 111, 64, 190,
208, 139, 108, 0, 231, 177, 103, 122,
38, 77, 41, 13, 234, 3, 253, 24,
7, 18, 1, 86, 30, 170, 173, 73,
168, 243, 34, 189, 68, 157, 33, 1,
241, 186, 39, 22, 227, 41, 172, 97,
217, 77, 49, 2, 188, 50, 56, 173,
207, 244, 188, 210, 57, 29, 64, 70,
89, 81, 22, 0, 113, 34, 67, 134,
10, 21, 70, 24, 244, 49, 163, 197,
12, 34, 68, 186, 92, 209, 1, 100,
197, 21, 54, 64, 148, 196, 121, 164,
135, 34, 31, 82, 171, 248, 56, 121,
148, 75, 214, 35, 69, 172, 104, 105,
178, 163, 137, 84, 23, 29, 68, 200,
132, 1, 114, 101, 205, 26, 62, 154,
8, 177, 233, 66, 134, 77, 24, 34,
87, 124, 94, 145, 18, 38, 142, 29,
59, 113, 216, 24, 101, 67, 230, 225,
149, 48, 100, 156, 134, 233, 130, 37,
254, 170, 212, 166, 88, 148, 52, 4,
2, 196, 135, 146, 46, 93, 161, 98,
241, 73, 53, 76, 211, 151, 75, 195,
142, 93, 99, 52, 78, 156, 53, 87,
148, 92, 37, 162, 4, 11, 88, 41,
78, 164, 212, 245, 1, 68, 207, 40,
74, 74, 39, 81, 178, 131, 133, 144,
38, 62, 74, 244, 80, 226, 19, 6,
11, 31, 65, 68, 176, 60, 154, 100,
39, 46, 150, 167, 81, 149, 56, 193,
50, 195, 73, 23, 26, 51, 104, 232,
208, 177, 213, 137, 18, 32, 118, 165,
52, 188, 43, 53, 44, 88, 160, 119,
115, 214, 197, 218, 130, 107, 222, 210,
78, 128, 232, 104, 81, 65, 192, 110,
1, 43, 124, 116, 24, 161, 68, 17,
173, 100, 204, 170, 85, 139, 198, 44,
153, 49, 95, 190, 104, 173, 90, 149,
44, 219, 185, 116, 236, 238, 221, 203,
151, 93, 123, 190, 235, 241, 238, 197,
139, 199, 46, 93, 56, 95, 87, 70,
116, 120, 240, 192, 64, 2, 3, 15,
118, 27, 16, 96, 160, 3, 22, 78,
171, 152, 165, 11, 159, 238, 155, 175,
96, 209, 178, 229, 34, 228, 145, 56,
72, 201, 102, 21, 66, 162, 1, 15,
188, 108, 170, 97, 133, 12, 61, 214,
16, 100, 21, 194, 164, 0, 66, 10,
136, 24, 82, 162, 46, 26, 236, 82,
172, 169, 46, 156, 192, 45, 180, 207,
64, 11, 77, 7, 207, 64, 243, 236,
51, 26, 104, 232, 32, 129, 19, 254,
22, 154, 97, 5, 25, 87, 152, 65,
10, 37, 102, 80, 130, 167, 17, 54,
220, 205, 69, 31, 104, 144, 32, 3,
22, 227, 19, 32, 61, 1, 18, 80,
143, 183, 35, 43, 200, 96, 132, 22,
58, 168, 64, 160, 17, 128, 80, 136,
136, 53, 222, 146, 162, 133, 223, 104,
138, 72, 138, 56, 200, 112, 34, 12,
54, 20, 17, 36, 12, 31, 20, 145,
69, 66, 61, 4, 225, 67, 15, 39,
38, 225, 164, 139, 173, 186, 8, 227,
42, 58, 5, 201, 104, 46, 168, 74,
35, 3, 11, 34, 230, 92, 131, 13,
65, 157, 154, 201, 169, 165, 176, 24,
75, 49, 11, 175, 152, 171, 43, 160,
236, 186, 2, 82, 175, 42, 235, 138,
80, 50, 214, 112, 234, 169, 177, 46,
197, 116, 173, 164, 194, 240, 169, 174,
187, 164, 152, 75, 170, 185, 174, 176,
232, 138, 46, 164, 0, 205, 9, 39,
58, 163, 129, 52, 19, 137, 160, 178,
133, 219, 160, 76, 209, 7, 31, 24,
29, 21, 196, 10, 59, 112, 226, 10,
133, 102, 208, 225, 179, 203, 68, 115,
53, 46, 215, 194, 176, 48, 39, 67,
129, 26, 139, 214, 172, 18, 2, 130,
167, 172, 70, 3, 162, 179, 21, 36,
224, 77, 130, 25, 42, 72, 192, 219,
56, 56, 145, 37, 152, 100, 146, 9,
198, 185, 52, 57, 209, 36, 152, 108,
146, 9, 199, 58, 237, 248, 201, 135,
222, 236, 190, 235, 14, 188, 254, 116,
206, 169, 70, 144, 39, 185, 229, 77,
189, 7, 18, 72, 32, 202, 53, 70,
89, 37, 26, 118, 192, 99, 231, 156,
108, 152, 9, 231, 156, 96, 248, 32,
36, 14, 86, 190, 241, 200, 24, 239,
238, 97, 39, 155, 111, 72, 89, 67,
64, 61, 38, 17, 208, 68, 31, 136,
88, 161, 5, 34, 164, 88, 181, 70,
98, 99, 157, 75, 137, 21, 104, 184,
45, 52, 93, 111, 6, 77, 197, 21,
69, 60, 161, 2, 26, 105, 104, 161,
216, 14, 98, 189, 107, 5, 41, 218,
218, 202, 7, 222, 70, 240, 65, 135,
19, 58, 240, 97, 5, 37, 223, 75,
224, 189, 221, 36, 24, 225, 105, 112,
31, 88, 97, 104, 37, 90, 16, 82,
9, 93, 101, 246, 97, 4, 154, 50,
4, 2, 139, 205, 160, 138, 3, 11,
10, 249, 120, 196, 14, 66, 236, 80,
68, 17, 61, 164, 176, 67, 15, 152,
28, 91, 117, 87, 49, 49, 125, 41,
210, 46, 142, 10, 195, 9, 34, 194,
92, 203, 211, 64, 145, 106, 43, 71,
76, 215, 216, 244, 113, 54, 2, 75,
13, 44, 39, 28, 124, 28, 240, 75,
143, 98, 35, 208, 153, 52, 183, 148,
172, 175, 220, 30, 237, 178, 12, 73,
157, 203, 240, 172, 106, 46, 22, 198,
19, 70, 240, 108, 133, 17, 86, 40,
22, 197, 21, 137, 173, 205, 70, 87,
71, 59, 217, 137, 22, 234, 106, 65,
197, 208, 222, 42, 237, 254, 170, 219,
44, 186, 172, 174, 96, 233, 140, 170,
43, 183, 73, 101, 116, 46, 150, 155,
85, 181, 41, 183, 116, 232, 186, 160,
22, 122, 134, 146, 118, 44, 226, 16,
68, 17, 66, 216, 180, 99, 141, 46,
4, 137, 230, 155, 108, 172, 195, 142,
31, 247, 223, 127, 31, 223, 4, 197,
11, 135, 21, 31, 94, 231, 205, 0,
253, 213, 51, 64, 130, 19, 226, 64,
88, 53, 216, 177, 176, 125, 125, 35,
26, 17, 155, 152, 32, 44, 86, 160,
56, 228, 2, 63, 28, 171, 198, 55,
56, 193, 7, 89, 40, 144, 15, 107,
88, 153, 68, 4, 178, 2, 32, 180,
160, 5, 178, 171, 128, 4, 42, 16,
52, 32, 208, 42, 34, 53, 195, 153,
174, 86, 164, 162, 20, 129, 230, 105,
11, 233, 204, 12, 70, 32, 1, 185,
252, 136, 6, 88, 96, 131, 141, 58,
211, 1, 248, 72, 128, 6, 247, 3,
225, 212, 226, 195, 195, 169, 177, 39,
62, 237, 121, 29, 237, 102, 128, 181,
21, 101, 133, 33, 51, 88, 3, 33,
102, 178, 153, 46, 232, 129, 12, 82,
32, 67, 28, 234, 212, 5, 184, 144,
129, 20, 164, 136, 67, 176, 212, 166,
3, 37, 4, 170, 11, 14, 233, 220,
81, 148, 114, 5, 7, 233, 193, 14,
133, 187, 76, 27, 137, 194, 150, 64,
169, 241, 140, 50, 49, 20, 90, 156,
98, 7, 62, 184, 197, 46, 170, 11,
131, 222, 50, 213, 254, 149, 156, 12,
42, 80, 77, 129, 92, 89, 8, 73,
72, 186, 212, 5, 46, 13, 137, 75,
86, 164, 165, 149, 166, 145, 72, 87,
160, 33, 94, 92, 222, 194, 183, 72,
5, 171, 114, 167, 201, 144, 19, 168,
5, 132, 224, 248, 32, 3, 47, 58,
193, 9, 104, 150, 23, 172, 128, 166,
33, 187, 115, 85, 24, 40, 193, 137,
71, 144, 97, 48, 143, 8, 3, 31,
56, 17, 25, 66, 80, 66, 16, 57,
137, 131, 34, 32, 196, 9, 78, 196,
225, 52, 81, 59, 79, 240, 20, 50,
35, 39, 157, 224, 103, 158, 9, 158,
34, 140, 193, 140, 1, 198, 3, 126,
215, 180, 23, 190, 170, 217, 48, 99,
152, 231, 4, 249, 155, 218, 3, 90,
32, 8, 132, 173, 143, 97, 233, 72,
78, 196, 140, 225, 198, 53, 200, 34,
27, 164, 96, 3, 43, 206, 161, 47,
255, 80, 98, 18, 185, 208, 195, 228,
250, 20, 135, 46, 160, 135, 107, 88,
216, 10, 91, 86, 112, 130, 25, 220,
198, 88, 117, 169, 217, 136, 42, 217,
194, 206, 20, 107, 6, 50, 156, 153,
86, 164, 212, 1, 151, 16, 161, 75,
96, 138, 17, 13, 136, 208, 2, 253,
21, 52, 3, 41, 115, 79, 17, 171,
86, 68, 248, 92, 77, 118, 92, 163,
193, 8, 200, 72, 155, 150, 208, 128,
143, 249, 60, 29, 168, 216, 160, 135,
196, 212, 229, 140, 64, 224, 136, 38,
234, 84, 20, 254, 34, 104, 102, 44,
171, 234, 66, 29, 193, 180, 25, 206,
177, 193, 79, 91, 9, 67, 81, 214,
130, 169, 200, 189, 164, 46, 136, 106,
222, 34, 161, 114, 151, 71, 185, 74,
85, 204, 99, 84, 85, 76, 165, 26,
87, 141, 202, 171, 80, 117, 203, 38,
33, 217, 144, 203, 188, 242, 42, 25,
82, 4, 37, 20, 65, 25, 146, 41,
102, 18, 147, 128, 220, 35, 8, 35,
19, 187, 17, 65, 151, 148, 80, 27,
105, 40, 73, 4, 22, 157, 244, 70,
231, 121, 221, 9, 90, 66, 86, 227,
197, 101, 119, 163, 178, 195, 40, 196,
151, 75, 65, 8, 226, 10, 124, 20,
4, 14, 215, 130, 197, 46, 104, 113,
40, 148, 208, 195, 159, 102, 144, 129,
7, 20, 68, 137, 65, 75, 200, 7,
59, 32, 163, 29, 253, 80, 16, 180,
128, 88, 56, 210, 81, 47, 108, 110,
231, 58, 223, 57, 103, 53, 244, 32,
35, 34, 9, 81, 0, 58, 80, 196,
40, 88, 177, 190, 133, 137, 135, 25,
209, 56, 71, 56, 152, 193, 135, 164,
92, 108, 21, 7, 155, 103, 60, 208,
89, 13, 69, 60, 98, 21, 95, 210,
4, 43, 30, 33, 133, 148, 114, 107,
6, 0, 117, 2, 91, 118, 70, 131,
23, 205, 204, 52, 40, 180, 217, 206,
68, 244, 153, 166, 53, 244, 54, 79,
146, 209, 9, 124, 0, 185, 18, 186,
138, 54, 166, 251, 230, 9, 136, 16,
66, 15, 254, 194, 167, 164, 69, 178,
239, 145, 168, 214, 158, 7, 248, 111,
4, 6, 80, 169, 122, 165, 48, 182,
164, 145, 47, 14, 25, 146, 139, 149,
8, 161, 8, 99, 190, 69, 85, 69,
185, 27, 27, 201, 240, 22, 58, 5,
171, 52, 80, 65, 85, 133, 232, 116,
41, 181, 253, 168, 66, 63, 253, 202,
106, 28, 213, 16, 28, 78, 194, 38,
16, 210, 196, 36, 38, 167, 9, 192,
172, 65, 19, 163, 144, 34, 37, 72,
1, 87, 66, 124, 209, 14, 209, 99,
141, 242, 22, 197, 154, 166, 40, 166,
147, 111, 129, 229, 91, 30, 73, 43,
44, 140, 130, 20, 148, 56, 202, 91,
237, 64, 134, 186, 21, 5, 110, 122,
115, 76, 24, 116, 16, 134, 193, 124,
168, 116, 122, 101, 145, 4, 18, 64,
209, 167, 17, 148, 6, 180, 59, 220,
105, 180, 50, 88, 77, 94, 38, 187,
164, 200, 19, 100, 248, 128, 133, 180,
58, 118, 48, 138, 184, 130, 30, 4,
153, 219, 85, 232, 129, 52, 247, 19,
97, 6, 58, 144, 45, 193, 206, 224,
105, 29, 0, 116, 7, 8, 26, 188,
56, 72, 39, 130, 236, 96, 45, 252,
234, 149, 29, 122, 189, 246, 156, 225,
224, 132, 137, 42, 160, 191, 247, 148,
52, 1, 111, 66, 216, 55, 22, 22,
158, 115, 20, 39, 98, 209, 224, 195,
75, 140, 187, 6, 74, 124, 3, 60,
14, 139, 6, 77, 81, 18, 6, 89,
84, 254, 131, 18, 81, 235, 154, 144,
174, 224, 3, 204, 80, 55, 33, 126,
6, 206, 201, 70, 84, 59, 242, 22,
43, 134, 15, 93, 17, 241, 124, 240,
164, 23, 41, 228, 69, 144, 60, 202,
172, 77, 116, 21, 44, 0, 33, 1,
25, 32, 194, 8, 4, 80, 129, 47,
19, 76, 136, 240, 25, 152, 0, 124,
184, 195, 45, 175, 192, 0, 62, 91,
65, 6, 136, 181, 149, 184, 172, 23,
41, 54, 186, 76, 133, 230, 114, 227,
27, 57, 36, 111, 109, 115, 194, 76,
28, 69, 23, 93, 253, 169, 39, 82,
113, 150, 82, 64, 20, 52, 166, 44,
242, 80, 205, 107, 118, 141, 20, 145,
139, 85, 112, 34, 100, 163, 224, 4,
31, 53, 161, 137, 7, 65, 230, 151,
226, 35, 196, 99, 245, 96, 19, 11,
85, 252, 46, 176, 12, 86, 164, 162,
167, 188, 71, 10, 25, 43, 37, 220,
228, 21, 52, 33, 136, 69, 173, 42,
82, 172, 97, 77, 79, 164, 112, 147,
13, 125, 15, 148, 144, 212, 74, 110,
118, 115, 2, 32, 116, 192, 127, 176,
10, 141, 180, 116, 85, 66, 72, 158,
181, 140, 164, 144, 5, 33, 176, 64,
9, 90, 168, 152, 18, 178, 152, 68,
24, 38, 113, 18, 161, 40, 98, 44,
143, 160, 5, 43, 40, 247, 167, 243,
140, 128, 105, 64, 232, 25, 255, 252,
39, 195, 172, 17, 148, 13, 201, 136,
160, 119, 90, 203, 104, 237, 56, 154,
254, 97, 231, 200, 5, 68, 58, 160,
103, 129, 113, 235, 1, 39, 232, 130,
74, 104, 241, 141, 234, 112, 58, 25,
7, 60, 7, 168, 17, 117, 49, 86,
68, 209, 156, 250, 73, 245, 94, 132,
126, 49, 82, 72, 57, 101, 5, 205,
214, 93, 136, 32, 104, 90, 47, 36,
46, 184, 153, 145, 7, 105, 164, 144,
133, 124, 16, 134, 27, 34, 229, 66,
102, 119, 34, 220, 192, 72, 38, 182,
217, 30, 117, 35, 101, 115, 34, 124,
211, 0, 226, 150, 182, 146, 238, 251,
128, 12, 32, 105, 160, 173, 79, 0,
236, 212, 147, 1, 176, 209, 142, 54,
127, 122, 172, 83, 177, 136, 45, 45,
217, 70, 33, 195, 78, 219, 128, 167,
220, 26, 37, 68, 106, 163, 52, 35,
213, 232, 156, 231, 167, 219, 248, 32,
40, 81, 157, 202, 169, 230, 178, 81,
220, 146, 194, 14, 110, 94, 48, 25,
240, 36, 204, 144, 41, 226, 141, 246,
140, 120, 90, 87, 33, 8, 211, 220,
197, 116, 87, 38, 171, 105, 196, 58,
173, 157, 19, 111, 147, 164, 145, 2,
201, 162, 118, 2, 97, 45, 132, 84,
158, 17, 229, 66, 174, 240, 136, 53,
212, 40, 80, 88, 218, 29, 210, 88,
129, 73, 75, 128, 224, 209, 179, 148,
121, 145, 173, 0, 50, 77, 234, 170,
139, 187, 11, 61, 96, 5, 164, 35,
131, 232, 162, 4, 82, 147, 16, 50,
152, 4, 82, 208, 132, 53, 200, 254,
27, 54, 184, 2, 58, 211, 131, 85,
49, 28, 25, 250, 50, 217, 232, 169,
17, 96, 143, 211, 147, 157, 131, 248,
40, 50, 48, 134, 108, 192, 143, 68,
115, 159, 121, 105, 180, 215, 114, 180,
134, 137, 6, 59, 72, 169, 215, 209,
13, 9, 208, 178, 216, 59, 152, 85,
152, 187, 222, 98, 135, 112, 0, 187,
112, 8, 135, 104, 80, 132, 75, 89,
133, 108, 96, 5, 54, 224, 3, 133,
137, 135, 115, 248, 134, 4, 98, 133,
13, 36, 16, 102, 96, 133, 46, 32,
168, 106, 233, 160, 46, 72, 140, 209,
10, 131, 200, 122, 21, 224, 72, 37,
103, 82, 136, 217, 121, 157, 209, 74,
47, 15, 250, 160, 17, 200, 128, 150,
248, 160, 113, 211, 10, 208, 11, 142,
211, 112, 38, 39, 8, 142, 87, 145,
128, 168, 137, 143, 103, 3, 155, 252,
177, 182, 35, 129, 195, 251, 154, 54,
245, 106, 145, 160, 113, 40, 21, 201,
11, 207, 168, 36, 85, 114, 62, 97,
161, 25, 236, 201, 139, 148, 98, 136,
196, 59, 28, 37, 40, 17, 220, 88,
25, 124, 99, 141, 159, 176, 145, 31,
217, 10, 186, 104, 148, 79, 180, 16,
183, 241, 51, 65, 8, 134, 92, 160,
132, 48, 24, 5, 95, 0, 153, 129,
123, 66, 59, 144, 5, 89, 8, 53,
82, 160, 5, 56, 131, 186, 231, 106,
64, 211, 56, 172, 174, 202, 170, 85,
49, 51, 211, 1, 50, 175, 254, 130,
37, 50, 32, 38, 62, 112, 26, 160,
32, 40, 39, 176, 179, 28, 185, 139,
26, 209, 27, 32, 56, 159, 73, 16,
149, 63, 18, 27, 153, 147, 0, 15,
194, 26, 26, 193, 30, 50, 178, 11,
210, 248, 35, 140, 179, 11, 65, 32,
140, 192, 104, 147, 48, 58, 10, 99,
82, 139, 43, 96, 11, 46, 130, 194,
81, 208, 8, 71, 210, 1, 39, 177,
57, 29, 208, 16, 110, 209, 31, 130,
145, 128, 7, 232, 128, 22, 8, 3,
95, 208, 180, 246, 121, 159, 237, 176,
23, 238, 176, 193, 4, 209, 15, 74,
160, 18, 127, 58, 146, 254, 137, 61,
61, 32, 5, 86, 16, 200, 1, 18,
143, 111, 48, 134, 106, 136, 152, 108,
152, 132, 151, 104, 66, 86, 144, 179,
96, 88, 152, 112, 200, 134, 160, 27,
5, 99, 224, 4, 54, 208, 132, 108,
72, 66, 62, 40, 141, 136, 112, 154,
223, 17, 155, 245, 210, 3, 44, 104,
145, 245, 136, 146, 148, 129, 145, 135,
138, 60, 158, 252, 51, 224, 40, 33,
19, 129, 33, 98, 177, 158, 21, 192,
140, 89, 139, 9, 245, 58, 156, 25,
24, 54, 37, 249, 199, 12, 184, 182,
45, 3, 155, 129, 97, 61, 130, 248,
145, 109, 179, 168, 224, 177, 29, 208,
210, 74, 54, 58, 141, 140, 138, 8,
65, 48, 31, 154, 161, 8, 167, 184,
32, 54, 48, 28, 87, 33, 35, 70,
1, 197, 83, 116, 27, 254, 190, 242,
174, 159, 192, 177, 231, 1, 10, 159,
144, 153, 53, 104, 14, 184, 226, 132,
96, 88, 5, 54, 184, 39, 144, 20,
4, 89, 160, 133, 138, 17, 66, 92,
210, 4, 193, 180, 3, 70, 42, 21,
148, 107, 20, 230, 121, 136, 94, 113,
149, 98, 244, 42, 211, 33, 181, 75,
217, 25, 82, 154, 25, 86, 41, 168,
166, 161, 185, 1, 163, 53, 12, 124,
20, 211, 225, 43, 26, 104, 61, 163,
105, 1, 255, 177, 188, 130, 10, 192,
48, 35, 199, 12, 137, 16, 78, 208,
155, 23, 11, 65, 25, 43, 147, 250,
32, 132, 9, 100, 133, 198, 224, 131,
8, 108, 48, 90, 137, 26, 130, 56,
165, 136, 0, 155, 246, 248, 195, 244,
16, 44, 50, 240, 133, 115, 32, 200,
130, 156, 23, 215, 242, 142, 124, 120,
52, 89, 16, 150, 129, 241, 65, 246,
120, 0, 166, 33, 132, 85, 96, 133,
92, 136, 151, 240, 96, 135, 111, 56,
66, 135, 233, 139, 48, 32, 16, 91,
228, 3, 7, 234, 152, 104, 24, 133,
118, 201, 134, 81, 72, 172, 111, 160,
66, 74, 176, 144, 18, 250, 17, 45,
105, 26, 231, 243, 19, 171, 3, 180,
60, 179, 186, 238, 90, 38, 129, 128,
18, 65, 155, 157, 129, 250, 140, 135,
122, 29, 56, 244, 141, 12, 89, 129,
226, 91, 163, 87, 81, 205, 184, 224,
168, 145, 18, 0, 216, 1, 152, 35,
178, 206, 167, 113, 254, 145, 148, 98,
143, 5, 29, 45, 85, 250, 32, 21,
201, 141, 14, 48, 17, 193, 242, 129,
46, 16, 186, 97, 171, 145, 157, 114,
11, 31, 248, 30, 196, 152, 9, 54,
32, 132, 175, 120, 149, 226, 115, 30,
127, 179, 12, 238, 162, 1, 150, 241,
183, 28, 163, 42, 11, 241, 1, 86,
147, 5, 69, 232, 2, 185, 162, 4,
19, 125, 171, 163, 88, 48, 61, 136,
3, 66, 104, 19, 41, 144, 179, 58,
67, 148, 53, 106, 141, 242, 83, 13,
68, 233, 36, 71, 194, 10, 32, 251,
163, 195, 25, 13, 23, 19, 75, 29,
40, 10, 31, 232, 67, 11, 25, 40,
58, 33, 150, 199, 162, 144, 46, 248,
139, 72, 209, 43, 173, 248, 140, 170,
241, 1, 50, 160, 129, 130, 200, 154,
155, 163, 79, 86, 162, 149, 177, 18,
50, 139, 169, 32, 87, 164, 133, 90,
210, 132, 162, 99, 3, 82, 240, 133,
10, 228, 4, 95, 208, 4, 174, 192,
197, 43, 57, 43, 139, 58, 8, 64,
27, 136, 36, 113, 145, 19, 8, 151,
40, 153, 129, 48, 200, 5, 229, 84,
180, 237, 72, 52, 78, 133, 173, 1,
234, 180, 53, 64, 143, 130, 41, 136,
206, 26, 1, 39, 160, 132, 85, 32,
133, 92, 160, 187, 1, 74, 135, 119,
137, 32, 36, 44, 188, 46, 224, 132,
146, 20, 4, 66, 144, 5, 234, 136,
6, 99, 152, 132, 38, 148, 32, 74,
48, 134, 115, 254, 160, 66, 86, 104,
54, 29, 181, 141, 210, 59, 85, 169,
240, 157, 129, 146, 157, 12, 240, 193,
206, 26, 136, 181, 171, 128, 253, 52,
8, 96, 107, 1, 149, 250, 79, 171,
107, 146, 3, 221, 179, 226, 161, 18,
148, 17, 13, 234, 42, 136, 170, 89,
143, 148, 33, 24, 221, 184, 175, 83,
170, 202, 246, 176, 202, 205, 26, 154,
122, 36, 22, 99, 131, 157, 129, 194,
141, 46, 8, 140, 21, 33, 130, 56,
176, 51, 63, 1, 21, 48, 212, 132,
182, 81, 2, 149, 4, 21, 63, 193,
145, 80, 97, 148, 168, 8, 11, 54,
165, 21, 82, 169, 209, 70, 18, 149,
80, 193, 12, 198, 128, 156, 230, 18,
166, 71, 160, 4, 254, 35, 4, 78,
160, 4, 240, 33, 5, 216, 12, 3,
78, 0, 186, 16, 204, 137, 85, 185,
184, 179, 202, 184, 69, 49, 156, 86,
218, 57, 73, 66, 158, 177, 234, 2,
74, 168, 64, 29, 88, 82, 41, 168,
0, 134, 248, 141, 25, 96, 163, 31,
137, 183, 204, 144, 2, 241, 161, 144,
213, 249, 17, 177, 41, 18, 22, 29,
192, 32, 1, 208, 75, 196, 83, 105,
137, 139, 50, 163, 160, 85, 192, 37,
74, 24, 5, 92, 82, 4, 77, 168,
165, 94, 122, 4, 48, 124, 4, 66,
176, 145, 113, 89, 3, 27, 209, 36,
208, 56, 37, 56, 4, 52, 222, 0,
14, 214, 203, 26, 31, 160, 32, 133,
97, 78, 254, 26, 100, 173, 78, 253,
84, 241, 232, 23, 74, 37, 24, 74,
243, 199, 43, 168, 143, 81, 224, 206,
234, 128, 91, 176, 131, 207, 112, 88,
9, 41, 208, 4, 6, 89, 176, 85,
160, 187, 100, 96, 69, 86, 253, 134,
195, 140, 152, 112, 216, 15, 201, 232,
137, 9, 139, 87, 166, 25, 156, 44,
145, 17, 15, 114, 38, 30, 12, 151,
83, 42, 182, 97, 225, 25, 91, 145,
29, 103, 10, 30, 228, 51, 80, 79,
114, 130, 24, 185, 159, 188, 32, 13,
32, 113, 214, 146, 18, 167, 21, 48,
146, 245, 32, 219, 144, 114, 145, 17,
120, 59, 22, 25, 129, 185, 120, 29,
202, 243, 160, 98, 121, 157, 12, 56,
25, 133, 104, 9, 82, 73, 155, 62,
177, 8, 76, 145, 11, 44, 144, 72,
102, 1, 17, 28, 161, 42, 185, 204,
177, 228, 233, 9, 185, 84, 149, 78,
138, 76, 51, 3, 67, 177, 156, 169,
85, 200, 5, 148, 56, 212, 81, 96,
131, 211, 2, 73, 62, 21, 4, 100,
164, 5, 78, 32, 131, 186, 172, 11,
160, 208, 171, 123, 107, 13, 227, 179,
136, 251, 164, 13, 158, 91, 29, 73,
114, 69, 78, 80, 4, 34, 176, 131,
140, 112, 154, 131, 168, 128, 180, 233,
2, 173, 0, 139, 48, 176, 149, 145,
185, 2, 172, 48, 33, 39, 144, 26,
179, 237, 79, 25, 137, 161, 166, 177,
136, 143, 99, 64, 33, 171, 137, 181,
192, 254, 2, 65, 80, 82, 48, 36,
138, 49, 20, 132, 192, 184, 213, 27,
147, 179, 182, 177, 145, 18, 186, 141,
111, 129, 189, 15, 74, 18, 170, 169,
89, 50, 192, 91, 95, 160, 38, 69,
179, 23, 108, 42, 72, 216, 82, 46,
72, 35, 205, 112, 145, 0, 251, 202,
128, 46, 208, 78, 188, 141, 23, 87,
101, 134, 140, 252, 6, 89, 253, 144,
71, 96, 144, 180, 26, 133, 106, 56,
7, 99, 96, 133, 81, 8, 6, 146,
212, 4, 95, 88, 92, 225, 82, 4,
81, 218, 12, 83, 58, 1, 219, 80,
130, 44, 194, 130, 206, 112, 195, 135,
250, 160, 3, 29, 136, 174, 179, 186,
1, 133, 195, 31, 170, 92, 15, 90,
145, 160, 240, 98, 94, 17, 150, 153,
129, 68, 10, 241, 129, 105, 181, 57,
253, 57, 189, 205, 234, 145, 144, 210,
54, 30, 170, 227, 46, 91, 136, 19,
120, 139, 190, 50, 208, 12, 32, 13,
206, 210, 51, 192, 234, 12, 208, 45,
171, 87, 50, 156, 153, 0, 217, 135,
184, 17, 90, 75, 216, 71, 185, 56,
108, 57, 25, 232, 249, 9, 210, 193,
146, 135, 149, 37, 90, 152, 49, 61,
88, 5, 88, 172, 137, 92, 96, 5,
184, 161, 133, 32, 181, 131, 137, 156,
132, 113, 73, 19, 156, 120, 204, 174,
90, 95, 94, 225, 184, 213, 241, 181,
31, 178, 153, 230, 195, 25, 50, 24,
79, 29, 120, 8, 150, 160, 146, 25,
254, 90, 208, 57, 109, 1, 136, 32,
161, 46, 80, 4, 80, 154, 150, 208,
184, 225, 245, 240, 193, 109, 28, 168,
237, 33, 168, 136, 128, 57, 218, 72,
90, 62, 120, 142, 16, 228, 132, 220,
252, 216, 160, 163, 213, 32, 149, 165,
32, 85, 83, 82, 176, 51, 157, 251,
17, 111, 211, 199, 10, 192, 99, 246,
8, 151, 17, 16, 185, 92, 48, 6,
99, 200, 5, 102, 176, 166, 107, 98,
52, 24, 230, 135, 238, 0, 85, 86,
168, 57, 254, 217, 13, 214, 91, 3,
86, 88, 5, 30, 174, 166, 78, 203,
133, 244, 9, 174, 85, 136, 148, 71,
96, 134, 145, 88, 184, 100, 216, 143,
107, 54, 134, 112, 112, 181, 96, 21,
86, 126, 17, 4, 90, 123, 136, 15,
109, 8, 243, 137, 138, 24, 113, 38,
157, 212, 73, 203, 93, 59, 72, 45,
8, 61, 91, 59, 93, 153, 67, 15,
122, 168, 163, 249, 154, 22, 80, 155,
22, 232, 170, 167, 153, 153, 116, 155,
214, 158, 137, 15, 245, 200, 154, 30,
145, 80, 23, 225, 22, 218, 147, 18,
39, 217, 30, 98, 233, 26, 201, 27,
129, 63, 25, 136, 110, 28, 8, 50,
178, 186, 21, 224, 210, 108, 97, 179,
196, 212, 3, 90, 24, 133, 135, 224,
43, 204, 216, 42, 183, 145, 75, 188,
8, 141, 231, 59, 21, 245, 77, 30,
229, 217, 12, 77, 88, 133, 73, 184,
137, 183, 74, 229, 241, 137, 27, 254,
62, 168, 27, 62, 0, 31, 62, 40,
159, 241, 73, 56, 176, 40, 198, 72,
25, 155, 208, 108, 83, 55, 77, 145,
157, 169, 36, 242, 250, 19, 242, 220,
88, 180, 5, 12, 29, 152, 169, 227,
35, 77, 255, 33, 10, 28, 209, 190,
136, 219, 185, 214, 57, 143, 145, 234,
47, 9, 24, 168, 25, 194, 26, 104,
94, 218, 201, 6, 185, 184, 176, 3,
90, 0, 16, 89, 146, 174, 9, 148,
192, 163, 235, 139, 73, 184, 66, 12,
92, 226, 102, 243, 205, 166, 217, 172,
214, 131, 72, 222, 104, 18, 172, 81,
130, 73, 240, 133, 187, 99, 6, 95,
120, 231, 120, 102, 78, 122, 230, 14,
239, 20, 143, 96, 184, 130, 155, 180,
78, 61, 163, 102, 85, 77, 206, 128,
118, 103, 130, 62, 7, 86, 176, 17,
132, 86, 232, 73, 0, 59, 89, 120,
98, 102, 200, 59, 74, 128, 151, 137,
206, 134, 71, 216, 138, 72, 9, 142,
48, 181, 11, 126, 250, 178, 142, 38,
168, 102, 134, 17, 25, 89, 38, 102,
93, 65, 19, 73, 145, 97, 137, 21,
163, 186, 214, 203, 160, 29, 58, 17,
52, 72, 4, 168, 129, 152, 214, 170,
113, 143, 216, 115, 187, 145, 210, 31,
224, 24, 162, 162, 21, 80, 171, 35,
150, 205, 235, 12, 81, 36, 2, 127,
220, 158, 254, 117, 130, 144, 38, 2,
65, 57, 13, 62, 240, 136, 203, 49,
50, 46, 10, 13, 211, 8, 254, 21,
29, 243, 69, 172, 64, 157, 79, 236,
164, 170, 178, 170, 23, 179, 155, 65,
165, 37, 149, 228, 139, 252, 253, 231,
53, 81, 85, 5, 210, 206, 85, 32,
3, 17, 174, 141, 134, 216, 185, 72,
170, 36, 208, 248, 145, 187, 174, 157,
49, 179, 25, 34, 123, 49, 59, 144,
89, 148, 136, 83, 1, 1, 138, 108,
153, 1, 138, 186, 177, 3, 231, 163,
1, 123, 223, 24, 33, 136, 247, 232,
71, 102, 94, 59, 218, 107, 175, 210,
185, 50, 45, 117, 2, 5, 71, 140,
43, 64, 235, 95, 162, 152, 196, 160,
169, 200, 202, 27, 62, 176, 215, 137,
35, 3, 23, 87, 33, 172, 251, 193,
217, 9, 152, 105, 37, 2, 69, 96,
225, 106, 200, 134, 135, 201, 133, 92,
168, 134, 123, 216, 84, 247, 225, 152,
116, 208, 91, 220, 246, 14, 118, 200,
193, 109, 153, 91, 214, 91, 129, 129,
35, 5, 188, 61, 7, 139, 12, 135,
96, 160, 5, 130, 14, 135, 85, 184,
11, 66, 96, 134, 92, 212, 216, 92,
72, 6, 190, 152, 166, 36, 166, 4,
231, 22, 86, 146, 92, 5, 57, 73,
27, 219, 152, 28, 39, 56, 1, 197,
3, 26, 96, 179, 153, 135, 114, 68,
18, 241, 53, 104, 114, 166, 21, 186,
157, 20, 49, 140, 46, 232, 113, 57,
188, 161, 48, 0, 14, 113, 107, 1,
46, 234, 32, 127, 108, 17, 107, 51,
8, 74, 59, 18, 247, 254, 216, 70,
30, 50, 219, 127, 124, 18, 56, 44,
45, 216, 241, 179, 70, 92, 162, 170,
124, 187, 19, 48, 213, 41, 131, 28,
185, 40, 156, 43, 16, 4, 144, 61,
170, 48, 211, 177, 203, 56, 88, 54,
189, 141, 78, 68, 157, 176, 48, 51,
194, 186, 12, 96, 205, 5, 5, 98,
133, 96, 64, 178, 39, 182, 62, 89,
148, 51, 193, 188, 137, 85, 141, 234,
77, 10, 192, 247, 107, 247, 201, 86,
218, 143, 155, 150, 158, 115, 137, 81,
152, 132, 198, 128, 144, 204, 194, 64,
65, 80, 130, 17, 185, 214, 17, 192,
139, 168, 56, 48, 208, 200, 22, 130,
8, 169, 245, 192, 182, 192, 218, 30,
91, 225, 118, 110, 15, 37, 39, 48,
199, 7, 145, 114, 5, 58, 31, 239,
35, 230, 60, 73, 43, 45, 55, 98,
41, 187, 235, 131, 176, 52, 133, 0,
152, 112, 161, 129, 243, 100, 6, 143,
9, 98, 140, 204, 5, 95, 200, 134,
246, 217, 142, 116, 96, 14, 95, 0,
98, 234, 88, 152, 238, 160, 225, 73,
211, 31, 115, 166, 129, 67, 253, 231,
228, 148, 243, 34, 44, 229, 244, 65,
194, 74, 119, 118, 99, 24, 76, 190,
32, 84, 149, 248, 45, 180, 59, 226,
136, 17, 214, 253, 208, 3, 208, 112,
138, 106, 105, 139, 161, 46, 96, 203,
91, 136, 75, 210, 150, 83, 7, 245,
108, 165, 60, 158, 252, 104, 43, 145,
136, 83, 66, 81, 254, 90, 153, 214,
217, 9, 142, 149, 33, 130, 126, 20,
136, 16, 202, 227, 146, 106, 143, 251,
174, 182, 170, 49, 8, 253, 36, 8,
9, 248, 199, 199, 110, 1, 62, 240,
222, 158, 137, 67, 26, 176, 225, 129,
136, 149, 168, 128, 75, 133, 96, 3,
118, 214, 4, 81, 42, 141, 83, 76,
223, 176, 160, 147, 231, 185, 141, 229,
113, 150, 159, 66, 223, 230, 141, 187,
116, 81, 177, 79, 214, 4, 12, 76,
19, 185, 241, 103, 181, 230, 4, 197,
34, 131, 71, 64, 24, 48, 1, 178,
142, 211, 36, 82, 169, 94, 195, 210,
10, 17, 254, 147, 155, 121, 224, 172,
88, 3, 184, 226, 9, 176, 96, 9,
123, 85, 117, 166, 208, 129, 143, 106,
29, 37, 23, 230, 120, 117, 86, 33,
218, 50, 142, 206, 26, 14, 154, 223,
219, 227, 57, 77, 138, 3, 85, 229,
39, 25, 211, 136, 12, 212, 155, 71,
32, 133, 200, 170, 177, 200, 122, 246,
71, 152, 53, 133, 0, 154, 10, 61,
18, 244, 16, 161, 32, 105, 1, 54,
144, 133, 146, 71, 194, 73, 175, 6,
231, 200, 133, 149, 191, 151, 239, 136,
134, 254, 248, 115, 241, 96, 31, 123,
62, 135, 242, 24, 85, 101, 38, 130,
79, 86, 213, 96, 104, 255, 142, 145,
5, 86, 96, 134, 190, 5, 25, 41,
0, 8, 65, 201, 104, 61, 26, 197,
73, 211, 170, 71, 180, 162, 85, 59,
199, 106, 85, 254, 182, 112, 225, 206,
73, 52, 102, 71, 7, 141, 43, 87,
116, 72, 185, 66, 68, 135, 15, 44,
97, 90, 172, 104, 49, 131, 6, 72,
31, 58, 72, 158, 40, 89, 178, 133,
73, 152, 29, 78, 204, 88, 97, 19,
38, 206, 25, 64, 226, 144, 241, 49,
83, 199, 202, 46, 97, 4, 100, 160,
65, 99, 4, 17, 32, 74, 156, 156,
120, 48, 179, 66, 133, 25, 39, 42,
24, 16, 80, 53, 129, 1, 9, 37,
103, 84, 72, 96, 245, 65, 5, 9,
98, 19, 36, 168, 176, 98, 196, 10,
29, 64, 20, 177, 98, 115, 162, 195,
140, 141, 9, 70, 204, 24, 209, 130,
136, 146, 46, 87, 102, 128, 116, 226,
131, 141, 44, 130, 78, 148, 96, 233,
98, 184, 11, 150, 142, 82, 58, 98,
193, 114, 101, 113, 82, 39, 97, 194,
172, 97, 179, 102, 50, 25, 199, 143,
59, 106, 236, 114, 80, 144, 29, 50,
122, 70, 99, 225, 163, 135, 79, 152,
56, 166, 215, 172, 137, 99, 25, 139,
30, 65, 156, 200, 44, 37, 98, 251,
182, 82, 37, 68, 156, 240, 118, 146,
20, 136, 109, 31, 194, 129, 39, 85,
233, 35, 184, 15, 32, 107, 72, 141,
178, 3, 132, 15, 37, 59, 62, 194,
176, 1, 210, 162, 139, 162, 43, 35,
58, 148, 28, 81, 129, 166, 245, 12,
223, 79, 72, 240, 42, 224, 188, 87,
9, 52, 87, 156, 24, 113, 162, 69,
114, 32, 254, 242, 229, 223, 214, 173,
100, 233, 154, 81, 164, 4, 97, 81,
180, 74, 81, 127, 163, 60, 18, 134,
34, 164, 80, 18, 134, 32, 163, 76,
210, 133, 30, 154, 112, 210, 133, 74,
51, 72, 149, 85, 6, 25, 72, 0,
85, 88, 21, 208, 69, 198, 40, 198,
84, 243, 13, 136, 18, 157, 243, 141,
49, 172, 48, 199, 204, 61, 241, 176,
195, 78, 58, 223, 132, 147, 206, 61,
49, 198, 24, 143, 140, 241, 196, 147,
78, 53, 124, 156, 144, 193, 3, 6,
60, 32, 193, 21, 180, 248, 66, 10,
41, 201, 156, 147, 78, 58, 236, 84,
179, 10, 43, 209, 184, 104, 140, 38,
113, 148, 102, 76, 46, 138, 140, 178,
10, 31, 143, 40, 98, 12, 51, 17,
201, 146, 139, 136, 231, 80, 20, 13,
33, 106, 173, 129, 197, 78, 122, 248,
118, 69, 99, 51, 192, 132, 146, 113,
62, 208, 224, 166, 81, 124, 157, 164,
195, 73, 18, 158, 132, 18, 80, 40,
25, 165, 92, 24, 64, 180, 183, 130,
155, 64, 12, 37, 0, 93, 39, 60,
166, 20, 16, 29, 100, 48, 213, 3,
45, 236, 248, 192, 121, 86, 25, 144,
129, 14, 31, 117, 85, 169, 121, 39,
76, 165, 97, 73, 64, 92, 161, 165,
18, 58, 20, 229, 3, 143, 45, 0,
7, 196, 73, 78, 0, 65, 168, 14,
78, 232, 112, 133, 29, 132, 60, 210,
216, 100, 141, 33, 246, 216, 102, 139,
73, 254, 225, 91, 113, 82, 32, 102,
88, 97, 141, 37, 230, 132, 20, 154,
117, 49, 10, 43, 148, 240, 52, 202,
40, 130, 116, 161, 9, 41, 11, 42,
34, 203, 108, 118, 48, 23, 26, 39,
172, 112, 18, 134, 20, 247, 13, 134,
151, 109, 247, 149, 251, 43, 113, 183,
253, 150, 148, 18, 64, 12, 167, 174,
103, 171, 16, 66, 4, 27, 154, 8,
162, 196, 21, 106, 182, 160, 4, 106,
36, 1, 181, 130, 1, 93, 141, 48,
194, 3, 9, 136, 69, 105, 165, 62,
38, 144, 65, 11, 58, 180, 135, 83,
124, 196, 205, 167, 174, 109, 113, 104,
162, 135, 29, 82, 168, 166, 135, 198,
118, 216, 129, 5, 27, 118, 112, 76,
198, 26, 118, 56, 209, 5, 25, 138,
132, 1, 18, 13, 236, 73, 208, 65,
7, 98, 217, 85, 87, 7, 215, 113,
226, 11, 51, 12, 101, 147, 77, 136,
223, 36, 83, 45, 31, 164, 188, 40,
209, 138, 236, 216, 88, 163, 140, 41,
222, 24, 14, 41, 58, 120, 119, 97,
6, 107, 4, 19, 12, 180, 198, 28,
137, 100, 52, 164, 52, 25, 206, 55,
179, 101, 198, 134, 47, 193, 40, 194,
201, 42, 113, 232, 161, 72, 52, 201,
84, 99, 140, 47, 213, 112, 45, 166,
152, 217, 104, 34, 31, 107, 68, 168,
22, 134, 15, 107, 92, 17, 33, 124,
64, 244, 201, 23, 70, 115, 154, 164,
231, 73, 38, 249, 57, 231, 156, 18,
254, 194, 183, 134, 20, 68, 156, 245,
222, 12, 62, 40, 97, 158, 1, 45,
20, 150, 156, 18, 62, 84, 208, 193,
8, 151, 58, 42, 129, 0, 100, 37,
0, 22, 161, 92, 25, 80, 85, 86,
89, 233, 182, 66, 7, 21, 60, 218,
193, 116, 93, 52, 78, 167, 82, 227,
74, 152, 57, 13, 45, 32, 75, 132,
15, 113, 80, 194, 28, 25, 66, 133,
113, 24, 98, 141, 45, 214, 91, 187,
62, 72, 136, 236, 175, 190, 46, 246,
24, 111, 207, 99, 49, 137, 47, 178,
216, 17, 198, 40, 180, 8, 114, 5,
91, 148, 144, 33, 8, 43, 163, 92,
166, 159, 32, 100, 80, 178, 138, 38,
108, 200, 254, 252, 175, 247, 217, 199,
217, 99, 238, 155, 171, 155, 112, 245,
31, 167, 46, 25, 156, 60, 66, 136,
18, 107, 240, 193, 199, 98, 200, 32,
133, 25, 16, 1, 92, 45, 211, 193,
89, 66, 103, 48, 208, 133, 238, 116,
149, 18, 128, 4, 126, 84, 51, 26,
180, 71, 42, 39, 0, 74, 114, 234,
55, 159, 13, 2, 161, 94, 122, 16,
32, 31, 4, 17, 7, 41, 8, 130,
16, 122, 192, 2, 33, 38, 1, 64,
65, 60, 2, 128, 89, 210, 68, 79,
240, 212, 158, 174, 24, 128, 44, 29,
32, 194, 21, 74, 150, 32, 95, 112,
41, 103, 209, 208, 217, 55, 178, 145,
12, 78, 232, 129, 16, 172, 96, 134,
219, 36, 18, 143, 124, 228, 99, 254,
70, 52, 74, 145, 210, 86, 116, 14,
95, 72, 225, 115, 51, 209, 3, 219,
136, 100, 181, 36, 165, 35, 107, 91,
139, 6, 0, 51, 19, 134, 85, 24,
227, 17, 148, 144, 133, 30, 216, 64,
137, 108, 176, 109, 18, 156, 136, 70,
56, 34, 146, 14, 49, 125, 99, 21,
31, 65, 153, 15, 146, 117, 5, 26,
212, 198, 38, 132, 98, 84, 77, 96,
98, 147, 65, 249, 113, 144, 132, 186,
137, 167, 110, 210, 176, 43, 0, 129,
130, 43, 225, 139, 111, 30, 56, 3,
200, 232, 228, 85, 9, 112, 212, 230,
42, 80, 176, 7, 20, 108, 129, 132,
98, 160, 0, 194, 242, 0, 134, 145,
196, 37, 83, 89, 193, 201, 50, 7,
28, 87, 41, 15, 114, 33, 9, 23,
71, 50, 163, 4, 65, 8, 73, 19,
195, 19, 74, 97, 110, 105, 24, 94,
65, 166, 145, 13, 99, 140, 174, 52,
194, 166, 196, 36, 203, 49, 211, 202,
133, 44, 6, 164, 9, 89, 104, 2,
59, 204, 81, 13, 180, 174, 55, 9,
77, 16, 2, 11, 130, 248, 157, 148,
174, 208, 155, 223, 76, 108, 41, 200,
202, 220, 112, 228, 35, 28, 160, 144,
51, 98, 238, 34, 195, 36, 88, 211,
65, 215, 40, 129, 50, 97, 64, 73,
14, 241, 178, 6, 50, 16, 161, 40,
158, 50, 207, 3, 209, 211, 163, 151,
181, 128, 130, 3, 251, 137, 113, 248,
132, 65, 144, 184, 107, 58, 254, 156,
104, 142, 19, 30, 65, 10, 142, 17,
130, 20, 213, 36, 196, 127, 72, 184,
138, 73, 88, 19, 120, 73, 89, 9,
143, 196, 146, 129, 25, 160, 144, 20,
185, 8, 6, 15, 153, 33, 210, 31,
142, 148, 33, 213, 160, 5, 33, 248,
64, 198, 136, 188, 136, 29, 71, 82,
17, 20, 99, 212, 196, 40, 118, 209,
14, 236, 25, 216, 12, 20, 193, 140,
33, 21, 233, 28, 43, 74, 199, 207,
100, 225, 182, 100, 232, 129, 58, 93,
176, 131, 44, 140, 161, 8, 234, 21,
149, 20, 223, 24, 146, 30, 56, 17,
17, 183, 205, 81, 34, 164, 16, 14,
98, 124, 208, 133, 53, 184, 42, 12,
161, 105, 79, 75, 250, 137, 23, 229,
177, 228, 45, 104, 145, 9, 231, 60,
213, 30, 152, 129, 181, 37, 28, 133,
208, 12, 116, 115, 18, 141, 60, 144,
35, 56, 132, 157, 187, 52, 217, 1,
167, 104, 178, 42, 86, 153, 203, 91,
86, 128, 176, 168, 116, 206, 71, 53,
115, 147, 164, 232, 226, 170, 196, 210,
224, 35, 55, 25, 231, 21, 38, 115,
159, 146, 125, 239, 75, 164, 184, 76,
24, 200, 48, 153, 91, 54, 6, 122,
188, 225, 157, 187, 56, 226, 24, 206,
56, 175, 125, 191, 114, 194, 21, 52,
65, 9, 62, 196, 193, 9, 174, 177,
195, 21, 44, 19, 135, 28, 142, 38,
120, 174, 97, 156, 199, 210, 199, 27,
115, 253, 70, 37, 24, 254, 172, 159,
81, 2, 71, 206, 224, 246, 9, 35,
126, 3, 73, 24, 56, 193, 9, 62,
0, 65, 15, 209, 202, 27, 37, 244,
16, 148, 56, 0, 199, 99, 245, 36,
130, 20, 124, 64, 41, 7, 230, 211,
42, 18, 24, 1, 74, 218, 147, 1,
238, 168, 165, 160, 245, 75, 73, 196,
146, 75, 10, 69, 72, 161, 161, 20,
229, 195, 40, 14, 68, 136, 248, 50,
72, 185, 162, 209, 196, 40, 226, 16,
28, 169, 104, 232, 58, 254, 241, 69,
50, 162, 33, 210, 100, 248, 80, 192,
12, 249, 97, 50, 100, 193, 135, 122,
5, 163, 26, 70, 107, 81, 58, 84,
20, 225, 21, 29, 237, 30, 51, 77,
17, 59, 186, 118, 148, 159, 104, 34,
26, 67, 90, 5, 51, 174, 118, 14,
99, 144, 66, 168, 225, 136, 6, 147,
6, 20, 7, 86, 4, 227, 17, 147,
16, 91, 24, 154, 20, 24, 82, 4,
67, 34, 31, 66, 146, 68, 104, 129,
44, 189, 209, 128, 12, 25, 235, 241,
9, 167, 242, 168, 129, 65, 46, 119,
237, 217, 14, 91, 71, 144, 0, 79,
13, 172, 201, 104, 105, 137, 77, 122,
183, 134, 164, 8, 133, 85, 192, 121,
32, 16, 194, 133, 5, 214, 201, 105,
6, 78, 169, 16, 85, 206, 195, 73,
238, 88, 136, 71, 98, 174, 208, 121,
248, 217, 50, 168, 140, 215, 38, 142,
186, 225, 98, 222, 228, 203, 44, 175,
65, 41, 82, 8, 254, 3, 22, 252,
247, 136, 85, 172, 193, 48, 155, 61,
204, 104, 21, 19, 46, 249, 24, 5,
181, 206, 227, 141, 103, 221, 135, 44,
78, 208, 130, 19, 118, 152, 86, 180,
166, 55, 209, 46, 168, 116, 54, 249,
201, 239, 180, 194, 23, 6, 188, 140,
235, 55, 195, 53, 202, 225, 200, 153,
146, 114, 170, 36, 184, 245, 195, 2,
126, 9, 225, 4, 54, 8, 40, 178,
148, 168, 38, 17, 100, 73, 131, 93,
181, 160, 53, 97, 24, 65, 119, 243,
169, 30, 160, 60, 172, 37, 232, 29,
167, 168, 209, 139, 78, 54, 84, 135,
53, 108, 112, 130, 102, 217, 208, 17,
54, 8, 226, 206, 173, 65, 118, 84,
151, 203, 85, 224, 72, 97, 13, 13,
253, 104, 48, 8, 156, 140, 109, 115,
155, 25, 4, 246, 182, 47, 102, 163,
4, 66, 36, 35, 27, 55, 94, 218,
57, 108, 100, 52, 26, 169, 136, 194,
54, 82, 81, 56, 124, 129, 133, 169,
140, 0, 8, 164, 168, 70, 46, 152,
213, 144, 57, 142, 88, 107, 73, 252,
70, 53, 52, 33, 146, 73, 228, 98,
18, 147, 48, 134, 247, 190, 180, 138,
104, 68, 100, 68, 55, 22, 83, 56,
140, 17, 134, 43, 240, 4, 8, 100,
168, 56, 25, 212, 199, 186, 10, 205,
164, 173, 131, 122, 11, 204, 194, 162,
30, 79, 117, 60, 145, 103, 113, 79,
7, 93, 213, 63, 52, 193, 199, 7,
126, 77, 192, 254, 71, 102, 165, 3,
1, 164, 229, 40, 90, 217, 142, 121,
160, 150, 129, 133, 237, 28, 97, 15,
124, 212, 133, 34, 40, 129, 10, 17,
106, 4, 21, 2, 10, 17, 26, 182,
146, 11, 86, 102, 211, 163, 81, 159,
115, 153, 196, 134, 225, 233, 178, 179,
205, 59, 30, 239, 106, 210, 216, 193,
12, 102, 41, 75, 57, 173, 184, 150,
66, 8, 90, 40, 56, 127, 178, 80,
25, 33, 176, 149, 26, 86, 176, 130,
15, 28, 98, 133, 202, 206, 200, 231,
205, 32, 107, 183, 237, 226, 160, 6,
55, 200, 59, 81, 143, 243, 188, 97,
208, 132, 105, 136, 80, 50, 174, 230,
176, 11, 188, 233, 66, 35, 117, 66,
168, 19, 52, 210, 9, 184, 78, 88,
119, 25, 54, 39, 79, 149, 146, 79,
231, 237, 19, 113, 117, 48, 45, 69,
176, 129, 8, 89, 210, 131, 18, 78,
243, 78, 173, 62, 34, 65, 38, 122,
132, 44, 212, 86, 13, 102, 208, 34,
190, 156, 208, 26, 45, 114, 17, 182,
176, 25, 3, 164, 178, 96, 69, 96,
104, 31, 12, 86, 220, 235, 36, 122,
136, 198, 61, 92, 250, 34, 12, 39,
233, 221, 79, 108, 226, 209, 88, 116,
142, 28, 157, 156, 8, 172, 192, 183,
191, 145, 148, 142, 120, 143, 66, 168,
87, 147, 27, 98, 198, 78, 137, 23,
167, 143, 22, 66, 154, 8, 69, 0,
126, 36, 138, 132, 131, 25, 106, 66,
76, 166, 254, 6, 147, 169, 200, 214,
100, 82, 24, 114, 143, 123, 216, 35,
30, 9, 54, 57, 173, 126, 76, 236,
76, 98, 157, 57, 29, 100, 86, 9,
53, 211, 129, 95, 101, 128, 19, 172,
64, 6, 232, 134, 0, 60, 0, 70,
180, 192, 119, 189, 133, 4, 156, 14,
39, 209, 208, 8, 128, 78, 121, 112,
10, 234, 28, 32, 39, 205, 133, 78,
44, 70, 163, 112, 196, 0, 242, 133,
81, 40, 193, 36, 140, 2, 27, 140,
219, 36, 16, 194, 26, 232, 129, 44,
132, 155, 102, 21, 207, 48, 233, 5,
252, 196, 15, 171, 68, 142, 55, 213,
93, 105, 57, 143, 70, 60, 130, 47,
52, 139, 249, 144, 2, 12, 205, 23,
39, 16, 155, 38, 0, 94, 24, 216,
10, 33, 228, 139, 108, 180, 150, 125,
184, 79, 111, 109, 208, 64, 253, 90,
176, 105, 144, 113, 132, 129, 179, 172,
129, 14, 216, 129, 32, 84, 7, 25,
240, 65, 157, 133, 65, 11, 13, 160,
187, 116, 128, 193, 76, 82, 11, 212,
144, 85, 104, 82, 62, 49, 140, 155,
136, 87, 5, 65, 225, 167, 5, 14,
13, 72, 193, 239, 240, 65, 232, 141,
130, 170, 197, 129, 34, 116, 65, 11,
180, 23, 37, 112, 66, 46, 16, 24,
195, 65, 156, 207, 212, 158, 47, 228,
2, 217, 229, 158, 238, 229, 32, 115,
48, 203, 237, 121, 15, 5, 205, 132,
18, 172, 194, 57, 48, 209, 141, 20,
159, 254, 132, 25, 77, 76, 213, 8,
139, 184, 212, 42, 88, 135, 162, 208,
194, 73, 85, 95, 53, 32, 9, 69,
228, 155, 245, 33, 73, 50, 232, 23,
171, 249, 2, 37, 40, 130, 42, 198,
129, 47, 56, 201, 248, 113, 141, 139,
224, 88, 56, 84, 195, 35, 92, 92,
23, 8, 222, 177, 89, 92, 28, 132,
129, 5, 73, 10, 152, 189, 25, 152,
213, 208, 203, 144, 92, 147, 153, 92,
75, 64, 217, 172, 248, 198, 9, 248,
128, 95, 184, 199, 12, 84, 202, 10,
92, 65, 7, 24, 192, 12, 56, 65,
5, 32, 202, 210, 85, 200, 88, 56,
144, 143, 108, 135, 95, 113, 87, 62,
141, 206, 230, 136, 74, 102, 229, 162,
93, 168, 4, 227, 117, 1, 27, 244,
162, 106, 245, 25, 31, 88, 137, 32,
232, 193, 42, 208, 2, 159, 157, 99,
103, 117, 150, 70, 116, 214, 96, 0,
135, 112, 204, 160, 55, 153, 75, 221,
49, 143, 20, 60, 66, 250, 204, 150,
30, 148, 12, 173, 120, 12, 59, 154,
134, 102, 165, 84, 107, 241, 193, 124,
57, 199, 124, 36, 79, 223, 101, 16,
176, 241, 9, 13, 200, 73, 113, 253,
90, 253, 92, 1, 37, 104, 194, 69,
212, 203, 188, 96, 135, 30, 236, 134,
150, 236, 69, 97, 224, 201, 172, 144,
1, 13, 88, 8, 168, 84, 227, 3,
165, 35, 2, 25, 29, 123, 164, 132,
109, 232, 29, 253, 128, 196, 21, 28,
254, 212, 35, 104, 12, 37, 252, 164,
181, 197, 65, 72, 16, 130, 32, 172,
129, 108, 248, 2, 75, 141, 72, 52,
128, 84, 245, 144, 29, 147, 228, 94,
48, 24, 195, 183, 177, 205, 42, 188,
218, 26, 248, 0, 146, 61, 74, 11,
144, 91, 58, 228, 3, 63, 240, 67,
62, 168, 155, 209, 176, 8, 141, 48,
81, 140, 176, 72, 241, 177, 3, 51,
172, 129, 132, 132, 65, 131, 201, 66,
245, 101, 131, 40, 134, 131, 92, 202,
2, 44, 158, 67, 48, 208, 198, 36,
108, 155, 38, 92, 139, 34, 172, 129,
44, 188, 136, 244, 73, 196, 55, 136,
216, 136, 112, 66, 107, 96, 65, 172,
41, 155, 230, 49, 78, 238, 52, 140,
32, 189, 133, 38, 145, 227, 208, 189,
7, 33, 221, 196, 75, 20, 18, 36,
53, 6, 76, 240, 78, 76, 84, 138,
15, 92, 1, 165, 20, 224, 9, 132,
78, 63, 181, 192, 120, 117, 142, 207,
169, 135, 2, 230, 218, 38, 53, 160,
4, 209, 132, 230, 65, 72, 203, 192,
4, 158, 228, 69, 107, 228, 203, 197,
69, 22, 130, 204, 211, 105, 136, 15,
177, 108, 6, 47, 9, 154, 111, 248,
99, 99, 205, 143, 18, 218, 198, 184,
136, 139, 66, 96, 9, 246, 176, 2,
69, 61, 2, 43, 52, 147, 182, 8,
231, 235, 153, 204, 158, 141, 194, 202,
164, 132, 121, 253, 22, 72, 96, 68,
57, 53, 82, 120, 98, 94, 166, 254,
20, 135, 187, 36, 20, 39, 100, 135,
20, 30, 72, 127, 168, 76, 115, 113,
94, 7, 133, 65, 169, 56, 65, 158,
41, 193, 89, 16, 138, 164, 76, 224,
121, 216, 5, 175, 29, 18, 120, 169,
69, 111, 29, 135, 56, 193, 9, 22,
60, 194, 60, 1, 129, 159, 21, 144,
102, 37, 7, 178, 113, 4, 68, 57,
9, 136, 172, 141, 137, 224, 222, 67,
176, 29, 238, 229, 130, 134, 110, 168,
44, 36, 68, 23, 28, 133, 38, 129,
197, 119, 172, 64, 140, 193, 17, 88,
134, 165, 88, 94, 226, 18, 93, 216,
209, 168, 200, 55, 40, 194, 156, 176,
129, 218, 216, 35, 45, 124, 3, 191,
101, 3, 182, 152, 216, 68, 36, 3,
104, 60, 31, 51, 80, 19, 43, 16,
66, 23, 56, 85, 38, 86, 213, 44,
66, 92, 56, 176, 66, 177, 140, 38,
250, 21, 83, 238, 148, 4, 102, 174,
149, 120, 160, 133, 253, 129, 149, 126,
22, 82, 41, 189, 132, 168, 56, 129,
191, 52, 18, 5, 85, 138, 124, 84,
10, 17, 208, 128, 85, 156, 128, 81,
84, 72, 11, 244, 8, 39, 61, 64,
73, 236, 220, 3, 189, 28, 155, 174,
192, 230, 84, 200, 120, 209, 196, 70,
202, 201, 60, 49, 82, 59, 93, 134,
198, 40, 66, 179, 177, 129, 25, 249,
207, 42, 172, 2, 119, 22, 70, 251,
4, 164, 215, 245, 6, 161, 53, 12,
125, 144, 139, 163, 226, 6, 254, 167,
241, 129, 134, 222, 34, 37, 228, 194,
183, 240, 129, 137, 88, 134, 126, 232,
65, 23, 156, 207, 173, 24, 209, 42,
84, 71, 65, 73, 12, 7, 121, 169,
119, 22, 84, 71, 10, 232, 168, 2,
129, 19, 40, 130, 29, 196, 1, 190,
176, 198, 175, 104, 150, 20, 136, 214,
0, 233, 134, 19, 240, 145, 20, 100,
204, 102, 186, 76, 6, 24, 157, 53,
194, 73, 88, 121, 10, 156, 248, 227,
111, 9, 135, 159, 164, 214, 114, 241,
11, 39, 220, 11, 31, 172, 167, 228,
176, 129, 75, 242, 203, 40, 32, 81,
53, 84, 67, 83, 10, 8, 181, 224,
158, 44, 116, 235, 160, 50, 71, 16,
182, 16, 25, 228, 42, 101, 10, 221,
3, 184, 7, 22, 144, 194, 43, 134,
195, 18, 161, 40, 63, 200, 20, 19,
185, 91, 210, 252, 212, 40, 200, 137,
30, 32, 17, 141, 18, 102, 45, 134,
143, 137, 209, 81, 48, 228, 66, 151,
84, 67, 180, 200, 75, 167, 210, 165,
244, 145, 31, 248, 145, 159, 47, 232,
141, 19, 196, 213, 113, 222, 25, 22,
148, 146, 73, 176, 199, 89, 172, 230,
63, 185, 199, 145, 65, 217, 32, 81,
222, 100, 158, 0, 178, 237, 69, 37,
173, 128, 156, 80, 74, 2, 176, 202,
95, 37, 199, 233, 76, 80, 4, 178,
78, 232, 140, 18, 24, 6, 76, 193,
156, 142, 95, 89, 133, 120, 124, 215,
192, 84, 8, 90, 144, 254, 129, 144,
18, 1, 33, 80, 83, 178, 148, 30,
99, 242, 129, 44, 76, 66, 108, 17,
106, 59, 174, 194, 208, 234, 133, 54,
29, 39, 94, 36, 161, 18, 178, 10,
74, 236, 6, 215, 41, 193, 98, 40,
167, 162, 41, 66, 46, 92, 37, 25,
40, 212, 108, 52, 72, 148, 16, 200,
35, 100, 204, 104, 240, 1, 173, 60,
171, 29, 224, 197, 170, 14, 199, 168,
149, 167, 120, 98, 132, 132, 240, 9,
171, 98, 158, 131, 150, 222, 73, 126,
207, 249, 249, 169, 54, 93, 161, 110,
176, 80, 117, 248, 206, 36, 12, 144,
32, 37, 208, 203, 252, 106, 169, 57,
205, 91, 140, 151, 229, 93, 94, 6,
145, 83, 79, 194, 221, 21, 8, 194,
127, 56, 129, 74, 77, 194, 125, 76,
28, 1, 133, 65, 84, 245, 97, 50,
24, 3, 45, 216, 139, 38, 176, 130,
247, 117, 171, 137, 24, 196, 42, 18,
130, 29, 180, 99, 47, 74, 129, 47,
13, 146, 73, 216, 193, 42, 112, 2,
94, 186, 77, 187, 134, 229, 133, 177,
67, 68, 88, 152, 76, 165, 37, 21,
249, 0, 33, 252, 144, 137, 208, 2,
97, 46, 223, 235, 214, 40, 69, 64,
28, 207, 4, 81, 144, 86, 11, 11,
133, 226, 193, 146, 95, 44, 158, 216,
45, 214, 42, 101, 40, 1, 13, 80,
198, 21, 176, 135, 167, 164, 225, 77,
29, 217, 118, 96, 236, 253, 21, 18,
199, 198, 132, 162, 254, 244, 153, 120,
178, 202, 71, 120, 69, 5, 0, 193,
227, 9, 0, 31, 149, 135, 201, 129,
202, 143, 68, 208, 233, 140, 87, 134,
12, 29, 143, 196, 239, 120, 57, 74,
254, 158, 0, 17, 76, 19, 226, 57,
215, 108, 112, 225, 199, 192, 161, 92,
130, 12, 145, 136, 144, 126, 112, 231,
161, 82, 140, 124, 232, 198, 109, 8,
7, 239, 72, 14, 112, 36, 33, 55,
53, 45, 94, 16, 194, 15, 206, 214,
255, 240, 1, 22, 216, 193, 255, 80,
70, 74, 49, 142, 81, 114, 106, 10,
53, 7, 185, 204, 135, 156, 108, 228,
64, 101, 100, 226, 232, 9, 156, 44,
110, 57, 169, 167, 32, 196, 218, 42,
158, 204, 246, 105, 132, 34, 0, 208,
44, 221, 34, 179, 62, 130, 18, 236,
201, 74, 128, 161, 119, 197, 213, 112,
220, 148, 127, 214, 206, 125, 216, 15,
114, 208, 203, 40, 252, 37, 108, 148,
158, 19, 212, 202, 189, 120, 93, 223,
136, 157, 65, 24, 4, 31, 186, 13,
69, 84, 67, 50, 32, 147, 129, 104,
137, 34, 20, 132, 144, 216, 99, 116,
225, 217, 241, 180, 23, 15, 194, 46,
128, 57, 201, 18, 177, 72, 16, 53,
220, 55, 172, 40, 19, 33, 95, 52,
80, 215, 36, 100, 67, 52, 152, 8,
152, 136, 98, 53, 48, 71, 46, 28,
38, 220, 112, 13, 207, 224, 40, 33,
40, 66, 28, 196, 129, 32, 48, 3,
23, 241, 91, 254, 152, 24, 102, 54,
144, 2, 79, 196, 26, 31, 116, 129,
14, 156, 160, 47, 74, 108, 33, 65,
233, 197, 130, 21, 145, 109, 172, 198,
66, 233, 10, 144, 129, 102, 169, 197,
70, 242, 145, 14, 244, 200, 93, 80,
5, 165, 232, 14, 143, 180, 217, 12,
140, 87, 11, 160, 5, 1, 150, 69,
247, 182, 68, 253, 137, 23, 231, 12,
204, 253, 149, 70, 46, 118, 80, 108,
232, 5, 125, 34, 139, 199, 240, 1,
178, 133, 140, 102, 229, 22, 125, 150,
139, 50, 187, 11, 169, 198, 156, 109,
148, 215, 4, 111, 80, 56, 221, 6,
33, 228, 32, 127, 44, 19, 209, 130,
207, 108, 196, 193, 42, 144, 2, 27,
164, 22, 150, 28, 104, 248, 208, 198,
252, 228, 164, 196, 232, 6, 51, 43,
110, 156, 208, 199, 170, 36, 7, 17,
64, 218, 35, 228, 11, 15, 110, 85,
9, 218, 103, 24, 79, 153, 217, 28,
155, 21, 42, 130, 18, 224, 132, 155,
33, 204, 3, 52, 227, 111, 184, 9,
158, 232, 68, 185, 220, 135, 56, 185,
51, 125, 212, 139, 180, 186, 22, 107,
68, 241, 233, 158, 140, 95, 172, 64,
150, 101, 78, 23, 196, 129, 29, 40,
84, 52, 176, 67, 210, 4, 95, 220,
112, 177, 72, 85, 3, 207, 72, 4,
215, 36, 152, 38, 184, 88, 26, 133,
113, 72, 134, 164, 71, 133, 205, 191,
2, 216, 55, 88, 34, 140, 208, 238,
76, 197, 254, 67, 56, 176, 151, 38,
100, 3, 51, 232, 241, 139, 136, 9,
138, 141, 66, 46, 200, 17, 35, 11,
50, 45, 44, 149, 0, 73, 13, 146,
40, 95, 85, 33, 44, 136, 180, 197,
184, 138, 196, 30, 9, 11, 25, 176,
68, 46, 59, 89, 46, 199, 204, 175,
222, 108, 85, 155, 92, 33, 193, 197,
100, 108, 196, 21, 80, 111, 72, 104,
71, 2, 36, 7, 89, 104, 210, 9,
224, 103, 86, 47, 30, 77, 212, 4,
205, 12, 202, 224, 184, 196, 246, 114,
78, 126, 186, 132, 239, 208, 70, 123,
149, 222, 175, 196, 193, 26, 16, 134,
131, 200, 97, 67, 29, 36, 147, 140,
2, 99, 50, 103, 187, 112, 83, 186,
32, 43, 120, 208, 135, 215, 201, 79,
216, 221, 7, 9, 209, 2, 239, 73,
97, 210, 130, 143, 248, 112, 51, 36,
79, 203, 126, 132, 193, 36, 188, 238,
166, 201, 207, 186, 52, 237, 221, 133,
150, 112, 29, 14, 113, 249, 9, 65,
113, 118, 221, 172, 193, 35, 156, 164,
98, 56, 163, 94, 76, 214, 196, 197,
218, 247, 52, 172, 32, 145, 196, 143,
156, 71, 5, 168, 133, 110, 192, 4,
98, 1, 133, 196, 152, 51, 51, 235,
6, 25, 48, 135, 30, 112, 143, 67,
73, 65, 129, 16, 130, 20, 144, 76,
195, 190, 51, 35, 157, 204, 35, 24,
67, 28, 203, 84, 88, 98, 152, 138,
84, 34, 191, 37, 137, 90, 46, 159,
128, 254, 165, 19, 234, 13, 34, 210,
94, 104, 46, 120, 72, 186, 229, 238,
137, 162, 168, 140, 164, 195, 40, 76,
203, 234, 17, 170, 47, 0, 114, 249,
17, 73, 80, 95, 13, 35, 131, 8,
65, 144, 2, 7, 175, 65, 46, 28,
137, 82, 147, 244, 136, 76, 40, 43,
12, 79, 255, 48, 142, 161, 216, 129,
91, 58, 217, 175, 38, 163, 209, 125,
206, 163, 128, 28, 198, 50, 153, 247,
178, 71, 205, 96, 65, 47, 242, 31,
25, 52, 146, 72, 104, 210, 74, 148,
71, 88, 220, 144, 106, 206, 132, 93,
72, 202, 73, 116, 135, 92, 15, 142,
226, 36, 214, 118, 216, 50, 138, 219,
1, 43, 196, 51, 247, 252, 7, 14,
117, 97, 24, 144, 2, 45, 156, 208,
216, 65, 178, 30, 128, 46, 69, 245,
138, 175, 244, 6, 144, 251, 6, 2,
173, 0, 31, 1, 185, 18, 202, 79,
215, 57, 193, 25, 113, 2, 33, 112,
225, 36, 196, 115, 173, 220, 161, 206,
18, 130, 0, 29, 50, 227, 28, 178,
247, 72, 115, 169, 221, 207, 110, 128,
150, 27, 130, 90, 157, 188, 109, 11,
3, 14, 22, 232, 15, 117, 153, 141,
117, 12, 33, 31, 96, 151, 32, 108,
79, 23, 60, 57, 25, 92, 1, 33,
188, 218, 15, 231, 196, 9, 140, 206,
121, 116, 64, 150, 249, 6, 76, 184,
71, 195, 208, 128, 82, 72, 173, 3,
51, 39, 162, 237, 153, 38, 176, 134,
254, 114, 241, 132, 131, 100, 76, 240,
140, 169, 70, 168, 110, 24, 200, 66,
241, 193, 43, 90, 26, 95, 89, 78,
159, 127, 75, 216, 28, 181, 8, 147,
51, 139, 132, 94, 235, 44, 26, 205,
76, 113, 116, 122, 163, 104, 19, 177,
72, 46, 228, 135, 16, 17, 234, 31,
67, 28, 137, 121, 148, 80, 43, 95,
248, 17, 68, 236, 69, 7, 43, 216,
168, 40, 78, 223, 68, 76, 31, 136,
100, 3, 45, 100, 6, 16, 212, 10,
22, 244, 142, 144, 30, 174, 120, 17,
153, 147, 69, 32, 147, 193, 76, 178,
111, 236, 32, 141, 64, 239, 164, 145,
86, 177, 65, 196, 2, 7, 88, 52,
138, 152, 5, 180, 117, 20, 35, 229,
217, 5, 168, 45, 30, 150, 206, 9,
248, 166, 5, 70, 220, 207, 90, 4,
41, 158, 9, 130, 189, 92, 193, 247,
168, 143, 235, 174, 130, 52, 117, 104,
108, 32, 237, 131, 248, 248, 105, 117,
93, 99, 31, 87, 161, 136, 54, 190,
243, 214, 109, 56, 129, 193, 189, 134,
30, 184, 70, 20, 15, 124, 159, 114,
112, 23, 16, 130, 9, 114, 207, 52,
225, 205, 229, 149, 187, 111, 9, 199,
157, 68, 230, 86, 184, 73, 138, 163,
54, 168, 41, 129, 60, 162, 86, 47,
242, 134, 68, 142, 43, 31, 0, 222,
81, 181, 80, 158, 61, 2, 130, 150,
154, 81, 8, 150, 133, 56, 69, 30,
205, 14, 148, 69, 206, 42, 49, 254,
15, 176, 24, 182, 216, 97, 101, 217,
114, 85, 59, 210, 6, 22, 148, 74,
223, 240, 14, 22, 248, 2, 133, 81,
122, 118, 99, 24, 71, 139, 34, 136,
108, 241, 135, 28, 102, 56, 236, 94,
31, 238, 250, 209, 148, 122, 88, 218,
136, 187, 154, 250, 88, 166, 131, 69,
144, 2, 27, 17, 137, 47, 128, 95,
196, 17, 73, 48, 204, 34, 119, 23,
239, 55, 16, 132, 82, 26, 195, 124,
1, 178, 216, 187, 8, 29, 1, 156,
47, 196, 65, 23, 244, 15, 181, 79,
123, 23, 212, 114, 131, 87, 245, 63,
105, 200, 118, 184, 142, 197, 98, 108,
252, 137, 151, 114, 36, 70, 250, 37,
29, 70, 204, 5, 16, 128, 14, 49,
98, 74, 93, 100, 192, 77, 217, 132,
183, 231, 78, 203, 148, 68, 238, 228,
73, 228, 204, 73, 151, 13, 135, 3,
27, 92, 98, 40, 129, 40, 31, 119,
97, 24, 94, 24, 76, 178, 94, 164,
17, 106, 152, 141, 34, 52, 147, 48,
29, 143, 111, 0, 228, 96, 200, 73,
41, 29, 199, 114, 90, 176, 50, 47,
5, 234, 137, 160, 102, 111, 79, 129,
196, 51, 171, 125, 203, 21, 184, 209,
113, 203, 6, 12, 153, 151, 6, 69,
176, 253, 196, 71, 57, 17, 84, 66,
107, 121, 114, 104, 75, 116, 241, 139,
34, 156, 164, 29, 50, 55, 27, 40,
66, 147, 103, 33, 7, 239, 170, 9,
249, 150, 155, 116, 14, 89, 254, 92,
72, 90, 36, 5, 65, 231, 14, 65,
213, 29, 66, 135, 246, 5, 135, 173,
99, 144, 198, 21, 152, 70, 98, 8,
2, 0, 101, 4, 226, 77, 71, 46,
172, 219, 89, 230, 3, 59, 24, 152,
141, 70, 68, 209, 216, 8, 191, 93,
171, 79, 177, 200, 137, 229, 12, 64,
156, 139, 199, 46, 222, 189, 124, 252,
14, 242, 67, 152, 47, 94, 60, 133,
15, 17, 222, 187, 55, 48, 154, 160,
85, 213, 140, 141, 26, 149, 43, 220,
185, 112, 223, 124, 145, 34, 229, 43,
219, 185, 116, 39, 211, 121, 12, 23,
46, 23, 33, 146, 209, 38, 113, 250,
150, 82, 101, 182, 111, 231, 60, 158,
251, 246, 141, 25, 31, 37, 64, 164,
72, 113, 2, 68, 73, 151, 46, 43,
70, 116, 24, 49, 34, 67, 133, 12,
29, 148, 38, 205, 32, 33, 67, 85,
9, 21, 42, 64, 61, 113, 66, 105,
215, 164, 18, 124, 196, 33, 163, 196,
199, 154, 56, 78, 136, 144, 9, 147,
129, 6, 144, 4, 2, 4, 24, 80,
218, 162, 69, 135, 7, 21, 78, 172,
56, 193, 180, 5, 13, 29, 51, 232,
210, 165, 33, 216, 175, 15, 192, 64,
254, 182, 152, 161, 195, 135, 15, 32,
138, 4, 93, 9, 74, 73, 211, 36,
44, 88, 8, 17, 146, 18, 135, 19,
33, 62, 97, 52, 173, 154, 20, 70,
145, 44, 89, 148, 176, 8, 117, 226,
68, 73, 107, 34, 68, 254, 137, 196,
110, 237, 131, 198, 138, 21, 45, 124,
196, 214, 173, 68, 183, 236, 214, 173,
201, 144, 146, 165, 105, 141, 158, 85,
163, 226, 132, 225, 68, 42, 178, 34,
209, 93, 236, 140, 34, 78, 70, 19,
169, 73, 63, 129, 56, 6, 146, 29,
49, 227, 198, 62, 116, 48, 166, 49,
62, 60, 248, 240, 229, 193, 55, 246,
75, 195, 142, 162, 48, 97, 124, 132,
185, 130, 133, 70, 23, 44, 97, 116,
132, 89, 179, 198, 201, 126, 50, 68,
176, 136, 131, 15, 61, 104, 163, 1,
176, 14, 224, 18, 64, 130, 7, 86,
152, 193, 49, 192, 90, 200, 139, 134,
198, 96, 147, 2, 59, 237, 182, 83,
130, 16, 89, 56, 177, 79, 147, 81,
194, 192, 226, 67, 249, 52, 225, 36,
12, 37, 236, 176, 35, 187, 48, 72,
9, 39, 29, 118, 216, 49, 40, 158,
157, 84, 98, 231, 164, 130, 36, 202,
113, 162, 134, 14, 186, 7, 198, 115,
178, 9, 135, 32, 130, 18, 74, 72,
33, 137, 32, 82, 40, 31, 134, 38,
202, 134, 18, 89, 170, 9, 70, 163,
96, 58, 2, 50, 23, 82, 88, 241,
229, 38, 148, 104, 90, 137, 22, 151,
178, 169, 70, 22, 90, 132, 236, 210,
38, 23, 113, 250, 168, 26, 69, 120,
99, 35, 14, 178, 214, 176, 227, 10,
169, 50, 144, 74, 2, 170, 170, 106,
234, 1, 168, 58, 104, 170, 206, 164,
246, 210, 106, 47, 254, 190, 130, 250,
75, 9, 39, 116, 160, 129, 8, 37,
30, 104, 236, 45, 1, 18, 128, 170,
133, 58, 167, 58, 161, 133, 17, 42,
120, 96, 4, 219, 150, 186, 109, 4,
186, 110, 203, 205, 64, 198, 94, 27,
108, 49, 199, 244, 80, 196, 14, 54,
68, 164, 133, 146, 43, 214, 224, 68,
147, 251, 4, 225, 132, 18, 54, 8,
97, 133, 185, 232, 104, 65, 78, 178,
160, 130, 90, 205, 9, 213, 86, 187,
130, 136, 68, 103, 152, 1, 8, 34,
134, 109, 118, 209, 69, 121, 147, 141,
136, 46, 72, 161, 100, 18, 54, 214,
120, 68, 145, 56, 164, 208, 131, 15,
59, 136, 136, 147, 15, 39, 186, 48,
43, 53, 50, 244, 184, 142, 182, 68,
253, 154, 193, 192, 100, 207, 91, 15,
48, 119, 145, 77, 214, 222, 245, 198,
27, 79, 15, 82, 30, 25, 75, 145,
73, 200, 208, 129, 15, 77, 248, 240,
65, 15, 74, 4, 33, 34, 14, 132,
149, 8, 131, 178, 56, 178, 75, 84,
135, 21, 36, 136, 11, 171, 190, 28,
27, 108, 171, 19, 28, 139, 109, 53,
161, 126, 11, 249, 10, 74, 86, 121,
149, 186, 87, 187, 160, 132, 146, 48,
186, 152, 68, 147, 48, 164, 96, 131,
141, 214, 90, 14, 242, 28, 130, 94,
76, 39, 158, 124, 114, 196, 81, 199,
37, 13, 146, 168, 72, 134, 26, 106,
104, 34, 118, 150, 52, 146, 231, 123,
146, 84, 82, 254, 162, 120, 206, 97,
37, 151, 106, 124, 89, 206, 24, 156,
116, 202, 101, 21, 82, 130, 249, 198,
69, 148, 210, 12, 71, 22, 66, 114,
201, 38, 25, 174, 171, 57, 201, 163,
157, 130, 76, 233, 163, 111, 178, 209,
132, 136, 22, 194, 179, 205, 192, 14,
156, 234, 10, 170, 10, 168, 234, 128,
43, 188, 235, 236, 19, 43, 168, 158,
162, 115, 4, 174, 36, 136, 42, 47,
189, 2, 107, 161, 2, 32, 86, 128,
107, 193, 187, 78, 144, 32, 175, 7,
158, 18, 124, 239, 169, 238, 170, 32,
169, 195, 3, 203, 203, 193, 218, 86,
72, 180, 177, 110, 21, 225, 68, 102,
126, 187, 32, 131, 147, 81, 62, 91,
3, 75, 69, 216, 88, 142, 147, 56,
30, 9, 237, 17, 44, 126, 149, 108,
88, 144, 91, 91, 141, 8, 26, 208,
90, 161, 227, 67, 163, 149, 182, 183,
105, 71, 17, 132, 143, 46, 112, 229,
131, 12, 44, 20, 81, 213, 9, 65,
30, 33, 68, 137, 116, 21, 185, 130,
12, 74, 108, 29, 126, 60, 119, 233,
154, 225, 182, 197, 240, 13, 140, 222,
119, 231, 117, 55, 223, 194, 162, 67,
77, 10, 69, 40, 233, 2, 8, 62,
110, 37, 2, 127, 112, 237, 152, 132,
143, 112, 39, 49, 137, 46, 200, 166,
49, 43, 200, 0, 92, 18, 240, 0,
186, 49, 102, 6, 150, 106, 65, 233,
22, 53, 172, 144, 189, 102, 59, 219,
185, 2, 254, 237, 216, 64, 132, 43,
180, 14, 8, 78, 184, 66, 24, 136,
32, 5, 163, 144, 101, 81, 64, 193,
130, 30, 146, 225, 53, 147, 232, 76,
104, 64, 211, 145, 65, 134, 166, 36,
37, 1, 45, 105, 18, 73, 73, 140,
140, 228, 35, 131, 52, 237, 105, 233,
8, 70, 48, 170, 145, 11, 78, 112,
34, 24, 38, 209, 9, 45, 74, 164,
37, 156, 128, 109, 109, 99, 163, 69,
54, 130, 65, 136, 71, 248, 226, 102,
42, 249, 70, 53, 170, 20, 142, 106,
100, 35, 27, 164, 80, 130, 94, 20,
135, 183, 7, 220, 197, 111, 75, 1,
156, 222, 174, 2, 56, 167, 84, 5,
43, 109, 204, 74, 159, 18, 184, 198,
197, 221, 134, 46, 29, 0, 194, 1,
5, 144, 129, 7, 24, 64, 83, 89,
105, 193, 24, 145, 242, 128, 196, 233,
81, 144, 6, 72, 160, 32, 15, 119,
56, 32, 212, 166, 5, 74, 152, 84,
233, 180, 115, 5, 61, 132, 225, 51,
208, 105, 157, 20, 86, 5, 194, 48,
216, 65, 15, 108, 232, 66, 39, 249,
128, 133, 111, 85, 134, 119, 192, 146,
140, 239, 126, 195, 26, 240, 140, 175,
99, 203, 138, 205, 178, 42, 184, 157,
215, 0, 104, 21, 72, 196, 130, 29,
116, 69, 6, 50, 140, 98, 21, 122,
184, 194, 36, 88, 161, 61, 62, 240,
171, 63, 163, 32, 133, 30, 120, 147,
157, 198, 148, 71, 150, 179, 84, 230,
119, 254, 182, 179, 202, 241, 217, 75,
49, 227, 145, 194, 35, 40, 177, 59,
204, 40, 98, 128, 122, 16, 196, 26,
128, 32, 160, 53, 248, 128, 12, 50,
243, 1, 22, 200, 64, 136, 46, 144,
231, 47, 118, 137, 11, 92, 78, 64,
175, 8, 25, 104, 5, 19, 90, 86,
242, 42, 248, 29, 31, 140, 108, 91,
62, 192, 149, 30, 128, 64, 6, 69,
252, 47, 157, 108, 200, 205, 26, 64,
120, 5, 1, 149, 173, 36, 5, 161,
97, 68, 130, 6, 195, 166, 37, 41,
105, 21, 157, 136, 219, 110, 86, 164,
24, 241, 240, 162, 204, 8, 70, 52,
132, 56, 10, 99, 84, 233, 27, 72,
228, 4, 73, 182, 132, 53, 156, 124,
35, 23, 138, 160, 5, 213, 86, 69,
11, 172, 173, 228, 27, 209, 232, 72,
58, 194, 193, 197, 108, 208, 194, 9,
96, 164, 84, 7, 22, 132, 149, 12,
236, 37, 79, 110, 172, 0, 31, 211,
184, 21, 193, 93, 133, 141, 126, 74,
64, 2, 242, 246, 148, 6, 149, 15,
55, 9, 48, 0, 31, 249, 182, 167,
196, 205, 96, 42, 116, 145, 64, 2,
170, 178, 199, 59, 221, 201, 0, 137,
83, 74, 131, 244, 50, 131, 185, 141,
192, 65, 185, 9, 97, 28, 4, 193,
77, 20, 93, 11, 54, 88, 80, 66,
105, 86, 145, 34, 211, 244, 235, 164,
185, 16, 196, 199, 84, 131, 188, 103,
29, 106, 40, 140, 84, 20, 180, 132,
254, 21, 50, 222, 184, 6, 69, 99,
122, 196, 5, 89, 161, 9, 232, 28,
39, 57, 156, 232, 229, 53, 71, 65,
8, 39, 240, 97, 57, 108, 136, 38,
187, 252, 114, 30, 198, 128, 150, 158,
231, 139, 208, 166, 6, 181, 49, 209,
205, 207, 40, 62, 80, 2, 239, 114,
99, 159, 159, 168, 69, 10, 58, 208,
37, 125, 200, 16, 7, 69, 208, 103,
94, 151, 122, 20, 92, 50, 208, 23,
26, 108, 5, 48, 241, 44, 204, 179,
186, 243, 62, 69, 241, 65, 17, 107,
208, 129, 36, 3, 230, 4, 59, 4,
12, 64, 68, 248, 84, 108, 218, 34,
5, 44, 144, 130, 25, 209, 96, 97,
210, 156, 86, 209, 137, 142, 55, 73,
66, 27, 136, 78, 58, 114, 16, 134,
24, 201, 105, 62, 194, 8, 51, 104,
241, 186, 100, 84, 169, 26, 214, 209,
132, 150, 110, 74, 147, 181, 209, 66,
17, 172, 8, 34, 115, 139, 152, 19,
53, 205, 36, 31, 56, 133, 155, 49,
200, 64, 23, 51, 54, 133, 169, 66,
197, 27, 86, 174, 114, 149, 10, 88,
53, 1, 120, 114, 10, 223, 214, 152,
39, 171, 244, 237, 111, 126, 43, 95,
162, 14, 103, 128, 166, 60, 149, 111,
150, 203, 0, 88, 79, 176, 71, 61,
149, 53, 83, 109, 124, 202, 9, 38,
182, 56, 197, 40, 198, 173, 139, 226,
67, 175, 164, 224, 58, 74, 144, 65,
132, 205, 162, 68, 48, 88, 193, 254,
6, 65, 248, 194, 175, 113, 96, 69,
48, 72, 113, 34, 193, 250, 230, 149,
17, 84, 194, 95, 220, 133, 88, 193,
194, 50, 150, 142, 33, 68, 243, 236,
128, 162, 1, 53, 44, 14, 118, 184,
76, 28, 60, 9, 4, 132, 226, 167,
11, 164, 97, 195, 52, 31, 216, 56,
3, 25, 104, 198, 17, 218, 138, 94,
2, 149, 20, 191, 241, 233, 112, 43,
32, 66, 0, 245, 64, 131, 48, 60,
66, 16, 62, 112, 2, 33, 20, 129,
22, 236, 97, 65, 7, 169, 234, 194,
12, 178, 149, 48, 197, 237, 229, 183,
2, 192, 75, 94, 134, 122, 183, 79,
97, 108, 59, 249, 2, 140, 109, 62,
140, 230, 242, 93, 186, 46, 89, 153,
151, 14, 136, 162, 9, 102, 8, 169,
162, 22, 85, 47, 123, 201, 59, 209,
26, 78, 196, 71, 38, 97, 218, 68,
40, 186, 36, 118, 132, 131, 25, 204,
24, 142, 72, 111, 114, 142, 106, 140,
2, 124, 93, 203, 175, 74, 86, 226,
139, 73, 64, 201, 24, 171, 240, 5,
22, 129, 125, 197, 45, 125, 36, 76,
201, 208, 67, 113, 165, 210, 198, 10,
83, 101, 41, 77, 37, 92, 2, 37,
220, 148, 11, 187, 184, 112, 103, 132,
138, 25, 59, 192, 56, 200, 5, 238,
39, 151, 122, 74, 226, 172, 42, 129,
25, 32, 104, 140, 20, 134, 176, 83,
58, 133, 233, 219, 248, 69, 49, 58,
120, 86, 203, 242, 26, 206, 254, 20,
133, 104, 122, 175, 165, 68, 181, 186,
32, 8, 202, 96, 43, 119, 156, 112,
66, 122, 152, 9, 77, 237, 172, 139,
8, 62, 160, 155, 91, 97, 169, 79,
137, 251, 128, 16, 154, 72, 142, 18,
156, 103, 208, 56, 16, 66, 15, 78,
32, 195, 36, 8, 129, 5, 39, 40,
226, 17, 206, 229, 131, 203, 194, 64,
199, 211, 110, 10, 80, 122, 241, 169,
182, 241, 196, 96, 207, 177, 81, 168,
111, 14, 3, 27, 174, 0, 227, 212,
216, 102, 88, 131, 89, 212, 112, 39,
116, 41, 186, 213, 134, 141, 73, 57,
42, 2, 227, 146, 57, 188, 184, 43,
184, 225, 121, 205, 42, 21, 147, 172,
58, 63, 48, 47, 58, 160, 122, 94,
232, 82, 57, 13, 119, 32, 234, 64,
121, 4, 51, 116, 86, 234, 82, 47,
100, 73, 169, 30, 175, 69, 119, 198,
16, 130, 200, 104, 135, 100, 103, 72,
56, 162, 145, 140, 211, 112, 98, 190,
29, 137, 134, 173, 70, 129, 95, 52,
37, 59, 24, 143, 184, 72, 53, 170,
177, 147, 44, 14, 56, 108, 92, 100,
134, 34, 204, 183, 49, 57, 175, 209,
172, 153, 203, 83, 159, 198, 152, 149,
192, 229, 13, 168, 84, 121, 227, 83,
170, 226, 55, 165, 78, 29, 8, 35,
16, 241, 10, 200, 194, 20, 9, 240,
113, 42, 83, 249, 75, 92, 160, 106,
249, 108, 127, 42, 41, 126, 1, 189,
19, 204, 71, 55, 101, 254, 194, 202,
174, 207, 205, 241, 162, 44, 164, 132,
43, 172, 106, 102, 118, 136, 67, 28,
176, 176, 134, 204, 80, 98, 40, 203,
44, 12, 122, 190, 99, 245, 245, 44,
80, 159, 241, 130, 80, 178, 250, 18,
7, 235, 116, 193, 7, 2, 103, 195,
12, 200, 240, 8, 59, 16, 79, 16,
130, 64, 12, 27, 58, 126, 2, 133,
174, 129, 6, 158, 67, 138, 159, 180,
93, 21, 112, 247, 233, 78, 131, 35,
220, 27, 233, 220, 23, 76, 71, 72,
41, 133, 75, 164, 94, 62, 7, 212,
63, 41, 37, 47, 75, 185, 176, 1,
4, 64, 144, 42, 38, 113, 136, 170,
116, 128, 206, 49, 200, 34, 49, 76,
11, 235, 72, 39, 48, 240, 111, 83,
30, 136, 41, 234, 239, 112, 28, 4,
40, 4, 161, 26, 124, 166, 237, 196,
142, 103, 202, 206, 236, 98, 205, 105,
134, 196, 70, 98, 164, 133, 86, 13,
106, 152, 161, 216, 40, 99, 164, 112,
226, 238, 62, 228, 216, 84, 72, 37,
214, 198, 23, 30, 129, 20, 2, 47,
77, 108, 16, 110, 162, 161, 109, 152,
13, 240, 56, 97, 184, 226, 173, 79,
202, 232, 253, 208, 111, 111, 238, 228,
46, 44, 47, 195, 74, 47, 115, 250,
100, 42, 60, 103, 47, 222, 172, 154,
50, 165, 42, 86, 160, 3, 42, 12,
82, 70, 224, 78, 128, 10, 55, 130,
106, 41, 2, 165, 54, 248, 15, 41,
146, 229, 4, 98, 254, 227, 129, 22,
99, 59, 116, 192, 9, 196, 162, 53,
178, 135, 12, 104, 64, 200, 128, 175,
11, 140, 137, 15, 174, 105, 21, 30,
33, 102, 52, 130, 16, 26, 206, 248,
72, 203, 125, 254, 162, 65, 16, 131,
1, 215, 172, 183, 150, 98, 83, 24,
71, 7, 120, 3, 48, 232, 237, 4,
198, 35, 66, 210, 106, 10, 167, 48,
145, 232, 36, 220, 228, 76, 2, 233,
108, 47, 108, 227, 4, 180, 45, 42,
48, 79, 243, 166, 14, 255, 222, 12,
41, 184, 208, 205, 54, 134, 255, 10,
135, 43, 18, 105, 47, 74, 108, 143,
226, 2, 0, 195, 237, 129, 42, 160,
158, 46, 165, 158, 86, 233, 249, 32,
228, 124, 222, 71, 48, 26, 7, 41,
178, 98, 99, 144, 162, 5, 178, 67,
10, 56, 225, 102, 50, 176, 236, 196,
139, 236, 200, 11, 213, 150, 166, 3,
25, 226, 69, 136, 100, 134, 196, 14,
106, 162, 33, 36, 192, 103, 190, 60,
34, 26, 70, 97, 136, 240, 203, 36,
86, 194, 138, 100, 112, 21, 162, 225,
38, 58, 34, 28, 223, 6, 240, 194,
17, 110, 0, 111, 21, 136, 96, 6,
58, 165, 46, 148, 176, 254, 52, 71,
9, 39, 103, 140, 252, 132, 112, 30,
143, 79, 234, 111, 23, 183, 130, 16,
35, 36, 0, 61, 239, 1, 48, 81,
144, 182, 2, 115, 174, 112, 4, 116,
192, 79, 228, 172, 78, 26, 40, 115,
184, 226, 54, 254, 226, 9, 48, 62,
37, 180, 102, 64, 9, 128, 111, 59,
56, 73, 10, 34, 82, 10, 174, 160,
53, 126, 207, 88, 208, 233, 10, 44,
40, 35, 147, 143, 125, 168, 169, 125,
234, 105, 40, 22, 231, 94, 102, 204,
54, 180, 2, 41, 44, 197, 54, 92,
110, 16, 15, 231, 111, 98, 242, 193,
56, 177, 43, 134, 138, 78, 230, 177,
21, 241, 143, 253, 204, 40, 38, 25,
146, 83, 152, 98, 83, 242, 4, 40,
185, 16, 235, 70, 241, 193, 218, 72,
2, 15, 199, 157, 18, 228, 157, 94,
145, 46, 34, 77, 232, 38, 132, 54,
18, 111, 94, 12, 99, 211, 194, 163,
124, 222, 197, 54, 234, 228, 234, 210,
106, 66, 236, 32, 25, 50, 48, 71,
196, 110, 33, 52, 208, 3, 249, 161,
32, 32, 66, 214, 210, 65, 104, 154,
38, 25, 103, 141, 25, 114, 65, 19,
166, 113, 37, 224, 206, 86, 238, 235,
76, 196, 145, 166, 140, 65, 17, 70,
33, 7, 193, 17, 6, 205, 241, 27,
215, 6, 240, 162, 129, 22, 164, 128,
83, 182, 34, 66, 172, 226, 241, 154,
66, 112, 176, 66, 144, 48, 12, 8,
219, 49, 115, 96, 114, 9, 191, 112,
49, 241, 72, 144, 18, 0, 19, 39,
15, 115, 78, 96, 112, 94, 76, 141,
202, 104, 235, 8, 241, 124, 84, 78,
43, 25, 3, 40, 128, 0, 84, 226,
169, 249, 70, 107, 180, 198, 67, 154,
160, 175, 254, 65, 98, 47, 205, 178,
78, 89, 124, 96, 234, 82, 210, 53,
53, 47, 31, 167, 46, 80, 30, 179,
40, 77, 145, 41, 158, 226, 64, 32,
241, 253, 224, 175, 42, 242, 226, 111,
74, 172, 18, 129, 19, 140, 66, 49,
111, 80, 75, 115, 156, 48, 42, 128,
42, 0, 31, 224, 169, 250, 102, 41,
190, 170, 41, 81, 79, 46, 136, 106,
210, 50, 96, 222, 174, 50, 20, 229,
77, 229, 26, 232, 36, 229, 137, 112,
226, 173, 65, 116, 96, 18, 194, 161,
32, 138, 134, 71, 56, 80, 236, 200,
18, 188, 30, 162, 3, 17, 194, 44,
153, 198, 105, 114, 170, 45, 121, 134,
62, 117, 198, 104, 60, 2, 190, 40,
131, 19, 70, 109, 37, 152, 193, 86,
78, 74, 47, 237, 114, 109, 250, 110,
20, 152, 193, 102, 128, 141, 217, 162,
1, 48, 119, 194, 48, 125, 225, 40,
184, 208, 93, 66, 179, 253, 190, 138,
82, 150, 243, 78, 208, 111, 235, 54,
81, 42, 192, 109, 18, 159, 240, 1,
128, 75, 143, 70, 239, 169, 34, 239,
112, 168, 130, 110, 208, 143, 111, 138,
138, 9, 153, 19, 211, 26, 168, 158,
160, 79, 184, 66, 104, 98, 232, 175,
158, 216, 165, 72, 215, 163, 72, 161,
172, 125, 82, 146, 124, 198, 3, 62,
105, 192, 195, 126, 148, 184, 136, 202,
43, 6, 49, 47, 232, 113, 141, 248,
111, 20, 83, 180, 30, 151, 48, 243,
236, 254, 175, 39, 43, 111, 112, 228,
140, 30, 51, 239, 115, 152, 226, 141,
22, 44, 43, 140, 211, 140, 22, 228,
169, 158, 42, 0, 211, 8, 70, 127,
235, 170, 32, 229, 38, 19, 71, 49,
154, 179, 158, 6, 195, 229, 126, 210,
54, 46, 205, 124, 64, 71, 184, 12,
67, 244, 240, 230, 55, 171, 239, 27,
26, 2, 70, 96, 4, 71, 202, 114,
105, 96, 104, 236, 100, 232, 212, 120,
38, 236, 128, 38, 30, 178, 97, 212,
6, 2, 167, 110, 230, 71, 210, 36,
25, 114, 193, 101, 184, 203, 107, 120,
66, 19, 146, 200, 38, 118, 194, 107,
222, 230, 27, 130, 33, 117, 152, 1,
85, 97, 112, 7, 191, 145, 109, 194,
36, 26, 140, 33, 14, 214, 115, 38,
43, 71, 0, 183, 206, 18, 81, 177,
169, 182, 206, 30, 39, 17, 88, 171,
148, 46, 12, 169, 194, 8, 201, 209,
244, 168, 116, 16, 167, 60, 105, 32,
70, 239, 98, 42, 226, 8, 195, 176,
98, 80, 88, 206, 54, 239, 69, 247,
118, 147, 254, 216, 10, 17, 69, 75,
98, 194, 131, 125, 200, 112, 211, 126,
52, 234, 204, 103, 49, 212, 49, 220,
84, 206, 37, 185, 162, 29, 47, 51,
112, 32, 51, 243, 250, 132, 168, 154,
106, 219, 234, 241, 20, 129, 211, 140,
218, 232, 172, 132, 19, 243, 52, 140,
141, 236, 209, 61, 199, 244, 112, 142,
202, 144, 112, 52, 43, 248, 102, 206,
254, 240, 134, 42, 86, 32, 83, 182,
115, 206, 62, 111, 10, 223, 140, 154,
20, 195, 37, 203, 136, 142, 2, 241,
47, 214, 99, 10, 149, 162, 54, 250,
175, 158, 176, 32, 24, 232, 115, 32,
198, 242, 103, 106, 104, 103, 96, 104,
135, 244, 147, 236, 46, 106, 4, 159,
38, 27, 162, 65, 32, 6, 180, 213,
78, 21, 164, 86, 225, 95, 40, 148,
166, 146, 65, 101, 242, 242, 84, 81,
245, 109, 140, 225, 17, 56, 1, 48,
195, 38, 77, 174, 232, 27, 105, 170,
104, 15, 79, 29, 65, 39, 52, 217,
111, 23, 231, 172, 33, 217, 236, 17,
41, 179, 218, 244, 134, 74, 171, 116,
142, 20, 163, 172, 160, 170, 2, 32,
37, 143, 58, 64, 46, 12, 209, 113,
112, 116, 65, 202, 74, 68, 159, 21,
51, 191, 109, 142, 200, 71, 89, 14,
197, 7, 28, 136, 43, 20, 49, 95,
68, 43, 95, 214, 37, 95, 200, 181,
125, 70, 82, 193, 204, 53, 42, 236,
133, 113, 20, 3, 80, 154, 115, 41,
141, 147, 79, 78, 84, 71, 125, 85,
168, 16, 215, 218, 14, 114, 255, 128,
74, 168, 32, 113, 93, 245, 38, 253,
40, 15, 8, 9, 167, 114, 155, 226,
170, 42, 44, 83, 18, 39, 95, 131,
114, 90, 146, 131, 53, 128, 64, 29,
51, 160, 172, 148, 74, 109, 99, 111,
39, 63, 148, 170, 232, 229, 47, 234,
198, 111, 74, 71, 20, 113, 131, 254,
226, 178, 161, 104, 20, 53, 100, 67,
118, 71, 36, 2, 70, 34, 234, 81,
37, 85, 189, 38, 194, 213, 96, 104,
70, 108, 202, 100, 207, 139, 217, 100,
65, 45, 62, 136, 16, 234, 238, 27,
114, 118, 18, 40, 1, 165, 78, 245,
104, 179, 193, 24, 38, 129, 66, 109,
226, 66, 11, 147, 25, 2, 15, 110,
92, 54, 26, 152, 129, 18, 124, 176,
9, 9, 240, 18, 157, 176, 234, 192,
35, 89, 188, 144, 106, 171, 141, 95,
41, 55, 181, 76, 241, 9, 27, 205,
41, 7, 208, 222, 86, 64, 144, 30,
0, 48, 160, 21, 219, 214, 104, 18,
151, 210, 117, 83, 51, 55, 104, 99,
49, 229, 172, 154, 66, 43, 60, 214,
231, 91, 221, 197, 125, 222, 165, 47,
236, 69, 98, 21, 241, 47, 166, 238,
210, 230, 200, 37, 225, 108, 74, 31,
211, 130, 133, 202, 49, 51, 207, 168,
4, 199, 241, 164, 245, 79, 12, 150,
218, 6, 177, 106, 141, 51, 39, 177,
147, 206, 2, 22, 168, 182, 243, 144,
158, 85, 115, 149, 110, 89, 2, 78,
138, 8, 225, 10, 176, 130, 116, 67,
179, 37, 45, 165, 129, 80, 248, 17,
177, 14, 62, 17, 120, 184, 222, 136,
205, 18, 73, 184, 148, 96, 20, 116,
6, 70, 78, 130, 32, 50, 181, 33,
82, 34, 29, 110, 66, 137, 95, 196,
104, 210, 110, 3, 43, 21, 39, 144,
230, 104, 180, 104, 62, 19, 254, 117,
109, 162, 225, 17, 212, 113, 43, 200,
192, 215, 162, 129, 21, 244, 192, 14,
110, 44, 72, 62, 194, 46, 153, 45,
103, 21, 84, 240, 212, 88, 39, 92,
54, 25, 184, 232, 138, 92, 246, 4,
31, 65, 193, 30, 18, 42, 74, 199,
124, 208, 106, 129, 44, 205, 225, 224,
150, 106, 191, 45, 96, 97, 50, 31,
159, 112, 6, 0, 48, 65, 18, 72,
0, 250, 132, 145, 137, 96, 5, 174,
138, 42, 18, 69, 141, 16, 9, 112,
30, 47, 111, 154, 147, 234, 132, 171,
129, 102, 50, 220, 214, 12, 180, 48,
246, 125, 208, 183, 47, 144, 165, 154,
70, 114, 170, 30, 184, 54, 106, 17,
79, 23, 199, 144, 47, 179, 114, 163,
194, 232, 234, 53, 114, 75, 12, 147,
235, 12, 19, 47, 140, 95, 55, 140,
79, 32, 247, 95, 225, 45, 150, 37,
176, 78, 168, 181, 218, 190, 10, 115,
73, 76, 194, 182, 118, 244, 154, 226,
4, 148, 64, 10, 16, 202, 9, 244,
68, 2, 188, 243, 83, 222, 182, 56,
223, 140, 151, 209, 55, 98, 216, 37,
41, 66, 231, 125, 109, 179, 62, 130,
1, 103, 60, 98, 81, 227, 1, 167,
104, 98, 214, 92, 118, 38, 216, 97,
137, 214, 46, 63, 95, 232, 105, 198,
217, 103, 204, 121, 139, 225, 38, 24,
214, 64, 135, 59, 224, 206, 114, 33,
24, 52, 65, 10, 218, 194, 9, 72,
1, 141, 195, 134, 166, 254, 162, 129,
84, 43, 212, 46, 105, 68, 39, 170,
129, 25, 146, 97, 123, 93, 150, 21,
40, 65, 15, 164, 192, 82, 68, 103,
48, 40, 80, 149, 105, 44, 98, 200,
163, 93, 106, 243, 50, 15, 114, 144,
85, 203, 229, 232, 162, 41, 25, 150,
145, 17, 228, 4, 18, 147, 197, 42,
160, 45, 138, 74, 30, 187, 148, 114,
99, 114, 105, 157, 244, 82, 168, 213,
184, 148, 139, 180, 44, 141, 110, 135,
167, 129, 123, 139, 12, 107, 99, 66,
116, 160, 135, 163, 142, 170, 224, 140,
56, 7, 165, 29, 33, 179, 253, 254,
100, 60, 149, 2, 71, 101, 12, 159,
231, 108, 18, 13, 210, 9, 187, 13,
133, 45, 147, 255, 206, 104, 80, 166,
208, 42, 198, 40, 219, 186, 205, 197,
228, 98, 42, 152, 2, 235, 216, 47,
220, 42, 231, 83, 206, 71, 169, 132,
185, 168, 33, 240, 225, 196, 35, 129,
47, 177, 60, 97, 210, 229, 28, 132,
15, 162, 1, 70, 210, 184, 64, 51,
213, 138, 207, 171, 26, 140, 246, 156,
201, 89, 71, 140, 70, 71, 154, 56,
70, 10, 98, 157, 79, 2, 67, 209,
241, 76, 61, 167, 5, 152, 101, 184,
26, 132, 8, 70, 1, 141, 35, 84,
37, 10, 154, 18, 0, 243, 104, 237,
210, 108, 26, 250, 84, 147, 225, 127,
22, 233, 249, 162, 46, 135, 209, 247,
120, 94, 3, 212, 210, 99, 93, 172,
142, 234, 204, 84, 254, 38, 99, 146,
23, 69, 103, 6, 86, 49, 194, 42,
6, 43, 242, 200, 7, 168, 112, 59,
25, 196, 7, 70, 204, 170, 176, 170,
30, 235, 145, 162, 55, 197, 125, 246,
53, 135, 215, 236, 93, 216, 105, 84,
228, 214, 59, 26, 184, 55, 27, 167,
47, 16, 3, 116, 154, 219, 1, 223,
12, 235, 34, 80, 253, 204, 72, 241,
186, 244, 111, 212, 239, 95, 239, 53,
79, 192, 244, 32, 155, 80, 94, 7,
57, 145, 50, 184, 187, 13, 18, 83,
96, 174, 221, 44, 143, 125, 33, 83,
0, 48, 37, 1, 174, 112, 194, 242,
175, 37, 249, 175, 83, 214, 247, 219,
232, 172, 79, 62, 5, 125, 225, 5,
84, 230, 162, 65, 134, 117, 49, 136,
128, 16, 188, 11, 142, 93, 68, 137,
183, 88, 175, 157, 56, 179, 177, 38,
137, 69, 150, 118, 235, 83, 83, 193,
102, 161, 187, 171, 214, 124, 193, 14,
166, 144, 189, 5, 73, 65, 186, 114,
6, 236, 64, 22, 26, 122, 142, 213,
184, 26, 84, 166, 85, 209, 152, 109,
204, 209, 24, 58, 123, 39, 162, 65,
17, 86, 41, 49, 246, 148, 167, 25,
67, 40, 154, 12, 54, 146, 111, 22,
35, 176, 40, 203, 27, 181, 44, 177,
124, 0, 176, 144, 18, 185, 172, 12,
64, 12, 245, 111, 65, 8, 82, 143,
34, 243, 43, 28, 76, 195, 178, 130,
33, 23, 211, 33, 213, 207, 129, 120,
154, 128, 247, 254, 16, 125, 44, 13,
250, 36, 86, 73, 129, 250, 33, 7,
99, 198, 198, 149, 124, 85, 178, 43,
58, 140, 11, 9, 87, 8, 87, 52,
31, 127, 243, 76, 149, 176, 168, 6,
167, 130, 43, 23, 19, 133, 48, 71,
29, 151, 253, 238, 164, 194, 18, 89,
0, 199, 138, 206, 190, 234, 171, 228,
251, 42, 24, 25, 188, 85, 82, 244,
158, 2, 194, 236, 17, 94, 151, 176,
191, 29, 176, 3, 204, 167, 78, 252,
145, 158, 88, 111, 184, 137, 128, 18,
114, 45, 175, 107, 183, 62, 125, 102,
214, 188, 55, 26, 182, 40, 161, 153,
17, 137, 153, 177, 156, 49, 52, 25,
130, 129, 200, 140, 129, 161, 147, 97,
18, 116, 160, 79, 248, 232, 170, 0,
176, 108, 239, 212, 207, 116, 203, 101,
62, 132, 21, 104, 161, 212, 181, 197,
24, 244, 146, 106, 56, 225, 17, 114,
103, 21, 128, 72, 84, 187, 152, 54,
10, 164, 65, 68, 50, 180, 74, 136,
202, 116, 67, 150, 184, 227, 53, 46,
173, 130, 97, 146, 11, 61, 145, 142,
224, 66, 46, 142, 78, 114, 36, 0,
8, 176, 96, 9, 177, 130, 32, 169,
208, 242, 170, 13, 9, 97, 26, 182,
7, 69, 143, 193, 156, 125, 142, 253,
125, 36, 230, 184, 239, 101, 124, 192,
60, 89, 136, 148, 6, 54, 133, 163,
31, 104, 170, 210, 245, 54, 200, 183,
74, 41, 184, 255, 128, 249, 132, 205,
20, 38, 254, 29, 111, 235, 178, 74,
154, 99, 90, 112, 199, 148, 230, 250,
149, 95, 39, 204, 0, 32, 204, 69,
145, 142, 225, 3, 231, 41, 232, 212,
98, 160, 74, 65, 42, 15, 171, 81,
177, 172, 163, 253, 165, 129, 138, 235,
90, 210, 59, 185, 174, 232, 226, 105,
52, 53, 111, 6, 156, 128, 19, 74,
2, 216, 66, 93, 100, 21, 60, 104,
226, 146, 22, 124, 33, 24, 146, 33,
7, 45, 84, 109, 140, 40, 167, 102,
53, 25, 146, 161, 214, 188, 55, 35,
156, 32, 83, 124, 251, 45, 40, 140,
115, 130, 11, 55, 54, 136, 101, 88,
99, 81, 90, 231, 131, 252, 46, 23,
140, 161, 216, 192, 137, 40, 200, 101,
138, 50, 148, 25, 88, 97, 156, 218,
98, 17, 209, 167, 129, 41, 100, 42,
239, 137, 59, 34, 14, 212, 88, 67,
136, 55, 158, 56, 225, 140, 218, 3,
253, 213, 1, 16, 47, 152, 5, 230,
178, 226, 73, 185, 243, 49, 137, 176,
41, 130, 185, 39, 215, 119, 210, 196,
53, 111, 163, 78, 185, 56, 90, 129,
71, 114, 17, 133, 203, 234, 18, 56,
220, 204, 245, 217, 169, 14, 223, 39,
216, 37, 139, 242, 18, 57, 37, 51,
167, 22, 133, 223, 143, 114, 57, 39,
171, 4, 169, 187, 225, 15, 109, 211,
175, 168, 210, 72, 112, 182, 179, 141,
70, 175, 41, 161, 66, 194, 50, 37,
145, 171, 221, 170, 44, 102, 0, 129,
176, 254, 40, 187, 202, 220, 240, 21,
113, 239, 226, 180, 74, 111, 143, 34,
239, 89, 245, 8, 172, 244, 70, 17,
165, 96, 20, 102, 162, 137, 115, 6,
212, 215, 206, 161, 138, 230, 28, 162,
33, 24, 104, 1, 230, 125, 225, 212,
183, 136, 178, 115, 10, 240, 146, 223,
123, 25, 218, 24, 230, 18, 11, 70,
96, 59, 73, 159, 225, 249, 166, 194,
34, 15, 198, 94, 43, 53, 26, 110,
129, 163, 238, 156, 214, 128, 13, 86,
69, 10, 28, 35, 81, 210, 130, 147,
184, 165, 72, 221, 165, 64, 4, 255,
128, 189, 195, 222, 40, 200, 149, 180,
227, 55, 254, 162, 166, 13, 249, 19,
177, 86, 182, 243, 168, 98, 32, 37,
129, 184, 78, 161, 0, 194, 201, 137,
14, 25, 36, 116, 152, 209, 225, 129,
132, 4, 15, 42, 100, 112, 152, 225,
97, 133, 17, 29, 58, 140, 136, 88,
209, 226, 136, 17, 51, 104, 208, 152,
209, 162, 197, 199, 25, 36, 91, 144,
236, 232, 49, 37, 13, 31, 58, 64,
118, 4, 25, 18, 102, 199, 22, 43,
76, 210, 88, 49, 67, 7, 141, 17,
38, 93, 134, 92, 1, 244, 132, 208,
17, 64, 87, 88, 164, 41, 116, 40,
197, 140, 21, 29, 158, 184, 88, 49,
67, 198, 136, 3, 9, 74, 141, 90,
208, 64, 130, 4, 6, 180, 74, 152,
216, 161, 66, 5, 139, 24, 173, 70,
116, 216, 116, 172, 208, 130, 15, 30,
254, 156, 173, 96, 64, 128, 92, 1,
14, 19, 136, 149, 248, 64, 64, 92,
1, 92, 245, 110, 21, 144, 65, 232,
221, 19, 43, 10, 2, 253, 185, 49,
226, 67, 197, 137, 51, 200, 101, 168,
48, 98, 67, 134, 2, 36, 16, 14,
204, 211, 199, 149, 81, 213, 210, 165,
59, 231, 57, 180, 104, 118, 241, 238,
153, 190, 151, 239, 30, 187, 116, 217,
130, 209, 98, 197, 138, 86, 174, 96,
193, 140, 25, 75, 198, 140, 25, 238,
220, 201, 140, 5, 203, 37, 107, 20,
31, 37, 35, 42, 252, 157, 155, 160,
96, 2, 9, 11, 151, 143, 160, 65,
68, 202, 21, 37, 62, 102, 172, 40,
206, 115, 6, 16, 39, 78, 174, 240,
153, 196, 231, 138, 15, 32, 30, 117,
232, 168, 158, 83, 101, 200, 148, 213,
117, 230, 60, 111, 126, 60, 17, 34,
64, 128, 40, 81, 226, 4, 8, 17,
31, 68, 156, 16, 209, 65, 19, 81,
132, 37, 37, 84, 81, 53, 209, 100,
146, 92, 90, 109, 181, 156, 101, 113,
208, 98, 204, 42, 93, 108, 212, 16,
13, 29, 48, 215, 208, 98, 138, 85,
32, 193, 85, 101, 109, 244, 212, 10,
229, 209, 96, 82, 76, 37, 161, 68,
210, 71, 38, 105, 6, 4, 122, 33,
209, 52, 211, 73, 52, 29, 40, 98,
75, 60, 245, 52, 227, 139, 33, 81,
244, 148, 70, 53, 37, 5, 213, 89,
17, 65, 197, 84, 113, 99, 85, 254,
68, 209, 134, 16, 53, 213, 86, 2,
126, 125, 69, 17, 90, 21, 61, 181,
17, 65, 86, 38, 41, 213, 8, 3,
73, 240, 0, 67, 95, 85, 144, 215,
92, 122, 93, 69, 144, 88, 92, 218,
245, 64, 92, 12, 57, 153, 1, 69,
95, 101, 137, 100, 155, 42, 174, 64,
37, 81, 215, 37, 25, 166, 94, 6,
44, 164, 229, 3, 197, 181, 117, 23,
118, 39, 204, 64, 132, 32, 198, 132,
115, 14, 104, 233, 172, 22, 90, 56,
136, 46, 202, 206, 61, 165, 197, 67,
105, 58, 213, 4, 35, 203, 42, 164,
192, 182, 10, 43, 164, 124, 74, 202,
42, 162, 174, 50, 138, 38, 143, 232,
129, 69, 11, 15, 165, 185, 151, 86,
147, 37, 64, 81, 172, 60, 217, 119,
31, 128, 23, 74, 128, 19, 13, 74,
96, 17, 6, 31, 165, 234, 161, 132,
138, 30, 177, 68, 131, 123, 230, 125,
84, 172, 121, 64, 152, 23, 159, 15,
44, 201, 167, 4, 17, 247, 221, 231,
68, 180, 244, 69, 219, 82, 11, 2,
210, 153, 84, 81, 5, 22, 213, 130,
130, 106, 110, 245, 128, 19, 190, 36,
90, 13, 37, 51, 156, 48, 214, 12,
202, 41, 36, 229, 67, 204, 45, 153,
229, 9, 1, 138, 164, 3, 121, 39,
150, 164, 99, 76, 47, 18, 129, 197,
178, 39, 194, 120, 210, 72, 51, 106,
249, 18, 81, 8, 190, 104, 32, 149,
86, 246, 40, 96, 146, 29, 254, 42,
70, 113, 188, 65, 38, 41, 86, 91,
243, 70, 196, 156, 147, 122, 49, 215,
33, 65, 85, 94, 41, 149, 68, 103,
49, 55, 228, 67, 92, 101, 40, 193,
94, 10, 94, 117, 17, 151, 6, 133,
101, 156, 95, 93, 26, 160, 209, 96,
177, 86, 69, 88, 11, 58, 221, 212,
130, 179, 0, 182, 220, 149, 92, 121,
237, 233, 208, 88, 50, 223, 204, 23,
148, 56, 145, 193, 74, 53, 138, 66,
202, 14, 59, 231, 32, 26, 78, 54,
213, 84, 147, 205, 55, 142, 158, 243,
77, 54, 209, 48, 131, 169, 166, 156,
152, 170, 8, 33, 130, 216, 161, 135,
29, 113, 144, 209, 133, 18, 51, 24,
217, 178, 147, 93, 41, 246, 20, 102,
235, 242, 200, 223, 124, 213, 141, 160,
80, 7, 34, 42, 17, 134, 34, 159,
82, 66, 70, 182, 61, 49, 203, 18,
179, 200, 54, 14, 57, 75, 245, 61,
123, 159, 180, 209, 78, 171, 159, 180,
244, 249, 64, 67, 129, 221, 234, 56,
48, 73, 99, 246, 101, 64, 67, 97,
68, 227, 89, 56, 171, 248, 80, 152,
224, 28, 110, 245, 37, 68, 171, 142,
149, 36, 146, 67, 165, 88, 236, 72,
50, 242, 235, 19, 73, 78, 116, 81,
221, 139, 214, 149, 184, 48, 76, 33,
13, 250, 81, 207, 198, 223, 89, 251,
82, 67, 21, 41, 111, 210, 99, 137,
117, 23, 70, 132, 89, 101, 21, 151,
109, 117, 169, 208, 87, 254, 105, 26,
93, 150, 69, 79, 13, 164, 101, 249,
67, 198, 140, 178, 68, 32, 155, 217,
213, 114, 109, 238, 12, 120, 114, 115,
191, 217, 193, 9, 11, 197, 213, 38,
205, 89, 18, 121, 17, 81, 239, 13,
127, 60, 184, 200, 133, 75, 123, 81,
72, 151, 136, 166, 166, 186, 217, 69,
40, 36, 145, 194, 36, 140, 145, 13,
208, 144, 38, 30, 85, 75, 199, 215,
174, 22, 182, 176, 105, 173, 107, 142,
250, 6, 217, 104, 49, 138, 71, 16,
194, 14, 108, 232, 194, 116, 128, 96,
29, 130, 156, 105, 47, 12, 210, 200,
186, 76, 166, 177, 19, 232, 0, 63,
255, 89, 151, 88, 58, 224, 179, 46,
60, 66, 22, 193, 33, 4, 22, 12,
38, 35, 143, 76, 142, 88, 197, 114,
214, 228, 244, 163, 31, 106, 73, 65,
10, 88, 232, 66, 23, 154, 216, 133,
48, 132, 193, 137, 82, 36, 195, 26,
200, 32, 197, 42, 86, 241, 138, 100,
32, 3, 27, 214, 192, 69, 48, 62,
134, 65, 25, 50, 151, 103, 170, 161,
8, 18, 5, 70, 85, 119, 161, 221,
88, 40, 150, 152, 168, 128, 200, 127,
61, 113, 73, 193, 108, 178, 47, 151,
248, 64, 9, 138, 51, 208, 143, 148,
135, 163, 156, 176, 68, 75, 34, 41,
73, 157, 174, 84, 149, 242, 77, 165,
76, 178, 107, 99, 244, 44, 130, 21,
15, 73, 132, 133, 128, 114, 140, 0,
30, 192, 20, 241, 254, 45, 69, 86,
69, 178, 29, 144, 30, 82, 191, 176,
236, 105, 35, 27, 161, 19, 146, 208,
50, 144, 135, 200, 144, 6, 82, 1,
147, 248, 168, 71, 49, 152, 173, 128,
37, 40, 33, 143, 150, 194, 50, 23,
230, 148, 174, 43, 71, 35, 87, 87,
42, 112, 130, 48, 45, 167, 34, 53,
209, 65, 24, 56, 145, 140, 111, 80,
141, 82, 171, 113, 212, 215, 60, 67,
154, 10, 134, 230, 106, 213, 160, 197,
36, 4, 209, 182, 46, 0, 161, 5,
102, 73, 83, 95, 248, 226, 36, 187,
84, 228, 43, 203, 233, 82, 2, 234,
7, 29, 37, 44, 75, 141, 29, 90,
1, 16, 248, 64, 11, 95, 176, 130,
18, 168, 226, 142, 116, 174, 208, 68,
41, 70, 177, 11, 107, 96, 3, 27,
226, 16, 135, 127, 218, 129, 15, 216,
20, 132, 32, 210, 70, 136, 71, 80,
66, 19, 12, 213, 4, 37, 38, 49,
9, 135, 66, 116, 162, 147, 120, 196,
35, 20, 129, 81, 69, 92, 148, 16,
26, 189, 104, 218, 4, 193, 7, 130,
26, 212, 101, 124, 225, 144, 4, 70,
176, 134, 85, 200, 130, 16, 219, 44,
14, 80, 96, 198, 177, 54, 89, 239,
34, 100, 218, 100, 77, 100, 100, 147,
148, 132, 206, 142, 54, 225, 28, 183,
6, 212, 45, 194, 28, 166, 40, 185,
83, 216, 139, 8, 228, 176, 42, 45,
137, 166, 71, 194, 72, 89, 98, 41,
150, 42, 149, 254, 76, 74, 97, 201,
128, 117, 154, 244, 189, 97, 54, 70,
35, 26, 210, 200, 9, 222, 87, 32,
226, 181, 96, 124, 121, 11, 89, 149,
8, 83, 74, 45, 141, 207, 34, 63,
122, 223, 73, 133, 146, 17, 45, 221,
9, 73, 34, 34, 81, 138, 172, 99,
157, 226, 192, 206, 56, 121, 82, 16,
25, 151, 99, 51, 187, 192, 170, 64,
64, 96, 195, 40, 140, 33, 181, 69,
81, 74, 82, 85, 187, 90, 162, 70,
19, 77, 176, 101, 131, 25, 185, 32,
69, 169, 20, 17, 6, 29, 92, 7,
76, 99, 140, 75, 171, 244, 98, 180,
210, 105, 76, 112, 186, 242, 155, 102,
79, 48, 44, 37, 16, 194, 23, 193,
96, 197, 35, 248, 64, 137, 79, 117,
10, 54, 172, 24, 85, 168, 70, 53,
91, 86, 240, 144, 22, 154, 202, 173,
74, 115, 225, 11, 89, 124, 106, 20,
159, 58, 155, 68, 31, 122, 209, 228,
114, 116, 185, 25, 85, 132, 65, 67,
10, 93, 49, 249, 41, 3, 188, 60,
200, 77, 136, 178, 145, 20, 2, 37,
42, 19, 105, 165, 83, 139, 4, 21,
156, 172, 167, 96, 30, 57, 9, 72,
128, 146, 147, 142, 144, 167, 39, 222,
2, 215, 139, 212, 106, 18, 156, 252,
76, 174, 116, 170, 47, 41, 235, 180,
17, 14, 153, 201, 164, 212, 179, 74,
245, 74, 246, 150, 168, 148, 73, 192,
99, 105, 17, 171, 198, 72, 187, 188,
133, 242, 254, 42, 121, 163, 83, 71,
64, 228, 199, 177, 170, 53, 102, 13,
17, 112, 77, 232, 4, 162, 177, 62,
79, 145, 109, 50, 37, 91, 127, 242,
45, 164, 14, 202, 36, 228, 25, 72,
100, 36, 227, 177, 199, 232, 69, 33,
92, 105, 223, 202, 38, 114, 195, 21,
232, 128, 8, 107, 152, 4, 45, 152,
161, 204, 72, 149, 70, 82, 20, 140,
102, 213, 40, 120, 14, 177, 85, 35,
108, 148, 149, 197, 107, 52, 193, 6,
214, 101, 140, 151, 90, 17, 32, 104,
231, 146, 33, 72, 162, 86, 90, 45,
90, 87, 11, 164, 213, 29, 65, 0,
151, 20, 130, 32, 4, 45, 146, 209,
155, 219, 216, 198, 55, 180, 41, 115,
46, 100, 115, 230, 120, 6, 247, 53,
70, 174, 109, 167, 50, 197, 137, 56,
55, 148, 18, 148, 240, 168, 8, 9,
129, 103, 131, 234, 65, 15, 122, 222,
51, 31, 244, 0, 80, 127, 198, 97,
13, 158, 205, 64, 97, 218, 7, 150,
184, 30, 133, 34, 32, 1, 37, 89,
204, 34, 224, 42, 197, 234, 64, 47,
65, 137, 238, 124, 98, 146, 253, 232,
138, 68, 33, 106, 88, 81, 82, 228,
4, 214, 197, 196, 60, 235, 34, 171,
183, 208, 154, 202, 13, 9, 9, 76,
7, 20, 75, 131, 192, 228, 16, 237,
53, 232, 213, 95, 129, 164, 84, 8,
3, 23, 87, 213, 90, 75, 36, 138,
83, 155, 46, 211, 166, 25, 95, 167,
38, 254, 244, 13, 74, 82, 66, 73,
204, 195, 116, 68, 113, 194, 147, 176,
189, 104, 34, 56, 235, 132, 40, 190,
117, 180, 163, 178, 81, 20, 160, 165,
36, 132, 67, 221, 107, 8, 188, 222,
4, 51, 161, 210, 73, 36, 206, 234,
79, 175, 56, 145, 11, 169, 77, 144,
199, 140, 77, 199, 55, 140, 113, 102,
99, 48, 99, 200, 223, 168, 134, 49,
100, 49, 27, 89, 76, 34, 12, 62,
24, 107, 6, 236, 230, 150, 127, 63,
102, 79, 90, 153, 170, 68, 102, 112,
159, 245, 210, 105, 60, 88, 136, 131,
29, 104, 65, 11, 74, 216, 225, 17,
185, 0, 179, 111, 192, 28, 230, 96,
248, 98, 227, 192, 225, 161, 44, 96,
147, 41, 82, 105, 226, 108, 21, 213,
40, 70, 213, 6, 210, 144, 182, 237,
139, 93, 188, 226, 26, 194, 128, 5,
44, 224, 211, 137, 50, 95, 98, 181,
166, 85, 45, 189, 140, 211, 75, 111,
26, 217, 69, 236, 245, 144, 218, 217,
218, 44, 225, 35, 101, 253, 70, 93,
94, 20, 229, 241, 174, 230, 69, 16,
165, 115, 68, 18, 29, 96, 129, 8,
56, 1, 137, 123, 102, 36, 222, 28,
29, 143, 91, 106, 69, 42, 205, 222,
8, 110, 253, 222, 101, 42, 112, 202,
31, 118, 101, 37, 233, 158, 33, 37,
86, 226, 27, 43, 49, 165, 32, 55,
160, 222, 20, 235, 210, 54, 80, 193,
56, 119, 44, 243, 130, 100, 36, 43,
254, 1, 16, 123, 151, 109, 68, 203,
41, 129, 137, 79, 172, 162, 23, 1,
106, 7, 18, 98, 113, 138, 83, 172,
185, 20, 156, 176, 196, 43, 68, 94,
242, 247, 156, 206, 229, 32, 127, 79,
39, 46, 177, 225, 147, 144, 5, 51,
178, 225, 153, 32, 39, 131, 22, 156,
248, 179, 34, 70, 65, 139, 218, 48,
35, 26, 209, 112, 77, 109, 124, 49,
10, 59, 172, 161, 11, 43, 232, 107,
203, 196, 196, 151, 210, 197, 26, 94,
21, 160, 65, 119, 130, 133, 148, 160,
177, 129, 18, 124, 168, 45, 33, 216,
32, 136, 81, 136, 138, 20, 113, 30,
5, 39, 42, 106, 209, 180, 253, 121,
207, 109, 11, 244, 236, 159, 248, 196,
43, 104, 127, 137, 210, 225, 14, 126,
224, 62, 31, 90, 81, 217, 89, 227,
25, 15, 18, 151, 117, 30, 200, 117,
101, 253, 144, 105, 11, 131, 99, 101,
157, 197, 144, 242, 150, 73, 91, 140,
85, 134, 82, 47, 145, 232, 52, 37,
45, 73, 186, 78, 245, 46, 19, 150,
230, 127, 201, 82, 94, 248, 82, 30,
122, 135, 44, 122, 231, 47, 1, 152,
109, 100, 85, 74, 223, 114, 32, 254,
34, 86, 253, 2, 128, 5, 115, 94,
67, 97, 47, 123, 67, 20, 63, 99,
71, 239, 193, 56, 230, 71, 43, 144,
167, 125, 77, 196, 43, 87, 20, 6,
86, 180, 6, 14, 199, 54, 126, 198,
7, 108, 224, 4, 186, 50, 113, 254,
12, 21, 103, 183, 165, 91, 178, 193,
90, 172, 117, 27, 185, 193, 122, 186,
225, 11, 171, 32, 103, 147, 32, 125,
124, 144, 120, 1, 229, 79, 44, 215,
69, 112, 227, 120, 218, 135, 79, 35,
136, 5, 161, 214, 17, 74, 208, 5,
124, 160, 9, 33, 196, 6, 82, 208,
18, 58, 240, 59, 122, 16, 91, 70,
86, 27, 174, 151, 12, 176, 167, 7,
159, 226, 3, 124, 129, 123, 10, 66,
134, 12, 210, 50, 240, 50, 2, 52,
134, 42, 36, 82, 95, 239, 68, 10,
138, 176, 80, 113, 32, 5, 62, 32,
5, 81, 212, 120, 79, 36, 115, 146,
135, 121, 246, 4, 119, 131, 39, 121,
211, 162, 4, 87, 96, 79, 211, 18,
126, 230, 71, 126, 249, 210, 56, 63,
163, 18, 140, 195, 119, 200, 130, 28,
221, 99, 127, 22, 97, 35, 53, 33,
71, 166, 212, 35, 225, 131, 21, 248,
197, 64, 252, 231, 137, 35, 82, 30,
28, 24, 19, 42, 81, 68, 68, 196,
30, 240, 241, 17, 142, 163, 19, 204,
2, 31, 171, 248, 127, 200, 50, 34,
46, 145, 116, 37, 81, 94, 141, 24,
138, 140, 195, 138, 202, 146, 57, 88,
38, 130, 220, 167, 132, 188, 210, 114,
253, 244, 79, 14, 167, 7, 4, 197,
81, 143, 48, 9, 116, 70, 103, 51,
24, 42, 53, 136, 102, 27, 87, 102,
208, 152, 131, 188, 145, 27, 185, 64,
124, 148, 16, 12, 92, 243, 254, 13,
219, 232, 76, 87, 131, 40, 160, 241,
88, 208, 20, 122, 65, 214, 90, 165,
34, 66, 127, 54, 132, 95, 4, 70,
47, 151, 69, 141, 231, 120, 210, 241,
142, 212, 129, 94, 205, 214, 107, 2,
50, 3, 78, 176, 6, 132, 160, 9,
172, 128, 131, 191, 145, 11, 171, 192,
81, 209, 224, 11, 82, 80, 134, 115,
81, 52, 122, 178, 126, 95, 33, 67,
81, 56, 9, 118, 240, 31, 37, 130,
5, 147, 176, 10, 254, 36, 8, 252,
38, 18, 209, 81, 121, 55, 103, 136,
234, 132, 68, 208, 18, 45, 45, 178,
139, 155, 51, 57, 174, 8, 138, 238,
65, 34, 38, 178, 59, 0, 244, 34,
148, 52, 118, 89, 50, 3, 62, 176,
129, 173, 131, 67, 220, 100, 116, 79,
21, 105, 19, 86, 19, 141, 248, 51,
140, 152, 139, 40, 2, 139, 185, 243,
44, 250, 241, 44, 243, 65, 29, 142,
67, 126, 201, 2, 130, 126, 211, 34,
233, 247, 129, 245, 81, 31, 151, 115,
31, 149, 23, 115, 78, 20, 140, 254,
196, 54, 34, 117, 80, 26, 5, 81,
203, 200, 9, 196, 213, 140, 70, 6,
113, 16, 151, 11, 103, 6, 92, 190,
96, 27, 24, 135, 150, 171, 23, 13,
91, 179, 65, 92, 211, 53, 219, 232,
53, 94, 227, 76, 88, 227, 76, 220,
152, 40, 88, 115, 53, 98, 179, 150,
225, 40, 142, 162, 49, 53, 161, 81,
65, 171, 113, 53, 209, 254, 176, 10,
175, 69, 66, 255, 100, 132, 93, 100,
66, 221, 241, 120, 144, 87, 45, 135,
184, 57, 156, 227, 17, 218, 242, 22,
21, 166, 109, 114, 165, 29, 88, 96,
7, 154, 144, 122, 184, 209, 131, 224,
17, 12, 231, 16, 12, 82, 112, 144,
42, 38, 38, 237, 211, 61, 21, 160,
3, 110, 99, 7, 26, 197, 7, 113,
32, 55, 52, 0, 4, 122, 176, 10,
180, 176, 6, 64, 16, 6, 87, 48,
86, 57, 65, 43, 29, 105, 68, 66,
163, 18, 227, 193, 138, 185, 131, 139,
68, 148, 146, 90, 55, 84, 215, 54,
86, 198, 102, 39, 45, 32, 1, 126,
197, 95, 183, 118, 90, 58, 161, 109,
166, 100, 112, 72, 50, 127, 115, 84,
74, 150, 150, 139, 201, 178, 147, 42,
130, 59, 43, 177, 136, 207, 194, 31,
209, 98, 79, 254, 177, 139, 78, 185,
43, 39, 40, 80, 44, 152, 80, 19,
197, 80, 11, 197, 9, 160, 34, 42,
32, 55, 150, 101, 89, 27, 24, 151,
27, 171, 167, 141, 26, 212, 53, 111,
57, 151, 115, 233, 141, 142, 133, 65,
29, 212, 141, 142, 21, 14, 220, 248,
13, 4, 90, 151, 116, 73, 151, 12,
154, 40, 222, 232, 53, 12, 250, 141,
17, 250, 88, 224, 56, 160, 9, 170,
65, 91, 19, 13, 90, 195, 122, 172,
103, 12, 61, 200, 7, 93, 240, 120,
244, 49, 126, 229, 167, 19, 12, 163,
20, 115, 116, 37, 254, 55, 4, 38,
146, 161, 49, 239, 99, 61, 64, 161,
3, 82, 224, 43, 179, 209, 161, 204,
64, 10, 132, 32, 11, 160, 33, 11,
68, 240, 61, 5, 57, 64, 113, 241,
21, 43, 160, 4, 134, 98, 12, 14,
165, 9, 147, 64, 8, 82, 0, 48,
100, 64, 9, 172, 197, 7, 62, 208,
132, 79, 129, 47, 40, 234, 30, 85,
87, 71, 164, 216, 129, 254, 66, 138,
147, 201, 156, 197, 118, 97, 66, 113,
84, 197, 38, 84, 52, 112, 51, 91,
113, 67, 84, 65, 18, 50, 214, 111,
72, 133, 97, 112, 85, 63, 16, 168,
108, 8, 130, 59, 205, 34, 52, 146,
67, 148, 248, 193, 29, 87, 16, 69,
96, 36, 80, 33, 101, 80, 26, 37,
159, 178, 181, 41, 186, 69, 10, 122,
176, 6, 122, 192, 10, 171, 151, 13,
28, 180, 160, 143, 21, 77, 148, 18,
15, 158, 33, 41, 233, 192, 76, 63,
150, 169, 148, 58, 41, 146, 226, 169,
166, 209, 99, 85, 243, 99, 210, 20,
161, 159, 97, 161, 161, 119, 65, 223,
248, 25, 223, 168, 161, 220, 216, 65,
254, 169, 65, 9, 170, 53, 92, 195,
161, 91, 195, 12, 182, 65, 27, 184,
154, 171, 209, 200, 90, 101, 214, 133,
99, 233, 11, 99, 73, 11, 31, 167,
41, 196, 213, 91, 181, 197, 9, 143,
192, 6, 124, 20, 32, 180, 67, 118,
115, 10, 86, 45, 144, 107, 165, 179,
38, 12, 178, 254, 32, 123, 114, 33,
106, 154, 129, 233, 1, 19, 82, 167,
8, 171, 192, 90, 209, 240, 13, 201,
160, 9, 164, 16, 14, 247, 112, 14,
154, 160, 3, 184, 36, 164, 11, 242,
21, 51, 192, 6, 132, 192, 9, 213,
192, 14, 213, 80, 91, 158, 210, 101,
107, 67, 10, 242, 182, 10, 87, 228,
4, 132, 100, 117, 121, 167, 129, 27,
33, 97, 65, 1, 98, 70, 21, 97,
65, 177, 93, 64, 34, 62, 132, 1,
18, 226, 102, 119, 231, 53, 35, 52,
176, 28, 99, 7, 73, 28, 1, 20,
45, 178, 156, 63, 225, 71, 245, 37,
94, 148, 150, 47, 250, 209, 29, 127,
26, 7, 197, 216, 101, 200, 40, 159,
179, 133, 111, 189, 122, 27, 29, 250,
168, 19, 234, 88, 161, 247, 99, 170,
129, 26, 249, 144, 15, 241, 48, 89,
217, 112, 15, 252, 192, 179, 61, 235,
179, 63, 11, 180, 249, 192, 15, 54,
75, 180, 54, 123, 26, 66, 75, 180,
147, 194, 169, 149, 34, 170, 140, 98,
170, 1, 218, 170, 219, 56, 171, 213,
48, 54, 107, 57, 54, 97, 230, 27,
99, 150, 181, 174, 193, 67, 176, 33,
91, 158, 50, 10, 97, 59, 114, 13,
85, 114, 30, 69, 81, 116, 150, 140,
83, 8, 42, 155, 210, 181, 96, 25,
150, 175, 97, 89, 156, 160, 82, 16,
23, 28, 130, 208, 5, 68, 144, 66,
127, 34, 118, 92, 209, 33, 28, 146,
1, 47, 254, 162, 64, 66, 10, 101,
25, 208, 37, 35, 176, 29, 88, 144,
143, 215, 68, 6, 78, 144, 19, 88,
64, 8, 164, 224, 11, 201, 208, 53,
185, 48, 10, 217, 80, 26, 223, 192,
7, 95, 213, 1, 5, 41, 90, 19,
225, 123, 124, 16, 172, 171, 16, 12,
139, 2, 54, 89, 3, 66, 36, 68,
10, 158, 41, 113, 74, 96, 20, 66,
245, 176, 101, 165, 137, 140, 161, 17,
19, 118, 75, 114, 181, 118, 86, 209,
117, 32, 226, 57, 221, 162, 176, 37,
97, 32, 206, 105, 16, 220, 66, 105,
188, 217, 111, 23, 246, 34, 178, 105,
162, 123, 132, 184, 136, 201, 103, 143,
208, 149, 164, 192, 133, 242, 54, 100,
217, 240, 53, 78, 75, 26, 167, 113,
180, 54, 11, 180, 60, 43, 180, 219,
235, 189, 223, 11, 190, 219, 155, 26,
169, 193, 110, 59, 198, 88, 119, 25,
160, 122, 57, 54, 183, 170, 181, 28,
7, 92, 99, 73, 91, 181, 101, 89,
206, 215, 149, 113, 102, 92, 74, 218,
80, 50, 184, 164, 30, 165, 8, 208,
135, 81, 22, 5, 192, 105, 99, 114,
2, 12, 192, 1, 108, 80, 132, 32,
159, 97, 11, 42, 202, 167, 91, 247,
218, 181, 189, 5, 150, 133, 121, 155,
148, 105, 82, 13, 1, 50, 50, 243,
21, 204, 97, 74, 11, 33, 184, 6,
57, 76, 87, 32, 8, 155, 146, 11,
183, 65, 11, 143, 144, 89, 127, 11,
194, 254, 163, 80, 113, 90, 147, 110,
167, 193, 12, 93, 112, 23, 158, 37,
38, 35, 208, 5, 124, 54, 9, 207,
199, 9, 94, 3, 111, 204, 48, 179,
223, 32, 11, 130, 224, 167, 147, 16,
12, 163, 55, 10, 122, 64, 4, 14,
195, 85, 97, 209, 16, 104, 97, 147,
93, 7, 129, 166, 198, 177, 79, 60,
62, 17, 104, 29, 198, 86, 167, 90,
135, 16, 245, 114, 83, 241, 177, 44,
48, 98, 18, 51, 116, 5, 100, 160,
7, 108, 128, 69, 154, 201, 9, 70,
230, 131, 172, 48, 194, 172, 71, 189,
87, 131, 169, 69, 75, 180, 67, 139,
180, 218, 27, 190, 117, 108, 199, 61,
59, 190, 160, 202, 76, 138, 21, 170,
21, 132, 65, 26, 180, 161, 84, 75,
54, 100, 198, 113, 116, 251, 113, 156,
98, 91, 97, 171, 192, 206, 183, 80,
202, 248, 80, 201, 104, 81, 19, 21,
125, 9, 117, 140, 24, 37, 201, 205,
117, 114, 25, 133, 140, 23, 213, 101,
120, 70, 80, 88, 105, 80, 32, 53,
123, 97, 192, 6, 124, 134, 103, 252,
139, 178, 16, 149, 191, 246, 219, 149,
166, 178, 172, 89, 188, 66, 31, 163,
21, 165, 163, 62, 236, 167, 21, 29,
172, 32, 99, 161, 4, 164, 16, 13,
18, 180, 26, 180, 64, 6, 51, 144,
38, 51, 208, 5, 223, 138, 88, 30,
116, 174, 169, 193, 14, 180, 64, 4,
242, 66, 82, 114, 225, 4, 178, 32,
254, 200, 225, 80, 13, 185, 160, 179,
231, 96, 12, 172, 144, 141, 136, 146,
12, 143, 208, 112, 113, 32, 8, 241,
196, 10, 69, 76, 6, 64, 144, 106,
16, 193, 109, 93, 34, 21, 244, 83,
62, 65, 97, 39, 100, 53, 20, 97,
234, 206, 84, 242, 45, 88, 119, 29,
97, 69, 129, 165, 70, 166, 180, 168,
19, 232, 5, 29, 76, 68, 202, 14,
7, 82, 128, 22, 6, 122, 160, 194,
61, 136, 122, 67, 252, 150, 84, 211,
189, 67, 251, 179, 70, 75, 199, 69,
139, 26, 160, 202, 99, 125, 156, 169,
78, 107, 170, 127, 28, 14, 227, 104,
170, 161, 55, 77, 190, 220, 151, 222,
248, 168, 91, 195, 161, 59, 152, 12,
190, 74, 27, 100, 57, 172, 186, 69,
172, 195, 69, 191, 103, 131, 92, 145,
60, 201, 161, 140, 114, 3, 77, 125,
208, 245, 201, 42, 87, 125, 129, 198,
54, 43, 56, 198, 253, 4, 70, 71,
200, 69, 93, 52, 69, 249, 113, 184,
39, 24, 140, 128, 10, 80, 75, 173,
130, 197, 24, 82, 118, 16, 6, 193,
178, 2, 156, 165, 16, 126, 133, 28,
29, 243, 77, 79, 242, 204, 184, 119,
35, 93, 16, 12, 74, 171, 26, 171,
112, 196, 151, 52, 3, 80, 122, 99,
17, 20, 15, 72, 203, 14, 198, 96,
7, 246, 115, 28, 173, 82, 1, 122,
64, 175, 96, 86, 26, 172, 17, 14,
236, 16, 14, 178, 192, 9, 55, 254,
166, 163, 8, 12, 111, 132, 176, 10,
103, 54, 10, 33, 172, 7, 166, 180,
20, 108, 97, 16, 29, 82, 28, 13,
171, 187, 186, 75, 207, 146, 54, 71,
226, 70, 32, 63, 101, 39, 247, 124,
97, 135, 177, 128, 30, 50, 97, 66,
133, 133, 210, 209, 5, 45, 39, 80,
3, 69, 8, 124, 128, 5, 130, 16,
216, 149, 69, 10, 54, 216, 178, 110,
185, 141, 137, 2, 151, 111, 233, 161,
252, 25, 219, 183, 129, 27, 24, 103,
181, 84, 203, 150, 109, 28, 161, 27,
253, 209, 231, 112, 189, 70, 123, 180,
114, 140, 26, 165, 97, 180, 61, 230,
141, 175, 234, 161, 31, 202, 122, 39,
237, 190, 116, 235, 41, 103, 99, 92,
104, 91, 114, 120, 70, 8, 109, 147,
120, 215, 125, 152, 88, 180, 142, 71,
216, 120, 51, 135, 125, 36, 200, 135,
220, 33, 222, 141, 233, 125, 154, 67,
45, 27, 25, 126, 193, 105, 57, 254,
81, 45, 227, 61, 222, 145, 23, 115,
77, 88, 29, 236, 114, 154, 98, 98,
23, 126, 81, 52, 78, 130, 33, 69,
179, 213, 115, 17, 109, 107, 96, 12,
216, 139, 174, 148, 160, 3, 212, 37,
1, 58, 96, 88, 217, 120, 14, 59,
203, 179, 233, 192, 10, 88, 16, 22,
118, 83, 134, 39, 64, 9, 225, 16,
15, 213, 144, 12, 196, 141, 179, 94,
195, 53, 136, 82, 77, 185, 112, 174,
233, 32, 42, 242, 68, 9, 254, 172,
144, 13, 156, 112, 39, 85, 177, 24,
245, 71, 59, 132, 36, 188, 62, 130,
217, 215, 65, 87, 10, 155, 176, 66,
245, 108, 29, 27, 129, 56, 82, 16,
40, 83, 39, 132, 161, 4, 88, 68,
149, 46, 71, 132, 255, 180, 184, 5,
13, 82, 69, 136, 120, 4, 165, 149,
12, 12, 114, 247, 10, 113, 208, 184,
27, 186, 193, 122, 110, 249, 178, 145,
122, 170, 235, 86, 53, 216, 91, 169,
27, 157, 214, 113, 204, 15, 168, 225,
179, 20, 45, 152, 159, 1, 151, 108,
41, 200, 189, 161, 113, 55, 152, 41,
150, 21, 159, 21, 149, 114, 214, 61,
104, 128, 90, 66, 216, 167, 145, 221,
183, 125, 126, 99, 126, 244, 49, 68,
199, 194, 231, 140, 168, 18, 228, 245,
136, 171, 232, 231, 42, 194, 177, 225,
57, 44, 121, 58, 158, 245, 97, 57,
68, 112, 19, 236, 42, 46, 46, 19,
164, 184, 215, 22, 253, 93, 134, 184,
162, 3, 100, 64, 11, 58, 182, 26,
209, 96, 7, 35, 0, 37, 17, 73,
11, 244, 218, 189, 249, 32, 226, 68,
112, 36, 45, 54, 112, 123, 50, 3,
57, 220, 76, 196, 173, 26, 152, 170,
26, 137, 50, 122, 180, 16, 15, 95,
222, 161, 209, 32, 111, 152, 74, 10,
250, 28, 49, 176, 132, 157, 219, 170,
35, 222, 130, 35, 248, 140, 117, 241,
5, 46, 198, 27, 236, 63, 53, 188,
36, 65, 61, 14, 161, 254, 187, 53,
225, 4, 250, 244, 217, 95, 36, 69,
39, 100, 146, 150, 147, 57, 131, 199,
43, 14, 199, 7, 242, 26, 42, 248,
70, 183, 207, 168, 122, 188, 161, 159,
83, 254, 168, 186, 253, 40, 144, 18,
170, 156, 202, 14, 173, 199, 12, 11,
126, 180, 155, 74, 41, 165, 43, 54,
181, 29, 162, 26, 119, 200, 34, 71,
103, 27, 53, 218, 68, 24, 212, 72,
168, 132, 219, 7, 149, 146, 183, 57,
121, 103, 19, 227, 133, 20, 25, 200,
177, 197, 142, 20, 49, 238, 45, 60,
194, 156, 57, 25, 236, 54, 62, 108,
60, 114, 95, 14, 123, 146, 133, 94,
138, 40, 26, 18, 155, 139, 223, 12,
177, 126, 165, 233, 87, 145, 142, 203,
6, 144, 1, 154, 97, 7, 164, 48,
194, 152, 162, 8, 62, 48, 17, 58,
208, 5, 178, 128, 214, 97, 62, 154,
92, 210, 93, 28, 172, 39, 11, 4,
234, 198, 32, 174, 190, 237, 110, 184,
14, 28, 164, 66, 92, 209, 32, 180,
225, 192, 243, 223, 208, 229, 247, 48,
10, 23, 8, 84, 245, 179, 20, 168,
68, 35, 233, 85, 34, 195, 235, 47,
29, 251, 19, 56, 146, 207, 32, 230,
94, 37, 162, 24, 115, 154, 20, 34,
17, 237, 217, 247, 68, 234, 228, 119,
213, 230, 3, 213, 226, 145, 132, 119,
130, 118, 240, 158, 229, 26, 182, 198,
101, 172, 187, 101, 100, 105, 22, 27,
54, 104, 150, 184, 254, 81, 181, 107,
121, 238, 85, 187, 122, 125, 63, 10,
8, 236, 11, 243, 214, 53, 184, 157,
247, 183, 58, 150, 194, 85, 191, 14,
245, 80, 232, 248, 69, 122, 72, 121,
222, 87, 57, 225, 7, 146, 122, 46,
48, 39, 1, 32, 134, 190, 46, 29,
17, 20, 101, 130, 17, 217, 249, 128,
155, 116, 37, 27, 49, 49, 241, 50,
37, 191, 198, 118, 184, 123, 177, 101,
18, 50, 89, 130, 217, 64, 85, 109,
230, 117, 29, 92, 98, 134, 69, 211,
28, 252, 189, 38, 237, 195, 23, 125,
213, 174, 127, 139, 133, 75, 200, 71,
116, 162, 3, 130, 224, 11, 233, 224,
208, 62, 123, 14, 132, 176, 42, 38,
111, 20, 118, 163, 107, 28, 17, 29,
97, 16, 7, 132, 176, 149, 122, 64,
162, 251, 225, 44, 138, 240, 13, 66,
27, 15, 225, 192, 12, 190, 240, 13,
96, 30, 15, 148, 192, 58, 121, 243,
107, 220, 114, 20, 108, 117, 227, 226,
213, 173, 161, 184, 60, 159, 102, 119,
12, 3, 46, 5, 24, 97, 133, 52,
55, 180, 75, 105, 255, 140, 45, 204,
54, 84, 49, 97, 126, 236, 177, 71,
237, 13, 16, 82, 176, 144, 89, 195,
70, 15, 31, 65, 124, 244, 28, 20,
68, 72, 209, 164, 71, 138, 30, 81,
162, 244, 136, 144, 32, 69, 18, 41,
105, 210, 196, 137, 19, 169, 81, 163,
56, 141, 34, 181, 138, 212, 200, 144,
33, 57, 81, 254, 138, 211, 101, 141,
34, 74, 31, 89, 129, 92, 85, 19,
228, 168, 138, 23, 21, 234, 177, 19,
167, 32, 25, 44, 87, 156, 56, 33,
82, 20, 136, 15, 164, 62, 116, 232,
160, 209, 180, 105, 139, 22, 43, 164,
66, 157, 49, 194, 234, 136, 25, 62,
102, 64, 109, 186, 181, 197, 137, 168,
39, 58, 140, 200, 80, 65, 66, 5,
3, 18, 36, 60, 72, 112, 182, 67,
217, 181, 15, 42, 100, 88, 43, 33,
3, 93, 1, 2, 12, 232, 53, 208,
247, 237, 92, 184, 15, 236, 210, 117,
91, 1, 112, 134, 4, 15, 30, 100,
16, 124, 55, 195, 136, 19, 86, 51,
140, 61, 33, 182, 195, 101, 171, 145,
79, 172, 200, 208, 55, 65, 130, 190,
161, 247, 230, 21, 208, 214, 243, 222,
209, 164, 85, 171, 78, 144, 193, 7,
150, 48, 93, 164, 16, 1, 66, 163,
133, 15, 69, 223, 242, 241, 227, 221,
59, 158, 49, 39, 21, 18, 144, 174,
240, 96, 175, 224, 227, 25, 102, 56,
185, 130, 5, 75, 23, 232, 93, 132,
74, 153, 237, 3, 200, 170, 123, 188,
243, 197, 59, 23, 173, 218, 189, 221,
233, 88, 233, 153, 177, 2, 242, 138,
202, 82, 211, 211, 152, 209, 62, 42,
250, 169, 237, 103, 232, 240, 65, 67,
171, 251, 22, 94, 91, 216, 206, 175,
127, 5, 212, 168, 0, 196, 143, 42,
167, 154, 178, 10, 189, 200, 86, 152,
129, 189, 254, 5, 117, 144, 239, 65,
175, 164, 250, 175, 65, 246, 242, 163,
65, 7, 34, 148, 0, 2, 136, 162,
148, 160, 238, 10, 232, 98, 139, 142,
32, 54, 216, 88, 163, 32, 159, 194,
8, 131, 12, 50, 216, 136, 195, 142,
157, 22, 178, 131, 161, 133, 22, 82,
200, 14, 28, 217, 184, 66, 138, 43,
214, 128, 145, 16, 157, 28, 186, 72,
16, 65, 244, 48, 145, 69, 21, 187,
192, 66, 10, 39, 148, 32, 2, 41,
250, 160, 100, 208, 61, 247, 34, 43,
142, 173, 10, 14, 28, 97, 174, 17,
104, 0, 98, 134, 202, 168, 170, 236,
47, 186, 28, 27, 43, 174, 209, 4,
147, 0, 52, 1, 228, 98, 51, 177,
225, 248, 34, 205, 128, 182, 20, 147,
224, 178, 184, 46, 187, 11, 179, 187,
70, 184, 236, 50, 195, 198, 242, 179,
178, 49, 35, 147, 108, 174, 183, 50,
216, 12, 189, 17, 206, 186, 43, 46,
208, 30, 16, 160, 172, 188, 214, 106,
147, 205, 213, 50, 205, 171, 45, 29,
122, 36, 67, 73, 34, 216, 3, 130,
143, 106, 122, 235, 237, 158, 112, 30,
105, 244, 202, 4, 230, 18, 76, 177,
207, 20, 157, 129, 8, 234, 6, 58,
114, 71, 216, 132, 226, 35, 26, 126,
182, 139, 39, 159, 237, 178, 201, 230,
158, 120, 184, 27, 133, 134, 248, 32,
156, 176, 194, 69, 195, 108, 175, 41,
29, 54, 4, 34, 63, 11, 161, 165,
239, 254, 40, 166, 22, 228, 111, 171,
9, 33, 148, 239, 194, 11, 125, 16,
43, 189, 255, 46, 140, 210, 65, 8,
187, 10, 80, 193, 174, 22, 124, 150,
62, 218, 164, 237, 208, 9, 234, 152,
108, 114, 40, 216, 164, 187, 162, 185,
125, 155, 235, 98, 197, 23, 215, 72,
82, 69, 22, 67, 36, 136, 140, 216,
194, 16, 202, 195, 46, 88, 44, 136,
13, 18, 215, 96, 241, 83, 37, 149,
236, 151, 40, 108, 217, 3, 23, 63,
249, 162, 242, 211, 170, 14, 12, 155,
108, 4, 70, 223, 234, 82, 7, 177,
206, 67, 111, 50, 68, 199, 10, 249,
49, 63, 223, 82, 139, 45, 3, 230,
202, 242, 46, 225, 26, 59, 107, 46,
181, 178, 124, 11, 207, 68, 53, 131,
74, 66, 143, 217, 205, 54, 64, 1,
203, 219, 111, 65, 9, 9, 5, 107,
104, 178, 184, 252, 121, 207, 152, 233,
18, 121, 102, 3, 96, 165, 83, 49,
197, 42, 248, 211, 207, 219, 156, 200,
119, 90, 29, 164, 216, 213, 212, 94,
179, 225, 132, 8, 202, 212, 243, 248,
170, 61, 165, 194, 48, 195, 129, 4,
222, 215, 57, 44, 20, 137, 102, 55,
118, 194, 201, 38, 157, 221, 226, 201,
230, 215, 124, 216, 57, 246, 194, 13,
149, 82, 202, 41, 235, 232, 211, 214,
92, 166, 162, 228, 144, 136, 165, 160,
69, 42, 67, 122, 165, 224, 208, 7,
39, 23, 55, 23, 114, 107, 163, 149,
2, 55, 32 );
-- 71531 bytes
Descriptor : constant UI.Images.Image_Descriptor :=
(Width => 417,
Height => 272,
Palette => Palette'Access,
Bitmap => Data'Access);
end Gallery.Picture3;
|
io7m/coreland-spatial_hash | Ada | 673 | adb | with Ada.Text_IO;
package body Test is
package IO renames Ada.Text_IO;
procedure Sys_Exit (Code : Integer);
pragma Import (C, Sys_Exit, "exit");
Current_Test : Natural := 0;
procedure Assert
(Check : in Boolean;
Pass_Message : in String := "assertion passed";
Fail_Message : in String := "assertion failed") is
begin
Current_Test := Current_Test + 1;
if Check then
IO.Put_Line (IO.Current_Error, "pass:" & Natural'Image (Current_Test) & ": " & Pass_Message);
else
IO.Put_Line (IO.Current_Error, "fail:" & Natural'Image (Current_Test) & ": " & Fail_Message);
Sys_Exit (1);
end if;
end Assert;
end Test;
|
damaki/SPARKNaCl | Ada | 10,334 | adb | package body SPARKNaCl.Stream
with SPARK_Mode => On
is
pragma Warnings (GNATProve, Off, "pragma * ignored (not yet supported)");
--------------------------------------------------------
-- Local subprogram declarations
--------------------------------------------------------
procedure Salsa20_Xor_Local
(C : out Byte_Seq;
M : in Byte_Seq;
Xor_M : in Boolean; -- If True then xor M against Stream
-- If False then return Stream unmodified
N : in Salsa20_Nonce; -- Nonce
K : in Salsa20_Key) -- Key
with Global => null,
Pre => M'First = 0 and then
C'First = 0 and then
(if Xor_M then (C'Last = M'Last)) and then
(if not Xor_M then M'Last = 0);
procedure ChaCha20_Local (C : out Byte_Seq;
M : in Byte_Seq;
N : in ChaCha20_Nonce;
K : in ChaCha20_Key;
Xor_M : in Boolean;
Counter : in U64)
with Global => null,
Pre => M'First = 0 and then
C'First = 0 and then
U32 (C'Length) <= U32 (N32'Last) and then
(if Xor_M then (C'Last = M'Last)) and then
(if not Xor_M then M'Last = 63);
procedure ChaCha20_IETF_Local (C : out Byte_Seq;
M : in Byte_Seq;
N : in ChaCha20_IETF_Nonce;
K : in ChaCha20_Key;
Xor_M : in Boolean;
Counter : in U32)
with Global => null,
Pre => M'First = 0 and then
C'First = 0 and then
U32 (C'Length) <= U32 (N32'Last) and then
(if Xor_M then (C'Last = M'Last)) and then
(if not Xor_M then M'Last = 63);
--------------------------------------------------------
-- Local subprogram bodies
--------------------------------------------------------
procedure Salsa20_Xor_Local
(C : out Byte_Seq;
M : in Byte_Seq;
Xor_M : in Boolean; -- If True then xor M against Stream
-- If False then return Stream unmodified
N : in Salsa20_Nonce; -- Nonce
K : in Salsa20_Key) -- Key
is
Full_Block_Count : constant I32 := C'Last / 64;
subtype Offset_Range is I32 range 0 .. (Full_Block_Count * 64);
subtype Natural_64 is I64 range 0 .. I64'Last;
Offset : Offset_Range;
Final_Offset : I32;
Z : Bytes_16;
X : Bytes_64;
U : U32;
B : Natural_64;
begin
B := C'Length;
C := (others => 0);
if B = 0 then
return;
end if;
Offset := 0;
Z := (others => 0);
Z (0 .. 7) := Bytes_8 (N);
if B >= 64 then
loop
pragma Loop_Optimize (No_Unroll);
pragma Loop_Invariant
((B + I64 (Offset) = C'Length) and then
(I64 (Offset) <= (C'Length - B)) and then
((C'Length - B) <= I64 (C'Last) - 63));
Core.Salsa20 (X, Z, K, Sigma);
for I in Index_64 loop
pragma Loop_Optimize (No_Unroll);
pragma Loop_Invariant
((Offset + I) in C'Range and
(if Xor_M then (Offset + I) in M'Range));
C (Offset + I) :=
(if Xor_M then M (Offset + I) else 0) xor
X (I);
end loop;
U := 1;
for I in I32 range 8 .. 15 loop
pragma Loop_Optimize (No_Unroll);
U := U + U32 (Z (I));
Z (I) := Byte (U mod 256);
U := Shift_Right (U, 8);
end loop;
B := B - 64;
-- Exit here to prevent subsequent overflow of Offset + 64
-- on the final iteration
exit when B < 64;
Offset := Offset + 64;
end loop;
if B > 0 then
-- Final block is non-empty but incomplete. It starts
-- at Offset C'Length - B
Final_Offset := I32 (C'Length - B);
else
-- B = 0 so final block is empty, so nothing more to do.
-- Set Final_Offset here to avoid a data-flow error.
Final_Offset := 0;
end if;
else
-- Only a single, incomplete block to process, so it must
-- start at Offset 0
Final_Offset := 0;
end if;
if B > 0 then
Core.Salsa20 (X, Z, K, Sigma);
for I in I32 range 0 .. I32 (B - 1) loop
pragma Loop_Optimize (No_Unroll);
pragma Loop_Invariant
((Final_Offset + I) in C'Range and
(if Xor_M then (Final_Offset + I) in M'Range));
C (Final_Offset + I) :=
(if Xor_M then
M (Final_Offset + I) else 0) xor
X (I);
end loop;
end if;
pragma Warnings (GNATProve, Off, "statement has no effect");
Sanitize (X);
Sanitize (Z);
pragma Unreferenced (X, Z);
end Salsa20_Xor_Local;
--------------------------------------------------------
-- Exported subprogram bodies
--------------------------------------------------------
procedure Salsa20 (C : out Byte_Seq; -- Output stream
N : in Salsa20_Nonce; -- Nonce
K : in Salsa20_Key) -- Key
is
Null_M : Byte_Seq (0 .. 0);
begin
Null_M := (others => 0);
Salsa20_Xor_Local (C, Null_M, False, N, K);
end Salsa20;
procedure Salsa20_Xor (C : out Byte_Seq; -- Output stream
M : in Byte_Seq; -- Input message
N : in Salsa20_Nonce; -- Nonce
K : in Salsa20_Key) -- Key
is
begin
Salsa20_Xor_Local (C, M, True, N, K);
end Salsa20_Xor;
procedure HSalsa20 (C : out Byte_Seq; -- Output stream
N : in HSalsa20_Nonce; -- Nonce
K : in Salsa20_Key) -- Key
is
S : Bytes_32;
begin
Core.HSalsa20 (S, Bytes_16 (N (0 .. 15)), K, Sigma);
Salsa20 (C, Salsa20_Nonce (N (16 .. 23)), Core.Construct (S));
Sanitize (S);
pragma Unreferenced (S);
end HSalsa20;
procedure HSalsa20_Xor (C : out Byte_Seq; -- Output ciphertext
M : in Byte_Seq; -- Input message
N : in HSalsa20_Nonce; -- Nonce
K : in Salsa20_Key) -- Key
is
S : Bytes_32;
begin
Core.HSalsa20 (S, Bytes_16 (N (0 .. 15)), K, Sigma);
Salsa20_Xor_Local (C => C,
M => M,
Xor_M => True,
N => Salsa20_Nonce (N (16 .. 23)),
K => Core.Construct (S));
Sanitize (S);
pragma Unreferenced (S);
end HSalsa20_Xor;
--------------------------------------------------------
-- ChaCha20 Internal Functions
--------------------------------------------------------
procedure ChaCha20_Local (C : out Byte_Seq;
M : in Byte_Seq;
N : in ChaCha20_Nonce;
K : in ChaCha20_Key;
Xor_M : in Boolean;
Counter : in U64)
is
S : ChaCha20_Context;
begin
Core.ChaCha20_Key_IV_Setup (S, K, N, Counter);
Core.ChaCha20_Encrypt_Bytes (S, C, M, Xor_M);
Sanitize (S);
pragma Unreferenced (S);
end ChaCha20_Local;
procedure ChaCha20_IETF_Local (C : out Byte_Seq;
M : in Byte_Seq;
N : in ChaCha20_IETF_Nonce;
K : in ChaCha20_Key;
Xor_M : in Boolean;
Counter : in U32)
is
S : ChaCha20_Context;
begin
Core.ChaCha20_Key_IV_IETF_Setup (S, K, N, Counter);
Core.ChaCha20_Encrypt_Bytes (S, C, M, Xor_M);
Sanitize (S);
pragma Unreferenced (S);
end ChaCha20_IETF_Local;
--------------------------------------------------------
-- Exported subprogram bodies
--------------------------------------------------------
procedure ChaCha20 (C : out Byte_Seq;
N : in ChaCha20_Nonce;
K : in ChaCha20_Key;
Counter : in U64)
is
M : constant Bytes_64 := (others => 0);
begin
ChaCha20_Local (C, M, N, K, False, Counter);
end ChaCha20;
procedure ChaCha20_Xor (C : out Byte_Seq;
M : in Byte_Seq;
N : in ChaCha20_Nonce;
K : in ChaCha20_Key;
Counter : in U64)
is
begin
ChaCha20_Local (C, M, N, K, True, Counter);
end ChaCha20_Xor;
procedure ChaCha20_IETF (C : out Byte_Seq;
N : in ChaCha20_IETF_Nonce;
K : in ChaCha20_Key;
Counter : in U32)
is
M : constant Bytes_64 := (others => 0);
begin
ChaCha20_IETF_Local (C, M, N, K, False, Counter);
end ChaCha20_IETF;
procedure ChaCha20_IETF_Xor (C : out Byte_Seq;
M : in Byte_Seq;
N : in ChaCha20_IETF_Nonce;
K : in ChaCha20_Key;
Counter : in U32)
is
begin
ChaCha20_IETF_Local (C, M, N, K, True, Counter);
end ChaCha20_IETF_Xor;
end SPARKNaCl.Stream;
|
reznikmm/matreshka | Ada | 5,700 | ads | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- XML Processor --
-- --
-- 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$
------------------------------------------------------------------------------
-- Schema_Node represents single schema document.
------------------------------------------------------------------------------
with Ada.Containers.Vectors;
with XML.SAX.Locators;
package Matreshka.XML_Schema.AST.Schemas is
pragma Preelaborate;
type Form_Kinds is (Qualified, Unqualified);
type Block_Kinds is (Extension, Restriction, Substitution);
type Block_Flags is array (Block_Kinds) of Boolean;
type Include_Information is record
Location : League.Strings.Universal_String;
Schema : Schema_Access;
end record;
package Include_Vectors is
new Ada.Containers.Vectors (Positive, Include_Information);
type Schema_Node is new Abstract_Node with record
Includes : Include_Vectors.Vector;
Attribute_Form_Default : Form_Kinds := Unqualified;
Element_Form_Default : Form_Kinds := Unqualified;
Block_Default : Block_Flags := (others => False);
Final_Default : Final_Flags := (others => False);
Target_Namespace : League.Strings.Universal_String;
Target_Namespace_Defined : Boolean := False;
end record;
overriding procedure Enter_Node
(Self : not null access Schema_Node;
Visitor : in out Matreshka.XML_Schema.Visitors.Abstract_Visitor'Class;
Control : in out Matreshka.XML_Schema.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Leave_Node
(Self : not null access Schema_Node;
Visitor : in out Matreshka.XML_Schema.Visitors.Abstract_Visitor'Class;
Control : in out Matreshka.XML_Schema.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Visit_Node
(Self : not null access Schema_Node;
Iterator : in out Matreshka.XML_Schema.Visitors.Abstract_Iterator'Class;
Visitor : in out Matreshka.XML_Schema.Visitors.Abstract_Visitor'Class;
Control : in out Matreshka.XML_Schema.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of iterator interface.
package Constructors is
function Create
(Locator : XML.SAX.Locators.SAX_Locator'Class)
return not null Matreshka.XML_Schema.AST.Schema_Access;
end Constructors;
end Matreshka.XML_Schema.AST.Schemas;
|
AdaCore/gpr | Ada | 182 | ads | package p3_2 is
function p3_2_0 (Item : Integer) return Integer;
function p3_2_1 (Item : Integer) return Integer;
function p3_2_2 (Item : Integer) return Integer;
end p3_2;
|
reznikmm/matreshka | Ada | 10,836 | ads | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012-2015, 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$
------------------------------------------------------------------------------
pragma Restrictions (No_Elaboration_Code);
-- GNAT: enforce generation of preinitialized data section instead of
-- generation of elaboration code.
package Matreshka.Internals.Unicode.Ucd.Core_0110 is
pragma Preelaborate;
Group_0110 : aliased constant Core_Second_Stage
:= (16#00# => -- 011000
(Spacing_Mark, Neutral,
Spacing_Mark, Extend, Extend, Combining_Mark,
(Other_Alphabetic
| Alphabetic
| Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#01# => -- 011001
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Combining_Mark,
(Other_Alphabetic
| Alphabetic
| Case_Ignorable
| Grapheme_Extend
| ID_Continue
| XID_Continue => True,
others => False)),
16#02# => -- 011002
(Spacing_Mark, Neutral,
Spacing_Mark, Extend, Extend, Combining_Mark,
(Other_Alphabetic
| Alphabetic
| Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#38# .. 16#45# => -- 011038 .. 011045
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Combining_Mark,
(Other_Alphabetic
| Alphabetic
| Case_Ignorable
| Grapheme_Extend
| ID_Continue
| XID_Continue => True,
others => False)),
16#46# => -- 011046
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Combining_Mark,
(Case_Ignorable
| Grapheme_Extend
| Grapheme_Link
| ID_Continue
| XID_Continue => True,
others => False)),
16#47# .. 16#48# => -- 011047 .. 011048
(Other_Punctuation, Neutral,
Other, Other, S_Term, Break_After,
(STerm
| Terminal_Punctuation
| Grapheme_Base => True,
others => False)),
16#49# .. 16#4D# => -- 011049 .. 01104D
(Other_Punctuation, Neutral,
Other, Other, Other, Alphabetic,
(Terminal_Punctuation
| Grapheme_Base => True,
others => False)),
16#4E# .. 16#51# => -- 01104E .. 011051
(Unassigned, Neutral,
Other, Other, Other, Unknown,
(others => False)),
16#52# .. 16#65# => -- 011052 .. 011065
(Other_Number, Neutral,
Other, Other, Other, Alphabetic,
(Grapheme_Base => True,
others => False)),
16#66# .. 16#6F# => -- 011066 .. 01106F
(Decimal_Number, Neutral,
Other, Numeric, Numeric, Numeric,
(Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#70# .. 16#7E# => -- 011070 .. 01107E
(Unassigned, Neutral,
Other, Other, Other, Unknown,
(others => False)),
16#7F# => -- 01107F
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Combining_Mark,
(Case_Ignorable
| Grapheme_Extend
| Grapheme_Link
| ID_Continue
| XID_Continue => True,
others => False)),
16#80# .. 16#81# => -- 011080 .. 011081
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Combining_Mark,
(Case_Ignorable
| Grapheme_Extend
| ID_Continue
| XID_Continue => True,
others => False)),
16#82# => -- 011082
(Spacing_Mark, Neutral,
Spacing_Mark, Extend, Extend, Combining_Mark,
(Other_Alphabetic
| Alphabetic
| Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#B0# .. 16#B2# => -- 0110B0 .. 0110B2
(Spacing_Mark, Neutral,
Spacing_Mark, Extend, Extend, Combining_Mark,
(Other_Alphabetic
| Alphabetic
| Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#B3# .. 16#B6# => -- 0110B3 .. 0110B6
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Combining_Mark,
(Other_Alphabetic
| Alphabetic
| Case_Ignorable
| Grapheme_Extend
| ID_Continue
| XID_Continue => True,
others => False)),
16#B7# .. 16#B8# => -- 0110B7 .. 0110B8
(Spacing_Mark, Neutral,
Spacing_Mark, Extend, Extend, Combining_Mark,
(Other_Alphabetic
| Alphabetic
| Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#B9# => -- 0110B9
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Combining_Mark,
(Diacritic
| Case_Ignorable
| Grapheme_Extend
| Grapheme_Link
| ID_Continue
| XID_Continue => True,
others => False)),
16#BA# => -- 0110BA
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Combining_Mark,
(Diacritic
| Case_Ignorable
| Grapheme_Extend
| ID_Continue
| XID_Continue => True,
others => False)),
16#BB# .. 16#BC# => -- 0110BB .. 0110BC
(Other_Punctuation, Neutral,
Other, Other, Other, Alphabetic,
(Grapheme_Base => True,
others => False)),
16#BD# => -- 0110BD
(Format, Neutral,
Control, Format, Format, Alphabetic,
(Case_Ignorable => True,
others => False)),
16#BE# .. 16#C1# => -- 0110BE .. 0110C1
(Other_Punctuation, Neutral,
Other, Other, S_Term, Break_After,
(STerm
| Terminal_Punctuation
| Grapheme_Base => True,
others => False)),
16#C2# .. 16#CF# => -- 0110C2 .. 0110CF
(Unassigned, Neutral,
Other, Other, Other, Unknown,
(others => False)),
16#E9# .. 16#EF# => -- 0110E9 .. 0110EF
(Unassigned, Neutral,
Other, Other, Other, Unknown,
(others => False)),
16#F0# .. 16#F9# => -- 0110F0 .. 0110F9
(Decimal_Number, Neutral,
Other, Numeric, Numeric, Numeric,
(Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#FA# .. 16#FF# => -- 0110FA .. 0110FF
(Unassigned, Neutral,
Other, Other, Other, Unknown,
(others => False)),
others =>
(Other_Letter, Neutral,
Other, A_Letter, O_Letter, Alphabetic,
(Alphabetic
| Grapheme_Base
| ID_Continue
| ID_Start
| XID_Continue
| XID_Start => True,
others => False)));
end Matreshka.Internals.Unicode.Ucd.Core_0110;
|
onox/orka | Ada | 2,289 | adb | -- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2018 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 Ada.Unchecked_Deallocation;
package body Orka.Smart_Pointers is
procedure Free is new Ada.Unchecked_Deallocation (Data_Record, Data_Record_Access);
function Is_Null (Object : Abstract_Pointer) return Boolean is (Object.Data = null);
function References (Object : Abstract_Pointer) return Natural is
(Object.Data.References.Count);
procedure Set
(Object : in out Abstract_Pointer;
Value : not null Object_Access) is
begin
if Object.Data /= null then
-- Decrement old reference count
Finalize (Object);
end if;
Object.Data := new Data_Record'(Object => Value, References => <>);
end Set;
function Get (Object : Mutable_Pointer) return Reference is
begin
return Reference'(Value => Object.Data.Object, Hold => Object);
end Get;
function Get (Object : Pointer) return Constant_Reference is
begin
return Constant_Reference'(Value => Object.Data.Object, Hold => Object);
end Get;
overriding
procedure Adjust (Object : in out Abstract_Pointer) is
begin
if Object.Data /= null then
Object.Data.References.Increment;
end if;
end Adjust;
overriding
procedure Finalize (Object : in out Abstract_Pointer) is
Zero : Boolean;
begin
if Object.Data /= null then
Object.Data.References.Decrement (Zero);
if Zero then
Free_Object (Object.Data.Object);
Free (Object.Data);
end if;
end if;
-- Idempotence: next call to Finalize has no effect
Object.Data := null;
end Finalize;
end Orka.Smart_Pointers;
|
reznikmm/matreshka | Ada | 6,584 | adb | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Tools Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2015, 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 Ada.Command_Line;
with Ada.Wide_Wide_Text_IO;
with League.Application;
with League.Strings;
with UAFLEX.Run;
procedure UAFLEX.Driver is
procedure Read_Arguments;
procedure Print_Usage;
function "+"
(Item : Wide_Wide_String)
return League.Strings.Universal_String
renames League.Strings.To_Universal_String;
Handler : League.Strings.Universal_String;
Input : League.Strings.Universal_String;
Tokens : League.Strings.Universal_String;
Types : League.Strings.Universal_String;
Scanner : League.Strings.Universal_String;
-----------------
-- Print_Usage --
-----------------
procedure Print_Usage is
use Ada.Wide_Wide_Text_IO;
begin
Put_Line
(Standard_Error,
"Usage: uaflex <unit-options> input_file");
Put_Line
(Standard_Error,
" where <unit-options> contains:");
Put_Line
(Standard_Error,
" --types Types_Unit - unit for type and condition declarations");
Put_Line
(Standard_Error,
" --handler Handler_Unit - unit for abstract handler declaration");
Put_Line
(Standard_Error,
" --scanner Scanner_Unit - unit where scanner is located");
Put_Line
(Standard_Error,
" --tokens Tokens_Unit - unit where Token type is declared");
end Print_Usage;
--------------------
-- Read_Arguments --
--------------------
procedure Read_Arguments is
use League.Strings;
Is_Types : constant Universal_String := +"--types";
Is_Scanner : constant Universal_String := +"--scanner";
Is_Tokens : constant Universal_String := +"--tokens";
Is_Handler : constant Universal_String := +"--handler";
Last : constant Natural := League.Application.Arguments.Length;
Index : Positive := 1;
begin
while Index <= Last loop
declare
Next : constant League.Strings.Universal_String :=
League.Application.Arguments.Element (Index);
begin
if Index = Last then
Input := Next;
elsif Next = Is_Types then
Index := Index + 1;
Types := League.Application.Arguments.Element (Index);
elsif Next = Is_Scanner then
Index := Index + 1;
Scanner := League.Application.Arguments.Element (Index);
elsif Next = Is_Tokens then
Index := Index + 1;
Tokens := League.Application.Arguments.Element (Index);
elsif Next = Is_Handler then
Index := Index + 1;
Handler := League.Application.Arguments.Element (Index);
end if;
Index := Index + 1;
end;
end loop;
end Read_Arguments;
Success : Boolean;
begin
Read_Arguments;
if Handler.Is_Empty or
Input.Is_Empty or
Tokens.Is_Empty or
Types.Is_Empty or
Scanner.Is_Empty
then
Print_Usage;
return;
end if;
UAFLEX.Run
(Handler,
Input,
Tokens,
Types,
Scanner,
Success);
if not Success then
Ada.Command_Line.Set_Exit_Status (Ada.Command_Line.Failure);
end if;
end UAFLEX.Driver;
|
AdaCore/gpr | Ada | 291,340 | adb |
--
-- Copyright (C) 2019-2023, AdaCore
-- SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
--
with Ada.Containers.Vectors;
with Ada.Exceptions;
with Ada.Unchecked_Deallocation;
with Gpr_Parser_Support.Diagnostics; use Gpr_Parser_Support.Diagnostics;
with Gpr_Parser_Support.Packrat;
with Gpr_Parser_Support.Slocs; use Gpr_Parser_Support.Slocs;
pragma Warnings (Off, "referenced");
with Gpr_Parser_Support.Symbols; use Gpr_Parser_Support.Symbols;
pragma Warnings (On, "referenced");
with Gpr_Parser_Support.Text; use Gpr_Parser_Support.Text;
with Gpr_Parser.Common; use Gpr_Parser.Common;
with Gpr_Parser.Implementation; use Gpr_Parser.Implementation;
use Gpr_Parser.Implementation.Precomputed_Symbols;
pragma Warnings (Off, "referenced");
with Gpr_Parser.Private_Converters; use Gpr_Parser.Private_Converters;
pragma Warnings (On, "referenced");
package body Gpr_Parser.Parsers is
pragma Warnings (Off, "use clause");
use all type Gpr_Parser_Support.Symbols.Symbol_Type;
pragma Warnings (On, "use clause");
-- Prepare packrat instantiations: one per enum type and onefor each kind
-- of node (including lists). Likewise for bump ptr. allocators, except
-- we need them only for non-abstract AST nodes.
pragma Warnings (Off, "is not referenced");
package Bare_Gpr_Node_Memos is new Gpr_Parser_Support.Packrat
(Bare_Gpr_Node, Token_Index);
package Bare_All_Qualifier_Memos is new Gpr_Parser_Support.Packrat
(Bare_All_Qualifier, Token_Index);
package Bare_All_Qualifier_Absent_Memos is new Gpr_Parser_Support.Packrat
(Bare_All_Qualifier_Absent, Token_Index);
subtype Subtype_For_All_Qualifier_Absent is
Root_Node_Record (Gpr_All_Qualifier_Absent);
type Access_To_Subtype_For_All_Qualifier_Absent is access all Subtype_For_All_Qualifier_Absent;
pragma No_Strict_Aliasing (Access_To_Subtype_For_All_Qualifier_Absent);
package Bare_All_Qualifier_Absent_Alloc is new Alloc
(Subtype_For_All_Qualifier_Absent, Access_To_Subtype_For_All_Qualifier_Absent);
function Allocate_All_Qualifier_Absent
(Pool : Bump_Ptr_Pool) return Bare_All_Qualifier_Absent;
function Allocate_All_Qualifier_Absent
(Pool : Bump_Ptr_Pool) return Bare_All_Qualifier_Absent
is
Result : constant Access_To_Subtype_For_All_Qualifier_Absent := Bare_All_Qualifier_Absent_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_All_Qualifier_Absent;
return Bare_All_Qualifier_Absent (Result);
end Allocate_All_Qualifier_Absent;
package Bare_All_Qualifier_Present_Memos is new Gpr_Parser_Support.Packrat
(Bare_All_Qualifier_Present, Token_Index);
subtype Subtype_For_All_Qualifier_Present is
Root_Node_Record (Gpr_All_Qualifier_Present);
type Access_To_Subtype_For_All_Qualifier_Present is access all Subtype_For_All_Qualifier_Present;
pragma No_Strict_Aliasing (Access_To_Subtype_For_All_Qualifier_Present);
package Bare_All_Qualifier_Present_Alloc is new Alloc
(Subtype_For_All_Qualifier_Present, Access_To_Subtype_For_All_Qualifier_Present);
function Allocate_All_Qualifier_Present
(Pool : Bump_Ptr_Pool) return Bare_All_Qualifier_Present;
function Allocate_All_Qualifier_Present
(Pool : Bump_Ptr_Pool) return Bare_All_Qualifier_Present
is
Result : constant Access_To_Subtype_For_All_Qualifier_Present := Bare_All_Qualifier_Present_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_All_Qualifier_Present;
return Bare_All_Qualifier_Present (Result);
end Allocate_All_Qualifier_Present;
package Bare_Attribute_Decl_Memos is new Gpr_Parser_Support.Packrat
(Bare_Attribute_Decl, Token_Index);
subtype Subtype_For_Attribute_Decl is
Root_Node_Record (Gpr_Attribute_Decl);
type Access_To_Subtype_For_Attribute_Decl is access all Subtype_For_Attribute_Decl;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Attribute_Decl);
package Bare_Attribute_Decl_Alloc is new Alloc
(Subtype_For_Attribute_Decl, Access_To_Subtype_For_Attribute_Decl);
function Allocate_Attribute_Decl
(Pool : Bump_Ptr_Pool) return Bare_Attribute_Decl;
function Allocate_Attribute_Decl
(Pool : Bump_Ptr_Pool) return Bare_Attribute_Decl
is
Result : constant Access_To_Subtype_For_Attribute_Decl := Bare_Attribute_Decl_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Attribute_Decl;
return Bare_Attribute_Decl (Result);
end Allocate_Attribute_Decl;
package Bare_Attribute_Reference_Memos is new Gpr_Parser_Support.Packrat
(Bare_Attribute_Reference, Token_Index);
subtype Subtype_For_Attribute_Reference is
Root_Node_Record (Gpr_Attribute_Reference);
type Access_To_Subtype_For_Attribute_Reference is access all Subtype_For_Attribute_Reference;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Attribute_Reference);
package Bare_Attribute_Reference_Alloc is new Alloc
(Subtype_For_Attribute_Reference, Access_To_Subtype_For_Attribute_Reference);
function Allocate_Attribute_Reference
(Pool : Bump_Ptr_Pool) return Bare_Attribute_Reference;
function Allocate_Attribute_Reference
(Pool : Bump_Ptr_Pool) return Bare_Attribute_Reference
is
Result : constant Access_To_Subtype_For_Attribute_Reference := Bare_Attribute_Reference_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Attribute_Reference;
return Bare_Attribute_Reference (Result);
end Allocate_Attribute_Reference;
package Bare_Base_List_Memos is new Gpr_Parser_Support.Packrat
(Bare_Base_List, Token_Index);
package Bare_Case_Item_List_Memos is new Gpr_Parser_Support.Packrat
(Bare_Case_Item_List, Token_Index);
subtype Subtype_For_Case_Item_List is
Root_Node_Record (Gpr_Case_Item_List);
type Access_To_Subtype_For_Case_Item_List is access all Subtype_For_Case_Item_List;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Case_Item_List);
package Bare_Case_Item_List_Alloc is new Alloc
(Subtype_For_Case_Item_List, Access_To_Subtype_For_Case_Item_List);
function Allocate_Case_Item_List
(Pool : Bump_Ptr_Pool) return Bare_Case_Item_List;
function Allocate_Case_Item_List
(Pool : Bump_Ptr_Pool) return Bare_Case_Item_List
is
Result : constant Access_To_Subtype_For_Case_Item_List := Bare_Case_Item_List_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Case_Item_List;
return Bare_Case_Item_List (Result);
end Allocate_Case_Item_List;
package Bare_Gpr_Node_List_Memos is new Gpr_Parser_Support.Packrat
(Bare_Gpr_Node_List, Token_Index);
subtype Subtype_For_Gpr_Node_List is
Root_Node_Record (Gpr_Gpr_Node_List);
type Access_To_Subtype_For_Gpr_Node_List is access all Subtype_For_Gpr_Node_List;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Gpr_Node_List);
package Bare_Gpr_Node_List_Alloc is new Alloc
(Subtype_For_Gpr_Node_List, Access_To_Subtype_For_Gpr_Node_List);
function Allocate_Gpr_Node_List
(Pool : Bump_Ptr_Pool) return Bare_Gpr_Node_List;
function Allocate_Gpr_Node_List
(Pool : Bump_Ptr_Pool) return Bare_Gpr_Node_List
is
Result : constant Access_To_Subtype_For_Gpr_Node_List := Bare_Gpr_Node_List_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Gpr_Node_List;
return Bare_Gpr_Node_List (Result);
end Allocate_Gpr_Node_List;
package Bare_Choices_Memos is new Gpr_Parser_Support.Packrat
(Bare_Choices, Token_Index);
subtype Subtype_For_Choices is
Root_Node_Record (Gpr_Choices);
type Access_To_Subtype_For_Choices is access all Subtype_For_Choices;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Choices);
package Bare_Choices_Alloc is new Alloc
(Subtype_For_Choices, Access_To_Subtype_For_Choices);
function Allocate_Choices
(Pool : Bump_Ptr_Pool) return Bare_Choices;
function Allocate_Choices
(Pool : Bump_Ptr_Pool) return Bare_Choices
is
Result : constant Access_To_Subtype_For_Choices := Bare_Choices_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Choices;
return Bare_Choices (Result);
end Allocate_Choices;
package Bare_Term_List_Memos is new Gpr_Parser_Support.Packrat
(Bare_Term_List, Token_Index);
subtype Subtype_For_Term_List is
Root_Node_Record (Gpr_Term_List);
type Access_To_Subtype_For_Term_List is access all Subtype_For_Term_List;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Term_List);
package Bare_Term_List_Alloc is new Alloc
(Subtype_For_Term_List, Access_To_Subtype_For_Term_List);
function Allocate_Term_List
(Pool : Bump_Ptr_Pool) return Bare_Term_List;
function Allocate_Term_List
(Pool : Bump_Ptr_Pool) return Bare_Term_List
is
Result : constant Access_To_Subtype_For_Term_List := Bare_Term_List_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Term_List;
return Bare_Term_List (Result);
end Allocate_Term_List;
package Bare_Identifier_List_Memos is new Gpr_Parser_Support.Packrat
(Bare_Identifier_List, Token_Index);
subtype Subtype_For_Identifier_List is
Root_Node_Record (Gpr_Identifier_List);
type Access_To_Subtype_For_Identifier_List is access all Subtype_For_Identifier_List;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Identifier_List);
package Bare_Identifier_List_Alloc is new Alloc
(Subtype_For_Identifier_List, Access_To_Subtype_For_Identifier_List);
function Allocate_Identifier_List
(Pool : Bump_Ptr_Pool) return Bare_Identifier_List;
function Allocate_Identifier_List
(Pool : Bump_Ptr_Pool) return Bare_Identifier_List
is
Result : constant Access_To_Subtype_For_Identifier_List := Bare_Identifier_List_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Identifier_List;
return Bare_Identifier_List (Result);
end Allocate_Identifier_List;
package Bare_String_Literal_List_Memos is new Gpr_Parser_Support.Packrat
(Bare_String_Literal_List, Token_Index);
subtype Subtype_For_String_Literal_List is
Root_Node_Record (Gpr_String_Literal_List);
type Access_To_Subtype_For_String_Literal_List is access all Subtype_For_String_Literal_List;
pragma No_Strict_Aliasing (Access_To_Subtype_For_String_Literal_List);
package Bare_String_Literal_List_Alloc is new Alloc
(Subtype_For_String_Literal_List, Access_To_Subtype_For_String_Literal_List);
function Allocate_String_Literal_List
(Pool : Bump_Ptr_Pool) return Bare_String_Literal_List;
function Allocate_String_Literal_List
(Pool : Bump_Ptr_Pool) return Bare_String_Literal_List
is
Result : constant Access_To_Subtype_For_String_Literal_List := Bare_String_Literal_List_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_String_Literal_List;
return Bare_String_Literal_List (Result);
end Allocate_String_Literal_List;
package Bare_Term_List_List_Memos is new Gpr_Parser_Support.Packrat
(Bare_Term_List_List, Token_Index);
subtype Subtype_For_Term_List_List is
Root_Node_Record (Gpr_Term_List_List);
type Access_To_Subtype_For_Term_List_List is access all Subtype_For_Term_List_List;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Term_List_List);
package Bare_Term_List_List_Alloc is new Alloc
(Subtype_For_Term_List_List, Access_To_Subtype_For_Term_List_List);
function Allocate_Term_List_List
(Pool : Bump_Ptr_Pool) return Bare_Term_List_List;
function Allocate_Term_List_List
(Pool : Bump_Ptr_Pool) return Bare_Term_List_List
is
Result : constant Access_To_Subtype_For_Term_List_List := Bare_Term_List_List_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Term_List_List;
return Bare_Term_List_List (Result);
end Allocate_Term_List_List;
package Bare_With_Decl_List_Memos is new Gpr_Parser_Support.Packrat
(Bare_With_Decl_List, Token_Index);
subtype Subtype_For_With_Decl_List is
Root_Node_Record (Gpr_With_Decl_List);
type Access_To_Subtype_For_With_Decl_List is access all Subtype_For_With_Decl_List;
pragma No_Strict_Aliasing (Access_To_Subtype_For_With_Decl_List);
package Bare_With_Decl_List_Alloc is new Alloc
(Subtype_For_With_Decl_List, Access_To_Subtype_For_With_Decl_List);
function Allocate_With_Decl_List
(Pool : Bump_Ptr_Pool) return Bare_With_Decl_List;
function Allocate_With_Decl_List
(Pool : Bump_Ptr_Pool) return Bare_With_Decl_List
is
Result : constant Access_To_Subtype_For_With_Decl_List := Bare_With_Decl_List_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_With_Decl_List;
return Bare_With_Decl_List (Result);
end Allocate_With_Decl_List;
package Bare_Builtin_Function_Call_Memos is new Gpr_Parser_Support.Packrat
(Bare_Builtin_Function_Call, Token_Index);
subtype Subtype_For_Builtin_Function_Call is
Root_Node_Record (Gpr_Builtin_Function_Call);
type Access_To_Subtype_For_Builtin_Function_Call is access all Subtype_For_Builtin_Function_Call;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Builtin_Function_Call);
package Bare_Builtin_Function_Call_Alloc is new Alloc
(Subtype_For_Builtin_Function_Call, Access_To_Subtype_For_Builtin_Function_Call);
function Allocate_Builtin_Function_Call
(Pool : Bump_Ptr_Pool) return Bare_Builtin_Function_Call;
function Allocate_Builtin_Function_Call
(Pool : Bump_Ptr_Pool) return Bare_Builtin_Function_Call
is
Result : constant Access_To_Subtype_For_Builtin_Function_Call := Bare_Builtin_Function_Call_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Builtin_Function_Call;
return Bare_Builtin_Function_Call (Result);
end Allocate_Builtin_Function_Call;
package Bare_Case_Construction_Memos is new Gpr_Parser_Support.Packrat
(Bare_Case_Construction, Token_Index);
subtype Subtype_For_Case_Construction is
Root_Node_Record (Gpr_Case_Construction);
type Access_To_Subtype_For_Case_Construction is access all Subtype_For_Case_Construction;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Case_Construction);
package Bare_Case_Construction_Alloc is new Alloc
(Subtype_For_Case_Construction, Access_To_Subtype_For_Case_Construction);
function Allocate_Case_Construction
(Pool : Bump_Ptr_Pool) return Bare_Case_Construction;
function Allocate_Case_Construction
(Pool : Bump_Ptr_Pool) return Bare_Case_Construction
is
Result : constant Access_To_Subtype_For_Case_Construction := Bare_Case_Construction_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Case_Construction;
return Bare_Case_Construction (Result);
end Allocate_Case_Construction;
package Bare_Case_Item_Memos is new Gpr_Parser_Support.Packrat
(Bare_Case_Item, Token_Index);
subtype Subtype_For_Case_Item is
Root_Node_Record (Gpr_Case_Item);
type Access_To_Subtype_For_Case_Item is access all Subtype_For_Case_Item;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Case_Item);
package Bare_Case_Item_Alloc is new Alloc
(Subtype_For_Case_Item, Access_To_Subtype_For_Case_Item);
function Allocate_Case_Item
(Pool : Bump_Ptr_Pool) return Bare_Case_Item;
function Allocate_Case_Item
(Pool : Bump_Ptr_Pool) return Bare_Case_Item
is
Result : constant Access_To_Subtype_For_Case_Item := Bare_Case_Item_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Case_Item;
return Bare_Case_Item (Result);
end Allocate_Case_Item;
package Bare_Compilation_Unit_Memos is new Gpr_Parser_Support.Packrat
(Bare_Compilation_Unit, Token_Index);
subtype Subtype_For_Compilation_Unit is
Root_Node_Record (Gpr_Compilation_Unit);
type Access_To_Subtype_For_Compilation_Unit is access all Subtype_For_Compilation_Unit;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Compilation_Unit);
package Bare_Compilation_Unit_Alloc is new Alloc
(Subtype_For_Compilation_Unit, Access_To_Subtype_For_Compilation_Unit);
function Allocate_Compilation_Unit
(Pool : Bump_Ptr_Pool) return Bare_Compilation_Unit;
function Allocate_Compilation_Unit
(Pool : Bump_Ptr_Pool) return Bare_Compilation_Unit
is
Result : constant Access_To_Subtype_For_Compilation_Unit := Bare_Compilation_Unit_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Compilation_Unit;
return Bare_Compilation_Unit (Result);
end Allocate_Compilation_Unit;
package Bare_Empty_Decl_Memos is new Gpr_Parser_Support.Packrat
(Bare_Empty_Decl, Token_Index);
subtype Subtype_For_Empty_Decl is
Root_Node_Record (Gpr_Empty_Decl);
type Access_To_Subtype_For_Empty_Decl is access all Subtype_For_Empty_Decl;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Empty_Decl);
package Bare_Empty_Decl_Alloc is new Alloc
(Subtype_For_Empty_Decl, Access_To_Subtype_For_Empty_Decl);
function Allocate_Empty_Decl
(Pool : Bump_Ptr_Pool) return Bare_Empty_Decl;
function Allocate_Empty_Decl
(Pool : Bump_Ptr_Pool) return Bare_Empty_Decl
is
Result : constant Access_To_Subtype_For_Empty_Decl := Bare_Empty_Decl_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Empty_Decl;
return Bare_Empty_Decl (Result);
end Allocate_Empty_Decl;
package Bare_Expr_Memos is new Gpr_Parser_Support.Packrat
(Bare_Expr, Token_Index);
package Bare_Prefix_Memos is new Gpr_Parser_Support.Packrat
(Bare_Prefix, Token_Index);
subtype Subtype_For_Prefix is
Root_Node_Record (Gpr_Prefix);
type Access_To_Subtype_For_Prefix is access all Subtype_For_Prefix;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Prefix);
package Bare_Prefix_Alloc is new Alloc
(Subtype_For_Prefix, Access_To_Subtype_For_Prefix);
function Allocate_Prefix
(Pool : Bump_Ptr_Pool) return Bare_Prefix;
function Allocate_Prefix
(Pool : Bump_Ptr_Pool) return Bare_Prefix
is
Result : constant Access_To_Subtype_For_Prefix := Bare_Prefix_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Prefix;
return Bare_Prefix (Result);
end Allocate_Prefix;
package Bare_Single_Tok_Node_Memos is new Gpr_Parser_Support.Packrat
(Bare_Single_Tok_Node, Token_Index);
package Bare_Identifier_Memos is new Gpr_Parser_Support.Packrat
(Bare_Identifier, Token_Index);
subtype Subtype_For_Identifier is
Root_Node_Record (Gpr_Identifier);
type Access_To_Subtype_For_Identifier is access all Subtype_For_Identifier;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Identifier);
package Bare_Identifier_Alloc is new Alloc
(Subtype_For_Identifier, Access_To_Subtype_For_Identifier);
function Allocate_Identifier
(Pool : Bump_Ptr_Pool) return Bare_Identifier;
function Allocate_Identifier
(Pool : Bump_Ptr_Pool) return Bare_Identifier
is
Result : constant Access_To_Subtype_For_Identifier := Bare_Identifier_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Identifier;
return Bare_Identifier (Result);
end Allocate_Identifier;
package Bare_Num_Literal_Memos is new Gpr_Parser_Support.Packrat
(Bare_Num_Literal, Token_Index);
subtype Subtype_For_Num_Literal is
Root_Node_Record (Gpr_Num_Literal);
type Access_To_Subtype_For_Num_Literal is access all Subtype_For_Num_Literal;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Num_Literal);
package Bare_Num_Literal_Alloc is new Alloc
(Subtype_For_Num_Literal, Access_To_Subtype_For_Num_Literal);
function Allocate_Num_Literal
(Pool : Bump_Ptr_Pool) return Bare_Num_Literal;
function Allocate_Num_Literal
(Pool : Bump_Ptr_Pool) return Bare_Num_Literal
is
Result : constant Access_To_Subtype_For_Num_Literal := Bare_Num_Literal_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Num_Literal;
return Bare_Num_Literal (Result);
end Allocate_Num_Literal;
package Bare_String_Literal_Memos is new Gpr_Parser_Support.Packrat
(Bare_String_Literal, Token_Index);
subtype Subtype_For_String_Literal is
Root_Node_Record (Gpr_String_Literal);
type Access_To_Subtype_For_String_Literal is access all Subtype_For_String_Literal;
pragma No_Strict_Aliasing (Access_To_Subtype_For_String_Literal);
package Bare_String_Literal_Alloc is new Alloc
(Subtype_For_String_Literal, Access_To_Subtype_For_String_Literal);
function Allocate_String_Literal
(Pool : Bump_Ptr_Pool) return Bare_String_Literal;
function Allocate_String_Literal
(Pool : Bump_Ptr_Pool) return Bare_String_Literal
is
Result : constant Access_To_Subtype_For_String_Literal := Bare_String_Literal_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_String_Literal;
return Bare_String_Literal (Result);
end Allocate_String_Literal;
package Bare_Limited_Node_Memos is new Gpr_Parser_Support.Packrat
(Bare_Limited_Node, Token_Index);
package Bare_Limited_Absent_Memos is new Gpr_Parser_Support.Packrat
(Bare_Limited_Absent, Token_Index);
subtype Subtype_For_Limited_Absent is
Root_Node_Record (Gpr_Limited_Absent);
type Access_To_Subtype_For_Limited_Absent is access all Subtype_For_Limited_Absent;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Limited_Absent);
package Bare_Limited_Absent_Alloc is new Alloc
(Subtype_For_Limited_Absent, Access_To_Subtype_For_Limited_Absent);
function Allocate_Limited_Absent
(Pool : Bump_Ptr_Pool) return Bare_Limited_Absent;
function Allocate_Limited_Absent
(Pool : Bump_Ptr_Pool) return Bare_Limited_Absent
is
Result : constant Access_To_Subtype_For_Limited_Absent := Bare_Limited_Absent_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Limited_Absent;
return Bare_Limited_Absent (Result);
end Allocate_Limited_Absent;
package Bare_Limited_Present_Memos is new Gpr_Parser_Support.Packrat
(Bare_Limited_Present, Token_Index);
subtype Subtype_For_Limited_Present is
Root_Node_Record (Gpr_Limited_Present);
type Access_To_Subtype_For_Limited_Present is access all Subtype_For_Limited_Present;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Limited_Present);
package Bare_Limited_Present_Alloc is new Alloc
(Subtype_For_Limited_Present, Access_To_Subtype_For_Limited_Present);
function Allocate_Limited_Present
(Pool : Bump_Ptr_Pool) return Bare_Limited_Present;
function Allocate_Limited_Present
(Pool : Bump_Ptr_Pool) return Bare_Limited_Present
is
Result : constant Access_To_Subtype_For_Limited_Present := Bare_Limited_Present_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Limited_Present;
return Bare_Limited_Present (Result);
end Allocate_Limited_Present;
package Bare_Others_Designator_Memos is new Gpr_Parser_Support.Packrat
(Bare_Others_Designator, Token_Index);
subtype Subtype_For_Others_Designator is
Root_Node_Record (Gpr_Others_Designator);
type Access_To_Subtype_For_Others_Designator is access all Subtype_For_Others_Designator;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Others_Designator);
package Bare_Others_Designator_Alloc is new Alloc
(Subtype_For_Others_Designator, Access_To_Subtype_For_Others_Designator);
function Allocate_Others_Designator
(Pool : Bump_Ptr_Pool) return Bare_Others_Designator;
function Allocate_Others_Designator
(Pool : Bump_Ptr_Pool) return Bare_Others_Designator
is
Result : constant Access_To_Subtype_For_Others_Designator := Bare_Others_Designator_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Others_Designator;
return Bare_Others_Designator (Result);
end Allocate_Others_Designator;
package Bare_Package_Decl_Memos is new Gpr_Parser_Support.Packrat
(Bare_Package_Decl, Token_Index);
subtype Subtype_For_Package_Decl is
Root_Node_Record (Gpr_Package_Decl);
type Access_To_Subtype_For_Package_Decl is access all Subtype_For_Package_Decl;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Package_Decl);
package Bare_Package_Decl_Alloc is new Alloc
(Subtype_For_Package_Decl, Access_To_Subtype_For_Package_Decl);
function Allocate_Package_Decl
(Pool : Bump_Ptr_Pool) return Bare_Package_Decl;
function Allocate_Package_Decl
(Pool : Bump_Ptr_Pool) return Bare_Package_Decl
is
Result : constant Access_To_Subtype_For_Package_Decl := Bare_Package_Decl_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Package_Decl;
return Bare_Package_Decl (Result);
end Allocate_Package_Decl;
package Bare_Package_Extension_Memos is new Gpr_Parser_Support.Packrat
(Bare_Package_Extension, Token_Index);
subtype Subtype_For_Package_Extension is
Root_Node_Record (Gpr_Package_Extension);
type Access_To_Subtype_For_Package_Extension is access all Subtype_For_Package_Extension;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Package_Extension);
package Bare_Package_Extension_Alloc is new Alloc
(Subtype_For_Package_Extension, Access_To_Subtype_For_Package_Extension);
function Allocate_Package_Extension
(Pool : Bump_Ptr_Pool) return Bare_Package_Extension;
function Allocate_Package_Extension
(Pool : Bump_Ptr_Pool) return Bare_Package_Extension
is
Result : constant Access_To_Subtype_For_Package_Extension := Bare_Package_Extension_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Package_Extension;
return Bare_Package_Extension (Result);
end Allocate_Package_Extension;
package Bare_Package_Renaming_Memos is new Gpr_Parser_Support.Packrat
(Bare_Package_Renaming, Token_Index);
subtype Subtype_For_Package_Renaming is
Root_Node_Record (Gpr_Package_Renaming);
type Access_To_Subtype_For_Package_Renaming is access all Subtype_For_Package_Renaming;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Package_Renaming);
package Bare_Package_Renaming_Alloc is new Alloc
(Subtype_For_Package_Renaming, Access_To_Subtype_For_Package_Renaming);
function Allocate_Package_Renaming
(Pool : Bump_Ptr_Pool) return Bare_Package_Renaming;
function Allocate_Package_Renaming
(Pool : Bump_Ptr_Pool) return Bare_Package_Renaming
is
Result : constant Access_To_Subtype_For_Package_Renaming := Bare_Package_Renaming_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Package_Renaming;
return Bare_Package_Renaming (Result);
end Allocate_Package_Renaming;
package Bare_Package_Spec_Memos is new Gpr_Parser_Support.Packrat
(Bare_Package_Spec, Token_Index);
subtype Subtype_For_Package_Spec is
Root_Node_Record (Gpr_Package_Spec);
type Access_To_Subtype_For_Package_Spec is access all Subtype_For_Package_Spec;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Package_Spec);
package Bare_Package_Spec_Alloc is new Alloc
(Subtype_For_Package_Spec, Access_To_Subtype_For_Package_Spec);
function Allocate_Package_Spec
(Pool : Bump_Ptr_Pool) return Bare_Package_Spec;
function Allocate_Package_Spec
(Pool : Bump_Ptr_Pool) return Bare_Package_Spec
is
Result : constant Access_To_Subtype_For_Package_Spec := Bare_Package_Spec_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Package_Spec;
return Bare_Package_Spec (Result);
end Allocate_Package_Spec;
package Bare_Project_Memos is new Gpr_Parser_Support.Packrat
(Bare_Project, Token_Index);
subtype Subtype_For_Project is
Root_Node_Record (Gpr_Project);
type Access_To_Subtype_For_Project is access all Subtype_For_Project;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Project);
package Bare_Project_Alloc is new Alloc
(Subtype_For_Project, Access_To_Subtype_For_Project);
function Allocate_Project
(Pool : Bump_Ptr_Pool) return Bare_Project;
function Allocate_Project
(Pool : Bump_Ptr_Pool) return Bare_Project
is
Result : constant Access_To_Subtype_For_Project := Bare_Project_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Project;
return Bare_Project (Result);
end Allocate_Project;
package Bare_Project_Declaration_Memos is new Gpr_Parser_Support.Packrat
(Bare_Project_Declaration, Token_Index);
subtype Subtype_For_Project_Declaration is
Root_Node_Record (Gpr_Project_Declaration);
type Access_To_Subtype_For_Project_Declaration is access all Subtype_For_Project_Declaration;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Project_Declaration);
package Bare_Project_Declaration_Alloc is new Alloc
(Subtype_For_Project_Declaration, Access_To_Subtype_For_Project_Declaration);
function Allocate_Project_Declaration
(Pool : Bump_Ptr_Pool) return Bare_Project_Declaration;
function Allocate_Project_Declaration
(Pool : Bump_Ptr_Pool) return Bare_Project_Declaration
is
Result : constant Access_To_Subtype_For_Project_Declaration := Bare_Project_Declaration_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Project_Declaration;
return Bare_Project_Declaration (Result);
end Allocate_Project_Declaration;
package Bare_Project_Extension_Memos is new Gpr_Parser_Support.Packrat
(Bare_Project_Extension, Token_Index);
subtype Subtype_For_Project_Extension is
Root_Node_Record (Gpr_Project_Extension);
type Access_To_Subtype_For_Project_Extension is access all Subtype_For_Project_Extension;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Project_Extension);
package Bare_Project_Extension_Alloc is new Alloc
(Subtype_For_Project_Extension, Access_To_Subtype_For_Project_Extension);
function Allocate_Project_Extension
(Pool : Bump_Ptr_Pool) return Bare_Project_Extension;
function Allocate_Project_Extension
(Pool : Bump_Ptr_Pool) return Bare_Project_Extension
is
Result : constant Access_To_Subtype_For_Project_Extension := Bare_Project_Extension_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Project_Extension;
return Bare_Project_Extension (Result);
end Allocate_Project_Extension;
package Bare_Project_Qualifier_Memos is new Gpr_Parser_Support.Packrat
(Bare_Project_Qualifier, Token_Index);
package Bare_Project_Qualifier_Abstract_Memos is new Gpr_Parser_Support.Packrat
(Bare_Project_Qualifier_Abstract, Token_Index);
subtype Subtype_For_Project_Qualifier_Abstract is
Root_Node_Record (Gpr_Project_Qualifier_Abstract);
type Access_To_Subtype_For_Project_Qualifier_Abstract is access all Subtype_For_Project_Qualifier_Abstract;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Project_Qualifier_Abstract);
package Bare_Project_Qualifier_Abstract_Alloc is new Alloc
(Subtype_For_Project_Qualifier_Abstract, Access_To_Subtype_For_Project_Qualifier_Abstract);
function Allocate_Project_Qualifier_Abstract
(Pool : Bump_Ptr_Pool) return Bare_Project_Qualifier_Abstract;
function Allocate_Project_Qualifier_Abstract
(Pool : Bump_Ptr_Pool) return Bare_Project_Qualifier_Abstract
is
Result : constant Access_To_Subtype_For_Project_Qualifier_Abstract := Bare_Project_Qualifier_Abstract_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Project_Qualifier_Abstract;
return Bare_Project_Qualifier_Abstract (Result);
end Allocate_Project_Qualifier_Abstract;
package Bare_Project_Qualifier_Aggregate_Memos is new Gpr_Parser_Support.Packrat
(Bare_Project_Qualifier_Aggregate, Token_Index);
subtype Subtype_For_Project_Qualifier_Aggregate is
Root_Node_Record (Gpr_Project_Qualifier_Aggregate);
type Access_To_Subtype_For_Project_Qualifier_Aggregate is access all Subtype_For_Project_Qualifier_Aggregate;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Project_Qualifier_Aggregate);
package Bare_Project_Qualifier_Aggregate_Alloc is new Alloc
(Subtype_For_Project_Qualifier_Aggregate, Access_To_Subtype_For_Project_Qualifier_Aggregate);
function Allocate_Project_Qualifier_Aggregate
(Pool : Bump_Ptr_Pool) return Bare_Project_Qualifier_Aggregate;
function Allocate_Project_Qualifier_Aggregate
(Pool : Bump_Ptr_Pool) return Bare_Project_Qualifier_Aggregate
is
Result : constant Access_To_Subtype_For_Project_Qualifier_Aggregate := Bare_Project_Qualifier_Aggregate_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Project_Qualifier_Aggregate;
return Bare_Project_Qualifier_Aggregate (Result);
end Allocate_Project_Qualifier_Aggregate;
package Bare_Project_Qualifier_Aggregate_Library_Memos is new Gpr_Parser_Support.Packrat
(Bare_Project_Qualifier_Aggregate_Library, Token_Index);
subtype Subtype_For_Project_Qualifier_Aggregate_Library is
Root_Node_Record (Gpr_Project_Qualifier_Aggregate_Library);
type Access_To_Subtype_For_Project_Qualifier_Aggregate_Library is access all Subtype_For_Project_Qualifier_Aggregate_Library;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Project_Qualifier_Aggregate_Library);
package Bare_Project_Qualifier_Aggregate_Library_Alloc is new Alloc
(Subtype_For_Project_Qualifier_Aggregate_Library, Access_To_Subtype_For_Project_Qualifier_Aggregate_Library);
function Allocate_Project_Qualifier_Aggregate_Library
(Pool : Bump_Ptr_Pool) return Bare_Project_Qualifier_Aggregate_Library;
function Allocate_Project_Qualifier_Aggregate_Library
(Pool : Bump_Ptr_Pool) return Bare_Project_Qualifier_Aggregate_Library
is
Result : constant Access_To_Subtype_For_Project_Qualifier_Aggregate_Library := Bare_Project_Qualifier_Aggregate_Library_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Project_Qualifier_Aggregate_Library;
return Bare_Project_Qualifier_Aggregate_Library (Result);
end Allocate_Project_Qualifier_Aggregate_Library;
package Bare_Project_Qualifier_Configuration_Memos is new Gpr_Parser_Support.Packrat
(Bare_Project_Qualifier_Configuration, Token_Index);
subtype Subtype_For_Project_Qualifier_Configuration is
Root_Node_Record (Gpr_Project_Qualifier_Configuration);
type Access_To_Subtype_For_Project_Qualifier_Configuration is access all Subtype_For_Project_Qualifier_Configuration;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Project_Qualifier_Configuration);
package Bare_Project_Qualifier_Configuration_Alloc is new Alloc
(Subtype_For_Project_Qualifier_Configuration, Access_To_Subtype_For_Project_Qualifier_Configuration);
function Allocate_Project_Qualifier_Configuration
(Pool : Bump_Ptr_Pool) return Bare_Project_Qualifier_Configuration;
function Allocate_Project_Qualifier_Configuration
(Pool : Bump_Ptr_Pool) return Bare_Project_Qualifier_Configuration
is
Result : constant Access_To_Subtype_For_Project_Qualifier_Configuration := Bare_Project_Qualifier_Configuration_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Project_Qualifier_Configuration;
return Bare_Project_Qualifier_Configuration (Result);
end Allocate_Project_Qualifier_Configuration;
package Bare_Project_Qualifier_Library_Memos is new Gpr_Parser_Support.Packrat
(Bare_Project_Qualifier_Library, Token_Index);
subtype Subtype_For_Project_Qualifier_Library is
Root_Node_Record (Gpr_Project_Qualifier_Library);
type Access_To_Subtype_For_Project_Qualifier_Library is access all Subtype_For_Project_Qualifier_Library;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Project_Qualifier_Library);
package Bare_Project_Qualifier_Library_Alloc is new Alloc
(Subtype_For_Project_Qualifier_Library, Access_To_Subtype_For_Project_Qualifier_Library);
function Allocate_Project_Qualifier_Library
(Pool : Bump_Ptr_Pool) return Bare_Project_Qualifier_Library;
function Allocate_Project_Qualifier_Library
(Pool : Bump_Ptr_Pool) return Bare_Project_Qualifier_Library
is
Result : constant Access_To_Subtype_For_Project_Qualifier_Library := Bare_Project_Qualifier_Library_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Project_Qualifier_Library;
return Bare_Project_Qualifier_Library (Result);
end Allocate_Project_Qualifier_Library;
package Bare_Project_Qualifier_Standard_Memos is new Gpr_Parser_Support.Packrat
(Bare_Project_Qualifier_Standard, Token_Index);
subtype Subtype_For_Project_Qualifier_Standard is
Root_Node_Record (Gpr_Project_Qualifier_Standard);
type Access_To_Subtype_For_Project_Qualifier_Standard is access all Subtype_For_Project_Qualifier_Standard;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Project_Qualifier_Standard);
package Bare_Project_Qualifier_Standard_Alloc is new Alloc
(Subtype_For_Project_Qualifier_Standard, Access_To_Subtype_For_Project_Qualifier_Standard);
function Allocate_Project_Qualifier_Standard
(Pool : Bump_Ptr_Pool) return Bare_Project_Qualifier_Standard;
function Allocate_Project_Qualifier_Standard
(Pool : Bump_Ptr_Pool) return Bare_Project_Qualifier_Standard
is
Result : constant Access_To_Subtype_For_Project_Qualifier_Standard := Bare_Project_Qualifier_Standard_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Project_Qualifier_Standard;
return Bare_Project_Qualifier_Standard (Result);
end Allocate_Project_Qualifier_Standard;
package Bare_String_Literal_At_Memos is new Gpr_Parser_Support.Packrat
(Bare_String_Literal_At, Token_Index);
subtype Subtype_For_String_Literal_At is
Root_Node_Record (Gpr_String_Literal_At);
type Access_To_Subtype_For_String_Literal_At is access all Subtype_For_String_Literal_At;
pragma No_Strict_Aliasing (Access_To_Subtype_For_String_Literal_At);
package Bare_String_Literal_At_Alloc is new Alloc
(Subtype_For_String_Literal_At, Access_To_Subtype_For_String_Literal_At);
function Allocate_String_Literal_At
(Pool : Bump_Ptr_Pool) return Bare_String_Literal_At;
function Allocate_String_Literal_At
(Pool : Bump_Ptr_Pool) return Bare_String_Literal_At
is
Result : constant Access_To_Subtype_For_String_Literal_At := Bare_String_Literal_At_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_String_Literal_At;
return Bare_String_Literal_At (Result);
end Allocate_String_Literal_At;
package Bare_Terms_Memos is new Gpr_Parser_Support.Packrat
(Bare_Terms, Token_Index);
subtype Subtype_For_Terms is
Root_Node_Record (Gpr_Terms);
type Access_To_Subtype_For_Terms is access all Subtype_For_Terms;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Terms);
package Bare_Terms_Alloc is new Alloc
(Subtype_For_Terms, Access_To_Subtype_For_Terms);
function Allocate_Terms
(Pool : Bump_Ptr_Pool) return Bare_Terms;
function Allocate_Terms
(Pool : Bump_Ptr_Pool) return Bare_Terms
is
Result : constant Access_To_Subtype_For_Terms := Bare_Terms_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Terms;
return Bare_Terms (Result);
end Allocate_Terms;
package Bare_Type_Reference_Memos is new Gpr_Parser_Support.Packrat
(Bare_Type_Reference, Token_Index);
subtype Subtype_For_Type_Reference is
Root_Node_Record (Gpr_Type_Reference);
type Access_To_Subtype_For_Type_Reference is access all Subtype_For_Type_Reference;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Type_Reference);
package Bare_Type_Reference_Alloc is new Alloc
(Subtype_For_Type_Reference, Access_To_Subtype_For_Type_Reference);
function Allocate_Type_Reference
(Pool : Bump_Ptr_Pool) return Bare_Type_Reference;
function Allocate_Type_Reference
(Pool : Bump_Ptr_Pool) return Bare_Type_Reference
is
Result : constant Access_To_Subtype_For_Type_Reference := Bare_Type_Reference_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Type_Reference;
return Bare_Type_Reference (Result);
end Allocate_Type_Reference;
package Bare_Typed_String_Decl_Memos is new Gpr_Parser_Support.Packrat
(Bare_Typed_String_Decl, Token_Index);
subtype Subtype_For_Typed_String_Decl is
Root_Node_Record (Gpr_Typed_String_Decl);
type Access_To_Subtype_For_Typed_String_Decl is access all Subtype_For_Typed_String_Decl;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Typed_String_Decl);
package Bare_Typed_String_Decl_Alloc is new Alloc
(Subtype_For_Typed_String_Decl, Access_To_Subtype_For_Typed_String_Decl);
function Allocate_Typed_String_Decl
(Pool : Bump_Ptr_Pool) return Bare_Typed_String_Decl;
function Allocate_Typed_String_Decl
(Pool : Bump_Ptr_Pool) return Bare_Typed_String_Decl
is
Result : constant Access_To_Subtype_For_Typed_String_Decl := Bare_Typed_String_Decl_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Typed_String_Decl;
return Bare_Typed_String_Decl (Result);
end Allocate_Typed_String_Decl;
package Bare_Variable_Decl_Memos is new Gpr_Parser_Support.Packrat
(Bare_Variable_Decl, Token_Index);
subtype Subtype_For_Variable_Decl is
Root_Node_Record (Gpr_Variable_Decl);
type Access_To_Subtype_For_Variable_Decl is access all Subtype_For_Variable_Decl;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Variable_Decl);
package Bare_Variable_Decl_Alloc is new Alloc
(Subtype_For_Variable_Decl, Access_To_Subtype_For_Variable_Decl);
function Allocate_Variable_Decl
(Pool : Bump_Ptr_Pool) return Bare_Variable_Decl;
function Allocate_Variable_Decl
(Pool : Bump_Ptr_Pool) return Bare_Variable_Decl
is
Result : constant Access_To_Subtype_For_Variable_Decl := Bare_Variable_Decl_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Variable_Decl;
return Bare_Variable_Decl (Result);
end Allocate_Variable_Decl;
package Bare_Variable_Reference_Memos is new Gpr_Parser_Support.Packrat
(Bare_Variable_Reference, Token_Index);
subtype Subtype_For_Variable_Reference is
Root_Node_Record (Gpr_Variable_Reference);
type Access_To_Subtype_For_Variable_Reference is access all Subtype_For_Variable_Reference;
pragma No_Strict_Aliasing (Access_To_Subtype_For_Variable_Reference);
package Bare_Variable_Reference_Alloc is new Alloc
(Subtype_For_Variable_Reference, Access_To_Subtype_For_Variable_Reference);
function Allocate_Variable_Reference
(Pool : Bump_Ptr_Pool) return Bare_Variable_Reference;
function Allocate_Variable_Reference
(Pool : Bump_Ptr_Pool) return Bare_Variable_Reference
is
Result : constant Access_To_Subtype_For_Variable_Reference := Bare_Variable_Reference_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_Variable_Reference;
return Bare_Variable_Reference (Result);
end Allocate_Variable_Reference;
package Bare_With_Decl_Memos is new Gpr_Parser_Support.Packrat
(Bare_With_Decl, Token_Index);
subtype Subtype_For_With_Decl is
Root_Node_Record (Gpr_With_Decl);
type Access_To_Subtype_For_With_Decl is access all Subtype_For_With_Decl;
pragma No_Strict_Aliasing (Access_To_Subtype_For_With_Decl);
package Bare_With_Decl_Alloc is new Alloc
(Subtype_For_With_Decl, Access_To_Subtype_For_With_Decl);
function Allocate_With_Decl
(Pool : Bump_Ptr_Pool) return Bare_With_Decl;
function Allocate_With_Decl
(Pool : Bump_Ptr_Pool) return Bare_With_Decl
is
Result : constant Access_To_Subtype_For_With_Decl := Bare_With_Decl_Alloc.Alloc (Pool);
Result_Kind : Gpr_Node_Kind_Type
with Import, Address => Result.Kind'Address;
-- Result.Kind is a discriminant, so we can't modify it directly.
-- We need to initialize it manually, though, as we don't use a
-- standard Ada allocator for nodes. Use an overlay to workaround
-- Ada's restrictions.
begin
Result_Kind := Gpr_With_Decl;
return Bare_With_Decl (Result);
end Allocate_With_Decl;
pragma Warnings (On, "is not referenced");
type Dontskip_Parser_Function is access function
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Gpr_Node;
package Dont_Skip_Fn_Vectors
is new Ada.Containers.Vectors (Natural, Dontskip_Parser_Function);
type Free_Parse_List_Record;
type Free_Parse_List is access all Free_Parse_List_Record;
-- Cache of temporary lists of AST nodes used in List parsers
type Free_Parse_List_Record is record
Nodes : Bare_Gpr_Node_Vectors.Vector;
Next : Free_Parse_List;
end record;
type Parser_Private_Part_Type is record
Parse_Lists : Free_Parse_List;
Associative_Array_Index_Or_Parse0_Memo : Bare_Gpr_Node_Memos.Memo_Type;
Attribute_Decl_Transform_Parse0_Memo : Bare_Attribute_Decl_Memos.Memo_Type;
Attribute_Reference_Transform_Parse0_Memo : Bare_Attribute_Reference_Memos.Memo_Type;
Builtin_Function_Call_Transform_Parse0_Memo : Bare_Builtin_Function_Call_Memos.Memo_Type;
Case_Construction_Transform_Parse0_Memo : Bare_Case_Construction_Memos.Memo_Type;
Case_Item_Transform_Parse0_Memo : Bare_Case_Item_Memos.Memo_Type;
Choice_Or_Parse0_Memo : Bare_Gpr_Node_Memos.Memo_Type;
Compilation_Unit_Transform_Parse0_Memo : Bare_Compilation_Unit_Memos.Memo_Type;
Context_Clauses_List_Parse0_Memo : Bare_With_Decl_List_Memos.Memo_Type;
Declarative_Item_Or_Parse0_Memo : Bare_Gpr_Node_Memos.Memo_Type;
Declarative_Items_List_Parse0_Memo : Bare_Gpr_Node_List_Memos.Memo_Type;
Discrete_Choice_List_List_Parse0_Memo : Bare_Choices_Memos.Memo_Type;
Empty_Declaration_Transform_Parse0_Memo : Bare_Empty_Decl_Memos.Memo_Type;
Expression_List_Parse0_Memo : Bare_Term_List_Memos.Memo_Type;
Expression_List_Transform_Parse0_Memo : Bare_Terms_Memos.Memo_Type;
Identifier_Transform_Parse0_Memo : Bare_Identifier_Memos.Memo_Type;
Num_Literal_Transform_Parse0_Memo : Bare_Num_Literal_Memos.Memo_Type;
Others_Designator_Transform_Parse0_Memo : Bare_Others_Designator_Memos.Memo_Type;
Package_Decl_Transform_Parse0_Memo : Bare_Package_Decl_Memos.Memo_Type;
Package_Extension_Transform_Parse0_Memo : Bare_Package_Extension_Memos.Memo_Type;
Package_Renaming_Transform_Parse0_Memo : Bare_Package_Renaming_Memos.Memo_Type;
Package_Spec_Transform_Parse0_Memo : Bare_Package_Spec_Memos.Memo_Type;
Project_Declaration_Transform_Parse0_Memo : Bare_Project_Declaration_Memos.Memo_Type;
Project_Extension_Transform_Parse0_Memo : Bare_Project_Extension_Memos.Memo_Type;
Project_Qualifier_Or_Parse0_Memo : Bare_Project_Qualifier_Memos.Memo_Type;
Project_Transform_Parse0_Memo : Bare_Project_Memos.Memo_Type;
Simple_Declarative_Item_Or_Parse0_Memo : Bare_Gpr_Node_Memos.Memo_Type;
Simple_Declarative_Items_List_Parse0_Memo : Bare_Gpr_Node_List_Memos.Memo_Type;
Static_Name_Or_Parse0_Memo : Bare_Expr_Memos.Memo_Type;
String_Literal_At_Transform_Parse0_Memo : Bare_String_Literal_At_Memos.Memo_Type;
String_Literal_Transform_Parse0_Memo : Bare_String_Literal_Memos.Memo_Type;
Term_Or_Parse0_Memo : Bare_Gpr_Node_Memos.Memo_Type;
Type_Reference_Transform_Parse0_Memo : Bare_Type_Reference_Memos.Memo_Type;
Typed_String_Decl_Transform_Parse0_Memo : Bare_Typed_String_Decl_Memos.Memo_Type;
Variable_Decl_Transform_Parse0_Memo : Bare_Variable_Decl_Memos.Memo_Type;
Variable_Reference_Transform_Parse0_Memo : Bare_Variable_Reference_Memos.Memo_Type;
With_Decl_Transform_Parse0_Memo : Bare_With_Decl_Memos.Memo_Type;
Dont_Skip : Dont_Skip_Fn_Vectors.Vector;
end record;
function Associative_Array_Index_Or_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Gpr_Node;
function Attribute_Decl_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Attribute_Decl;
function Attribute_Reference_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Attribute_Reference;
function Builtin_Function_Call_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Builtin_Function_Call;
function Case_Construction_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Case_Construction;
function Case_Item_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Case_Item;
function Choice_Or_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Gpr_Node;
function Compilation_Unit_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Compilation_Unit;
function Context_Clauses_List_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_With_Decl_List;
function Declarative_Item_Or_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Gpr_Node;
function Declarative_Items_List_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Gpr_Node_List;
function Discrete_Choice_List_List_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Choices;
function Empty_Declaration_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Empty_Decl;
function Expression_List_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Term_List;
function Expression_List_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Terms;
function Identifier_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Identifier;
function Num_Literal_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Num_Literal;
function Others_Designator_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Others_Designator;
function Package_Decl_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Package_Decl;
function Package_Extension_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Package_Extension;
function Package_Renaming_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Package_Renaming;
function Package_Spec_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Package_Spec;
function Project_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Project;
function Project_Declaration_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Project_Declaration;
function Project_Extension_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Project_Extension;
function Project_Qualifier_Or_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Project_Qualifier;
function Simple_Declarative_Item_Or_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Gpr_Node;
function Simple_Declarative_Items_List_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Gpr_Node_List;
function Static_Name_Or_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Expr;
function String_Literal_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_String_Literal;
function String_Literal_At_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_String_Literal_At;
function Term_Or_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Gpr_Node;
function Type_Reference_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Type_Reference;
function Typed_String_Decl_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Typed_String_Decl;
function Variable_Decl_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Variable_Decl;
function Variable_Reference_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Variable_Reference;
function With_Decl_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_With_Decl;
procedure Process_Parsing_Error
(Parser : in out Parser_Type;
Check_Complete : Boolean := True);
-- Helper for the user parsing function, to be called after a low-level
-- parsing function. Check_Complete has the same semantics as in Parse. If
-- the parsing failed (Parser.Current_Pos = No_Token_Index), append
-- corresponding diagnostics to Parser.Diagnostics, do nothing instead.
procedure Add_Last_Fail_Diagnostic (Parser : in out Parser_Type);
-- Add a diagnostic for the last fail position of the parser
pragma Warnings (Off, "is not referenced");
function Get_Parse_List (Parser : Parser_Type) return Free_Parse_List;
-- Get a free parse list, or allocate one if there is no free parse list in
-- Parser. When done with the result, the caller must invoke
-- Release_Parse_List.
procedure Release_Parse_List
(Parser : Parser_Type; List : in out Free_Parse_List);
-- Release a parse list, putting it in Parsers' free list. Set List to
-- null.
procedure Initialize_List
(Self : Bare_Base_List;
Parser : Parser_Type;
Count : Natural);
-- Helper for parsers, to initialize the list of children in a freshly
-- allocated list node.
pragma Warnings (On, "is not referenced");
---------------------
-- Initialize_List --
---------------------
procedure Initialize_List
(Self : Bare_Base_List;
Parser : Parser_Type;
Count : Natural) is
begin
Self.Count := Count;
Self.Nodes := Alloc_AST_List_Array.Alloc (Parser.Mem_Pool, 0);
end Initialize_List;
-----------------
-- Init_Parser --
-----------------
procedure Init_Parser
(Input : Internal_Lexer_Input;
With_Trivia : Boolean;
Unit : access Implementation.Analysis_Unit_Type;
TDH : Token_Data_Handler_Access;
Parser : in out Parser_Type)
is
-- Never try to use file readers for internal units: these are generally
-- not actual source files, and file readers, which are external users
-- of the generated library, have no reason to be aware of them.
FR : constant Internal_File_Reader_Access :=
(if Unit.Is_Internal
then null
else Unit.Context.File_Reader);
begin
Reset (Parser);
Extract_Tokens (Input, With_Trivia, FR, TDH.all, Parser.Diagnostics);
Parser.Unit := Unit;
Parser.TDH := TDH;
end Init_Parser;
------------------------------
-- Add_Last_Fail_Diagnostic --
------------------------------
procedure Add_Last_Fail_Diagnostic (Parser : in out Parser_Type)
is
Last_Token : Stored_Token_Data renames
Get_Token (Parser.TDH.all, Parser.Last_Fail.Pos);
D : constant Diagnostic :=
(if Parser.Last_Fail.Kind = Token_Fail then
Create (Sloc_Range (Parser.TDH.all, Last_Token), To_Text
("Expected "
& Token_Error_Image (Parser.Last_Fail.Expected_Token_Id)
& ", got "
& Token_Error_Image (Parser.Last_Fail.Found_Token_Id)))
else
Create (Sloc_Range (Parser.TDH.all, Last_Token),
To_Text (Parser.Last_Fail.Custom_Message.all)));
begin
Parser.Diagnostics.Append (D);
end Add_Last_Fail_Diagnostic;
---------------------------
-- Process_Parsing_Error --
---------------------------
procedure Process_Parsing_Error
(Parser : in out Parser_Type;
Check_Complete : Boolean := True) is
begin
if Parser.Current_Pos = No_Token_Index then
Add_Last_Fail_Diagnostic (Parser);
elsif Check_Complete
and then Parser.Current_Pos /= Last_Token (Parser.TDH.all)
then
-- If the fail pos is the current position of the parser or after,
-- it means that the longest parse is the correct result, and that we
-- have some garbage afterwards.
if Parser.Current_Pos >= Parser.Last_Fail.Pos then
declare
First_Garbage_Token : Stored_Token_Data renames
Get_Token (Parser.TDH.all, Parser.Current_Pos);
begin
Append
(Parser.Diagnostics,
Sloc_Range (Parser.TDH.all, First_Garbage_Token),
To_Text
("End of input expected, got """
& Token_Kind_Name
(To_Token_Kind (First_Garbage_Token.Kind))
& """"));
end;
-- Else, the last fail pos is further down the line, and we want to
-- have the diagnostic of what exactly failed.
else
Add_Last_Fail_Diagnostic (Parser);
end if;
end if;
end Process_Parsing_Error;
-----------
-- Parse --
-----------
function Parse
(Parser : in out Parser_Type;
Check_Complete : Boolean := True;
Rule : Grammar_Rule) return Parsed_Node
is
Result : Bare_Gpr_Node;
begin
case Rule is
when Project_Qualifier_Rule =>
Result := Project_Qualifier_Or_Parse0
(Parser, First_Token_Index);
when Project_Extension_Rule =>
Result := Project_Extension_Transform_Parse0
(Parser, First_Token_Index);
when Project_Declaration_Rule =>
Result := Project_Declaration_Transform_Parse0
(Parser, First_Token_Index);
when Project_Rule =>
Result := Project_Transform_Parse0
(Parser, First_Token_Index);
when Declarative_Items_Rule =>
Result := Declarative_Items_List_Parse0
(Parser, First_Token_Index);
when Declarative_Item_Rule =>
Result := Declarative_Item_Or_Parse0
(Parser, First_Token_Index);
when Simple_Declarative_Items_Rule =>
Result := Simple_Declarative_Items_List_Parse0
(Parser, First_Token_Index);
when Simple_Declarative_Item_Rule =>
Result := Simple_Declarative_Item_Or_Parse0
(Parser, First_Token_Index);
when Variable_Decl_Rule =>
Result := Variable_Decl_Transform_Parse0
(Parser, First_Token_Index);
when Attribute_Decl_Rule =>
Result := Attribute_Decl_Transform_Parse0
(Parser, First_Token_Index);
when Associative_Array_Index_Rule =>
Result := Associative_Array_Index_Or_Parse0
(Parser, First_Token_Index);
when Package_Decl_Rule =>
Result := Package_Decl_Transform_Parse0
(Parser, First_Token_Index);
when Package_Renaming_Rule =>
Result := Package_Renaming_Transform_Parse0
(Parser, First_Token_Index);
when Package_Extension_Rule =>
Result := Package_Extension_Transform_Parse0
(Parser, First_Token_Index);
when Package_Spec_Rule =>
Result := Package_Spec_Transform_Parse0
(Parser, First_Token_Index);
when Empty_Declaration_Rule =>
Result := Empty_Declaration_Transform_Parse0
(Parser, First_Token_Index);
when Case_Construction_Rule =>
Result := Case_Construction_Transform_Parse0
(Parser, First_Token_Index);
when Case_Item_Rule =>
Result := Case_Item_Transform_Parse0
(Parser, First_Token_Index);
when Others_Designator_Rule =>
Result := Others_Designator_Transform_Parse0
(Parser, First_Token_Index);
when Choice_Rule =>
Result := Choice_Or_Parse0
(Parser, First_Token_Index);
when Discrete_Choice_List_Rule =>
Result := Discrete_Choice_List_List_Parse0
(Parser, First_Token_Index);
when With_Decl_Rule =>
Result := With_Decl_Transform_Parse0
(Parser, First_Token_Index);
when Context_Clauses_Rule =>
Result := Context_Clauses_List_Parse0
(Parser, First_Token_Index);
when Typed_String_Decl_Rule =>
Result := Typed_String_Decl_Transform_Parse0
(Parser, First_Token_Index);
when Identifier_Rule =>
Result := Identifier_Transform_Parse0
(Parser, First_Token_Index);
when String_Literal_Rule =>
Result := String_Literal_Transform_Parse0
(Parser, First_Token_Index);
when Num_Literal_Rule =>
Result := Num_Literal_Transform_Parse0
(Parser, First_Token_Index);
when Static_Name_Rule =>
Result := Static_Name_Or_Parse0
(Parser, First_Token_Index);
when Attribute_Reference_Rule =>
Result := Attribute_Reference_Transform_Parse0
(Parser, First_Token_Index);
when Variable_Reference_Rule =>
Result := Variable_Reference_Transform_Parse0
(Parser, First_Token_Index);
when Type_Reference_Rule =>
Result := Type_Reference_Transform_Parse0
(Parser, First_Token_Index);
when Builtin_Function_Call_Rule =>
Result := Builtin_Function_Call_Transform_Parse0
(Parser, First_Token_Index);
when Expression_Rule =>
Result := Expression_List_Parse0
(Parser, First_Token_Index);
when Expression_List_Rule =>
Result := Expression_List_Transform_Parse0
(Parser, First_Token_Index);
when String_Literal_At_Rule =>
Result := String_Literal_At_Transform_Parse0
(Parser, First_Token_Index);
when Term_Rule =>
Result := Term_Or_Parse0
(Parser, First_Token_Index);
when Compilation_Unit_Rule =>
Result := Compilation_Unit_Transform_Parse0
(Parser, First_Token_Index);
end case;
Process_Parsing_Error (Parser, Check_Complete);
Set_Parents (Result, null);
return Parsed_Node (Result);
exception
when Exc : Property_Error =>
Append
(Parser.Diagnostics,
No_Source_Location_Range,
To_Text ("Error during parsing: "
& Ada.Exceptions.Exception_Message (Exc)));
return Parsed_Node (No_Bare_Gpr_Node);
end Parse;
function Associative_Array_Index_Or_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Gpr_Node
is
use Bare_Gpr_Node_Memos;
Defer_Pos0 :
Token_Index
:= No_Token_Index;
Defer_Res0 :
Bare_Others_Designator
:= No_Bare_Gpr_Node;
Defer_Pos1 :
Token_Index
:= No_Token_Index;
Defer_Res1 :
Bare_String_Literal_At
:= No_Bare_Gpr_Node;
Or_Pos0 :
Token_Index
:= No_Token_Index;
Or_Res0 :
Bare_Gpr_Node
:= No_Bare_Gpr_Node;
M : Memo_Entry := Get (Parser.Private_Part.Associative_Array_Index_Or_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Or_Res0 := M.Instance;
return Or_Res0;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Or_Res0;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start or_code
Or_Pos0 := No_Token_Index;
Or_Res0 := No_Bare_Gpr_Node;
Defer_Res0 :=
Others_Designator_Transform_Parse0 (Parser, Pos);
Defer_Pos0 := Parser.Current_Pos;
if Defer_Pos0 /= No_Token_Index then
Or_Pos0 := Defer_Pos0;
Or_Res0 := Defer_Res0;
goto Exit_Or0;
end if;
Defer_Res1 :=
String_Literal_At_Transform_Parse0 (Parser, Pos);
Defer_Pos1 := Parser.Current_Pos;
if Defer_Pos1 /= No_Token_Index then
Or_Pos0 := Defer_Pos1;
Or_Res0 := Defer_Res1;
goto Exit_Or0;
end if;
<<Exit_Or0>>
-- End or_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Associative_Array_Index_Or_Parse0_Memo,
Or_Pos0 /= No_Token_Index,
Or_Res0,
Pos,
Or_Pos0);
Parser.Current_Pos := Or_Pos0;
return Or_Res0;
end Associative_Array_Index_Or_Parse0;
function Attribute_Decl_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Attribute_Decl
is
use Bare_Attribute_Decl_Memos;
Row_Pos0 :
Token_Index
:= No_Token_Index;
Token_Pos0 :
Token_Index
:= No_Token_Index;
Token_Res0 :
Token_Index
:= No_Token_Index;
Defer_Pos2 :
Token_Index
:= No_Token_Index;
Defer_Res2 :
Bare_Identifier
:= No_Bare_Gpr_Node;
Row_Pos1 :
Token_Index
:= No_Token_Index;
Token_Pos1 :
Token_Index
:= No_Token_Index;
Token_Res1 :
Token_Index
:= No_Token_Index;
Defer_Pos3 :
Token_Index
:= No_Token_Index;
Defer_Res3 :
Bare_Gpr_Node
:= No_Bare_Gpr_Node;
Token_Pos2 :
Token_Index
:= No_Token_Index;
Token_Res2 :
Token_Index
:= No_Token_Index;
Token_Pos3 :
Token_Index
:= No_Token_Index;
Token_Res3 :
Token_Index
:= No_Token_Index;
Defer_Pos4 :
Token_Index
:= No_Token_Index;
Defer_Res4 :
Bare_Term_List
:= No_Bare_Gpr_Node;
Token_Pos4 :
Token_Index
:= No_Token_Index;
Token_Res4 :
Token_Index
:= No_Token_Index;
Transform_Res0 :
Bare_Attribute_Decl
:= No_Bare_Gpr_Node;
Transform_Diags0 :
Ada.Containers.Count_Type;
M : Memo_Entry := Get (Parser.Private_Part.Attribute_Decl_Transform_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Transform_Res0 := M.Instance;
return Transform_Res0;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Transform_Res0;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start transform_code
Transform_Diags0 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos0 := Pos;
-- Start tok_code
Token_Res0 := Row_Pos0;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res0));
begin
if
T.Kind /= From_Token_Kind (Gpr_For)
then
Token_Pos0 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos0 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos0,
Expected_Token_Id => Gpr_For,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos0 := Row_Pos0 + 1;
end if;
end;
-- End tok_code
if Token_Pos0 /= No_Token_Index then
Row_Pos0 := Token_Pos0;
else
Row_Pos0 := No_Token_Index;
goto Exit_Row0_0;
end if;
Defer_Res2 :=
Identifier_Transform_Parse0 (Parser, Row_Pos0);
Defer_Pos2 := Parser.Current_Pos;
if Defer_Pos2 /= No_Token_Index then
Row_Pos0 := Defer_Pos2;
else
Row_Pos0 := No_Token_Index;
goto Exit_Row0_0;
end if;
-- Start opt_code
-- Start row_code
Row_Pos1 := Row_Pos0;
-- Start tok_code
Token_Res1 := Row_Pos1;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res1));
begin
if
T.Kind /= From_Token_Kind (Gpr_Par_Open)
then
Token_Pos1 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos1 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos1,
Expected_Token_Id => Gpr_Par_Open,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos1 := Row_Pos1 + 1;
end if;
end;
-- End tok_code
if Token_Pos1 /= No_Token_Index then
Row_Pos1 := Token_Pos1;
else
Row_Pos1 := No_Token_Index;
goto Exit_Row1_0;
end if;
Defer_Res3 :=
Associative_Array_Index_Or_Parse0 (Parser, Row_Pos1);
Defer_Pos3 := Parser.Current_Pos;
if Defer_Pos3 /= No_Token_Index then
Row_Pos1 := Defer_Pos3;
else
Row_Pos1 := No_Token_Index;
goto Exit_Row1_0;
end if;
-- Start tok_code
Token_Res2 := Row_Pos1;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res2));
begin
if
T.Kind /= From_Token_Kind (Gpr_Par_Close)
then
Token_Pos2 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos1 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos1,
Expected_Token_Id => Gpr_Par_Close,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos2 := Row_Pos1 + 1;
end if;
end;
-- End tok_code
if Token_Pos2 /= No_Token_Index then
Row_Pos1 := Token_Pos2;
else
Row_Pos1 := No_Token_Index;
goto Exit_Row1_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row1_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos1 = No_Token_Index then
Defer_Res3 := No_Bare_Gpr_Node;
Row_Pos1 := Row_Pos0;
end if;
-- End opt_code
if Row_Pos1 /= No_Token_Index then
Row_Pos0 := Row_Pos1;
else
Row_Pos0 := No_Token_Index;
goto Exit_Row0_0;
end if;
-- Start tok_code
Token_Res3 := Row_Pos0;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res3));
begin
if
T.Kind /= From_Token_Kind (Gpr_Use)
then
Token_Pos3 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos0 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos0,
Expected_Token_Id => Gpr_Use,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos3 := Row_Pos0 + 1;
end if;
end;
-- End tok_code
if Token_Pos3 /= No_Token_Index then
Row_Pos0 := Token_Pos3;
else
Row_Pos0 := No_Token_Index;
goto Exit_Row0_0;
end if;
Defer_Res4 :=
Expression_List_Parse0 (Parser, Row_Pos0);
Defer_Pos4 := Parser.Current_Pos;
if Defer_Pos4 /= No_Token_Index then
Row_Pos0 := Defer_Pos4;
else
Row_Pos0 := No_Token_Index;
goto Exit_Row0_0;
end if;
-- Start tok_code
Token_Res4 := Row_Pos0;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res4));
begin
if
T.Kind /= From_Token_Kind (Gpr_Semicolon)
then
Token_Pos4 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos0 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos0,
Expected_Token_Id => Gpr_Semicolon,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos4 := Row_Pos0 + 1;
end if;
end;
-- End tok_code
if Token_Pos4 /= No_Token_Index then
Row_Pos0 := Token_Pos4;
else
Row_Pos0 := No_Token_Index;
goto Exit_Row0_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row0_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos0 /= No_Token_Index then
Transform_Res0 := Allocate_Attribute_Decl (Parser.Mem_Pool);
Initialize
(Self => Transform_Res0,
Kind => Gpr_Attribute_Decl,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos0 = Pos
then No_Token_Index
else Row_Pos0 - 1));
Initialize_Fields_For_Attribute_Decl
(Self => Transform_Res0, Attribute_Decl_F_Attr_Name => Defer_Res2, Attribute_Decl_F_Attr_Index => Defer_Res3, Attribute_Decl_F_Expr => Defer_Res4);
if Defer_Res2 /= null and then Is_Incomplete (Defer_Res2) then
Transform_Res0.Last_Attempted_Child := 0;
elsif Defer_Res2 /= null and then not Is_Ghost (Defer_Res2) then
Transform_Res0.Last_Attempted_Child := -1;
end if;
if Defer_Res3 /= null and then Is_Incomplete (Defer_Res3) then
Transform_Res0.Last_Attempted_Child := 0;
elsif Defer_Res3 /= null and then not Is_Ghost (Defer_Res3) then
Transform_Res0.Last_Attempted_Child := -1;
end if;
if Defer_Res4 /= null and then Is_Incomplete (Defer_Res4) then
Transform_Res0.Last_Attempted_Child := 0;
elsif Defer_Res4 /= null and then not Is_Ghost (Defer_Res4) then
Transform_Res0.Last_Attempted_Child := -1;
end if;
elsif Row_Pos0 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags0);
end if;
-- End transform_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Attribute_Decl_Transform_Parse0_Memo,
Row_Pos0 /= No_Token_Index,
Transform_Res0,
Pos,
Row_Pos0);
Parser.Current_Pos := Row_Pos0;
return Transform_Res0;
end Attribute_Decl_Transform_Parse0;
function Attribute_Reference_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Attribute_Reference
is
use Bare_Attribute_Reference_Memos;
Row_Pos2 :
Token_Index
:= No_Token_Index;
Defer_Pos5 :
Token_Index
:= No_Token_Index;
Defer_Res5 :
Bare_Identifier
:= No_Bare_Gpr_Node;
Row_Pos3 :
Token_Index
:= No_Token_Index;
Token_Pos5 :
Token_Index
:= No_Token_Index;
Token_Res5 :
Token_Index
:= No_Token_Index;
Defer_Pos6 :
Token_Index
:= No_Token_Index;
Defer_Res6 :
Bare_Others_Designator
:= No_Bare_Gpr_Node;
Defer_Pos7 :
Token_Index
:= No_Token_Index;
Defer_Res7 :
Bare_String_Literal
:= No_Bare_Gpr_Node;
Or_Pos1 :
Token_Index
:= No_Token_Index;
Or_Res1 :
Bare_Gpr_Node
:= No_Bare_Gpr_Node;
Token_Pos6 :
Token_Index
:= No_Token_Index;
Token_Res6 :
Token_Index
:= No_Token_Index;
Transform_Res1 :
Bare_Attribute_Reference
:= No_Bare_Gpr_Node;
Transform_Diags1 :
Ada.Containers.Count_Type;
M : Memo_Entry := Get (Parser.Private_Part.Attribute_Reference_Transform_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Transform_Res1 := M.Instance;
return Transform_Res1;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Transform_Res1;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start transform_code
Transform_Diags1 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos2 := Pos;
Defer_Res5 :=
Identifier_Transform_Parse0 (Parser, Row_Pos2);
Defer_Pos5 := Parser.Current_Pos;
if Defer_Pos5 /= No_Token_Index then
Row_Pos2 := Defer_Pos5;
else
Row_Pos2 := No_Token_Index;
goto Exit_Row2_0;
end if;
-- Start opt_code
-- Start row_code
Row_Pos3 := Row_Pos2;
-- Start tok_code
Token_Res5 := Row_Pos3;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res5));
begin
if
T.Kind /= From_Token_Kind (Gpr_Par_Open)
then
Token_Pos5 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos3 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos3,
Expected_Token_Id => Gpr_Par_Open,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos5 := Row_Pos3 + 1;
end if;
end;
-- End tok_code
if Token_Pos5 /= No_Token_Index then
Row_Pos3 := Token_Pos5;
else
Row_Pos3 := No_Token_Index;
goto Exit_Row3_0;
end if;
-- Start or_code
Or_Pos1 := No_Token_Index;
Or_Res1 := No_Bare_Gpr_Node;
Defer_Res6 :=
Others_Designator_Transform_Parse0 (Parser, Row_Pos3);
Defer_Pos6 := Parser.Current_Pos;
if Defer_Pos6 /= No_Token_Index then
Or_Pos1 := Defer_Pos6;
Or_Res1 := Defer_Res6;
goto Exit_Or1;
end if;
Defer_Res7 :=
String_Literal_Transform_Parse0 (Parser, Row_Pos3);
Defer_Pos7 := Parser.Current_Pos;
if Defer_Pos7 /= No_Token_Index then
Or_Pos1 := Defer_Pos7;
Or_Res1 := Defer_Res7;
goto Exit_Or1;
end if;
<<Exit_Or1>>
-- End or_code
if Or_Pos1 /= No_Token_Index then
Row_Pos3 := Or_Pos1;
else
Row_Pos3 := No_Token_Index;
goto Exit_Row3_0;
end if;
-- Start tok_code
Token_Res6 := Row_Pos3;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res6));
begin
if
T.Kind /= From_Token_Kind (Gpr_Par_Close)
then
Token_Pos6 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos3 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos3,
Expected_Token_Id => Gpr_Par_Close,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos6 := Row_Pos3 + 1;
end if;
end;
-- End tok_code
if Token_Pos6 /= No_Token_Index then
Row_Pos3 := Token_Pos6;
else
Row_Pos3 := No_Token_Index;
goto Exit_Row3_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row3_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos3 = No_Token_Index then
Or_Res1 := No_Bare_Gpr_Node;
Row_Pos3 := Row_Pos2;
end if;
-- End opt_code
if Row_Pos3 /= No_Token_Index then
Row_Pos2 := Row_Pos3;
else
Row_Pos2 := No_Token_Index;
goto Exit_Row2_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row2_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos2 /= No_Token_Index then
Transform_Res1 := Allocate_Attribute_Reference (Parser.Mem_Pool);
Initialize
(Self => Transform_Res1,
Kind => Gpr_Attribute_Reference,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos2 = Pos
then No_Token_Index
else Row_Pos2 - 1));
Initialize_Fields_For_Attribute_Reference
(Self => Transform_Res1, Attribute_Reference_F_Attribute_Name => Defer_Res5, Attribute_Reference_F_Attribute_Index => Or_Res1);
if Defer_Res5 /= null and then Is_Incomplete (Defer_Res5) then
Transform_Res1.Last_Attempted_Child := 0;
elsif Defer_Res5 /= null and then not Is_Ghost (Defer_Res5) then
Transform_Res1.Last_Attempted_Child := -1;
end if;
if Or_Res1 /= null and then Is_Incomplete (Or_Res1) then
Transform_Res1.Last_Attempted_Child := 0;
elsif Or_Res1 /= null and then not Is_Ghost (Or_Res1) then
Transform_Res1.Last_Attempted_Child := -1;
end if;
elsif Row_Pos2 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags1);
end if;
-- End transform_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Attribute_Reference_Transform_Parse0_Memo,
Row_Pos2 /= No_Token_Index,
Transform_Res1,
Pos,
Row_Pos2);
Parser.Current_Pos := Row_Pos2;
return Transform_Res1;
end Attribute_Reference_Transform_Parse0;
function Builtin_Function_Call_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Builtin_Function_Call
is
use Bare_Builtin_Function_Call_Memos;
Row_Pos4 :
Token_Index
:= No_Token_Index;
Defer_Pos8 :
Token_Index
:= No_Token_Index;
Defer_Res8 :
Bare_Identifier
:= No_Bare_Gpr_Node;
Defer_Pos9 :
Token_Index
:= No_Token_Index;
Defer_Res9 :
Bare_Terms
:= No_Bare_Gpr_Node;
Transform_Res2 :
Bare_Builtin_Function_Call
:= No_Bare_Gpr_Node;
Transform_Diags2 :
Ada.Containers.Count_Type;
M : Memo_Entry := Get (Parser.Private_Part.Builtin_Function_Call_Transform_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Transform_Res2 := M.Instance;
return Transform_Res2;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Transform_Res2;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start transform_code
Transform_Diags2 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos4 := Pos;
Defer_Res8 :=
Identifier_Transform_Parse0 (Parser, Row_Pos4);
Defer_Pos8 := Parser.Current_Pos;
if Defer_Pos8 /= No_Token_Index then
Row_Pos4 := Defer_Pos8;
else
Row_Pos4 := No_Token_Index;
goto Exit_Row4_0;
end if;
Defer_Res9 :=
Expression_List_Transform_Parse0 (Parser, Row_Pos4);
Defer_Pos9 := Parser.Current_Pos;
if Defer_Pos9 /= No_Token_Index then
Row_Pos4 := Defer_Pos9;
else
Row_Pos4 := No_Token_Index;
goto Exit_Row4_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row4_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos4 /= No_Token_Index then
Transform_Res2 := Allocate_Builtin_Function_Call (Parser.Mem_Pool);
Initialize
(Self => Transform_Res2,
Kind => Gpr_Builtin_Function_Call,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos4 = Pos
then No_Token_Index
else Row_Pos4 - 1));
Initialize_Fields_For_Builtin_Function_Call
(Self => Transform_Res2, Builtin_Function_Call_F_Function_Name => Defer_Res8, Builtin_Function_Call_F_Parameters => Defer_Res9);
if Defer_Res8 /= null and then Is_Incomplete (Defer_Res8) then
Transform_Res2.Last_Attempted_Child := 0;
elsif Defer_Res8 /= null and then not Is_Ghost (Defer_Res8) then
Transform_Res2.Last_Attempted_Child := -1;
end if;
if Defer_Res9 /= null and then Is_Incomplete (Defer_Res9) then
Transform_Res2.Last_Attempted_Child := 0;
elsif Defer_Res9 /= null and then not Is_Ghost (Defer_Res9) then
Transform_Res2.Last_Attempted_Child := -1;
end if;
elsif Row_Pos4 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags2);
end if;
-- End transform_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Builtin_Function_Call_Transform_Parse0_Memo,
Row_Pos4 /= No_Token_Index,
Transform_Res2,
Pos,
Row_Pos4);
Parser.Current_Pos := Row_Pos4;
return Transform_Res2;
end Builtin_Function_Call_Transform_Parse0;
function Case_Construction_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Case_Construction
is
use Bare_Case_Construction_Memos;
Row_Pos5 :
Token_Index
:= No_Token_Index;
Token_Pos7 :
Token_Index
:= No_Token_Index;
Token_Res7 :
Token_Index
:= No_Token_Index;
Defer_Pos10 :
Token_Index
:= No_Token_Index;
Defer_Res10 :
Bare_Variable_Reference
:= No_Bare_Gpr_Node;
Token_Pos8 :
Token_Index
:= No_Token_Index;
Token_Res8 :
Token_Index
:= No_Token_Index;
Lst_Cpos0 :
Token_Index
:= No_Token_Index;
Tmp_List0 :
Free_Parse_List;
Defer_Pos11 :
Token_Index
:= No_Token_Index;
Defer_Res11 :
Bare_Case_Item
:= No_Bare_Gpr_Node;
List_Pos0 :
Token_Index
:= No_Token_Index;
List_Res0 :
Bare_Case_Item_List
:= No_Bare_Gpr_Node;
Token_Pos9 :
Token_Index
:= No_Token_Index;
Token_Res9 :
Token_Index
:= No_Token_Index;
Token_Pos10 :
Token_Index
:= No_Token_Index;
Token_Res10 :
Token_Index
:= No_Token_Index;
Token_Pos11 :
Token_Index
:= No_Token_Index;
Token_Res11 :
Token_Index
:= No_Token_Index;
Transform_Res3 :
Bare_Case_Construction
:= No_Bare_Gpr_Node;
Transform_Diags3 :
Ada.Containers.Count_Type;
M : Memo_Entry := Get (Parser.Private_Part.Case_Construction_Transform_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Transform_Res3 := M.Instance;
return Transform_Res3;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Transform_Res3;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start transform_code
Transform_Diags3 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos5 := Pos;
-- Start tok_code
Token_Res7 := Row_Pos5;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res7));
begin
if
T.Kind /= From_Token_Kind (Gpr_Case)
then
Token_Pos7 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos5 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos5,
Expected_Token_Id => Gpr_Case,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos7 := Row_Pos5 + 1;
end if;
end;
-- End tok_code
if Token_Pos7 /= No_Token_Index then
Row_Pos5 := Token_Pos7;
else
Row_Pos5 := No_Token_Index;
goto Exit_Row5_0;
end if;
Defer_Res10 :=
Variable_Reference_Transform_Parse0 (Parser, Row_Pos5);
Defer_Pos10 := Parser.Current_Pos;
if Defer_Pos10 /= No_Token_Index then
Row_Pos5 := Defer_Pos10;
else
Row_Pos5 := No_Token_Index;
goto Exit_Row5_0;
end if;
-- Start tok_code
Token_Res8 := Row_Pos5;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res8));
begin
if
T.Kind /= From_Token_Kind (Gpr_Is)
then
Token_Pos8 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos5 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos5,
Expected_Token_Id => Gpr_Is,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos8 := Row_Pos5 + 1;
end if;
end;
-- End tok_code
if Token_Pos8 /= No_Token_Index then
Row_Pos5 := Token_Pos8;
else
Row_Pos5 := No_Token_Index;
goto Exit_Row5_0;
end if;
-- Start list_code
List_Pos0 := Row_Pos5;
Lst_Cpos0 := Row_Pos5;
Tmp_List0 := Get_Parse_List (Parser);
loop
Defer_Res11 :=
Case_Item_Transform_Parse0 (Parser, Lst_Cpos0);
Defer_Pos11 := Parser.Current_Pos;
exit when Defer_Pos11 = No_Token_Index;
List_Pos0 := Defer_Pos11;
Lst_Cpos0 := List_Pos0;
Tmp_List0.Nodes.Append (Defer_Res11);
end loop;
declare
Token_Start, Token_End : Token_Index;
Count : constant Natural := Tmp_List0.Nodes.Length;
begin
List_Res0 :=
Allocate_Case_Item_List (Parser.Mem_Pool);
if Count > 0 then
Token_Start := Row_Pos5;
Token_End := (if Lst_Cpos0 = Row_Pos5
then Row_Pos5
else Lst_Cpos0 - 1);
else
Token_Start := Token_Index'Max (Row_Pos5, 1);
Token_End := No_Token_Index;
end if;
Initialize
(Self => List_Res0,
Kind => Gpr_Case_Item_List,
Unit => Parser.Unit,
Token_Start_Index => Token_Start,
Token_End_Index => Token_End);
Initialize_List
(Self => List_Res0,
Parser => Parser,
Count => Count);
declare
Vec : Bare_Gpr_Node_Vectors.Vector renames
Tmp_List0.Nodes;
Arr : Alloc_AST_List_Array.Element_Array_Access renames
List_Res0.Nodes;
begin
Arr := Alloc_AST_List_Array.Alloc (Parser.Mem_Pool, Vec.Length);
for I in Vec.First_Index .. Vec.Last_Index loop
Arr (I) := Vec.Get (I);
end loop;
end;
end;
Release_Parse_List (Parser, Tmp_List0);
-- End list_code
if List_Pos0 /= No_Token_Index then
Row_Pos5 := List_Pos0;
else
Row_Pos5 := No_Token_Index;
goto Exit_Row5_0;
end if;
-- Start tok_code
Token_Res9 := Row_Pos5;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res9));
begin
if
T.Kind /= From_Token_Kind (Gpr_End)
then
Token_Pos9 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos5 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos5,
Expected_Token_Id => Gpr_End,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos9 := Row_Pos5 + 1;
end if;
end;
-- End tok_code
if Token_Pos9 /= No_Token_Index then
Row_Pos5 := Token_Pos9;
else
Row_Pos5 := No_Token_Index;
goto Exit_Row5_0;
end if;
-- Start tok_code
Token_Res10 := Row_Pos5;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res10));
begin
if
T.Kind /= From_Token_Kind (Gpr_Case)
then
Token_Pos10 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos5 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos5,
Expected_Token_Id => Gpr_Case,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos10 := Row_Pos5 + 1;
end if;
end;
-- End tok_code
if Token_Pos10 /= No_Token_Index then
Row_Pos5 := Token_Pos10;
else
Row_Pos5 := No_Token_Index;
goto Exit_Row5_0;
end if;
-- Start tok_code
Token_Res11 := Row_Pos5;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res11));
begin
if
T.Kind /= From_Token_Kind (Gpr_Semicolon)
then
Token_Pos11 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos5 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos5,
Expected_Token_Id => Gpr_Semicolon,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos11 := Row_Pos5 + 1;
end if;
end;
-- End tok_code
if Token_Pos11 /= No_Token_Index then
Row_Pos5 := Token_Pos11;
else
Row_Pos5 := No_Token_Index;
goto Exit_Row5_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row5_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos5 /= No_Token_Index then
Transform_Res3 := Allocate_Case_Construction (Parser.Mem_Pool);
Initialize
(Self => Transform_Res3,
Kind => Gpr_Case_Construction,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos5 = Pos
then No_Token_Index
else Row_Pos5 - 1));
Initialize_Fields_For_Case_Construction
(Self => Transform_Res3, Case_Construction_F_Var_Ref => Defer_Res10, Case_Construction_F_Items => List_Res0);
if Defer_Res10 /= null and then Is_Incomplete (Defer_Res10) then
Transform_Res3.Last_Attempted_Child := 0;
elsif Defer_Res10 /= null and then not Is_Ghost (Defer_Res10) then
Transform_Res3.Last_Attempted_Child := -1;
end if;
if List_Res0 /= null and then Is_Incomplete (List_Res0) then
Transform_Res3.Last_Attempted_Child := 0;
elsif List_Res0 /= null and then not Is_Ghost (List_Res0) then
Transform_Res3.Last_Attempted_Child := -1;
end if;
elsif Row_Pos5 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags3);
end if;
-- End transform_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Case_Construction_Transform_Parse0_Memo,
Row_Pos5 /= No_Token_Index,
Transform_Res3,
Pos,
Row_Pos5);
Parser.Current_Pos := Row_Pos5;
return Transform_Res3;
end Case_Construction_Transform_Parse0;
function Case_Item_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Case_Item
is
use Bare_Case_Item_Memos;
Row_Pos6 :
Token_Index
:= No_Token_Index;
Token_Pos12 :
Token_Index
:= No_Token_Index;
Token_Res12 :
Token_Index
:= No_Token_Index;
Defer_Pos12 :
Token_Index
:= No_Token_Index;
Defer_Res12 :
Bare_Choices
:= No_Bare_Gpr_Node;
Token_Pos13 :
Token_Index
:= No_Token_Index;
Token_Res13 :
Token_Index
:= No_Token_Index;
Defer_Pos13 :
Token_Index
:= No_Token_Index;
Defer_Res13 :
Bare_Gpr_Node_List
:= No_Bare_Gpr_Node;
Transform_Res4 :
Bare_Case_Item
:= No_Bare_Gpr_Node;
Transform_Diags4 :
Ada.Containers.Count_Type;
M : Memo_Entry := Get (Parser.Private_Part.Case_Item_Transform_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Transform_Res4 := M.Instance;
return Transform_Res4;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Transform_Res4;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start transform_code
Transform_Diags4 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos6 := Pos;
-- Start tok_code
Token_Res12 := Row_Pos6;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res12));
begin
if
T.Kind /= From_Token_Kind (Gpr_When)
then
Token_Pos12 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos6 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos6,
Expected_Token_Id => Gpr_When,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos12 := Row_Pos6 + 1;
end if;
end;
-- End tok_code
if Token_Pos12 /= No_Token_Index then
Row_Pos6 := Token_Pos12;
else
Row_Pos6 := No_Token_Index;
goto Exit_Row6_0;
end if;
Defer_Res12 :=
Discrete_Choice_List_List_Parse0 (Parser, Row_Pos6);
Defer_Pos12 := Parser.Current_Pos;
if Defer_Pos12 /= No_Token_Index then
Row_Pos6 := Defer_Pos12;
else
Row_Pos6 := No_Token_Index;
goto Exit_Row6_0;
end if;
-- Start tok_code
Token_Res13 := Row_Pos6;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res13));
begin
if
T.Kind /= From_Token_Kind (Gpr_Arrow)
then
Token_Pos13 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos6 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos6,
Expected_Token_Id => Gpr_Arrow,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos13 := Row_Pos6 + 1;
end if;
end;
-- End tok_code
if Token_Pos13 /= No_Token_Index then
Row_Pos6 := Token_Pos13;
else
Row_Pos6 := No_Token_Index;
goto Exit_Row6_0;
end if;
Defer_Res13 :=
Simple_Declarative_Items_List_Parse0 (Parser, Row_Pos6);
Defer_Pos13 := Parser.Current_Pos;
if Defer_Pos13 /= No_Token_Index then
Row_Pos6 := Defer_Pos13;
else
Row_Pos6 := No_Token_Index;
goto Exit_Row6_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row6_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos6 /= No_Token_Index then
Transform_Res4 := Allocate_Case_Item (Parser.Mem_Pool);
Initialize
(Self => Transform_Res4,
Kind => Gpr_Case_Item,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos6 = Pos
then No_Token_Index
else Row_Pos6 - 1));
Initialize_Fields_For_Case_Item
(Self => Transform_Res4, Case_Item_F_Choice => Defer_Res12, Case_Item_F_Decls => Defer_Res13);
if Defer_Res12 /= null and then Is_Incomplete (Defer_Res12) then
Transform_Res4.Last_Attempted_Child := 0;
elsif Defer_Res12 /= null and then not Is_Ghost (Defer_Res12) then
Transform_Res4.Last_Attempted_Child := -1;
end if;
if Defer_Res13 /= null and then Is_Incomplete (Defer_Res13) then
Transform_Res4.Last_Attempted_Child := 0;
elsif Defer_Res13 /= null and then not Is_Ghost (Defer_Res13) then
Transform_Res4.Last_Attempted_Child := -1;
end if;
elsif Row_Pos6 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags4);
end if;
-- End transform_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Case_Item_Transform_Parse0_Memo,
Row_Pos6 /= No_Token_Index,
Transform_Res4,
Pos,
Row_Pos6);
Parser.Current_Pos := Row_Pos6;
return Transform_Res4;
end Case_Item_Transform_Parse0;
function Choice_Or_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Gpr_Node
is
use Bare_Gpr_Node_Memos;
Defer_Pos14 :
Token_Index
:= No_Token_Index;
Defer_Res14 :
Bare_String_Literal
:= No_Bare_Gpr_Node;
Defer_Pos15 :
Token_Index
:= No_Token_Index;
Defer_Res15 :
Bare_Others_Designator
:= No_Bare_Gpr_Node;
Or_Pos2 :
Token_Index
:= No_Token_Index;
Or_Res2 :
Bare_Gpr_Node
:= No_Bare_Gpr_Node;
M : Memo_Entry := Get (Parser.Private_Part.Choice_Or_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Or_Res2 := M.Instance;
return Or_Res2;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Or_Res2;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start or_code
Or_Pos2 := No_Token_Index;
Or_Res2 := No_Bare_Gpr_Node;
Defer_Res14 :=
String_Literal_Transform_Parse0 (Parser, Pos);
Defer_Pos14 := Parser.Current_Pos;
if Defer_Pos14 /= No_Token_Index then
Or_Pos2 := Defer_Pos14;
Or_Res2 := Defer_Res14;
goto Exit_Or2;
end if;
Defer_Res15 :=
Others_Designator_Transform_Parse0 (Parser, Pos);
Defer_Pos15 := Parser.Current_Pos;
if Defer_Pos15 /= No_Token_Index then
Or_Pos2 := Defer_Pos15;
Or_Res2 := Defer_Res15;
goto Exit_Or2;
end if;
<<Exit_Or2>>
-- End or_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Choice_Or_Parse0_Memo,
Or_Pos2 /= No_Token_Index,
Or_Res2,
Pos,
Or_Pos2);
Parser.Current_Pos := Or_Pos2;
return Or_Res2;
end Choice_Or_Parse0;
function Compilation_Unit_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Compilation_Unit
is
use Bare_Compilation_Unit_Memos;
Row_Pos7 :
Token_Index
:= No_Token_Index;
Defer_Pos16 :
Token_Index
:= No_Token_Index;
Defer_Res16 :
Bare_Project
:= No_Bare_Gpr_Node;
Transform_Res5 :
Bare_Compilation_Unit
:= No_Bare_Gpr_Node;
Transform_Diags5 :
Ada.Containers.Count_Type;
M : Memo_Entry := Get (Parser.Private_Part.Compilation_Unit_Transform_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Transform_Res5 := M.Instance;
return Transform_Res5;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Transform_Res5;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start transform_code
Transform_Diags5 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos7 := Pos;
Defer_Res16 :=
Project_Transform_Parse0 (Parser, Row_Pos7);
Defer_Pos16 := Parser.Current_Pos;
if Defer_Pos16 /= No_Token_Index then
Row_Pos7 := Defer_Pos16;
else
Row_Pos7 := No_Token_Index;
goto Exit_Row7_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row7_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos7 /= No_Token_Index then
Transform_Res5 := Allocate_Compilation_Unit (Parser.Mem_Pool);
Initialize
(Self => Transform_Res5,
Kind => Gpr_Compilation_Unit,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos7 = Pos
then No_Token_Index
else Row_Pos7 - 1));
Initialize_Fields_For_Compilation_Unit
(Self => Transform_Res5, Compilation_Unit_F_Project => Defer_Res16);
if Defer_Res16 /= null and then Is_Incomplete (Defer_Res16) then
Transform_Res5.Last_Attempted_Child := 0;
elsif Defer_Res16 /= null and then not Is_Ghost (Defer_Res16) then
Transform_Res5.Last_Attempted_Child := -1;
end if;
elsif Row_Pos7 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags5);
end if;
-- End transform_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Compilation_Unit_Transform_Parse0_Memo,
Row_Pos7 /= No_Token_Index,
Transform_Res5,
Pos,
Row_Pos7);
Parser.Current_Pos := Row_Pos7;
return Transform_Res5;
end Compilation_Unit_Transform_Parse0;
function Context_Clauses_List_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_With_Decl_List
is
use Bare_With_Decl_List_Memos;
Lst_Cpos1 :
Token_Index
:= No_Token_Index;
Tmp_List1 :
Free_Parse_List;
Defer_Pos17 :
Token_Index
:= No_Token_Index;
Defer_Res17 :
Bare_With_Decl
:= No_Bare_Gpr_Node;
List_Pos1 :
Token_Index
:= No_Token_Index;
List_Res1 :
Bare_With_Decl_List
:= No_Bare_Gpr_Node;
M : Memo_Entry := Get (Parser.Private_Part.Context_Clauses_List_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
List_Res1 := M.Instance;
return List_Res1;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return List_Res1;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start list_code
List_Pos1 := Pos;
Lst_Cpos1 := Pos;
Tmp_List1 := Get_Parse_List (Parser);
loop
Defer_Res17 :=
With_Decl_Transform_Parse0 (Parser, Lst_Cpos1);
Defer_Pos17 := Parser.Current_Pos;
exit when Defer_Pos17 = No_Token_Index;
List_Pos1 := Defer_Pos17;
Lst_Cpos1 := List_Pos1;
Tmp_List1.Nodes.Append (Defer_Res17);
end loop;
declare
Token_Start, Token_End : Token_Index;
Count : constant Natural := Tmp_List1.Nodes.Length;
begin
List_Res1 :=
Allocate_With_Decl_List (Parser.Mem_Pool);
if Count > 0 then
Token_Start := Pos;
Token_End := (if Lst_Cpos1 = Pos
then Pos
else Lst_Cpos1 - 1);
else
Token_Start := Token_Index'Max (Pos, 1);
Token_End := No_Token_Index;
end if;
Initialize
(Self => List_Res1,
Kind => Gpr_With_Decl_List,
Unit => Parser.Unit,
Token_Start_Index => Token_Start,
Token_End_Index => Token_End);
Initialize_List
(Self => List_Res1,
Parser => Parser,
Count => Count);
declare
Vec : Bare_Gpr_Node_Vectors.Vector renames
Tmp_List1.Nodes;
Arr : Alloc_AST_List_Array.Element_Array_Access renames
List_Res1.Nodes;
begin
Arr := Alloc_AST_List_Array.Alloc (Parser.Mem_Pool, Vec.Length);
for I in Vec.First_Index .. Vec.Last_Index loop
Arr (I) := Vec.Get (I);
end loop;
end;
end;
Release_Parse_List (Parser, Tmp_List1);
-- End list_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Context_Clauses_List_Parse0_Memo,
List_Pos1 /= No_Token_Index,
List_Res1,
Pos,
List_Pos1);
Parser.Current_Pos := List_Pos1;
return List_Res1;
end Context_Clauses_List_Parse0;
function Declarative_Item_Or_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Gpr_Node
is
use Bare_Gpr_Node_Memos;
Defer_Pos18 :
Token_Index
:= No_Token_Index;
Defer_Res18 :
Bare_Gpr_Node
:= No_Bare_Gpr_Node;
Defer_Pos19 :
Token_Index
:= No_Token_Index;
Defer_Res19 :
Bare_Typed_String_Decl
:= No_Bare_Gpr_Node;
Defer_Pos20 :
Token_Index
:= No_Token_Index;
Defer_Res20 :
Bare_Package_Decl
:= No_Bare_Gpr_Node;
Or_Pos3 :
Token_Index
:= No_Token_Index;
Or_Res3 :
Bare_Gpr_Node
:= No_Bare_Gpr_Node;
M : Memo_Entry := Get (Parser.Private_Part.Declarative_Item_Or_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Or_Res3 := M.Instance;
return Or_Res3;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Or_Res3;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start or_code
Or_Pos3 := No_Token_Index;
Or_Res3 := No_Bare_Gpr_Node;
Defer_Res18 :=
Simple_Declarative_Item_Or_Parse0 (Parser, Pos);
Defer_Pos18 := Parser.Current_Pos;
if Defer_Pos18 /= No_Token_Index then
Or_Pos3 := Defer_Pos18;
Or_Res3 := Defer_Res18;
goto Exit_Or3;
end if;
Defer_Res19 :=
Typed_String_Decl_Transform_Parse0 (Parser, Pos);
Defer_Pos19 := Parser.Current_Pos;
if Defer_Pos19 /= No_Token_Index then
Or_Pos3 := Defer_Pos19;
Or_Res3 := Defer_Res19;
goto Exit_Or3;
end if;
Defer_Res20 :=
Package_Decl_Transform_Parse0 (Parser, Pos);
Defer_Pos20 := Parser.Current_Pos;
if Defer_Pos20 /= No_Token_Index then
Or_Pos3 := Defer_Pos20;
Or_Res3 := Defer_Res20;
goto Exit_Or3;
end if;
<<Exit_Or3>>
-- End or_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Declarative_Item_Or_Parse0_Memo,
Or_Pos3 /= No_Token_Index,
Or_Res3,
Pos,
Or_Pos3);
Parser.Current_Pos := Or_Pos3;
return Or_Res3;
end Declarative_Item_Or_Parse0;
function Declarative_Items_List_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Gpr_Node_List
is
use Bare_Gpr_Node_List_Memos;
Lst_Cpos2 :
Token_Index
:= No_Token_Index;
Tmp_List2 :
Free_Parse_List;
Defer_Pos21 :
Token_Index
:= No_Token_Index;
Defer_Res21 :
Bare_Gpr_Node
:= No_Bare_Gpr_Node;
List_Pos2 :
Token_Index
:= No_Token_Index;
List_Res2 :
Bare_Gpr_Node_List
:= No_Bare_Gpr_Node;
M : Memo_Entry := Get (Parser.Private_Part.Declarative_Items_List_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
List_Res2 := M.Instance;
return List_Res2;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return List_Res2;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start list_code
List_Pos2 := Pos;
Lst_Cpos2 := Pos;
Tmp_List2 := Get_Parse_List (Parser);
loop
Defer_Res21 :=
Declarative_Item_Or_Parse0 (Parser, Lst_Cpos2);
Defer_Pos21 := Parser.Current_Pos;
exit when Defer_Pos21 = No_Token_Index;
List_Pos2 := Defer_Pos21;
Lst_Cpos2 := List_Pos2;
Tmp_List2.Nodes.Append (Defer_Res21);
end loop;
declare
Token_Start, Token_End : Token_Index;
Count : constant Natural := Tmp_List2.Nodes.Length;
begin
List_Res2 :=
Allocate_Gpr_Node_List (Parser.Mem_Pool);
if Count > 0 then
Token_Start := Pos;
Token_End := (if Lst_Cpos2 = Pos
then Pos
else Lst_Cpos2 - 1);
else
Token_Start := Token_Index'Max (Pos, 1);
Token_End := No_Token_Index;
end if;
Initialize
(Self => List_Res2,
Kind => Gpr_Gpr_Node_List,
Unit => Parser.Unit,
Token_Start_Index => Token_Start,
Token_End_Index => Token_End);
Initialize_List
(Self => List_Res2,
Parser => Parser,
Count => Count);
declare
Vec : Bare_Gpr_Node_Vectors.Vector renames
Tmp_List2.Nodes;
Arr : Alloc_AST_List_Array.Element_Array_Access renames
List_Res2.Nodes;
begin
Arr := Alloc_AST_List_Array.Alloc (Parser.Mem_Pool, Vec.Length);
for I in Vec.First_Index .. Vec.Last_Index loop
Arr (I) := Vec.Get (I);
end loop;
end;
end;
Release_Parse_List (Parser, Tmp_List2);
-- End list_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Declarative_Items_List_Parse0_Memo,
List_Pos2 /= No_Token_Index,
List_Res2,
Pos,
List_Pos2);
Parser.Current_Pos := List_Pos2;
return List_Res2;
end Declarative_Items_List_Parse0;
function Discrete_Choice_List_List_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Choices
is
use Bare_Choices_Memos;
Lst_Cpos3 :
Token_Index
:= No_Token_Index;
Tmp_List3 :
Free_Parse_List;
Defer_Pos22 :
Token_Index
:= No_Token_Index;
Defer_Res22 :
Bare_Gpr_Node
:= No_Bare_Gpr_Node;
Token_Pos14 :
Token_Index
:= No_Token_Index;
Token_Res14 :
Token_Index
:= No_Token_Index;
List_Pos3 :
Token_Index
:= No_Token_Index;
List_Res3 :
Bare_Choices
:= No_Bare_Gpr_Node;
M : Memo_Entry := Get (Parser.Private_Part.Discrete_Choice_List_List_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
List_Res3 := M.Instance;
return List_Res3;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return List_Res3;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start list_code
List_Pos3 := No_Token_Index;
Lst_Cpos3 := Pos;
Tmp_List3 := Get_Parse_List (Parser);
loop
Defer_Res22 :=
Choice_Or_Parse0 (Parser, Lst_Cpos3);
Defer_Pos22 := Parser.Current_Pos;
exit when Defer_Pos22 = No_Token_Index;
List_Pos3 := Defer_Pos22;
Lst_Cpos3 := List_Pos3;
Tmp_List3.Nodes.Append (Defer_Res22);
-- Start tok_code
Token_Res14 := Lst_Cpos3;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res14));
begin
if
T.Kind /= From_Token_Kind (Gpr_Pipe)
then
Token_Pos14 := No_Token_Index;
if Parser.Last_Fail.Pos <= Lst_Cpos3 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Lst_Cpos3,
Expected_Token_Id => Gpr_Pipe,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos14 := Lst_Cpos3 + 1;
end if;
end;
-- End tok_code
if Token_Pos14 /= No_Token_Index then
Lst_Cpos3 := Token_Pos14;
else
exit;
end if;
end loop;
declare
Token_Start, Token_End : Token_Index;
Count : constant Natural := Tmp_List3.Nodes.Length;
begin
List_Res3 :=
Allocate_Choices (Parser.Mem_Pool);
if Count > 0 then
Token_Start := Pos;
Token_End := (if Lst_Cpos3 = Pos
then Pos
else Lst_Cpos3 - 1);
else
Token_Start := Token_Index'Max (Pos, 1);
Token_End := No_Token_Index;
end if;
Initialize
(Self => List_Res3,
Kind => Gpr_Choices,
Unit => Parser.Unit,
Token_Start_Index => Token_Start,
Token_End_Index => Token_End);
Initialize_List
(Self => List_Res3,
Parser => Parser,
Count => Count);
declare
Vec : Bare_Gpr_Node_Vectors.Vector renames
Tmp_List3.Nodes;
Arr : Alloc_AST_List_Array.Element_Array_Access renames
List_Res3.Nodes;
begin
Arr := Alloc_AST_List_Array.Alloc (Parser.Mem_Pool, Vec.Length);
for I in Vec.First_Index .. Vec.Last_Index loop
Arr (I) := Vec.Get (I);
end loop;
end;
end;
Release_Parse_List (Parser, Tmp_List3);
-- End list_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Discrete_Choice_List_List_Parse0_Memo,
List_Pos3 /= No_Token_Index,
List_Res3,
Pos,
List_Pos3);
Parser.Current_Pos := List_Pos3;
return List_Res3;
end Discrete_Choice_List_List_Parse0;
function Empty_Declaration_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Empty_Decl
is
use Bare_Empty_Decl_Memos;
Row_Pos8 :
Token_Index
:= No_Token_Index;
Token_Pos15 :
Token_Index
:= No_Token_Index;
Token_Res15 :
Token_Index
:= No_Token_Index;
Token_Pos16 :
Token_Index
:= No_Token_Index;
Token_Res16 :
Token_Index
:= No_Token_Index;
Transform_Res6 :
Bare_Empty_Decl
:= No_Bare_Gpr_Node;
Transform_Diags6 :
Ada.Containers.Count_Type;
M : Memo_Entry := Get (Parser.Private_Part.Empty_Declaration_Transform_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Transform_Res6 := M.Instance;
return Transform_Res6;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Transform_Res6;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start transform_code
Transform_Diags6 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos8 := Pos;
-- Start tok_code
Token_Res15 := Row_Pos8;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res15));
begin
if
T.Kind /= From_Token_Kind (Gpr_Null)
then
Token_Pos15 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos8 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos8,
Expected_Token_Id => Gpr_Null,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos15 := Row_Pos8 + 1;
end if;
end;
-- End tok_code
if Token_Pos15 /= No_Token_Index then
Row_Pos8 := Token_Pos15;
else
Row_Pos8 := No_Token_Index;
goto Exit_Row8_0;
end if;
-- Start tok_code
Token_Res16 := Row_Pos8;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res16));
begin
if
T.Kind /= From_Token_Kind (Gpr_Semicolon)
then
Token_Pos16 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos8 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos8,
Expected_Token_Id => Gpr_Semicolon,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos16 := Row_Pos8 + 1;
end if;
end;
-- End tok_code
if Token_Pos16 /= No_Token_Index then
Row_Pos8 := Token_Pos16;
else
Row_Pos8 := No_Token_Index;
goto Exit_Row8_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row8_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos8 /= No_Token_Index then
Transform_Res6 := Allocate_Empty_Decl (Parser.Mem_Pool);
Initialize
(Self => Transform_Res6,
Kind => Gpr_Empty_Decl,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos8 = Pos
then No_Token_Index
else Row_Pos8 - 1));
elsif Row_Pos8 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags6);
end if;
-- End transform_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Empty_Declaration_Transform_Parse0_Memo,
Row_Pos8 /= No_Token_Index,
Transform_Res6,
Pos,
Row_Pos8);
Parser.Current_Pos := Row_Pos8;
return Transform_Res6;
end Empty_Declaration_Transform_Parse0;
function Expression_List_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Term_List
is
use Bare_Term_List_Memos;
Lst_Cpos4 :
Token_Index
:= No_Token_Index;
Tmp_List4 :
Free_Parse_List;
Defer_Pos23 :
Token_Index
:= No_Token_Index;
Defer_Res23 :
Bare_Gpr_Node
:= No_Bare_Gpr_Node;
Token_Pos17 :
Token_Index
:= No_Token_Index;
Token_Res17 :
Token_Index
:= No_Token_Index;
List_Pos4 :
Token_Index
:= No_Token_Index;
List_Res4 :
Bare_Term_List
:= No_Bare_Gpr_Node;
M : Memo_Entry := Get (Parser.Private_Part.Expression_List_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
List_Res4 := M.Instance;
return List_Res4;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return List_Res4;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start list_code
List_Pos4 := No_Token_Index;
Lst_Cpos4 := Pos;
Tmp_List4 := Get_Parse_List (Parser);
loop
Defer_Res23 :=
Term_Or_Parse0 (Parser, Lst_Cpos4);
Defer_Pos23 := Parser.Current_Pos;
exit when Defer_Pos23 = No_Token_Index;
List_Pos4 := Defer_Pos23;
Lst_Cpos4 := List_Pos4;
Tmp_List4.Nodes.Append (Defer_Res23);
-- Start tok_code
Token_Res17 := Lst_Cpos4;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res17));
begin
if
T.Kind /= From_Token_Kind (Gpr_Amp)
then
Token_Pos17 := No_Token_Index;
if Parser.Last_Fail.Pos <= Lst_Cpos4 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Lst_Cpos4,
Expected_Token_Id => Gpr_Amp,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos17 := Lst_Cpos4 + 1;
end if;
end;
-- End tok_code
if Token_Pos17 /= No_Token_Index then
Lst_Cpos4 := Token_Pos17;
else
exit;
end if;
end loop;
declare
Token_Start, Token_End : Token_Index;
Count : constant Natural := Tmp_List4.Nodes.Length;
begin
List_Res4 :=
Allocate_Term_List (Parser.Mem_Pool);
if Count > 0 then
Token_Start := Pos;
Token_End := (if Lst_Cpos4 = Pos
then Pos
else Lst_Cpos4 - 1);
else
Token_Start := Token_Index'Max (Pos, 1);
Token_End := No_Token_Index;
end if;
Initialize
(Self => List_Res4,
Kind => Gpr_Term_List,
Unit => Parser.Unit,
Token_Start_Index => Token_Start,
Token_End_Index => Token_End);
Initialize_List
(Self => List_Res4,
Parser => Parser,
Count => Count);
declare
Vec : Bare_Gpr_Node_Vectors.Vector renames
Tmp_List4.Nodes;
Arr : Alloc_AST_List_Array.Element_Array_Access renames
List_Res4.Nodes;
begin
Arr := Alloc_AST_List_Array.Alloc (Parser.Mem_Pool, Vec.Length);
for I in Vec.First_Index .. Vec.Last_Index loop
Arr (I) := Vec.Get (I);
end loop;
end;
end;
Release_Parse_List (Parser, Tmp_List4);
-- End list_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Expression_List_Parse0_Memo,
List_Pos4 /= No_Token_Index,
List_Res4,
Pos,
List_Pos4);
Parser.Current_Pos := List_Pos4;
return List_Res4;
end Expression_List_Parse0;
function Expression_List_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Terms
is
use Bare_Terms_Memos;
Row_Pos9 :
Token_Index
:= No_Token_Index;
Token_Pos18 :
Token_Index
:= No_Token_Index;
Token_Res18 :
Token_Index
:= No_Token_Index;
Lst_Cpos5 :
Token_Index
:= No_Token_Index;
Tmp_List5 :
Free_Parse_List;
Defer_Pos24 :
Token_Index
:= No_Token_Index;
Defer_Res24 :
Bare_Term_List
:= No_Bare_Gpr_Node;
Token_Pos19 :
Token_Index
:= No_Token_Index;
Token_Res19 :
Token_Index
:= No_Token_Index;
List_Pos5 :
Token_Index
:= No_Token_Index;
List_Res5 :
Bare_Term_List_List
:= No_Bare_Gpr_Node;
Token_Pos20 :
Token_Index
:= No_Token_Index;
Token_Res20 :
Token_Index
:= No_Token_Index;
Transform_Res7 :
Bare_Terms
:= No_Bare_Gpr_Node;
Transform_Diags7 :
Ada.Containers.Count_Type;
M : Memo_Entry := Get (Parser.Private_Part.Expression_List_Transform_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Transform_Res7 := M.Instance;
return Transform_Res7;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Transform_Res7;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start transform_code
Transform_Diags7 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos9 := Pos;
-- Start tok_code
Token_Res18 := Row_Pos9;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res18));
begin
if
T.Kind /= From_Token_Kind (Gpr_Par_Open)
then
Token_Pos18 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos9 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos9,
Expected_Token_Id => Gpr_Par_Open,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos18 := Row_Pos9 + 1;
end if;
end;
-- End tok_code
if Token_Pos18 /= No_Token_Index then
Row_Pos9 := Token_Pos18;
else
Row_Pos9 := No_Token_Index;
goto Exit_Row9_0;
end if;
-- Start list_code
List_Pos5 := Row_Pos9;
Lst_Cpos5 := Row_Pos9;
Tmp_List5 := Get_Parse_List (Parser);
loop
Defer_Res24 :=
Expression_List_Parse0 (Parser, Lst_Cpos5);
Defer_Pos24 := Parser.Current_Pos;
exit when Defer_Pos24 = No_Token_Index;
List_Pos5 := Defer_Pos24;
Lst_Cpos5 := List_Pos5;
Tmp_List5.Nodes.Append (Defer_Res24);
-- Start tok_code
Token_Res19 := Lst_Cpos5;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res19));
begin
if
T.Kind /= From_Token_Kind (Gpr_Comma)
then
Token_Pos19 := No_Token_Index;
if Parser.Last_Fail.Pos <= Lst_Cpos5 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Lst_Cpos5,
Expected_Token_Id => Gpr_Comma,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos19 := Lst_Cpos5 + 1;
end if;
end;
-- End tok_code
if Token_Pos19 /= No_Token_Index then
Lst_Cpos5 := Token_Pos19;
else
exit;
end if;
end loop;
declare
Token_Start, Token_End : Token_Index;
Count : constant Natural := Tmp_List5.Nodes.Length;
begin
List_Res5 :=
Allocate_Term_List_List (Parser.Mem_Pool);
if Count > 0 then
Token_Start := Row_Pos9;
Token_End := (if Lst_Cpos5 = Row_Pos9
then Row_Pos9
else Lst_Cpos5 - 1);
else
Token_Start := Token_Index'Max (Row_Pos9, 1);
Token_End := No_Token_Index;
end if;
Initialize
(Self => List_Res5,
Kind => Gpr_Term_List_List,
Unit => Parser.Unit,
Token_Start_Index => Token_Start,
Token_End_Index => Token_End);
Initialize_List
(Self => List_Res5,
Parser => Parser,
Count => Count);
declare
Vec : Bare_Gpr_Node_Vectors.Vector renames
Tmp_List5.Nodes;
Arr : Alloc_AST_List_Array.Element_Array_Access renames
List_Res5.Nodes;
begin
Arr := Alloc_AST_List_Array.Alloc (Parser.Mem_Pool, Vec.Length);
for I in Vec.First_Index .. Vec.Last_Index loop
Arr (I) := Vec.Get (I);
end loop;
end;
end;
Release_Parse_List (Parser, Tmp_List5);
-- End list_code
if List_Pos5 /= No_Token_Index then
Row_Pos9 := List_Pos5;
else
Row_Pos9 := No_Token_Index;
goto Exit_Row9_0;
end if;
-- Start tok_code
Token_Res20 := Row_Pos9;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res20));
begin
if
T.Kind /= From_Token_Kind (Gpr_Par_Close)
then
Token_Pos20 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos9 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos9,
Expected_Token_Id => Gpr_Par_Close,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos20 := Row_Pos9 + 1;
end if;
end;
-- End tok_code
if Token_Pos20 /= No_Token_Index then
Row_Pos9 := Token_Pos20;
else
Row_Pos9 := No_Token_Index;
goto Exit_Row9_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row9_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos9 /= No_Token_Index then
Transform_Res7 := Allocate_Terms (Parser.Mem_Pool);
Initialize
(Self => Transform_Res7,
Kind => Gpr_Terms,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos9 = Pos
then No_Token_Index
else Row_Pos9 - 1));
Initialize_Fields_For_Terms
(Self => Transform_Res7, Terms_F_Terms => List_Res5);
if List_Res5 /= null and then Is_Incomplete (List_Res5) then
Transform_Res7.Last_Attempted_Child := 0;
elsif List_Res5 /= null and then not Is_Ghost (List_Res5) then
Transform_Res7.Last_Attempted_Child := -1;
end if;
elsif Row_Pos9 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags7);
end if;
-- End transform_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Expression_List_Transform_Parse0_Memo,
Row_Pos9 /= No_Token_Index,
Transform_Res7,
Pos,
Row_Pos9);
Parser.Current_Pos := Row_Pos9;
return Transform_Res7;
end Expression_List_Transform_Parse0;
function Identifier_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Identifier
is
use Bare_Identifier_Memos;
Row_Pos10 :
Token_Index
:= No_Token_Index;
Token_Pos21 :
Token_Index
:= No_Token_Index;
Token_Res21 :
Token_Index
:= No_Token_Index;
Transform_Res8 :
Bare_Identifier
:= No_Bare_Gpr_Node;
Transform_Diags8 :
Ada.Containers.Count_Type;
M : Memo_Entry := Get (Parser.Private_Part.Identifier_Transform_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Transform_Res8 := M.Instance;
return Transform_Res8;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Transform_Res8;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start transform_code
Transform_Diags8 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos10 := Pos;
-- Start tok_code
Token_Res21 := Row_Pos10;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res21));
begin
if
T.Kind /= From_Token_Kind (Gpr_Identifier)
then
Token_Pos21 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos10 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos10,
Expected_Token_Id => Gpr_Identifier,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos21 := Row_Pos10 + 1;
end if;
end;
-- End tok_code
if Token_Pos21 /= No_Token_Index then
Row_Pos10 := Token_Pos21;
else
Row_Pos10 := No_Token_Index;
goto Exit_Row10_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row10_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos10 /= No_Token_Index then
Transform_Res8 := Allocate_Identifier (Parser.Mem_Pool);
Initialize
(Self => Transform_Res8,
Kind => Gpr_Identifier,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos10 = Pos
then No_Token_Index
else Row_Pos10 - 1));
elsif Row_Pos10 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags8);
end if;
-- End transform_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Identifier_Transform_Parse0_Memo,
Row_Pos10 /= No_Token_Index,
Transform_Res8,
Pos,
Row_Pos10);
Parser.Current_Pos := Row_Pos10;
return Transform_Res8;
end Identifier_Transform_Parse0;
function Num_Literal_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Num_Literal
is
use Bare_Num_Literal_Memos;
Row_Pos11 :
Token_Index
:= No_Token_Index;
Token_Pos22 :
Token_Index
:= No_Token_Index;
Token_Res22 :
Token_Index
:= No_Token_Index;
Transform_Res9 :
Bare_Num_Literal
:= No_Bare_Gpr_Node;
Transform_Diags9 :
Ada.Containers.Count_Type;
M : Memo_Entry := Get (Parser.Private_Part.Num_Literal_Transform_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Transform_Res9 := M.Instance;
return Transform_Res9;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Transform_Res9;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start transform_code
Transform_Diags9 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos11 := Pos;
-- Start tok_code
Token_Res22 := Row_Pos11;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res22));
begin
if
T.Kind /= From_Token_Kind (Gpr_Number)
then
Token_Pos22 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos11 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos11,
Expected_Token_Id => Gpr_Number,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos22 := Row_Pos11 + 1;
end if;
end;
-- End tok_code
if Token_Pos22 /= No_Token_Index then
Row_Pos11 := Token_Pos22;
else
Row_Pos11 := No_Token_Index;
goto Exit_Row11_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row11_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos11 /= No_Token_Index then
Transform_Res9 := Allocate_Num_Literal (Parser.Mem_Pool);
Initialize
(Self => Transform_Res9,
Kind => Gpr_Num_Literal,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos11 = Pos
then No_Token_Index
else Row_Pos11 - 1));
elsif Row_Pos11 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags9);
end if;
-- End transform_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Num_Literal_Transform_Parse0_Memo,
Row_Pos11 /= No_Token_Index,
Transform_Res9,
Pos,
Row_Pos11);
Parser.Current_Pos := Row_Pos11;
return Transform_Res9;
end Num_Literal_Transform_Parse0;
function Others_Designator_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Others_Designator
is
use Bare_Others_Designator_Memos;
Row_Pos12 :
Token_Index
:= No_Token_Index;
Token_Pos23 :
Token_Index
:= No_Token_Index;
Token_Res23 :
Token_Index
:= No_Token_Index;
Transform_Res10 :
Bare_Others_Designator
:= No_Bare_Gpr_Node;
Transform_Diags10 :
Ada.Containers.Count_Type;
M : Memo_Entry := Get (Parser.Private_Part.Others_Designator_Transform_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Transform_Res10 := M.Instance;
return Transform_Res10;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Transform_Res10;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start transform_code
Transform_Diags10 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos12 := Pos;
-- Start tok_code
Token_Res23 := Row_Pos12;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res23));
begin
if
T.Kind /= From_Token_Kind (Gpr_Others)
then
Token_Pos23 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos12 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos12,
Expected_Token_Id => Gpr_Others,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos23 := Row_Pos12 + 1;
end if;
end;
-- End tok_code
if Token_Pos23 /= No_Token_Index then
Row_Pos12 := Token_Pos23;
else
Row_Pos12 := No_Token_Index;
goto Exit_Row12_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row12_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos12 /= No_Token_Index then
Transform_Res10 := Allocate_Others_Designator (Parser.Mem_Pool);
Initialize
(Self => Transform_Res10,
Kind => Gpr_Others_Designator,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos12 = Pos
then No_Token_Index
else Row_Pos12 - 1));
elsif Row_Pos12 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags10);
end if;
-- End transform_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Others_Designator_Transform_Parse0_Memo,
Row_Pos12 /= No_Token_Index,
Transform_Res10,
Pos,
Row_Pos12);
Parser.Current_Pos := Row_Pos12;
return Transform_Res10;
end Others_Designator_Transform_Parse0;
function Package_Decl_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Package_Decl
is
use Bare_Package_Decl_Memos;
Row_Pos13 :
Token_Index
:= No_Token_Index;
Token_Pos24 :
Token_Index
:= No_Token_Index;
Token_Res24 :
Token_Index
:= No_Token_Index;
Defer_Pos25 :
Token_Index
:= No_Token_Index;
Defer_Res25 :
Bare_Identifier
:= No_Bare_Gpr_Node;
Defer_Pos26 :
Token_Index
:= No_Token_Index;
Defer_Res26 :
Bare_Package_Renaming
:= No_Bare_Gpr_Node;
Defer_Pos27 :
Token_Index
:= No_Token_Index;
Defer_Res27 :
Bare_Package_Spec
:= No_Bare_Gpr_Node;
Or_Pos4 :
Token_Index
:= No_Token_Index;
Or_Res4 :
Bare_Gpr_Node
:= No_Bare_Gpr_Node;
Token_Pos25 :
Token_Index
:= No_Token_Index;
Token_Res25 :
Token_Index
:= No_Token_Index;
Transform_Res11 :
Bare_Package_Decl
:= No_Bare_Gpr_Node;
Transform_Diags11 :
Ada.Containers.Count_Type;
M : Memo_Entry := Get (Parser.Private_Part.Package_Decl_Transform_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Transform_Res11 := M.Instance;
return Transform_Res11;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Transform_Res11;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start transform_code
Transform_Diags11 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos13 := Pos;
-- Start tok_code
Token_Res24 := Row_Pos13;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res24));
begin
if
T.Kind /= From_Token_Kind (Gpr_Package)
then
Token_Pos24 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos13 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos13,
Expected_Token_Id => Gpr_Package,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos24 := Row_Pos13 + 1;
end if;
end;
-- End tok_code
if Token_Pos24 /= No_Token_Index then
Row_Pos13 := Token_Pos24;
else
Row_Pos13 := No_Token_Index;
goto Exit_Row13_0;
end if;
Defer_Res25 :=
Identifier_Transform_Parse0 (Parser, Row_Pos13);
Defer_Pos25 := Parser.Current_Pos;
if Defer_Pos25 /= No_Token_Index then
Row_Pos13 := Defer_Pos25;
else
Row_Pos13 := No_Token_Index;
goto Exit_Row13_0;
end if;
-- Start or_code
Or_Pos4 := No_Token_Index;
Or_Res4 := No_Bare_Gpr_Node;
Defer_Res26 :=
Package_Renaming_Transform_Parse0 (Parser, Row_Pos13);
Defer_Pos26 := Parser.Current_Pos;
if Defer_Pos26 /= No_Token_Index then
Or_Pos4 := Defer_Pos26;
Or_Res4 := Defer_Res26;
goto Exit_Or4;
end if;
Defer_Res27 :=
Package_Spec_Transform_Parse0 (Parser, Row_Pos13);
Defer_Pos27 := Parser.Current_Pos;
if Defer_Pos27 /= No_Token_Index then
Or_Pos4 := Defer_Pos27;
Or_Res4 := Defer_Res27;
goto Exit_Or4;
end if;
<<Exit_Or4>>
-- End or_code
if Or_Pos4 /= No_Token_Index then
Row_Pos13 := Or_Pos4;
else
Row_Pos13 := No_Token_Index;
goto Exit_Row13_0;
end if;
-- Start tok_code
Token_Res25 := Row_Pos13;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res25));
begin
if
T.Kind /= From_Token_Kind (Gpr_Semicolon)
then
Token_Pos25 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos13 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos13,
Expected_Token_Id => Gpr_Semicolon,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos25 := Row_Pos13 + 1;
end if;
end;
-- End tok_code
if Token_Pos25 /= No_Token_Index then
Row_Pos13 := Token_Pos25;
else
Row_Pos13 := No_Token_Index;
goto Exit_Row13_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row13_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos13 /= No_Token_Index then
Transform_Res11 := Allocate_Package_Decl (Parser.Mem_Pool);
Initialize
(Self => Transform_Res11,
Kind => Gpr_Package_Decl,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos13 = Pos
then No_Token_Index
else Row_Pos13 - 1));
Initialize_Fields_For_Package_Decl
(Self => Transform_Res11, Package_Decl_F_Pkg_Name => Defer_Res25, Package_Decl_F_Pkg_Spec => Or_Res4);
if Defer_Res25 /= null and then Is_Incomplete (Defer_Res25) then
Transform_Res11.Last_Attempted_Child := 0;
elsif Defer_Res25 /= null and then not Is_Ghost (Defer_Res25) then
Transform_Res11.Last_Attempted_Child := -1;
end if;
if Or_Res4 /= null and then Is_Incomplete (Or_Res4) then
Transform_Res11.Last_Attempted_Child := 0;
elsif Or_Res4 /= null and then not Is_Ghost (Or_Res4) then
Transform_Res11.Last_Attempted_Child := -1;
end if;
elsif Row_Pos13 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags11);
end if;
-- End transform_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Package_Decl_Transform_Parse0_Memo,
Row_Pos13 /= No_Token_Index,
Transform_Res11,
Pos,
Row_Pos13);
Parser.Current_Pos := Row_Pos13;
return Transform_Res11;
end Package_Decl_Transform_Parse0;
function Package_Extension_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Package_Extension
is
use Bare_Package_Extension_Memos;
Row_Pos14 :
Token_Index
:= No_Token_Index;
Token_Pos26 :
Token_Index
:= No_Token_Index;
Token_Res26 :
Token_Index
:= No_Token_Index;
Lst_Cpos6 :
Token_Index
:= No_Token_Index;
Tmp_List6 :
Free_Parse_List;
Defer_Pos28 :
Token_Index
:= No_Token_Index;
Defer_Res28 :
Bare_Identifier
:= No_Bare_Gpr_Node;
Token_Pos27 :
Token_Index
:= No_Token_Index;
Token_Res27 :
Token_Index
:= No_Token_Index;
List_Pos6 :
Token_Index
:= No_Token_Index;
List_Res6 :
Bare_Identifier_List
:= No_Bare_Gpr_Node;
Transform_Res12 :
Bare_Package_Extension
:= No_Bare_Gpr_Node;
Transform_Diags12 :
Ada.Containers.Count_Type;
M : Memo_Entry := Get (Parser.Private_Part.Package_Extension_Transform_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Transform_Res12 := M.Instance;
return Transform_Res12;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Transform_Res12;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start transform_code
Transform_Diags12 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos14 := Pos;
-- Start tok_code
Token_Res26 := Row_Pos14;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res26));
begin
if
T.Kind /= From_Token_Kind (Gpr_Extends)
then
Token_Pos26 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos14 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos14,
Expected_Token_Id => Gpr_Extends,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos26 := Row_Pos14 + 1;
end if;
end;
-- End tok_code
if Token_Pos26 /= No_Token_Index then
Row_Pos14 := Token_Pos26;
else
Row_Pos14 := No_Token_Index;
goto Exit_Row14_0;
end if;
-- Start list_code
List_Pos6 := No_Token_Index;
Lst_Cpos6 := Row_Pos14;
Tmp_List6 := Get_Parse_List (Parser);
loop
Defer_Res28 :=
Identifier_Transform_Parse0 (Parser, Lst_Cpos6);
Defer_Pos28 := Parser.Current_Pos;
exit when Defer_Pos28 = No_Token_Index;
List_Pos6 := Defer_Pos28;
Lst_Cpos6 := List_Pos6;
Tmp_List6.Nodes.Append (Defer_Res28);
-- Start tok_code
Token_Res27 := Lst_Cpos6;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res27));
begin
if
T.Kind /= From_Token_Kind (Gpr_Dot)
then
Token_Pos27 := No_Token_Index;
if Parser.Last_Fail.Pos <= Lst_Cpos6 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Lst_Cpos6,
Expected_Token_Id => Gpr_Dot,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos27 := Lst_Cpos6 + 1;
end if;
end;
-- End tok_code
if Token_Pos27 /= No_Token_Index then
Lst_Cpos6 := Token_Pos27;
else
exit;
end if;
end loop;
declare
Token_Start, Token_End : Token_Index;
Count : constant Natural := Tmp_List6.Nodes.Length;
begin
List_Res6 :=
Allocate_Identifier_List (Parser.Mem_Pool);
if Count > 0 then
Token_Start := Row_Pos14;
Token_End := (if Lst_Cpos6 = Row_Pos14
then Row_Pos14
else Lst_Cpos6 - 1);
else
Token_Start := Token_Index'Max (Row_Pos14, 1);
Token_End := No_Token_Index;
end if;
Initialize
(Self => List_Res6,
Kind => Gpr_Identifier_List,
Unit => Parser.Unit,
Token_Start_Index => Token_Start,
Token_End_Index => Token_End);
Initialize_List
(Self => List_Res6,
Parser => Parser,
Count => Count);
declare
Vec : Bare_Gpr_Node_Vectors.Vector renames
Tmp_List6.Nodes;
Arr : Alloc_AST_List_Array.Element_Array_Access renames
List_Res6.Nodes;
begin
Arr := Alloc_AST_List_Array.Alloc (Parser.Mem_Pool, Vec.Length);
for I in Vec.First_Index .. Vec.Last_Index loop
Arr (I) := Vec.Get (I);
end loop;
end;
end;
Release_Parse_List (Parser, Tmp_List6);
-- End list_code
if List_Pos6 /= No_Token_Index then
Row_Pos14 := List_Pos6;
else
Row_Pos14 := No_Token_Index;
goto Exit_Row14_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row14_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos14 /= No_Token_Index then
Transform_Res12 := Allocate_Package_Extension (Parser.Mem_Pool);
Initialize
(Self => Transform_Res12,
Kind => Gpr_Package_Extension,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos14 = Pos
then No_Token_Index
else Row_Pos14 - 1));
Initialize_Fields_For_Package_Extension
(Self => Transform_Res12, Package_Extension_F_Extended_Name => List_Res6);
if List_Res6 /= null and then Is_Incomplete (List_Res6) then
Transform_Res12.Last_Attempted_Child := 0;
elsif List_Res6 /= null and then not Is_Ghost (List_Res6) then
Transform_Res12.Last_Attempted_Child := -1;
end if;
elsif Row_Pos14 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags12);
end if;
-- End transform_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Package_Extension_Transform_Parse0_Memo,
Row_Pos14 /= No_Token_Index,
Transform_Res12,
Pos,
Row_Pos14);
Parser.Current_Pos := Row_Pos14;
return Transform_Res12;
end Package_Extension_Transform_Parse0;
function Package_Renaming_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Package_Renaming
is
use Bare_Package_Renaming_Memos;
Row_Pos15 :
Token_Index
:= No_Token_Index;
Token_Pos28 :
Token_Index
:= No_Token_Index;
Token_Res28 :
Token_Index
:= No_Token_Index;
Lst_Cpos7 :
Token_Index
:= No_Token_Index;
Tmp_List7 :
Free_Parse_List;
Defer_Pos29 :
Token_Index
:= No_Token_Index;
Defer_Res29 :
Bare_Identifier
:= No_Bare_Gpr_Node;
Token_Pos29 :
Token_Index
:= No_Token_Index;
Token_Res29 :
Token_Index
:= No_Token_Index;
List_Pos7 :
Token_Index
:= No_Token_Index;
List_Res7 :
Bare_Identifier_List
:= No_Bare_Gpr_Node;
Transform_Res13 :
Bare_Package_Renaming
:= No_Bare_Gpr_Node;
Transform_Diags13 :
Ada.Containers.Count_Type;
M : Memo_Entry := Get (Parser.Private_Part.Package_Renaming_Transform_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Transform_Res13 := M.Instance;
return Transform_Res13;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Transform_Res13;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start transform_code
Transform_Diags13 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos15 := Pos;
-- Start tok_code
Token_Res28 := Row_Pos15;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res28));
begin
if
T.Kind /= From_Token_Kind (Gpr_Renames)
then
Token_Pos28 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos15 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos15,
Expected_Token_Id => Gpr_Renames,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos28 := Row_Pos15 + 1;
end if;
end;
-- End tok_code
if Token_Pos28 /= No_Token_Index then
Row_Pos15 := Token_Pos28;
else
Row_Pos15 := No_Token_Index;
goto Exit_Row15_0;
end if;
-- Start list_code
List_Pos7 := No_Token_Index;
Lst_Cpos7 := Row_Pos15;
Tmp_List7 := Get_Parse_List (Parser);
loop
Defer_Res29 :=
Identifier_Transform_Parse0 (Parser, Lst_Cpos7);
Defer_Pos29 := Parser.Current_Pos;
exit when Defer_Pos29 = No_Token_Index;
List_Pos7 := Defer_Pos29;
Lst_Cpos7 := List_Pos7;
Tmp_List7.Nodes.Append (Defer_Res29);
-- Start tok_code
Token_Res29 := Lst_Cpos7;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res29));
begin
if
T.Kind /= From_Token_Kind (Gpr_Dot)
then
Token_Pos29 := No_Token_Index;
if Parser.Last_Fail.Pos <= Lst_Cpos7 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Lst_Cpos7,
Expected_Token_Id => Gpr_Dot,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos29 := Lst_Cpos7 + 1;
end if;
end;
-- End tok_code
if Token_Pos29 /= No_Token_Index then
Lst_Cpos7 := Token_Pos29;
else
exit;
end if;
end loop;
declare
Token_Start, Token_End : Token_Index;
Count : constant Natural := Tmp_List7.Nodes.Length;
begin
List_Res7 :=
Allocate_Identifier_List (Parser.Mem_Pool);
if Count > 0 then
Token_Start := Row_Pos15;
Token_End := (if Lst_Cpos7 = Row_Pos15
then Row_Pos15
else Lst_Cpos7 - 1);
else
Token_Start := Token_Index'Max (Row_Pos15, 1);
Token_End := No_Token_Index;
end if;
Initialize
(Self => List_Res7,
Kind => Gpr_Identifier_List,
Unit => Parser.Unit,
Token_Start_Index => Token_Start,
Token_End_Index => Token_End);
Initialize_List
(Self => List_Res7,
Parser => Parser,
Count => Count);
declare
Vec : Bare_Gpr_Node_Vectors.Vector renames
Tmp_List7.Nodes;
Arr : Alloc_AST_List_Array.Element_Array_Access renames
List_Res7.Nodes;
begin
Arr := Alloc_AST_List_Array.Alloc (Parser.Mem_Pool, Vec.Length);
for I in Vec.First_Index .. Vec.Last_Index loop
Arr (I) := Vec.Get (I);
end loop;
end;
end;
Release_Parse_List (Parser, Tmp_List7);
-- End list_code
if List_Pos7 /= No_Token_Index then
Row_Pos15 := List_Pos7;
else
Row_Pos15 := No_Token_Index;
goto Exit_Row15_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row15_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos15 /= No_Token_Index then
Transform_Res13 := Allocate_Package_Renaming (Parser.Mem_Pool);
Initialize
(Self => Transform_Res13,
Kind => Gpr_Package_Renaming,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos15 = Pos
then No_Token_Index
else Row_Pos15 - 1));
Initialize_Fields_For_Package_Renaming
(Self => Transform_Res13, Package_Renaming_F_Renamed_Name => List_Res7);
if List_Res7 /= null and then Is_Incomplete (List_Res7) then
Transform_Res13.Last_Attempted_Child := 0;
elsif List_Res7 /= null and then not Is_Ghost (List_Res7) then
Transform_Res13.Last_Attempted_Child := -1;
end if;
elsif Row_Pos15 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags13);
end if;
-- End transform_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Package_Renaming_Transform_Parse0_Memo,
Row_Pos15 /= No_Token_Index,
Transform_Res13,
Pos,
Row_Pos15);
Parser.Current_Pos := Row_Pos15;
return Transform_Res13;
end Package_Renaming_Transform_Parse0;
function Package_Spec_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Package_Spec
is
use Bare_Package_Spec_Memos;
Row_Pos16 :
Token_Index
:= No_Token_Index;
Defer_Pos30 :
Token_Index
:= No_Token_Index;
Defer_Res30 :
Bare_Package_Extension
:= No_Bare_Gpr_Node;
Token_Pos30 :
Token_Index
:= No_Token_Index;
Token_Res30 :
Token_Index
:= No_Token_Index;
Defer_Pos31 :
Token_Index
:= No_Token_Index;
Defer_Res31 :
Bare_Gpr_Node_List
:= No_Bare_Gpr_Node;
Token_Pos31 :
Token_Index
:= No_Token_Index;
Token_Res31 :
Token_Index
:= No_Token_Index;
Defer_Pos32 :
Token_Index
:= No_Token_Index;
Defer_Res32 :
Bare_Identifier
:= No_Bare_Gpr_Node;
Transform_Res14 :
Bare_Package_Spec
:= No_Bare_Gpr_Node;
Transform_Diags14 :
Ada.Containers.Count_Type;
M : Memo_Entry := Get (Parser.Private_Part.Package_Spec_Transform_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Transform_Res14 := M.Instance;
return Transform_Res14;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Transform_Res14;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start transform_code
Transform_Diags14 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos16 := Pos;
-- Start opt_code
Defer_Res30 :=
Package_Extension_Transform_Parse0 (Parser, Row_Pos16);
Defer_Pos30 := Parser.Current_Pos;
if Defer_Pos30 = No_Token_Index then
Defer_Res30 := No_Bare_Gpr_Node;
Defer_Pos30 := Row_Pos16;
end if;
-- End opt_code
if Defer_Pos30 /= No_Token_Index then
Row_Pos16 := Defer_Pos30;
else
Row_Pos16 := No_Token_Index;
goto Exit_Row16_0;
end if;
-- Start tok_code
Token_Res30 := Row_Pos16;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res30));
begin
if
T.Kind /= From_Token_Kind (Gpr_Is)
then
Token_Pos30 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos16 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos16,
Expected_Token_Id => Gpr_Is,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos30 := Row_Pos16 + 1;
end if;
end;
-- End tok_code
if Token_Pos30 /= No_Token_Index then
Row_Pos16 := Token_Pos30;
else
Row_Pos16 := No_Token_Index;
goto Exit_Row16_0;
end if;
Defer_Res31 :=
Simple_Declarative_Items_List_Parse0 (Parser, Row_Pos16);
Defer_Pos31 := Parser.Current_Pos;
if Defer_Pos31 /= No_Token_Index then
Row_Pos16 := Defer_Pos31;
else
Row_Pos16 := No_Token_Index;
goto Exit_Row16_0;
end if;
-- Start tok_code
Token_Res31 := Row_Pos16;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res31));
begin
if
T.Kind /= From_Token_Kind (Gpr_End)
then
Token_Pos31 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos16 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos16,
Expected_Token_Id => Gpr_End,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos31 := Row_Pos16 + 1;
end if;
end;
-- End tok_code
if Token_Pos31 /= No_Token_Index then
Row_Pos16 := Token_Pos31;
else
Row_Pos16 := No_Token_Index;
goto Exit_Row16_0;
end if;
Defer_Res32 :=
Identifier_Transform_Parse0 (Parser, Row_Pos16);
Defer_Pos32 := Parser.Current_Pos;
if Defer_Pos32 /= No_Token_Index then
Row_Pos16 := Defer_Pos32;
else
Row_Pos16 := No_Token_Index;
goto Exit_Row16_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row16_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos16 /= No_Token_Index then
Transform_Res14 := Allocate_Package_Spec (Parser.Mem_Pool);
Initialize
(Self => Transform_Res14,
Kind => Gpr_Package_Spec,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos16 = Pos
then No_Token_Index
else Row_Pos16 - 1));
Initialize_Fields_For_Package_Spec
(Self => Transform_Res14, Package_Spec_F_Extension => Defer_Res30, Package_Spec_F_Decls => Defer_Res31, Package_Spec_F_End_Name => Defer_Res32);
if Defer_Res30 /= null and then Is_Incomplete (Defer_Res30) then
Transform_Res14.Last_Attempted_Child := 0;
elsif Defer_Res30 /= null and then not Is_Ghost (Defer_Res30) then
Transform_Res14.Last_Attempted_Child := -1;
end if;
if Defer_Res31 /= null and then Is_Incomplete (Defer_Res31) then
Transform_Res14.Last_Attempted_Child := 0;
elsif Defer_Res31 /= null and then not Is_Ghost (Defer_Res31) then
Transform_Res14.Last_Attempted_Child := -1;
end if;
if Defer_Res32 /= null and then Is_Incomplete (Defer_Res32) then
Transform_Res14.Last_Attempted_Child := 0;
elsif Defer_Res32 /= null and then not Is_Ghost (Defer_Res32) then
Transform_Res14.Last_Attempted_Child := -1;
end if;
elsif Row_Pos16 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags14);
end if;
-- End transform_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Package_Spec_Transform_Parse0_Memo,
Row_Pos16 /= No_Token_Index,
Transform_Res14,
Pos,
Row_Pos16);
Parser.Current_Pos := Row_Pos16;
return Transform_Res14;
end Package_Spec_Transform_Parse0;
function Project_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Project
is
use Bare_Project_Memos;
Row_Pos17 :
Token_Index
:= No_Token_Index;
Defer_Pos33 :
Token_Index
:= No_Token_Index;
Defer_Res33 :
Bare_With_Decl_List
:= No_Bare_Gpr_Node;
Defer_Pos34 :
Token_Index
:= No_Token_Index;
Defer_Res34 :
Bare_Project_Declaration
:= No_Bare_Gpr_Node;
Transform_Res15 :
Bare_Project
:= No_Bare_Gpr_Node;
Transform_Diags15 :
Ada.Containers.Count_Type;
M : Memo_Entry := Get (Parser.Private_Part.Project_Transform_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Transform_Res15 := M.Instance;
return Transform_Res15;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Transform_Res15;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start transform_code
Transform_Diags15 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos17 := Pos;
Defer_Res33 :=
Context_Clauses_List_Parse0 (Parser, Row_Pos17);
Defer_Pos33 := Parser.Current_Pos;
if Defer_Pos33 /= No_Token_Index then
Row_Pos17 := Defer_Pos33;
else
Row_Pos17 := No_Token_Index;
goto Exit_Row17_0;
end if;
Defer_Res34 :=
Project_Declaration_Transform_Parse0 (Parser, Row_Pos17);
Defer_Pos34 := Parser.Current_Pos;
if Defer_Pos34 /= No_Token_Index then
Row_Pos17 := Defer_Pos34;
else
Row_Pos17 := No_Token_Index;
goto Exit_Row17_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row17_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos17 /= No_Token_Index then
Transform_Res15 := Allocate_Project (Parser.Mem_Pool);
Initialize
(Self => Transform_Res15,
Kind => Gpr_Project,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos17 = Pos
then No_Token_Index
else Row_Pos17 - 1));
Initialize_Fields_For_Project
(Self => Transform_Res15, Project_F_Context_Clauses => Defer_Res33, Project_F_Project_Decl => Defer_Res34);
if Defer_Res33 /= null and then Is_Incomplete (Defer_Res33) then
Transform_Res15.Last_Attempted_Child := 0;
elsif Defer_Res33 /= null and then not Is_Ghost (Defer_Res33) then
Transform_Res15.Last_Attempted_Child := -1;
end if;
if Defer_Res34 /= null and then Is_Incomplete (Defer_Res34) then
Transform_Res15.Last_Attempted_Child := 0;
elsif Defer_Res34 /= null and then not Is_Ghost (Defer_Res34) then
Transform_Res15.Last_Attempted_Child := -1;
end if;
elsif Row_Pos17 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags15);
end if;
-- End transform_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Project_Transform_Parse0_Memo,
Row_Pos17 /= No_Token_Index,
Transform_Res15,
Pos,
Row_Pos17);
Parser.Current_Pos := Row_Pos17;
return Transform_Res15;
end Project_Transform_Parse0;
function Project_Declaration_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Project_Declaration
is
use Bare_Project_Declaration_Memos;
Row_Pos18 :
Token_Index
:= No_Token_Index;
Defer_Pos35 :
Token_Index
:= No_Token_Index;
Defer_Res35 :
Bare_Project_Qualifier
:= No_Bare_Gpr_Node;
Token_Pos32 :
Token_Index
:= No_Token_Index;
Token_Res32 :
Token_Index
:= No_Token_Index;
Defer_Pos36 :
Token_Index
:= No_Token_Index;
Defer_Res36 :
Bare_Expr
:= No_Bare_Gpr_Node;
Defer_Pos37 :
Token_Index
:= No_Token_Index;
Defer_Res37 :
Bare_Project_Extension
:= No_Bare_Gpr_Node;
Token_Pos33 :
Token_Index
:= No_Token_Index;
Token_Res33 :
Token_Index
:= No_Token_Index;
Defer_Pos38 :
Token_Index
:= No_Token_Index;
Defer_Res38 :
Bare_Gpr_Node_List
:= No_Bare_Gpr_Node;
Token_Pos34 :
Token_Index
:= No_Token_Index;
Token_Res34 :
Token_Index
:= No_Token_Index;
Defer_Pos39 :
Token_Index
:= No_Token_Index;
Defer_Res39 :
Bare_Expr
:= No_Bare_Gpr_Node;
Token_Pos35 :
Token_Index
:= No_Token_Index;
Token_Res35 :
Token_Index
:= No_Token_Index;
Transform_Res16 :
Bare_Project_Declaration
:= No_Bare_Gpr_Node;
Transform_Diags16 :
Ada.Containers.Count_Type;
M : Memo_Entry := Get (Parser.Private_Part.Project_Declaration_Transform_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Transform_Res16 := M.Instance;
return Transform_Res16;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Transform_Res16;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start transform_code
Transform_Diags16 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos18 := Pos;
-- Start opt_code
Defer_Res35 :=
Project_Qualifier_Or_Parse0 (Parser, Row_Pos18);
Defer_Pos35 := Parser.Current_Pos;
if Defer_Pos35 = No_Token_Index then
Defer_Res35 := No_Bare_Gpr_Node;
Defer_Pos35 := Row_Pos18;
end if;
-- End opt_code
if Defer_Pos35 /= No_Token_Index then
Row_Pos18 := Defer_Pos35;
else
Row_Pos18 := No_Token_Index;
goto Exit_Row18_0;
end if;
-- Start tok_code
Token_Res32 := Row_Pos18;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res32));
begin
if
T.Kind /= From_Token_Kind (Gpr_Identifier)
or else T.Symbol /= Precomputed_Symbol
(Precomputed_Symbol_Table (Parser.TDH.Symbols),
Precomputed_Sym_Project)
then
Token_Pos32 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos18 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos18,
Expected_Token_Id => Gpr_Identifier,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos32 := Row_Pos18 + 1;
end if;
end;
-- End tok_code
if Token_Pos32 /= No_Token_Index then
Row_Pos18 := Token_Pos32;
else
Row_Pos18 := No_Token_Index;
goto Exit_Row18_0;
end if;
Defer_Res36 :=
Static_Name_Or_Parse0 (Parser, Row_Pos18);
Defer_Pos36 := Parser.Current_Pos;
if Defer_Pos36 /= No_Token_Index then
Row_Pos18 := Defer_Pos36;
else
Row_Pos18 := No_Token_Index;
goto Exit_Row18_0;
end if;
-- Start opt_code
Defer_Res37 :=
Project_Extension_Transform_Parse0 (Parser, Row_Pos18);
Defer_Pos37 := Parser.Current_Pos;
if Defer_Pos37 = No_Token_Index then
Defer_Res37 := No_Bare_Gpr_Node;
Defer_Pos37 := Row_Pos18;
end if;
-- End opt_code
if Defer_Pos37 /= No_Token_Index then
Row_Pos18 := Defer_Pos37;
else
Row_Pos18 := No_Token_Index;
goto Exit_Row18_0;
end if;
-- Start tok_code
Token_Res33 := Row_Pos18;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res33));
begin
if
T.Kind /= From_Token_Kind (Gpr_Is)
then
Token_Pos33 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos18 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos18,
Expected_Token_Id => Gpr_Is,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos33 := Row_Pos18 + 1;
end if;
end;
-- End tok_code
if Token_Pos33 /= No_Token_Index then
Row_Pos18 := Token_Pos33;
else
Row_Pos18 := No_Token_Index;
goto Exit_Row18_0;
end if;
Defer_Res38 :=
Declarative_Items_List_Parse0 (Parser, Row_Pos18);
Defer_Pos38 := Parser.Current_Pos;
if Defer_Pos38 /= No_Token_Index then
Row_Pos18 := Defer_Pos38;
else
Row_Pos18 := No_Token_Index;
goto Exit_Row18_0;
end if;
-- Start tok_code
Token_Res34 := Row_Pos18;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res34));
begin
if
T.Kind /= From_Token_Kind (Gpr_End)
then
Token_Pos34 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos18 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos18,
Expected_Token_Id => Gpr_End,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos34 := Row_Pos18 + 1;
end if;
end;
-- End tok_code
if Token_Pos34 /= No_Token_Index then
Row_Pos18 := Token_Pos34;
else
Row_Pos18 := No_Token_Index;
goto Exit_Row18_0;
end if;
Defer_Res39 :=
Static_Name_Or_Parse0 (Parser, Row_Pos18);
Defer_Pos39 := Parser.Current_Pos;
if Defer_Pos39 /= No_Token_Index then
Row_Pos18 := Defer_Pos39;
else
Row_Pos18 := No_Token_Index;
goto Exit_Row18_0;
end if;
-- Start tok_code
Token_Res35 := Row_Pos18;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res35));
begin
if
T.Kind /= From_Token_Kind (Gpr_Semicolon)
then
Token_Pos35 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos18 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos18,
Expected_Token_Id => Gpr_Semicolon,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos35 := Row_Pos18 + 1;
end if;
end;
-- End tok_code
if Token_Pos35 /= No_Token_Index then
Row_Pos18 := Token_Pos35;
else
Row_Pos18 := No_Token_Index;
goto Exit_Row18_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row18_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos18 /= No_Token_Index then
Transform_Res16 := Allocate_Project_Declaration (Parser.Mem_Pool);
Initialize
(Self => Transform_Res16,
Kind => Gpr_Project_Declaration,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos18 = Pos
then No_Token_Index
else Row_Pos18 - 1));
Initialize_Fields_For_Project_Declaration
(Self => Transform_Res16, Project_Declaration_F_Qualifier => Defer_Res35, Project_Declaration_F_Project_Name => Defer_Res36, Project_Declaration_F_Extension => Defer_Res37, Project_Declaration_F_Decls => Defer_Res38, Project_Declaration_F_End_Name => Defer_Res39);
if Defer_Res35 /= null and then Is_Incomplete (Defer_Res35) then
Transform_Res16.Last_Attempted_Child := 0;
elsif Defer_Res35 /= null and then not Is_Ghost (Defer_Res35) then
Transform_Res16.Last_Attempted_Child := -1;
end if;
if Defer_Res36 /= null and then Is_Incomplete (Defer_Res36) then
Transform_Res16.Last_Attempted_Child := 0;
elsif Defer_Res36 /= null and then not Is_Ghost (Defer_Res36) then
Transform_Res16.Last_Attempted_Child := -1;
end if;
if Defer_Res37 /= null and then Is_Incomplete (Defer_Res37) then
Transform_Res16.Last_Attempted_Child := 0;
elsif Defer_Res37 /= null and then not Is_Ghost (Defer_Res37) then
Transform_Res16.Last_Attempted_Child := -1;
end if;
if Defer_Res38 /= null and then Is_Incomplete (Defer_Res38) then
Transform_Res16.Last_Attempted_Child := 0;
elsif Defer_Res38 /= null and then not Is_Ghost (Defer_Res38) then
Transform_Res16.Last_Attempted_Child := -1;
end if;
if Defer_Res39 /= null and then Is_Incomplete (Defer_Res39) then
Transform_Res16.Last_Attempted_Child := 0;
elsif Defer_Res39 /= null and then not Is_Ghost (Defer_Res39) then
Transform_Res16.Last_Attempted_Child := -1;
end if;
elsif Row_Pos18 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags16);
end if;
-- End transform_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Project_Declaration_Transform_Parse0_Memo,
Row_Pos18 /= No_Token_Index,
Transform_Res16,
Pos,
Row_Pos18);
Parser.Current_Pos := Row_Pos18;
return Transform_Res16;
end Project_Declaration_Transform_Parse0;
function Project_Extension_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Project_Extension
is
use Bare_Project_Extension_Memos;
Row_Pos19 :
Token_Index
:= No_Token_Index;
Token_Pos36 :
Token_Index
:= No_Token_Index;
Token_Res36 :
Token_Index
:= No_Token_Index;
Token_Pos37 :
Token_Index
:= No_Token_Index;
Token_Res37 :
Token_Index
:= No_Token_Index;
Opt_Res0 :
Bare_All_Qualifier
:= No_Bare_Gpr_Node;
Defer_Pos40 :
Token_Index
:= No_Token_Index;
Defer_Res40 :
Bare_String_Literal
:= No_Bare_Gpr_Node;
Transform_Res17 :
Bare_Project_Extension
:= No_Bare_Gpr_Node;
Transform_Diags17 :
Ada.Containers.Count_Type;
M : Memo_Entry := Get (Parser.Private_Part.Project_Extension_Transform_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Transform_Res17 := M.Instance;
return Transform_Res17;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Transform_Res17;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start transform_code
Transform_Diags17 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos19 := Pos;
-- Start tok_code
Token_Res36 := Row_Pos19;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res36));
begin
if
T.Kind /= From_Token_Kind (Gpr_Extends)
then
Token_Pos36 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos19 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos19,
Expected_Token_Id => Gpr_Extends,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos36 := Row_Pos19 + 1;
end if;
end;
-- End tok_code
if Token_Pos36 /= No_Token_Index then
Row_Pos19 := Token_Pos36;
else
Row_Pos19 := No_Token_Index;
goto Exit_Row19_0;
end if;
-- Start opt_code
-- Start tok_code
Token_Res37 := Row_Pos19;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res37));
begin
if
T.Kind /= From_Token_Kind (Gpr_All)
then
Token_Pos37 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos19 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos19,
Expected_Token_Id => Gpr_All,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos37 := Row_Pos19 + 1;
end if;
end;
-- End tok_code
if Token_Pos37 = No_Token_Index then
Opt_Res0 := Allocate_All_Qualifier_Absent (Parser.Mem_Pool);
Initialize
(Self => Opt_Res0,
Kind => Gpr_All_Qualifier_Absent,
Unit => Parser.Unit,
Token_Start_Index => Row_Pos19,
Token_End_Index => No_Token_Index);
Token_Pos37 := Row_Pos19;
else
Opt_Res0 := Allocate_All_Qualifier_Present (Parser.Mem_Pool);
Initialize
(Self => Opt_Res0,
Kind => Gpr_All_Qualifier_Present,
Unit => Parser.Unit,
Token_Start_Index => Row_Pos19,
Token_End_Index => Token_Pos37 - 1);
end if;
-- End opt_code
if Token_Pos37 /= No_Token_Index then
Row_Pos19 := Token_Pos37;
else
Row_Pos19 := No_Token_Index;
goto Exit_Row19_0;
end if;
Defer_Res40 :=
String_Literal_Transform_Parse0 (Parser, Row_Pos19);
Defer_Pos40 := Parser.Current_Pos;
if Defer_Pos40 /= No_Token_Index then
Row_Pos19 := Defer_Pos40;
else
Row_Pos19 := No_Token_Index;
goto Exit_Row19_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row19_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos19 /= No_Token_Index then
Transform_Res17 := Allocate_Project_Extension (Parser.Mem_Pool);
Initialize
(Self => Transform_Res17,
Kind => Gpr_Project_Extension,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos19 = Pos
then No_Token_Index
else Row_Pos19 - 1));
Initialize_Fields_For_Project_Extension
(Self => Transform_Res17, Project_Extension_F_Is_All => Opt_Res0, Project_Extension_F_Path_Name => Defer_Res40);
if Opt_Res0 /= null and then Is_Incomplete (Opt_Res0) then
Transform_Res17.Last_Attempted_Child := 0;
elsif Opt_Res0 /= null and then not Is_Ghost (Opt_Res0) then
Transform_Res17.Last_Attempted_Child := -1;
end if;
if Defer_Res40 /= null and then Is_Incomplete (Defer_Res40) then
Transform_Res17.Last_Attempted_Child := 0;
elsif Defer_Res40 /= null and then not Is_Ghost (Defer_Res40) then
Transform_Res17.Last_Attempted_Child := -1;
end if;
elsif Row_Pos19 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags17);
end if;
-- End transform_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Project_Extension_Transform_Parse0_Memo,
Row_Pos19 /= No_Token_Index,
Transform_Res17,
Pos,
Row_Pos19);
Parser.Current_Pos := Row_Pos19;
return Transform_Res17;
end Project_Extension_Transform_Parse0;
function Project_Qualifier_Or_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Project_Qualifier
is
use Bare_Project_Qualifier_Memos;
Row_Pos20 :
Token_Index
:= No_Token_Index;
Token_Pos38 :
Token_Index
:= No_Token_Index;
Token_Res38 :
Token_Index
:= No_Token_Index;
Transform_Res18 :
Bare_Project_Qualifier_Abstract
:= No_Bare_Gpr_Node;
Transform_Diags18 :
Ada.Containers.Count_Type;
Row_Pos21 :
Token_Index
:= No_Token_Index;
Token_Pos39 :
Token_Index
:= No_Token_Index;
Token_Res39 :
Token_Index
:= No_Token_Index;
Transform_Res19 :
Bare_Project_Qualifier_Library
:= No_Bare_Gpr_Node;
Transform_Diags19 :
Ada.Containers.Count_Type;
Row_Pos22 :
Token_Index
:= No_Token_Index;
Token_Pos40 :
Token_Index
:= No_Token_Index;
Token_Res40 :
Token_Index
:= No_Token_Index;
Token_Pos41 :
Token_Index
:= No_Token_Index;
Token_Res41 :
Token_Index
:= No_Token_Index;
Transform_Res20 :
Bare_Project_Qualifier_Aggregate_Library
:= No_Bare_Gpr_Node;
Transform_Diags20 :
Ada.Containers.Count_Type;
Row_Pos23 :
Token_Index
:= No_Token_Index;
Token_Pos42 :
Token_Index
:= No_Token_Index;
Token_Res42 :
Token_Index
:= No_Token_Index;
Transform_Res21 :
Bare_Project_Qualifier_Aggregate
:= No_Bare_Gpr_Node;
Transform_Diags21 :
Ada.Containers.Count_Type;
Row_Pos24 :
Token_Index
:= No_Token_Index;
Token_Pos43 :
Token_Index
:= No_Token_Index;
Token_Res43 :
Token_Index
:= No_Token_Index;
Transform_Res22 :
Bare_Project_Qualifier_Configuration
:= No_Bare_Gpr_Node;
Transform_Diags22 :
Ada.Containers.Count_Type;
Row_Pos25 :
Token_Index
:= No_Token_Index;
Token_Pos44 :
Token_Index
:= No_Token_Index;
Token_Res44 :
Token_Index
:= No_Token_Index;
Transform_Res23 :
Bare_Project_Qualifier_Standard
:= No_Bare_Gpr_Node;
Transform_Diags23 :
Ada.Containers.Count_Type;
Or_Pos5 :
Token_Index
:= No_Token_Index;
Or_Res5 :
Bare_Project_Qualifier
:= No_Bare_Gpr_Node;
M : Memo_Entry := Get (Parser.Private_Part.Project_Qualifier_Or_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Or_Res5 := M.Instance;
return Or_Res5;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Or_Res5;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start or_code
Or_Pos5 := No_Token_Index;
Or_Res5 := No_Bare_Gpr_Node;
-- Start transform_code
Transform_Diags18 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos20 := Pos;
-- Start tok_code
Token_Res38 := Row_Pos20;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res38));
begin
if
T.Kind /= From_Token_Kind (Gpr_Abstract)
then
Token_Pos38 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos20 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos20,
Expected_Token_Id => Gpr_Abstract,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos38 := Row_Pos20 + 1;
end if;
end;
-- End tok_code
if Token_Pos38 /= No_Token_Index then
Row_Pos20 := Token_Pos38;
else
Row_Pos20 := No_Token_Index;
goto Exit_Row20_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row20_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos20 /= No_Token_Index then
Transform_Res18 := Allocate_Project_Qualifier_Abstract (Parser.Mem_Pool);
Initialize
(Self => Transform_Res18,
Kind => Gpr_Project_Qualifier_Abstract,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos20 = Pos
then No_Token_Index
else Row_Pos20 - 1));
elsif Row_Pos20 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags18);
end if;
-- End transform_code
if Row_Pos20 /= No_Token_Index then
Or_Pos5 := Row_Pos20;
Or_Res5 := Transform_Res18;
goto Exit_Or5;
end if;
-- Start transform_code
Transform_Diags19 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos21 := Pos;
-- Start tok_code
Token_Res39 := Row_Pos21;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res39));
begin
if
T.Kind /= From_Token_Kind (Gpr_Identifier)
or else T.Symbol /= Precomputed_Symbol
(Precomputed_Symbol_Table (Parser.TDH.Symbols),
Precomputed_Sym_Library)
then
Token_Pos39 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos21 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos21,
Expected_Token_Id => Gpr_Identifier,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos39 := Row_Pos21 + 1;
end if;
end;
-- End tok_code
if Token_Pos39 /= No_Token_Index then
Row_Pos21 := Token_Pos39;
else
Row_Pos21 := No_Token_Index;
goto Exit_Row21_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row21_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos21 /= No_Token_Index then
Transform_Res19 := Allocate_Project_Qualifier_Library (Parser.Mem_Pool);
Initialize
(Self => Transform_Res19,
Kind => Gpr_Project_Qualifier_Library,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos21 = Pos
then No_Token_Index
else Row_Pos21 - 1));
elsif Row_Pos21 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags19);
end if;
-- End transform_code
if Row_Pos21 /= No_Token_Index then
Or_Pos5 := Row_Pos21;
Or_Res5 := Transform_Res19;
goto Exit_Or5;
end if;
-- Start transform_code
Transform_Diags20 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos22 := Pos;
-- Start tok_code
Token_Res40 := Row_Pos22;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res40));
begin
if
T.Kind /= From_Token_Kind (Gpr_Identifier)
or else T.Symbol /= Precomputed_Symbol
(Precomputed_Symbol_Table (Parser.TDH.Symbols),
Precomputed_Sym_Aggregate)
then
Token_Pos40 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos22 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos22,
Expected_Token_Id => Gpr_Identifier,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos40 := Row_Pos22 + 1;
end if;
end;
-- End tok_code
if Token_Pos40 /= No_Token_Index then
Row_Pos22 := Token_Pos40;
else
Row_Pos22 := No_Token_Index;
goto Exit_Row22_0;
end if;
-- Start tok_code
Token_Res41 := Row_Pos22;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res41));
begin
if
T.Kind /= From_Token_Kind (Gpr_Identifier)
or else T.Symbol /= Precomputed_Symbol
(Precomputed_Symbol_Table (Parser.TDH.Symbols),
Precomputed_Sym_Library)
then
Token_Pos41 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos22 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos22,
Expected_Token_Id => Gpr_Identifier,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos41 := Row_Pos22 + 1;
end if;
end;
-- End tok_code
if Token_Pos41 /= No_Token_Index then
Row_Pos22 := Token_Pos41;
else
Row_Pos22 := No_Token_Index;
goto Exit_Row22_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row22_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos22 /= No_Token_Index then
Transform_Res20 := Allocate_Project_Qualifier_Aggregate_Library (Parser.Mem_Pool);
Initialize
(Self => Transform_Res20,
Kind => Gpr_Project_Qualifier_Aggregate_Library,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos22 = Pos
then No_Token_Index
else Row_Pos22 - 1));
elsif Row_Pos22 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags20);
end if;
-- End transform_code
if Row_Pos22 /= No_Token_Index then
Or_Pos5 := Row_Pos22;
Or_Res5 := Transform_Res20;
goto Exit_Or5;
end if;
-- Start transform_code
Transform_Diags21 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos23 := Pos;
-- Start tok_code
Token_Res42 := Row_Pos23;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res42));
begin
if
T.Kind /= From_Token_Kind (Gpr_Identifier)
or else T.Symbol /= Precomputed_Symbol
(Precomputed_Symbol_Table (Parser.TDH.Symbols),
Precomputed_Sym_Aggregate)
then
Token_Pos42 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos23 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos23,
Expected_Token_Id => Gpr_Identifier,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos42 := Row_Pos23 + 1;
end if;
end;
-- End tok_code
if Token_Pos42 /= No_Token_Index then
Row_Pos23 := Token_Pos42;
else
Row_Pos23 := No_Token_Index;
goto Exit_Row23_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row23_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos23 /= No_Token_Index then
Transform_Res21 := Allocate_Project_Qualifier_Aggregate (Parser.Mem_Pool);
Initialize
(Self => Transform_Res21,
Kind => Gpr_Project_Qualifier_Aggregate,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos23 = Pos
then No_Token_Index
else Row_Pos23 - 1));
elsif Row_Pos23 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags21);
end if;
-- End transform_code
if Row_Pos23 /= No_Token_Index then
Or_Pos5 := Row_Pos23;
Or_Res5 := Transform_Res21;
goto Exit_Or5;
end if;
-- Start transform_code
Transform_Diags22 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos24 := Pos;
-- Start tok_code
Token_Res43 := Row_Pos24;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res43));
begin
if
T.Kind /= From_Token_Kind (Gpr_Identifier)
or else T.Symbol /= Precomputed_Symbol
(Precomputed_Symbol_Table (Parser.TDH.Symbols),
Precomputed_Sym_Configuration)
then
Token_Pos43 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos24 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos24,
Expected_Token_Id => Gpr_Identifier,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos43 := Row_Pos24 + 1;
end if;
end;
-- End tok_code
if Token_Pos43 /= No_Token_Index then
Row_Pos24 := Token_Pos43;
else
Row_Pos24 := No_Token_Index;
goto Exit_Row24_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row24_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos24 /= No_Token_Index then
Transform_Res22 := Allocate_Project_Qualifier_Configuration (Parser.Mem_Pool);
Initialize
(Self => Transform_Res22,
Kind => Gpr_Project_Qualifier_Configuration,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos24 = Pos
then No_Token_Index
else Row_Pos24 - 1));
elsif Row_Pos24 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags22);
end if;
-- End transform_code
if Row_Pos24 /= No_Token_Index then
Or_Pos5 := Row_Pos24;
Or_Res5 := Transform_Res22;
goto Exit_Or5;
end if;
-- Start transform_code
Transform_Diags23 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos25 := Pos;
-- Start tok_code
Token_Res44 := Row_Pos25;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res44));
begin
if
T.Kind /= From_Token_Kind (Gpr_Identifier)
or else T.Symbol /= Precomputed_Symbol
(Precomputed_Symbol_Table (Parser.TDH.Symbols),
Precomputed_Sym_Standard)
then
Token_Pos44 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos25 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos25,
Expected_Token_Id => Gpr_Identifier,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos44 := Row_Pos25 + 1;
end if;
end;
-- End tok_code
if Token_Pos44 /= No_Token_Index then
Row_Pos25 := Token_Pos44;
else
Row_Pos25 := No_Token_Index;
goto Exit_Row25_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row25_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos25 /= No_Token_Index then
Transform_Res23 := Allocate_Project_Qualifier_Standard (Parser.Mem_Pool);
Initialize
(Self => Transform_Res23,
Kind => Gpr_Project_Qualifier_Standard,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos25 = Pos
then No_Token_Index
else Row_Pos25 - 1));
elsif Row_Pos25 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags23);
end if;
-- End transform_code
if Row_Pos25 /= No_Token_Index then
Or_Pos5 := Row_Pos25;
Or_Res5 := Transform_Res23;
goto Exit_Or5;
end if;
<<Exit_Or5>>
-- End or_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Project_Qualifier_Or_Parse0_Memo,
Or_Pos5 /= No_Token_Index,
Or_Res5,
Pos,
Or_Pos5);
Parser.Current_Pos := Or_Pos5;
return Or_Res5;
end Project_Qualifier_Or_Parse0;
function Simple_Declarative_Item_Or_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Gpr_Node
is
use Bare_Gpr_Node_Memos;
Defer_Pos41 :
Token_Index
:= No_Token_Index;
Defer_Res41 :
Bare_Variable_Decl
:= No_Bare_Gpr_Node;
Defer_Pos42 :
Token_Index
:= No_Token_Index;
Defer_Res42 :
Bare_Attribute_Decl
:= No_Bare_Gpr_Node;
Defer_Pos43 :
Token_Index
:= No_Token_Index;
Defer_Res43 :
Bare_Case_Construction
:= No_Bare_Gpr_Node;
Defer_Pos44 :
Token_Index
:= No_Token_Index;
Defer_Res44 :
Bare_Empty_Decl
:= No_Bare_Gpr_Node;
Or_Pos6 :
Token_Index
:= No_Token_Index;
Or_Res6 :
Bare_Gpr_Node
:= No_Bare_Gpr_Node;
M : Memo_Entry := Get (Parser.Private_Part.Simple_Declarative_Item_Or_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Or_Res6 := M.Instance;
return Or_Res6;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Or_Res6;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start or_code
Or_Pos6 := No_Token_Index;
Or_Res6 := No_Bare_Gpr_Node;
Defer_Res41 :=
Variable_Decl_Transform_Parse0 (Parser, Pos);
Defer_Pos41 := Parser.Current_Pos;
if Defer_Pos41 /= No_Token_Index then
Or_Pos6 := Defer_Pos41;
Or_Res6 := Defer_Res41;
goto Exit_Or6;
end if;
Defer_Res42 :=
Attribute_Decl_Transform_Parse0 (Parser, Pos);
Defer_Pos42 := Parser.Current_Pos;
if Defer_Pos42 /= No_Token_Index then
Or_Pos6 := Defer_Pos42;
Or_Res6 := Defer_Res42;
goto Exit_Or6;
end if;
Defer_Res43 :=
Case_Construction_Transform_Parse0 (Parser, Pos);
Defer_Pos43 := Parser.Current_Pos;
if Defer_Pos43 /= No_Token_Index then
Or_Pos6 := Defer_Pos43;
Or_Res6 := Defer_Res43;
goto Exit_Or6;
end if;
Defer_Res44 :=
Empty_Declaration_Transform_Parse0 (Parser, Pos);
Defer_Pos44 := Parser.Current_Pos;
if Defer_Pos44 /= No_Token_Index then
Or_Pos6 := Defer_Pos44;
Or_Res6 := Defer_Res44;
goto Exit_Or6;
end if;
<<Exit_Or6>>
-- End or_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Simple_Declarative_Item_Or_Parse0_Memo,
Or_Pos6 /= No_Token_Index,
Or_Res6,
Pos,
Or_Pos6);
Parser.Current_Pos := Or_Pos6;
return Or_Res6;
end Simple_Declarative_Item_Or_Parse0;
function Simple_Declarative_Items_List_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Gpr_Node_List
is
use Bare_Gpr_Node_List_Memos;
Lst_Cpos8 :
Token_Index
:= No_Token_Index;
Tmp_List8 :
Free_Parse_List;
Defer_Pos45 :
Token_Index
:= No_Token_Index;
Defer_Res45 :
Bare_Gpr_Node
:= No_Bare_Gpr_Node;
List_Pos8 :
Token_Index
:= No_Token_Index;
List_Res8 :
Bare_Gpr_Node_List
:= No_Bare_Gpr_Node;
M : Memo_Entry := Get (Parser.Private_Part.Simple_Declarative_Items_List_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
List_Res8 := M.Instance;
return List_Res8;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return List_Res8;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start list_code
List_Pos8 := Pos;
Lst_Cpos8 := Pos;
Tmp_List8 := Get_Parse_List (Parser);
loop
Defer_Res45 :=
Simple_Declarative_Item_Or_Parse0 (Parser, Lst_Cpos8);
Defer_Pos45 := Parser.Current_Pos;
exit when Defer_Pos45 = No_Token_Index;
List_Pos8 := Defer_Pos45;
Lst_Cpos8 := List_Pos8;
Tmp_List8.Nodes.Append (Defer_Res45);
end loop;
declare
Token_Start, Token_End : Token_Index;
Count : constant Natural := Tmp_List8.Nodes.Length;
begin
List_Res8 :=
Allocate_Gpr_Node_List (Parser.Mem_Pool);
if Count > 0 then
Token_Start := Pos;
Token_End := (if Lst_Cpos8 = Pos
then Pos
else Lst_Cpos8 - 1);
else
Token_Start := Token_Index'Max (Pos, 1);
Token_End := No_Token_Index;
end if;
Initialize
(Self => List_Res8,
Kind => Gpr_Gpr_Node_List,
Unit => Parser.Unit,
Token_Start_Index => Token_Start,
Token_End_Index => Token_End);
Initialize_List
(Self => List_Res8,
Parser => Parser,
Count => Count);
declare
Vec : Bare_Gpr_Node_Vectors.Vector renames
Tmp_List8.Nodes;
Arr : Alloc_AST_List_Array.Element_Array_Access renames
List_Res8.Nodes;
begin
Arr := Alloc_AST_List_Array.Alloc (Parser.Mem_Pool, Vec.Length);
for I in Vec.First_Index .. Vec.Last_Index loop
Arr (I) := Vec.Get (I);
end loop;
end;
end;
Release_Parse_List (Parser, Tmp_List8);
-- End list_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Simple_Declarative_Items_List_Parse0_Memo,
List_Pos8 /= No_Token_Index,
List_Res8,
Pos,
List_Pos8);
Parser.Current_Pos := List_Pos8;
return List_Res8;
end Simple_Declarative_Items_List_Parse0;
function Static_Name_Or_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Expr
is
use Bare_Expr_Memos;
Row_Pos26 :
Token_Index
:= No_Token_Index;
Defer_Pos46 :
Token_Index
:= No_Token_Index;
Defer_Res46 :
Bare_Expr
:= No_Bare_Gpr_Node;
Token_Pos45 :
Token_Index
:= No_Token_Index;
Token_Res45 :
Token_Index
:= No_Token_Index;
Defer_Pos47 :
Token_Index
:= No_Token_Index;
Defer_Res47 :
Bare_Identifier
:= No_Bare_Gpr_Node;
Transform_Res24 :
Bare_Prefix
:= No_Bare_Gpr_Node;
Transform_Diags24 :
Ada.Containers.Count_Type;
Defer_Pos48 :
Token_Index
:= No_Token_Index;
Defer_Res48 :
Bare_Identifier
:= No_Bare_Gpr_Node;
Or_Pos7 :
Token_Index
:= No_Token_Index;
Or_Res7 :
Bare_Expr
:= No_Bare_Gpr_Node;
Mem_Pos : Token_Index := Pos;
Mem_Res : Bare_Expr := No_Bare_Gpr_Node;
M : Memo_Entry := Get (Parser.Private_Part.Static_Name_Or_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Or_Res7 := M.Instance;
return Or_Res7;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Or_Res7;
end if;
Set (Parser.Private_Part.Static_Name_Or_Parse0_Memo, False, Or_Res7, Pos, Mem_Pos);
<<Try_Again>>
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start or_code
Or_Pos7 := No_Token_Index;
Or_Res7 := No_Bare_Gpr_Node;
-- Start transform_code
Transform_Diags24 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos26 := Pos;
Defer_Res46 :=
Static_Name_Or_Parse0 (Parser, Row_Pos26);
Defer_Pos46 := Parser.Current_Pos;
if Defer_Pos46 /= No_Token_Index then
Row_Pos26 := Defer_Pos46;
else
Row_Pos26 := No_Token_Index;
goto Exit_Row26_0;
end if;
-- Start tok_code
Token_Res45 := Row_Pos26;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res45));
begin
if
T.Kind /= From_Token_Kind (Gpr_Dot)
then
Token_Pos45 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos26 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos26,
Expected_Token_Id => Gpr_Dot,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos45 := Row_Pos26 + 1;
end if;
end;
-- End tok_code
if Token_Pos45 /= No_Token_Index then
Row_Pos26 := Token_Pos45;
else
Row_Pos26 := No_Token_Index;
goto Exit_Row26_0;
end if;
Defer_Res47 :=
Identifier_Transform_Parse0 (Parser, Row_Pos26);
Defer_Pos47 := Parser.Current_Pos;
if Defer_Pos47 /= No_Token_Index then
Row_Pos26 := Defer_Pos47;
else
Row_Pos26 := No_Token_Index;
goto Exit_Row26_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row26_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos26 /= No_Token_Index then
Transform_Res24 := Allocate_Prefix (Parser.Mem_Pool);
Initialize
(Self => Transform_Res24,
Kind => Gpr_Prefix,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos26 = Pos
then No_Token_Index
else Row_Pos26 - 1));
Initialize_Fields_For_Prefix
(Self => Transform_Res24, Prefix_F_Prefix => Defer_Res46, Prefix_F_Suffix => Defer_Res47);
if Defer_Res46 /= null and then Is_Incomplete (Defer_Res46) then
Transform_Res24.Last_Attempted_Child := 0;
elsif Defer_Res46 /= null and then not Is_Ghost (Defer_Res46) then
Transform_Res24.Last_Attempted_Child := -1;
end if;
if Defer_Res47 /= null and then Is_Incomplete (Defer_Res47) then
Transform_Res24.Last_Attempted_Child := 0;
elsif Defer_Res47 /= null and then not Is_Ghost (Defer_Res47) then
Transform_Res24.Last_Attempted_Child := -1;
end if;
elsif Row_Pos26 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags24);
end if;
-- End transform_code
if Row_Pos26 /= No_Token_Index then
Or_Pos7 := Row_Pos26;
Or_Res7 := Transform_Res24;
goto Exit_Or7;
end if;
Defer_Res48 :=
Identifier_Transform_Parse0 (Parser, Pos);
Defer_Pos48 := Parser.Current_Pos;
if Defer_Pos48 /= No_Token_Index then
Or_Pos7 := Defer_Pos48;
Or_Res7 := Defer_Res48;
goto Exit_Or7;
end if;
<<Exit_Or7>>
-- End or_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
if Or_Pos7 > Mem_Pos then
Mem_Pos := Or_Pos7;
Mem_Res := Or_Res7;
Set
(Parser.Private_Part.Static_Name_Or_Parse0_Memo,
Or_Pos7 /= No_Token_Index,
Or_Res7,
Pos,
Or_Pos7);
goto Try_Again;
elsif Mem_Pos > Pos then
Or_Res7 := Mem_Res;
Or_Pos7 := Mem_Pos;
goto No_Memo;
end if;
Set
(Parser.Private_Part.Static_Name_Or_Parse0_Memo,
Or_Pos7 /= No_Token_Index,
Or_Res7,
Pos,
Or_Pos7);
<<No_Memo>>
Parser.Current_Pos := Or_Pos7;
return Or_Res7;
end Static_Name_Or_Parse0;
function String_Literal_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_String_Literal
is
use Bare_String_Literal_Memos;
Row_Pos27 :
Token_Index
:= No_Token_Index;
Token_Pos46 :
Token_Index
:= No_Token_Index;
Token_Res46 :
Token_Index
:= No_Token_Index;
Transform_Res25 :
Bare_String_Literal
:= No_Bare_Gpr_Node;
Transform_Diags25 :
Ada.Containers.Count_Type;
M : Memo_Entry := Get (Parser.Private_Part.String_Literal_Transform_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Transform_Res25 := M.Instance;
return Transform_Res25;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Transform_Res25;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start transform_code
Transform_Diags25 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos27 := Pos;
-- Start tok_code
Token_Res46 := Row_Pos27;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res46));
begin
if
T.Kind /= From_Token_Kind (Gpr_String)
then
Token_Pos46 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos27 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos27,
Expected_Token_Id => Gpr_String,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos46 := Row_Pos27 + 1;
end if;
end;
-- End tok_code
if Token_Pos46 /= No_Token_Index then
Row_Pos27 := Token_Pos46;
else
Row_Pos27 := No_Token_Index;
goto Exit_Row27_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row27_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos27 /= No_Token_Index then
Transform_Res25 := Allocate_String_Literal (Parser.Mem_Pool);
Initialize
(Self => Transform_Res25,
Kind => Gpr_String_Literal,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos27 = Pos
then No_Token_Index
else Row_Pos27 - 1));
elsif Row_Pos27 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags25);
end if;
-- End transform_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.String_Literal_Transform_Parse0_Memo,
Row_Pos27 /= No_Token_Index,
Transform_Res25,
Pos,
Row_Pos27);
Parser.Current_Pos := Row_Pos27;
return Transform_Res25;
end String_Literal_Transform_Parse0;
function String_Literal_At_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_String_Literal_At
is
use Bare_String_Literal_At_Memos;
Row_Pos28 :
Token_Index
:= No_Token_Index;
Defer_Pos49 :
Token_Index
:= No_Token_Index;
Defer_Res49 :
Bare_String_Literal
:= No_Bare_Gpr_Node;
Row_Pos29 :
Token_Index
:= No_Token_Index;
Token_Pos47 :
Token_Index
:= No_Token_Index;
Token_Res47 :
Token_Index
:= No_Token_Index;
Defer_Pos50 :
Token_Index
:= No_Token_Index;
Defer_Res50 :
Bare_Num_Literal
:= No_Bare_Gpr_Node;
Transform_Res26 :
Bare_String_Literal_At
:= No_Bare_Gpr_Node;
Transform_Diags26 :
Ada.Containers.Count_Type;
M : Memo_Entry := Get (Parser.Private_Part.String_Literal_At_Transform_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Transform_Res26 := M.Instance;
return Transform_Res26;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Transform_Res26;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start transform_code
Transform_Diags26 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos28 := Pos;
Defer_Res49 :=
String_Literal_Transform_Parse0 (Parser, Row_Pos28);
Defer_Pos49 := Parser.Current_Pos;
if Defer_Pos49 /= No_Token_Index then
Row_Pos28 := Defer_Pos49;
else
Row_Pos28 := No_Token_Index;
goto Exit_Row28_0;
end if;
-- Start opt_code
-- Start row_code
Row_Pos29 := Row_Pos28;
-- Start tok_code
Token_Res47 := Row_Pos29;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res47));
begin
if
T.Kind /= From_Token_Kind (Gpr_At)
then
Token_Pos47 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos29 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos29,
Expected_Token_Id => Gpr_At,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos47 := Row_Pos29 + 1;
end if;
end;
-- End tok_code
if Token_Pos47 /= No_Token_Index then
Row_Pos29 := Token_Pos47;
else
Row_Pos29 := No_Token_Index;
goto Exit_Row29_0;
end if;
Defer_Res50 :=
Num_Literal_Transform_Parse0 (Parser, Row_Pos29);
Defer_Pos50 := Parser.Current_Pos;
if Defer_Pos50 /= No_Token_Index then
Row_Pos29 := Defer_Pos50;
else
Row_Pos29 := No_Token_Index;
goto Exit_Row29_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row29_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos29 = No_Token_Index then
Defer_Res50 := No_Bare_Gpr_Node;
Row_Pos29 := Row_Pos28;
end if;
-- End opt_code
if Row_Pos29 /= No_Token_Index then
Row_Pos28 := Row_Pos29;
else
Row_Pos28 := No_Token_Index;
goto Exit_Row28_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row28_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos28 /= No_Token_Index then
Transform_Res26 := Allocate_String_Literal_At (Parser.Mem_Pool);
Initialize
(Self => Transform_Res26,
Kind => Gpr_String_Literal_At,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos28 = Pos
then No_Token_Index
else Row_Pos28 - 1));
Initialize_Fields_For_String_Literal_At
(Self => Transform_Res26, String_Literal_At_F_Str_Lit => Defer_Res49, String_Literal_At_F_At_Lit => Defer_Res50);
if Defer_Res49 /= null and then Is_Incomplete (Defer_Res49) then
Transform_Res26.Last_Attempted_Child := 0;
elsif Defer_Res49 /= null and then not Is_Ghost (Defer_Res49) then
Transform_Res26.Last_Attempted_Child := -1;
end if;
if Defer_Res50 /= null and then Is_Incomplete (Defer_Res50) then
Transform_Res26.Last_Attempted_Child := 0;
elsif Defer_Res50 /= null and then not Is_Ghost (Defer_Res50) then
Transform_Res26.Last_Attempted_Child := -1;
end if;
elsif Row_Pos28 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags26);
end if;
-- End transform_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.String_Literal_At_Transform_Parse0_Memo,
Row_Pos28 /= No_Token_Index,
Transform_Res26,
Pos,
Row_Pos28);
Parser.Current_Pos := Row_Pos28;
return Transform_Res26;
end String_Literal_At_Transform_Parse0;
function Term_Or_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Gpr_Node
is
use Bare_Gpr_Node_Memos;
Defer_Pos51 :
Token_Index
:= No_Token_Index;
Defer_Res51 :
Bare_Terms
:= No_Bare_Gpr_Node;
Defer_Pos52 :
Token_Index
:= No_Token_Index;
Defer_Res52 :
Bare_String_Literal_At
:= No_Bare_Gpr_Node;
Defer_Pos53 :
Token_Index
:= No_Token_Index;
Defer_Res53 :
Bare_Builtin_Function_Call
:= No_Bare_Gpr_Node;
Defer_Pos54 :
Token_Index
:= No_Token_Index;
Defer_Res54 :
Bare_Variable_Reference
:= No_Bare_Gpr_Node;
Or_Pos8 :
Token_Index
:= No_Token_Index;
Or_Res8 :
Bare_Gpr_Node
:= No_Bare_Gpr_Node;
M : Memo_Entry := Get (Parser.Private_Part.Term_Or_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Or_Res8 := M.Instance;
return Or_Res8;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Or_Res8;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start or_code
Or_Pos8 := No_Token_Index;
Or_Res8 := No_Bare_Gpr_Node;
Defer_Res51 :=
Expression_List_Transform_Parse0 (Parser, Pos);
Defer_Pos51 := Parser.Current_Pos;
if Defer_Pos51 /= No_Token_Index then
Or_Pos8 := Defer_Pos51;
Or_Res8 := Defer_Res51;
goto Exit_Or8;
end if;
Defer_Res52 :=
String_Literal_At_Transform_Parse0 (Parser, Pos);
Defer_Pos52 := Parser.Current_Pos;
if Defer_Pos52 /= No_Token_Index then
Or_Pos8 := Defer_Pos52;
Or_Res8 := Defer_Res52;
goto Exit_Or8;
end if;
Defer_Res53 :=
Builtin_Function_Call_Transform_Parse0 (Parser, Pos);
Defer_Pos53 := Parser.Current_Pos;
if Defer_Pos53 /= No_Token_Index then
Or_Pos8 := Defer_Pos53;
Or_Res8 := Defer_Res53;
goto Exit_Or8;
end if;
Defer_Res54 :=
Variable_Reference_Transform_Parse0 (Parser, Pos);
Defer_Pos54 := Parser.Current_Pos;
if Defer_Pos54 /= No_Token_Index then
Or_Pos8 := Defer_Pos54;
Or_Res8 := Defer_Res54;
goto Exit_Or8;
end if;
<<Exit_Or8>>
-- End or_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Term_Or_Parse0_Memo,
Or_Pos8 /= No_Token_Index,
Or_Res8,
Pos,
Or_Pos8);
Parser.Current_Pos := Or_Pos8;
return Or_Res8;
end Term_Or_Parse0;
function Type_Reference_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Type_Reference
is
use Bare_Type_Reference_Memos;
Row_Pos30 :
Token_Index
:= No_Token_Index;
Lst_Cpos9 :
Token_Index
:= No_Token_Index;
Tmp_List9 :
Free_Parse_List;
Defer_Pos55 :
Token_Index
:= No_Token_Index;
Defer_Res55 :
Bare_Identifier
:= No_Bare_Gpr_Node;
Token_Pos48 :
Token_Index
:= No_Token_Index;
Token_Res48 :
Token_Index
:= No_Token_Index;
List_Pos9 :
Token_Index
:= No_Token_Index;
List_Res9 :
Bare_Identifier_List
:= No_Bare_Gpr_Node;
Transform_Res27 :
Bare_Type_Reference
:= No_Bare_Gpr_Node;
Transform_Diags27 :
Ada.Containers.Count_Type;
M : Memo_Entry := Get (Parser.Private_Part.Type_Reference_Transform_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Transform_Res27 := M.Instance;
return Transform_Res27;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Transform_Res27;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start transform_code
Transform_Diags27 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos30 := Pos;
-- Start list_code
List_Pos9 := No_Token_Index;
Lst_Cpos9 := Row_Pos30;
Tmp_List9 := Get_Parse_List (Parser);
loop
Defer_Res55 :=
Identifier_Transform_Parse0 (Parser, Lst_Cpos9);
Defer_Pos55 := Parser.Current_Pos;
exit when Defer_Pos55 = No_Token_Index;
List_Pos9 := Defer_Pos55;
Lst_Cpos9 := List_Pos9;
Tmp_List9.Nodes.Append (Defer_Res55);
-- Start tok_code
Token_Res48 := Lst_Cpos9;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res48));
begin
if
T.Kind /= From_Token_Kind (Gpr_Dot)
then
Token_Pos48 := No_Token_Index;
if Parser.Last_Fail.Pos <= Lst_Cpos9 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Lst_Cpos9,
Expected_Token_Id => Gpr_Dot,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos48 := Lst_Cpos9 + 1;
end if;
end;
-- End tok_code
if Token_Pos48 /= No_Token_Index then
Lst_Cpos9 := Token_Pos48;
else
exit;
end if;
end loop;
declare
Token_Start, Token_End : Token_Index;
Count : constant Natural := Tmp_List9.Nodes.Length;
begin
List_Res9 :=
Allocate_Identifier_List (Parser.Mem_Pool);
if Count > 0 then
Token_Start := Row_Pos30;
Token_End := (if Lst_Cpos9 = Row_Pos30
then Row_Pos30
else Lst_Cpos9 - 1);
else
Token_Start := Token_Index'Max (Row_Pos30, 1);
Token_End := No_Token_Index;
end if;
Initialize
(Self => List_Res9,
Kind => Gpr_Identifier_List,
Unit => Parser.Unit,
Token_Start_Index => Token_Start,
Token_End_Index => Token_End);
Initialize_List
(Self => List_Res9,
Parser => Parser,
Count => Count);
declare
Vec : Bare_Gpr_Node_Vectors.Vector renames
Tmp_List9.Nodes;
Arr : Alloc_AST_List_Array.Element_Array_Access renames
List_Res9.Nodes;
begin
Arr := Alloc_AST_List_Array.Alloc (Parser.Mem_Pool, Vec.Length);
for I in Vec.First_Index .. Vec.Last_Index loop
Arr (I) := Vec.Get (I);
end loop;
end;
end;
Release_Parse_List (Parser, Tmp_List9);
-- End list_code
if List_Pos9 /= No_Token_Index then
Row_Pos30 := List_Pos9;
else
Row_Pos30 := No_Token_Index;
goto Exit_Row30_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row30_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos30 /= No_Token_Index then
Transform_Res27 := Allocate_Type_Reference (Parser.Mem_Pool);
Initialize
(Self => Transform_Res27,
Kind => Gpr_Type_Reference,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos30 = Pos
then No_Token_Index
else Row_Pos30 - 1));
Initialize_Fields_For_Type_Reference
(Self => Transform_Res27, Type_Reference_F_Var_Type_Name => List_Res9);
if List_Res9 /= null and then Is_Incomplete (List_Res9) then
Transform_Res27.Last_Attempted_Child := 0;
elsif List_Res9 /= null and then not Is_Ghost (List_Res9) then
Transform_Res27.Last_Attempted_Child := -1;
end if;
elsif Row_Pos30 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags27);
end if;
-- End transform_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Type_Reference_Transform_Parse0_Memo,
Row_Pos30 /= No_Token_Index,
Transform_Res27,
Pos,
Row_Pos30);
Parser.Current_Pos := Row_Pos30;
return Transform_Res27;
end Type_Reference_Transform_Parse0;
function Typed_String_Decl_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Typed_String_Decl
is
use Bare_Typed_String_Decl_Memos;
Row_Pos31 :
Token_Index
:= No_Token_Index;
Token_Pos49 :
Token_Index
:= No_Token_Index;
Token_Res49 :
Token_Index
:= No_Token_Index;
Defer_Pos56 :
Token_Index
:= No_Token_Index;
Defer_Res56 :
Bare_Identifier
:= No_Bare_Gpr_Node;
Token_Pos50 :
Token_Index
:= No_Token_Index;
Token_Res50 :
Token_Index
:= No_Token_Index;
Token_Pos51 :
Token_Index
:= No_Token_Index;
Token_Res51 :
Token_Index
:= No_Token_Index;
Lst_Cpos10 :
Token_Index
:= No_Token_Index;
Tmp_List10 :
Free_Parse_List;
Defer_Pos57 :
Token_Index
:= No_Token_Index;
Defer_Res57 :
Bare_String_Literal
:= No_Bare_Gpr_Node;
Token_Pos52 :
Token_Index
:= No_Token_Index;
Token_Res52 :
Token_Index
:= No_Token_Index;
List_Pos10 :
Token_Index
:= No_Token_Index;
List_Res10 :
Bare_String_Literal_List
:= No_Bare_Gpr_Node;
Token_Pos53 :
Token_Index
:= No_Token_Index;
Token_Res53 :
Token_Index
:= No_Token_Index;
Token_Pos54 :
Token_Index
:= No_Token_Index;
Token_Res54 :
Token_Index
:= No_Token_Index;
Transform_Res28 :
Bare_Typed_String_Decl
:= No_Bare_Gpr_Node;
Transform_Diags28 :
Ada.Containers.Count_Type;
M : Memo_Entry := Get (Parser.Private_Part.Typed_String_Decl_Transform_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Transform_Res28 := M.Instance;
return Transform_Res28;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Transform_Res28;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start transform_code
Transform_Diags28 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos31 := Pos;
-- Start tok_code
Token_Res49 := Row_Pos31;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res49));
begin
if
T.Kind /= From_Token_Kind (Gpr_Type)
then
Token_Pos49 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos31 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos31,
Expected_Token_Id => Gpr_Type,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos49 := Row_Pos31 + 1;
end if;
end;
-- End tok_code
if Token_Pos49 /= No_Token_Index then
Row_Pos31 := Token_Pos49;
else
Row_Pos31 := No_Token_Index;
goto Exit_Row31_0;
end if;
Defer_Res56 :=
Identifier_Transform_Parse0 (Parser, Row_Pos31);
Defer_Pos56 := Parser.Current_Pos;
if Defer_Pos56 /= No_Token_Index then
Row_Pos31 := Defer_Pos56;
else
Row_Pos31 := No_Token_Index;
goto Exit_Row31_0;
end if;
-- Start tok_code
Token_Res50 := Row_Pos31;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res50));
begin
if
T.Kind /= From_Token_Kind (Gpr_Is)
then
Token_Pos50 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos31 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos31,
Expected_Token_Id => Gpr_Is,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos50 := Row_Pos31 + 1;
end if;
end;
-- End tok_code
if Token_Pos50 /= No_Token_Index then
Row_Pos31 := Token_Pos50;
else
Row_Pos31 := No_Token_Index;
goto Exit_Row31_0;
end if;
-- Start tok_code
Token_Res51 := Row_Pos31;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res51));
begin
if
T.Kind /= From_Token_Kind (Gpr_Par_Open)
then
Token_Pos51 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos31 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos31,
Expected_Token_Id => Gpr_Par_Open,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos51 := Row_Pos31 + 1;
end if;
end;
-- End tok_code
if Token_Pos51 /= No_Token_Index then
Row_Pos31 := Token_Pos51;
else
Row_Pos31 := No_Token_Index;
goto Exit_Row31_0;
end if;
-- Start list_code
List_Pos10 := No_Token_Index;
Lst_Cpos10 := Row_Pos31;
Tmp_List10 := Get_Parse_List (Parser);
loop
Defer_Res57 :=
String_Literal_Transform_Parse0 (Parser, Lst_Cpos10);
Defer_Pos57 := Parser.Current_Pos;
exit when Defer_Pos57 = No_Token_Index;
List_Pos10 := Defer_Pos57;
Lst_Cpos10 := List_Pos10;
Tmp_List10.Nodes.Append (Defer_Res57);
-- Start tok_code
Token_Res52 := Lst_Cpos10;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res52));
begin
if
T.Kind /= From_Token_Kind (Gpr_Comma)
then
Token_Pos52 := No_Token_Index;
if Parser.Last_Fail.Pos <= Lst_Cpos10 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Lst_Cpos10,
Expected_Token_Id => Gpr_Comma,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos52 := Lst_Cpos10 + 1;
end if;
end;
-- End tok_code
if Token_Pos52 /= No_Token_Index then
Lst_Cpos10 := Token_Pos52;
else
exit;
end if;
end loop;
declare
Token_Start, Token_End : Token_Index;
Count : constant Natural := Tmp_List10.Nodes.Length;
begin
List_Res10 :=
Allocate_String_Literal_List (Parser.Mem_Pool);
if Count > 0 then
Token_Start := Row_Pos31;
Token_End := (if Lst_Cpos10 = Row_Pos31
then Row_Pos31
else Lst_Cpos10 - 1);
else
Token_Start := Token_Index'Max (Row_Pos31, 1);
Token_End := No_Token_Index;
end if;
Initialize
(Self => List_Res10,
Kind => Gpr_String_Literal_List,
Unit => Parser.Unit,
Token_Start_Index => Token_Start,
Token_End_Index => Token_End);
Initialize_List
(Self => List_Res10,
Parser => Parser,
Count => Count);
declare
Vec : Bare_Gpr_Node_Vectors.Vector renames
Tmp_List10.Nodes;
Arr : Alloc_AST_List_Array.Element_Array_Access renames
List_Res10.Nodes;
begin
Arr := Alloc_AST_List_Array.Alloc (Parser.Mem_Pool, Vec.Length);
for I in Vec.First_Index .. Vec.Last_Index loop
Arr (I) := Vec.Get (I);
end loop;
end;
end;
Release_Parse_List (Parser, Tmp_List10);
-- End list_code
if List_Pos10 /= No_Token_Index then
Row_Pos31 := List_Pos10;
else
Row_Pos31 := No_Token_Index;
goto Exit_Row31_0;
end if;
-- Start tok_code
Token_Res53 := Row_Pos31;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res53));
begin
if
T.Kind /= From_Token_Kind (Gpr_Par_Close)
then
Token_Pos53 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos31 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos31,
Expected_Token_Id => Gpr_Par_Close,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos53 := Row_Pos31 + 1;
end if;
end;
-- End tok_code
if Token_Pos53 /= No_Token_Index then
Row_Pos31 := Token_Pos53;
else
Row_Pos31 := No_Token_Index;
goto Exit_Row31_0;
end if;
-- Start tok_code
Token_Res54 := Row_Pos31;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res54));
begin
if
T.Kind /= From_Token_Kind (Gpr_Semicolon)
then
Token_Pos54 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos31 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos31,
Expected_Token_Id => Gpr_Semicolon,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos54 := Row_Pos31 + 1;
end if;
end;
-- End tok_code
if Token_Pos54 /= No_Token_Index then
Row_Pos31 := Token_Pos54;
else
Row_Pos31 := No_Token_Index;
goto Exit_Row31_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row31_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos31 /= No_Token_Index then
Transform_Res28 := Allocate_Typed_String_Decl (Parser.Mem_Pool);
Initialize
(Self => Transform_Res28,
Kind => Gpr_Typed_String_Decl,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos31 = Pos
then No_Token_Index
else Row_Pos31 - 1));
Initialize_Fields_For_Typed_String_Decl
(Self => Transform_Res28, Typed_String_Decl_F_Type_Id => Defer_Res56, Typed_String_Decl_F_String_Literals => List_Res10);
if Defer_Res56 /= null and then Is_Incomplete (Defer_Res56) then
Transform_Res28.Last_Attempted_Child := 0;
elsif Defer_Res56 /= null and then not Is_Ghost (Defer_Res56) then
Transform_Res28.Last_Attempted_Child := -1;
end if;
if List_Res10 /= null and then Is_Incomplete (List_Res10) then
Transform_Res28.Last_Attempted_Child := 0;
elsif List_Res10 /= null and then not Is_Ghost (List_Res10) then
Transform_Res28.Last_Attempted_Child := -1;
end if;
elsif Row_Pos31 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags28);
end if;
-- End transform_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Typed_String_Decl_Transform_Parse0_Memo,
Row_Pos31 /= No_Token_Index,
Transform_Res28,
Pos,
Row_Pos31);
Parser.Current_Pos := Row_Pos31;
return Transform_Res28;
end Typed_String_Decl_Transform_Parse0;
function Variable_Decl_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Variable_Decl
is
use Bare_Variable_Decl_Memos;
Row_Pos32 :
Token_Index
:= No_Token_Index;
Defer_Pos58 :
Token_Index
:= No_Token_Index;
Defer_Res58 :
Bare_Identifier
:= No_Bare_Gpr_Node;
Row_Pos33 :
Token_Index
:= No_Token_Index;
Token_Pos55 :
Token_Index
:= No_Token_Index;
Token_Res55 :
Token_Index
:= No_Token_Index;
Defer_Pos59 :
Token_Index
:= No_Token_Index;
Defer_Res59 :
Bare_Type_Reference
:= No_Bare_Gpr_Node;
Token_Pos56 :
Token_Index
:= No_Token_Index;
Token_Res56 :
Token_Index
:= No_Token_Index;
Defer_Pos60 :
Token_Index
:= No_Token_Index;
Defer_Res60 :
Bare_Term_List
:= No_Bare_Gpr_Node;
Token_Pos57 :
Token_Index
:= No_Token_Index;
Token_Res57 :
Token_Index
:= No_Token_Index;
Transform_Res29 :
Bare_Variable_Decl
:= No_Bare_Gpr_Node;
Transform_Diags29 :
Ada.Containers.Count_Type;
M : Memo_Entry := Get (Parser.Private_Part.Variable_Decl_Transform_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Transform_Res29 := M.Instance;
return Transform_Res29;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Transform_Res29;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start transform_code
Transform_Diags29 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos32 := Pos;
Defer_Res58 :=
Identifier_Transform_Parse0 (Parser, Row_Pos32);
Defer_Pos58 := Parser.Current_Pos;
if Defer_Pos58 /= No_Token_Index then
Row_Pos32 := Defer_Pos58;
else
Row_Pos32 := No_Token_Index;
goto Exit_Row32_0;
end if;
-- Start opt_code
-- Start row_code
Row_Pos33 := Row_Pos32;
-- Start tok_code
Token_Res55 := Row_Pos33;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res55));
begin
if
T.Kind /= From_Token_Kind (Gpr_Colon)
then
Token_Pos55 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos33 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos33,
Expected_Token_Id => Gpr_Colon,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos55 := Row_Pos33 + 1;
end if;
end;
-- End tok_code
if Token_Pos55 /= No_Token_Index then
Row_Pos33 := Token_Pos55;
else
Row_Pos33 := No_Token_Index;
goto Exit_Row33_0;
end if;
Defer_Res59 :=
Type_Reference_Transform_Parse0 (Parser, Row_Pos33);
Defer_Pos59 := Parser.Current_Pos;
if Defer_Pos59 /= No_Token_Index then
Row_Pos33 := Defer_Pos59;
else
Row_Pos33 := No_Token_Index;
goto Exit_Row33_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row33_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos33 = No_Token_Index then
Defer_Res59 := No_Bare_Gpr_Node;
Row_Pos33 := Row_Pos32;
end if;
-- End opt_code
if Row_Pos33 /= No_Token_Index then
Row_Pos32 := Row_Pos33;
else
Row_Pos32 := No_Token_Index;
goto Exit_Row32_0;
end if;
-- Start tok_code
Token_Res56 := Row_Pos32;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res56));
begin
if
T.Kind /= From_Token_Kind (Gpr_Assign)
then
Token_Pos56 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos32 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos32,
Expected_Token_Id => Gpr_Assign,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos56 := Row_Pos32 + 1;
end if;
end;
-- End tok_code
if Token_Pos56 /= No_Token_Index then
Row_Pos32 := Token_Pos56;
else
Row_Pos32 := No_Token_Index;
goto Exit_Row32_0;
end if;
Defer_Res60 :=
Expression_List_Parse0 (Parser, Row_Pos32);
Defer_Pos60 := Parser.Current_Pos;
if Defer_Pos60 /= No_Token_Index then
Row_Pos32 := Defer_Pos60;
else
Row_Pos32 := No_Token_Index;
goto Exit_Row32_0;
end if;
-- Start tok_code
Token_Res57 := Row_Pos32;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res57));
begin
if
T.Kind /= From_Token_Kind (Gpr_Semicolon)
then
Token_Pos57 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos32 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos32,
Expected_Token_Id => Gpr_Semicolon,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos57 := Row_Pos32 + 1;
end if;
end;
-- End tok_code
if Token_Pos57 /= No_Token_Index then
Row_Pos32 := Token_Pos57;
else
Row_Pos32 := No_Token_Index;
goto Exit_Row32_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row32_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos32 /= No_Token_Index then
Transform_Res29 := Allocate_Variable_Decl (Parser.Mem_Pool);
Initialize
(Self => Transform_Res29,
Kind => Gpr_Variable_Decl,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos32 = Pos
then No_Token_Index
else Row_Pos32 - 1));
Initialize_Fields_For_Variable_Decl
(Self => Transform_Res29, Variable_Decl_F_Var_Name => Defer_Res58, Variable_Decl_F_Var_Type => Defer_Res59, Variable_Decl_F_Expr => Defer_Res60);
if Defer_Res58 /= null and then Is_Incomplete (Defer_Res58) then
Transform_Res29.Last_Attempted_Child := 0;
elsif Defer_Res58 /= null and then not Is_Ghost (Defer_Res58) then
Transform_Res29.Last_Attempted_Child := -1;
end if;
if Defer_Res59 /= null and then Is_Incomplete (Defer_Res59) then
Transform_Res29.Last_Attempted_Child := 0;
elsif Defer_Res59 /= null and then not Is_Ghost (Defer_Res59) then
Transform_Res29.Last_Attempted_Child := -1;
end if;
if Defer_Res60 /= null and then Is_Incomplete (Defer_Res60) then
Transform_Res29.Last_Attempted_Child := 0;
elsif Defer_Res60 /= null and then not Is_Ghost (Defer_Res60) then
Transform_Res29.Last_Attempted_Child := -1;
end if;
elsif Row_Pos32 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags29);
end if;
-- End transform_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Variable_Decl_Transform_Parse0_Memo,
Row_Pos32 /= No_Token_Index,
Transform_Res29,
Pos,
Row_Pos32);
Parser.Current_Pos := Row_Pos32;
return Transform_Res29;
end Variable_Decl_Transform_Parse0;
function Variable_Reference_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_Variable_Reference
is
use Bare_Variable_Reference_Memos;
Row_Pos34 :
Token_Index
:= No_Token_Index;
Lst_Cpos11 :
Token_Index
:= No_Token_Index;
Tmp_List11 :
Free_Parse_List;
Defer_Pos61 :
Token_Index
:= No_Token_Index;
Defer_Res61 :
Bare_Identifier
:= No_Bare_Gpr_Node;
Token_Pos58 :
Token_Index
:= No_Token_Index;
Token_Res58 :
Token_Index
:= No_Token_Index;
List_Pos11 :
Token_Index
:= No_Token_Index;
List_Res11 :
Bare_Identifier_List
:= No_Bare_Gpr_Node;
Row_Pos35 :
Token_Index
:= No_Token_Index;
Token_Pos59 :
Token_Index
:= No_Token_Index;
Token_Res59 :
Token_Index
:= No_Token_Index;
Defer_Pos62 :
Token_Index
:= No_Token_Index;
Defer_Res62 :
Bare_Attribute_Reference
:= No_Bare_Gpr_Node;
Transform_Res30 :
Bare_Variable_Reference
:= No_Bare_Gpr_Node;
Transform_Diags30 :
Ada.Containers.Count_Type;
M : Memo_Entry := Get (Parser.Private_Part.Variable_Reference_Transform_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Transform_Res30 := M.Instance;
return Transform_Res30;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Transform_Res30;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start transform_code
Transform_Diags30 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos34 := Pos;
-- Start list_code
List_Pos11 := No_Token_Index;
Lst_Cpos11 := Row_Pos34;
Tmp_List11 := Get_Parse_List (Parser);
loop
Defer_Res61 :=
Identifier_Transform_Parse0 (Parser, Lst_Cpos11);
Defer_Pos61 := Parser.Current_Pos;
exit when Defer_Pos61 = No_Token_Index;
List_Pos11 := Defer_Pos61;
Lst_Cpos11 := List_Pos11;
Tmp_List11.Nodes.Append (Defer_Res61);
-- Start tok_code
Token_Res58 := Lst_Cpos11;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res58));
begin
if
T.Kind /= From_Token_Kind (Gpr_Dot)
then
Token_Pos58 := No_Token_Index;
if Parser.Last_Fail.Pos <= Lst_Cpos11 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Lst_Cpos11,
Expected_Token_Id => Gpr_Dot,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos58 := Lst_Cpos11 + 1;
end if;
end;
-- End tok_code
if Token_Pos58 /= No_Token_Index then
Lst_Cpos11 := Token_Pos58;
else
exit;
end if;
end loop;
declare
Token_Start, Token_End : Token_Index;
Count : constant Natural := Tmp_List11.Nodes.Length;
begin
List_Res11 :=
Allocate_Identifier_List (Parser.Mem_Pool);
if Count > 0 then
Token_Start := Row_Pos34;
Token_End := (if Lst_Cpos11 = Row_Pos34
then Row_Pos34
else Lst_Cpos11 - 1);
else
Token_Start := Token_Index'Max (Row_Pos34, 1);
Token_End := No_Token_Index;
end if;
Initialize
(Self => List_Res11,
Kind => Gpr_Identifier_List,
Unit => Parser.Unit,
Token_Start_Index => Token_Start,
Token_End_Index => Token_End);
Initialize_List
(Self => List_Res11,
Parser => Parser,
Count => Count);
declare
Vec : Bare_Gpr_Node_Vectors.Vector renames
Tmp_List11.Nodes;
Arr : Alloc_AST_List_Array.Element_Array_Access renames
List_Res11.Nodes;
begin
Arr := Alloc_AST_List_Array.Alloc (Parser.Mem_Pool, Vec.Length);
for I in Vec.First_Index .. Vec.Last_Index loop
Arr (I) := Vec.Get (I);
end loop;
end;
end;
Release_Parse_List (Parser, Tmp_List11);
-- End list_code
if List_Pos11 /= No_Token_Index then
Row_Pos34 := List_Pos11;
else
Row_Pos34 := No_Token_Index;
goto Exit_Row34_0;
end if;
-- Start opt_code
-- Start row_code
Row_Pos35 := Row_Pos34;
-- Start tok_code
Token_Res59 := Row_Pos35;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res59));
begin
if
T.Kind /= From_Token_Kind (Gpr_Tick)
then
Token_Pos59 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos35 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos35,
Expected_Token_Id => Gpr_Tick,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos59 := Row_Pos35 + 1;
end if;
end;
-- End tok_code
if Token_Pos59 /= No_Token_Index then
Row_Pos35 := Token_Pos59;
else
Row_Pos35 := No_Token_Index;
goto Exit_Row35_0;
end if;
Defer_Res62 :=
Attribute_Reference_Transform_Parse0 (Parser, Row_Pos35);
Defer_Pos62 := Parser.Current_Pos;
if Defer_Pos62 /= No_Token_Index then
Row_Pos35 := Defer_Pos62;
else
Row_Pos35 := No_Token_Index;
goto Exit_Row35_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row35_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos35 = No_Token_Index then
Defer_Res62 := No_Bare_Gpr_Node;
Row_Pos35 := Row_Pos34;
end if;
-- End opt_code
if Row_Pos35 /= No_Token_Index then
Row_Pos34 := Row_Pos35;
else
Row_Pos34 := No_Token_Index;
goto Exit_Row34_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row34_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos34 /= No_Token_Index then
Transform_Res30 := Allocate_Variable_Reference (Parser.Mem_Pool);
Initialize
(Self => Transform_Res30,
Kind => Gpr_Variable_Reference,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos34 = Pos
then No_Token_Index
else Row_Pos34 - 1));
Initialize_Fields_For_Variable_Reference
(Self => Transform_Res30, Variable_Reference_F_Variable_Name => List_Res11, Variable_Reference_F_Attribute_Ref => Defer_Res62);
if List_Res11 /= null and then Is_Incomplete (List_Res11) then
Transform_Res30.Last_Attempted_Child := 0;
elsif List_Res11 /= null and then not Is_Ghost (List_Res11) then
Transform_Res30.Last_Attempted_Child := -1;
end if;
if Defer_Res62 /= null and then Is_Incomplete (Defer_Res62) then
Transform_Res30.Last_Attempted_Child := 0;
elsif Defer_Res62 /= null and then not Is_Ghost (Defer_Res62) then
Transform_Res30.Last_Attempted_Child := -1;
end if;
elsif Row_Pos34 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags30);
end if;
-- End transform_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.Variable_Reference_Transform_Parse0_Memo,
Row_Pos34 /= No_Token_Index,
Transform_Res30,
Pos,
Row_Pos34);
Parser.Current_Pos := Row_Pos34;
return Transform_Res30;
end Variable_Reference_Transform_Parse0;
function With_Decl_Transform_Parse0
(Parser : in out Parser_Type;
Pos : Token_Index) return Bare_With_Decl
is
use Bare_With_Decl_Memos;
Row_Pos36 :
Token_Index
:= No_Token_Index;
Token_Pos60 :
Token_Index
:= No_Token_Index;
Token_Res60 :
Token_Index
:= No_Token_Index;
Opt_Res1 :
Bare_Limited_Node
:= No_Bare_Gpr_Node;
Token_Pos61 :
Token_Index
:= No_Token_Index;
Token_Res61 :
Token_Index
:= No_Token_Index;
Lst_Cpos12 :
Token_Index
:= No_Token_Index;
Tmp_List12 :
Free_Parse_List;
Defer_Pos63 :
Token_Index
:= No_Token_Index;
Defer_Res63 :
Bare_String_Literal
:= No_Bare_Gpr_Node;
Token_Pos62 :
Token_Index
:= No_Token_Index;
Token_Res62 :
Token_Index
:= No_Token_Index;
List_Pos12 :
Token_Index
:= No_Token_Index;
List_Res12 :
Bare_String_Literal_List
:= No_Bare_Gpr_Node;
Token_Pos63 :
Token_Index
:= No_Token_Index;
Token_Res63 :
Token_Index
:= No_Token_Index;
Transform_Res31 :
Bare_With_Decl
:= No_Bare_Gpr_Node;
Transform_Diags31 :
Ada.Containers.Count_Type;
M : Memo_Entry := Get (Parser.Private_Part.With_Decl_Transform_Parse0_Memo, Pos);
begin
if M.State = Success then
Parser.Current_Pos := M.Final_Pos;
Transform_Res31 := M.Instance;
return Transform_Res31;
elsif M.State = Failure then
Parser.Current_Pos := No_Token_Index;
return Transform_Res31;
end if;
---------------------------
-- MAIN COMBINATORS CODE --
---------------------------
-- Start transform_code
Transform_Diags31 := Parser.Diagnostics.Length;
-- Start row_code
Row_Pos36 := Pos;
-- Start opt_code
-- Start tok_code
Token_Res60 := Row_Pos36;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res60));
begin
if
T.Kind /= From_Token_Kind (Gpr_Limited)
then
Token_Pos60 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos36 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos36,
Expected_Token_Id => Gpr_Limited,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos60 := Row_Pos36 + 1;
end if;
end;
-- End tok_code
if Token_Pos60 = No_Token_Index then
Opt_Res1 := Allocate_Limited_Absent (Parser.Mem_Pool);
Initialize
(Self => Opt_Res1,
Kind => Gpr_Limited_Absent,
Unit => Parser.Unit,
Token_Start_Index => Row_Pos36,
Token_End_Index => No_Token_Index);
Token_Pos60 := Row_Pos36;
else
Opt_Res1 := Allocate_Limited_Present (Parser.Mem_Pool);
Initialize
(Self => Opt_Res1,
Kind => Gpr_Limited_Present,
Unit => Parser.Unit,
Token_Start_Index => Row_Pos36,
Token_End_Index => Token_Pos60 - 1);
end if;
-- End opt_code
if Token_Pos60 /= No_Token_Index then
Row_Pos36 := Token_Pos60;
else
Row_Pos36 := No_Token_Index;
goto Exit_Row36_0;
end if;
-- Start tok_code
Token_Res61 := Row_Pos36;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res61));
begin
if
T.Kind /= From_Token_Kind (Gpr_With)
then
Token_Pos61 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos36 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos36,
Expected_Token_Id => Gpr_With,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos61 := Row_Pos36 + 1;
end if;
end;
-- End tok_code
if Token_Pos61 /= No_Token_Index then
Row_Pos36 := Token_Pos61;
else
Row_Pos36 := No_Token_Index;
goto Exit_Row36_0;
end if;
-- Start list_code
List_Pos12 := No_Token_Index;
Lst_Cpos12 := Row_Pos36;
Tmp_List12 := Get_Parse_List (Parser);
loop
Defer_Res63 :=
String_Literal_Transform_Parse0 (Parser, Lst_Cpos12);
Defer_Pos63 := Parser.Current_Pos;
exit when Defer_Pos63 = No_Token_Index;
List_Pos12 := Defer_Pos63;
Lst_Cpos12 := List_Pos12;
Tmp_List12.Nodes.Append (Defer_Res63);
-- Start tok_code
Token_Res62 := Lst_Cpos12;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res62));
begin
if
T.Kind /= From_Token_Kind (Gpr_Comma)
then
Token_Pos62 := No_Token_Index;
if Parser.Last_Fail.Pos <= Lst_Cpos12 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Lst_Cpos12,
Expected_Token_Id => Gpr_Comma,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos62 := Lst_Cpos12 + 1;
end if;
end;
-- End tok_code
if Token_Pos62 /= No_Token_Index then
Lst_Cpos12 := Token_Pos62;
else
exit;
end if;
end loop;
declare
Token_Start, Token_End : Token_Index;
Count : constant Natural := Tmp_List12.Nodes.Length;
begin
List_Res12 :=
Allocate_String_Literal_List (Parser.Mem_Pool);
if Count > 0 then
Token_Start := Row_Pos36;
Token_End := (if Lst_Cpos12 = Row_Pos36
then Row_Pos36
else Lst_Cpos12 - 1);
else
Token_Start := Token_Index'Max (Row_Pos36, 1);
Token_End := No_Token_Index;
end if;
Initialize
(Self => List_Res12,
Kind => Gpr_String_Literal_List,
Unit => Parser.Unit,
Token_Start_Index => Token_Start,
Token_End_Index => Token_End);
Initialize_List
(Self => List_Res12,
Parser => Parser,
Count => Count);
declare
Vec : Bare_Gpr_Node_Vectors.Vector renames
Tmp_List12.Nodes;
Arr : Alloc_AST_List_Array.Element_Array_Access renames
List_Res12.Nodes;
begin
Arr := Alloc_AST_List_Array.Alloc (Parser.Mem_Pool, Vec.Length);
for I in Vec.First_Index .. Vec.Last_Index loop
Arr (I) := Vec.Get (I);
end loop;
end;
end;
Release_Parse_List (Parser, Tmp_List12);
-- End list_code
if List_Pos12 /= No_Token_Index then
Row_Pos36 := List_Pos12;
else
Row_Pos36 := No_Token_Index;
goto Exit_Row36_0;
end if;
-- Start tok_code
Token_Res63 := Row_Pos36;
declare
T : constant Stored_Token_Data :=
Token_Vectors.Get (Parser.TDH.Tokens, Natural (Token_Res63));
begin
if
T.Kind /= From_Token_Kind (Gpr_Semicolon)
then
Token_Pos63 := No_Token_Index;
if Parser.Last_Fail.Pos <= Row_Pos36 then
Parser.Last_Fail :=
(Kind => Token_Fail,
Pos => Row_Pos36,
Expected_Token_Id => Gpr_Semicolon,
Found_Token_Id => To_Token_Kind (T.Kind));
end if;
else
Token_Pos63 := Row_Pos36 + 1;
end if;
end;
-- End tok_code
if Token_Pos63 /= No_Token_Index then
Row_Pos36 := Token_Pos63;
else
Row_Pos36 := No_Token_Index;
goto Exit_Row36_0;
end if;
pragma Warnings (Off, "referenced");
<<Exit_Row36_0>>
pragma Warnings (On, "referenced");
-- End row_code
if Row_Pos36 /= No_Token_Index then
Transform_Res31 := Allocate_With_Decl (Parser.Mem_Pool);
Initialize
(Self => Transform_Res31,
Kind => Gpr_With_Decl,
Unit => Parser.Unit,
Token_Start_Index => Pos,
Token_End_Index => (if Row_Pos36 = Pos
then No_Token_Index
else Row_Pos36 - 1));
Initialize_Fields_For_With_Decl
(Self => Transform_Res31, With_Decl_F_Is_Limited => Opt_Res1, With_Decl_F_Path_Names => List_Res12);
if Opt_Res1 /= null and then Is_Incomplete (Opt_Res1) then
Transform_Res31.Last_Attempted_Child := 0;
elsif Opt_Res1 /= null and then not Is_Ghost (Opt_Res1) then
Transform_Res31.Last_Attempted_Child := -1;
end if;
if List_Res12 /= null and then Is_Incomplete (List_Res12) then
Transform_Res31.Last_Attempted_Child := 0;
elsif List_Res12 /= null and then not Is_Ghost (List_Res12) then
Transform_Res31.Last_Attempted_Child := -1;
end if;
elsif Row_Pos36 = No_Token_Index then
Parser.Diagnostics.Set_Length (Transform_Diags31);
end if;
-- End transform_code
-------------------------------
-- END MAIN COMBINATORS CODE --
-------------------------------
Set
(Parser.Private_Part.With_Decl_Transform_Parse0_Memo,
Row_Pos36 /= No_Token_Index,
Transform_Res31,
Pos,
Row_Pos36);
Parser.Current_Pos := Row_Pos36;
return Transform_Res31;
end With_Decl_Transform_Parse0;
-----------
-- Reset --
-----------
procedure Reset (Parser : in out Parser_Type) is
New_Parser : Parser_Type;
-- We create this new parser instance to leverage creation of default
-- values, so as to not repeat them.
begin
-- We just keep the private part, to not have to reallocate it
New_Parser.Private_Part := Parser.Private_Part;
-- And then reset everything else
Parser := New_Parser;
-- Reset the memo tables in the private part
Bare_Gpr_Node_Memos.Clear
(Parser.Private_Part.Associative_Array_Index_Or_Parse0_Memo);
Bare_Attribute_Decl_Memos.Clear
(Parser.Private_Part.Attribute_Decl_Transform_Parse0_Memo);
Bare_Attribute_Reference_Memos.Clear
(Parser.Private_Part.Attribute_Reference_Transform_Parse0_Memo);
Bare_Builtin_Function_Call_Memos.Clear
(Parser.Private_Part.Builtin_Function_Call_Transform_Parse0_Memo);
Bare_Case_Construction_Memos.Clear
(Parser.Private_Part.Case_Construction_Transform_Parse0_Memo);
Bare_Case_Item_Memos.Clear
(Parser.Private_Part.Case_Item_Transform_Parse0_Memo);
Bare_Gpr_Node_Memos.Clear
(Parser.Private_Part.Choice_Or_Parse0_Memo);
Bare_Compilation_Unit_Memos.Clear
(Parser.Private_Part.Compilation_Unit_Transform_Parse0_Memo);
Bare_With_Decl_List_Memos.Clear
(Parser.Private_Part.Context_Clauses_List_Parse0_Memo);
Bare_Gpr_Node_Memos.Clear
(Parser.Private_Part.Declarative_Item_Or_Parse0_Memo);
Bare_Gpr_Node_List_Memos.Clear
(Parser.Private_Part.Declarative_Items_List_Parse0_Memo);
Bare_Choices_Memos.Clear
(Parser.Private_Part.Discrete_Choice_List_List_Parse0_Memo);
Bare_Empty_Decl_Memos.Clear
(Parser.Private_Part.Empty_Declaration_Transform_Parse0_Memo);
Bare_Term_List_Memos.Clear
(Parser.Private_Part.Expression_List_Parse0_Memo);
Bare_Terms_Memos.Clear
(Parser.Private_Part.Expression_List_Transform_Parse0_Memo);
Bare_Identifier_Memos.Clear
(Parser.Private_Part.Identifier_Transform_Parse0_Memo);
Bare_Num_Literal_Memos.Clear
(Parser.Private_Part.Num_Literal_Transform_Parse0_Memo);
Bare_Others_Designator_Memos.Clear
(Parser.Private_Part.Others_Designator_Transform_Parse0_Memo);
Bare_Package_Decl_Memos.Clear
(Parser.Private_Part.Package_Decl_Transform_Parse0_Memo);
Bare_Package_Extension_Memos.Clear
(Parser.Private_Part.Package_Extension_Transform_Parse0_Memo);
Bare_Package_Renaming_Memos.Clear
(Parser.Private_Part.Package_Renaming_Transform_Parse0_Memo);
Bare_Package_Spec_Memos.Clear
(Parser.Private_Part.Package_Spec_Transform_Parse0_Memo);
Bare_Project_Declaration_Memos.Clear
(Parser.Private_Part.Project_Declaration_Transform_Parse0_Memo);
Bare_Project_Extension_Memos.Clear
(Parser.Private_Part.Project_Extension_Transform_Parse0_Memo);
Bare_Project_Qualifier_Memos.Clear
(Parser.Private_Part.Project_Qualifier_Or_Parse0_Memo);
Bare_Project_Memos.Clear
(Parser.Private_Part.Project_Transform_Parse0_Memo);
Bare_Gpr_Node_Memos.Clear
(Parser.Private_Part.Simple_Declarative_Item_Or_Parse0_Memo);
Bare_Gpr_Node_List_Memos.Clear
(Parser.Private_Part.Simple_Declarative_Items_List_Parse0_Memo);
Bare_Expr_Memos.Clear
(Parser.Private_Part.Static_Name_Or_Parse0_Memo);
Bare_String_Literal_At_Memos.Clear
(Parser.Private_Part.String_Literal_At_Transform_Parse0_Memo);
Bare_String_Literal_Memos.Clear
(Parser.Private_Part.String_Literal_Transform_Parse0_Memo);
Bare_Gpr_Node_Memos.Clear
(Parser.Private_Part.Term_Or_Parse0_Memo);
Bare_Type_Reference_Memos.Clear
(Parser.Private_Part.Type_Reference_Transform_Parse0_Memo);
Bare_Typed_String_Decl_Memos.Clear
(Parser.Private_Part.Typed_String_Decl_Transform_Parse0_Memo);
Bare_Variable_Decl_Memos.Clear
(Parser.Private_Part.Variable_Decl_Transform_Parse0_Memo);
Bare_Variable_Reference_Memos.Clear
(Parser.Private_Part.Variable_Reference_Transform_Parse0_Memo);
Bare_With_Decl_Memos.Clear
(Parser.Private_Part.With_Decl_Transform_Parse0_Memo);
end Reset;
-------------
-- Destroy --
-------------
procedure Destroy (Parser : in out Parser_Type) is
procedure Free is new Ada.Unchecked_Deallocation
(Parser_Private_Part_Type, Parser_Private_Part);
procedure Free is new Ada.Unchecked_Deallocation
(Free_Parse_List_Record, Free_Parse_List);
Cur : Free_Parse_List renames Parser.Private_Part.Parse_Lists;
begin
while Cur /= null loop
declare
Next : constant Free_Parse_List := Cur.Next;
begin
Cur.Nodes.Destroy;
Free (Cur);
Cur := Next;
end;
end loop;
Free (Parser.Private_Part);
end Destroy;
----------------
-- Initialize --
----------------
procedure Initialize (Parser : in out Parser_Type) is
begin
Parser.Private_Part := new Parser_Private_Part_Type'(others => <>);
end Initialize;
--------------------
-- Get_Parse_List --
--------------------
function Get_Parse_List (Parser : Parser_Type) return Free_Parse_List is
Lists : Free_Parse_List renames Parser.Private_Part.Parse_Lists;
Result : Free_Parse_List;
begin
if Lists = null then
Result := new Free_Parse_List_Record;
else
Result := Lists;
Lists := Lists.Next;
end if;
return Result;
end Get_Parse_List;
------------------------
-- Release_Parse_List --
------------------------
procedure Release_Parse_List
(Parser : Parser_Type; List : in out Free_Parse_List)
is
Lists : Free_Parse_List renames Parser.Private_Part.Parse_Lists;
begin
List.Nodes.Clear;
List.Next := Lists;
Lists := List;
List := null;
end Release_Parse_List;
end Gpr_Parser.Parsers;
|
OneWingedShark/Byron | Ada | 706 | ads | Pragma Ada_2012;
Pragma Assertion_Policy( Check );
With
Byron.Internals.SPARK.Pure_Types;
Use
Byron.Internals.SPARK.Pure_Types;
-- Byron.Debugging is the top-level for debugging packages and subprograms.
Package Byron.Debugging with Pure, SPARK_Mode => On is
DEBUG : Constant Boolean;
Procedure Put ( String : Internal_String )
with Import, Convention => Ada, External_Name => "DEBUG_PUT",
Global => Null, Depends => (Null => String);
Procedure Put_Line ( String : Internal_String )
with Import, Convention => Ada, External_Name => "DEBUG_PUT_LINE",
Global => Null, Depends => (Null => String);
Private
DEBUG : Constant Boolean := True;
End Byron.Debugging;
|
reznikmm/matreshka | Ada | 4,671 | 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_Draw.Caption_Angle_Type_Attributes is
------------
-- Create --
------------
overriding function Create
(Parameters : not null access Matreshka.DOM_Attributes.Attribute_L2_Parameters)
return Draw_Caption_Angle_Type_Attribute_Node is
begin
return Self : Draw_Caption_Angle_Type_Attribute_Node do
Matreshka.ODF_Draw.Constructors.Initialize
(Self'Unchecked_Access,
Parameters.Document,
Matreshka.ODF_String_Constants.Draw_Prefix);
end return;
end Create;
--------------------
-- Get_Local_Name --
--------------------
overriding function Get_Local_Name
(Self : not null access constant Draw_Caption_Angle_Type_Attribute_Node)
return League.Strings.Universal_String
is
pragma Unreferenced (Self);
begin
return Matreshka.ODF_String_Constants.Caption_Angle_Type_Attribute;
end Get_Local_Name;
begin
Matreshka.DOM_Documents.Register_Attribute
(Matreshka.ODF_String_Constants.Draw_URI,
Matreshka.ODF_String_Constants.Caption_Angle_Type_Attribute,
Draw_Caption_Angle_Type_Attribute_Node'Tag);
end Matreshka.ODF_Draw.Caption_Angle_Type_Attributes;
|
persan/AdaYaml | Ada | 3,629 | ads | -- part of AdaYaml, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "copying.txt"
private with Ada.Containers.Indefinite_Hashed_Maps;
package Yaml.Dom.Mapping_Data is
type Instance is tagged limited private
with Constant_Indexing => Element;
type Cursor is private;
function Length (Object : Instance) return Count_Type;
function Is_Empty (Container : Instance) return Boolean;
procedure Clear (Container : in out Instance);
function Has_Element (Position : Cursor) return Boolean;
function First (Object : Instance) return Cursor;
function Next (Position : Cursor) return Cursor;
procedure Iterate (Object : Instance;
Process : not null access procedure
(Key, Value : not null access Node.Instance));
function Key (Position : Cursor) return Node_Reference
with Pre => Has_Element (Position);
function Value (Position : Cursor) return Node_Reference
with Pre => Has_Element (Position);
function Find (Object : Instance; Key : Node_Reference) return Cursor;
function Element (Object : Instance; Key : Node_Reference)
return Node_Reference;
-- convenience method for retrieving values of keys that are !!str scalars.
-- the key value is given as String.
function Element (Object : Instance; Key : String) return Node_Reference;
procedure Insert (Container : in out Instance;
Key : in Node_Reference;
New_Item : in Node_Reference;
Position : out Cursor;
Inserted : out Boolean);
procedure Insert (Container : in out Instance;
Key : in Node_Reference;
New_Item : in Node_Reference);
procedure Include (Container : in out Instance;
Key : in Node_Reference;
New_Item : in Node_Reference);
procedure Replace (Container : in out Instance;
Key : in Node_Reference;
New_Item : in Node_Reference);
procedure Exclude (Container : in out Instance;
Key : in Node_Reference);
procedure Delete (Container : in out Instance;
Key : in Node_Reference);
procedure Delete (Container : in out Instance;
Position : in out Cursor);
No_Element : constant Cursor;
private
function Hash (Object : Node_Pointer) return Ada.Containers.Hash_Type;
package Node_Maps is new Ada.Containers.Indefinite_Hashed_Maps
(Node_Pointer, Node_Pointer, Hash, Dom."=", Dom."=");
type Instance is tagged limited record
Document : not null access Document_Instance;
Data : Node_Maps.Map;
end record;
type Cursor is record
Container : access Instance;
Position : Node_Maps.Cursor;
end record;
No_Element : constant Cursor := (Container => null,
Position => Node_Maps.No_Element);
package Friend_Interface is
function For_Document (Document : not null access Document_Instance)
return Instance with Export, Convention => Ada,
Link_Name => "AdaYaml__Mapping_Data__For_Document";
procedure Raw_Insert (Container : in out Instance;
Key, Value : not null access Node.Instance)
with Export, Convention => Ada,
Link_Name => "AdaYaml__Mapping_Data__Raw_Insert";
end Friend_Interface;
end Yaml.Dom.Mapping_Data;
|
AdaCore/ada-traits-containers | Ada | 3,655 | ads | --
-- Copyright (C) 2015-2016, AdaCore
--
-- SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
--
-- This package describes the types of elements stored in a container. We
-- want to handle both constrained and unconstrained elements, which is done
-- by providing subprograms to convert from one type to the other (presumably,
-- but not limited to, using access types)
pragma Ada_2012;
package Conts.Elements with SPARK_Mode is
generic
type Element_Type (<>) is private;
-- The element type visible to the user (in parameter to Append for
-- instance).
type Stored_Type is private;
-- The type of elements stored internally. This must be unconstrained.
type Returned_Type (<>) is private;
-- The type of elements returned by getters. Various possibilities exit:
-- you could return an Element_Type (which might be big and thus slow),
-- a Stored_Type (which might be an access type, and thus unsafe), or a
-- Reference type as introduced by Ada 2012. Other variations are of
-- course possible.
type Constant_Returned_Type (<>) is private;
-- The type of elements returned by getters. As opposed to
-- Returned_Type, this one guarantees that the type cannot be modified
-- via this value (so it can't be a direct pointer, not a reference_type
-- for which the discriminant is not "constant"). This is used in
-- particular for the Constant_Indexing aspect.
with function To_Stored (E : Element_Type) return Stored_Type;
with function To_Returned (E : Stored_Type) return Returned_Type;
with function To_Constant_Returned
(E : Stored_Type) return Constant_Returned_Type;
with function To_Element
(E : Constant_Returned_Type) return Element_Type;
-- Converting between the types
with procedure Release (E : in out Stored_Type) is null;
-- Called whenever an element is removed from the container.
-- Memory can be freed at this point, and other resources can be closed.
with function Copy (E : Stored_Type) return Stored_Type;
Copyable : Boolean := False;
-- True when a stored_type variable can be copied (duplicated) in
-- memory using the standard Ada operations (assigning an array
-- for instance), including Adjust and Finalize call when
-- applicable.
-- False when an explicit Copy operation needs to be performed. This
-- is safer in general, but less efficient.
-- It should be set to False when Stored_Type is an access type,
-- since copying would create an alias and it would be impossible to
-- know who the owner of the element is and when to free it.
Movable : Boolean := True;
-- If True, a stored_Element can be moved in memory (as part of a
-- realloc call for instance), bypassing Adjust and Finalize calls
-- on controlled types.
--
-- This is very similar to Copyable, but no aliasing issue occurs, so
-- this should be safe for access types.
-- When an element is not Movable, a copy is made (via Copy), and the
-- original element is deleted.
package Traits is
subtype Element is Element_Type;
subtype Stored is Stored_Type;
subtype Returned is Returned_Type;
subtype Constant_Returned is Constant_Returned_Type;
function To_Elem (E : Constant_Returned_Type) return Element_Type
renames To_Element;
function Identity (E : Returned_Type) return Returned_Type is (E);
-- Convenience function
end Traits;
end Conts.Elements;
|
tum-ei-rcs/StratoX | Ada | 3,742 | ads | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . A S S E R T I O N S --
-- --
-- Copyright (C) 2015, Free Software Foundation, Inc. --
-- --
-- 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 contracts that have been added. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Preconditions in this unit are meant for analysis only, not for run-time
-- checking, so that the expected exceptions are raised when calling Assert.
-- This is enforced by setting the corresponding assertion policy to Ignore.
pragma Assertion_Policy (Pre => Ignore);
-- We do a with of System.Assertions to get hold of the exception (following
-- the specific RM permission that lets' Assertion_Error being a renaming).
-- The suppression of Warnings stops the warning about bad categorization.
pragma Warnings (Off);
with System.Assertions;
pragma Warnings (On);
package Ada.Assertions with
SPARK_Mode
is
pragma Pure (Assertions);
Assertion_Error : exception renames System.Assertions.Assert_Failure;
-- This is the renaming that is allowed by 11.4.2(24). Note that the
-- Exception_Name will refer to the one in System.Assertions (see
-- AARM-11.4.1(12.b)).
procedure Assert (Check : Boolean) with
Pre => Check;
procedure Assert (Check : Boolean; Message : String) with
Pre => Check;
end Ada.Assertions;
|
damaki/libkeccak | Ada | 2,997 | adb | -------------------------------------------------------------------------------
-- Copyright (c) 2016, 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 AUnit.Assertions; use AUnit.Assertions;
with Keccak.Types; use Keccak.Types;
package body KeccakF_Lane_Tests is
-- Test that XORing bytes into a (zeroed) state, then extracting them
-- yields the original data.
--
-- This ensures that XOR_Bits_Into_State and Extract_Bits both use the
-- same mapping to the internal state.
procedure Test_XOR_Extract (T : in out Test) is
State_Size_Bytes : constant Positive := State_Size_Bits / 8;
S : State;
Data_In : Byte_Array (1 .. State_Size_Bytes);
Data_Out : Byte_Array (1 .. State_Size_Bytes);
begin
for I in Data_In'Range loop
Data_In (I) := Keccak.Types.Byte (I mod 256);
end loop;
for N in 1 .. State_Size_Bytes loop
Init_State (S);
XOR_Bits_Into_State (A => S,
Data => Data_In,
Bit_Len => N * 8);
Data_Out := (others => 16#AA#);
Extract_Bits (A => S,
Data => Data_Out (1 .. N),
Bit_Len => N * 8);
Assert (Data_In (1 .. N) = Data_Out (1 .. N),
"Failed for N = " & Integer'Image (N));
end loop;
end Test_XOR_Extract;
end KeccakF_Lane_Tests;
|
damaki/dw1000-rssi-tester | Ada | 1,695 | ads | -------------------------------------------------------------------------------
-- Copyright (c) 2017 Daniel King
--
-- Permission is hereby granted, free of charge, to any person obtaining a
-- copy of this software and associated documentation files (the "Software"),
-- to deal in the Software without restriction, including without limitation
-- the rights to use, copy, modify, merge, publish, distribute, sublicense,
-- and/or sell copies of the Software, and to permit persons to whom the
-- Software is furnished to do so, subject to the following conditions:
--
-- The above copyright notice and this permission notice shall be included in
-- all copies or substantial portions of the Software.
--
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
-- FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
-- DEALINGS IN THE SOFTWARE.
-------------------------------------------------------------------------------
with DecaDriver.Core;
with EVB1000.S1;
package Configurations
with SPARK_Mode => On
is
procedure Get_Switches_Config
(Config : out DecaDriver.Core.Configuration_Type)
with Global => (Input => EVB1000.S1.Switch_State),
Depends => (Config => EVB1000.S1.Switch_State);
-- Get the DW1000 user configuration by reading the state of the S1 switch
-- on the EVB1000.
end Configurations;
|
osannolik/Ada_Drivers_Library | Ada | 55,814 | 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.RCC is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype CR_HSITRIM_Field is HAL.UInt5;
subtype CR_HSICAL_Field is HAL.UInt8;
-- clock control register
type CR_Register is record
-- Internal high-speed clock enable
HSION : Boolean := True;
-- Read-only. Internal high-speed clock ready flag
HSIRDY : Boolean := True;
-- unspecified
Reserved_2_2 : HAL.Bit := 16#0#;
-- Internal high-speed clock trimming
HSITRIM : CR_HSITRIM_Field := 16#10#;
-- Read-only. Internal high-speed clock calibration
HSICAL : CR_HSICAL_Field := 16#0#;
-- HSE clock enable
HSEON : Boolean := False;
-- Read-only. HSE clock ready flag
HSERDY : Boolean := False;
-- HSE clock bypass
HSEBYP : Boolean := False;
-- Clock security system enable
CSSON : Boolean := False;
-- unspecified
Reserved_20_23 : HAL.UInt4 := 16#0#;
-- Main PLL (PLL) enable
PLLON : Boolean := False;
-- Read-only. Main PLL (PLL) clock ready flag
PLLRDY : Boolean := False;
-- PLLI2S enable
PLLI2SON : Boolean := False;
-- Read-only. PLLI2S clock ready flag
PLLI2SRDY : Boolean := False;
-- PLLSAI enable
PLLSAION : Boolean := False;
-- Read-only. PLLSAI clock ready flag
PLLSAIRDY : Boolean := False;
-- unspecified
Reserved_30_31 : HAL.UInt2 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR_Register use record
HSION at 0 range 0 .. 0;
HSIRDY at 0 range 1 .. 1;
Reserved_2_2 at 0 range 2 .. 2;
HSITRIM at 0 range 3 .. 7;
HSICAL at 0 range 8 .. 15;
HSEON at 0 range 16 .. 16;
HSERDY at 0 range 17 .. 17;
HSEBYP at 0 range 18 .. 18;
CSSON at 0 range 19 .. 19;
Reserved_20_23 at 0 range 20 .. 23;
PLLON at 0 range 24 .. 24;
PLLRDY at 0 range 25 .. 25;
PLLI2SON at 0 range 26 .. 26;
PLLI2SRDY at 0 range 27 .. 27;
PLLSAION at 0 range 28 .. 28;
PLLSAIRDY at 0 range 29 .. 29;
Reserved_30_31 at 0 range 30 .. 31;
end record;
subtype PLLCFGR_PLLM_Field is HAL.UInt6;
subtype PLLCFGR_PLLN_Field is HAL.UInt9;
subtype PLLCFGR_PLLP_Field is HAL.UInt2;
subtype PLLCFGR_PLLQ_Field is HAL.UInt4;
subtype PLLCFGR_PLLR_Field is HAL.UInt3;
-- PLL configuration register
type PLLCFGR_Register is record
-- Division factor for the main PLL (PLL) and audio PLL (PLLI2S) input
-- clock
PLLM : PLLCFGR_PLLM_Field := 16#10#;
-- Main PLL (PLL) multiplication factor for VCO
PLLN : PLLCFGR_PLLN_Field := 16#C0#;
-- unspecified
Reserved_15_15 : HAL.Bit := 16#0#;
-- Main PLL (PLL) division factor for main system clock
PLLP : PLLCFGR_PLLP_Field := 16#0#;
-- unspecified
Reserved_18_21 : HAL.UInt4 := 16#0#;
-- Main PLL(PLL) and audio PLL (PLLI2S) entry clock source
PLLSRC : Boolean := False;
-- unspecified
Reserved_23_23 : HAL.Bit := 16#0#;
-- Main PLL (PLL) division factor for USB OTG FS, SDIO and random number
-- generator clocks
PLLQ : PLLCFGR_PLLQ_Field := 16#4#;
-- Main PLL division factor for DSI clock
PLLR : PLLCFGR_PLLR_Field := 16#2#;
-- unspecified
Reserved_31_31 : HAL.Bit := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for PLLCFGR_Register use record
PLLM at 0 range 0 .. 5;
PLLN at 0 range 6 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
PLLP at 0 range 16 .. 17;
Reserved_18_21 at 0 range 18 .. 21;
PLLSRC at 0 range 22 .. 22;
Reserved_23_23 at 0 range 23 .. 23;
PLLQ at 0 range 24 .. 27;
PLLR at 0 range 28 .. 30;
Reserved_31_31 at 0 range 31 .. 31;
end record;
subtype CFGR_SW_Field is HAL.UInt2;
subtype CFGR_SWS_Field is HAL.UInt2;
subtype CFGR_HPRE_Field is HAL.UInt4;
-- CFGR_PPRE array element
subtype CFGR_PPRE_Element is HAL.UInt3;
-- CFGR_PPRE array
type CFGR_PPRE_Field_Array is array (1 .. 2) of CFGR_PPRE_Element
with Component_Size => 3, Size => 6;
-- Type definition for CFGR_PPRE
type CFGR_PPRE_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- PPRE as a value
Val : HAL.UInt6;
when True =>
-- PPRE as an array
Arr : CFGR_PPRE_Field_Array;
end case;
end record
with Unchecked_Union, Size => 6;
for CFGR_PPRE_Field use record
Val at 0 range 0 .. 5;
Arr at 0 range 0 .. 5;
end record;
subtype CFGR_RTCPRE_Field is HAL.UInt5;
subtype CFGR_MCO1_Field is HAL.UInt2;
subtype CFGR_MCO1PRE_Field is HAL.UInt3;
subtype CFGR_MCO2PRE_Field is HAL.UInt3;
subtype CFGR_MCO2_Field is HAL.UInt2;
-- clock configuration register
type CFGR_Register is record
-- System clock switch
SW : CFGR_SW_Field := 16#0#;
-- Read-only. System clock switch status
SWS : CFGR_SWS_Field := 16#0#;
-- AHB prescaler
HPRE : CFGR_HPRE_Field := 16#0#;
-- unspecified
Reserved_8_9 : HAL.UInt2 := 16#0#;
-- APB Low speed prescaler (APB1)
PPRE : CFGR_PPRE_Field := (As_Array => False, Val => 16#0#);
-- HSE division factor for RTC clock
RTCPRE : CFGR_RTCPRE_Field := 16#0#;
-- Microcontroller clock output 1
MCO1 : CFGR_MCO1_Field := 16#0#;
-- I2S clock selection
I2SSRC : Boolean := False;
-- MCO1 prescaler
MCO1PRE : CFGR_MCO1PRE_Field := 16#0#;
-- MCO2 prescaler
MCO2PRE : CFGR_MCO2PRE_Field := 16#0#;
-- Microcontroller clock output 2
MCO2 : CFGR_MCO2_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CFGR_Register use record
SW at 0 range 0 .. 1;
SWS at 0 range 2 .. 3;
HPRE at 0 range 4 .. 7;
Reserved_8_9 at 0 range 8 .. 9;
PPRE at 0 range 10 .. 15;
RTCPRE at 0 range 16 .. 20;
MCO1 at 0 range 21 .. 22;
I2SSRC at 0 range 23 .. 23;
MCO1PRE at 0 range 24 .. 26;
MCO2PRE at 0 range 27 .. 29;
MCO2 at 0 range 30 .. 31;
end record;
-- clock interrupt register
type CIR_Register is record
-- Read-only. LSI ready interrupt flag
LSIRDYF : Boolean := False;
-- Read-only. LSE ready interrupt flag
LSERDYF : Boolean := False;
-- Read-only. HSI ready interrupt flag
HSIRDYF : Boolean := False;
-- Read-only. HSE ready interrupt flag
HSERDYF : Boolean := False;
-- Read-only. Main PLL (PLL) ready interrupt flag
PLLRDYF : Boolean := False;
-- Read-only. PLLI2S ready interrupt flag
PLLI2SRDYF : Boolean := False;
-- Read-only. PLLSAI ready interrupt flag
PLLSAIRDYF : Boolean := False;
-- Read-only. Clock security system interrupt flag
CSSF : Boolean := False;
-- LSI ready interrupt enable
LSIRDYIE : Boolean := False;
-- LSE ready interrupt enable
LSERDYIE : Boolean := False;
-- HSI ready interrupt enable
HSIRDYIE : Boolean := False;
-- HSE ready interrupt enable
HSERDYIE : Boolean := False;
-- Main PLL (PLL) ready interrupt enable
PLLRDYIE : Boolean := False;
-- PLLI2S ready interrupt enable
PLLI2SRDYIE : Boolean := False;
-- PLLSAI Ready Interrupt Enable
PLLSAIRDYIE : Boolean := False;
-- unspecified
Reserved_15_15 : HAL.Bit := 16#0#;
-- Write-only. LSI ready interrupt clear
LSIRDYC : Boolean := False;
-- Write-only. LSE ready interrupt clear
LSERDYC : Boolean := False;
-- Write-only. HSI ready interrupt clear
HSIRDYC : Boolean := False;
-- Write-only. HSE ready interrupt clear
HSERDYC : Boolean := False;
-- Write-only. Main PLL(PLL) ready interrupt clear
PLLRDYC : Boolean := False;
-- Write-only. PLLI2S ready interrupt clear
PLLI2SRDYC : Boolean := False;
-- Write-only. PLLSAI Ready Interrupt Clear
PLLSAIRDYC : Boolean := False;
-- Write-only. Clock security system interrupt clear
CSSC : Boolean := False;
-- unspecified
Reserved_24_31 : HAL.UInt8 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CIR_Register use record
LSIRDYF at 0 range 0 .. 0;
LSERDYF at 0 range 1 .. 1;
HSIRDYF at 0 range 2 .. 2;
HSERDYF at 0 range 3 .. 3;
PLLRDYF at 0 range 4 .. 4;
PLLI2SRDYF at 0 range 5 .. 5;
PLLSAIRDYF at 0 range 6 .. 6;
CSSF at 0 range 7 .. 7;
LSIRDYIE at 0 range 8 .. 8;
LSERDYIE at 0 range 9 .. 9;
HSIRDYIE at 0 range 10 .. 10;
HSERDYIE at 0 range 11 .. 11;
PLLRDYIE at 0 range 12 .. 12;
PLLI2SRDYIE at 0 range 13 .. 13;
PLLSAIRDYIE at 0 range 14 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
LSIRDYC at 0 range 16 .. 16;
LSERDYC at 0 range 17 .. 17;
HSIRDYC at 0 range 18 .. 18;
HSERDYC at 0 range 19 .. 19;
PLLRDYC at 0 range 20 .. 20;
PLLI2SRDYC at 0 range 21 .. 21;
PLLSAIRDYC at 0 range 22 .. 22;
CSSC at 0 range 23 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
-- AHB1 peripheral reset register
type AHB1RSTR_Register is record
-- IO port A reset
GPIOARST : Boolean := False;
-- IO port B reset
GPIOBRST : Boolean := False;
-- IO port C reset
GPIOCRST : Boolean := False;
-- IO port D reset
GPIODRST : Boolean := False;
-- IO port E reset
GPIOERST : Boolean := False;
-- IO port F reset
GPIOFRST : Boolean := False;
-- IO port G reset
GPIOGRST : Boolean := False;
-- IO port H reset
GPIOHRST : Boolean := False;
-- unspecified
Reserved_8_11 : HAL.UInt4 := 16#0#;
-- CRC reset
CRCRST : Boolean := False;
-- unspecified
Reserved_13_20 : HAL.UInt8 := 16#0#;
-- DMA2 reset
DMA1RST : Boolean := False;
-- DMA2 reset
DMA2RST : Boolean := False;
-- unspecified
Reserved_23_28 : HAL.UInt6 := 16#0#;
-- USB OTG HS module reset
OTGHSRST : Boolean := False;
-- unspecified
Reserved_30_31 : HAL.UInt2 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for AHB1RSTR_Register use record
GPIOARST at 0 range 0 .. 0;
GPIOBRST at 0 range 1 .. 1;
GPIOCRST at 0 range 2 .. 2;
GPIODRST at 0 range 3 .. 3;
GPIOERST at 0 range 4 .. 4;
GPIOFRST at 0 range 5 .. 5;
GPIOGRST at 0 range 6 .. 6;
GPIOHRST at 0 range 7 .. 7;
Reserved_8_11 at 0 range 8 .. 11;
CRCRST at 0 range 12 .. 12;
Reserved_13_20 at 0 range 13 .. 20;
DMA1RST at 0 range 21 .. 21;
DMA2RST at 0 range 22 .. 22;
Reserved_23_28 at 0 range 23 .. 28;
OTGHSRST at 0 range 29 .. 29;
Reserved_30_31 at 0 range 30 .. 31;
end record;
-- AHB2 peripheral reset register
type AHB2RSTR_Register is record
-- Camera interface reset
DCMIRST : Boolean := False;
-- unspecified
Reserved_1_6 : HAL.UInt6 := 16#0#;
-- USB OTG FS module reset
OTGFSRST : Boolean := False;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for AHB2RSTR_Register use record
DCMIRST at 0 range 0 .. 0;
Reserved_1_6 at 0 range 1 .. 6;
OTGFSRST at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- AHB3 peripheral reset register
type AHB3RSTR_Register is record
-- Flexible memory controller module reset
FMCRST : Boolean := False;
-- QUADSPI module reset
QSPIRST : Boolean := False;
-- unspecified
Reserved_2_31 : HAL.UInt30 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for AHB3RSTR_Register use record
FMCRST at 0 range 0 .. 0;
QSPIRST at 0 range 1 .. 1;
Reserved_2_31 at 0 range 2 .. 31;
end record;
-- APB1 peripheral reset register
type APB1RSTR_Register is record
-- TIM2 reset
TIM2RST : Boolean := False;
-- TIM3 reset
TIM3RST : Boolean := False;
-- TIM4 reset
TIM4RST : Boolean := False;
-- TIM5 reset
TIM5RST : Boolean := False;
-- TIM6 reset
TIM6RST : Boolean := False;
-- TIM7 reset
TIM7RST : Boolean := False;
-- TIM12 reset
TIM12RST : Boolean := False;
-- TIM13 reset
TIM13RST : Boolean := False;
-- TIM14 reset
TIM14RST : Boolean := False;
-- unspecified
Reserved_9_10 : HAL.UInt2 := 16#0#;
-- Window watchdog reset
WWDGRST : Boolean := False;
-- unspecified
Reserved_12_13 : HAL.UInt2 := 16#0#;
-- SPI 2 reset
SPI2RST : Boolean := False;
-- SPI 3 reset
SPI3RST : Boolean := False;
-- SPDIF-IN reset
SPDIFRST : Boolean := False;
-- USART 2 reset
UART2RST : Boolean := False;
-- USART 3 reset
UART3RST : Boolean := False;
-- USART 4 reset
UART4RST : Boolean := False;
-- USART 5 reset
UART5RST : Boolean := False;
-- I2C 1 reset
I2C1RST : Boolean := False;
-- I2C 2 reset
I2C2RST : Boolean := False;
-- I2C3 reset
I2C3RST : Boolean := False;
-- I2CFMP1 reset
I2CFMP1RST : Boolean := False;
-- CAN1 reset
CAN1RST : Boolean := False;
-- CAN2 reset
CAN2RST : Boolean := False;
-- unspecified
Reserved_27_27 : HAL.Bit := 16#0#;
-- Power interface reset
PWRRST : Boolean := False;
-- DAC reset
DACRST : Boolean := False;
-- unspecified
Reserved_30_31 : HAL.UInt2 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for APB1RSTR_Register use record
TIM2RST at 0 range 0 .. 0;
TIM3RST at 0 range 1 .. 1;
TIM4RST at 0 range 2 .. 2;
TIM5RST at 0 range 3 .. 3;
TIM6RST at 0 range 4 .. 4;
TIM7RST at 0 range 5 .. 5;
TIM12RST at 0 range 6 .. 6;
TIM13RST at 0 range 7 .. 7;
TIM14RST at 0 range 8 .. 8;
Reserved_9_10 at 0 range 9 .. 10;
WWDGRST at 0 range 11 .. 11;
Reserved_12_13 at 0 range 12 .. 13;
SPI2RST at 0 range 14 .. 14;
SPI3RST at 0 range 15 .. 15;
SPDIFRST at 0 range 16 .. 16;
UART2RST at 0 range 17 .. 17;
UART3RST at 0 range 18 .. 18;
UART4RST at 0 range 19 .. 19;
UART5RST at 0 range 20 .. 20;
I2C1RST at 0 range 21 .. 21;
I2C2RST at 0 range 22 .. 22;
I2C3RST at 0 range 23 .. 23;
I2CFMP1RST at 0 range 24 .. 24;
CAN1RST at 0 range 25 .. 25;
CAN2RST at 0 range 26 .. 26;
Reserved_27_27 at 0 range 27 .. 27;
PWRRST at 0 range 28 .. 28;
DACRST at 0 range 29 .. 29;
Reserved_30_31 at 0 range 30 .. 31;
end record;
-- APB2 peripheral reset register
type APB2RSTR_Register is record
-- TIM1 reset
TIM1RST : Boolean := False;
-- TIM8 reset
TIM8RST : Boolean := False;
-- unspecified
Reserved_2_3 : HAL.UInt2 := 16#0#;
-- USART1 reset
USART1RST : Boolean := False;
-- USART6 reset
USART6RST : Boolean := False;
-- unspecified
Reserved_6_7 : HAL.UInt2 := 16#0#;
-- ADC interface reset (common to all ADCs)
ADCRST : Boolean := False;
-- unspecified
Reserved_9_10 : HAL.UInt2 := 16#0#;
-- SDIO reset
SDIORST : Boolean := False;
-- SPI 1 reset
SPI1RST : Boolean := False;
-- SPI4 reset
SPI4RST : Boolean := False;
-- System configuration controller reset
SYSCFGRST : Boolean := False;
-- unspecified
Reserved_15_15 : HAL.Bit := 16#0#;
-- TIM9 reset
TIM9RST : Boolean := False;
-- TIM10 reset
TIM10RST : Boolean := False;
-- TIM11 reset
TIM11RST : Boolean := False;
-- unspecified
Reserved_19_21 : HAL.UInt3 := 16#0#;
-- SAI1 reset
SAI1RST : Boolean := False;
-- SAI2 reset
SAI2RST : Boolean := False;
-- unspecified
Reserved_24_31 : HAL.UInt8 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for APB2RSTR_Register use record
TIM1RST at 0 range 0 .. 0;
TIM8RST at 0 range 1 .. 1;
Reserved_2_3 at 0 range 2 .. 3;
USART1RST at 0 range 4 .. 4;
USART6RST at 0 range 5 .. 5;
Reserved_6_7 at 0 range 6 .. 7;
ADCRST at 0 range 8 .. 8;
Reserved_9_10 at 0 range 9 .. 10;
SDIORST at 0 range 11 .. 11;
SPI1RST at 0 range 12 .. 12;
SPI4RST at 0 range 13 .. 13;
SYSCFGRST at 0 range 14 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
TIM9RST at 0 range 16 .. 16;
TIM10RST at 0 range 17 .. 17;
TIM11RST at 0 range 18 .. 18;
Reserved_19_21 at 0 range 19 .. 21;
SAI1RST at 0 range 22 .. 22;
SAI2RST at 0 range 23 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
-- AHB1 peripheral clock register
type AHB1ENR_Register is record
-- IO port A clock enable
GPIOAEN : Boolean := False;
-- IO port B clock enable
GPIOBEN : Boolean := False;
-- IO port C clock enable
GPIOCEN : Boolean := False;
-- IO port D clock enable
GPIODEN : Boolean := False;
-- IO port E clock enable
GPIOEEN : Boolean := False;
-- IO port F clock enable
GPIOFEN : Boolean := False;
-- IO port G clock enable
GPIOGEN : Boolean := False;
-- IO port H clock enable
GPIOHEN : Boolean := False;
-- unspecified
Reserved_8_11 : HAL.UInt4 := 16#0#;
-- CRC clock enable
CRCEN : Boolean := False;
-- unspecified
Reserved_13_17 : HAL.UInt5 := 16#0#;
-- Backup SRAM interface clock enable
BKPSRAMEN : Boolean := False;
-- unspecified
Reserved_19_20 : HAL.UInt2 := 16#2#;
-- DMA1 clock enable
DMA1EN : Boolean := False;
-- DMA2 clock enable
DMA2EN : Boolean := False;
-- unspecified
Reserved_23_28 : HAL.UInt6 := 16#0#;
-- USB OTG HS clock enable
OTGHSEN : Boolean := False;
-- USB OTG HSULPI clock enable
OTGHSULPIEN : Boolean := False;
-- unspecified
Reserved_31_31 : HAL.Bit := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for AHB1ENR_Register use record
GPIOAEN at 0 range 0 .. 0;
GPIOBEN at 0 range 1 .. 1;
GPIOCEN at 0 range 2 .. 2;
GPIODEN at 0 range 3 .. 3;
GPIOEEN at 0 range 4 .. 4;
GPIOFEN at 0 range 5 .. 5;
GPIOGEN at 0 range 6 .. 6;
GPIOHEN at 0 range 7 .. 7;
Reserved_8_11 at 0 range 8 .. 11;
CRCEN at 0 range 12 .. 12;
Reserved_13_17 at 0 range 13 .. 17;
BKPSRAMEN at 0 range 18 .. 18;
Reserved_19_20 at 0 range 19 .. 20;
DMA1EN at 0 range 21 .. 21;
DMA2EN at 0 range 22 .. 22;
Reserved_23_28 at 0 range 23 .. 28;
OTGHSEN at 0 range 29 .. 29;
OTGHSULPIEN at 0 range 30 .. 30;
Reserved_31_31 at 0 range 31 .. 31;
end record;
-- AHB2 peripheral clock enable register
type AHB2ENR_Register is record
-- Camera interface enable
DCMIEN : Boolean := False;
-- unspecified
Reserved_1_6 : HAL.UInt6 := 16#0#;
-- USB OTG FS clock enable
OTGFSEN : Boolean := False;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for AHB2ENR_Register use record
DCMIEN at 0 range 0 .. 0;
Reserved_1_6 at 0 range 1 .. 6;
OTGFSEN at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- AHB3 peripheral clock enable register
type AHB3ENR_Register is record
-- Flexible memory controller module clock enable
FMCEN : Boolean := False;
-- QUADSPI memory controller module clock enable
QSPIEN : Boolean := False;
-- unspecified
Reserved_2_31 : HAL.UInt30 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for AHB3ENR_Register use record
FMCEN at 0 range 0 .. 0;
QSPIEN at 0 range 1 .. 1;
Reserved_2_31 at 0 range 2 .. 31;
end record;
-- APB1 peripheral clock enable register
type APB1ENR_Register is record
-- TIM2 clock enable
TIM2EN : Boolean := False;
-- TIM3 clock enable
TIM3EN : Boolean := False;
-- TIM4 clock enable
TIM4EN : Boolean := False;
-- TIM5 clock enable
TIM5EN : Boolean := False;
-- TIM6 clock enable
TIM6EN : Boolean := False;
-- TIM7 clock enable
TIM7EN : Boolean := False;
-- TIM12 clock enable
TIM12EN : Boolean := False;
-- TIM13 clock enable
TIM13EN : Boolean := False;
-- TIM14 clock enable
TIM14EN : Boolean := False;
-- unspecified
Reserved_9_10 : HAL.UInt2 := 16#0#;
-- Window watchdog clock enable
WWDGEN : Boolean := False;
-- unspecified
Reserved_12_13 : HAL.UInt2 := 16#0#;
-- SPI2 clock enable
SPI2EN : Boolean := False;
-- SPI3 clock enable
SPI3EN : Boolean := False;
-- SPDIF-IN clock enable
SPDIFEN : Boolean := False;
-- USART 2 clock enable
USART2EN : Boolean := False;
-- USART3 clock enable
USART3EN : Boolean := False;
-- UART4 clock enable
UART4EN : Boolean := False;
-- UART5 clock enable
UART5EN : Boolean := False;
-- I2C1 clock enable
I2C1EN : Boolean := False;
-- I2C2 clock enable
I2C2EN : Boolean := False;
-- I2C3 clock enable
I2C3EN : Boolean := False;
-- I2CFMP1 clock enable
I2CFMP1EN : Boolean := False;
-- CAN 1 clock enable
CAN1EN : Boolean := False;
-- CAN 2 clock enable
CAN2EN : Boolean := False;
-- CEC interface clock enable
CEC : Boolean := False;
-- Power interface clock enable
PWREN : Boolean := False;
-- DAC interface clock enable
DACEN : Boolean := False;
-- unspecified
Reserved_30_31 : HAL.UInt2 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for APB1ENR_Register use record
TIM2EN at 0 range 0 .. 0;
TIM3EN at 0 range 1 .. 1;
TIM4EN at 0 range 2 .. 2;
TIM5EN at 0 range 3 .. 3;
TIM6EN at 0 range 4 .. 4;
TIM7EN at 0 range 5 .. 5;
TIM12EN at 0 range 6 .. 6;
TIM13EN at 0 range 7 .. 7;
TIM14EN at 0 range 8 .. 8;
Reserved_9_10 at 0 range 9 .. 10;
WWDGEN at 0 range 11 .. 11;
Reserved_12_13 at 0 range 12 .. 13;
SPI2EN at 0 range 14 .. 14;
SPI3EN at 0 range 15 .. 15;
SPDIFEN at 0 range 16 .. 16;
USART2EN at 0 range 17 .. 17;
USART3EN at 0 range 18 .. 18;
UART4EN at 0 range 19 .. 19;
UART5EN at 0 range 20 .. 20;
I2C1EN at 0 range 21 .. 21;
I2C2EN at 0 range 22 .. 22;
I2C3EN at 0 range 23 .. 23;
I2CFMP1EN at 0 range 24 .. 24;
CAN1EN at 0 range 25 .. 25;
CAN2EN at 0 range 26 .. 26;
CEC at 0 range 27 .. 27;
PWREN at 0 range 28 .. 28;
DACEN at 0 range 29 .. 29;
Reserved_30_31 at 0 range 30 .. 31;
end record;
-- APB2 peripheral clock enable register
type APB2ENR_Register is record
-- TIM1 clock enable
TIM1EN : Boolean := False;
-- TIM8 clock enable
TIM8EN : Boolean := False;
-- unspecified
Reserved_2_3 : HAL.UInt2 := 16#0#;
-- USART1 clock enable
USART1EN : Boolean := False;
-- USART6 clock enable
USART6EN : Boolean := False;
-- unspecified
Reserved_6_7 : HAL.UInt2 := 16#0#;
-- ADC1 clock enable
ADC1EN : Boolean := False;
-- ADC2 clock enable
ADC2EN : Boolean := False;
-- ADC3 clock enable
ADC3EN : Boolean := False;
-- SDIO clock enable
SDIOEN : Boolean := False;
-- SPI1 clock enable
SPI1EN : Boolean := False;
-- SPI4 clock enable
SPI4ENR : Boolean := False;
-- System configuration controller clock enable
SYSCFGEN : Boolean := False;
-- unspecified
Reserved_15_15 : HAL.Bit := 16#0#;
-- TIM9 clock enable
TIM9EN : Boolean := False;
-- TIM10 clock enable
TIM10EN : Boolean := False;
-- TIM11 clock enable
TIM11EN : Boolean := False;
-- unspecified
Reserved_19_21 : HAL.UInt3 := 16#0#;
-- SAI1 clock enable
SAI1EN : Boolean := False;
-- SAI2 clock enable
SAI2EN : Boolean := False;
-- unspecified
Reserved_24_31 : HAL.UInt8 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for APB2ENR_Register use record
TIM1EN at 0 range 0 .. 0;
TIM8EN at 0 range 1 .. 1;
Reserved_2_3 at 0 range 2 .. 3;
USART1EN at 0 range 4 .. 4;
USART6EN at 0 range 5 .. 5;
Reserved_6_7 at 0 range 6 .. 7;
ADC1EN at 0 range 8 .. 8;
ADC2EN at 0 range 9 .. 9;
ADC3EN at 0 range 10 .. 10;
SDIOEN at 0 range 11 .. 11;
SPI1EN at 0 range 12 .. 12;
SPI4ENR at 0 range 13 .. 13;
SYSCFGEN at 0 range 14 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
TIM9EN at 0 range 16 .. 16;
TIM10EN at 0 range 17 .. 17;
TIM11EN at 0 range 18 .. 18;
Reserved_19_21 at 0 range 19 .. 21;
SAI1EN at 0 range 22 .. 22;
SAI2EN at 0 range 23 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
-- AHB1 peripheral clock enable in low power mode register
type AHB1LPENR_Register is record
-- IO port A clock enable during sleep mode
GPIOALPEN : Boolean := True;
-- IO port B clock enable during Sleep mode
GPIOBLPEN : Boolean := True;
-- IO port C clock enable during Sleep mode
GPIOCLPEN : Boolean := True;
-- IO port D clock enable during Sleep mode
GPIODLPEN : Boolean := True;
-- IO port E clock enable during Sleep mode
GPIOELPEN : Boolean := True;
-- IO port F clock enable during Sleep mode
GPIOFLPEN : Boolean := True;
-- IO port G clock enable during Sleep mode
GPIOGLPEN : Boolean := True;
-- IO port H clock enable during Sleep mode
GPIOHLPEN : Boolean := True;
-- unspecified
Reserved_8_11 : HAL.UInt4 := 16#1#;
-- CRC clock enable during Sleep mode
CRCLPEN : Boolean := True;
-- unspecified
Reserved_13_14 : HAL.UInt2 := 16#0#;
-- Flash interface clock enable during Sleep mode
FLITFLPEN : Boolean := True;
-- SRAM 1interface clock enable during Sleep mode
SRAM1LPEN : Boolean := True;
-- SRAM 2 interface clock enable during Sleep mode
SRAM2LPEN : Boolean := True;
-- Backup SRAM interface clock enable during Sleep mode
BKPSRAMLPEN : Boolean := True;
-- unspecified
Reserved_19_20 : HAL.UInt2 := 16#0#;
-- DMA1 clock enable during Sleep mode
DMA1LPEN : Boolean := True;
-- DMA2 clock enable during Sleep mode
DMA2LPEN : Boolean := True;
-- unspecified
Reserved_23_28 : HAL.UInt6 := 16#3C#;
-- USB OTG HS clock enable during Sleep mode
OTGHSLPEN : Boolean := True;
-- USB OTG HS ULPI clock enable during Sleep mode
OTGHSULPILPEN : Boolean := True;
-- unspecified
Reserved_31_31 : HAL.Bit := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for AHB1LPENR_Register use record
GPIOALPEN at 0 range 0 .. 0;
GPIOBLPEN at 0 range 1 .. 1;
GPIOCLPEN at 0 range 2 .. 2;
GPIODLPEN at 0 range 3 .. 3;
GPIOELPEN at 0 range 4 .. 4;
GPIOFLPEN at 0 range 5 .. 5;
GPIOGLPEN at 0 range 6 .. 6;
GPIOHLPEN at 0 range 7 .. 7;
Reserved_8_11 at 0 range 8 .. 11;
CRCLPEN at 0 range 12 .. 12;
Reserved_13_14 at 0 range 13 .. 14;
FLITFLPEN at 0 range 15 .. 15;
SRAM1LPEN at 0 range 16 .. 16;
SRAM2LPEN at 0 range 17 .. 17;
BKPSRAMLPEN at 0 range 18 .. 18;
Reserved_19_20 at 0 range 19 .. 20;
DMA1LPEN at 0 range 21 .. 21;
DMA2LPEN at 0 range 22 .. 22;
Reserved_23_28 at 0 range 23 .. 28;
OTGHSLPEN at 0 range 29 .. 29;
OTGHSULPILPEN at 0 range 30 .. 30;
Reserved_31_31 at 0 range 31 .. 31;
end record;
-- AHB2 peripheral clock enable in low power mode register
type AHB2LPENR_Register is record
-- Camera interface enable during Sleep mode
DCMILPEN : Boolean := True;
-- unspecified
Reserved_1_6 : HAL.UInt6 := 16#38#;
-- USB OTG FS clock enable during Sleep mode
OTGFSLPEN : Boolean := True;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for AHB2LPENR_Register use record
DCMILPEN at 0 range 0 .. 0;
Reserved_1_6 at 0 range 1 .. 6;
OTGFSLPEN at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- AHB3 peripheral clock enable in low power mode register
type AHB3LPENR_Register is record
-- Flexible memory controller module clock enable during Sleep mode
FMCLPEN : Boolean := True;
-- QUADSPI memory controller module clock enable during Sleep mode
QSPILPEN : Boolean := False;
-- unspecified
Reserved_2_31 : HAL.UInt30 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for AHB3LPENR_Register use record
FMCLPEN at 0 range 0 .. 0;
QSPILPEN at 0 range 1 .. 1;
Reserved_2_31 at 0 range 2 .. 31;
end record;
-- APB1 peripheral clock enable in low power mode register
type APB1LPENR_Register is record
-- TIM2 clock enable during Sleep mode
TIM2LPEN : Boolean := True;
-- TIM3 clock enable during Sleep mode
TIM3LPEN : Boolean := True;
-- TIM4 clock enable during Sleep mode
TIM4LPEN : Boolean := True;
-- TIM5 clock enable during Sleep mode
TIM5LPEN : Boolean := True;
-- TIM6 clock enable during Sleep mode
TIM6LPEN : Boolean := True;
-- TIM7 clock enable during Sleep mode
TIM7LPEN : Boolean := True;
-- TIM12 clock enable during Sleep mode
TIM12LPEN : Boolean := True;
-- TIM13 clock enable during Sleep mode
TIM13LPEN : Boolean := True;
-- TIM14 clock enable during Sleep mode
TIM14LPEN : Boolean := True;
-- unspecified
Reserved_9_10 : HAL.UInt2 := 16#0#;
-- Window watchdog clock enable during Sleep mode
WWDGLPEN : Boolean := True;
-- unspecified
Reserved_12_13 : HAL.UInt2 := 16#0#;
-- SPI2 clock enable during Sleep mode
SPI2LPEN : Boolean := True;
-- SPI3 clock enable during Sleep mode
SPI3LPEN : Boolean := True;
-- SPDIF clock enable during Sleep mode
SPDIFLPEN : Boolean := False;
-- USART2 clock enable during Sleep mode
USART2LPEN : Boolean := True;
-- USART3 clock enable during Sleep mode
USART3LPEN : Boolean := True;
-- UART4 clock enable during Sleep mode
UART4LPEN : Boolean := True;
-- UART5 clock enable during Sleep mode
UART5LPEN : Boolean := True;
-- I2C1 clock enable during Sleep mode
I2C1LPEN : Boolean := True;
-- I2C2 clock enable during Sleep mode
I2C2LPEN : Boolean := True;
-- I2C3 clock enable during Sleep mode
I2C3LPEN : Boolean := True;
-- I2CFMP1 clock enable during Sleep mode
I2CFMP1LPEN : Boolean := False;
-- CAN 1 clock enable during Sleep mode
CAN1LPEN : Boolean := True;
-- CAN 2 clock enable during Sleep mode
CAN2LPEN : Boolean := True;
-- CEC clock enable during Sleep mode
CECLPEN : Boolean := False;
-- Power interface clock enable during Sleep mode
PWRLPEN : Boolean := True;
-- DAC interface clock enable during Sleep mode
DACLPEN : Boolean := True;
-- unspecified
Reserved_30_31 : HAL.UInt2 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for APB1LPENR_Register use record
TIM2LPEN at 0 range 0 .. 0;
TIM3LPEN at 0 range 1 .. 1;
TIM4LPEN at 0 range 2 .. 2;
TIM5LPEN at 0 range 3 .. 3;
TIM6LPEN at 0 range 4 .. 4;
TIM7LPEN at 0 range 5 .. 5;
TIM12LPEN at 0 range 6 .. 6;
TIM13LPEN at 0 range 7 .. 7;
TIM14LPEN at 0 range 8 .. 8;
Reserved_9_10 at 0 range 9 .. 10;
WWDGLPEN at 0 range 11 .. 11;
Reserved_12_13 at 0 range 12 .. 13;
SPI2LPEN at 0 range 14 .. 14;
SPI3LPEN at 0 range 15 .. 15;
SPDIFLPEN at 0 range 16 .. 16;
USART2LPEN at 0 range 17 .. 17;
USART3LPEN at 0 range 18 .. 18;
UART4LPEN at 0 range 19 .. 19;
UART5LPEN at 0 range 20 .. 20;
I2C1LPEN at 0 range 21 .. 21;
I2C2LPEN at 0 range 22 .. 22;
I2C3LPEN at 0 range 23 .. 23;
I2CFMP1LPEN at 0 range 24 .. 24;
CAN1LPEN at 0 range 25 .. 25;
CAN2LPEN at 0 range 26 .. 26;
CECLPEN at 0 range 27 .. 27;
PWRLPEN at 0 range 28 .. 28;
DACLPEN at 0 range 29 .. 29;
Reserved_30_31 at 0 range 30 .. 31;
end record;
-- APB2 peripheral clock enabled in low power mode register
type APB2LPENR_Register is record
-- TIM1 clock enable during Sleep mode
TIM1LPEN : Boolean := True;
-- TIM8 clock enable during Sleep mode
TIM8LPEN : Boolean := True;
-- unspecified
Reserved_2_3 : HAL.UInt2 := 16#0#;
-- USART1 clock enable during Sleep mode
USART1LPEN : Boolean := True;
-- USART6 clock enable during Sleep mode
USART6LPEN : Boolean := True;
-- unspecified
Reserved_6_7 : HAL.UInt2 := 16#0#;
-- ADC1 clock enable during Sleep mode
ADC1LPEN : Boolean := True;
-- ADC2 clock enable during Sleep mode
ADC2LPEN : Boolean := True;
-- ADC 3 clock enable during Sleep mode
ADC3LPEN : Boolean := True;
-- SDIO clock enable during Sleep mode
SDIOLPEN : Boolean := True;
-- SPI 1 clock enable during Sleep mode
SPI1LPEN : Boolean := True;
-- SPI 4 clock enable during Sleep mode
SPI4LPEN : Boolean := False;
-- System configuration controller clock enable during Sleep mode
SYSCFGLPEN : Boolean := True;
-- unspecified
Reserved_15_15 : HAL.Bit := 16#0#;
-- TIM9 clock enable during sleep mode
TIM9LPEN : Boolean := True;
-- TIM10 clock enable during Sleep mode
TIM10LPEN : Boolean := True;
-- TIM11 clock enable during Sleep mode
TIM11LPEN : Boolean := True;
-- unspecified
Reserved_19_21 : HAL.UInt3 := 16#0#;
-- SAI1 clock enable
SAI1LPEN : Boolean := False;
-- SAI2 clock enable
SAI2LPEN : Boolean := False;
-- unspecified
Reserved_24_31 : HAL.UInt8 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for APB2LPENR_Register use record
TIM1LPEN at 0 range 0 .. 0;
TIM8LPEN at 0 range 1 .. 1;
Reserved_2_3 at 0 range 2 .. 3;
USART1LPEN at 0 range 4 .. 4;
USART6LPEN at 0 range 5 .. 5;
Reserved_6_7 at 0 range 6 .. 7;
ADC1LPEN at 0 range 8 .. 8;
ADC2LPEN at 0 range 9 .. 9;
ADC3LPEN at 0 range 10 .. 10;
SDIOLPEN at 0 range 11 .. 11;
SPI1LPEN at 0 range 12 .. 12;
SPI4LPEN at 0 range 13 .. 13;
SYSCFGLPEN at 0 range 14 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
TIM9LPEN at 0 range 16 .. 16;
TIM10LPEN at 0 range 17 .. 17;
TIM11LPEN at 0 range 18 .. 18;
Reserved_19_21 at 0 range 19 .. 21;
SAI1LPEN at 0 range 22 .. 22;
SAI2LPEN at 0 range 23 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
-- BDCR_RTCSEL array
type BDCR_RTCSEL_Field_Array is array (0 .. 1) of Boolean
with Component_Size => 1, Size => 2;
-- Type definition for BDCR_RTCSEL
type BDCR_RTCSEL_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- RTCSEL as a value
Val : HAL.UInt2;
when True =>
-- RTCSEL as an array
Arr : BDCR_RTCSEL_Field_Array;
end case;
end record
with Unchecked_Union, Size => 2;
for BDCR_RTCSEL_Field use record
Val at 0 range 0 .. 1;
Arr at 0 range 0 .. 1;
end record;
-- Backup domain control register
type BDCR_Register is record
-- External low-speed oscillator enable
LSEON : Boolean := False;
-- Read-only. External low-speed oscillator ready
LSERDY : Boolean := False;
-- External low-speed oscillator bypass
LSEBYP : Boolean := False;
-- External low-speed oscillator mode
LSEMOD : Boolean := False;
-- unspecified
Reserved_4_7 : HAL.UInt4 := 16#0#;
-- RTC clock source selection
RTCSEL : BDCR_RTCSEL_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_10_14 : HAL.UInt5 := 16#0#;
-- RTC clock enable
RTCEN : Boolean := False;
-- Backup domain software reset
BDRST : Boolean := False;
-- unspecified
Reserved_17_31 : HAL.UInt15 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BDCR_Register use record
LSEON at 0 range 0 .. 0;
LSERDY at 0 range 1 .. 1;
LSEBYP at 0 range 2 .. 2;
LSEMOD at 0 range 3 .. 3;
Reserved_4_7 at 0 range 4 .. 7;
RTCSEL at 0 range 8 .. 9;
Reserved_10_14 at 0 range 10 .. 14;
RTCEN at 0 range 15 .. 15;
BDRST at 0 range 16 .. 16;
Reserved_17_31 at 0 range 17 .. 31;
end record;
-- clock control & status register
type CSR_Register is record
-- Internal low-speed oscillator enable
LSION : Boolean := False;
-- Read-only. Internal low-speed oscillator ready
LSIRDY : Boolean := False;
-- unspecified
Reserved_2_23 : HAL.UInt22 := 16#0#;
-- Remove reset flag
RMVF : Boolean := False;
-- BOR reset flag
BORRSTF : Boolean := True;
-- PIN reset flag
PADRSTF : Boolean := True;
-- POR/PDR reset flag
PORRSTF : Boolean := True;
-- Software reset flag
SFTRSTF : Boolean := False;
-- Independent watchdog reset flag
WDGRSTF : Boolean := False;
-- Window watchdog reset flag
WWDGRSTF : Boolean := False;
-- Low-power reset flag
LPWRRSTF : Boolean := False;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CSR_Register use record
LSION at 0 range 0 .. 0;
LSIRDY at 0 range 1 .. 1;
Reserved_2_23 at 0 range 2 .. 23;
RMVF at 0 range 24 .. 24;
BORRSTF at 0 range 25 .. 25;
PADRSTF at 0 range 26 .. 26;
PORRSTF at 0 range 27 .. 27;
SFTRSTF at 0 range 28 .. 28;
WDGRSTF at 0 range 29 .. 29;
WWDGRSTF at 0 range 30 .. 30;
LPWRRSTF at 0 range 31 .. 31;
end record;
subtype SSCGR_MODPER_Field is HAL.UInt13;
subtype SSCGR_INCSTEP_Field is HAL.UInt15;
-- spread spectrum clock generation register
type SSCGR_Register is record
-- Modulation period
MODPER : SSCGR_MODPER_Field := 16#0#;
-- Incrementation step
INCSTEP : SSCGR_INCSTEP_Field := 16#0#;
-- unspecified
Reserved_28_29 : HAL.UInt2 := 16#0#;
-- Spread Select
SPREADSEL : Boolean := False;
-- Spread spectrum modulation enable
SSCGEN : Boolean := False;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SSCGR_Register use record
MODPER at 0 range 0 .. 12;
INCSTEP at 0 range 13 .. 27;
Reserved_28_29 at 0 range 28 .. 29;
SPREADSEL at 0 range 30 .. 30;
SSCGEN at 0 range 31 .. 31;
end record;
subtype PLLI2SCFGR_PLLI2SM_Field is HAL.UInt6;
subtype PLLI2SCFGR_PLLI2SN_Field is HAL.UInt9;
subtype PLLI2SCFGR_PLLI2SP_Field is HAL.UInt2;
subtype PLLI2SCFGR_PLLI2SQ_Field is HAL.UInt4;
subtype PLLI2SCFGR_PLLI2SR_Field is HAL.UInt3;
-- PLLI2S configuration register
type PLLI2SCFGR_Register is record
-- Division factor for audio PLL (PLLI2S) input clock
PLLI2SM : PLLI2SCFGR_PLLI2SM_Field := 16#0#;
-- PLLI2S multiplication factor for VCO
PLLI2SN : PLLI2SCFGR_PLLI2SN_Field := 16#C0#;
-- unspecified
Reserved_15_15 : HAL.Bit := 16#0#;
-- PLLI2S division factor for SPDIF-IN clock
PLLI2SP : PLLI2SCFGR_PLLI2SP_Field := 16#0#;
-- unspecified
Reserved_18_23 : HAL.UInt6 := 16#0#;
-- PLLI2S division factor for SAI1 clock
PLLI2SQ : PLLI2SCFGR_PLLI2SQ_Field := 16#0#;
-- PLLI2S division factor for I2S clocks
PLLI2SR : PLLI2SCFGR_PLLI2SR_Field := 16#2#;
-- unspecified
Reserved_31_31 : HAL.Bit := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for PLLI2SCFGR_Register use record
PLLI2SM at 0 range 0 .. 5;
PLLI2SN at 0 range 6 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
PLLI2SP at 0 range 16 .. 17;
Reserved_18_23 at 0 range 18 .. 23;
PLLI2SQ at 0 range 24 .. 27;
PLLI2SR at 0 range 28 .. 30;
Reserved_31_31 at 0 range 31 .. 31;
end record;
subtype PLLSAICFGR_PLLSAIM_Field is HAL.UInt6;
subtype PLLSAICFGR_PLLSAIN_Field is HAL.UInt9;
subtype PLLSAICFGR_PLLSAIP_Field is HAL.UInt2;
subtype PLLSAICFGR_PLLSAIQ_Field is HAL.UInt4;
-- PLL configuration register
type PLLSAICFGR_Register is record
-- Division factor for audio PLLSAI input clock
PLLSAIM : PLLSAICFGR_PLLSAIM_Field := 16#0#;
-- PLLSAI division factor for VCO
PLLSAIN : PLLSAICFGR_PLLSAIN_Field := 16#C0#;
-- unspecified
Reserved_15_15 : HAL.Bit := 16#0#;
-- PLLSAI division factor for 48 MHz clock
PLLSAIP : PLLSAICFGR_PLLSAIP_Field := 16#0#;
-- unspecified
Reserved_18_23 : HAL.UInt6 := 16#0#;
-- PLLSAI division factor for SAIs clock
PLLSAIQ : PLLSAICFGR_PLLSAIQ_Field := 16#4#;
-- unspecified
Reserved_28_31 : HAL.UInt4 := 16#2#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for PLLSAICFGR_Register use record
PLLSAIM at 0 range 0 .. 5;
PLLSAIN at 0 range 6 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
PLLSAIP at 0 range 16 .. 17;
Reserved_18_23 at 0 range 18 .. 23;
PLLSAIQ at 0 range 24 .. 27;
Reserved_28_31 at 0 range 28 .. 31;
end record;
subtype DCKCFGR_PLLI2SDIVQ_Field is HAL.UInt5;
subtype DCKCFGR_PLLSAIDIVQ_Field is HAL.UInt5;
subtype DCKCFGR_SAI1SRC_Field is HAL.UInt2;
subtype DCKCFGR_SAI2SRC_Field is HAL.UInt2;
subtype DCKCFGR_I2S1SRC_Field is HAL.UInt2;
subtype DCKCFGR_I2S2SRC_Field is HAL.UInt2;
-- Dedicated Clock Configuration Register
type DCKCFGR_Register is record
-- PLLI2S division factor for SAIs clock
PLLI2SDIVQ : DCKCFGR_PLLI2SDIVQ_Field := 16#0#;
-- unspecified
Reserved_5_7 : HAL.UInt3 := 16#0#;
-- PLLSAI division factor for SAIs clock
PLLSAIDIVQ : DCKCFGR_PLLSAIDIVQ_Field := 16#0#;
-- unspecified
Reserved_13_19 : HAL.UInt7 := 16#0#;
-- SAI1 clock source selection
SAI1SRC : DCKCFGR_SAI1SRC_Field := 16#0#;
-- SAI2 clock source selection
SAI2SRC : DCKCFGR_SAI2SRC_Field := 16#0#;
-- Timers clocks prescalers selection
TIMPRE : Boolean := False;
-- I2S APB1 clock source selection
I2S1SRC : DCKCFGR_I2S1SRC_Field := 16#0#;
-- I2S APB2 clock source selection
I2S2SRC : DCKCFGR_I2S2SRC_Field := 16#0#;
-- unspecified
Reserved_29_31 : HAL.UInt3 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DCKCFGR_Register use record
PLLI2SDIVQ at 0 range 0 .. 4;
Reserved_5_7 at 0 range 5 .. 7;
PLLSAIDIVQ at 0 range 8 .. 12;
Reserved_13_19 at 0 range 13 .. 19;
SAI1SRC at 0 range 20 .. 21;
SAI2SRC at 0 range 22 .. 23;
TIMPRE at 0 range 24 .. 24;
I2S1SRC at 0 range 25 .. 26;
I2S2SRC at 0 range 27 .. 28;
Reserved_29_31 at 0 range 29 .. 31;
end record;
-- clocks gated enable register
type CKGATENR_Register is record
-- AHB to APB1 Bridge clock enable
AHB2APB1_CKEN : Boolean := False;
-- AHB to APB2 Bridge clock enable
AHB2APB2_CKEN : Boolean := False;
-- Cortex M4 ETM clock enable
CM4DBG_CKEN : Boolean := False;
-- Spare clock enable
SPARE_CKEN : Boolean := False;
-- SRQAM controller clock enable
SRAM_CKEN : Boolean := False;
-- Flash Interface clock enable
FLITF_CKEN : Boolean := False;
-- RCC clock enable
RCC_CKEN : Boolean := False;
-- unspecified
Reserved_7_31 : HAL.UInt25 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CKGATENR_Register use record
AHB2APB1_CKEN at 0 range 0 .. 0;
AHB2APB2_CKEN at 0 range 1 .. 1;
CM4DBG_CKEN at 0 range 2 .. 2;
SPARE_CKEN at 0 range 3 .. 3;
SRAM_CKEN at 0 range 4 .. 4;
FLITF_CKEN at 0 range 5 .. 5;
RCC_CKEN at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
subtype DCKCFGR2_FMPI2C1SEL_Field is HAL.UInt2;
-- dedicated clocks configuration register 2
type DCKCFGR2_Register is record
-- unspecified
Reserved_0_21 : HAL.UInt22 := 16#0#;
-- I2C4 kernel clock source selection
FMPI2C1SEL : DCKCFGR2_FMPI2C1SEL_Field := 16#0#;
-- unspecified
Reserved_24_25 : HAL.UInt2 := 16#0#;
-- HDMI CEC clock source selection
CECSEL : Boolean := False;
-- SDIO/USBFS/HS clock selection
CK48MSEL : Boolean := False;
-- SDIO clock selection
SDIOSEL : Boolean := False;
-- SPDIF clock selection
SPDIFSEL : Boolean := False;
-- unspecified
Reserved_30_31 : HAL.UInt2 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DCKCFGR2_Register use record
Reserved_0_21 at 0 range 0 .. 21;
FMPI2C1SEL at 0 range 22 .. 23;
Reserved_24_25 at 0 range 24 .. 25;
CECSEL at 0 range 26 .. 26;
CK48MSEL at 0 range 27 .. 27;
SDIOSEL at 0 range 28 .. 28;
SPDIFSEL at 0 range 29 .. 29;
Reserved_30_31 at 0 range 30 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Reset and clock control
type RCC_Peripheral is record
-- clock control register
CR : aliased CR_Register;
-- PLL configuration register
PLLCFGR : aliased PLLCFGR_Register;
-- clock configuration register
CFGR : aliased CFGR_Register;
-- clock interrupt register
CIR : aliased CIR_Register;
-- AHB1 peripheral reset register
AHB1RSTR : aliased AHB1RSTR_Register;
-- AHB2 peripheral reset register
AHB2RSTR : aliased AHB2RSTR_Register;
-- AHB3 peripheral reset register
AHB3RSTR : aliased AHB3RSTR_Register;
-- APB1 peripheral reset register
APB1RSTR : aliased APB1RSTR_Register;
-- APB2 peripheral reset register
APB2RSTR : aliased APB2RSTR_Register;
-- AHB1 peripheral clock register
AHB1ENR : aliased AHB1ENR_Register;
-- AHB2 peripheral clock enable register
AHB2ENR : aliased AHB2ENR_Register;
-- AHB3 peripheral clock enable register
AHB3ENR : aliased AHB3ENR_Register;
-- APB1 peripheral clock enable register
APB1ENR : aliased APB1ENR_Register;
-- APB2 peripheral clock enable register
APB2ENR : aliased APB2ENR_Register;
-- AHB1 peripheral clock enable in low power mode register
AHB1LPENR : aliased AHB1LPENR_Register;
-- AHB2 peripheral clock enable in low power mode register
AHB2LPENR : aliased AHB2LPENR_Register;
-- AHB3 peripheral clock enable in low power mode register
AHB3LPENR : aliased AHB3LPENR_Register;
-- APB1 peripheral clock enable in low power mode register
APB1LPENR : aliased APB1LPENR_Register;
-- APB2 peripheral clock enabled in low power mode register
APB2LPENR : aliased APB2LPENR_Register;
-- Backup domain control register
BDCR : aliased BDCR_Register;
-- clock control & status register
CSR : aliased CSR_Register;
-- spread spectrum clock generation register
SSCGR : aliased SSCGR_Register;
-- PLLI2S configuration register
PLLI2SCFGR : aliased PLLI2SCFGR_Register;
-- PLL configuration register
PLLSAICFGR : aliased PLLSAICFGR_Register;
-- Dedicated Clock Configuration Register
DCKCFGR : aliased DCKCFGR_Register;
-- clocks gated enable register
CKGATENR : aliased CKGATENR_Register;
-- dedicated clocks configuration register 2
DCKCFGR2 : aliased DCKCFGR2_Register;
end record
with Volatile;
for RCC_Peripheral use record
CR at 16#0# range 0 .. 31;
PLLCFGR at 16#4# range 0 .. 31;
CFGR at 16#8# range 0 .. 31;
CIR at 16#C# range 0 .. 31;
AHB1RSTR at 16#10# range 0 .. 31;
AHB2RSTR at 16#14# range 0 .. 31;
AHB3RSTR at 16#18# range 0 .. 31;
APB1RSTR at 16#20# range 0 .. 31;
APB2RSTR at 16#24# range 0 .. 31;
AHB1ENR at 16#30# range 0 .. 31;
AHB2ENR at 16#34# range 0 .. 31;
AHB3ENR at 16#38# range 0 .. 31;
APB1ENR at 16#40# range 0 .. 31;
APB2ENR at 16#44# range 0 .. 31;
AHB1LPENR at 16#50# range 0 .. 31;
AHB2LPENR at 16#54# range 0 .. 31;
AHB3LPENR at 16#58# range 0 .. 31;
APB1LPENR at 16#60# range 0 .. 31;
APB2LPENR at 16#64# range 0 .. 31;
BDCR at 16#70# range 0 .. 31;
CSR at 16#74# range 0 .. 31;
SSCGR at 16#80# range 0 .. 31;
PLLI2SCFGR at 16#84# range 0 .. 31;
PLLSAICFGR at 16#88# range 0 .. 31;
DCKCFGR at 16#8C# range 0 .. 31;
CKGATENR at 16#90# range 0 .. 31;
DCKCFGR2 at 16#94# range 0 .. 31;
end record;
-- Reset and clock control
RCC_Periph : aliased RCC_Peripheral
with Import, Address => System'To_Address (16#40023800#);
end STM32_SVD.RCC;
|
AdaCore/training_material | Ada | 1,330 | adb | with Except;
with Screen_Output;
with Stack;
with Values;
package body Instructions is
----------
-- Read --
----------
function Read (Word : String) return Instruction is
begin
-- Loop through each instruction asking if its string representation
-- matches the word we have just encountered in the input.
for I in Instruction loop
-- Technical Note: Given a scalar type (such as an integer, an
-- enumeration, etc), Type'Image (X) returns the value of X
-- converted to a string.
if Instruction'Image (I) = Word then
return I;
end if;
end loop;
-- If we have found an unrecognized instruction raise an exception.
raise Except.User_Error;
end Read;
-------------
-- Process --
-------------
procedure Process (I : Instruction) is
begin
case I is
when Clear =>
Stack.Clear;
when Print =>
Screen_Output.Msg (" -> ", End_Line => False);
if Stack.Empty then
Screen_Output.Msg ("stack is empty");
else
Screen_Output.Msg (Values.To_String (Stack.Top));
end if;
when Quit =>
raise Except.Exit_SDC;
end case;
end Process;
end Instructions;
|
Heziode/lsystem-editor | Ada | 1,841 | adb | -------------------------------------------------------------------------------
-- LSE -- L-System Editor
-- Author: Heziode
--
-- License:
-- MIT License
--
-- Copyright (c) 2018 Quentin Dauprat (Heziode) <[email protected]>
--
-- Permission is hereby granted, free of charge, to any person obtaining a
-- copy of this software and associated documentation files (the "Software"),
-- to deal in the Software without restriction, including without limitation
-- the rights to use, copy, modify, merge, publish, distribute, sublicense,
-- and/or sell copies of the Software, and to permit persons to whom the
-- Software is furnished to do so, subject to the following conditions:
--
-- The above copyright notice and this permission notice shall be included in
-- all copies or substantial portions of the Software.
--
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
-- FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
-- DEALINGS IN THE SOFTWARE.
-------------------------------------------------------------------------------
package body LSE.Model.Grammar.Symbol.LogoAngleMinus is
procedure Initialize (This : out Instance)
is
begin
This := Instance '(Representation => '-');
end Initialize;
procedure Interpret (This : in out Instance;
T : in out Holder)
is
pragma Unreferenced (This);
begin
T.Reference.Rotate_Anticlockwise;
end Interpret;
end LSE.Model.Grammar.Symbol.LogoAngleMinus;
|
pdaxrom/Kino2 | Ada | 5,442 | adb | ------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding --
-- --
-- Terminal_Interface.Curses.Text_IO.Aux --
-- --
-- B O D Y --
-- --
------------------------------------------------------------------------------
-- Copyright (c) 1998 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
-- Contact: http://www.familiepfeifer.de/Contact.aspx?Lang=en
-- Version Control:
-- $Revision: 1.10 $
-- Binding Version 01.00
------------------------------------------------------------------------------
package body Terminal_Interface.Curses.Text_IO.Aux is
procedure Put_Buf
(Win : in Window;
Buf : in String;
Width : in Field;
Signal : in Boolean := True;
Ljust : in Boolean := False)
is
L : Field;
Len : Field;
W : Field := Width;
LC : Line_Count;
CC : Column_Count;
Y : Line_Position;
X : Column_Position;
procedure Output (From, To : Field);
procedure Output (From, To : Field)
is
begin
if Len > 0 then
if W = 0 then
W := Len;
end if;
if Len > W then
-- LRM A10.6 (7) says this
W := Len;
end if;
pragma Assert (Len <= W);
Get_Size (Win, LC, CC);
if Column_Count (Len) > CC then
if Signal then
raise Layout_Error;
else
return;
end if;
else
if Len < W and then not Ljust then
declare
Filler : constant String (1 .. (W - Len))
:= (others => ' ');
begin
Put (Win, Filler);
end;
end if;
Get_Cursor_Position (Win, Y, X);
if (X + Column_Position (Len)) > CC then
New_Line (Win);
end if;
Put (Win, Buf (From .. To));
if Len < W and then Ljust then
declare
Filler : constant String (1 .. (W - Len))
:= (others => ' ');
begin
Put (Win, Filler);
end;
end if;
end if;
end if;
end Output;
begin
pragma Assert (Win /= Null_Window);
if Ljust then
L := 1;
for I in 1 .. Buf'Length loop
exit when Buf (L) = ' ';
L := L + 1;
end loop;
Len := L - 1;
Output (1, Len);
else -- input buffer is not left justified
L := Buf'Length;
for I in 1 .. Buf'Length loop
exit when Buf (L) = ' ';
L := L - 1;
end loop;
Len := Buf'Length - L;
Output (L + 1, Buf'Length);
end if;
end Put_Buf;
end Terminal_Interface.Curses.Text_IO.Aux;
|
AaronC98/PlaneSystem | Ada | 17,433 | adb | ------------------------------------------------------------------------------
-- Ada Web Server --
-- --
-- Copyright (C) 2007-2018, AdaCore --
-- --
-- This library is free software; you can redistribute it and/or modify --
-- it under terms of the GNU General Public License as published by the --
-- Free Software Foundation; either version 3, or (at your option) any --
-- later version. This library is distributed in the hope that it will be --
-- useful, but WITHOUT ANY WARRANTY; without even the implied warranty of --
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- --
-- --
-- --
-- --
-- --
-- --
------------------------------------------------------------------------------
with Ada.Characters.Handling;
with Ada.Strings.Fixed;
with AWS.Parameters;
with AWS.URL.Raise_URL_Error;
with AWS.Utils;
package body AWS.URL.Set is
function Normalize (Path : Unbounded_String) return Unbounded_String;
-- Returns Path with all possible occurences of parent and current
-- directories removed. Does not raise exception.
---------------------
-- Connection_Data --
---------------------
procedure Connection_Data
(URL : in out Object;
Host : String;
Port : Positive;
Security : Boolean) is
begin
if Host = "" then
URL.Host := To_Unbounded_String ("localhost");
elsif Host (Host'First) = '[' and then Host (Host'Last) = ']' then
URL.Host :=
To_Unbounded_String (Host (Host'First + 1 .. Host'Last - 1));
else
URL.Host := To_Unbounded_String (Host);
end if;
URL.Port := Port;
if Security then
URL.Protocol := HTTPS;
else
URL.Protocol := HTTP;
end if;
end Connection_Data;
---------------
-- Normalize --
---------------
function Normalize (Path : Unbounded_String) return Unbounded_String is
URL_Path : Unbounded_String := Path;
K : Natural;
P : Natural;
begin
-- Checks for current directory and removes all occurences
-- Look for starting ./
if Length (URL_Path) >= 2 and then Slice (URL_Path, 1, 2) = "./" then
Delete (URL_Path, 1, 1);
end if;
-- Look for all // references
K := 1;
loop
K := Index (URL_Path, "//", From => K);
exit when K = 0;
if K > 1 and then Slice (URL_Path, K - 1, K - 1) = ":" then
K := K + 1;
else
Delete (URL_Path, K, K);
end if;
end loop;
-- Look for all /./ references
K := 1;
loop
K := Index (URL_Path, "/./", From => K);
exit when K = 0;
Delete (URL_Path, K, K + 1);
end loop;
-- Checks for parent directory
P := 1;
loop
K := Index (URL_Path, "/../", From => P);
exit when K = 0;
-- Look for previous directory, which should be removed
P := Strings.Fixed.Index
(Slice (URL_Path, 1, K - 1), "/", Strings.Backward);
exit when P = 0;
Delete (URL_Path, P, K + 2);
end loop;
return URL_Path;
end Normalize;
----------------
-- Parameters --
----------------
procedure Parameters (URL : in out Object; Set : AWS.Parameters.List) is
begin
URL.Parameters := Set;
end Parameters;
function Parameters
(URL : not null access Object) return access AWS.Parameters.List is
begin
return URL.Parameters'Unchecked_Access;
end Parameters;
-----------
-- Parse --
-----------
procedure Parse
(Item : in out Object;
URL : String;
Check_Validity : Boolean := True;
Normalize : Boolean := False)
is
FTP_Token : constant String := "ftp:";
HTTP_Token : constant String := "http:";
HTTPS_Token : constant String := "https:";
WS_Token : constant String := "ws:";
WSS_Token : constant String := "wss:";
L_URL : constant String :=
Strings.Fixed.Translate
(URL, Strings.Maps.To_Mapping ("\", "/"));
P, F : Natural;
Scheme : Unbounded_String;
function "+" (S : String) return Unbounded_String
renames To_Unbounded_String;
procedure Parse (URL : String);
-- Parse URL, the URL must not contain the HTTP_Token prefix.
-- If a hostname is specified, the URL should start with "//"
function Parse_Scheme (URL : String) return String;
-- Parse the protocol part of the URL and return it. Return an empty
-- string if not found.
-----------
-- Parse --
-----------
procedure Parse (URL : String) is
procedure Set_Host (First, Last : Positive);
procedure Parse_Path_File (Start : Positive);
-- Parse Path and File URL information starting at position Start in
-- URL.
I1, I2, I3 : Natural;
LB, RB : Natural;
F : Positive;
Authority_Specified : Boolean;
---------------------
-- Parse_Path_File --
---------------------
procedure Parse_Path_File (Start : Positive) is
PF : constant String := URL (Start .. URL'Last);
I3 : constant Natural :=
Strings.Fixed.Index (PF, "/", Strings.Backward);
begin
if I3 = 0 then
-- No '/' so this is certainly a single file. As a special
-- exception we check for current and parent directories
-- which must be part of the path.
declare
File : constant String := Decode (PF);
begin
if File = ".." or else File = "." then
Item.Path := +File;
Item.File := +"";
else
Item.Path := +"";
Item.File := +File;
end if;
end;
else
-- Check that after the last '/' we have not a current or
-- parent directories which must be part of the path.
declare
File : constant String := Decode (URL (I3 + 1 .. URL'Last));
begin
if File = ".." or else File = "." then
Item.Path := +Decode (PF);
Item.File := +"";
else
Item.Path := +Decode (URL (Start .. I3));
Item.File := +File;
end if;
end;
end if;
end Parse_Path_File;
--------------
-- Set_Host --
--------------
procedure Set_Host (First, Last : Positive) is
begin
if First < Last
and then URL (First) = '['
and then URL (Last) = ']'
then
Item.Host := +URL (First + 1 .. Last - 1);
else
Item.Host := +URL (First .. Last);
end if;
end Set_Host;
begin
Authority_Specified := URL'Length > 2
and then URL (URL'First .. URL'First + 1) = "//";
if not Authority_Specified then
-- No "//", there is no authority (hostname or IP) specified.
-- Let's just parse the data as a path information.
--
-- There no is ambiguity here, the first part cannot be a hostname
-- (the URL would start with "//").
Item.Host := +"";
Parse_Path_File (URL'First);
else
-- The URL starts with "//", so we look up various characters for
-- the authority part. At maximum length it could have:
--
-- //user:pass@host_or_ip:port/
-- | | | |
-- F I1 I3 I2
F := URL'First + 2;
I1 := Strings.Fixed.Index (URL, ":", F);
I2 := Strings.Fixed.Index (URL, "/", F);
I3 := Strings.Fixed.Index (URL, "@", F);
LB := Strings.Fixed.Index (URL, "[", F);
RB := Strings.Fixed.Index (URL, "]", F);
-- Check for [user:password@]
if I1 /= 0 and then I3 /= 0 and then I1 < I3 then
-- We have [user:password@]
Item.User := +URL (F .. I1 - 1);
Item.Password := +URL (I1 + 1 .. I3 - 1);
F := I3 + 1;
-- Check if there is another ':' specified
I1 := Strings.Fixed.Index (URL (F .. URL'Last), ":");
end if;
-- On the previous example, we now have:
--
-- //user:pass@host_or_ip:port/
-- | | |
-- F I1 I2
-- (I3 no longer used)
--
-- If IPv6 address in brackets, the I1 should point to the ':'
-- character right after ']' (port number) or should be 0 (no port
-- number specified). For example we want:
--
-- //optional_user:pass@[IP:6::addr]:port/
-- | || |
-- F, LB RB I1 I2
if LB < RB and then LB > 0 and then (LB < I2 or else I2 = 0) then
if RB < URL'Last and then URL (RB + 1) = ':' then
I1 := RB + 1;
else
I1 := 0;
end if;
end if;
if I1 = 0 then
-- In this case we have not port specified
-- We expect the first string to be the hostname.
if I2 = 0 then
-- No path information, case [user:password@host]
Set_Host (F, URL'Last);
Item.Path := +"/";
else
-- A path, case [user:password@host/path]
Set_Host (F, I2 - 1);
Parse_Path_File (I2);
end if;
elsif I2 = 0 then
-- No path, we have [host:port]
Set_Host (F, I1 - 1);
if Utils.Is_Number (URL (I1 + 1 .. URL'Last)) then
Item.Port := Positive'Value (URL (I1 + 1 .. URL'Last));
else
Raise_URL_Error (Set.Parse.URL, "Port is not valid");
end if;
Item.Path := +"/";
elsif I1 < I2 then
-- Here we have a complete URL [host:port/path]
Set_Host (F, I1 - 1);
if Utils.Is_Number (URL (I1 + 1 .. I2 - 1)) then
Item.Port := Positive'Value (URL (I1 + 1 .. I2 - 1));
else
Raise_URL_Error (Set.Parse.URL, "Port is not valid");
end if;
Parse_Path_File (I2);
else
-- Here we have a complete URL, with no port specified
-- The semicolon is part of the URL [host/path]
Set_Host (F, I2 - 1);
Parse_Path_File (I2);
end if;
end if;
end Parse;
------------------
-- Parse_Scheme --
------------------
function Parse_Scheme (URL : String) return String is
Res : String := URL;
begin
for I in Res'Range loop
case Res (I) is
when 'a' .. 'z' =>
null;
when 'A' .. 'Z' =>
Res (I) := Characters.Handling.To_Lower (Res (I));
when ':' =>
if I > Res'First then
return Res (Res'First .. I - 1);
else
return "";
end if;
when others =>
return "";
end case;
end loop;
return "";
end Parse_Scheme;
begin
Item.Protocol := HTTP;
-- Checks for fragment
F := Strings.Fixed.Index (L_URL, "#");
if F = 0 then
F := L_URL'Last;
Item.Fragment := Null_Unbounded_String;
else
Item.Fragment := +Decode (L_URL (F .. L_URL'Last));
F := F - 1;
end if;
-- Checks for parameters
P := Strings.Fixed.Index (L_URL (L_URL'First .. F), "?");
if P = 0 then
P := F;
else
Item.Parameters.Add (L_URL (P .. F));
P := P - 1;
end if;
-- Checks for prefix
if Utils.Match (L_URL (L_URL'First .. P), HTTP_Token) then
Item.Port := Default_HTTP_Port;
Parse (L_URL (L_URL'First + HTTP_Token'Length .. P));
elsif Utils.Match (L_URL (L_URL'First .. P), HTTPS_Token) then
Item.Port := Default_HTTPS_Port;
Parse (L_URL (L_URL'First + HTTPS_Token'Length .. P));
Item.Protocol := HTTPS;
elsif Utils.Match (L_URL (L_URL'First .. P), WS_Token) then
-- Initial handshake is via http
Item.Port := Default_HTTP_Port;
Parse (L_URL (L_URL'First + WS_Token'Length .. P));
Item.Protocol := HTTP;
elsif Utils.Match (L_URL (L_URL'First .. P), WSS_Token) then
-- Initial handshake is via https
Item.Port := Default_HTTPS_Port;
Parse (L_URL (L_URL'First + WSS_Token'Length .. P));
Item.Protocol := HTTPS;
elsif Utils.Match (L_URL (L_URL'First .. P), FTP_Token) then
Item.Port := Default_FTP_Port;
Parse (L_URL (L_URL'First + FTP_Token'Length .. P));
Item.Protocol := FTP;
elsif P >= L_URL'First then
-- No known scheme detected. Look for a scheme anyway and parse the
-- rest of the URL.
Item.Port := 0;
Scheme := To_Unbounded_String
(Parse_Scheme (L_URL (L_URL'First .. P)));
if Scheme /= Null_Unbounded_String then
Item.Protocol := Scheme;
Parse (L_URL (L_URL'First + Length (Scheme) + 1 .. P));
else
Item.Protocol := Null_Unbounded_String;
Parse (L_URL (L_URL'First .. P));
end if;
else
-- L_URL = ""
Item.Protocol := Null_Unbounded_String;
end if;
-- Normalize the URL path
Item.N_Path := Set.Normalize (Item.Path);
-- Set status
declare
Path_Len : constant Natural := Length (Item.N_Path);
begin
if (Path_Len >= 4 and then Slice (Item.N_Path, 1, 4) = "/../")
or else
(Path_Len = 3 and then Slice (Item.N_Path, 1, 3) = "/..")
then
Item.Status := Wrong;
else
Item.Status := Valid;
end if;
end;
-- If Normalize is activated, the active URL Path is the normalized one
if Normalize then
Item.Path := Item.N_Path;
end if;
-- Raise URL_Error if the URL is suspicious
if Check_Validity and then Item.Status = Wrong then
Raise_URL_Error
(To_String (Item.N_Path),
"Reference Web root parent directory");
end if;
end Parse;
--------------
-- Security --
--------------
procedure Security (URL : in out Object; Flag : Boolean) is
Port_Default : constant Boolean :=
(URL.Protocol = HTTPS and then URL.Port = Default_HTTPS_Port)
or else (URL.Protocol = HTTP and then URL.Port = Default_HTTP_Port)
or else (URL.Protocol = FTP and then URL.Port = Default_FTP_Port);
begin
if Flag then
URL.Protocol := HTTPS;
if Port_Default then
URL.Port := Default_HTTPS_Port;
end if;
else
URL.Protocol := HTTP;
if Port_Default then
URL.Port := Default_HTTP_Port;
end if;
end if;
end Security;
end AWS.URL.Set;
|
charlie5/lace | Ada | 29,713 | adb | package body any_math.any_Algebra.any_linear.any_d3
is
------------
--- Vector_3
--
function Angle (Point_1, Point_2, Point_3 : Vector_3) return Radians
is
use Functions;
Vector_1 : constant Vector_3 := Normalised (Point_1 - Point_2);
Vector_2 : constant Vector_3 := Normalised (Point_3 - Point_2);
cos_Theta : constant Real := Vector_1 * Vector_2;
begin
if cos_Theta >= 1.0
then
return ada.Numerics.Pi;
else
return arcCos (cos_Theta);
end if;
end Angle;
function Angle_between_pre_Norm (U, V : in Vector_3) return Radians
is
use Functions;
Val : Real := U * V; -- Dot product.
begin
if val < -1.0 then val := -1.0; -- Clamp to avoid rounding errors; arcCos will
elsif val > 1.0 then val := 1.0; -- fail with values outside this range.
end if;
return arcCos (Val);
end Angle_between_pre_Norm;
function Midpoint (From, To : in Vector_3) return Vector_3
is
begin
return [(From (1) + To (1)) * 0.5,
(From (2) + To (2)) * 0.5,
(From (3) + To (3)) * 0.5];
end Midpoint;
function Distance (From, To : in Vector_3) return Real
is
begin
return abs (From - To);
end Distance;
function Interpolated (From, To : in Vector_3;
Percent : in unit_Percentage) return Vector_3
is
P : constant Real := to_Real (Percent);
S : constant Real := 1.0 - P;
begin
return [S * From (1) + P * To (1),
S * From (2) + P * To (2),
S * From (3) + P * To (3)];
end Interpolated;
--------------
--- Matrix_3x3
--
function to_Matrix (Row_1, Row_2, Row_3 : in Vector_3) return Matrix_3x3
is
begin
return [[Row_1 (1), Row_1 (2), Row_1 (3)],
[Row_2 (1), Row_2 (2), Row_2 (3)],
[Row_3 (1), Row_3 (2), Row_3 (3)]];
end to_Matrix;
function forward_Direction (Matrix : in Matrix_3x3) return Vector_3
is
begin
return Normalised (Row (Matrix, 3));
end forward_Direction;
function up_Direction (Matrix : in Matrix_3x3) return Vector_3
is
begin
return Normalised (Row (Matrix, 2));
end up_Direction;
function right_Direction (Matrix : in Matrix_3x3) return Vector_3
is
begin
return Normalised (Row (Matrix, 1));
end right_Direction;
-- Following procedure is from Project Spandex, by Paul Nettle.
--
procedure re_Orthonormalise (Matrix : in out Matrix_3x3)
is
use Functions;
m : Matrix_3x3 renames Matrix;
dot1,
dot2,
vlen : Real;
begin
dot1 := m (1, 1) * m (2, 1) + m (1, 2) * m (2, 2) + m (1, 3) * m (2, 3);
dot2 := m (1, 1) * m (3, 1) + m (1, 2) * m (3, 2) + m (1, 3) * m (3, 3);
m (1, 1) := m (1, 1) - dot1 * m (2, 1) - dot2 * m (3, 1);
m (1, 2) := m (1, 2) - dot1 * m (2, 2) - dot2 * m (3, 2);
m (1, 3) := m (1, 3) - dot1 * m (2, 3) - dot2 * m (3, 3);
vlen := 1.0 / SqRt (m (1, 1) * m (1, 1) +
m (1, 2) * m (1, 2) +
m (1, 3) * m (1, 3));
m (1, 1) := m (1, 1) * vlen;
m (1, 2) := m (1, 2) * vlen;
m (1, 3) := m (1, 3) * vlen;
dot1 := m (2, 1) * m (1, 1) + m (2, 2) * m (1, 2) + m (2, 3) * m (1, 3);
dot2 := m (2, 1) * m (3, 1) + m (2, 2) * m (3, 2) + m (2, 3) * m (3, 3);
m (2, 1) := m (2, 1) - dot1 * m (1, 1) - dot2 * m (3, 1);
m (2, 2) := m (2, 2) - dot1 * m (1, 2) - dot2 * m (3, 2);
m (2, 3) := m (2, 3) - dot1 * m (1, 3) - dot2 * m (3, 3);
vlen := 1.0 / SqRt (m (2, 1) * m (2, 1) +
m (2, 2) * m (2, 2) +
m (2, 3) * m (2, 3));
m (2, 1) := m (2, 1) * vlen;
m (2, 2) := m (2, 2) * vlen;
m (2, 3) := m (2, 3) * vlen;
m (3, 1) := m (1, 2) * m (2, 3) - m (1, 3) * m (2, 2);
m (3, 2) := m (1, 3) * m (2, 1) - m (1, 1) * m (2, 3);
m (3, 3) := m (1, 1) * m (2, 2) - m (1, 2) * m (2, 1);
end re_Orthonormalise;
-------------
--- Rotations
--
function xyz_Rotation (x_Angle, y_Angle, z_Angle : in Real) return Matrix_3x3
is
begin
return x_Rotation_from (x_Angle)
* y_Rotation_from (y_Angle)
* z_Rotation_from (z_Angle);
end xyz_Rotation;
function xyz_Rotation (Angles : in Vector_3) return Matrix_3x3
is
begin
return xyz_Rotation (Angles (1),
Angles (2),
Angles (3));
end xyz_Rotation;
function x_Rotation_from (Angle : in Radians) return Matrix_3x3
is
use Functions;
A : Radians renames Angle;
begin
return [[1.0, 0.0, 0.0],
[0.0, Cos (A), -Sin (A)],
[0.0, Sin (A), Cos (A)]];
end x_Rotation_from;
function y_Rotation_from (Angle : in Radians) return Matrix_3x3
is
use Functions;
A : Radians renames Angle;
begin
return [[ Cos (A), 0.0, Sin (A)],
[ 0.0, 1.0, 0.0],
[-Sin (A), 0.0, Cos (A)]];
end y_Rotation_from;
function z_Rotation_from (Angle : in Radians) return Matrix_3x3
is
use Functions;
A : Radians renames Angle;
begin
return [[Cos (A), -Sin (A), 0.0],
[Sin (A), Cos (A), 0.0],
[ 0.0, 0.0, 1.0]];
end z_Rotation_from;
function to_Rotation (Axis_x,
Axis_y,
Axis_z : in Real;
Rotation : in Radians) return Matrix_3x3
is
begin
return to_Matrix (to_Quaternion (Axis_x,
Axis_y,
Axis_z,
Rotation));
end to_Rotation;
function to_Rotation (Axis : in Vector_3;
Angle : in Real) return Matrix_3x3
is
begin
return to_Rotation (Axis (1), Axis (2), Axis (3),
Angle);
end to_Rotation;
---------
--- Euler
--
function to_Rotation (Angles : in Euler) return Matrix_3x3
is
use Functions;
A : constant Real := Cos (Angles (1));
B : constant Real := Sin (Angles (1));
C : constant Real := Cos (Angles (2));
D : constant Real := Sin (Angles (2));
E : constant Real := Cos (Angles (3));
F : constant Real := Sin (Angles (3));
AD : constant Real := A * D;
BD : constant Real := B * D;
begin
return [[ C * E, -C * F, D ],
[ BD * E + A * F, -BD * F + A * E, -B * C],
[-AD * E + B * F, AD * F + B * E, A * C]];
end to_Rotation;
function to_translation_Matrix (Translation : Vector_3) return Matrix_4x4
is
begin
return [[ 1.0, 0.0, 0.0, 0.0],
[ 0.0, 1.0, 0.0, 0.0],
[ 0.0, 0.0, 1.0, 0.0],
[Translation (1), Translation (2), Translation (3), 1.0]];
end to_translation_Matrix;
-----------
--- General
--
function to_Perspective (FoVy : in Degrees;
Aspect,
zNear,
zFar : in Real) return Matrix_4x4
is
use Functions;
deltaZ : constant Real := zFar - zNear;
Rads : constant Radians := to_Radians (FoVy / 2.0);
Sine : constant Real := Sin (Rads);
Cotangent : Real;
begin
if deltaZ = 0.0 or Sine = 0.0 or Aspect = 0.0
then
raise Constraint_Error; -- tbd: 'mesa' simnply returns here ... ?
end if;
Cotangent := cos (Rads) / Sine;
return [[Cotangent / Aspect, 0.0, 0.0, 0.0],
[ 0.0, Cotangent, 0.0, 0.0],
[ 0.0, 0.0, -(zFar + zNear) / deltaZ, -1.0],
[ 0.0, 0.0, -2.0 * zNear * zFar / deltaZ, 0.0]];
end to_Perspective;
function to_viewport_Transform (Origin : Vector_2; Extent : Vector_2) return Matrix_4x4
is
SX : constant Real := Extent (1) / 2.0;
SY : constant Real := Extent (2) / 2.0;
begin
return [1 => [ SX, 0.0, 0.0, 0.0],
2 => [ 0.0, SY, 0.0, 0.0],
3 => [ 0.0, 0.0, 1.0, 0.0],
4 => [SX + Origin (1), SY + Origin (2), 0.0, 1.0]];
end to_viewport_Transform;
function Look_at (Eye, Center, Up : Vector_3) return Matrix_4x4
is
Forward : constant Vector_3 := Normalised ([Center (1) - Eye (1),
Center (2) - Eye (2),
Center (3) - Eye (3)]);
Side : constant Vector_3 := Forward * Up;
new_Up : constant Vector_3 := Side * Forward;
begin
return [[ Side (1), Side (2), Side (3), 0.0],
[ new_Up (1), new_Up (2), new_Up (3), 0.0],
[-Forward (1), -Forward (2), -Forward (3), 0.0],
[ -Eye (1), -Eye (2), -Eye (3), 1.0]];
end Look_at;
-----------------
--- Transform_3d
--
function to_Transform (Matrix : in Matrix_4x4) return Transform_3d
is
begin
return (Rotation => get_Rotation (Matrix),
Translation => get_Translation (Matrix));
end to_Transform;
function "*" (Left : in Transform_3d; Right : in Vector_3) return Vector_3
is
begin
return [Row (Left.Rotation, 1) * Right + Left.Translation (1),
Row (Left.Rotation, 2) * Right + Left.Translation (2),
Row (Left.Rotation, 3) * Right + Left.Translation (3)];
end "*";
function "*" (Left : in Vector_3; Right : in Transform_3d) return Vector_3
is
begin
return Right * Left;
end "*";
function "*" (Left : in Transform_3d; Right : in Transform_3d) return Transform_3d
is
begin
return (Rotation => Left.Rotation * Right.Rotation,
Translation => Left * Right.Translation);
end "*";
function "*" (Left : in Vector_3; Right : in Matrix_4x4) return Vector_3
is
use Vectors;
Result : constant Vector := Vector (Left & 1.0) * Matrix (Right);
begin
return Vector_3 (Result (1 .. 3));
end "*";
function Invert (Transform : in Transform_3d) return Transform_3d
is
Rotation : constant Matrix_3x3 := Transpose (Transform.Rotation);
begin
return (Translation => Rotation * (-Transform.Translation),
Rotation => Rotation);
end Invert;
function inverse_Transform (Transform : in Transform_3d; Vector : in Vector_3) return Vector_3
is
V : constant Vector_3 := Vector - Transform.Translation;
begin
return Transpose (Transform.Rotation) * V;
end inverse_Transform;
---------------
--- Quaternions
--
function to_Quaternion (Matrix : in Matrix_3x3) return Quaternion
is
use Functions;
TR : constant Real := Matrix (1, 1) + Matrix (2, 2) + Matrix (3, 3);
S : Real;
Result : Quaternion;
begin
if TR >= 0.0
then
S := SqRt (TR + 1.0);
Result.R := 0.5 * S;
S := 0.5 * (1.0 / S);
Result.V (1) := (Matrix (3, 2) - Matrix (2, 3)) * S;
Result.V (2) := (Matrix (1, 3) - Matrix (3, 1)) * S;
Result.V (3) := (Matrix (2, 1) - Matrix (1, 2)) * S;
return Result;
end if;
-- Otherwise, find the largest diagonal element and apply the appropriate case.
--
declare
function case_1_Result return Quaternion
is
begin
S := SqRt (Matrix (1, 1) - (Matrix (2, 2) + Matrix (3, 3)) + 1.0);
Result.V (1) := 0.5 * S;
S := 0.5 * (1.0 / S);
Result.V (2) := (Matrix (1, 2) + Matrix (2, 1)) * S;
Result.V (3) := (Matrix (3, 1) + Matrix (1, 3)) * S;
Result.R := (Matrix (3, 2) - Matrix (2, 3)) * S;
return Result;
end case_1_Result;
function case_2_Result return Quaternion
is
begin
S := SqRt (Matrix (2, 2) - (Matrix (3, 3) + Matrix (1, 1)) + 1.0);
Result.V (2) := 0.5 * S;
S := 0.5 * (1.0 / S);
Result.V (3) := (Matrix (2, 3) + Matrix (3, 2)) * S;
Result.V (1) := (Matrix (1, 2) + Matrix (2, 1)) * S;
Result.R := (Matrix (1, 3) - Matrix (3, 1)) * S;
return Result;
end case_2_Result;
function case_3_Result return Quaternion
is
begin
S := SqRt (Matrix (3, 3) - (Matrix (1, 1) + Matrix (2, 2)) + 1.0);
Result.V (3) := 0.5 * S;
S := 0.5 * (1.0 / S);
Result.V (1) := (Matrix (3, 1) + Matrix (1, 3)) * S;
Result.V (2) := (Matrix (2, 3) + Matrix (3, 2)) * S;
Result.R := (Matrix (2, 1) - Matrix (1, 2)) * S;
return Result;
end case_3_Result;
pragma Inline (case_1_Result);
pragma Inline (case_2_Result);
pragma Inline (case_3_Result);
begin
if Matrix (2, 2) > Matrix (1, 1)
then
if Matrix (3, 3) > Matrix (2, 2)
then
return case_3_Result;
end if;
return case_2_Result;
end if;
if Matrix (3, 3) > Matrix (1, 1)
then
return case_3_Result;
end if;
return case_1_Result;
end;
end to_Quaternion;
procedure set_from_Matrix_3x3 (Quat : out Quaternion; Matrix : in Matrix_3x3)
is
use Functions;
S : Real;
TR : constant Real := 1.0 + Matrix (1, 1)
+ Matrix (2, 2)
+ Matrix (3, 3);
begin
if TR > 1.0e-9
then
S := SqRt (TR);
Quat.R := 0.5 * S;
S := 0.5 / S;
Quat.V (1) := (Matrix (2, 3) - Matrix (3, 2)) * S;
Quat.V (2) := (Matrix (3, 1) - Matrix (1, 3)) * S;
Quat.V (3) := (Matrix (1, 2) - Matrix (2, 1)) * S;
else
declare
I : Index := 0;
begin
if Matrix (2, 2) > Matrix (1, 1)
then
I := 1;
end if;
if Matrix (3, 3) > Matrix (I, I)
then
I := 2;
end if;
case I
is
when 0 =>
S := SqRt ((Matrix (1, 1) - (Matrix (2, 2) + Matrix (3, 3))) + 1.0);
Quat.V (1) := 0.5 * S;
S := 0.5 / S;
Quat.V (2) := (Matrix (2, 1) + Matrix (1, 2)) * S;
Quat.V (3) := (Matrix (1, 3) + Matrix (3, 1)) * S;
Quat.R := (Matrix (2, 3) - Matrix (3, 2)) * S;
when 1 =>
S := SqRt ((Matrix (2, 2) - (Matrix (3, 3) + Matrix (1, 1))) + 1.0);
Quat.V (2) := 0.5 * S;
S := 0.5 / S;
Quat.V (3) := (Matrix (3, 2) + Matrix (2, 3)) * S;
Quat.V (1) := (Matrix (2, 1) + Matrix (1, 2)) * S;
Quat.R := (Matrix (3, 1) - Matrix (1, 3)) * S;
when 2 =>
S := SqRt ((Matrix (3, 3) - (Matrix (1, 1) + Matrix (2, 2))) + 1.0);
Quat.V (3) := 0.5 * S;
S := 0.5 / S;
Quat.V (1) := (Matrix (1, 3) + Matrix (3, 1)) * S;
Quat.V (2) := (Matrix (3, 2) + Matrix (2, 3)) * S;
Quat.R := (Matrix (1, 2) - Matrix (2, 1)) * S;
when others =>
raise Program_Error;
end case;
end;
end if;
end set_from_Matrix_3x3;
function to_Matrix (Quat : in Quaternion) return Matrix_3x3
is
Result : Matrix_3x3;
qq2 : constant Real := 2.0 * Quat.V (1) * Quat.V (1);
qq3 : constant Real := 2.0 * Quat.V (2) * Quat.V (2);
qq4 : constant Real := 2.0 * Quat.V (3) * Quat.V (3);
begin
Result (1, 1) := 1.0 - qq3 - qq4;
Result (1, 2) := 2.0 * (Quat.V (1) * Quat.V (2) - Quat.R * Quat.V (3));
Result (1, 3) := 2.0 * (Quat.V (1) * Quat.V (3) + Quat.R * Quat.V (2));
Result (2, 1) := 2.0 * (Quat.V (1) * Quat.V (2) + Quat.R * Quat.V (3));
Result (2, 2) := 1.0 - qq2 - qq4;
Result (2, 3) := 2.0 * (Quat.V (2) * Quat.V (3) - Quat.R * Quat.V (1));
Result (3, 1) := 2.0 * (Quat.V (1) * Quat.V (3) - Quat.R * Quat.V (2));
Result (3, 2) := 2.0 * (Quat.V (2) * Quat.V (3) + Quat.R * Quat.V (1));
Result (3, 3) := 1.0 - qq2 - qq3;
return Result;
end to_Matrix;
function "+" (Left, Right : in Quaternion) return Quaternion
is
begin
return
(R => Left.R + Right.R,
V => [Left.V (1) + Right.V (1),
Left.V (2) + Right.V (2),
Left.V (3) + Right.V (3)]);
end "+";
function "-" (Left, Right : in Quaternion) return Quaternion
is
begin
return
(R => Left.R - Right.R,
V => [Left.V (1) - Right.V (1),
Left.V (2) - Right.V (2),
Left.V (3) - Right.V (3)]);
end "-";
function "-" (Quat : in Quaternion) return Quaternion
is
begin
return (-Quat.R, -Quat.V);
end "-";
function "*" (Left, Right : in Quaternion) return Real
is
begin
return
Left.R * Right.R
+ Left.V (1) * Right.V (1)
+ Left.V (2) * Right.V (2)
+ Left.V (3) * Right.V (3);
end "*";
function "*" (Left, Right : in Quaternion) return Quaternion
is
begin
return
(V => [Left.R * Right.V (1) + Left.V (1) * Right.R + Left.V (2) * Right.V (3) - Left.V (3) * Right.V (2),
Left.R * Right.V (2) + Left.V (2) * Right.R + Left.V (3) * Right.V (1) - Left.V (1) * Right.V (3),
Left.R * Right.V (3) + Left.V (3) * Right.R + Left.V (1) * Right.V (2) - Left.V (2) * Right.V (1)],
R => Left.R * Right.R
- Left.V (1) * Right.V (1)
- Left.V (2) * Right.V (2)
- Left.V (3) * Right.V (3));
end "*";
function Invert (Quat : in Quaternion) return Quaternion
is
begin
return (Quat.R, -Quat.V);
end Invert;
function Angle (Quat : in Quaternion) return Real
is
use Functions;
Q : Quaternion := Quat;
begin
if Q.R > 1.0
then
normalise (Q); -- If R > 1.0, arCos and SqRt will produce errors, this cant happen if quaternion is normalised.
end if;
return 2.0 * arcCos (Q.R);
end Angle;
function Axis (Quat : in Quaternion) return Vector_3
is
begin
return Quat.V;
end Axis;
function "*" (Left : in Quaternion; Right : in Vector_3) return Quaternion
is
begin
return
( Left.R * Right (1) + Left.V (2) * Right (3) - Left.V (3) * Right (2),
[Left.R * Right (2) + Left.V (3) * Right (1) - Left.V (1) * Right (3),
Left.R * Right (3) + Left.V (1) * Right (2) - Left.V (2) * Right (1),
-Left.V (1) * Right (1) - Left.V (2) * Right (2) - Left.V (3) * Right (3)]);
end "*";
function "*" (Left : in Vector_3; Right : in Quaternion) return Quaternion
is
begin
return
(-Left (1) * Right.V (1) - Left (2) * Right.V (2) - Left (3) * Right.V (3),
[Left (1) * Right.R + Left (2) * Right.V (3) - Left (3) * Right.V (2),
Left (2) * Right.R + Left (3) * Right.V (1) - Left (1) * Right.V (3),
Left (3) * Right.R + Left (1) * Right.V (2) - Left (2) * Right.V (1)]);
end "*";
function "*" (Left : in Quaternion; Right : in Real) return Quaternion
is
begin
return
(R => Left.R * Right,
V => [Left.V (1) * Right,
Left.V (2) * Right,
Left.V (3) * Right]);
end "*";
function Norm (Quat : in Quaternion) return Real
is
use Functions;
begin
return SqRt ( Quat.R * Quat.R
+ Quat.V (1) * Quat.V (1)
+ Quat.V (2) * Quat.V (2)
+ Quat.V (3) * Quat.V (3));
end Norm;
function Versor (Quat : in Quaternion) return Quaternion
is
begin
return Quat / Norm (Quat);
end Versor;
function Farthest (Quat : in Quaternion; qd : in Quaternion) return Quaternion
is
Diff : constant Quaternion := Quat - qd;
Sum : constant Quaternion := Quat + qd;
begin
if Diff * Diff > Sum * Sum
then
return qd;
end if;
return -qd;
end Farthest;
function Interpolated (From,
To : in Quaternion;
Percent : in unit_Percentage) return Quaternion
is
begin
if Percent = 0.0 then return From;
elsif Percent = 100.0 then return To;
end if;
declare
-- Q1 and Q2 should be unit length or else something broken will happen.
Q1 : Quaternion := From;
Q2 : Quaternion renames To;
Dot : Real := Q1 * Q2;
Dot_Threshold : constant := 0.9995;
P : constant Real := to_Real (Percent);
begin
if Dot < 0.0
then -- Ensure we take the short path.
Q1 := -Q1;
Dot := -Dot;
end if;
if Dot > Dot_Threshold
then
return Normalised (Q1 + (Q2 - Q1) * P);
end if;
clamp (Dot, -1.0, 1.0); -- Robustness: Stay within domain of arcCos.
declare
use Functions;
theta_0 : constant Real := arcCos (Dot); -- theta_0 = Angle between input vectors.
theta : constant Real := theta_0 * P; -- theta = Angle between Q1 and result.
Q3 : constant Quaternion := Normalised (Q2 - Q1*Dot);
begin
return Q1 * Cos (theta) + Q3 * Sin (theta);
end;
end;
end Interpolated;
------------
--- Vector_4
--
function "/" (Left, Right : Vector_4) return Vector_4
is
begin
return [Left (1) / Right (1),
Left (2) / Right (2),
Left (3) / Right (3),
Left (4) / Right (4)];
end "/";
function max_Axis (Vector : in Vector_4) return Integer
is
max_Index : Integer := -1;
max_Val : Real := -1.0e30;
begin
if Vector (1) > max_Val
then
max_Index := 1;
max_Val := Vector (1);
end if;
if Vector (2) > max_Val
then
max_Index := 2;
max_Val := Vector (2);
end if;
if Vector (3) > max_Val
then
max_Index := 3;
max_Val := Vector (3);
end if;
if Vector (4) > max_Val
then
max_Index := 4;
max_Val := Vector (4);
end if;
return max_Index;
end max_Axis;
function closest_Axis (Vector : in Vector_4) return Integer
is
begin
return max_Axis ([abs (Vector (1)),
abs (Vector (2)),
abs (Vector (3)),
abs (Vector (4))]);
end closest_Axis;
-- From mesa.
--
function unProject (From : in Vector_3;
Model : in Matrix_4x4;
Projection : in Matrix_4x4;
Viewport : in Rectangle) return Vector_3
is
final_Matrix : constant Matrix_4x4 := Transpose (Inverse (Model * Projection));
window_Position : Vector_4 := [From (1), From (2), From (3), 1.0];
world_Position : Vector_4;
begin
-- Map x and y from window coordinates.
--
window_Position (1) := (window_Position (1) - Real (Viewport.Min (1))) / Real (Viewport.Max (1));
window_Position (2) := (window_Position (2) - Real (Viewport.Min (2))) / Real (Viewport.Max (2));
window_Position (1) := window_Position (1) * 2.0 - 1.0; -- Map to range -1.0 .. 1.0.
window_Position (2) := window_Position (2) * 2.0 - 1.0;
window_Position (3) := window_Position (3) * 2.0 - 1.0;
world_Position := final_Matrix * window_Position;
if world_Position (4) = 0.0
then
raise Constraint_Error with "unProject: world_Position (4) = 0.0";
else
world_Position (1) := world_Position (1) / world_Position (4);
world_Position (2) := world_Position (2) / world_Position (4);
world_Position (3) := world_Position (3) / world_Position (4);
end if;
return Vector_3 (world_Position (1 .. 3));
end unProject;
--------------
--- Matrix_4x4
--
function to_translate_Matrix (Translation : in Vector_3) return Matrix_4x4
is
begin
return [[ 1.0, 0.0, 0.0, 0.0],
[ 0.0, 1.0, 0.0, 0.0],
[ 0.0, 0.0, 1.0, 0.0],
[Translation (1), Translation (2), Translation (3), 1.0]];
end to_translate_Matrix;
function to_scale_Matrix (Scale : in Vector_3) return Matrix_4x4
is
begin
return [[Scale (1), 0.0, 0.0, 0.0],
[0.0, Scale (2), 0.0, 0.0],
[0.0, 0.0, Scale (3), 0.0],
[0.0, 0.0, 0.0, 1.0]];
end to_scale_Matrix;
function to_rotate_Matrix (Rotation : in Matrix_3x3) return Matrix_4x4
is
begin
return [[Rotation (1, 1), Rotation (1, 2), Rotation (1, 3), 0.0],
[Rotation (2, 1), Rotation (2, 2), Rotation (2, 3), 0.0],
[Rotation (3, 1), Rotation (3, 2), Rotation (3, 3), 0.0],
[ 0.0, 0.0, 0.0, 1.0]];
end to_rotate_Matrix;
function to_transform_Matrix (Rotation : in Matrix_3x3; Translation : in Vector_3) return Matrix_4x4
is
begin
return [[Rotation (1, 1), Rotation (1, 2), Rotation (1, 3), 0.0],
[Rotation (2, 1), Rotation (2, 2), Rotation (2, 3), 0.0],
[Rotation (3, 1), Rotation (3, 2), Rotation (3, 3), 0.0],
[Translation (1), Translation (2), Translation (3), 1.0]];
end to_transform_Matrix;
--------------
--- Transforms
--
function to_transform_Matrix (Transform : in Transform_3d) return Matrix_4x4
is
begin
return to_rotate_Matrix (Transform.Rotation)
* to_translate_Matrix (Transform.Translation);
end to_transform_Matrix;
function get_Rotation (Transform : in Matrix_4x4) return Matrix_3x3
is
begin
return [[Transform (1, 1), Transform (1, 2), Transform (1, 3)],
[Transform (2, 1), Transform (2, 2), Transform (2, 3)],
[Transform (3, 1), Transform (3, 2), Transform (3, 3)]];
end get_Rotation;
procedure set_Rotation (Transform : in out Matrix_4x4; To : in Matrix_3x3)
is
begin
Transform (1, 1) := To (1, 1); Transform (1, 2) := To (1, 2); Transform (1, 3) := To (1, 3); Transform (1, 4) := 0.0;
Transform (2, 1) := To (2, 1); Transform (2, 2) := To (2, 2); Transform (2, 3) := To (2, 3); Transform (2, 4) := 0.0;
Transform (3, 1) := To (3, 1); Transform (3, 2) := To (3, 2); Transform (3, 3) := To (3, 3); Transform (3, 4) := 0.0;
end set_Rotation;
function get_Translation (Transform : in Matrix_4x4) return Vector_3
is
begin
return [Transform (4, 1), Transform (4, 2), Transform (4, 3)];
end get_Translation;
procedure set_Translation (Transform : in out Matrix_4x4; To : in Vector_3)
is
begin
Transform (4, 1) := To (1);
Transform (4, 2) := To (2);
Transform (4, 3) := To (3);
Transform (4, 4) := 1.0;
end set_Translation;
function inverse_Rotation (Rotation : in Matrix_3x3) return Matrix_3x3
is
-- pragma Suppress (all_Checks); -- For speed.
m : Matrix_3x3 renames Rotation;
begin
return [[m (1,1), m (2,1), m (3,1)],
[m (1,2), m (2,2), m (3,2)],
[m (1,3), m (2,3), m (3,3)]];
end inverse_Rotation;
function inverse_Transform (Transform : in Matrix_4x4) return Matrix_4x4
is
-- pragma Suppress (all_Checks); -- For speed.
m : Matrix_4x4 renames Transform;
R : constant Matrix_3x3 := [[ m (1,1), m (2,1), m (3,1)],
[ m (1,2), m (2,2), m (3,2)],
[ m (1,3), m (2,3), m (3,3)]];
T : constant Vector_3 := Vector_3' (m (4,1), m (4,2), m (4,3)) * R;
begin
return [[ m (1,1), m (2,1), m (3,1), 0.0],
[ m (1,2), m (2,2), m (3,2), 0.0],
[ m (1,3), m (2,3), m (3,3), 0.0],
[ -T (1), -T (2), -T (3), 1.0]];
end inverse_Transform;
end any_math.any_Algebra.any_linear.any_d3;
|
leo-brewin/adm-bssn-numerical | Ada | 14,515 | adb | with Support.Clock; use Support.Clock;
with Support.CmdLine; use Support.CmdLine;
with Support.Strings; use Support.Strings;
with BSSNBase.ADM_BSSN; use BSSNBase.ADM_BSSN;
with BSSNBase.Coords; use BSSNBase.Coords;
with BSSNBase.Constraints; use BSSNBase.Constraints;
-- for creation of directories if needed
with Ada.Directories;
package body BSSNBase.Text_IO is
data_directory : String := read_command_arg ('D',"data/");
results_directory : String := read_command_arg ('O',"results/");
-- returns 'xx', 'xy' etc. these are the values of type symmetric
-- used when printing indices of symmetric matrices
function str (source : in symmetric) return string is
begin
return lower_case (source'Image);
end str;
procedure write_results (sample_index_list : GridIndexList;
sample_index_num : Integer;
file_name : String)
is
num_data_max : constant := 15;
txt : File_Type;
num_dimen : constant := 3;
num_rows : Integer;
num_cols : Integer;
num_vars : Integer;
the_date : String := get_date;
ijk : Array (1 .. 3) of Integer;
ijk_max : Array (1 .. 3) of Integer;
ijk_min : Array (1 .. 3) of Integer;
xyz : Array (1 .. 3) of Real;
xyz_max : Array (1 .. 3) of Real;
xyz_min : Array (1 .. 3) of Real;
data : Array (1 .. num_data_max) of Real;
data_max : Array (1 .. num_data_max) of Real;
data_min : Array (1 .. num_data_max) of Real;
procedure check_NaN (a : Integer) is
begin
if data (a) /= data (a) then
raise Data_Error with "NaN detected in data ("&str(a,0)&") "&
"at (x,y,z) = ("&
str(xyz(1))&","&
str(xyz(2))&","&
str(xyz(3))&")";
end if;
end check_NaN;
procedure get_data (a : Integer)
is
point : GridPoint;
i, j, k : Integer;
x, y, z : Real;
gab : MetricPointArray;
Kab : ExtcurvPointArray;
begin
point := grid_point_list (sample_index_list (a));
i := point.i;
j := point.j;
k := point.k;
x := point.x;
y := point.y;
z := point.z;
-- save selected data
ijk := (i, j, k);
xyz := (x, y, z);
-- ADM data
gab := adm_gab (gBar(i,j,k), phi(i,j,k));
Kab := adm_Kab (ABar(i,j,k), gBar(i,j,k), phi(i,j,k), trK(i,j,k));
data ( 1) := gab (xx);
data ( 2) := gab (yy);
data ( 3) := gab (zz);
data ( 4) := Kab (xx);
data ( 5) := Kab (yy);
data ( 6) := Kab (zz);
data ( 7) := Ham (i,j,k);
data ( 8) := Mom (i,j,k)(1);
data ( 9) := Mom (i,j,k)(2);
data (10) := Mom (i,j,k)(3);
data (11) := get_detg (i,j,k);
data (12) := get_trABar (i,j,k);
num_vars := 12; -- number of phyical data in each row
-- BSSN data
-- data ( 1) := gBar (i,j,k)(xx);
-- data ( 2) := gBar (i,j,k)(yy);
-- data ( 3) := gBar (i,j,k)(zz);
-- data ( 4) := ABar (i,j,k)(xx);
-- data ( 5) := ABar (i,j,k)(yy);
-- data ( 6) := ABar (i,j,k)(zz);
-- data ( 7) := Ham (i,j,k);
-- data ( 8) := Mom (i,j,k)(1);
-- data ( 9) := Mom (i,j,k)(2);
-- data (10) := Mom (i,j,k)(3);
-- data (11) := get_detg (i,j,k);
-- data (12) := get_trABar (i,j,k);
--
-- num_vars := 12; -- number of phyical data in each row
end get_data;
begin
if sample_index_num = 0 then
return;
end if;
-- First pass : get min/max for the data -----------------------------------
ijk_max := (others => -666666);
ijk_min := (others => +666666);
xyz_max := (others => -666.6e66);
xyz_min := (others => +666.6e66);
data_max := (others => -666.6e66);
data_min := (others => +666.6e66);
for a in 1 .. sample_index_num loop
get_data (a);
for b in 1 .. num_vars loop
check_NaN (b);
end loop;
for b in 1 .. 3 loop
ijk_max (b) := max ( ijk_max (b), ijk (b) );
ijk_min (b) := min ( ijk_min (b), ijk (b) );
end loop;
for b in 1 .. 3 loop
xyz_max (b) := max ( xyz_max (b), xyz (b) );
xyz_min (b) := min ( xyz_min (b), xyz (b) );
end loop;
for b in 1 .. num_vars loop
data_max (b) := max ( data_max (b), data (b) );
data_min (b) := min ( data_min (b), data (b) );
end loop;
end loop;
-- Second pass : save the data ---------------------------------------------
Create (txt, Out_File, cut(file_name));
Put_Line (txt, "# 7 more lines before the data");
-- dimensions of the grid, number of vars, time & date
num_cols := 3 + 3 + num_vars; -- number of columns in body of data
num_rows := sample_index_num; -- number of rows in body of data
Put_Line (txt, "# " & str (num_rows, 0) & " rows of data");
Put_Line (txt, "# " & str (num_cols, 0) & " columns of data");
Put_Line (txt, "# " & str (the_time, 15) & " cauchy time");
Put_Line (txt, "# " & (the_date) & " today's date");
-- max and min values for each variable
Put (txt,"# ");
for i in 1 .. 3 loop
Put (txt, str(ijk_max(i),3) & spc (1));
end loop;
for i in 1 .. 3 loop
Put (txt, str(xyz_max(i),10) & spc (1));
end loop;
for i in 1 .. num_vars loop
Put (txt, str(data_max(i),15) & spc (1));
end loop;
Put_Line (txt," : max");
Put (txt,"# ");
for i in 1 .. 3 loop
Put (txt, str(ijk_min(i),3) & spc (1));
end loop;
for i in 1 .. 3 loop
Put (txt, str(xyz_min(i),10) & spc (1));
end loop;
for i in 1 .. num_vars loop
Put (txt, str(data_min(i),15) & spc (1));
end loop;
Put_Line (txt," : min");
-- the data names
Put (txt,"# ");
Put (txt, centre ("i",4,1));
Put (txt, centre ("j",4,1));
Put (txt, centre ("k",4,1));
Put (txt, centre ("x",11));
Put (txt, centre ("y",11));
Put (txt, centre ("z",11));
Put (txt, centre ("gxx",16));
Put (txt, centre ("gyy",16));
Put (txt, centre ("gzz",16));
Put (txt, centre ("Kxx",16));
Put (txt, centre ("Kyy",16));
Put (txt, centre ("Kzz",16));
Put (txt, centre ("Ham",16));
Put (txt, centre ("Mom(x)",16));
Put (txt, centre ("Mom(y)",16));
Put (txt, centre ("Mom(z)",16));
Put (txt, centre ("detg",16));
Put (txt, centre ("trABar",16));
New_Line (txt);
-- Put (txt,"# ");
-- Put (txt, centre ("i",4,1));
-- Put (txt, centre ("j",4,1));
-- Put (txt, centre ("k",4,1));
-- Put (txt, centre ("x",11));
-- Put (txt, centre ("y",11));
-- Put (txt, centre ("z",11));
-- Put (txt, centre ("gBarxx",16));
-- Put (txt, centre ("gBaryy",16));
-- Put (txt, centre ("gBarzz",16));
-- Put (txt, centre ("ABarxx",16));
-- Put (txt, centre ("ABaryy",16));
-- Put (txt, centre ("ABarzz",16));
-- Put (txt, centre ("Ham",16));
-- Put (txt, centre ("Mom(x)",16));
-- Put (txt, centre ("Mom(y)",16));
-- Put (txt, centre ("Mom(z)",16));
-- Put (txt, centre ("detg",16));
-- Put (txt, centre ("trABar",16));
-- New_Line (txt);
-- the data on the grid
for a in 1 .. num_rows loop
get_data (a);
Put (txt, spc (2));
for b in 1 .. 3 loop
Put (txt, str (ijk (b), 3) & spc (1));
end loop;
for b in 1 .. 3 loop
Put (txt, str (xyz (b), 10) & spc (1));
end loop;
for b in 1 .. num_vars loop
Put (txt, str (data (b), 15) & spc (1));
end loop;
New_Line (txt);
end loop;
Close (txt);
end write_results;
procedure write_results is
num_loop_str : String := fill_str (num_loop, 5, '0');
begin
set_constraints;
Ada.Directories.create_path (results_directory & "/xy/");
Ada.Directories.create_path (results_directory & "/xz/");
Ada.Directories.create_path (results_directory & "/yz/");
write_results (xy_index_list, xy_index_num, results_directory & "/xy/" & num_loop_str & ".txt");
write_results (xz_index_list, xz_index_num, results_directory & "/xz/" & num_loop_str & ".txt");
write_results (yz_index_list, yz_index_num, results_directory & "/yz/" & num_loop_str & ".txt");
end write_results;
procedure write_history (point : GridPoint;
file_name : String)
is
txt : File_Type;
i, j, k : Integer;
x, y, z : Real;
gab : MetricPointArray;
Kab : ExtcurvPointArray;
begin
i := sample_point.i;
j := sample_point.j;
k := sample_point.k;
x := sample_point.x;
y := sample_point.y;
z := sample_point.z;
begin
Open (txt, Append_File, file_name);
exception when Name_Error =>
Create (txt, Out_File, file_name);
Put_Line (txt, "# 4 more lines before the data");
Put_Line (txt, "# 13 columns of data");
Put_Line (txt,"# (" & str (i,0) & ", " &
str (j,0) & ", " &
str (k,0) & ") = grid indices of target");
Put_Line (txt,"# (" & str (x,10) & ", " &
str (y,10) & ", " &
str (z,10) & ") = grid coords of target");
Put_Line (txt, "# " &
centre ("Time",10) &
centre ("gxx",11) &
centre ("gyy",11) &
centre ("gzz",11) &
centre ("Kxx",11) &
centre ("Kyy",11) &
centre ("Kzz",11) &
centre ("Ham",11) &
centre ("Mom(x)",11) &
centre ("Mom(y)",11) &
centre ("Mom(z)",11) &
centre ("detg",11) &
centre ("trABar",11));
end;
-- ADM data
gab := adm_gab (gBar(i,j,k), phi(i,j,k));
Kab := adm_Kab (ABar(i,j,k), gBar(i,j,k), phi(i,j,k), trK(i,j,k));
Put (txt, spc (1) & str (the_time));
Put (txt, spc (1) & str (gab (xx)));
Put (txt, spc (1) & str (gab (yy)));
Put (txt, spc (1) & str (gab (zz)));
Put (txt, spc (1) & str (Kab (xx)));
Put (txt, spc (1) & str (Kab (yy)));
Put (txt, spc (1) & str (Kab (zz)));
Put (txt, spc (1) & str (Ham (i,j,k)));
Put (txt, spc (1) & str (Mom (i,j,k)(1)));
Put (txt, spc (1) & str (Mom (i,j,k)(2)));
Put (txt, spc (1) & str (Mom (i,j,k)(3)));
Put (txt, spc (1) & str (get_detg (i,j,k)));
Put (txt, spc (1) & str (get_trABar (i,j,k)));
New_Line (txt);
Close (txt);
end write_history;
procedure write_history is
begin
write_history (sample_point,results_directory & "/history.txt");
end write_history;
procedure write_summary
is
i, j, k : Integer;
gab : MetricPointArray;
Kab : ExtcurvPointArray;
begin
i := sample_point.i;
j := sample_point.j;
k := sample_point.k;
set_constraints;
gab := adm_gab (gBar(i,j,k), phi(i,j,k));
Kab := adm_Kab (ABar(i,j,k), gBar(i,j,k), phi(i,j,k), trK(i,j,k));
Put (spc (1) & str (num_loop,4));
Put (spc (1) & str (the_time,10));
Put (spc (1) & str (time_step,10));
Put (spc (1) & str (gab (xx),10));
Put (spc (1) & str (gab (zz),10));
Put (spc (1) & str (Kab (xx),10));
Put (spc (1) & str (Kab (zz),10));
Put (spc (1) & str (Ham (i,j,k),10));
New_Line;
end write_summary;
summary_dashes : String (1..83) := (others => '-');
procedure write_summary_header is
begin
Put_Line (summary_dashes);
Put (" ");
Put (centre("loop",5));
Put (centre("time",11));
Put (centre("step",11));
Put (centre("gxx",11));
Put (centre("gzz",11));
Put (centre("Kxx",11));
Put (centre("Kzz",11));
Put (centre("Ham.",11));
New_Line;
Put_Line (summary_dashes);
end write_summary_header;
procedure write_summary_trailer is
begin
Put_Line (summary_dashes);
end write_summary_trailer;
procedure create_text_io_lists is
a : Integer := 0;
num_xy : Integer := 0;
num_xz : Integer := 0;
num_yz : Integer := 0;
x, y, z : Real;
begin
a := 0;
num_xy := 0;
num_xz := 0;
num_yz := 0;
for i in 1 .. num_x loop
for j in 1 .. num_y loop
for k in 1 .. num_y loop
x := x_coord (i);
y := y_coord (j);
z := z_coord (k);
a := a + 1;
-- xy plane
if abs (z) < dz/2.0 then
num_xy := num_xy + 1;
xy_index_list (num_xy) := a;
end if;
-- xz plane
if abs (y) < dy/2.0 then
num_xz := num_xz + 1;
xz_index_list (num_xz) := a;
end if;
-- yz plane
if abs (x) < dx/2.0 then
num_yz := num_yz + 1;
yz_index_list (num_yz) := a;
end if;
-- the sample point = the origin, used in write_history
if abs (x) < dx/2.0 and
abs (y) < dy/2.0 and
abs (z) < dz/2.0 then
sample_point := (i,j,k,0.0,0.0,0.0);
end if;
end loop;
end loop;
end loop;
xy_index_num := num_xy;
xz_index_num := num_xz;
yz_index_num := num_yz;
end create_text_io_lists;
end BSSNBase.Text_IO;
|
zhmu/ananas | Ada | 25,062 | adb | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . T R A C E B A C K --
-- (HP/UX Version) --
-- --
-- B o d y --
-- --
-- Copyright (C) 2009-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. --
-- --
------------------------------------------------------------------------------
with Ada.Unchecked_Conversion;
package body System.Traceback is
-- This package implements the backtracing facility by way of a dedicated
-- HP library for stack unwinding described in the "Runtime Architecture
-- Document".
pragma Linker_Options ("/usr/lib/libcl.a");
-- The library basically offers services to fetch information about a
-- "previous" frame based on information about a "current" one.
type Current_Frame_Descriptor is record
cur_fsz : Address; -- Frame size of current routine.
cur_sp : Address; -- The current value of stack pointer.
cur_rls : Address; -- PC-space of the caller.
cur_rlo : Address; -- PC-offset of the caller.
cur_dp : Address; -- Data Pointer of the current routine.
top_rp : Address; -- Initial value of RP.
top_mrp : Address; -- Initial value of MRP.
top_sr0 : Address; -- Initial value of sr0.
top_sr4 : Address; -- Initial value of sr4.
top_r3 : Address; -- Initial value of gr3.
cur_r19 : Address; -- GR19 value of the calling routine.
top_r4 : Address; -- Initial value of gr4.
dummy : Address; -- Reserved.
out_rlo : Address; -- PC-offset of the caller after get_previous.
end record;
type Previous_Frame_Descriptor is record
prev_fsz : Address; -- frame size of calling routine.
prev_sp : Address; -- SP of calling routine.
prev_rls : Address; -- PC_space of calling routine's caller.
prev_rlo : Address; -- PC_offset of calling routine's caller.
prev_dp : Address; -- DP of calling routine.
udescr0 : Address; -- low word of calling routine's unwind desc.
udescr1 : Address; -- high word of calling routine's unwind desc.
ustart : Address; -- start of the unwind region.
uend : Address; -- end of the unwind region.
uw_index : Address; -- index into the unwind table.
prev_r19 : Address; -- GR19 value of the caller's caller.
top_r3 : Address; -- Caller's initial gr3.
top_r4 : Address; -- Caller's initial gr4.
end record;
-- Provide useful shortcuts for the names
subtype CFD is Current_Frame_Descriptor;
subtype PFD is Previous_Frame_Descriptor;
-- Frames with dynamic stack allocation are handled using the associated
-- frame pointer, but HP compilers and GCC setup this pointer differently.
-- HP compilers set it to point at the top (highest address) of the static
-- part of the frame, whereas GCC sets it to point at the bottom of this
-- region. We have to fake the unwinder to compensate for this difference,
-- for which we'll need to access some subprograms unwind descriptors.
type Bits_2_Value is mod 2 ** 2;
for Bits_2_Value'Size use 2;
type Bits_4_Value is mod 2 ** 4;
for Bits_4_Value'Size use 4;
type Bits_5_Value is mod 2 ** 5;
for Bits_5_Value'Size use 5;
type Bits_27_Value is mod 2 ** 27;
for Bits_27_Value'Size use 27;
type Unwind_Descriptor is record
cannot_unwind : Boolean;
mcode : Boolean;
mcode_save_restore : Boolean;
region_desc : Bits_2_Value;
reserved0 : Boolean;
entry_sr : Boolean;
entry_fr : Bits_4_Value;
entry_gr : Bits_5_Value;
args_stored : Boolean;
variable_frame : Boolean;
separate_package_body : Boolean;
frame_extension_mcode : Boolean;
stack_overflow_check : Boolean;
two_steps_sp_adjust : Boolean;
sr4_export : Boolean;
cxx_info : Boolean;
cxx_try_catch : Boolean;
sched_entry_seq : Boolean;
reserved1 : Boolean;
save_sp : Boolean;
save_rp : Boolean;
save_mrp : Boolean;
save_r19 : Boolean;
cleanups : Boolean;
hpe_interrupt_marker : Boolean;
hpux_interrupt_marker : Boolean;
large_frame : Boolean;
alloca_frame : Boolean;
reserved2 : Boolean;
frame_size : Bits_27_Value;
end record;
for Unwind_Descriptor'Size use 64;
for Unwind_Descriptor use record
cannot_unwind at 0 range 0 .. 0;
mcode at 0 range 1 .. 1;
mcode_save_restore at 0 range 2 .. 2;
region_desc at 0 range 3 .. 4;
reserved0 at 0 range 5 .. 5;
entry_sr at 0 range 6 .. 6;
entry_fr at 0 range 7 .. 10;
entry_gr at 1 range 3 .. 7;
args_stored at 2 range 0 .. 0;
variable_frame at 2 range 1 .. 1;
separate_package_body at 2 range 2 .. 2;
frame_extension_mcode at 2 range 3 .. 3;
stack_overflow_check at 2 range 4 .. 4;
two_steps_sp_adjust at 2 range 5 .. 5;
sr4_export at 2 range 6 .. 6;
cxx_info at 2 range 7 .. 7;
cxx_try_catch at 3 range 0 .. 0;
sched_entry_seq at 3 range 1 .. 1;
reserved1 at 3 range 2 .. 2;
save_sp at 3 range 3 .. 3;
save_rp at 3 range 4 .. 4;
save_mrp at 3 range 5 .. 5;
save_r19 at 3 range 6 .. 6;
cleanups at 3 range 7 .. 7;
hpe_interrupt_marker at 4 range 0 .. 0;
hpux_interrupt_marker at 4 range 1 .. 1;
large_frame at 4 range 2 .. 2;
alloca_frame at 4 range 3 .. 3;
reserved2 at 4 range 4 .. 4;
frame_size at 4 range 5 .. 31;
end record;
subtype UWD is Unwind_Descriptor;
type UWD_Ptr is access all UWD;
function To_UWD_Access is new Ada.Unchecked_Conversion (Address, UWD_Ptr);
-- The descriptor associated with a given code location is retrieved
-- using functions imported from the HP library, requiring the definition
-- of additional structures.
type Unwind_Table_Region is record
Table_Start : Address;
Table_End : Address;
end record;
-- An Unwind Table region, which is a memory area containing Unwind
-- Descriptors.
subtype UWT is Unwind_Table_Region;
-- The subprograms imported below are provided by the HP library
function U_get_unwind_table return UWT;
pragma Import (C, U_get_unwind_table, "U_get_unwind_table");
-- Get the unwind table region associated with the current executable.
-- This function is actually documented as having an argument, but which
-- is only used for the MPE/iX targets.
function U_get_shLib_unwind_table (r19 : Address) return UWT;
pragma Import (C, U_get_shLib_unwind_table, "U_get_shLib_unw_tbl");
-- Return the unwind table region associated with a possible shared
-- library, as determined by the provided r19 value.
function U_get_shLib_text_addr (r19 : Address) return Address;
pragma Import (C, U_get_shLib_text_addr, "U_get_shLib_text_addr");
-- Return the address at which the code for a shared library begins, or
-- -1 if the value provided for r19 does not identify shared library code.
function U_get_unwind_entry
(Pc : Address;
Space : Address;
Table_Start : Address;
Table_End : Address) return Address;
pragma Import (C, U_get_unwind_entry, "U_get_unwind_entry");
-- Given the bounds of an unwind table, return the address of the
-- unwind descriptor associated with a code location/space. In the case
-- of shared library code, the offset from the beginning of the library
-- is expected as Pc.
procedure U_init_frame_record (Frame : not null access CFD);
pragma Import (C, U_init_frame_record, "U_init_frame_record");
procedure U_prep_frame_rec_for_unwind (Frame : not null access CFD);
pragma Import (C, U_prep_frame_rec_for_unwind,
"U_prep_frame_rec_for_unwind");
-- Fetch the description data of the frame in which these two procedures
-- are called.
function U_get_u_rlo
(Cur : not null access CFD; Prev : not null access PFD) return Integer;
pragma Import (C, U_get_u_rlo, "U_IS_STUB_OR_CALLX");
-- From a complete current frame with a return location possibly located
-- into a linker generated stub, and basic information about the previous
-- frame, place the first non stub return location into the current frame.
-- Return -1 if something went wrong during the computation.
function U_is_shared_pc (rlo : Address; r19 : Address) return Address;
pragma Import (C, U_is_shared_pc, "U_is_shared_pc");
-- Return 0 if the provided return location does not correspond to code
-- in a shared library, or something non null otherwise.
function U_get_previous_frame_x
(current_frame : not null access CFD;
previous_frame : not null access PFD;
previous_size : Integer) return Integer;
pragma Import (C, U_get_previous_frame_x, "U_get_previous_frame_x");
-- Fetch the data describing the "previous" frame relatively to the
-- "current" one. "previous_size" should be the size of the "previous"
-- frame descriptor provided.
--
-- The library provides a simpler interface without the size parameter
-- but it is not usable when frames with dynamically allocated space are
-- on the way.
procedure Call_Chain
(Traceback : System.Address;
Max_Len : Natural;
Len : out Natural;
Exclude_Min : System.Address := System.Null_Address;
Exclude_Max : System.Address := System.Null_Address;
Skip_Frames : Natural := 1);
-- Same as the exported version, but takes Traceback as an Address
------------------
-- C_Call_Chain --
------------------
function C_Call_Chain
(Traceback : System.Address;
Max_Len : Natural) return Natural
is
Val : Natural;
begin
Call_Chain (Traceback, Max_Len, Val);
return Val;
end C_Call_Chain;
----------------
-- Call_Chain --
----------------
procedure Call_Chain
(Traceback : System.Address;
Max_Len : Natural;
Len : out Natural;
Exclude_Min : System.Address := System.Null_Address;
Exclude_Max : System.Address := System.Null_Address;
Skip_Frames : Natural := 1)
is
type Tracebacks_Array is array (1 .. Max_Len) of System.Address;
pragma Suppress_Initialization (Tracebacks_Array);
-- The code location returned by the unwinder is a return location but
-- what we need is a call point. Under HP-UX call instructions are 4
-- bytes long and the return point they specify is 4 bytes beyond the
-- next instruction because of the delay slot.
Call_Size : constant := 4;
DSlot_Size : constant := 4;
Rlo_Offset : constant := Call_Size + DSlot_Size;
-- Moreover, the return point is passed via a register which two least
-- significant bits specify a privilege level that we will have to mask.
Priv_Mask : constant := 16#00000003#;
Frame : aliased CFD;
Code : System.Address;
J : Natural := 1;
Pop_Success : Boolean;
Trace : Tracebacks_Array;
for Trace'Address use Traceback;
-- The backtracing process needs a set of subprograms :
function UWD_For_RLO_Of (Frame : not null access CFD) return UWD_Ptr;
-- Return an access to the unwind descriptor for the caller of
-- a given frame, using only the provided return location.
function UWD_For_Caller_Of (Frame : not null access CFD) return UWD_Ptr;
-- Return an access to the unwind descriptor for the user code caller
-- of a given frame, or null if the information is not available.
function Pop_Frame (Frame : not null access CFD) return Boolean;
-- Update the provided machine state structure so that it reflects
-- the state one call frame "above" the initial one.
--
-- Return True if the operation has been successful, False otherwise.
-- Failure typically occurs when the top of the call stack has been
-- reached.
function Prepare_For_Unwind_Of
(Frame : not null access CFD) return Boolean;
-- Perform the necessary adaptations to the machine state before
-- calling the unwinder. Currently used for the specific case of
-- dynamically sized previous frames.
--
-- Return True if everything went fine, or False otherwise.
Program_UWT : constant UWT := U_get_unwind_table;
---------------
-- Pop_Frame --
---------------
function Pop_Frame (Frame : not null access CFD) return Boolean is
Up_Frame : aliased PFD;
State_Ready : Boolean;
begin
-- Check/adapt the state before calling the unwinder and return
-- if anything went wrong.
State_Ready := Prepare_For_Unwind_Of (Frame);
if not State_Ready then
return False;
end if;
-- Now, safely call the unwinder and use the results
if U_get_previous_frame_x (Frame,
Up_Frame'Access,
Up_Frame'Size) /= 0
then
return False;
end if;
-- In case a stub is on the way, the usual previous return location
-- (the one in prev_rlo) is the one in the stub and the "real" one
-- is placed in the "current" record, so let's take this one into
-- account.
Frame.out_rlo := Frame.cur_rlo;
Frame.cur_fsz := Up_Frame.prev_fsz;
Frame.cur_sp := Up_Frame.prev_sp;
Frame.cur_rls := Up_Frame.prev_rls;
Frame.cur_rlo := Up_Frame.prev_rlo;
Frame.cur_dp := Up_Frame.prev_dp;
Frame.cur_r19 := Up_Frame.prev_r19;
Frame.top_r3 := Up_Frame.top_r3;
Frame.top_r4 := Up_Frame.top_r4;
return True;
end Pop_Frame;
---------------------------
-- Prepare_For_Unwind_Of --
---------------------------
function Prepare_For_Unwind_Of
(Frame : not null access CFD) return Boolean
is
Caller_UWD : UWD_Ptr;
FP_Adjustment : Integer;
begin
-- No need to bother doing anything if the stack is already fully
-- unwound.
if Frame.cur_rlo = 0 then
return False;
end if;
-- When ALLOCA_FRAME is set in an unwind descriptor, the unwinder
-- uses the value provided in current.top_r3 or current.top_r4 as
-- a frame pointer to compute the size of the frame. What decides
-- between r3 or r4 is the unwind descriptor LARGE_FRAME bit, with
-- r4 chosen if the bit is set.
-- The size computed by the unwinder is STATIC_PART + (SP - FP),
-- which is correct with HP's frame pointer convention, but not
-- with GCC's one since we end up with the static part accounted
-- for twice.
-- We have to compute r4 when it is required because the unwinder
-- has looked for it at a place where it was not if we went through
-- GCC frames.
-- The size of the static part of a frame can be found in the
-- associated unwind descriptor.
Caller_UWD := UWD_For_Caller_Of (Frame);
-- If we cannot get it, we are unable to compute the potentially
-- necessary adjustments. We'd better not try to go on then.
if Caller_UWD = null then
return False;
end if;
-- If the caller frame is a GCC one, r3 is its frame pointer and
-- points to the bottom of the frame. The value to provide for r4
-- can then be computed directly from the one of r3, compensating
-- for the static part of the frame.
-- If the caller frame is an HP one, r3 is used to locate the
-- previous frame marker, that is it also points to the bottom of
-- the frame (this is why r3 cannot be used as the frame pointer in
-- the HP sense for large frames). The value to provide for r4 can
-- then also be computed from the one of r3 with the compensation
-- for the static part of the frame.
FP_Adjustment := Integer (Caller_UWD.frame_size * 8);
Frame.top_r4 := Address (Integer (Frame.top_r3) + FP_Adjustment);
return True;
end Prepare_For_Unwind_Of;
-----------------------
-- UWD_For_Caller_Of --
-----------------------
function UWD_For_Caller_Of (Frame : not null access CFD) return UWD_Ptr
is
UWD_Access : UWD_Ptr;
begin
-- First try the most direct path, using the return location data
-- associated with the frame.
UWD_Access := UWD_For_RLO_Of (Frame);
if UWD_Access /= null then
return UWD_Access;
end if;
-- If we did not get a result, we might face an in-stub return
-- address. In this case U_get_previous_frame can tell us what the
-- first not-in-stub return point is. We cannot call it directly,
-- though, because we haven't computed the potentially necessary
-- frame pointer adjustments, which might lead to SEGV in some
-- circumstances. Instead, we directly call the libcl routine which
-- is called by U_get_previous_frame and which only requires few
-- information. Take care, however, that the information is provided
-- in the "current" argument, so we need to work on a copy to avoid
-- disturbing our caller.
declare
U_Current : aliased CFD := Frame.all;
U_Previous : aliased PFD;
begin
U_Previous.prev_dp := U_Current.cur_dp;
U_Previous.prev_rls := U_Current.cur_rls;
U_Previous.prev_sp := U_Current.cur_sp - U_Current.cur_fsz;
if U_get_u_rlo (U_Current'Access, U_Previous'Access) /= -1 then
UWD_Access := UWD_For_RLO_Of (U_Current'Access);
end if;
end;
return UWD_Access;
end UWD_For_Caller_Of;
--------------------
-- UWD_For_RLO_Of --
--------------------
function UWD_For_RLO_Of (Frame : not null access CFD) return UWD_Ptr
is
UWD_Address : Address;
-- The addresses returned by the library point to full descriptors
-- including the frame information bits but also the applicable PC
-- range. We need to account for this.
Frame_Info_Offset : constant := 8;
begin
-- First try to locate the descriptor in the program's unwind table
UWD_Address := U_get_unwind_entry (Frame.cur_rlo,
Frame.cur_rls,
Program_UWT.Table_Start,
Program_UWT.Table_End);
-- If we did not get it, we might have a frame from code in a
-- stub or shared library. For code in stub we would have to
-- compute the first non-stub return location but this is not
-- the role of this subprogram, so let's just try to see if we
-- can get a result from the tables in shared libraries.
if UWD_Address = -1
and then U_is_shared_pc (Frame.cur_rlo, Frame.cur_r19) /= 0
then
declare
Shlib_UWT : constant UWT :=
U_get_shLib_unwind_table (Frame.cur_r19);
Shlib_Start : constant Address :=
U_get_shLib_text_addr (Frame.cur_r19);
Rlo_Offset : constant Address :=
Frame.cur_rlo - Shlib_Start;
begin
UWD_Address := U_get_unwind_entry (Rlo_Offset,
Frame.cur_rls,
Shlib_UWT.Table_Start,
Shlib_UWT.Table_End);
end;
end if;
if UWD_Address /= -1 then
return To_UWD_Access (UWD_Address + Frame_Info_Offset);
else
return null;
end if;
end UWD_For_RLO_Of;
-- Start of processing for Call_Chain
begin
-- Fetch the state for this subprogram's frame and pop it so that we
-- start with an initial out_rlo "here".
U_init_frame_record (Frame'Access);
Frame.top_sr0 := 0;
Frame.top_sr4 := 0;
U_prep_frame_rec_for_unwind (Frame'Access);
Pop_Success := Pop_Frame (Frame'Access);
-- Skip the requested number of frames
for I in 1 .. Skip_Frames loop
Pop_Success := Pop_Frame (Frame'Access);
end loop;
-- Loop popping frames and storing locations until either a problem
-- occurs, or the top of the call chain is reached, or the provided
-- array is full.
loop
-- We have to test some conditions against the return location
-- as it is returned, so get it as is first.
Code := Frame.out_rlo;
exit when not Pop_Success or else Code = 0 or else J = Max_Len + 1;
-- Compute the call point from the retrieved return location :
-- Mask the privilege bits and account for the delta between the
-- call site and the return point.
Code := (Code and not Priv_Mask) - Rlo_Offset;
if Code < Exclude_Min or else Code > Exclude_Max then
Trace (J) := Code;
J := J + 1;
end if;
Pop_Success := Pop_Frame (Frame'Access);
end loop;
Len := J - 1;
end Call_Chain;
procedure Call_Chain
(Traceback : in out System.Traceback_Entries.Tracebacks_Array;
Max_Len : Natural;
Len : out Natural;
Exclude_Min : System.Address := System.Null_Address;
Exclude_Max : System.Address := System.Null_Address;
Skip_Frames : Natural := 1)
is
begin
Call_Chain
(Traceback'Address, Max_Len, Len,
Exclude_Min, Exclude_Max,
-- Skip one extra frame to skip the other Call_Chain entry as well
Skip_Frames => Skip_Frames + 1);
end Call_Chain;
end System.Traceback;
|
skill-lang/adaCommon | Ada | 9,288 | adb | -- ___ _ ___ _ _ --
-- / __| |/ (_) | | Common SKilL implementation --
-- \__ \ ' <| | | |__ string pool management --
-- |___/_|\_\_|_|____| by: Timm Felden --
-- --
pragma Ada_2012;
with Ada.Unchecked_Conversion;
with Ada.Unchecked_Deallocation;
with Ada.Text_IO;
with Interfaces;
with Skill.Errors;
with Skill.Field_Types.Builtin.String_Type_P;
package body Skill.String_Pools is
-- note: input is now owned by the pool
function Create (Input : Skill.Streams.Reader.Input_Stream) return Pool is
use type Skill.Streams.Reader.Input_Stream;
This : Pool :=
new Pool_T'
(Input => Input,
New_Strings => A1.Empty_Set,
String_Positions => A2.Empty_Vector,
Id_Map => A3.Empty_Vector,
Mutex => <>);
Null_Position : Position;
use Interfaces;
begin
--null translation trick
This.String_Positions.Append (Null_Position);
This.Id_Map.Append (null);
return This;
exception
when E : others =>
raise Skill.Errors.Skill_Error;
end Create;
procedure Free (This : Skill.Types.String_Access) is
procedure Delete is new Ada.Unchecked_Deallocation
(String,
Skill.Types.String_Access);
D : Skill.Types.String_Access := This;
begin
if null /= D then
Delete (D);
end if;
end Free;
procedure Free (This : access Pool_T) is
type P is access all Pool_T;
procedure Delete is new Ada.Unchecked_Deallocation (Pool_T, P);
D : P := P (This);
use type Skill.Streams.Reader.Input_Stream;
begin
if null /= This.Input then
This.Input.Close;
end if;
-- not true, because some strings are global constants
-- This.Id_Map.Foreach (Free'Access);
This.Id_Map.Free;
This.String_Positions.Free;
Delete (D);
end Free;
function Size (This : access Pool_T) return Integer is
begin
return Integer (This.String_Positions.Length) +
Integer (This.New_Strings.Length);
end Size;
procedure AddPosition
(This : access Pool_T;
Pos : Types.v64;
Len : Types.i32)
is
RPos : Position;
begin
RPos.AbsoluteOffset := Pos;
RPos.Length := Len;
This.String_Positions.Append (RPos);
This.Id_Map.Append (null);
end AddPosition;
-- should be synchronized now
function Read_Result
(This : access Pool_T;
Index : Types.v64) return Types.String_Access
is
Off : Position := This.String_Positions.Element (Natural (Index));
Input : Skill.Streams.Reader.Input_Stream := This.Input;
Last : Types.v64 := Input.Position;
use type Skill.Streams.Reader.Input_Stream;
function Convert is new Ada.Unchecked_Conversion (Types.i8, Character);
Result : Skill.Types.String_Access;
begin
Input.Jump (Off.AbsoluteOffset);
-- range shifted by 1 to allow for empty ranges
Result := new String (2 .. Positive (Off.Length + 1));
for P in Result'Range loop
Result (P) := Convert (Input.I8);
end loop;
-- unify with new strings
declare
Cursor : A1.Cursor;
Inserted : Boolean;
begin
This.New_Strings.Insert (Result, Cursor, Inserted);
if not Inserted then
Free (Result);
Result := A1.Element (Cursor);
end if;
end;
Input.Jump (Last);
This.Id_Map.Replace_Element (Natural (Index), Result);
return Result;
end Read_Result;
function Get
(This : access Pool_T;
Index : Types.v64) return Skill.Types.String_Access
is
Result : Skill.Types.String_Access;
begin
if Index <= 0 then
return null;
end if;
Result := This.Id_Map.Element (Natural (Index));
if null /= Result then
return Result;
end if;
-- we have to load the string from disk
-- @note this block has to be synchronized in order to enable parallel
-- decoding of field data
-- @note this is correct, because string pool is the only one who can do
-- parallel operations on input!
This.Mutex.Lock;
Result := Read_Result (This, Index);
This.Mutex.Unlock;
return Result;
exception
when E : others =>
raise Skill.Errors.Skill_Error
with InvalidPoolIndexException
(Natural (Index),
Integer (This.String_Positions.Length),
"string",
E);
end Get;
procedure Add (This : access Pool_T; S : Types.String_Access) is
begin
if null /= S then
This.New_Strings.Include (S);
end if;
end Add;
function Add
(This : access Pool_T;
S : String) return Types.String_Access
is
Cursor : A1.Cursor;
Inserted : Boolean;
Str : Types.String_Access := new String'(S);
begin
This.New_Strings.Insert (Str, Cursor, Inserted);
if Inserted then
return Str;
else
Free (Str);
return A1.Element (Cursor);
end if;
end Add;
procedure Prepare_And_Write
(This : access Pool_T;
Output : Skill.Streams.Writer.Output_Stream;
Serialization_IDs : Skill.Field_Types.Builtin.String_Type_P.ID_Map)
is
S : Types.String_Access;
Count : Types.v64;
use type Types.v64;
use type Skill.Field_Types.Builtin.String_Type_P.ID_Map;
begin
-- ensure all strings are present
for I in 1 .. Types.v64 (This.String_Positions.Length - 1) loop
S := This.Get (I);
end loop;
-- create inverse map
for I in 1 .. Types.Skill_ID_T (This.Id_Map.Length - 1) loop
Serialization_IDs.Insert
(Key => This.Id_Map.Element (I), New_Item => I);
end loop;
-- instert new strings to the map;
-- this is the place where duplications with lazy strings will be detected
-- and eliminated
for S of This.New_Strings loop
if not Serialization_IDs.Contains (S) then
Serialization_IDs.Insert (S, This.Id_Map.Length);
This.Id_Map.Append (S);
end if;
end loop;
Count := Types.v64 (This.Id_Map.Length - 1);
Output.V64 (Count);
Output.Begin_Block_Map (4 * Count);
declare
Off : Types.i32 := 0;
-- map offsets
Offsets : Streams.Writer.Sub_Stream := Output.Map (4 * Count);
procedure Put (S : Types.String_Access) is
begin
-- first ID is mapped to null
if null = S then
return;
end if;
Off := Off + S.all'Size / 8;
Output.Put_Plain_String (S);
Offsets.I32 (Off);
end Put;
begin
This.Id_Map.Foreach (Put'Access);
Output.End_Block_Map;
end;
end Prepare_And_Write;
procedure Prepare_And_Append
(This : access Pool_T;
Output : Skill.Streams.Writer.Output_Stream;
Serialization_IDs : Skill.Field_Types.Builtin.String_Type_P.ID_Map)
is
S : Types.String_Access;
Count : Types.v64;
use type Types.v64;
use type Skill.Field_Types.Builtin.String_Type_P.ID_Map;
Todo : A3.Vector := A3.Empty_Vector;
begin
-- ensure all strings are present
for I in 1 .. Types.v64 (This.String_Positions.Length - 1) loop
S := This.Get (I);
end loop;
-- create inverse map
for I in 1 .. Types.Skill_ID_T (This.Id_Map.Length - 1) loop
Serialization_IDs.Include
(Key => This.Id_Map.Element (I), New_Item => I);
end loop;
-- instert new strings to the map;
-- this is the place where duplications with lazy strings will be detected
-- and eliminated;
-- this is also the place, where new instances are appended to the output
-- file
for S of This.New_Strings loop
if not Serialization_IDs.Contains (S) then
Serialization_IDs.Include (S, This.Id_Map.Length);
This.Id_Map.Append (S);
Todo.Append (S);
end if;
end loop;
Count := Types.v64 (Todo.Length);
Output.V64 (Count);
if 0 /= Count then
Output.Begin_Block_Map (4 * Count);
declare
Off : Types.i32 := 0;
-- map offsets
Offsets : Streams.Writer.Sub_Stream := Output.Map (4 * Count);
procedure Put (S : Types.String_Access) is
begin
-- first ID is mapped to null
if null = S then
return;
end if;
Off := Off + S.all'Size / 8;
Output.Put_Plain_String (S);
Offsets.I32 (Off);
end Put;
begin
Todo.Foreach (Put'Access);
Output.End_Block_Map;
end;
end if;
Todo.Free;
end Prepare_And_Append;
end Skill.String_Pools;
|
stcarrez/ada-asf | Ada | 3,880 | ads | -----------------------------------------------------------------------
-- applications.messages-factory -- Application Message Factory
-- Copyright (C) 2011, 2012, 2015, 2018 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 ASF.Contexts.Faces;
package ASF.Applications.Messages.Factory is
-- Get a localized message. The message identifier is composed of a resource bundle name
-- prefix and a bundle key. The prefix and key are separated by the first '.'.
-- If the message identifier does not contain any prefix, the default bundle is "messages".
function Get_Message (Context : in ASF.Contexts.Faces.Faces_Context'Class;
Message_Id : in String) return String;
-- Build a localized message.
function Get_Message (Context : in ASF.Contexts.Faces.Faces_Context'Class;
Message_Id : in String;
Severity : in Messages.Severity := ERROR) return Message;
-- Build a localized message and format the message with one argument.
function Get_Message (Context : in ASF.Contexts.Faces.Faces_Context'Class;
Message_Id : in String;
Param1 : in String;
Severity : in Messages.Severity := ERROR) return Message;
-- Build a localized message and format the message with two argument.
function Get_Message (Context : in ASF.Contexts.Faces.Faces_Context'Class;
Message_Id : in String;
Param1 : in String;
Param2 : in String;
Severity : in Messages.Severity := ERROR) return Message;
-- Build a localized message and format the message with some arguments.
function Get_Message (Context : in ASF.Contexts.Faces.Faces_Context'Class;
Message_Id : in String;
Args : in ASF.Utils.Object_Array;
Severity : in Messages.Severity := ERROR) return Message;
-- Add a localized global message in the current faces context.
procedure Add_Message (Message_Id : in String;
Severity : in Messages.Severity := ERROR);
-- Add a localized field message in the current faces context. The message is associated
-- with the component identified by <tt>Client_Id</tt>.
procedure Add_Field_Message (Client_Id : in String;
Message_Id : in String;
Severity : in Messages.Severity := ERROR);
-- Add a localized global message in the faces context.
procedure Add_Message (Context : in out ASF.Contexts.Faces.Faces_Context'Class;
Message_Id : in String;
Param1 : in String;
Severity : in Messages.Severity := ERROR);
-- Add a localized global message in the faces context.
procedure Add_Message (Context : in out ASF.Contexts.Faces.Faces_Context'Class;
Message_Id : in String;
Severity : in Messages.Severity := ERROR);
end ASF.Applications.Messages.Factory;
|
rguilloteau/pok | Ada | 529 | ads | -- POK header
--
-- The following file is a part of the POK project. Any modification should
-- be made according to the POK licence. You CANNOT use this file or a part
-- of a file for your own project.
--
-- For more information on the POK licence, please see our LICENCE FILE
--
-- Please follow the coding guidelines described in doc/CODING_GUIDELINES
--
-- Copyright (c) 2007-2020 POK team
package Subprograms is
procedure Hello_Part1;
end Subprograms;
|
reznikmm/matreshka | Ada | 3,995 | 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.Chart_Vertical_Attributes;
package Matreshka.ODF_Chart.Vertical_Attributes is
type Chart_Vertical_Attribute_Node is
new Matreshka.ODF_Chart.Abstract_Chart_Attribute_Node
and ODF.DOM.Chart_Vertical_Attributes.ODF_Chart_Vertical_Attribute
with null record;
overriding function Create
(Parameters : not null access Matreshka.DOM_Attributes.Attribute_L2_Parameters)
return Chart_Vertical_Attribute_Node;
overriding function Get_Local_Name
(Self : not null access constant Chart_Vertical_Attribute_Node)
return League.Strings.Universal_String;
end Matreshka.ODF_Chart.Vertical_Attributes;
|
reznikmm/matreshka | Ada | 4,801 | 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.Db_Database_Description_Elements;
package Matreshka.ODF_Db.Database_Description_Elements is
type Db_Database_Description_Element_Node is
new Matreshka.ODF_Db.Abstract_Db_Element_Node
and ODF.DOM.Db_Database_Description_Elements.ODF_Db_Database_Description
with null record;
overriding function Create
(Parameters : not null access Matreshka.DOM_Elements.Element_L2_Parameters)
return Db_Database_Description_Element_Node;
overriding function Get_Local_Name
(Self : not null access constant Db_Database_Description_Element_Node)
return League.Strings.Universal_String;
overriding procedure Enter_Node
(Self : not null access Db_Database_Description_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 Db_Database_Description_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 Db_Database_Description_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_Db.Database_Description_Elements;
|
rogermc2/OpenGLAda | Ada | 24,819 | ads | -- part of OpenGLAda, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "COPYING"
with Interfaces.C.Strings;
with Interfaces.C.Pointers;
with System;
with Glfw.Input.Keys;
with Glfw.Input.Mouse;
with Glfw.Input.Joysticks;
with Glfw.Monitors;
with Glfw.Errors;
with Glfw.Enums;
with Glfw.Windows.Context;
private package Glfw.API is
-----------------------------------------------------------------------------
-- Types
-----------------------------------------------------------------------------
type Address_List is array (Positive range <>) of aliased System.Address;
pragma Convention (C, Address_List);
package Address_List_Pointers is new Interfaces.C.Pointers
(Positive, System.Address, Address_List, System.Null_Address);
package VMode_List_Pointers is new Interfaces.C.Pointers
(Positive, Monitors.Video_Mode, Monitors.Video_Mode_List, (others => 0));
package Axis_Position_List_Pointers is new Interfaces.C.Pointers
(Positive, Input.Joysticks.Axis_Position, Input.Joysticks.Axis_Positions,
0.0);
package Joystick_Button_State_List_Pointers is new Interfaces.C.Pointers
(Positive, Input.Joysticks.Joystick_Button_State,
Input.Joysticks.Joystick_Button_States, Input.Joysticks.Released);
type Unsigned_Short_List is array (Positive range <>) of aliased
Interfaces.C.unsigned_short;
package Unsigned_Short_List_Pointers is new Interfaces.C.Pointers
(Positive, Interfaces.C.unsigned_short, Unsigned_Short_List, 0);
type Raw_Gamma_Ramp is record
Red, Green, Blue : Unsigned_Short_List_Pointers.Pointer;
Size : Interfaces.C.unsigned;
end record;
pragma Convention (C, Raw_Gamma_Ramp);
-----------------------------------------------------------------------------
-- Callbacks
-----------------------------------------------------------------------------
type Error_Callback is access procedure (Code : Errors.Kind;
Description : C.Strings.chars_ptr);
type Window_Position_Callback is access procedure
(Window : System.Address; X, Y : C.int);
type Window_Size_Callback is access procedure
(Window : System.Address; Width, Height : C.int);
type Window_Close_Callback is access procedure
(Window : System.Address);
type Window_Refresh_Callback is access procedure
(Window : System.Address);
type Window_Focus_Callback is access procedure
(Window : System.Address; Focussed : Bool);
type Window_Iconify_Callback is access procedure
(Window : System.Address; Iconified : Bool);
type Framebuffer_Size_Callback is access procedure
(Window : System.Address; Width, Height : C.int);
type Mouse_Button_Callback is access procedure (Window : System.Address;
Button : Input.Mouse.Button;
State : Input.Button_State;
Mods : Input.Keys.Modifiers);
type Cursor_Position_Callback is access procedure
(Window : System.Address; X, Y : Input.Mouse.Coordinate);
type Cursor_Enter_Callback is access procedure
(Window : System.Address; Action : Input.Mouse.Enter_Action);
type Scroll_Callback is access procedure
(Window : System.Address; X, Y : Input.Mouse.Scroll_Offset);
type Key_Callback is access procedure (Window : System.Address;
Key : Input.Keys.Key;
Scancode : Input.Keys.Scancode;
Action : Input.Keys.Action;
Mods : Input.Keys.Modifiers);
type Character_Callback is access procedure
(Window : System.Address; Unicode_Char : Interfaces.C.unsigned);
type Monitor_Callback is access procedure
(Monitor : System.Address; Event : Monitors.Event);
pragma Convention (C, Error_Callback);
pragma Convention (C, Window_Position_Callback);
pragma Convention (C, Window_Size_Callback);
pragma Convention (C, Window_Close_Callback);
pragma Convention (C, Window_Refresh_Callback);
pragma Convention (C, Window_Focus_Callback);
pragma Convention (C, Window_Iconify_Callback);
pragma Convention (C, Framebuffer_Size_Callback);
pragma Convention (C, Mouse_Button_Callback);
pragma Convention (C, Cursor_Position_Callback);
pragma Convention (C, Cursor_Enter_Callback);
pragma Convention (C, Scroll_Callback);
pragma Convention (C, Key_Callback);
pragma Convention (C, Character_Callback);
pragma Convention (C, Monitor_Callback);
-----------------------------------------------------------------------------
-- Basics
-----------------------------------------------------------------------------
function Init return C.int;
pragma Import (Convention => C, Entity => Init,
External_Name => "glfwInit");
procedure Glfw_Terminate;
pragma Import (Convention => C, Entity => Glfw_Terminate,
External_Name => "glfwTerminate");
procedure Get_Version (Major, Minor, Revision : out C.int);
pragma Import (Convention => C, Entity => Get_Version,
External_Name => "glfwGetVersion");
function Get_Version_String return C.Strings.chars_ptr;
pragma Import (Convention => C, Entity => Get_Version_String,
External_Name => "glfwGetVersionString");
function Get_Time return C.double;
pragma Import (Convention => C, Entity => Get_Time,
External_Name => "glfwGetTime");
procedure Set_Time (Value : C.double);
pragma Import (Convention => C, Entity => Set_Time,
External_Name => "glfwSetTime");
procedure Sleep (Time : C.double);
pragma Import (Convention => C, Entity => Sleep,
External_Name => "glfwSleep");
function Extension_Supported (Name : C.char_array) return Bool;
pragma Import (Convention => C, Entity => Extension_Supported,
External_Name => "glfwExtensionSupported");
function Set_Error_Callback (CB_Fun : Error_Callback) return Error_Callback;
pragma Import (Convention => C, Entity => Set_Error_Callback,
External_Name => "glfwSetErrorCallback");
-----------------------------------------------------------------------------
-- Monitors
-----------------------------------------------------------------------------
function Get_Monitors (Count : access Interfaces.C.int)
return Address_List_Pointers.Pointer;
pragma Import (Convention => C, Entity => Get_Monitors,
External_Name => "glfwGetMonitors");
function Get_Primary_Monitor return System.Address;
pragma Import (Convention => C, Entity => Get_Primary_Monitor,
External_Name => "glfwGetPrimaryMonitor");
procedure Get_Monitor_Pos (Monitor : System.Address;
XPos, YPos : out Interfaces.C.int);
pragma Import (Convention => C, Entity => Get_Monitor_Pos,
External_Name => "glfwGetMonitorPos");
procedure Get_Monitor_Physical_Size (Monitor : System.Address;
Width, Height : out Interfaces.C.int);
pragma Import (Convention => C, Entity => Get_Monitor_Physical_Size,
External_Name => "glfwGetMonitorPhysicalSize");
function Get_Monitor_Name (Monitor : System.Address)
return Interfaces.C.Strings.chars_ptr;
pragma Import (Convention => C, Entity => Get_Monitor_Name,
External_Name => "glfwGetMonitorName");
function Set_Monitor_Callback (Monitor : System.Address;
CB_Fun : Monitor_Callback)
return Monitor_Callback;
pragma Import (Convention => C, Entity => Set_Monitor_Callback,
External_Name => "glfwSetMonitorCallback");
function Get_Video_Modes (Monitor : System.Address;
Count : access Interfaces.C.int)
return VMode_List_Pointers.Pointer;
pragma Import (Convention => C, Entity => Get_Video_Modes,
External_Name => "glfwGetVideoModes");
function Get_Video_Mode (Monitor : System.Address)
return access constant Monitors.Video_Mode;
pragma Import (Convention => C, Entity => Get_Video_Mode,
External_Name => "glfwGetVideoMode");
procedure Set_Gamma (Monitor : System.Address; Gamma : Interfaces.C.C_float);
pragma Import (Convention => C, Entity => Set_Gamma,
External_Name => "glfwSetGamma");
function Get_Gamma_Ramp (Monitor : System.Address)
return access constant Raw_Gamma_Ramp;
pragma Import (Convention => C, Entity => Get_Gamma_Ramp,
External_Name => "glfwGetGammaRamp");
procedure Set_Gamma_Ramp (Monitor : System.Address;
Value : access constant Raw_Gamma_Ramp);
pragma Import (Convention => C, Entity => Set_Gamma_Ramp,
External_Name => "glfwSetGammaRamp");
-----------------------------------------------------------------------------
-- Windows
-----------------------------------------------------------------------------
procedure Default_Window_Hints;
pragma Import (Convention => C, Entity => Default_Window_Hints,
External_Name => "glfwDefaultWindowHints");
procedure Window_Hint (Target : Glfw.Enums.Window_Info; Info : C.int);
procedure Window_Hint (Target : Glfw.Enums.Window_Info; Info : Bool);
procedure Window_Hint (Target : Glfw.Enums.Window_Info;
Info : Windows.Context.OpenGL_Profile_Kind);
procedure Window_Hint (Target : Glfw.Enums.Window_Info;
Info : Windows.Context.API_Kind);
procedure Window_Hint (Target : Glfw.Enums.Window_Info;
Info : Glfw.Windows.Context.Robustness_Kind);
pragma Import (Convention => C, Entity => Window_Hint,
External_Name => "glfwWindowHint");
function Create_Window (Width, Height : Interfaces.C.int;
Title : Interfaces.C.char_array;
Monitor : System.Address;
Share : System.Address)
return System.Address;
pragma Import (Convention => C, Entity => Create_Window,
External_Name => "glfwCreateWindow");
procedure Destroy_Window (Window : System.Address);
pragma Import (Convention => C, Entity => Destroy_Window,
External_Name => "glfwDestroyWindow");
function Window_Should_Close (Window : System.Address)
return Bool;
pragma Import (Convention => C, Entity => Window_Should_Close,
External_Name => "glfwWindowShouldClose");
procedure Set_Window_Should_Close (Window : System.Address;
Value : Bool);
pragma Import (Convention => C, Entity => Set_Window_Should_Close,
External_Name => "glfwSetWindowShouldClose");
procedure Set_Window_Title (Window : System.Address;
Title : Interfaces.C.char_array);
pragma Import (Convention => C, Entity => Set_Window_Title,
External_Name => "glfwSetWindowTitle");
procedure Get_Window_Pos (Window : System.Address;
Xpos, Ypos : out Windows.Coordinate);
pragma Import (Convention => C, Entity => Get_Window_Pos,
External_Name => "glfwGetWindowPos");
procedure Set_Window_Pos (Window : System.Address;
Xpos, Ypos : Windows.Coordinate);
pragma Import (Convention => C, Entity => Set_Window_Pos,
External_Name => "glfwSetWindowPos");
procedure Get_Window_Size (Window : System.Address;
Width, Height : out Size);
pragma Import (Convention => C, Entity => Get_Window_Size,
External_Name => "glfwGetWindowSize");
procedure Set_Window_Size (Window : System.Address;
Width, Height : Size);
pragma Import (Convention => C, Entity => Set_Window_Size,
External_Name => "glfwSetWindowSize");
procedure Get_Framebuffer_Size (Window : System.Address;
Width, Height : out Size);
pragma Import (Convention => C, Entity => Get_Framebuffer_Size,
External_Name => "glfwGetFramebufferSize");
procedure Iconify_Window (Window : System.Address);
pragma Import (Convention => C, Entity => Iconify_Window,
External_Name => "glfwIconifyWindow");
procedure Restore_Window (Window : System.Address);
pragma Import (Convention => C, Entity => Restore_Window,
External_Name => "glfwRestoreWindow");
procedure Show_Window (Window : System.Address);
pragma Import (Convention => C, Entity => Show_Window,
External_Name => "glfwShowWindow");
procedure Hide_Window (Window : System.Address);
pragma Import (Convention => C, Entity => Hide_Window,
External_Name => "glfwHideWindow");
function Get_Window_Monitor (Window : System.Address) return System.Address;
pragma Import (Convention => C, Entity => Get_Window_Monitor,
External_Name => "glfwGetWindowMonitor");
function Get_Window_Attrib (Window : System.Address;
Attrib : Enums.Window_Info) return C.int;
function Get_Window_Attrib (Window : System.Address;
Attrib : Enums.Window_Info) return Bool;
function Get_Window_Attrib (Window : System.Address;
Attrib : Enums.Window_Info)
return Windows.Context.API_Kind;
function Get_Window_Attrib (Window : System.Address;
Attrib : Enums.Window_Info)
return Windows.Context.OpenGL_Profile_Kind;
function Get_Window_Attrib (Window : System.Address;
Attrib : Enums.Window_Info)
return Windows.Context.Robustness_Kind;
pragma Import (Convention => C, Entity => Get_Window_Attrib,
External_Name => "glfwGetWindowAttrib");
procedure Set_Window_User_Pointer (Window : System.Address;
Pointer : System.Address);
pragma Import (Convention => C, Entity => Set_Window_User_Pointer,
External_Name => "glfwSetWindowUserPointer");
function Get_Window_User_Pointer (Window : System.Address)
return System.Address;
pragma Import (Convention => C, Entity => Get_Window_User_Pointer,
External_Name => "glfwGetWindowUserPointer");
-- The callback setters in the C header are defined as returning the
-- previous callback pointer. This is rather low-level and not applicable
-- in the object-oriented interface of this binding. So we define the setters
-- as procedures, the return value will just get thrown away.
procedure Set_Window_Pos_Callback (Window : System.Address;
CB_Fun : Window_Position_Callback);
--return Window_Position_Callback;
pragma Import (Convention => C, Entity => Set_Window_Pos_Callback,
External_Name => "glfwSetWindowPosCallback");
procedure Set_Window_Size_Callback (Window : System.Address;
CB_Fun : Window_Size_Callback);
--return Window_Size_Callback;
pragma Import (Convention => C, Entity => Set_Window_Size_Callback,
External_Name => "glfwSetWindowSizeCallback");
procedure Set_Window_Close_Callback (Window : System.Address;
CB_Fun : Window_Close_Callback);
--return Window_Close_Callback;
pragma Import (Convention => C, Entity => Set_Window_Close_Callback,
External_Name => "glfwSetWindowCloseCallback");
procedure Set_Window_Refresh_Callback (Window : System.Address;
CB_Fun : Window_Refresh_Callback);
--return Window_Refresh_Callback;
pragma Import (Convention => C, Entity => Set_Window_Refresh_Callback,
External_Name => "glfwSetWindowRefreshCallback");
procedure Set_Window_Focus_Callback (Window : System.Address;
CB_Fun : Window_Focus_Callback);
--return Window_Focus_Callback;
pragma Import (Convention => C, Entity => Set_Window_Focus_Callback,
External_Name => "glfwSetWindowFocusCallback");
procedure Set_Window_Iconify_Callback (Window : System.Address;
CB_Fun : Window_Iconify_Callback);
--return Window_Iconify_Callback;
pragma Import (Convention => C, Entity => Set_Window_Iconify_Callback,
External_Name => "glfwSetWindowIconifyCallback");
procedure Set_Framebuffer_Size_Callback (Window : System.Address;
CB_Fun : Framebuffer_Size_Callback);
--return Framebuffer_Size_Callback;
pragma Import (Convention => C, Entity => Set_Framebuffer_Size_Callback,
External_Name => "glfwSetFramebufferSizeCallback");
-----------------------------------------------------------------------------
-- Input
-----------------------------------------------------------------------------
function Get_Input_Mode (Window : System.Address;
Mode : Enums.Input_Toggle) return Bool;
function Get_Input_Mode (Window : System.Address;
Mode : Enums.Input_Toggle)
return Input.Mouse.Cursor_Mode;
pragma Import (Convention => C, Entity => Get_Input_Mode,
External_Name => "glfwGetInputMode");
procedure Set_Input_Mode (Window : System.Address;
Mode : Input.Sticky_Toggle;
Value : Bool);
procedure Set_Input_Mode (Window : System.Address;
Mode : Enums.Input_Toggle;
Value : Input.Mouse.Cursor_Mode);
pragma Import (Convention => C, Entity => Set_Input_Mode,
External_Name => "glfwSetInputMode");
function Get_Key (Window : System.Address; Key : Input.Keys.Key)
return Input.Button_State;
pragma Import (Convention => C, Entity => Get_Key,
External_Name => "glfwGetKey");
function Get_Mouse_Button (Window : System.Address;
Button : Input.Mouse.Button)
return Input.Button_State;
pragma Import (Convention => C, Entity => Get_Mouse_Button,
External_Name => "glfwGetMouseButton");
procedure Get_Cursor_Pos (Window : System.Address;
Xpos, Ypos : out Input.Mouse.Coordinate);
pragma Import (Convention => C, Entity => Get_Cursor_Pos,
External_Name => "glfwGetCursorPos");
procedure Set_Cursor_Pos (Window : System.Address;
Xpos, Ypos : Input.Mouse.Coordinate);
pragma Import (Convention => C, Entity => Set_Cursor_Pos,
External_Name => "glfwSetCursorPos");
procedure Set_Key_Callback (Window : System.Address;
CB_Fun : Key_Callback);
--return Key_Callback
pragma Import (Convention => C, Entity => Set_Key_Callback,
External_Name => "glfwSetKeyCallback");
procedure Set_Char_Callback (Window : System.Address;
CB_Fun : Character_Callback);
--return Character_Callback;
pragma Import (Convention => C, Entity => Set_Char_Callback,
External_Name => "glfwSetCharCallback");
procedure Set_Mouse_Button_Callback (Window : System.Address;
CB_Fun : Mouse_Button_Callback);
--return Mouse_Button_Callback;
pragma Import (Convention => C, Entity => Set_Mouse_Button_Callback,
External_Name => "glfwSetMouseButtonCallback");
procedure Set_Cursor_Pos_Callback (Window : System.Address;
CB_Fun : Cursor_Position_Callback);
--return Cursor_Position_Callback;
pragma Import (Convention => C, Entity => Set_Cursor_Pos_Callback,
External_Name => "glfwSetCursorPosCallback");
procedure Set_Cursor_Enter_Callback (Window : System.Address;
CB_Fun : Cursor_Enter_Callback);
--return Cursor_Enter_Callback;
pragma Import (Convention => C, Entity => Set_Cursor_Enter_Callback,
External_Name => "glfwSetCursorEnterCallback");
procedure Set_Scroll_Callback (Window : System.Address;
CB_Fun : Scroll_Callback);
--return Scroll_Callback;
pragma Import (Convention => C, Entity => Set_Scroll_Callback,
External_Name => "glfwSetScrollCallback");
function Joystick_Present (Joy : Enums.Joystick_ID) return Bool;
pragma Import (Convention => C, Entity => Joystick_Present,
External_Name => "glfwJoystickPresent");
function Get_Joystick_Axes (Joy : Enums.Joystick_ID;
Count : access Interfaces.C.int)
return Axis_Position_List_Pointers.Pointer;
pragma Import (Convention => C, Entity => Get_Joystick_Axes,
External_Name => "glfwGetJoystickAxes");
function Get_Joystick_Buttons (Joy : Enums.Joystick_ID;
Count : access Interfaces.C.int)
return Joystick_Button_State_List_Pointers.Pointer;
pragma Import (Convention => C, Entity => Get_Joystick_Buttons,
External_Name => "glfwGetJoystickButtons");
function Get_Joystick_Name (Joy : Enums.Joystick_ID)
return Interfaces.C.Strings.chars_ptr;
pragma Import (Convention => C, Entity => Get_Joystick_Name,
External_Name => "glfwGetJoystickName");
procedure Poll_Events;
pragma Import (Convention => C, Entity => Poll_Events,
External_Name => "glfwPollEvents");
procedure Wait_Events;
pragma Import (Convention => C, Entity => Wait_Events,
External_Name => "glfwWaitEvents");
-----------------------------------------------------------------------------
-- Context
-----------------------------------------------------------------------------
procedure Make_Context_Current (Window : System.Address);
pragma Import (Convention => C, Entity => Make_Context_Current,
External_Name => "glfwMakeContextCurrent");
function Get_Current_Context return System.Address;
pragma Import (Convention => C, Entity => Get_Current_Context,
External_Name => "glfwGetCurrentContext");
procedure Swap_Buffers (Window : System.Address);
pragma Import (Convention => C, Entity => Swap_Buffers,
External_Name => "glfwSwapBuffers");
procedure Swap_Interval (Value : Windows.Context.Swap_Interval);
pragma Import (Convention => C, Entity => Swap_Interval,
External_Name => "glfwSwapInterval");
-----------------------------------------------------------------------------
-- Clipboard
-----------------------------------------------------------------------------
function Get_Clipboard_String (Window : System.Address)
return Interfaces.C.Strings.chars_ptr;
pragma Import (Convention => C, Entity => Get_Clipboard_String,
External_Name => "glfwGetClipboardString");
procedure Set_Clipboard_String (Window : System.Address;
Value : Interfaces.C.char_array);
pragma Import (Convention => C, Entity => Set_Clipboard_String,
External_Name => "glfwSetClipboardString");
end Glfw.API;
|
sebsgit/textproc | Ada | 40,730 | ads | pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
with System;
with Interfaces.C.Strings;
package cl_h is
CL_SUCCESS : constant := 0; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:137
CL_DEVICE_NOT_FOUND : constant := -1; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:138
CL_DEVICE_NOT_AVAILABLE : constant := -2; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:139
CL_COMPILER_NOT_AVAILABLE : constant := -3; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:140
CL_MEM_OBJECT_ALLOCATION_FAILURE : constant := -4; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:141
CL_OUT_OF_RESOURCES : constant := -5; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:142
CL_OUT_OF_HOST_MEMORY : constant := -6; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:143
CL_PROFILING_INFO_NOT_AVAILABLE : constant := -7; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:144
CL_MEM_COPY_OVERLAP : constant := -8; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:145
CL_IMAGE_FORMAT_MISMATCH : constant := -9; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:146
CL_IMAGE_FORMAT_NOT_SUPPORTED : constant := -10; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:147
CL_BUILD_PROGRAM_FAILURE : constant := -11; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:148
CL_MAP_FAILURE : constant := -12; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:149
CL_MISALIGNED_SUB_BUFFER_OFFSET : constant := -13; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:150
CL_EXEC_STATUS_ERROR_FOR_EVENTS_IN_WAIT_LIST : constant := -14; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:151
CL_COMPILE_PROGRAM_FAILURE : constant := -15; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:152
CL_LINKER_NOT_AVAILABLE : constant := -16; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:153
CL_LINK_PROGRAM_FAILURE : constant := -17; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:154
CL_DEVICE_PARTITION_FAILED : constant := -18; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:155
CL_KERNEL_ARG_INFO_NOT_AVAILABLE : constant := -19; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:156
CL_INVALID_VALUE : constant := -30; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:158
CL_INVALID_DEVICE_TYPE : constant := -31; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:159
CL_INVALID_PLATFORM : constant := -32; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:160
CL_INVALID_DEVICE : constant := -33; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:161
CL_INVALID_CONTEXT : constant := -34; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:162
CL_INVALID_QUEUE_PROPERTIES : constant := -35; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:163
CL_INVALID_COMMAND_QUEUE : constant := -36; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:164
CL_INVALID_HOST_PTR : constant := -37; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:165
CL_INVALID_MEM_OBJECT : constant := -38; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:166
CL_INVALID_IMAGE_FORMAT_DESCRIPTOR : constant := -39; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:167
CL_INVALID_IMAGE_SIZE : constant := -40; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:168
CL_INVALID_SAMPLER : constant := -41; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:169
CL_INVALID_BINARY : constant := -42; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:170
CL_INVALID_BUILD_OPTIONS : constant := -43; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:171
CL_INVALID_PROGRAM : constant := -44; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:172
CL_INVALID_PROGRAM_EXECUTABLE : constant := -45; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:173
CL_INVALID_KERNEL_NAME : constant := -46; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:174
CL_INVALID_KERNEL_DEFINITION : constant := -47; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:175
CL_INVALID_KERNEL : constant := -48; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:176
CL_INVALID_ARG_INDEX : constant := -49; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:177
CL_INVALID_ARG_VALUE : constant := -50; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:178
CL_INVALID_ARG_SIZE : constant := -51; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:179
CL_INVALID_KERNEL_ARGS : constant := -52; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:180
CL_INVALID_WORK_DIMENSION : constant := -53; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:181
CL_INVALID_WORK_GROUP_SIZE : constant := -54; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:182
CL_INVALID_WORK_ITEM_SIZE : constant := -55; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:183
CL_INVALID_GLOBAL_OFFSET : constant := -56; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:184
CL_INVALID_EVENT_WAIT_LIST : constant := -57; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:185
CL_INVALID_EVENT : constant := -58; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:186
CL_INVALID_OPERATION : constant := -59; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:187
CL_INVALID_GL_OBJECT : constant := -60; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:188
CL_INVALID_BUFFER_SIZE : constant := -61; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:189
CL_INVALID_MIP_LEVEL : constant := -62; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:190
CL_INVALID_GLOBAL_WORK_SIZE : constant := -63; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:191
CL_INVALID_PROPERTY : constant := -64; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:192
CL_INVALID_IMAGE_DESCRIPTOR : constant := -65; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:193
CL_INVALID_COMPILER_OPTIONS : constant := -66; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:194
CL_INVALID_LINKER_OPTIONS : constant := -67; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:195
CL_INVALID_DEVICE_PARTITION_COUNT : constant := -68; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:196
CL_INVALID_PIPE_SIZE : constant := -69; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:197
CL_INVALID_DEVICE_QUEUE : constant := -70; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:198
CL_VERSION_1_0 : constant := 1; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:201
CL_VERSION_1_1 : constant := 1; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:202
CL_VERSION_1_2 : constant := 1; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:203
CL_VERSION_2_0 : constant := 1; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:204
CL_VERSION_2_1 : constant := 1; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:205
CL_FALSE : constant := 0; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:208
CL_TRUE : constant := 1; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:209
-- unsupported macro: CL_BLOCKING CL_TRUE
-- unsupported macro: CL_NON_BLOCKING CL_FALSE
CL_PLATFORM_PROFILE : constant := 16#0900#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:214
CL_PLATFORM_VERSION : constant := 16#0901#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:215
CL_PLATFORM_NAME : constant := 16#0902#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:216
CL_PLATFORM_VENDOR : constant := 16#0903#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:217
CL_PLATFORM_EXTENSIONS : constant := 16#0904#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:218
CL_PLATFORM_HOST_TIMER_RESOLUTION : constant := 16#0905#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:219
CL_DEVICE_TYPE_DEFAULT : constant := (2 ** 0); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:222
CL_DEVICE_TYPE_CPU : constant := (2 ** 1); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:223
CL_DEVICE_TYPE_GPU : constant := (2 ** 2); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:224
CL_DEVICE_TYPE_ACCELERATOR : constant := (2 ** 3); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:225
CL_DEVICE_TYPE_CUSTOM : constant := (2 ** 4); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:226
CL_DEVICE_TYPE_ALL : constant := 16#FFFFFFFF#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:227
CL_DEVICE_TYPE : constant := 16#1000#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:230
CL_DEVICE_VENDOR_ID : constant := 16#1001#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:231
CL_DEVICE_MAX_COMPUTE_UNITS : constant := 16#1002#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:232
CL_DEVICE_MAX_WORK_ITEM_DIMENSIONS : constant := 16#1003#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:233
CL_DEVICE_MAX_WORK_GROUP_SIZE : constant := 16#1004#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:234
CL_DEVICE_MAX_WORK_ITEM_SIZES : constant := 16#1005#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:235
CL_DEVICE_PREFERRED_VECTOR_WIDTH_CHAR : constant := 16#1006#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:236
CL_DEVICE_PREFERRED_VECTOR_WIDTH_SHORT : constant := 16#1007#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:237
CL_DEVICE_PREFERRED_VECTOR_WIDTH_INT : constant := 16#1008#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:238
CL_DEVICE_PREFERRED_VECTOR_WIDTH_LONG : constant := 16#1009#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:239
CL_DEVICE_PREFERRED_VECTOR_WIDTH_FLOAT : constant := 16#100A#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:240
CL_DEVICE_PREFERRED_VECTOR_WIDTH_DOUBLE : constant := 16#100B#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:241
CL_DEVICE_MAX_CLOCK_FREQUENCY : constant := 16#100C#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:242
CL_DEVICE_ADDRESS_BITS : constant := 16#100D#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:243
CL_DEVICE_MAX_READ_IMAGE_ARGS : constant := 16#100E#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:244
CL_DEVICE_MAX_WRITE_IMAGE_ARGS : constant := 16#100F#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:245
CL_DEVICE_MAX_MEM_ALLOC_SIZE : constant := 16#1010#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:246
CL_DEVICE_IMAGE2D_MAX_WIDTH : constant := 16#1011#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:247
CL_DEVICE_IMAGE2D_MAX_HEIGHT : constant := 16#1012#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:248
CL_DEVICE_IMAGE3D_MAX_WIDTH : constant := 16#1013#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:249
CL_DEVICE_IMAGE3D_MAX_HEIGHT : constant := 16#1014#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:250
CL_DEVICE_IMAGE3D_MAX_DEPTH : constant := 16#1015#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:251
CL_DEVICE_IMAGE_SUPPORT : constant := 16#1016#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:252
CL_DEVICE_MAX_PARAMETER_SIZE : constant := 16#1017#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:253
CL_DEVICE_MAX_SAMPLERS : constant := 16#1018#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:254
CL_DEVICE_MEM_BASE_ADDR_ALIGN : constant := 16#1019#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:255
CL_DEVICE_MIN_DATA_TYPE_ALIGN_SIZE : constant := 16#101A#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:256
CL_DEVICE_SINGLE_FP_CONFIG : constant := 16#101B#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:257
CL_DEVICE_GLOBAL_MEM_CACHE_TYPE : constant := 16#101C#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:258
CL_DEVICE_GLOBAL_MEM_CACHELINE_SIZE : constant := 16#101D#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:259
CL_DEVICE_GLOBAL_MEM_CACHE_SIZE : constant := 16#101E#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:260
CL_DEVICE_GLOBAL_MEM_SIZE : constant := 16#101F#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:261
CL_DEVICE_MAX_CONSTANT_BUFFER_SIZE : constant := 16#1020#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:262
CL_DEVICE_MAX_CONSTANT_ARGS : constant := 16#1021#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:263
CL_DEVICE_LOCAL_MEM_TYPE : constant := 16#1022#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:264
CL_DEVICE_LOCAL_MEM_SIZE : constant := 16#1023#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:265
CL_DEVICE_ERROR_CORRECTION_SUPPORT : constant := 16#1024#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:266
CL_DEVICE_PROFILING_TIMER_RESOLUTION : constant := 16#1025#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:267
CL_DEVICE_ENDIAN_LITTLE : constant := 16#1026#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:268
CL_DEVICE_AVAILABLE : constant := 16#1027#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:269
CL_DEVICE_COMPILER_AVAILABLE : constant := 16#1028#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:270
CL_DEVICE_EXECUTION_CAPABILITIES : constant := 16#1029#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:271
CL_DEVICE_QUEUE_PROPERTIES : constant := 16#102A#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:272
CL_DEVICE_QUEUE_ON_HOST_PROPERTIES : constant := 16#102A#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:273
CL_DEVICE_NAME : constant := 16#102B#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:274
CL_DEVICE_VENDOR : constant := 16#102C#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:275
CL_DRIVER_VERSION : constant := 16#102D#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:276
CL_DEVICE_PROFILE : constant := 16#102E#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:277
CL_DEVICE_VERSION : constant := 16#102F#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:278
CL_DEVICE_EXTENSIONS : constant := 16#1030#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:279
CL_DEVICE_PLATFORM : constant := 16#1031#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:280
CL_DEVICE_DOUBLE_FP_CONFIG : constant := 16#1032#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:281
CL_DEVICE_PREFERRED_VECTOR_WIDTH_HALF : constant := 16#1034#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:283
CL_DEVICE_HOST_UNIFIED_MEMORY : constant := 16#1035#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:284
CL_DEVICE_NATIVE_VECTOR_WIDTH_CHAR : constant := 16#1036#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:285
CL_DEVICE_NATIVE_VECTOR_WIDTH_SHORT : constant := 16#1037#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:286
CL_DEVICE_NATIVE_VECTOR_WIDTH_INT : constant := 16#1038#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:287
CL_DEVICE_NATIVE_VECTOR_WIDTH_LONG : constant := 16#1039#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:288
CL_DEVICE_NATIVE_VECTOR_WIDTH_FLOAT : constant := 16#103A#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:289
CL_DEVICE_NATIVE_VECTOR_WIDTH_DOUBLE : constant := 16#103B#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:290
CL_DEVICE_NATIVE_VECTOR_WIDTH_HALF : constant := 16#103C#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:291
CL_DEVICE_OPENCL_C_VERSION : constant := 16#103D#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:292
CL_DEVICE_LINKER_AVAILABLE : constant := 16#103E#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:293
CL_DEVICE_BUILT_IN_KERNELS : constant := 16#103F#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:294
CL_DEVICE_IMAGE_MAX_BUFFER_SIZE : constant := 16#1040#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:295
CL_DEVICE_IMAGE_MAX_ARRAY_SIZE : constant := 16#1041#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:296
CL_DEVICE_PARENT_DEVICE : constant := 16#1042#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:297
CL_DEVICE_PARTITION_MAX_SUB_DEVICES : constant := 16#1043#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:298
CL_DEVICE_PARTITION_PROPERTIES : constant := 16#1044#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:299
CL_DEVICE_PARTITION_AFFINITY_DOMAIN : constant := 16#1045#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:300
CL_DEVICE_PARTITION_TYPE : constant := 16#1046#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:301
CL_DEVICE_REFERENCE_COUNT : constant := 16#1047#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:302
CL_DEVICE_PREFERRED_INTEROP_USER_SYNC : constant := 16#1048#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:303
CL_DEVICE_PRINTF_BUFFER_SIZE : constant := 16#1049#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:304
CL_DEVICE_IMAGE_PITCH_ALIGNMENT : constant := 16#104A#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:305
CL_DEVICE_IMAGE_BASE_ADDRESS_ALIGNMENT : constant := 16#104B#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:306
CL_DEVICE_MAX_READ_WRITE_IMAGE_ARGS : constant := 16#104C#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:307
CL_DEVICE_MAX_GLOBAL_VARIABLE_SIZE : constant := 16#104D#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:308
CL_DEVICE_QUEUE_ON_DEVICE_PROPERTIES : constant := 16#104E#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:309
CL_DEVICE_QUEUE_ON_DEVICE_PREFERRED_SIZE : constant := 16#104F#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:310
CL_DEVICE_QUEUE_ON_DEVICE_MAX_SIZE : constant := 16#1050#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:311
CL_DEVICE_MAX_ON_DEVICE_QUEUES : constant := 16#1051#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:312
CL_DEVICE_MAX_ON_DEVICE_EVENTS : constant := 16#1052#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:313
CL_DEVICE_SVM_CAPABILITIES : constant := 16#1053#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:314
CL_DEVICE_GLOBAL_VARIABLE_PREFERRED_TOTAL_SIZE : constant := 16#1054#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:315
CL_DEVICE_MAX_PIPE_ARGS : constant := 16#1055#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:316
CL_DEVICE_PIPE_MAX_ACTIVE_RESERVATIONS : constant := 16#1056#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:317
CL_DEVICE_PIPE_MAX_PACKET_SIZE : constant := 16#1057#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:318
CL_DEVICE_PREFERRED_PLATFORM_ATOMIC_ALIGNMENT : constant := 16#1058#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:319
CL_DEVICE_PREFERRED_GLOBAL_ATOMIC_ALIGNMENT : constant := 16#1059#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:320
CL_DEVICE_PREFERRED_LOCAL_ATOMIC_ALIGNMENT : constant := 16#105A#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:321
CL_DEVICE_IL_VERSION : constant := 16#105B#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:322
CL_DEVICE_MAX_NUM_SUB_GROUPS : constant := 16#105C#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:323
CL_DEVICE_SUB_GROUP_INDEPENDENT_FORWARD_PROGRESS : constant := 16#105D#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:324
CL_FP_DENORM : constant := (2 ** 0); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:327
CL_FP_INF_NAN : constant := (2 ** 1); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:328
CL_FP_ROUND_TO_NEAREST : constant := (2 ** 2); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:329
CL_FP_ROUND_TO_ZERO : constant := (2 ** 3); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:330
CL_FP_ROUND_TO_INF : constant := (2 ** 4); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:331
CL_FP_FMA : constant := (2 ** 5); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:332
CL_FP_SOFT_FLOAT : constant := (2 ** 6); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:333
CL_FP_CORRECTLY_ROUNDED_DIVIDE_SQRT : constant := (2 ** 7); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:334
CL_NONE : constant := 16#0#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:337
CL_READ_ONLY_CACHE : constant := 16#1#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:338
CL_READ_WRITE_CACHE : constant := 16#2#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:339
CL_LOCAL : constant := 16#1#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:342
CL_GLOBAL : constant := 16#2#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:343
CL_EXEC_KERNEL : constant := (2 ** 0); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:346
CL_EXEC_NATIVE_KERNEL : constant := (2 ** 1); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:347
CL_QUEUE_OUT_OF_ORDER_EXEC_MODE_ENABLE : constant := (2 ** 0); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:350
CL_QUEUE_PROFILING_ENABLE : constant := (2 ** 1); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:351
CL_QUEUE_ON_DEVICE : constant := (2 ** 2); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:352
CL_QUEUE_ON_DEVICE_DEFAULT : constant := (2 ** 3); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:353
CL_CONTEXT_REFERENCE_COUNT : constant := 16#1080#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:356
CL_CONTEXT_DEVICES : constant := 16#1081#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:357
CL_CONTEXT_PROPERTIES : constant := 16#1082#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:358
CL_CONTEXT_NUM_DEVICES : constant := 16#1083#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:359
CL_CONTEXT_PLATFORM : constant := 16#1084#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:362
CL_CONTEXT_INTEROP_USER_SYNC : constant := 16#1085#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:363
CL_DEVICE_PARTITION_EQUALLY : constant := 16#1086#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:366
CL_DEVICE_PARTITION_BY_COUNTS : constant := 16#1087#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:367
CL_DEVICE_PARTITION_BY_COUNTS_LIST_END : constant := 16#0#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:368
CL_DEVICE_PARTITION_BY_AFFINITY_DOMAIN : constant := 16#1088#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:369
CL_DEVICE_AFFINITY_DOMAIN_NUMA : constant := (2 ** 0); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:372
CL_DEVICE_AFFINITY_DOMAIN_L4_CACHE : constant := (2 ** 1); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:373
CL_DEVICE_AFFINITY_DOMAIN_L3_CACHE : constant := (2 ** 2); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:374
CL_DEVICE_AFFINITY_DOMAIN_L2_CACHE : constant := (2 ** 3); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:375
CL_DEVICE_AFFINITY_DOMAIN_L1_CACHE : constant := (2 ** 4); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:376
CL_DEVICE_AFFINITY_DOMAIN_NEXT_PARTITIONABLE : constant := (2 ** 5); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:377
CL_DEVICE_SVM_COARSE_GRAIN_BUFFER : constant := (2 ** 0); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:380
CL_DEVICE_SVM_FINE_GRAIN_BUFFER : constant := (2 ** 1); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:381
CL_DEVICE_SVM_FINE_GRAIN_SYSTEM : constant := (2 ** 2); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:382
CL_DEVICE_SVM_ATOMICS : constant := (2 ** 3); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:383
CL_QUEUE_CONTEXT : constant := 16#1090#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:386
CL_QUEUE_DEVICE : constant := 16#1091#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:387
CL_QUEUE_REFERENCE_COUNT : constant := 16#1092#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:388
CL_QUEUE_PROPERTIES : constant := 16#1093#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:389
CL_QUEUE_SIZE : constant := 16#1094#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:390
CL_QUEUE_DEVICE_DEFAULT : constant := 16#1095#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:391
CL_MEM_READ_WRITE : constant := (2 ** 0); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:394
CL_MEM_WRITE_ONLY : constant := (2 ** 1); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:395
CL_MEM_READ_ONLY : constant := (2 ** 2); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:396
CL_MEM_USE_HOST_PTR : constant := (2 ** 3); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:397
CL_MEM_ALLOC_HOST_PTR : constant := (2 ** 4); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:398
CL_MEM_COPY_HOST_PTR : constant := (2 ** 5); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:399
CL_MEM_HOST_WRITE_ONLY : constant := (2 ** 7); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:401
CL_MEM_HOST_READ_ONLY : constant := (2 ** 8); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:402
CL_MEM_HOST_NO_ACCESS : constant := (2 ** 9); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:403
CL_MEM_SVM_FINE_GRAIN_BUFFER : constant := (2 ** 10); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:404
CL_MEM_SVM_ATOMICS : constant := (2 ** 11); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:405
CL_MEM_KERNEL_READ_AND_WRITE : constant := (2 ** 12); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:406
CL_MIGRATE_MEM_OBJECT_HOST : constant := (2 ** 0); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:409
CL_MIGRATE_MEM_OBJECT_CONTENT_UNDEFINED : constant := (2 ** 1); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:410
CL_R : constant := 16#10B0#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:413
CL_A : constant := 16#10B1#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:414
CL_RG : constant := 16#10B2#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:415
CL_RA : constant := 16#10B3#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:416
CL_RGB : constant := 16#10B4#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:417
CL_RGBA : constant := 16#10B5#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:418
CL_BGRA : constant := 16#10B6#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:419
CL_ARGB : constant := 16#10B7#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:420
CL_INTENSITY : constant := 16#10B8#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:421
CL_LUMINANCE : constant := 16#10B9#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:422
CL_Rx : constant := 16#10BA#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:423
CL_RGx : constant := 16#10BB#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:424
CL_RGBx : constant := 16#10BC#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:425
CL_DEPTH : constant := 16#10BD#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:426
CL_DEPTH_STENCIL : constant := 16#10BE#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:427
CL_sRGB : constant := 16#10BF#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:428
CL_sRGBx : constant := 16#10C0#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:429
CL_sRGBA : constant := 16#10C1#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:430
CL_sBGRA : constant := 16#10C2#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:431
CL_ABGR : constant := 16#10C3#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:432
CL_SNORM_INT8 : constant := 16#10D0#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:435
CL_SNORM_INT16 : constant := 16#10D1#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:436
CL_UNORM_INT8 : constant := 16#10D2#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:437
CL_UNORM_INT16 : constant := 16#10D3#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:438
CL_UNORM_SHORT_565 : constant := 16#10D4#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:439
CL_UNORM_SHORT_555 : constant := 16#10D5#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:440
CL_UNORM_INT_101010 : constant := 16#10D6#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:441
CL_SIGNED_INT8 : constant := 16#10D7#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:442
CL_SIGNED_INT16 : constant := 16#10D8#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:443
CL_SIGNED_INT32 : constant := 16#10D9#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:444
CL_UNSIGNED_INT8 : constant := 16#10DA#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:445
CL_UNSIGNED_INT16 : constant := 16#10DB#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:446
CL_UNSIGNED_INT32 : constant := 16#10DC#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:447
CL_HALF_FLOAT : constant := 16#10DD#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:448
CL_FLOAT : constant := 16#10DE#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:449
CL_UNORM_INT24 : constant := 16#10DF#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:450
CL_UNORM_INT_101010_2 : constant := 16#10E0#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:451
CL_MEM_OBJECT_BUFFER : constant := 16#10F0#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:454
CL_MEM_OBJECT_IMAGE2D : constant := 16#10F1#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:455
CL_MEM_OBJECT_IMAGE3D : constant := 16#10F2#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:456
CL_MEM_OBJECT_IMAGE2D_ARRAY : constant := 16#10F3#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:457
CL_MEM_OBJECT_IMAGE1D : constant := 16#10F4#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:458
CL_MEM_OBJECT_IMAGE1D_ARRAY : constant := 16#10F5#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:459
CL_MEM_OBJECT_IMAGE1D_BUFFER : constant := 16#10F6#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:460
CL_MEM_OBJECT_PIPE : constant := 16#10F7#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:461
CL_MEM_TYPE : constant := 16#1100#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:464
CL_MEM_FLAGS : constant := 16#1101#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:465
CL_MEM_SIZE : constant := 16#1102#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:466
CL_MEM_HOST_PTR : constant := 16#1103#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:467
CL_MEM_MAP_COUNT : constant := 16#1104#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:468
CL_MEM_REFERENCE_COUNT : constant := 16#1105#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:469
CL_MEM_CONTEXT : constant := 16#1106#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:470
CL_MEM_ASSOCIATED_MEMOBJECT : constant := 16#1107#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:471
CL_MEM_OFFSET : constant := 16#1108#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:472
CL_MEM_USES_SVM_POINTER : constant := 16#1109#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:473
CL_IMAGE_FORMAT : constant := 16#1110#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:476
CL_IMAGE_ELEMENT_SIZE : constant := 16#1111#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:477
CL_IMAGE_ROW_PITCH : constant := 16#1112#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:478
CL_IMAGE_SLICE_PITCH : constant := 16#1113#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:479
CL_IMAGE_WIDTH : constant := 16#1114#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:480
CL_IMAGE_HEIGHT : constant := 16#1115#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:481
CL_IMAGE_DEPTH : constant := 16#1116#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:482
CL_IMAGE_ARRAY_SIZE : constant := 16#1117#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:483
CL_IMAGE_BUFFER : constant := 16#1118#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:484
CL_IMAGE_NUM_MIP_LEVELS : constant := 16#1119#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:485
CL_IMAGE_NUM_SAMPLES : constant := 16#111A#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:486
CL_PIPE_PACKET_SIZE : constant := 16#1120#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:489
CL_PIPE_MAX_PACKETS : constant := 16#1121#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:490
CL_ADDRESS_NONE : constant := 16#1130#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:493
CL_ADDRESS_CLAMP_TO_EDGE : constant := 16#1131#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:494
CL_ADDRESS_CLAMP : constant := 16#1132#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:495
CL_ADDRESS_REPEAT : constant := 16#1133#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:496
CL_ADDRESS_MIRRORED_REPEAT : constant := 16#1134#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:497
CL_FILTER_NEAREST : constant := 16#1140#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:500
CL_FILTER_LINEAR : constant := 16#1141#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:501
CL_SAMPLER_REFERENCE_COUNT : constant := 16#1150#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:504
CL_SAMPLER_CONTEXT : constant := 16#1151#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:505
CL_SAMPLER_NORMALIZED_COORDS : constant := 16#1152#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:506
CL_SAMPLER_ADDRESSING_MODE : constant := 16#1153#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:507
CL_SAMPLER_FILTER_MODE : constant := 16#1154#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:508
CL_SAMPLER_MIP_FILTER_MODE : constant := 16#1155#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:509
CL_SAMPLER_LOD_MIN : constant := 16#1156#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:510
CL_SAMPLER_LOD_MAX : constant := 16#1157#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:511
CL_MAP_READ : constant := (2 ** 0); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:514
CL_MAP_WRITE : constant := (2 ** 1); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:515
CL_MAP_WRITE_INVALIDATE_REGION : constant := (2 ** 2); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:516
CL_PROGRAM_REFERENCE_COUNT : constant := 16#1160#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:519
CL_PROGRAM_CONTEXT : constant := 16#1161#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:520
CL_PROGRAM_NUM_DEVICES : constant := 16#1162#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:521
CL_PROGRAM_DEVICES : constant := 16#1163#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:522
CL_PROGRAM_SOURCE : constant := 16#1164#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:523
CL_PROGRAM_BINARY_SIZES : constant := 16#1165#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:524
CL_PROGRAM_BINARIES : constant := 16#1166#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:525
CL_PROGRAM_NUM_KERNELS : constant := 16#1167#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:526
CL_PROGRAM_KERNEL_NAMES : constant := 16#1168#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:527
CL_PROGRAM_IL : constant := 16#1169#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:528
CL_PROGRAM_BUILD_STATUS : constant := 16#1181#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:531
CL_PROGRAM_BUILD_OPTIONS : constant := 16#1182#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:532
CL_PROGRAM_BUILD_LOG : constant := 16#1183#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:533
CL_PROGRAM_BINARY_TYPE : constant := 16#1184#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:534
CL_PROGRAM_BUILD_GLOBAL_VARIABLE_TOTAL_SIZE : constant := 16#1185#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:535
CL_PROGRAM_BINARY_TYPE_NONE : constant := 16#0#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:538
CL_PROGRAM_BINARY_TYPE_COMPILED_OBJECT : constant := 16#1#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:539
CL_PROGRAM_BINARY_TYPE_LIBRARY : constant := 16#2#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:540
CL_PROGRAM_BINARY_TYPE_EXECUTABLE : constant := 16#4#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:541
CL_BUILD_SUCCESS : constant := 0; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:544
CL_BUILD_NONE : constant := -1; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:545
CL_BUILD_ERROR : constant := -2; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:546
CL_BUILD_IN_PROGRESS : constant := -3; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:547
CL_KERNEL_FUNCTION_NAME : constant := 16#1190#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:550
CL_KERNEL_NUM_ARGS : constant := 16#1191#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:551
CL_KERNEL_REFERENCE_COUNT : constant := 16#1192#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:552
CL_KERNEL_CONTEXT : constant := 16#1193#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:553
CL_KERNEL_PROGRAM : constant := 16#1194#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:554
CL_KERNEL_ATTRIBUTES : constant := 16#1195#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:555
CL_KERNEL_MAX_NUM_SUB_GROUPS : constant := 16#11B9#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:556
CL_KERNEL_COMPILE_NUM_SUB_GROUPS : constant := 16#11BA#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:557
CL_KERNEL_ARG_ADDRESS_QUALIFIER : constant := 16#1196#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:560
CL_KERNEL_ARG_ACCESS_QUALIFIER : constant := 16#1197#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:561
CL_KERNEL_ARG_TYPE_NAME : constant := 16#1198#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:562
CL_KERNEL_ARG_TYPE_QUALIFIER : constant := 16#1199#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:563
CL_KERNEL_ARG_NAME : constant := 16#119A#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:564
CL_KERNEL_ARG_ADDRESS_GLOBAL : constant := 16#119B#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:567
CL_KERNEL_ARG_ADDRESS_LOCAL : constant := 16#119C#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:568
CL_KERNEL_ARG_ADDRESS_CONSTANT : constant := 16#119D#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:569
CL_KERNEL_ARG_ADDRESS_PRIVATE : constant := 16#119E#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:570
CL_KERNEL_ARG_ACCESS_READ_ONLY : constant := 16#11A0#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:573
CL_KERNEL_ARG_ACCESS_WRITE_ONLY : constant := 16#11A1#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:574
CL_KERNEL_ARG_ACCESS_READ_WRITE : constant := 16#11A2#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:575
CL_KERNEL_ARG_ACCESS_NONE : constant := 16#11A3#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:576
CL_KERNEL_ARG_TYPE_NONE : constant := 0; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:579
CL_KERNEL_ARG_TYPE_CONST : constant := (2 ** 0); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:580
CL_KERNEL_ARG_TYPE_RESTRICT : constant := (2 ** 1); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:581
CL_KERNEL_ARG_TYPE_VOLATILE : constant := (2 ** 2); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:582
CL_KERNEL_ARG_TYPE_PIPE : constant := (2 ** 3); -- C:\Intel\OpenCL\sdk\include\CL\cl.h:583
CL_KERNEL_WORK_GROUP_SIZE : constant := 16#11B0#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:586
CL_KERNEL_COMPILE_WORK_GROUP_SIZE : constant := 16#11B1#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:587
CL_KERNEL_LOCAL_MEM_SIZE : constant := 16#11B2#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:588
CL_KERNEL_PREFERRED_WORK_GROUP_SIZE_MULTIPLE : constant := 16#11B3#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:589
CL_KERNEL_PRIVATE_MEM_SIZE : constant := 16#11B4#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:590
CL_KERNEL_GLOBAL_WORK_SIZE : constant := 16#11B5#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:591
CL_KERNEL_MAX_SUB_GROUP_SIZE_FOR_NDRANGE : constant := 16#2033#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:594
CL_KERNEL_SUB_GROUP_COUNT_FOR_NDRANGE : constant := 16#2034#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:595
CL_KERNEL_LOCAL_SIZE_FOR_SUB_GROUP_COUNT : constant := 16#11B8#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:596
CL_KERNEL_EXEC_INFO_SVM_PTRS : constant := 16#11B6#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:599
CL_KERNEL_EXEC_INFO_SVM_FINE_GRAIN_SYSTEM : constant := 16#11B7#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:600
CL_EVENT_COMMAND_QUEUE : constant := 16#11D0#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:603
CL_EVENT_COMMAND_TYPE : constant := 16#11D1#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:604
CL_EVENT_REFERENCE_COUNT : constant := 16#11D2#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:605
CL_EVENT_COMMAND_EXECUTION_STATUS : constant := 16#11D3#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:606
CL_EVENT_CONTEXT : constant := 16#11D4#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:607
CL_COMMAND_NDRANGE_KERNEL : constant := 16#11F0#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:610
CL_COMMAND_TASK : constant := 16#11F1#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:611
CL_COMMAND_NATIVE_KERNEL : constant := 16#11F2#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:612
CL_COMMAND_READ_BUFFER : constant := 16#11F3#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:613
CL_COMMAND_WRITE_BUFFER : constant := 16#11F4#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:614
CL_COMMAND_COPY_BUFFER : constant := 16#11F5#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:615
CL_COMMAND_READ_IMAGE : constant := 16#11F6#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:616
CL_COMMAND_WRITE_IMAGE : constant := 16#11F7#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:617
CL_COMMAND_COPY_IMAGE : constant := 16#11F8#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:618
CL_COMMAND_COPY_IMAGE_TO_BUFFER : constant := 16#11F9#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:619
CL_COMMAND_COPY_BUFFER_TO_IMAGE : constant := 16#11FA#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:620
CL_COMMAND_MAP_BUFFER : constant := 16#11FB#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:621
CL_COMMAND_MAP_IMAGE : constant := 16#11FC#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:622
CL_COMMAND_UNMAP_MEM_OBJECT : constant := 16#11FD#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:623
CL_COMMAND_MARKER : constant := 16#11FE#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:624
CL_COMMAND_ACQUIRE_GL_OBJECTS : constant := 16#11FF#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:625
CL_COMMAND_RELEASE_GL_OBJECTS : constant := 16#1200#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:626
CL_COMMAND_READ_BUFFER_RECT : constant := 16#1201#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:627
CL_COMMAND_WRITE_BUFFER_RECT : constant := 16#1202#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:628
CL_COMMAND_COPY_BUFFER_RECT : constant := 16#1203#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:629
CL_COMMAND_USER : constant := 16#1204#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:630
CL_COMMAND_BARRIER : constant := 16#1205#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:631
CL_COMMAND_MIGRATE_MEM_OBJECTS : constant := 16#1206#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:632
CL_COMMAND_FILL_BUFFER : constant := 16#1207#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:633
CL_COMMAND_FILL_IMAGE : constant := 16#1208#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:634
CL_COMMAND_SVM_FREE : constant := 16#1209#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:635
CL_COMMAND_SVM_MEMCPY : constant := 16#120A#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:636
CL_COMMAND_SVM_MEMFILL : constant := 16#120B#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:637
CL_COMMAND_SVM_MAP : constant := 16#120C#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:638
CL_COMMAND_SVM_UNMAP : constant := 16#120D#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:639
CL_COMMAND_MIGRATE_SVM_MEM_OBJECTS : constant := 16#120E#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:640
CL_COMPLETE : constant := 16#0#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:643
CL_RUNNING : constant := 16#1#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:644
CL_SUBMITTED : constant := 16#2#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:645
CL_QUEUED : constant := 16#3#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:646
CL_BUFFER_CREATE_TYPE_REGION : constant := 16#1220#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:649
CL_PROFILING_COMMAND_QUEUED : constant := 16#1280#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:652
CL_PROFILING_COMMAND_SUBMIT : constant := 16#1281#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:653
CL_PROFILING_COMMAND_START : constant := 16#1282#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:654
CL_PROFILING_COMMAND_END : constant := 16#1283#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:655
CL_PROFILING_COMMAND_COMPLETE : constant := 16#1284#; -- C:\Intel\OpenCL\sdk\include\CL\cl.h:656
end cl_h;
|
reznikmm/matreshka | Ada | 3,689 | 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.Svg_Height_Attributes is
pragma Preelaborate;
type ODF_Svg_Height_Attribute is limited interface
and XML.DOM.Attributes.DOM_Attribute;
type ODF_Svg_Height_Attribute_Access is
access all ODF_Svg_Height_Attribute'Class
with Storage_Size => 0;
end ODF.DOM.Svg_Height_Attributes;
|
zhmu/ananas | Ada | 3,243 | ads | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . C O N C A T _ 3 --
-- --
-- S p e c --
-- --
-- Copyright (C) 2008-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 package contains a procedure for runtime concatenation of three string
-- operands. It is used when we want to save space in the generated code.
package System.Concat_3 is
procedure Str_Concat_3 (R : out String; S1, S2, S3 : String);
-- Performs the operation R := S1 & S2 & S3. The bounds of R are known to
-- be correct (usually set by a call to the Str_Concat_Bounds_3 procedure
-- below), so no bounds checks are required, and it is known that none of
-- the input operands overlaps R. No assumptions can be made about the
-- lower bounds of any of the operands.
procedure Str_Concat_Bounds_3
(Lo, Hi : out Natural;
S1, S2, S3 : String);
-- Assigns to Lo..Hi the bounds of the result of concatenating the three
-- given strings, following the rules in the RM regarding null operands.
end System.Concat_3;
|
reznikmm/matreshka | Ada | 8,838 | 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$
------------------------------------------------------------------------------
with AMF.Internals.UML_Elements;
with AMF.UML.Multiplicity_Elements;
with AMF.UML.Value_Specifications;
generic
type Element_Proxy is
abstract new AMF.Internals.UML_Elements.UML_Element_Proxy with private;
package AMF.Internals.UML_Multiplicity_Elements is
type UML_Multiplicity_Element_Proxy is
abstract limited new Element_Proxy
and AMF.UML.Multiplicity_Elements.UML_Multiplicity_Element
with null record;
overriding function Get_Is_Ordered
(Self : not null access constant UML_Multiplicity_Element_Proxy)
return Boolean;
-- Getter of MultiplicityElement::isOrdered.
--
-- For a multivalued multiplicity, this attribute specifies whether the
-- values in an instantiation of this element are sequentially ordered.
overriding function Get_Is_Unique
(Self : not null access constant UML_Multiplicity_Element_Proxy)
return Boolean;
-- Getter of MultiplicityElement::isUnique.
--
-- For a multivalued multiplicity, this attributes specifies whether the
-- values in an instantiation of this element are unique.
overriding function Get_Lower
(Self : not null access constant UML_Multiplicity_Element_Proxy)
return AMF.Optional_Integer;
-- Getter of MultiplicityElement::lower.
--
-- Specifies the lower bound of the multiplicity interval.
overriding function Get_Lower_Value
(Self : not null access constant UML_Multiplicity_Element_Proxy)
return AMF.UML.Value_Specifications.UML_Value_Specification_Access;
-- Getter of MultiplicityElement::lowerValue.
--
-- The specification of the lower bound for this multiplicity.
overriding function Get_Upper
(Self : not null access constant UML_Multiplicity_Element_Proxy)
return AMF.Optional_Unlimited_Natural;
-- Getter of MultiplicityElement::upper.
--
-- Specifies the upper bound of the multiplicity interval.
overriding function Get_Upper_Value
(Self : not null access constant UML_Multiplicity_Element_Proxy)
return AMF.UML.Value_Specifications.UML_Value_Specification_Access;
-- Getter of MultiplicityElement::upperValue.
--
-- The specification of the upper bound for this multiplicity.
overriding function Is_Multivalued
(Self : not null access constant UML_Multiplicity_Element_Proxy)
return Boolean;
-- Operation MultiplicityElement::isMultivalued.
--
-- The query isMultivalued() checks whether this multiplicity has an upper
-- bound greater than one.
overriding function Lower
(Self : not null access constant UML_Multiplicity_Element_Proxy)
return AMF.Optional_Integer renames Get_Lower;
-- Operation MultiplicityElement::lower.
--
-- The derived lower attribute must equal the lowerBound.
overriding function Lower_Bound
(Self : not null access constant UML_Multiplicity_Element_Proxy)
return AMF.Optional_Integer;
-- Operation MultiplicityElement::lowerBound.
--
-- The query lowerBound() returns the lower bound of the multiplicity as
-- an integer.
overriding procedure Set_Is_Ordered
(Self : not null access UML_Multiplicity_Element_Proxy;
To : Boolean);
-- Setter of MultiplicityElement::isOrdered.
--
-- For a multivalued multiplicity, this attribute specifies whether the
-- values in an instantiation of this element are sequentially ordered.
overriding procedure Set_Is_Unique
(Self : not null access UML_Multiplicity_Element_Proxy;
To : Boolean);
-- Setter of MultiplicityElement::isUnique.
--
-- For a multivalued multiplicity, this attributes specifies whether the
-- values in an instantiation of this element are unique.
overriding procedure Set_Lower
(Self : not null access UML_Multiplicity_Element_Proxy;
To : AMF.Optional_Integer);
-- Setter of MultiplicityElement::lower.
--
-- Specifies the lower bound of the multiplicity interval.
overriding procedure Set_Lower_Value
(Self : not null access UML_Multiplicity_Element_Proxy;
To : AMF.UML.Value_Specifications.UML_Value_Specification_Access);
-- Setter of MultiplicityElement::lowerValue.
--
-- The specification of the lower bound for this multiplicity.
overriding procedure Set_Upper
(Self : not null access UML_Multiplicity_Element_Proxy;
To : AMF.Optional_Unlimited_Natural);
-- Setter of MultiplicityElement::upper.
--
-- Specifies the upper bound of the multiplicity interval.
overriding procedure Set_Upper_Value
(Self : not null access UML_Multiplicity_Element_Proxy;
To : AMF.UML.Value_Specifications.UML_Value_Specification_Access);
-- Setter of MultiplicityElement::upperValue.
--
-- The specification of the upper bound for this multiplicity.
overriding function Upper
(Self : not null access constant UML_Multiplicity_Element_Proxy)
return AMF.Optional_Unlimited_Natural renames Get_Upper;
-- Operation MultiplicityElement::upper.
--
-- The derived upper attribute must equal the upperBound.
overriding function Upper_Bound
(Self : not null access constant UML_Multiplicity_Element_Proxy)
return AMF.Optional_Unlimited_Natural;
-- Operation MultiplicityElement::upperBound.
--
-- The query upperBound() returns the upper bound of the multiplicity for
-- a bounded multiplicity as an unlimited natural.
end AMF.Internals.UML_Multiplicity_Elements;
|
reznikmm/gela | Ada | 2,567 | adb | package body Asis.Ada_Environments.Containers.Internals is
-------------
-- Convert --
-------------
function Convert
(Context : Asis.Context;
Self : Gela.Unit_Containers.Unit_Container_Access)
return Asis.Ada_Environments.Containers.Container is
begin
return (Context, Self);
end Convert;
-------------
-- To_List --
-------------
function To_List
(Set : Gela.Compilation_Unit_Sets.Compilation_Unit_Set_Access)
return Asis.Compilation_Unit_List
is
Index : ASIS_Natural := ASIS_Natural (Set.Length);
Pos : Gela.Compilation_Unit_Sets.Compilation_Unit_Cursor'Class :=
Set.First;
begin
return Result : Asis.Compilation_Unit_List (1 .. Index) do
Index := 1;
while Pos.Has_Element loop
Result (Index) := (Data => Pos.Element);
Index := Index + 1;
Pos.Next;
end loop;
end return;
end To_List;
end Asis.Ada_Environments.Containers.Internals;
------------------------------------------------------------------------------
-- Copyright (c) 2013, Maxim Reznik
-- 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.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
-- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-- POSSIBILITY OF SUCH DAMAGE.
------------------------------------------------------------------------------
|
AsylumCorp/Amass | Ada | 1,155 | ads | -- Copyright 2021 Jeff Foley. All rights reserved.
-- Use of this source code is governed by Apache 2 LICENSE that can be found in the LICENSE file.
local json = require("json")
name = "CommonCrawl"
type = "api"
local urls = {}
function start()
set_rate_limit(2)
end
function vertical(ctx, domain)
urls = index_urls(ctx)
if (urls == nil or #urls == 0) then
return
end
for _, url in pairs(urls) do
scrape(ctx, {['url']=build_url(url, domain)})
end
end
function build_url(url, domain)
return url .. "?url=*." .. domain .. "&output=json&fl=url"
end
function index_urls(ctx)
local resp, err = request(ctx, {['url']="https://index.commoncrawl.org/collinfo.json"})
if (err ~= nil and err ~= "") then
log(ctx, "index URLs request to service failed: " .. err)
return nil
end
local data = json.decode(resp)
if (data == nil or #data == 0) then
return nil
end
local urls = {}
for _, u in pairs(data) do
local url = u["cdx-api"]
if (url ~= nil and url ~= "") then
table.insert(urls, url)
end
end
return urls
end
|
reznikmm/matreshka | Ada | 5,064 | 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.UML.Sequence_Nodes.Collections is
pragma Preelaborate;
package UML_Sequence_Node_Collections is
new AMF.Generic_Collections
(UML_Sequence_Node,
UML_Sequence_Node_Access);
type Set_Of_UML_Sequence_Node is
new UML_Sequence_Node_Collections.Set with null record;
Empty_Set_Of_UML_Sequence_Node : constant Set_Of_UML_Sequence_Node;
type Ordered_Set_Of_UML_Sequence_Node is
new UML_Sequence_Node_Collections.Ordered_Set with null record;
Empty_Ordered_Set_Of_UML_Sequence_Node : constant Ordered_Set_Of_UML_Sequence_Node;
type Bag_Of_UML_Sequence_Node is
new UML_Sequence_Node_Collections.Bag with null record;
Empty_Bag_Of_UML_Sequence_Node : constant Bag_Of_UML_Sequence_Node;
type Sequence_Of_UML_Sequence_Node is
new UML_Sequence_Node_Collections.Sequence with null record;
Empty_Sequence_Of_UML_Sequence_Node : constant Sequence_Of_UML_Sequence_Node;
private
Empty_Set_Of_UML_Sequence_Node : constant Set_Of_UML_Sequence_Node
:= (UML_Sequence_Node_Collections.Set with null record);
Empty_Ordered_Set_Of_UML_Sequence_Node : constant Ordered_Set_Of_UML_Sequence_Node
:= (UML_Sequence_Node_Collections.Ordered_Set with null record);
Empty_Bag_Of_UML_Sequence_Node : constant Bag_Of_UML_Sequence_Node
:= (UML_Sequence_Node_Collections.Bag with null record);
Empty_Sequence_Of_UML_Sequence_Node : constant Sequence_Of_UML_Sequence_Node
:= (UML_Sequence_Node_Collections.Sequence with null record);
end AMF.UML.Sequence_Nodes.Collections;
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.