Additionally, each facet definition element can be uniquely
addressed via a URI constructed as follows:
Additionally, each facet usage in a built-in datatype definition
can be uniquely addressed via a URI constructed as follows:
For example, to address the usage of the maxInclusive facet in
the definition of int, the URI is:
3.2 Primitive datatypes
The ·primitive· datatypes defined by this specification
are described below. For each datatype, the
·value space· and ·lexical space·
are defined, ·constraining facet·s which apply
to the datatype are listed and any datatypes ·derived·
from this datatype are specified.
·primitive· datatypes can only be added by revisions
to this specification.
3.2.1 string
[Definition:] The string datatype
represents character strings in XML. The ·value space·
of string is the set of finite-length sequences of
characters (as defined in
[XML]) that ·match· the
Char production from [XML].
A character is an atomic unit of
communication; it is not further specified except to note that every
character has a corresponding
Universal Character Set code point, which is an integer.
Note:
As noted in
ordered, the fact that this specification does
not specify an
order relation for
·string·
does not preclude other applications from treating
strings as being ordered.
3.2.2 boolean
[Definition:] boolean has the
·value space· required to support the mathematical
concept of binary-valued logic: {true, false}.
3.2.2.1 Lexical representation
An instance of a datatype that is defined as ·boolean·
can have the following legal literals {true, false, 1, 0}.
3.2.2.2 Canonical representation
The canonical representation for boolean is the set of
literals {true, false}.
3.2.3 decimal
Issue (RQ-150i):RQ-150 (minimum number of digits for decimal)The minimum number of digits implementations are required to support
will be lowered to 16 digits; a health warning will be added to note
that implementations of derived datatypes may support more digits of
precision than the base decimal type does, but that they are not required
to do so.
[Definition:] decimal
represents a subset of the real numbers, which can be represented by decimal numerals.
The ·value space· of decimal
is the set of numbers that can be obtained by
dividing
an integer by a non-negative
power of ten, i.e., expressible as
i / 10n
where i and n are integers
and
n ≥ 0.
Precision is not reflected in this value space;
the number 2.0 is not distinct from the number 2.00.
(The datatype pDecimal may be used
for values in which precision is significant.)
The order relation on decimal
is the order relation on real numbers, restricted
to this subset.
Note: All
·minimally conforming· processors
·must· support decimal numbers with a minimum of
16 decimal digits
(i.e., of 18they must support all values which would be
allowed by a simple type definition which set
totalDigits to 16). However,
·minimally conforming· processors
·may· set
an application-defined limit on the maximum number of decimal digits
they are prepared to support, in which case that application-defined
maximum number
·must· be clearly documented.
3.2.3.1 Lexical representation
decimal has a lexical representation
consisting of a finite-length sequence of decimal digits (#x30-#x39) separated
by a period as a decimal indicator.
An optional leading sign is allowed.
If the sign is omitted, "+" is assumed. Leading and trailing zeroes are optional.
If the fractional part is zero, the period and following zero(es) can
be omitted.
For example: -1.23, 12678967.543233, +100000.00, 210.
The lexical space of decimal is the set of
lexical representations which match the grammar given above, or
(equivalently) the regular expression
'-?(([0-9]+(.[0-9]*)?)|(.[0-9]+))'.
The mapping from lexical representations to values is the usual
one for decimal numerals; it is given formally in:
3.2.3.2 Canonical representation
The canonical representation for decimal is defined by
prohibiting certain options from the
Lexical representation (§3.2.3.1). Specifically, the preceding
optional "+" sign is prohibited. The decimal point is required. Leading and
trailing zeroes are prohibited subject to the following: there must be at least
one digit to the right and to the left of the decimal point which may be a zero.
The mapping from values to canonical representations
is given formally in:
3.2.3.4 Datatypes based on decimal
The following ·built-in·
datatypes are ·derived· from
decimal:
3.2.4 pDecimal
[Definition:] The pDecimal
datatype represents the
numeric value and (arithmetic) precision of decimal numbers which retain
precision; it also
includes special values for positive and negative infinity and
"not a number", and it differentiates
between "positive zero" and "negative
zero". The special values are
introduced to make the datatype correspond closely to
the
floating-point decimal datatypes described by the forthcoming
revision of IEEE/ANSI 754.
Precision is sometimes given in absolute, sometimes in relative
terms. [Definition:] The arithmetic precision of a value is
expressed in absolute quantitative terms,
by indicating
how many digits to the right of the decimal point are significant.
"5" has an arithmetic precision of 0, and
"5.01" an arithmetic precision of 2.
3.2.4.1 Value Space
a decimal number, positiveInfinity,
negativeInfinity or notANumber
Note: As explained below, the lexical
representation of the
pDecimal value object whose
·numericalValue·
is
notANumber is '
NaN'. Accordingly, in English text we
use 'NaN' to refer to that value. Similarly we use 'INF'
and '–INF' to refer to the two value objects whose
·numericalValue·
is
positiveInfinity and
negativeInfinity. These three value objects
are also informally called "not-a-number", "positive infinity",
and "negative infinity".
The latter two together are called
"the infinities".
Equality and order for pDecimal are defined as follows:
- Two numerical pDecimal values
are ordered (or equal) as their
·numericalValue· values are ordered (or equal).
(This means
that
two zeros with
different ·sign·s
are equal;
negative zeros are not ordered less than positive zeros.)
- INF is equal only to itself, and is greater than
–INF and all numerical pDecimal values.
- –INF is equal only to itself, and is less than
INF and all numerical pDecimal values.
- NaN is incomparable with all values, including
itself.
3.2.4.2 Lexical Mapping
pDecimal's lexical space is the set of all
decimal numerals with or without a decimal
point, numerals in scientific (exponential) notation, and
the character strings 'INF',
'+INF', '-INF',
and 'NaN'.
The lexicalMappings
facet can remove any one or two of the three subsets of
numerals, with corresponding reductions in
the value space. Using this facet
rather than pattern will change the canonical
mapping to insure that the resulting datatype will still have canonical
representations of all its values.
The lexical mapping and canonical mapping
for pDecimal are the following functions:
3.2.5 float
[Definition:] float
is patterned after the IEEE single-precision 32-bit floating point type
[IEEE 754-1985]. The basic ·value space· of
float consists of the values
m × 2^e, where m
is an integer whose absolute value is less than
2^24, and e is an integer
between -149 and 104, inclusive. In addition to the basic
·value space· described above, the
·value space· of float also contains the
following
three
special values:
positive and negative infinity and not-a-number
(NaN).
The order relation on float
is: x < y iff y - x is positive
for x and y in the value space.
Positive infinity is greater than all other non-NaN values.
NaN equals itself but is incomparable with (neither greater than nor less than)
any other value in the ·value space·.
Note:
"Equality" in this Recommendation is defined to be "identity" (i.e., values that
are identical in the
·value space· are equal and vice versa).
Identity must be used for the few operations that are defined in this Recommendation.
Applications using any of the datatypes defined in this Recommendation may use different
definitions of equality for computational purposes;
[IEEE 754-1985]-based computation systems
are examples. Nothing in this Recommendation should be construed as requiring that
such applications use identity as their equality relationship when computing.
Any value incomparable with the value used for the four bounding facets
(
·minInclusive·,
·maxInclusive·,
·minExclusive·, and
·maxExclusive·) will be
excluded from the resulting restricted
·value space·. In particular,
when "NaN" is used as a facet value for a bounding facet, since no other
float values are
·comparable· with it,
the result is a
·value space·
either having NaN as its only member (the inclusive cases) or that is empty
(the exclusive cases). If any other value is used for a bounding facet,
NaN will be excluded from the resulting restricted
·value space·;
to add NaN back in requires union with the NaN-only space.
This datatype differs from that of
[IEEE 754-1985] in that there is only one
NaN and only one zero. This makes the equality and ordering of values in the data
space differ from that of
[IEEE 754-1985] only in that for schema purposes NaN = NaN.
A literal in the ·lexical space· representing a
decimal number d maps to the normalized value
in the ·value space· of float that is
closest to d in the sense defined by
[Clinger, WD (1990)]; if d is
exactly halfway between two such values then the even value is chosen.
3.2.5.1 Lexical representation
float values have a lexical representation
consisting of a mantissa followed, optionally, by the character
'E' or 'e',
followed by an exponent. The exponent ·must·
be an integer. The mantissa must be a
decimal number. The representations
for exponent and mantissa must follow the lexical rules for
integer and decimal. If the
'E' or 'e' and
the following exponent are omitted, an exponent value of 0 is assumed.
The special values
positive
and negative infinity and not-a-number have lexical representations
INF, -INF and
NaN, respectively.
Lexical representations for zero may take a positive or negative sign.
For example, -1E4, 1267.43233E12, 12.78e-2, 12
, -0, 0
and INF are all legal literals for float.
3.2.5.2 Canonical representation
NaN has the canonical form 'NaN'. Infinity and
negative infinity have the canonical forms 'INF' and
'-INF' respectively. Besides these special
values, the general form of the canonical form for float
is a mantissa, which is a decimal, followed by 'E'
followed by an exponent which is an integer. Leading zeroes and
the preceding optional '+' sign are prohibited in the
exponent. If the exponent is zero it must be indicated by
'E0'. For the mantissa, the preceding optional
'+' sign is prohibited and the decimal point is
required. Leading and trailing zeroes are prohibited subject to
the following: number representations must be normalized such that
there is a single digit which is non-zero to the left of the decimal
point and at least a single digit to the right of the decimal point
unless the value being represented is zero. The canonical form of
positive zero is 0.0E0. The canonical form for negative zero
is -0.0E0. Beyond the one required digit after the decimal point
in the mantissa, there must be as many, but only as many, additional
digits as are needed to uniquely distinguish the value from all other
values for the datatype after rounding.
3.2.6 double
[Definition:] The double
datatype
is patterned after the
IEEE double-precision 64-bit floating point
type [IEEE 754-1985]. The basic ·value space·
of double consists of the values
m × 2^e, where m
is an integer whose absolute value is less than
2^53, and e is an
integer between -1075 and 970, inclusive. In addition to the basic
·value space· described above, the
·value space· of double also contains
the following
three
special values:
positive and negative infinity and not-a-number
(NaN).
The order relation on double
is: x < y iff y - x is positive
for x and y in the value space.
Positive infinity is greater than all other non-NaN values.
NaN equals itself but is incomparable with (neither greater than nor less than)
any other value in the ·value space·.
Note:
"Equality" in this Recommendation is defined to be "identity" (i.e., values that
are identical in the
·value space· are equal and vice versa).
Identity must be used for the few operations that are defined in this Recommendation.
Applications using any of the datatypes defined in this Recommendation may use different
definitions of equality for computational purposes;
[IEEE 754-1985]-based computation systems
are examples. Nothing in this Recommendation should be construed as requiring that
such applications use identity as their equality relationship when computing.
Any value incomparable with the value used for the four bounding facets
(
·minInclusive·,
·maxInclusive·,
·minExclusive·, and
·maxExclusive·) will be
excluded from the resulting restricted
·value space·. In particular,
when "NaN" is used as a facet value for a bounding facet, since no other
double values are
·comparable· with it,
the result is a
·value space·
either having NaN as its only member (the inclusive cases) or that is empty
(the exclusive cases). If any other value is used for a bounding facet,
NaN will be excluded from the resulting restricted
·value space·;
to add NaN back in requires union with the NaN-only space.
This datatype differs from that of
[IEEE 754-1985] in that there is only one
NaN and only one zero. This makes the equality and ordering of values in the data
space differ from that of
[IEEE 754-1985] only in that for schema purposes NaN = NaN.
A literal in the ·lexical space· representing a
decimal number d maps to the normalized value
in the ·value space· of double that is
closest to d; if d is
exactly halfway between two such values then the even value is chosen.
This is the best approximation of d
([Clinger, WD (1990)], [Gay, DM (1990)]), which is more
accurate than the mapping required by [IEEE 754-1985].
3.2.6.1 Lexical representation
double values have a lexical representation
consisting of a mantissa followed, optionally, by the character "E" or
"e", followed by an exponent. The exponent ·must· be
an integer. The mantissa must be
a decimal number. The representations
for exponent and mantissa must follow the lexical rules for
integer and
decimal. If the 'E' or 'e' and
the following exponent are omitted, an exponent value of 0 is assumed.
The special values
positive
and negative infinity and not-a-number have lexical representations
INF, -INF and
NaN, respectively.
Lexical representations for zero may take a positive or negative sign.
For example, -1E4, 1267.43233E12, 12.78e-2, 12
, -0, 0
and INF
are all legal literals for double.
3.2.6.2 Canonical representation
NaN has the canonical form 'NaN'. Infinity and
negative infinity have the canonical forms 'INF' and
'-INF' respectively. Besides these special
values, the general form of the canonical form for double
is a mantissa, which is a decimal, followed by 'E'
followed by an exponent which is an integer. Leading zeroes and
the preceding optional '+' sign are prohibited in the
exponent. If the exponent is zero it must be indicated by
'E0'. For the mantissa, the preceding optional
'+' sign is prohibited and the decimal point is
required. Leading and trailing zeroes are prohibited subject to
the following: number representations must be normalized such that
there is a single digit which is non-zero to the left of the decimal
point and at least a single digit to the right of the decimal point
unless the value being represented is zero. The canonical form of
positive zero is 0.0E0. The canonical form for negative zero
is -0.0E0. Beyond the one required digit after the decimal point
in the mantissa, there must be as many, but only as many, additional
digits as are needed to uniquely distinguish the value from all other
values for the datatype after rounding.
3.2.7 duration
[Definition:] duration is a datatype that represents
durations of time. The concept of duration being captured is
drawn from those of [ISO 8601], specifically
durations without fixed endpoints. For example,
"15 days" (whose most common lexical representation
in duration is "'P15D'") is
a duration value; "15 days beginning 12 July
1995" and "15 days ending 12 July 1995" are
not. duration can provide addition and
subtraction operations between duration values and
between duration/dateTime value pairs,
and can be the result of subtracting dateTime
values. However, only addition to and subtraction from dateTime is required for XML Schema processing
and is defined in Adding durations to dateTimes (§G).
3.2.7.1 Value Space
Durations can be modeled in at least two ways: as six-property tuples (similar to
the seven-property model used for other date/time datatypes) or as two-property tuples
(somewhat similar to the alternative one-property timeOnTimeline model especially useful for
dateTime order). For
durations, it is useful to use the latter: duration values are two-property
tuples. (Note, however, that the
six-property model was implicitly used in Schema 1.0. The only effective difference to the user caused
by this change is in the canonical representations.) See
The Seven-property Model (§D.2.1) for more information on the seven-property model.
duration is partially ordered. Equality and order are defined in terms of that of
dateTime, and are determined by adding each duration value pair
in turn to the following four dateTime values:
- 1696-09-01T00:00:00Z
- 1697-02-01T00:00:00Z
- 1903-03-01T00:00:00Z
- 1903-07-01T00:00:00Z
If all four resulting dateTime value pairs are
ordered the same way (less than, equal, or greater than), then the
original pair of duration values is ordered the same way; otherwise the original pair
is incomparable.
Note: These four values are chosen so as to maximize
the possible differences in results that could occur, such as the difference when adding
P1M and P30D: 1697-02-01T00:00:00Z + P1M < 1697-02-01T00:00:00Z + P30D ,
but 1903-03-01T00:00:00Z + P1M > 1903-03-01T00:00:00Z + P30D , so
that P1M <> P30D . If two
duration values are ordered the same way
when added to each of these four
dateTime values, they will retain the same order when added
to
any other
dateTime values, unless one is within a leap-second and either the other
is also or is the beginning moment of the next second—in which case, the two results will
be equal even though the original
dateTime values were not. Therefore, two
duration values are
incomparable if and only if they can
ever result in different orders when added to
any
dateTime value not within a leap-second.
This minor anomaly is the result of having
duration unaware of leap-seconds while the
other date/time primitive datatypes are leap-second aware.
It turns out that under the definition just given, two duration
values are equal if and only if they are identical.
Note: There are many ways to implement
duration,
some of which do not base the implementation on the two-component
model. This specification does not prescribe any particular
implementation, as long as the visible results are isomorphic to those
described herein.
3.2.7.2 Lexical Space
The ·lexical representations· of duration are
more or less based on the pattern:
PnYnMnDTnHnMnS
More precisely, the ·lexical space· of duration is the set of character
strings that satisfy durationLexicalRep as defined by the following productions:
Lexical Representation Fragments
Thus, a durationLexicalRep consists of one or more of a duYearFrag,
duMonthFrag, duDayFrag, duHourFrag,
duMinuteFrag, and/or duSecondFrag, in order, with letters
'P' and 'T' (and perhaps a '-') where appropriate.
The durationLexicalRep is equivalent to this regular expression
-?P(((([0-9]+Y([0-9]+M)?)|
( ([0-9]+M) ) )(([0-9]+D(T(([0-9]+H([0-9]+M)?([0-9]+(\.[0-9]+)?S)?)|
( ([0-9]+M) ([0-9]+(\.[0-9]+)?S)?)|
( ([0-9]+(\.[0-9]+)?S) ) ))?)|
( (T(([0-9]+H([0-9]+M)?([0-9]+(\.[0-9]+)?S)?)|
( ([0-9]+M) ([0-9]+(\.[0-9]+)?S)?)|
( ([0-9]+(\.[0-9]+)?S) ) )) ) )?)|
( (([0-9]+D(T(([0-9]+H([0-9]+M)?([0-9]+(\.[0-9]+)?S)?)|
( ([0-9]+M) ([0-9]+(\.[0-9]+)?S)?)|
( ([0-9]+(\.[0-9]+)?S) ) ))?)|
( (T(([0-9]+H([0-9]+M)?([0-9]+(\.[0-9]+)?S)?)|
( ([0-9]+M) ([0-9]+(\.[0-9]+)?S)?)|
( ([0-9]+(\.[0-9]+)?S) ) )) ) ) ) )
once you delete the
whitespace. Redundant parentheses are shown as
"ghosts"; some find them helpful in reading the expression.)
3.2.8 dateTime
dateTime represents
instants of time, optionally marked
with a particular timezone. Values representing
the same instant but having
different timezones are equal but not identical.
3.2.8.1 Value Space
dateTime uses the
date/timeSevenPropertyModel, with no properties
except ·timezone·
permitted
to be absent. The ·timezone· property remains
·optional·.
Constraint: Day-of-month ValuesThe
·day· value
must be
no more than 30 if
·month·
is one of 4, 6, 9, or 11;
no more than 28
if
·month· is 2 and
·year· is not divisible 4,
or is divisible by 100 but not by 400;
and no more than 29 if
·month·
is 2 and
·year·
is divisible by 400, or by 4 but not by 100.
Constraint: Leap-second ValuesThe
·second· value
must be
less than 60 if
·timezone·
is
absent or if the remaining values
do not correspond to a dateTime at which a leap-second was introduced into
·UTC·
by the responsible authorities;
if the
hour and minute
in the specified timezone
allow a real leap-second then the value
must be less than 60 plus the number of
leap-seconds introduced on that date. (At
the time of publication of this specification, no
more than one leap-second has ever been introduced at
a timeand it appears unlikely that
this will ever happen.
No negative leap-seconds have been
introduced, but if any should be introduced in future,
"adding" that negative number will result
in a value limit of 59 or lower.)
Note: See the conformance note in
(§C) which
applies to the
·year· and
·second·
values of this datatype.
Equality and order are as prescribed
in The Seven-property Model (§D.2.1).
dateTime values are ordered
by their ·timeOnTimeline· value.
Note: Since the order of a
dateTime
value having a
·timezone·
with another value whose
·timezone· is
absent is determined
by imputing timezones of both +14:00
and –14:00 to the untimezoned value, many such
combinations will be
·incomparable· because the two imputed
timezones yield different orders.
Although
dateTime and other
types related to dates and times have only a partial order, it
is possible for datatypes derived from
dateTime to have
total orders, if they are restricted (e.g. using the
pattern facet) to the subset of values with, or
the subset of values without, timezones. Similar restrictions
on other date- and time-related types will similarly produce
totally ordered subtypes. Note, however, that
such restrictions do not affect the value shown, for a given
Simple Type Definition, in the
ordered facet.
Note: Order and equality are essentially the same for
dateTime in this version of this specification as
they were in version 1.0. However, since values
now distinguish timezones, equal
values with different
·timezone·s
are not
identical, and values with extreme
·timezone·s may no longer be equal
to any value with a smaller
·timezone·.
3.2.8.2 Lexical Mappings
The lexical representations for dateTime are as follows:
Constraint: Day-of-month RepresentationsWithin a
dateTimeLexicalRep, a
dayFrag must not
begin with the digit '
3' or be '
29'
unless the value to
which it would map would satisfy the value constraint on
·day· values
("Constraint: Day-of-month Values") given above.
Constraint: Leap-second RepresentationsWithin a
dateTimeLexicalRep, a
secondFrag must not
begin with the digit '
6' unless the value to
which it would map, in conjunction with the rest of the values,
would satisfy the value constraint on leap-second values
("Constraint: Leap-second Values") given
above. Should a negative leap-second be declared, the
secondFrag is further limited to those which would
satisfy the even-tighter value constraint on
·second·.
The dateTimeLexicalRep production
is equivalent to this regular expression
once whitespace is removed.
\-?([1-9][0-9][0-9][0-9]+)|(0[0-9][0-9][0-9])\-(0[1-9])|(1[0-2])\-(0[1-9])([12][0-9])|(3[01])
T(([01][0-9])|(2[0-3]):[0-5][0-9]:(([0-5][0-9])|(60))(.[0-9]+)?)|(24:00:00(.[0-9]+)?)
([+\-](0[0-9])|(1[0-4]):[0-5][0-9])?
Note that neither the dateTimeLexicalRep production
nor this regular
expression alone enforce the constraints on dateTimeLexicalRep given above.
The lexical mapping and canonical mapping
for dateTime are the following functions:
3.2.9 time
time
represents instants of time that recur at the same point in each
calendar day, or that occur in some arbitrary calendar day.
3.2.9.1 Value Space
time uses the date/timeSevenPropertyModel, with
·year·, ·month·,
and ·day· required
to be absent. ·timezone· remains
·optional·.
Constraint: Leap-second ValuesThe
·second· value
must be
less than 60 if
·timezone·
is
absent or if the remaining
values do not correspond to a time
at which, on some day, a leap-second has been introduced
into
·UTC· by the responsible
authorities;
if
the hour and minute
in the specified timezone
allow a real leap-second then the value
must be less than 60 plus the largest number of
leap-seconds introduced on any date. (At
the time of publication of this specification, no
more than one leap-second has ever been introduced at
a time and it appears unlikely that this will ever occur. No negative leap-seconds have been
introduced, but if any should be introduced in future,
"adding" that negative number will result
in a value limit of 59 or lower.)
Note: See the conformance note in
(§C) which
applies to the
·second· value of this datatype.
Issue (RQ-13i-time-copy):RQ-13 (time
zone crosses date line)The "seven property model" rewrite of
date/time datatype descriptions includes
a carefully crafted definition of order
that insures that for repeating datatypes (time, gDay, etc.), timezoned values
will be compared as though they are on the same "calendar day"
("local" property values) so that in any given timezone,
the days start at "local"
00:00:00 and end immediately before "local" 24:00:00.
Days in timezones other than Z do not run from 00:00:00Z to 24:00:00Z.
Equality and order are as prescribed in
The Seven-property Model (§D.2.1). time values
(points in time in an "arbitrary" day) are ordered
taking into account their ·timezone·.
A calendar ( or "local time") day with an early
timezone begins earlier than the same calendar day with a later
timezone. Since the timezones allowed spread over 28 hours,
there are timezone pairs for which a given calendar day in the two
timezones are totally disjoint—the earlier day ends before the
same day starts in the later timezone. The moments in time
represented by a single calendar day are spread over a 52-hour
interval, from the beginning of the day in the +14:00 timezone to the
end of that day in the –14:00 timezone.
Note: Since the order of a
time value
having a
·timezone·
with another value whose
·timezone·
is
absent is determined
by imputing timezones of both +14:00 and –14:00
to the untimezoned value, many such combinations will be
·incomparable· because the two imputed
timezones yield different orders. However,
for a given untimezoned value, there will
always be timezoned values at one or both
ends of the 52-hour interval that are
·comparable·
(because the interval of
·incomparability·
is only 24 hours wide).
Examples that show the difference from version 1.0 of this specification (see
Lexical Mappings (§3.2.9.2) for the notations):
- A day is a calendar (or "local
time") day in each timezone.
08:00:00+10:00 < 17:00:00+10:00
(just as 08:00:00Z has always been less than
17:00:00Z, but in version 1.0
08:00:00+10:00 > 17:00:00+10:00 )
- A time value in a calendar day with an early timezone
may precede every value in a later calendar day:00:00:00+01:00 is less than every value with
·timezone· Z
- A calendar day with a very early timezone may be completely
disjoint from a calendar day with a very late timezone:Each value with ·timezone·
+13:00 is less than every
value with ·timezone· –13:00
- time values do not always
convert to ·UTC·
in the same way as in 1.0, since a time
in a timezone may convert to
a ·UTC· time on
a different day (whereas time
conversions in version 1.0 "wrapped around"
by ignoring the day during conversion):
22:00:00Z > 03:00:00+05:00
(since 1971-12-31T03:00:00+05 is 1979-12-30T22:00:00Z,
not 1979-12-31T22:00:00Z); in the previous
version of this specification 22:00:00Z =
03:00:00+05:00 )
3.2.9.2 Lexical Mappings
The lexical representations for time
are "projections" of
those of dateTime, as follows:
Constraint: Leap-second RepresentationsAn
secondFrag must not begin with the
digit '
6' unless the value to
which it would map would satisfy the value
constraint on leap-second values given above.
The timeLexicalRep production
is equivalent to this
regular expression, once whitespace is
removed:
(([01][0-9])|(2[0-3]):[0-5][0-9]:[0-6][0-9])|(24:00:00)
(([01][0-9])|(2[0-3]):[0-5][0-9]:(([0-5][0-9])|(60))(.[0-9]+)?)|(24:00:00(.[0-9]+)?)
([+\-](0[0-9])|(1[0-4]):[0-5][0-9])?
Note that neither
the timeLexicalRep production
nor this regular
expression alone enforce the constraint
on timeLexicalRep given above.
The lexical mapping and canonical mapping
for time are the following functions:
3.2.10 date
[Definition:]
date
represents top-open intervals of exactly one day in length on the timelines of
dateTime, beginning on the beginning moment of each day (in
each timezone), up to but not including the beginning
moment of the next day). For nontimezoned values, the top-open
intervals disjointly cover the nontimezoned timeline,
one per day. For timezoned
values, the intervals begin at every minute and therefore overlap.
3.2.10.1 Value Space
date uses the date/timeSevenPropertyModel, with
·hour·, ·minute·,
and ·second· required
to be absent. ·timezone· remains
·optional·.
Constraint: Day-of-month ValuesThe
·day· value
must be
no more than 30 if
·month·
is one of 4, 6, 9, or 11, no more than 28
if
·month· is 2 and
·year· is not divisble 4,
or is divisible by 100 but not by 400,
and no more than 29 if
·month·
is 2 and
·year·
is divisible by 400, or by 4 but not by 100.
Note: See the conformance note in
(§C) which
applies to the
·year·
value of this datatype.
Equality and order are as prescribed in
The Seven-property Model (§D.2.1).
Note: In version 1.0 of this specification,
date values
did not retain a timezone explicitly, but for timezones not too far from
·UTC· their timezone could be recovered based on
their value's first moment on the timeline. The
date/timeSevenPropertyModel retains all timezones.
Examples that show the difference from version 1.0 (see
Lexical Mappings (§3.2.10.2) for the notations):
- A day is a calendar (or "local
time") day in each timezone,
including the timezones outside of +12:00 through -11:59 inclusive:2000-12-12+13:00 < 2000-12-12+11:00
(just as 2000-12-12+12:00 has always been less than
2000-12-12+11:00, but in version 1.0
2000-12-12+13:00 > 2000-12-12+11:00 ,
since 2000-12-12+13:00's "recoverable
timezone" was –11:00)
- Similarly:2000-12-12+13:00 = 2000-12-13–11:00
(whereas under 1.0, as just
stated, 2000-12-12+13:00 = 2000-12-12–11:00)
3.2.10.2 Lexical Mappings
The lexical representations for date
are "projections" of
those of dateTime, as follows:
Constraint: Day-of-month RepresentationsWithin a
dateLexicalRep,
a
dayFrag must not
begin with the digit '
3' or be '
29'
unless the value to
which it would map would satisfy the value constraint on
·day· values
("Constraint: Day-of-month Values") given above.
The dateLexicalRep production
is equivalent to this
regular expression:
\-?([1-9][0-9][0-9][0-9]+)|(0[0-9][0-9][0-9])\-(0[1-9])|(1[0-2])\-([0-2][0-9])|(3[01])((+|\-)(0[0-9]|1[0-4]):[0-5][0-9])?
Note that neither
the dateLexicalRep production
nor this regular
expression alone enforce the constraint
on dateLexicalRep given above.
The lexical mapping and canonical mapping
for date are the following functions:
3.2.11 gYearMonth
gYearMonth
represents specific whole Gregorian months in specific
Gregorian years.
Note: Because month/year combinations in one calendar only rarely correspond
to month/year combinations in other calendars, values of this type
are not, in general, convertible to simple values corresponding to month/year
combinations in other calendars. This type should therefore be used
with caution in contexts where conversion to other calendars is desired.
3.2.11.1 Value Space
gYearMonth uses the date/timeSevenPropertyModel, with
·day·, ·hour·,
·minute·, and ·second· required
to be absent. ·timezone· remains
·optional·.
Note: See the conformance note in
(§C) which
applies to the
·year· value of this datatype.
Equality and order are as prescribed in
The Seven-property Model (§D.2.1).
Note: In version 1.0 of this specification,
gYearMonth
values did not
retain a timezone explicitly, but timezones not too far from
·UTC·
could be recovered based on the
gYearMonth
value's first moment on the timeline. The
date/timeSevenPropertyModel simply retains all timezones.
An example that shows the difference from version 1.0 (see
Lexical
Mappings (§3.2.11.2) for the notations):
- A day is a calendar (or "local time") day in
each timezone, including the timezones outside of +12:00 through
–11:59 inclusive:2000-12+13:00 < 2000-12+11:00
(just as 2000-12+12:00 has always been less than 2000–12+11:00,
but in version 1.0 2000-12+13:00 >
2000-12+11:00 , since 2000–12+13:00's "recoverable
timezone" was –11:00)
3.2.11.2 Lexical
Mappings
The lexical representations for
gYearMonth are "projections" of
those of dateTime, as follows:
The gYearMonthLexicalRep is equivalent to this regular expression:
\-?([1-9][0-9][0-9][0-9]+)|(0[0-9][0-9][0-9])\-(0[1-9])|(1[0-2])((+|\-)(0[0-9]|1[0-4]):[0-5][0-9])?
The lexical mapping and canonical mapping
for gYearMonth are the following functions:
3.2.12 gYear
gYear
represents Gregorian calendar years.
Note:
Because years in one calendar only rarely correspond to years
in other calendars, values of this type
are not, in general, convertible to simple values corresponding to years
in other calendars. This type should therefore be used with caution
in contexts where conversion to other calendars is desired.
3.2.12.1 Value Space
gYear uses the date/timeSevenPropertyModel, with
·month·, ·day·, ·hour·,
·minute·, and ·second· required
to be absent. ·timezone· remains
·optional·.
Note: See the conformance note in
(§C) which
applies to the
·year· value of this datatype.
Equality and order are as prescribed in
The Seven-property Model (§D.2.1).
Note: In version 1.0 of this specification,
gYear
values did not
retain a timezone explicitly, but timezones not too far from
·UTC·
could be recovered based on the
gYear
value's first moment on the timeline. The
date/timeSevenPropertyModel simply retains all timezones.
An example that shows the difference from version 1.0 (see
Lexical
Mappings (§3.2.12.2) for the notations):
- A day is a calendar (or "local time") day in
each timezone, including the timezones outside of +12:00 through
–11:59 inclusive:2000+13:00 < 2000+11:00
(just as 2000+12:00 has always been less than 2000+11:00,
but in version 1.0 2000+13:00 >
2000+11:00 , since 2000+13:00's "recoverable
timezone" was –11:00)
3.2.12.2 Lexical
Mappings
The lexical representations for
gYear are "projections" of
those of dateTime, as follows:
The gYearLexicalRep is equivalent to this regular expression:
\-?([1-9][0-9][0-9][0-9]+)|(0[0-9][0-9][0-9])((+|\-)(0[0-9]|1[0-4]):[0-5][0-9])?
The lexical mapping and canonical mapping
for gYear are the following functions:
3.2.13 gMonthDay
gMonthDay represents whole calendar
days that recur at the same point in each calendar year, or that occur
in some arbitrary calendar year.
This datatype can be used, for example, to record
birthdays; an instance of the datatype could be used to say that
someone's birthday occurs on the 14th of September every year.
Note:
Because day/month combinations in one calendar only rarely correspond
to day/month combinations in other calendars, values of this type do not,
in general, have any straightforward or intuitive representation
in terms of most other calendars. This type should therefore be
used with caution in contexts where conversion to other calendars
is desired.
3.2.13.1 Value Space
gMonthDay uses the date/timeSevenPropertyModel, with
·year·, ·hour·, ·minute·, and ·second· required
to be absent. ·timezone· remains
·optional·.
Constraint: Day-of-month ValuesThe
·day· value
must be no more than 30 if
·month·
is one of 4, 6, 9, or 11, and no more than 29 if
·month· is 2.
Equality and order are as prescribed in
The Seven-property Model (§D.2.1).
Note: In version 1.0 of this specification,
gMonthDay values
did not retain a timezone explicitly, but for timezones not too far from
·UTC· their timezone could be recovered based on
their value's first moment on the timeline. The
date/timeSevenPropertyModel retains all timezones.
An example that shows the difference from version 1.0 (see
Lexical
Mappings (§3.2.13.2) for the notations):
- A day is a calendar (or "local time") day in each timezone,
including the timezones outside of +12:00 through –11:59 inclusive:--12-12+13:00 < --12-12+11:00
(just as --12-12+12:00 has always been less than
--12-12+11:00, but in version 1.0
--12-12+13:00 > --12-12+11:00 , since
--12-12+13:00's "recoverable
timezone" was –11:00)
3.2.13.2 Lexical
Mappings
The lexical representations for
gMonthDay are "projections"
of those of dateTime, as follows:
Constraint: Day-of-month RepresentationsWithin a
gMonthDayLexicalRep, a
dayFrag must not
begin with the digit '
3' or be '
29'
unless the value to
which it would map would satisfy the value constraint on
·day· values
("Constraint: Day-of-month Values") given above.
The gMonthDayLexicalRep is equivalent to this regular
expression:
\-\-(0[1-9])|(1[0-2])\-([0-2][0-9])|(3[01])((+|\-)(0[0-9]|1[0-4]):[0-5][0-9])?
Note that neither
the gMonthDayLexicalRep production
nor this regular
expression alone enforce the constraint
on gMonthDayLexicalRep given above.
The lexical mapping and canonical mapping
for gMonthDay are the following functions:
3.2.14 gDay
[Definition:] gDay
represents
whole days within an arbitrary month—days that recur at the same
point in each (Gregorian) month. This datatype is used to represent a specific day of the month.
To indicate, for example, that an employee gets a paycheck on the 15th of each month. (Obviously, days
beyond 28 cannot occur in all months; they are nonetheless permitted, up to 31.)
Note: Because days in one calendar only rarely
correspond to days in other calendars,
gday values do not, in general, have any straightforward or
intuitive representation in terms of most
non-Gregorian
calendars.
gday
should therefore be used with caution in contexts where conversion to
other calendars is desired.
3.2.14.1 Value Space
gDay uses the date/timeSevenPropertyModel, with
·year·, ·month·,
·hour·, ·minute·,
and ·second· required to be
absent. ·timezone· remains
·optional· and ·day·
must be between 1 and 31 inclusive.
Equality and order are as prescribed in
The Seven-property Model (§D.2.1). Since gDay
values (days) are ordered by their first moments, it is possible
for apparent anomalies to appear in the order when
·timezone· values
differ by at least 24
hours. (It is possible for ·timezone·
values to differ by up to 28 hours.)
Examples that may appear anomalous (see Lexical Mappings (§3.2.14.2) for the notations):
- ---15 < ---16 , but ---15–13:00 > ---16+13:00
- ---15–11:00 = ---16+13:00
- ---15–13:00 <> ---16 ,
because ---15–13:00 > ---16+14:00
and ---15–13:00 < 16–14:00
Note:
Timezones do not cause wrap-around at the end of the month:
the last day of a
given month in timezone –13:00 may start after the first
day of the next month in timezone +13:00, as
measured on the global timeline,
but nonetheless
---01+13:00 < ---31–13:00 .
3.2.14.2 Lexical Mappings
The lexical representations for gDay are
"projections"
of those of dateTime, as follows:
The gDayLexicalRep is equivalent to this regular expression:
\-\-\-([0-2][0-9]|3[01])((+|\-)(0[0-9]|1[0-4]):[0-5][0-9])?
The lexical mapping and canonical mapping for gDay are defined as follows:
3.2.15 gMonth
gMonth
represents whole (Gregorian) months
within an arbitrary year—months that recur at the same point in
each year. It might be used, for example, to say what
month annual Thanksgiving celebrations fall in different countries
(--11 in the United States, --10 in Canada, and possibly other months in
other countries).
Note:
Because months in one calendar only rarely correspond
to months in other calendars, values of this type do not,
in general, have any straightforward or intuitive representation
in terms of most other calendars. This type should therefore be
used with caution in contexts where conversion to other calendars
is desired.
3.2.15.1 Value Space
gMonth uses the date/timeSevenPropertyModel, with
·year·, ·day·, ·hour·, ·minute·, and ·second· required
to be absent. ·timezone· remains
·optional·.
Equality and order are as prescribed in
The Seven-property Model (§D.2.1).
Note: In version 1.0 of this specification,
gMonth values
did not retain a timezone explicitly, but for timezones not too far from
·UTC· their timezone could be recovered based on
their value's first moment on the timeline. The
date/timeSevenPropertyModel retains all timezones.
An example that shows the difference from version 1.0 (see
Lexical
Mappings (§3.2.15.2) for the notations):
- A month is a calendar (or "local time") month in each timezone,
including the timezones outside of +12:00 through –11:59 inclusive:--12+13:00 < --12+11:00
(just as --12+12:00 has always been less than --12+11:00, but in version 1.0
--12+13:00 > --12+11:00 , since --12+13:00's "recoverable
timezone" was –11:00)
3.2.15.2 Lexical
Mappings
The lexical representations for gMonth are "projections" of
those of dateTime, as follows:
The gMonthLexicalRep is equivalent to this regular expression:
\-\-(0[1-9])|(1[0-2])((+|\-)(0[0-9]|1[0-4]):[0-5][0-9])?
The lexical mapping and canonical mapping
for gMonth are defined as follows:
3.2.16 hexBinary
[Definition:]
hexBinary represents
arbitrary hex-encoded binary data. The ·value space· of
hexBinary is the set of finite-length sequences of binary
octets.
3.2.16.1 Lexical Representation
hexBinary has a lexical representation where
each binary octet is encoded as a character tuple, consisting of two
hexadecimal digits ([0-9a-fA-F]) representing the octet code. For example,
"0FB7" is a hex encoding for the 16-bit integer 4023
(whose binary representation is 111110110111).
3.2.16.2 Canonical Representation
The canonical representation for hexBinary is defined
by prohibiting certain options from the
Lexical Representation (§3.2.16.1). Specifically, the lower case
hexadecimal digits ([a-f]) are not allowed.
3.2.17 base64Binary
[Definition:]
base64Binary
represents Base64-encoded arbitrary binary data. The ·value space· of
base64Binary is the set of finite-length sequences of binary
octets. For base64Binary data the
entire binary stream is encoded using the Base64
Alphabet in
[RFC 2045].
The lexical forms of base64Binary values are limited to the 65 characters
of the Base64 Alphabet defined in [RFC 2045], i.e., a-z,
A-Z, 0-9, the plus sign (+), the forward slash (/) and the
equal sign (=), together with the characters defined in [XML] as white space.
No other characters are allowed.
For compatibility with older mail gateways, [RFC 2045] suggests that
base64 data should have lines limited to at most 76 characters in length. This
line-length limitation is not mandated in the lexical forms of base64Binary
data and must not be enforced by XML Schema processors.
The lexical space of base64Binary is given by the following grammar
(the notation is that used in [XML]); legal lexical forms must match
the Base64Binary production.
Base64Binary ::= ((B64S B64S B64S B64S)*
((B64S B64S B64S B64) |
(B64S B64S B16S '=') |
(B64S B04S '=' #x20? '=')))?
B64S ::= B64 #x20?
B16S ::= B16 #x20?
B04S ::= B04 #x20?
B04 ::= [AQgw]
B16 ::= [AEIMQUYcgkosw048]
B64 ::= [A-Za-z0-9+/]
Note that this grammar requires the number of non-whitespace characters in the lexical
form to be a multiple of four, and for equals signs to appear only at the end of the
lexical form; strings which do not meet these constraints are not legal lexical forms
of base64Binary because they cannot successfully be decoded by base64
decoders.
Note: The above definition of the lexical space is more restrictive than that
given in
[RFC 2045] as regards whitespace -- this is not an issue
in practice. Any string compatible with the RFC can occur in
an element or attribute validated by this type, because the
·whiteSpace· facet of this type is fixed
to
collapse, which means that all leading and trailing whitespace
will be stripped, and all internal whitespace collapsed to single space
characters,
before the above grammar is enforced.
The canonical lexical form of a base64Binary data value is the base64
encoding of the value which matches the Canonical-base64Binary production in the following
grammar:
Canonical-base64Binary ::= (B64
B64 B64 B64)*
((B64 B64 B16 '=') | (B64 B04 '=='))?
Note: For some values the canonical form defined above does not conform to
[RFC 2045], which requires
breaking with linefeeds at appropriate intervals.
The length of a base64Binary value is the number of octets it contains.
This may be calculated from the lexical form by removing whitespace and padding characters
and performing the calculation shown in the pseudo-code below:
lex2 := killwhitespace(lexform) -- remove whitespace characters
lex3 := strip_equals(lex2) -- strip padding characters at end
length := floor (length(lex3) * 3 / 4) -- calculate length
Note on encoding: [RFC 2045] explicitly references US-ASCII encoding. However,
decoding of base64Binary data in an XML entity is to be performed on the
Unicode characters obtained after character encoding processing as specified by
[XML]
3.2.18 anyURI
[Definition:]
anyURI represents a Uniform Resource Identifier Reference
(URI). An anyURI value can be absolute or relative, and may
have an optional fragment identifier (i.e., it may be a URI Reference). This
type should be used to specify the intention that the value fulfills
the role of a URI as defined by [RFC 2396], as amended by
[RFC 2732].
The mapping from anyURI values to URIs is as
defined by the URI reference escaping procedure
defined in
Section 5.4 Locator Attribute
of [XML Linking Language] (see also
Section 7
Character Encoding in URI References
of [Character Model]). This means
that a wide range of internationalized resource identifiers can be specified
when an anyURI is called for, and still be understood as
URIs per [RFC 2396], as amended by [RFC 2732],
where appropriate to identify resources.
Note:
Section 5.4
Locator Attribute
of
[XML Linking Language] requires that relative URI references be absolutized
as defined in
[XML Base] before use. This is an XLink-specific
requirement and is not appropriate for XML Schema, since neither the
·lexical space· nor the
·value space·
of the
anyURI type are restricted to absolute URIs. Accordingly
absolutization must not be performed by schema processors as part of schema
validation.
Note:
Each URI scheme imposes specialized syntax rules for URIs in
that scheme, including restrictions on the syntax of allowed
fragment
identifiers. Because it is
impractical for processors to check that a value is a
context-appropriate URI reference, this specification follows the
lead of
[RFC 2396] (as amended by
[RFC 2732])
in this matter: such rules and restrictions are not part of type validity
and are not checked by
·minimally conforming· processors.
Thus in practice the above definition imposes only very modest obligations
on
·minimally conforming· processors.
3.2.18.1 Lexical representation
The ·lexical space· of anyURI is
finite-length character sequences which, when the algorithm defined in
Section 5.4 of [XML Linking Language] is applied to them, result in strings
which are legal URIs according to [RFC 2396], as amended by
[RFC 2732].
Note:
Spaces are, in principle, allowed in the
·lexical space·
of
anyURI, however, their use is highly discouraged
(unless they are encoded by %20).
3.2.20 NOTATION
[Definition:]
NOTATION
represents the NOTATION attribute
type from [XML]. The ·value space·
of NOTATION is the set of QNames
of notations declared in the current schema.
The ·lexical space· of NOTATION is the set
of all names of notations
declared in the current schema (in the form of QNames).
Schema Component Constraint: enumeration facet value required for NOTATION
It is an
·error· for
NOTATION
to be used directly in a schema. Only datatypes that are
·derived· from
NOTATION by
specifying a value for
·enumeration· can be used
in a schema.
For compatibility (see Terminology (§1.5)) NOTATION
should be used only on attributes
and should only be used in schemas with no
target namespace.
3.3 Derived datatypes
This section gives conceptual definitions for all
·built-in· ·derived· datatypes
defined by this specification. The XML representation used to define
·derived· datatypes (whether
·built-in· or ·user-derived·) is
given in section XML Representation of Simple Type Definition Schema Components (§4.1.2) and the complete
definitions of the ·built-in·
·derived· datatypes are provided in Appendix A
Schema for Datatype Definitions (normative) (§A).
3.3.1 normalizedString
[Definition:]
normalizedString
represents white space normalized strings.
The ·value space· of normalizedString is the
set of strings that do not
contain the carriage return (#xD), line feed (#xA) nor tab (#x9) characters.
The ·lexical space· of normalizedString is the
set of strings that do not
contain the carriage return (#xD),
line feed (#xA)
nor tab (#x9) characters.
The ·base type· of normalizedString is string.
3.3.1.2 Derived datatypes
The following ·built-in·
datatypes are ·derived· from
normalizedString:
3.3.2 token
[Definition:]
token
represents tokenized strings.
The ·value space· of token is the
set of strings that do not
contain the
carriage return (#xD),
line feed (#xA) nor tab (#x9) characters, that have no
leading or trailing spaces (#x20) and that have no internal sequences
of two or more spaces.
The ·lexical space· of token is the
set of strings that do not contain the
carriage return (#xD),
line feed (#xA) nor tab (#x9) characters, that have no
leading or trailing spaces (#x20) and that have no internal sequences
of two or more spaces.
The ·base type· of token is normalizedString.
3.3.13 integer
[Definition:]
integer is
·derived· from decimal by fixing the
value of ·fractionDigits· to be 0 and
disallowing the trailing decimal point.
This results in the standard
mathematical concept of the integer numbers. The
·value space· of integer is the infinite
set {...,-2,-1,0,1,2,...}. The ·base type· of
integer is decimal.
3.3.13.1 Lexical representation
integer has a lexical representation consisting of a finite-length sequence
of decimal digits (#x30-#x39) with an optional leading sign. If the sign is omitted,
"+" is assumed. For example: -1, 0, 12678967543233, +100000.
3.3.13.2 Canonical representation
The canonical representation for integer is defined
by prohibiting certain options from the
Lexical representation (§3.3.13.1). Specifically, the preceding optional "+" sign is prohibited and leading zeroes are prohibited.
3.3.14 nonPositiveInteger
[Definition:]
nonPositiveInteger is ·derived· from
integer by setting the value of
·maxInclusive· to be 0. This results in the
standard mathematical concept of the non-positive integers.
The ·value space· of nonPositiveInteger
is the infinite set {...,-2,-1,0}. The ·base type·
of nonPositiveInteger is integer.
3.3.14.1 Lexical representation
nonPositiveInteger has a lexical representation consisting of
an optional preceding sign
followed by a finite-length sequence of decimal digits (#x30-#x39).
The sign may be "+" or may be omitted only for
lexical forms denoting zero; in all other lexical forms, the negative
sign ("-") must be present.
For example: -1, 0, -12678967543233, -100000.
3.3.14.2 Canonical representation
The canonical representation for nonPositiveInteger is defined
by prohibiting certain options from the
Lexical representation (§3.3.14.1).
In the canonical form for zero, the sign must be
omitted. Leading zeroes are prohibited.
3.3.14.4 Derived datatypes
The following ·built-in·
datatypes are ·derived· from
nonPositiveInteger:
3.3.15 negativeInteger
[Definition:]
negativeInteger is ·derived· from
nonPositiveInteger by setting the value of
·maxInclusive· to be -1. This results in the
standard mathematical concept of the negative integers. The
·value space· of negativeInteger
is the infinite set {...,-2,-1}. The ·base type·
of negativeInteger is nonPositiveInteger.
3.3.15.1 Lexical representation
negativeInteger has a lexical representation consisting of
a negative sign ("-") followed by a finite-length
sequence of decimal digits (#x30-#x39). For example: -1, -12678967543233, -100000.
3.3.15.2 Canonical representation
The canonical representation for negativeInteger is defined
by prohibiting certain options from the
Lexical representation (§3.3.15.1). Specifically, leading zeroes are prohibited.
3.3.16 long
[Definition:]
long is
·derived· from integer by setting the
value of ·maxInclusive· to be 9223372036854775807
and ·minInclusive· to be -9223372036854775808.
The ·base type· of long is
integer.
3.3.16.1 Lexical representation
long has a lexical representation consisting
of an optional sign followed by a finite-length
sequence of decimal digits (#x30-#x39). If the sign is omitted, "+" is assumed.
For example: -1, 0,
12678967543233, +100000.
3.3.16.2 Canonical representation
The canonical representation for long is defined
by prohibiting certain options from the
Lexical representation (§3.3.16.1). Specifically, the
the optional "+" sign is prohibited and leading zeroes are prohibited.
3.3.17 int
[Definition:]
int
is ·derived· from long by setting the
value of ·maxInclusive· to be 2147483647 and
·minInclusive· to be -2147483648. The
·base type· of int is long.
3.3.17.1 Lexical representation
int has a lexical representation consisting
of an optional sign followed by a finite-length
sequence of decimal digits (#x30-#x39). If the sign is omitted, "+" is assumed.
For example: -1, 0,
126789675, +100000.
3.3.17.2 Canonical representation
The canonical representation for int is defined
by prohibiting certain options from the
Lexical representation (§3.3.17.1). Specifically, the
the optional "+" sign is prohibited and leading zeroes are prohibited.
3.3.18 short
[Definition:]
short is
·derived· from int by setting the
value of ·maxInclusive· to be 32767 and
·minInclusive· to be -32768. The
·base type· of short is
int.
3.3.18.1 Lexical representation
short has a lexical representation consisting
of an optional sign followed by a finite-length sequence of decimal
digits (#x30-#x39). If the sign is omitted, "+" is assumed.
For example: -1, 0, 12678, +10000.
3.3.18.2 Canonical representation
The canonical representation for short is defined
by prohibiting certain options from the
Lexical representation (§3.3.18.1). Specifically, the
the optional "+" sign is prohibited and leading zeroes are prohibited.
3.3.19 byte
[Definition:]
byte
is ·derived· from short
by setting the value of ·maxInclusive· to be 127
and ·minInclusive· to be -128.
The ·base type· of byte is
short.
3.3.19.1 Lexical representation
byte has a lexical representation consisting
of an optional sign followed by a finite-length
sequence of decimal digits (#x30-#x39). If the sign is omitted, "+" is assumed.
For example: -1, 0,
126, +100.
3.3.19.2 Canonical representation
The canonical representation for byte is defined
by prohibiting certain options from the
Lexical representation (§3.3.19.1). Specifically, the
the optional "+" sign is prohibited and leading zeroes are prohibited.
3.3.20 nonNegativeInteger
[Definition:]
nonNegativeInteger is ·derived· from
integer by setting the value of
·minInclusive· to be 0. This results in the
standard mathematical concept of the non-negative integers. The
·value space· of nonNegativeInteger
is the infinite set {0,1,2,...}. The ·base type· of
nonNegativeInteger is integer.
3.3.20.1 Lexical representation
nonNegativeInteger has a lexical representation consisting of
an optional sign followed by a finite-length
sequence of decimal digits (#x30-#x39). If the sign is omitted,
the positive sign ("+") is assumed.
If the sign is present, it must be "+" except for lexical forms
denoting zero, which may be preceded by a positive ("+") or a negative ("-") sign.
For example:
1, 0, 12678967543233, +100000.
3.3.20.2 Canonical representation
The canonical representation for nonNegativeInteger is defined
by prohibiting certain options from the
Lexical representation (§3.3.20.1). Specifically, the
the optional "+" sign is prohibited and leading zeroes are prohibited.
3.3.20.4 Derived datatypes
The following ·built-in·
datatypes are ·derived· from
nonNegativeInteger:
3.3.21 unsignedLong
[Definition:]
unsignedLong is ·derived· from
nonNegativeInteger by setting the value of
·maxInclusive· to be 18446744073709551615.
The ·base type· of unsignedLong is
nonNegativeInteger.
3.3.21.1 Lexical representation
unsignedLong has a lexical representation consisting
of a finite-length sequence of decimal digits (#x30-#x39).
For example: 0,
12678967543233, 100000.
3.3.21.2 Canonical representation
The canonical representation for unsignedLong is defined
by prohibiting certain options from the
Lexical representation (§3.3.21.1). Specifically,
leading zeroes are prohibited.
3.3.22 unsignedInt
[Definition:]
unsignedInt is ·derived· from
unsignedLong by setting the value of
·maxInclusive· to be 4294967295. The
·base type· of unsignedInt is
unsignedLong.
3.3.22.1 Lexical representation
unsignedInt has a lexical representation consisting
of a finite-length
sequence of decimal digits (#x30-#x39). For example: 0,
1267896754, 100000.
3.3.22.2 Canonical representation
The canonical representation for unsignedInt is defined
by prohibiting certain options from the
Lexical representation (§3.3.22.1). Specifically,
leading zeroes are prohibited.
3.3.23 unsignedShort
[Definition:]
unsignedShort is ·derived· from
unsignedInt by setting the value of
·maxInclusive· to be 65535. The
·base type· of unsignedShort is
unsignedInt.
3.3.23.1 Lexical representation
unsignedShort has a lexical representation consisting
of a finite-length
sequence of decimal digits (#x30-#x39).
For example: 0,
12678, 10000.
3.3.23.2 Canonical representation
The canonical representation for unsignedShort is defined
by prohibiting certain options from the
Lexical representation (§3.3.23.1). Specifically, the
leading zeroes are prohibited.
3.3.23.4 Derived datatypes
The following ·built-in·
datatypes are ·derived· from
unsignedShort:
3.3.24 unsignedByte
[Definition:]
unsignedByte is ·derived· from
unsignedShort by setting the value of
·maxInclusive· to be 255. The
·base type· of unsignedByte is
unsignedShort.
3.3.24.1 Lexical representation
unsignedByte has a lexical representation consisting
of a finite-length
sequence of decimal digits (#x30-#x39).
For example: 0,
126, 100.
3.3.24.2 Canonical representation
The canonical representation for unsignedByte is defined
by prohibiting certain options from the
Lexical representation (§3.3.24.1). Specifically,
leading zeroes are prohibited.
3.3.25 positiveInteger
[Definition:]
positiveInteger is ·derived· from
nonNegativeInteger by setting the value of
·minInclusive· to be 1. This results in the standard
mathematical concept of the positive integer numbers.
The ·value space· of positiveInteger
is the infinite set {1,2,...}. The ·base type· of
positiveInteger is nonNegativeInteger.
3.3.25.1 Lexical representation
positiveInteger has a lexical representation consisting
of an optional positive sign ("+") followed by a finite-length
sequence of decimal digits (#x30-#x39).
For example: 1, 12678967543233, +100000.
3.3.25.2 Canonical representation
The canonical representation for positiveInteger is defined
by prohibiting certain options from the
Lexical representation (§3.3.25.1). Specifically, the
optional "+" sign is prohibited and leading zeroes are prohibited.