Merge pull request #2907 from aG0aep6G/quickindex

[DDoc] add HTML class "quickindex" to manually maintained jump link tables

std/algorithm/package.d

@@ -6,10 +6,11 @@ sequences. Sequences processed by these functions define range-based
 interfaces.  See also $(LINK2 std_range.html, Reference on ranges) and
 $(WEB ddili.org/ders/d.en/ranges.html, tutorial on ranges).
 
-<script type="text/javascript">inhibitQuickIndex = 1</script>
+$(SCRIPT inhibitQuickIndex = 1;)
 
 Algorithms are categorized into the following submodules:
 
+$(DIVC quickindex,
 $(BOOKTABLE ,
 $(TR $(TH Category) $(TH Submodule) $(TH Functions)
 )
@@ -132,6 +133,7 @@ $(TR $(TDNW Utility)
     $(TD $(MYREF forward)
     )
 ))
+)
 
 Many functions in this package are parameterized with a function or a
 $(GLOSSARY predicate). The predicate may be passed either as a

std/digest/crc.d

@@ -1,8 +1,9 @@
 /**
 Cyclic Redundancy Check (32-bit) implementation.
 
-<script type="text/javascript">inhibitQuickIndex = 1</script>
+$(SCRIPT inhibitQuickIndex = 1;)
 
+$(DIVC quickindex,
 $(BOOKTABLE ,
 $(TR $(TH Category) $(TH Functions)
 )
@@ -13,6 +14,7 @@ $(TR $(TDNW OOP API) $(TD $(MYREF CRC32Digest))
 )
 $(TR $(TDNW Helpers) $(TD $(MYREF crcHexString) $(MYREF crc32Of))
 )
+)
 )
 
  *

std/digest/digest.d

@@ -2,8 +2,9 @@
  * This module describes the digest APIs used in Phobos. All digests follow these APIs.
  * Additionally, this module contains useful helper methods which can be used with every _digest type.
  *
-<script type="text/javascript">inhibitQuickIndex = 1</script>
+$(SCRIPT inhibitQuickIndex = 1;)
 
+$(DIVC quickindex,
 $(BOOKTABLE ,
 $(TR $(TH Category) $(TH Functions)
 )
@@ -18,6 +19,7 @@ $(TR $(TDNW Helper functions) $(TD $(MYREF toHexString))
 )
 $(TR $(TDNW Implementation helpers) $(TD $(MYREF digestLength) $(MYREF WrapperDigest))
 )
+)
 )
 
  * APIs:

std/digest/md.d

@@ -2,8 +2,9 @@
  * Computes MD5 hashes of arbitrary data. MD5 hashes are 16 byte quantities that are like a
  * checksum or CRC, but are more robust.
  *
-<script type="text/javascript">inhibitQuickIndex = 1</script>
+$(SCRIPT inhibitQuickIndex = 1;)
 
+$(DIVC quickindex,
 $(BOOKTABLE ,
 $(TR $(TH Category) $(TH Functions)
 )
@@ -14,6 +15,7 @@ $(TR $(TDNW OOP API) $(TD $(MYREF MD5Digest))
 )
 $(TR $(TDNW Helpers) $(TD $(MYREF md5Of))
 )
+)
 )
 
  * This module conforms to the APIs defined in $(D std.digest.digest). To understand the

std/digest/ripemd.d

@@ -2,8 +2,9 @@
  * Computes RIPEMD-160 hashes of arbitrary data. RIPEMD-160 hashes are 20 byte quantities
  * that are like a checksum or CRC, but are more robust.
  *
-<script type="text/javascript">inhibitQuickIndex = 1</script>
+$(SCRIPT inhibitQuickIndex = 1;)
 
+$(DIVC quickindex,
 $(BOOKTABLE ,
 $(TR $(TH Category) $(TH Functions)
 )
@@ -14,6 +15,7 @@ $(TR $(TDNW OOP API) $(TD $(MYREF RIPEMD160Digest))
 )
 $(TR $(TDNW Helpers) $(TD $(MYREF ripemd160Of))
 )
+)
 )
 
  * This module conforms to the APIs defined in $(D std.digest.digest). To understand the

std/digest/sha.d

@@ -4,8 +4,9 @@
  * quantities (depending on the SHA algorithm) that are like a checksum or CRC,
  * but are more robust.
  *
-<script type="text/javascript">inhibitQuickIndex = 1</script>
+$(SCRIPT inhibitQuickIndex = 1;)
 
+$(DIVC quickindex,
 $(BOOKTABLE ,
 $(TR $(TH Category) $(TH Functions)
 )
@@ -16,6 +17,7 @@ $(TR $(TDNW OOP API) $(TD $(MYREF SHA1Digest))
 )
 $(TR $(TDNW Helpers) $(TD $(MYREF sha1Of))
 )
+)
 )
 
  * SHA2 comes in several different versions, all supported by this module:

std/math.d

@@ -7,6 +7,7 @@
  *
 $(SCRIPT inhibitQuickIndex = 1;)
 
+$(DIVC quickindex,
 $(BOOKTABLE ,
 $(TR $(TH Category) $(TH Members) )
 $(TR $(TDNW Constants) $(TD
@@ -52,6 +53,7 @@ $(TR $(TDNW Complex Numbers) $(TD
 $(TR $(TDNW Hardware Control) $(TD
     $(MYREF IeeeFlags) $(MYREF FloatingPointControl)
 ))
+)
 )
 
  * The functionality closely follows the IEEE754-2008 standard for

std/net/curl.d

@@ -5,8 +5,9 @@ Networking client functionality as provided by $(WEB _curl.haxx.se/libcurl,
 libcurl). The libcurl library must be installed on the system in order to use
 this module.
 
-<script type="text/javascript">inhibitQuickIndex = 1</script>
+$(SCRIPT inhibitQuickIndex = 1;)
 
+$(DIVC quickindex,
 $(BOOKTABLE ,
 $(TR $(TH Category) $(TH Functions)
 )
@@ -19,6 +20,7 @@ $(TR $(TDNW Low level) $(TD $(MYREF HTTP) $(MYREF FTP) $(MYREF
 SMTP) )
 )
 )
+)
 
 Note:
 You may need to link to the $(B curl) library, e.g. by adding $(D "libs": ["curl"]) 

std/string.d

@@ -6,6 +6,7 @@ $(D std.algorithm) because all D strings are bidirectional ranges.
 
 $(SCRIPT inhibitQuickIndex = 1;)
 
+$(DIVC quickindex,
 $(BOOKTABLE ,
 $(TR $(TH Category) $(TH Functions) )
 $(TR $(TDNW Searching)
@@ -53,6 +54,7 @@ $(TR $(TDNW Miscellaneous)
     )
 )
 )
+)
 
 Objects of types $(D _string), $(D wstring), and $(D dstring) are value types
 and cannot be mutated element-by-element. For using mutation during building

std/traits.d

@@ -3,8 +3,9 @@
 /**
  * Templates which extract information about types and symbols at compile time.
  *
- * <script type="text/javascript">inhibitQuickIndex = 1</script>
+ * $(SCRIPT inhibitQuickIndex = 1;)
  *
+ * $(DIVC quickindex,
  * $(BOOKTABLE ,
  * $(TR $(TH Category) $(TH Templates))
  * $(TR $(TD Symbol Name _traits) $(TD
@@ -125,6 +126,7 @@
  *           $(LREF select)
  * ))
  * )
+ * )
  *
  * Macros:
  *  WIKI = Phobos/StdTraits

std/uuid.d

@@ -6,8 +6,9 @@
  * used to tag objects with very short lifetimes, or to reliably identify very
  * persistent objects across a network.
  *
-<script type="text/javascript">inhibitQuickIndex = 1</script>
+$(SCRIPT inhibitQuickIndex = 1;)
 
+$(DIVC quickindex,
 $(BOOKTABLE ,
 $(TR $(TH Category) $(TH Functions)
 )
@@ -24,6 +25,7 @@ $(MYREF2 UUID.opEquals, opEquals) $(MYREF2 UUID.opCmp, opCmp) $(MYREF2 UUID.toHa
 $(TR $(TDNW UUID namespaces) $(TD $(MYREF dnsNamespace) $(MYREF urlNamespace)
 $(MYREF oidNamespace) $(MYREF x500Namespace) )
 )
+)
 )
 
  * UUIDs have many applications. Some examples follow: Databases may use UUIDs to identify