From 607816519d9aca8a1aa4ee7d82364a32f7cdd9b7 Mon Sep 17 00:00:00 2001
From: robocop <robocop@users.sourceforge.net>
Date: Tue, 25 Jan 2005 06:24:30 +0000
Subject: [PATCH] Minor fixes.

---
 doc/sql.extensions/README.plan                | 8 ++++----
 doc/sql.extensions/README.sequence_generators | 2 +-
 2 files changed, 5 insertions(+), 5 deletions(-)

diff --git a/doc/sql.extensions/README.plan b/doc/sql.extensions/README.plan
index 5648825ccc..7c9129e8ff 100644
--- a/doc/sql.extensions/README.plan
+++ b/doc/sql.extensions/README.plan
@@ -14,11 +14,11 @@ PLAN clause
     <indexed_retrieval> ::= <stream_alias> INDEX ( <index_name> [, <index_name> ...] )
     <navigational_scan> ::= <stream_alias> ORDER <index_name> [ INDEX ( <index_name> [, <index_name> ...] ) ]
 
+    <sorted_streams> ::= SORT ( <stream_retrieval> )
+
     <joined_streams> ::= JOIN ( <stream_retrieval>, <stream_retrieval> [, <stream_retrieval> ...] )
     	| [SORT] MERGE ( <sorted_streams>, <sorted_streams> )
 
-    <sorted_streams> ::= SORT ( <stream_retrieval> )
-
   Description:
     Natural scan means that all rows are fetched in their natural storage order,
     which requires to read all pages and validate any search criteria afterward.
@@ -37,6 +37,8 @@ PLAN clause
     Then a data page is read and required row is fetched. Note that navigational scan produces
     random page I/O as reads are not optimized.
     
+    A sort operation performs an external sort of the given stream retrieval.
+
     A join can be performed either via the nested loops algorithm (JOIN plan) or via
     the sort merge algorithm (MERGE plan). An inner nested loop join may contain as many
     streams as required to be joined (as all of them are equivalent), whilst an outer
@@ -44,8 +46,6 @@ PLAN clause
     nested JOIN clauses in the case of 3 or more outer streams joined. A sort merge operates
     with two input streams which are sorted beforehand, then they're merged in a single run.
 
-    A sort operation performs an external sort of the given stream retrieval.
-
   Example(s):
     SELECT RDB$RELATION_NAME
     FROM RDB$RELATIONS
diff --git a/doc/sql.extensions/README.sequence_generators b/doc/sql.extensions/README.sequence_generators
index c3950c8fe4..6b2023f60c 100644
--- a/doc/sql.extensions/README.sequence_generators
+++ b/doc/sql.extensions/README.sequence_generators
@@ -11,7 +11,7 @@ Sequence generators
     CREATE { SEQUENCE | GENERATOR } <name>
     DROP { SEQUENCE | GENERATOR } <name>
     SET GENERATOR <name> TO <start_value>
-    ALTER SEQUENCE RESTART WITH <start_value>
+    ALTER SEQUENCE <name> RESTART WITH <start_value>
     GEN_ID (<name>, <increment_value>)
     NEXT VALUE FOR <name>