summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMartin Pool <mbp@sourcefrog.net>2015-12-03 22:40:14 -0800
committerMartin Pool <mbp@sourcefrog.net>2015-12-03 22:40:14 -0800
commit4d64ae190063ac7bb76ae57708a28ec468895114 (patch)
tree77e240fc00e8cadab10171532bc05dda14aad758
parent4d42a0aa8d2fe6623a85c3faeeac4d658d2d6550 (diff)
downloadlibrsync-4d64ae190063ac7bb76ae57708a28ec468895114.tar.gz
Fix markdown syntax
-rw-r--r--TODO.md4
1 files changed, 2 insertions, 2 deletions
diff --git a/TODO.md b/TODO.md
index e9f5f58..6016def 100644
--- a/TODO.md
+++ b/TODO.md
@@ -183,7 +183,7 @@
* State-machine searching
Building a state machine from a regular expression is a brilliant
- idea. (I think `The Practice of Programming' walks through the
+ idea. (I think *The Practice of Programming* walks through the
construction of this at a fairly simple level.)
In particular, we can search for any of a large number of
@@ -298,7 +298,7 @@
* What do we need to do to compile in support for this?
- * On GNU, defining _LARGEFILE_SOURCE as we now do should be
+ * On GNU, defining `_LARGEFILE_SOURCE` as we now do should be
sufficient.
* SCO and similar things on 32-bit platforms may be more