X-Git-Url: http://mj.ucw.cz/gitweb/?a=blobdiff_plain;ds=sidebyside;f=ucw%2Fdoc%2Flists.txt;h=68deff6dae9c22705be03eb479c4641b33a1457b;hb=1481eca416a467e9952dbc5e4852afe66eaf1256;hp=eb9f11883afb59e6cbf4c6da487fc2958d34174f;hpb=a4fe009d3366b0a3e119713b0ecc7fc0070efdfa;p=libucw.git

diff --git a/ucw/doc/lists.txt b/ucw/doc/lists.txt
index eb9f1188..68deff6d 100644
--- a/ucw/doc/lists.txt
+++ b/ucw/doc/lists.txt
@@ -10,16 +10,19 @@ Linked lists can be used very simply. We define a structure as list's handle and
 a common header in all inserted nodes. All routines then accept and return pointers
 to this handle and node headers.
 
+[[slists]]
 Single-linked lists
 -------------------
 
 !!ucw/slists.h
 
+[[clists]]
 Circular linked lists
 ---------------------
 
 !!ucw/clists.h
 
+[[simple_lists]]
 Circular linked lists of simple items
 -------------------------------------