X-Git-Url: https://sipb.mit.edu/gitweb.cgi/ikiwiki.git/blobdiff_plain/02aab1da905f7a922a221b0d096cea995a7a55b1..8da7db51882c6400997978678df75a8407f181c8:/doc/todo/sort_parameter_for_map_plugin_and_directive.mdwn

diff --git a/doc/todo/sort_parameter_for_map_plugin_and_directive.mdwn b/doc/todo/sort_parameter_for_map_plugin_and_directive.mdwn
index 0ef8be97f..b07ea33f1 100644
--- a/doc/todo/sort_parameter_for_map_plugin_and_directive.mdwn
+++ b/doc/todo/sort_parameter_for_map_plugin_and_directive.mdwn
@@ -48,6 +48,6 @@ I may hack one in from `inline` if it seem within my skill level.
 >
 > when comparing the implementation to my notes above, you'll see that there is a minor difference in the "force" algorithm -- my code doesn't generate the "parent" entries (**c** (c/1) a b c **a** (a/1) **c** (c/2) in the example), but they're generated by the already existing output code.
 >
-> the code can be found at [[incomplete_patch]] and [[python_algorithms]]. --[[chrysn]]
+> the code can be found at [[incomplete_patch.pl.pl]] and [[python_algorithms.py]]. --[[chrysn]]
 
 [[!tag wishlist]]