From 80abb5e55bad960a04e1d9793b57ebdaf81db4a2 Mon Sep 17 00:00:00 2001
From: James Clark
Every table value has, in addition to its members, a key sequence, which is used
to provide keyed access to its members. The key sequence is an ordered sequence
-of the field names. The key sequence of a table is fixed when a table is
+of field names. The key sequence of a table is fixed when a table is
constructed and cannot be changed thereafter. For each field name in the key
sequence, every member of the table must have a read-only field with that name
and the value of the field must be acyclic plain data. A table's key sequence
@@ -1573,19 +1573,19 @@ Tables
Tables
map<any|error>
-In a table-type-descriptor table<R
+In a table-type-descriptor
table<R>
key(ks)
, for each field name fi in
ks
, fi must be a required, read-only field of
-R
with a type that is a subtype of anydata. A table
-shape satisfies a key-constraint key(ks)
if its key
-sequence is ks
. A table shape satisfies a key-constraint
-key<K>
if and and only if its set of key value shapes are a
-subset of K
.
+R
with a type that is a subtype of anydata
.
+A table shape satisfies a key-constraint key(ks)
if and
+only if its key sequence is ks
. A table shape satisfies
+a key-constraint key<K>
if and and only if its set of key
+value shapes are a subset of K
.
As with other structured values, a table value has an inherent type. The -inherent type of a table value must be a table-type-descriptor that includes a -key-specifier. +inherent type of a table value must be a table-type-descriptor with a +key-constraint that is a key-specifier.
A table is iterable: the iteration sequence consists of the members of the