From 506c00809231f7ab7413314bbfe7c2ce016f046b Mon Sep 17 00:00:00 2001 From: Robert Griesemer Date: Tue, 8 Sep 2009 15:41:14 -0700 Subject: [PATCH] cosmetic changes: - fixed a couple of broken links - changed some explicit section references into implicit ones R=r DELTA=27 (0 added, 2 deleted, 25 changed) OCL=34461 CL=34461 --- doc/go_spec.html | 52 +++++++++++++++++++++++------------------------- 1 file changed, 25 insertions(+), 27 deletions(-) diff --git a/doc/go_spec.html b/doc/go_spec.html index 950ffbd915..6ad96493bb 100644 --- a/doc/go_spec.html +++ b/doc/go_spec.html @@ -1314,9 +1314,9 @@ the entity declared by the inner declaration.

-The package clause (§Package clause) is not a declaration; the package name +The package clause is not a declaration; the package name does not appear in any scope. Its purpose is to identify the files belonging -to the same package (§Packages) and to specify the default name for import +to the same package and to specify the default name for import declarations.

@@ -1324,7 +1324,7 @@ declarations.

Label scopes

-Labels are declared by labeled statements (§Labeled statements) and are +Labels are declared by labeled statements and are used in the break, continue, and goto statements (§Break statements, §Continue statements, §Goto statements). In contrast to other identifiers, labels are not block scoped and do @@ -1376,10 +1376,10 @@ All other identifiers are not exported.

A constant declaration binds a list of identifiers (the names of -the constants) to the values of a list of constant expressions -(§Constant expressions). The number of identifiers must be equal -to the number of expressions, and the nth identifier on -the left is bound to value of the nth expression on the +the constants) to the values of a list of constant expressions. +The number of identifiers must be equal +to the number of expressions, and the nth identifier on +the left is bound to the value of the nth expression on the right.

@@ -1395,8 +1395,8 @@ ExpressionList = Expression { "," Expression } .

If the type is omitted, the constants take the individual types of the corresponding expressions, which may be -ideal integer or ideal float (§Ideal number). If the type -is present, all constants take the type specified, and the types +an ideal number or ideal string. +If the type is present, all constants take the type specified, and the types of all the expressions must be assignment-compatible with that type.

@@ -1420,8 +1420,8 @@ first preceding non-empty expression list, and its type if any. Omitting the list of expressions is therefore equivalent to repeating the previous list. The number of identifiers must be equal to the number of expressions in the previous list. -Together with the iota constant generator -(§Iota) this mechanism permits light-weight declaration of sequential values: +Together with the iota constant generator +this mechanism permits light-weight declaration of sequential values: 

@@ -1547,8 +1547,7 @@ var (
 

 If a list of expressions is given, the variables are initialized
 by assigning those expressions to the variables (§Assignments).
-Otherwise, each variable is initialized to its zero value
-(§The zero value).
+Otherwise, each variable is initialized to its zero value.
 

 
 

@@ -2118,8 +2117,8 @@ rules apply:
 
 

 For a of type A or *A
-where A is an array type (§Array types),
-or for a of type S where S is a slice type (§Slice types):
+where A is an array type,
+or for a of type S where S is a slice type:

-The following assignment statements (§Assignments) are semantically +The following assignment statements are semantically equivalent:

@@ -3125,8 +3123,8 @@ a[i] <<= 2 A tuple assignment assigns the individual elements of a multi-valued operation to a list of variables. There are two forms. In the first, the right hand operand is a single multi-valued expression -such as a function evaluation or channel or map operation (§Channel -operations, §Map operations) or a type assertion (§Type assertions). +such as a function evaluation or channel or +map operation or a type assertion. The number of operands on the left hand side must match the number of values. For instance, If f is a function returning two values,