text stringlengths 0 234 |
|---|
Index := Index + 1; |
else |
Stav := Syl_Arr(I); |
end if; |
for Z in 1..4 loop |
if Stav(Z) /= ' ' then |
if Ver = True then |
Ut(Index) := Ada.Characters.Handling.To_Upper(Stav(Z)); |
else |
Ut(Index) := Stav(Z); |
end if; |
Ver := False; |
Index := Index + 1; |
end if; |
end loop; |
end loop; |
Put("Genererat planetnamn: "); |
Put(Ut(1..Index)); |
Function Definition: procedure Stone is |
Function Body: I: Integer; |
C: Character; |
begin |
--kollar om 2 argument finns |
if Argument_Count = 2 then |
--Tar in tecknet |
C := Argument(1)(1); |
--Omvandlar tecknet till integer |
I := Character'Pos(C); |
-- Lägger till argument 2 till integern |
I := I + Integer'Value(Argument(2)); |
Put(Character'Val(I)); |
end if; |
null; |
Function Definition: procedure Henge is |
Function Body: function Read |
return Integer is |
C : Character; |
begin |
Get(C); |
if C = 'h' then |
return 0; |
else |
for I in 1..4 loop |
Get(C); |
end loop; |
return Read + 12; |
end if; |
Function Definition: function Exists ( Check_Value : Character; Values : Backpack_Pocket_T; Range_Max: Pocket_Size_T) return Boolean is |
Function Body: (for some Idx in Backpack_Pocket_T'First .. Range_Max => Values (Idx) = Check_Value); |
begin |
for Char_Idx in Pocket_Size_T'First .. pack.Pocket_Size loop |
if Char_Idx = Backpack_Pocket_T'First or else |
not Exists (pack.Pocket_A_Content (Char_Idx), pack.Pocket_A_Content, Char_Idx - 1) then |
if Exists (pack.Pocket_A_Content (Char_Idx), pack.Pocket_B_Content, pack.Pocket_Size) then |
Running_Total := Running_Total + Get_Item_Prioirty (pack.Pocket_A_Content (Char_Idx)); |
end if; |
end if; |
pragma Loop_Variant (Increases => Char_Idx); |
pragma Loop_Invariant (Running_Total <= Backpack_Priority_Score_T(Char_Idx) * Max_Item_Priority); |
end loop; |
return Running_Total; |
Function Definition: function Exists ( Check_Value : Character; Values : Input_String; Range_Max: Input_Size_T) return Boolean is |
Function Body: (for some Idx in Backpack_Pocket_T'First .. Range_Max => Values (Idx) = Check_Value); |
begin |
Search_Loop : for Char_Idx in Input_String'First .. 2 * Packs(1).Pocket_Size loop |
if Char_Idx = Input_String'First or else |
not Exists (Packs(1).Pack_Content (Char_Idx), Packs(1).Pack_Content, Char_Idx - 1) then |
if Exists (Packs(1).Pack_Content (Char_Idx), Packs(2).Pack_Content, 2 * Packs(2).Pocket_Size) and then |
Exists (Packs(1).Pack_Content (Char_Idx), Packs(3).Pack_Content, 2 * Packs(3).Pocket_Size) then |
Running_Total := Running_Total + Get_Item_Prioirty (Packs(1).Pack_Content (Char_Idx)); |
exit Search_Loop when True; |
end if; |
end if; |
pragma Loop_Variant (Increases => Char_Idx); |
pragma Loop_Invariant (Running_Total <= Max_Item_Priority); |
end loop Search_Loop; |
return Running_Total; |
Function Definition: procedure Stack_Init is |
Function Body: begin |
for i in Stack_Row_Index'Range loop |
for j in Stack_Column_Index'Range loop |
Crate_Stack(i, j) := '-'; |
end loop; |
end loop; |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.