From 29884011ec83f6ff07fe6bca5e792835dc944567 Mon Sep 17 00:00:00 2001 From: David Nadlinger Date: Wed, 6 Apr 2011 12:36:33 +0200 Subject: [PATCH] Unified style of references in algorithm cheat sheet. --- std/algorithm.d | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/std/algorithm.d b/std/algorithm.d index 65258262d6d..311b80ab4b5 100644 --- a/std/algorithm.d +++ b/std/algorithm.d @@ -75,11 +75,11 @@ $(TR $(TH Function Name) $(TH Description) ) $(LEADINGROW Searching ) -$(TR $(TDNW $(MYREF balancedParens)) $(TD $(D +$(TR $(TDNW $(LREF balancedParens)) $(TD $(D balancedParens("((1 + 1) / 2)")) returns $(D true) because the string has balanced parentheses.) ) -$(TR $(TDNW $(MYREF boyerMooreFinder)) $(TD $(D find("hello +$(TR $(TDNW $(LREF boyerMooreFinder)) $(TD $(D find("hello world", boyerMooreFinder("or"))) returns $(D "orld") using the $(LUCKY Boyer-Moore _algorithm).) ) @@ -97,7 +97,7 @@ example, $(D countUntil("hello!", "o")) returns $(D 4).) $(TR $(TDNW $(LREF endsWith)) $(TD $(D endsWith("rocks", "ks")) returns $(D true).) ) -$(TR $(TD $(MYREF find)) $(TD $(D find("hello world", +$(TR $(TD $(LREF find)) $(TD $(D find("hello world", "or")) returns $(D "orld") using linear search.) ) $(TR $(TDNW $(LREF findAdjacent)) $(TD $(D findAdjacent([1, 2,