Clarify parallelism requirements.

[pintos-anon] / doc / tour.texi

diff --git a/doc/tour.texi b/doc/tour.texi
index c0568f13f11f5e47a48a79c89519134a12179e72..f4760ec1ffd5a4cd76a2d1830814ead39e5f1a2c 100644 (file)
--- a/doc/tour.texi
+++ b/doc/tour.texi
@@ -1283,12 +1283,12 @@ The block allocator may not be called from interrupt context.
 @node User Programs Tour
 @section User Programs Project
 
-The tour for this project has not yet been written.
+No tour for this project is available.
 
 @node Virtual Memory Tour
 @section Virtual Memory Project
 
-The tour for this project is under construction.
+Only some parts of the tour for this project are available.
 
 @menu
 * Hash Table::                  
@@ -1400,6 +1400,7 @@ If your key is a single piece of data of an appropriate type, it is
 sensible for your hash function to directly return the output of one of
 these functions.  For multiple pieces of data, you may wish to combine
 the output of more than one call to them using, e.g., the @samp{^}
+(exclusive or)
 operator.  Finally, you may entirely ignore these functions and write
 your own hash function from scratch, but remember that your goal is to
 build an operating system kernel, not to design a hash function.
@@ -1717,5 +1718,4 @@ how it is designed and organized, as with any other data structure.
 @node File Systems Tour
 @section File Systems Project
 
-The tour for this project has not yet been written.
-
+No tour for this project is available.