Fix some paths

doc/tutorial.qbk

@@ -110,9 +110,9 @@ And you can now use [classref boost::hash] with book:
     assert(books.find(dandelion) == books.end());
 
 The full example can be found in:
-[@boost:/libs/container_hash/hash/examples/books.hpp /libs/container_hash/hash/examples/books.hpp]
+[@boost:/libs/container_hash/examples/books.hpp /libs/container_hash/examples/books.hpp]
 and
-[@boost:/libs/container_hash/hash/examples/books.cpp /libs/container_hash/hash/examples/books.cpp].
+[@boost:/libs/container_hash/examples/books.cpp /libs/container_hash/examples/books.cpp].
 
 [tip
 When writing a hash function, first look at how the equality function works.
@@ -170,7 +170,7 @@ of point, it can be repeatedly called for any number of elements. It calls
 [funcref boost::hash_value hash_value] on the supplied element, and combines it with the seed.
 
 Full code for this example is at
-[@boost:/libs/container_hash/hash/examples/point.cpp /libs/container_hash/hash/examples/point.cpp].
+[@boost:/libs/container_hash/examples/point.cpp /libs/container_hash/examples/point.cpp].
 
 [note
 When using [funcref boost::hash_combine] the order of the
@@ -206,7 +206,7 @@ header which forward declares [classref boost::hash],
 include the main header before instantiating [classref boost::hash]. When using
 a container that uses [classref boost::hash] it should do that for you, so your
 type will work fine with the boost hash containers. There's an example of this
-in [@boost:/libs/container_hash/hash/examples/template.hpp template.hpp] and
-[@boost:/libs/container_hash/hash/examples/template.cpp template.cpp].
+in [@boost:/libs/container_hash/examples/template.hpp template.hpp] and
+[@boost:/libs/container_hash/examples/template.cpp template.cpp].
 
 [endsect]