-- (1) The bounds may not be known at compile time
-- (2) The check must take into account rounding or truncation.
-- (3) The range of type I may not be exactly representable in F.
- -- (4) For the rounding case, The end-points I'First - 0.5 and
+ -- (4) For the rounding case, the end-points I'First - 0.5 and
-- I'Last + 0.5 may or may not be in range, depending on the
-- sign of I'First and I'Last.
-- (5) X may be a NaN, which will fail any comparison
to achieve procedural interfacing between Ada and C++ in both
directions. The C++ class A has two methods. The first method is exported
to Ada by the means of an extern C wrapper function. The second method
-calls an Ada subprogram. On the Ada side, The C++ calls are modelled by
+calls an Ada subprogram. On the Ada side, the C++ calls are modelled by
a limited record with a layout comparable to the C++ class. The Ada
subprogram, in turn, calls the C++ method. So, starting from the C++
main program, the process passes back and forth between the two
-- Block_Node (Node11)
-- Defined in block entities. Points to the identifier in the
-- Block_Statement itself. Used when retrieving the block construct
--- for finalization purposes, The block entity has an implicit label
+-- for finalization purposes, the block entity has an implicit label
-- declaration in the enclosing declarative part, and has otherwise
-- no direct connection in the tree with the block statement. The
-- link is to the identifier (which is an occurrence of the entity)
Ind_Comp : Node_Id;
Iterator : Entity_Id;
- -- Start of processing for Expand_Iterator_Loop_Over_Array
-
begin
-- for Element of Array loop
-- Mode such subprograms must be handled as nested inside the (implicit)
-- elaboration procedure that executes that statement part. To handle
-- properly uplevel references we construct that subprogram explicitly,
- -- to contain blocks and inner subprograms, The statement part becomes
+ -- to contain blocks and inner subprograms, the statement part becomes
-- a call to this subprogram. This is only done if blocks are present
-- in the statement list of the body. (It would be nice to unify this
-- procedure with Check_Unnesting_In_Decls_Or_Stmts, if possible, since
to achieve procedural interfacing between Ada and C++ in both
directions. The C++ class A has two methods. The first method is exported
to Ada by the means of an extern C wrapper function. The second method
-calls an Ada subprogram. On the Ada side, The C++ calls are modelled by
+calls an Ada subprogram. On the Ada side, the C++ calls are modelled by
a limited record with a layout comparable to the C++ class. The Ada
subprogram, in turn, calls the C++ method. So, starting from the C++
main program, the process passes back and forth between the two
-- What we do in such cases is to gather nodes, where we would have liked
-- to call Generate_Reference but we couldn't because we didn't know enough
- -- into this table, Then we deal with generating references later on when
+ -- into this table, then we deal with generating references later on when
-- we have sufficient information to do it right.
type Deferred_Reference_Entry is record
Len : Natural;
Pad : Character := ' ') return VString;
-- If the length of Str is greater than or equal to Len, then Str is
- -- returned unchanged. Otherwise, The value returned is obtained by
+ -- returned unchanged. Otherwise, the value returned is obtained by
-- concatenating Length (Str) - Len instances of the Pad character to
-- the left hand side.
Len : Natural;
Pad : Character := ' ') return VString;
-- If the length of Str is greater than or equal to Len, then Str is
- -- returned unchanged. Otherwise, The value returned is obtained by
+ -- returned unchanged. Otherwise, the value returned is obtained by
-- concatenating Length (Str) - Len instances of the Pad character to
-- the right hand side.
procedure Add_Library_Search_Dir (Path : String);
-- Call Add_Lib_Search_Dir with an absolute directory path. If Path is
- -- relative path,, it is relative to the current working directory.
+ -- relative path, it is relative to the current working directory.
procedure Add_Source_Search_Dir (Path : String);
-- Call Add_Src_Search_Dir with an absolute directory path. If Path is a
-- predefined integer types. If the type is formal, it is also a first
-- subtype, and its base type has no freeze node. On the other hand, a
-- subtype of a generic formal is not its own first subtype. Its base
- -- type, if anonymous, is attached to the formal type decl. from which
- -- the first subtype is obtained.
+ -- type, if anonymous, is attached to the formal type declaration from
+ -- which the first subtype is obtained.
if No (F) then
if B = Base_Type (Standard_Integer) then
-- be available in the scope that encloses the protected declaration.
-- Otherwise the type is in the scope enclosing the subprogram.
- -- If the function has formals, The return type of a subprogram
+ -- If the function has formals, the return type of a subprogram
-- declaration is analyzed in the scope of the subprogram (see
-- Process_Formals) and thus the protected type, if present, is
-- the scope of the current function scope.
-- When the type Address is a visible integer type, and the DEC
-- system extension is visible, the predefined operator may be
-- hidden as well, by one of the address operations in auxdec.
- -- Finally, The abstract operations on address do not hide the
+ -- Finally, the abstract operations on address do not hide the
-- predefined operator (this is the purpose of making them abstract).
-----------------------------------
begin
-- If the domain of iteration is an array component that depends
- -- on a discriminant, create actual subtype for it. preanalysis
+ -- on a discriminant, create actual subtype for it. Preanalysis
-- does not generate the actual subtype of a selected component.
if Nkind (Iter_Name) = N_Selected_Component
Check_Subtype_Indication (Etype (Def_Id));
- -- For a predefined container, The type of the loop variable is
+ -- For a predefined container, the type of the loop variable is
-- the Iterator_Element aspect of the container type.
else
Enter_Name (Id);
end if;
- -- In an element iterator, The loop parameter is a variable if
+ -- In an element iterator, the loop parameter is a variable if
-- the domain of iteration (container or array) is a variable.
if not Of_Present (I_Spec)
function Decimal_Exponent_Hi (V : Ureal) return Int;
-- Returns an estimate of the exponent of Val represented as a normalized
- -- decimal number (non-zero digit before decimal point), The estimate is
+ -- decimal number (non-zero digit before decimal point), the estimate is
-- either correct, or high, but never low. The accuracy of the estimate
-- affects only the efficiency of the comparison routines.
function Decimal_Exponent_Lo (V : Ureal) return Int;
-- Returns an estimate of the exponent of Val represented as a normalized
- -- decimal number (non-zero digit before decimal point), The estimate is
+ -- decimal number (non-zero digit before decimal point), the estimate is
-- either correct, or low, but never high. The accuracy of the estimate
-- affects only the efficiency of the comparison routines.