mirror of
https://github.com/nasa/fpp.git
synced 2025-12-10 17:29:15 -06:00
Remove trailing spaces in spec
This commit is contained in:
parent
00be092850
commit
92f2f47d6b
@ -12025,7 +12025,7 @@ equivalent.</p>
|
||||
</div>
|
||||
<div id="footer">
|
||||
<div id="footer-text">
|
||||
Last updated 2025-10-28 15:42:31 -0700
|
||||
Last updated 2025-10-28 15:59:16 -0700
|
||||
</div>
|
||||
</div>
|
||||
<script src="code-prettify/run_prettify.js"></script>
|
||||
|
||||
@ -15789,7 +15789,7 @@ serialized according to its
|
||||
</div>
|
||||
<div id="footer">
|
||||
<div id="footer-text">
|
||||
Last updated 2025-10-28 15:42:32 -0700
|
||||
Last updated 2025-10-28 15:59:57 -0700
|
||||
</div>
|
||||
</div>
|
||||
<script src="code-prettify/run_prettify.js"></script>
|
||||
|
||||
@ -19,7 +19,7 @@ Elsewhere in the model, the name _N_ may be used as alias of (i.e., an
|
||||
alternate name for) the type _T_.
|
||||
|
||||
If the optional keyword `dictionary` is present, then the
|
||||
definition must conform to the rules stated in the
|
||||
definition must conform to the rules stated in the
|
||||
<<Definitions_Dictionary-Definitions,dictionary definitions>> section.
|
||||
|
||||
==== Examples
|
||||
|
||||
@ -40,7 +40,7 @@ When displaying the array, the format is applied to each element of the array.
|
||||
There is one argument to the format string, which is an array member.
|
||||
|
||||
If the optional keyword `dictionary` is present, then the
|
||||
definition must conform to the rules stated in the
|
||||
definition must conform to the rules stated in the
|
||||
<<Definitions_Dictionary-Definitions,dictionary definitions>> section.
|
||||
|
||||
==== Examples
|
||||
|
||||
@ -25,7 +25,7 @@ the constant definition according to the
|
||||
rules for names>>, you can use _Q_ as a name for _v_.
|
||||
|
||||
If the optional keyword `dictionary` is present, then the
|
||||
definition must conform to the rules stated in the
|
||||
definition must conform to the rules stated in the
|
||||
<<Definitions_Dictionary-Definitions,dictionary definitions>> section.
|
||||
|
||||
==== Examples
|
||||
|
||||
@ -1,7 +1,7 @@
|
||||
=== Dictionary Definitions
|
||||
|
||||
If the optional keyword `dictionary` appears in a type definition or
|
||||
a constant definition, then that definition is called a
|
||||
a constant definition, then that definition is called a
|
||||
*dictionary definition*.
|
||||
A dictionary definition instructs the code generator to include
|
||||
the definition in the ground dictionary.
|
||||
@ -33,5 +33,5 @@ type T1
|
||||
dictionary type T2 = T1 # Error: T2 is not displayable
|
||||
|
||||
# Error: c does not have primitive, string, or enum type
|
||||
dictionary constant c = { x = U32 }
|
||||
dictionary constant c = { x = U32 }
|
||||
----
|
||||
|
||||
@ -53,7 +53,7 @@ with the enum definition.
|
||||
The type of the expression must be the type of the enum definition.
|
||||
|
||||
If the optional keyword `dictionary` is present, then the
|
||||
definition must conform to the rules stated in the
|
||||
definition must conform to the rules stated in the
|
||||
<<Definitions_Dictionary-Definitions,dictionary definitions>> section.
|
||||
|
||||
==== Inferred Representation Type
|
||||
|
||||
@ -60,7 +60,7 @@ If the expression specifies a value for a member with size
|
||||
greater than one, then the value is applied to each element.
|
||||
|
||||
If the optional keyword `dictionary` is present, then the
|
||||
definition must conform to the rules stated in the
|
||||
definition must conform to the rules stated in the
|
||||
<<Definitions_Dictionary-Definitions,dictionary definitions>> section.
|
||||
|
||||
==== Examples
|
||||
|
||||
@ -183,7 +183,7 @@ step are all the matched connections at _I_ `.` stem:[p_2].
|
||||
|
||||
.. For each pair stem:[(c_1,c_2)] computed in step c:
|
||||
|
||||
... If stem:[c_1] has a port number stem:[n_1] assigned at _I_ `.` stem:[p_1] and
|
||||
... If stem:[c_1] has a port number stem:[n_1] assigned at _I_ `.` stem:[p_1] and
|
||||
stem:[c_2] has a port number stem:[n_2] assigned at
|
||||
_I_ `.` stem:[p_2], then check that stem:[n_1 = n_2].
|
||||
|
||||
@ -305,7 +305,7 @@ The only requirement levied here is that, when generating a dictionary,
|
||||
the FPP implementation must guarantee that all the framework definitions
|
||||
required by the dictionary specification are available in the model.
|
||||
Those framework definitions are specified
|
||||
in the https://fprime.jpl.nasa.gov/latest/docs/reference/fpp-json-dict/[F Prime
|
||||
in the https://fprime.jpl.nasa.gov/latest/docs/reference/fpp-json-dict/[F Prime
|
||||
dictionary specification].
|
||||
|
||||
==== Examples
|
||||
|
||||
@ -1,6 +1,6 @@
|
||||
=== Array Subscript Expressions
|
||||
|
||||
An *array subscript expression* is an expression that selects an element from
|
||||
An *array subscript expression* is an expression that selects an element from
|
||||
an array value.
|
||||
|
||||
==== Syntax
|
||||
|
||||
@ -29,7 +29,7 @@ constant definition according to the
|
||||
for resolving qualified identifiers>>, then it evaluates to the value
|
||||
associated with the corresponding <<Definitions,definition>>.
|
||||
|
||||
. Otherwise if stem:[e] is an <<Expressions,expression>> of type stem:[T],
|
||||
. Otherwise if stem:[e] is an <<Expressions,expression>> of type stem:[T],
|
||||
where
|
||||
stem:[T] is a <<Types_Struct-Types,struct type>>
|
||||
or <<Types_Internal-Types_Anonymous-Struct-Types,anonymous struct type>>
|
||||
|
||||
@ -97,7 +97,7 @@ stem:[[0,10^6)].
|
||||
|
||||
+
|
||||
+
|
||||
If a throttle period stem:[p] is specified for event _E_, and the throttle
|
||||
If a throttle period stem:[p] is specified for event _E_, and the throttle
|
||||
count
|
||||
for _E_ goes from zero to nonzero at time stem:[t], and a request
|
||||
to emit an instance of _E_ occurs at or after time stem:[t + p], then the
|
||||
|
||||
@ -16,10 +16,10 @@ A location specifier is one of the following:
|
||||
<<Scoping-of-Names_Qualified-Identifiers,_qual-ident_>> `at`
|
||||
<<Expressions_String-Literals,_string-literal_>>
|
||||
|
||||
* A *constant location specifier* `locate`
|
||||
* A *constant location specifier* `locate`
|
||||
_[_
|
||||
`dictionary`
|
||||
_]_
|
||||
_]_
|
||||
`constant`
|
||||
<<Scoping-of-Names_Qualified-Identifiers,_qual-ident_>> `at`
|
||||
<<Expressions_String-Literals,_string-literal_>>
|
||||
@ -93,7 +93,7 @@ This rule allows the specification of dependencies for a larger set
|
||||
of files than the ones involved in a particular analysis
|
||||
or translation.
|
||||
If _Q_ does refer to a definition _D_, then _S_
|
||||
must be a dictionary specifier if _D_ is a
|
||||
must be a dictionary specifier if _D_ is a
|
||||
<<Definitions_Dictionary-Definitions,dictionary definition>>;
|
||||
otherwise it must not be.
|
||||
|
||||
@ -107,10 +107,10 @@ the file must contain the definition referred to in the
|
||||
location specifier.
|
||||
|
||||
. Multiple location specifiers for the same definition are allowed in a single
|
||||
<<Translation-Units-and-Models_Models,model>>, so long as the following
|
||||
<<Translation-Units-and-Models_Models,model>>, so long as the following
|
||||
conditions are met:
|
||||
|
||||
.. All of the specifiers must be dictionary specifiers, or none of them must
|
||||
.. All of the specifiers must be dictionary specifiers, or none of them must
|
||||
be.
|
||||
|
||||
.. All the specifiers must have the same locations.
|
||||
|
||||
@ -1,7 +1,7 @@
|
||||
=== Telemetry Packet Set Specifiers
|
||||
|
||||
A *telemetry packet set specifier* arranges the telemetry channels of a
|
||||
topology into a set of <<Specifiers_Telemetry-Packet-Specifiers,telemetry
|
||||
topology into a set of <<Specifiers_Telemetry-Packet-Specifiers,telemetry
|
||||
packets>>.
|
||||
A telemetry packet set specifier is part of a
|
||||
<<Definitions_Topology-Definitions, topology definition>>.
|
||||
@ -35,7 +35,7 @@ and the terminating punctuation is a comma.
|
||||
|
||||
==== Semantics
|
||||
|
||||
FPP recursively resolves any include specifiers in
|
||||
FPP recursively resolves any include specifiers in
|
||||
_telemetry-packet-group-member-sequence_.
|
||||
This action converts _telemetry-packet-group-member-sequence_ to a
|
||||
list _L_ of telemetry packet specifiers,
|
||||
|
||||
@ -151,7 +151,7 @@ with element type stem:[T] and size stem:[n].
|
||||
|
||||
. Check that stem:[T_2] <<Type-Checking_Type-Conversion,may be converted to>>
|
||||
_Integer_.
|
||||
|
||||
|
||||
. Use stem:[T] as the type of the expression.
|
||||
|
||||
=== Struct Expressions
|
||||
@ -295,7 +295,7 @@ are <<Type-Checking_Identical-Types,identical types>>.
|
||||
|
||||
. If either stem:[T_1] or stem:[T_2] or both is an
|
||||
<<Types_Alias-Types,alias type>>, then stem:[T_1]
|
||||
may be converted to stem:[T_2] if the <<Types_Underlying-Types,underlying
|
||||
may be converted to stem:[T_2] if the <<Types_Underlying-Types,underlying
|
||||
type>> of stem:[T_1] may be converted to
|
||||
the <<Types_Underlying-Types,underlying type>> of stem:[T_2].
|
||||
|
||||
@ -373,16 +373,16 @@ the whole expression):
|
||||
<<Type-Checking_Identical-Types,identical types>>, then let
|
||||
stem:[T] be stem:[T_1].
|
||||
|
||||
. Otherwise if stem:[T_1] or stem:[T_2] or both are <<Types_Alias-Types,alias
|
||||
. Otherwise if stem:[T_1] or stem:[T_2] or both are <<Types_Alias-Types,alias
|
||||
types>>, then do the following:
|
||||
|
||||
.. Let stem:[L_1] be the <<Types_Alias-Lists,alias list>> of stem:[T_1].
|
||||
|
||||
.. Let stem:[L_2] be the <<Types_Alias-Lists,alias list>> of stem:[T_2].
|
||||
|
||||
.. If there is no type in stem:[L_1] that is
|
||||
.. If there is no type in stem:[L_1] that is
|
||||
<<Type-Checking_Identical-Types,identical>>
|
||||
to a type in stem:[L_2], then replace each each alias type with its
|
||||
to a type in stem:[L_2], then replace each each alias type with its
|
||||
<<Types_Underlying-Types,underlying type>> and reapply these rules.
|
||||
|
||||
.. Otherwise let stem:[T] be the first type in stem:[L_2] that is identical
|
||||
|
||||
@ -21,10 +21,10 @@ stem:[O_2] in the following cases.
|
||||
|
||||
.. stem:[T_1] and stem:[T_2] are <<Type-Checking_Identical-Types,identical types>>.
|
||||
|
||||
.. Either or both of stem:[T_1] and stem:[T_2] is an <<Types_Alias-Types,alias
|
||||
.. Either or both of stem:[T_1] and stem:[T_2] is an <<Types_Alias-Types,alias
|
||||
type>>,
|
||||
and _Some_ stem:[T'_1] may be converted to _Some_ stem:[T'_2], where
|
||||
stem:[T'_1] is the <<Types_Underlying-Types,underlying type>> of stem:[T_1],
|
||||
stem:[T'_1] is the <<Types_Underlying-Types,underlying type>> of stem:[T_1],
|
||||
and
|
||||
stem:[T'_2] is the <<Types_Underlying-Types,underlying type>> of stem:[T_2].
|
||||
|
||||
|
||||
@ -42,7 +42,7 @@ where _n_ is an integer value in the range [1,2^31-1].
|
||||
There is one string type `string` and one string type `string size` _n_
|
||||
for each legal value of _n_.
|
||||
|
||||
The value _n_, if present, is called the *size* associated with the string
|
||||
The value _n_, if present, is called the *size* associated with the string
|
||||
type.
|
||||
The size provides a maximum string length that the code generator can use
|
||||
for allocating memory and serializing data.
|
||||
@ -163,7 +163,7 @@ It is one of the following:
|
||||
* An <<Types_Enum-Types,enum type>>.
|
||||
* An <<Types_Array-Types,array type>> whose member type is a displayable type.
|
||||
* A <<Types_Struct-Types,struct type>> whose member types are all displayable types.
|
||||
* An <<Types_Alias-Types,alias type>> whose <<Types_Underlying-Types,underlying
|
||||
* An <<Types_Alias-Types,alias type>> whose <<Types_Underlying-Types,underlying
|
||||
type>> is a displayable type.
|
||||
|
||||
=== Types with Numeric Members
|
||||
|
||||
@ -133,7 +133,7 @@ an anonymous array value stem:[v] has the form `[` stem:[v_1] `,` stem:[...]
|
||||
`,`
|
||||
stem:[v_{n-1}] `]`, where
|
||||
|
||||
. stem:[n] is a positive integer called the *size* of the anonymous array
|
||||
. stem:[n] is a positive integer called the *size* of the anonymous array
|
||||
value.
|
||||
|
||||
. For each stem:[i in [0,n-1]], stem:[v_i] is a value of type
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user