aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorchrysn <chrysn@web>2012-03-15 21:38:59 -0400
committeradmin <admin@branchable.com>2012-03-15 21:38:59 -0400
commitcc3afb84505657d014dd6f805aefee4a9a9cadb5 (patch)
tree570dcbcf208ed0c96eb338cd6d86d198a76a80ed
parent128234cde1ed0504d6beb0b2d10544feb2d77809 (diff)
downloadikiwiki-cc3afb84505657d014dd6f805aefee4a9a9cadb5.tar
ikiwiki-cc3afb84505657d014dd6f805aefee4a9a9cadb5.tar.gz
(fixed links that were broken due to missing extensions)
-rw-r--r--doc/todo/sort_parameter_for_map_plugin_and_directive.mdwn2
1 files changed, 1 insertions, 1 deletions
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]]