📄 idx_h.htm
字号:
<html><head><title>Index: H</title></head><body bgcolor="#FFFFFF" text="#000000"><!-- START OF BODY --><!-- TOP BANNER --><p><img src="../gifs/smbanns.gif" usemap="#banner-map" border=0 alt="Book Home" ></p><map name="banner-map"><AREA SHAPE="RECT" COORDS="0,0,466,71" HREF="../index.htm" ALT="Programming Perl"><AREA SHAPE="RECT" COORDS="467,0,514,18" HREF="../jobjects/fsearch.htm" ALT="Search this book"></map><!-- TOP INDEX LINKS --><p><a href="idx_0.htm">Symbols</a>| <a href="idx_a.htm">A</a>| <a href="idx_b.htm">B</a>| <a href="idx_c.htm">C</a>| <a href="idx_d.htm">D</a>| <a href="idx_e.htm">E</a>| <a href="idx_f.htm">F</a>| <a href="idx_g.htm">G</a>| <a href="idx_h.htm">H</a>| <a href="idx_i.htm">I</a>| <a href="idx_j.htm">J</a>| <a href="idx_k.htm">K</a>| <a href="idx_l.htm">L</a>| <a href="idx_m.htm">M</a>| <a href="idx_n.htm">N</a>| <a href="idx_o.htm">O</a>| <a href="idx_p.htm">P</a>| <a href="idx_q.htm">Q</a>| <a href="idx_r.htm">R</a>| <a href="idx_s.htm">S</a>| <a href="idx_t.htm">T</a>| <a href="idx_u.htm">U</a>| <a href="idx_v.htm">V</a>| <a href="idx_w.htm">W</a>| <a href="idx_x.htm">X</a>| <a href="idx_y.htm">Y</a>| <a href="idx_z.htm">Z</a></FONT><!-- INDEX SECTION BODY --><H1>Index: H</H1><DL><a name="-h-help-command-line-switch"><dt>-h (help) command-line switch: <a href="../ch19_01.htm#INDEX-3406">19.1.3. Switches</a></dt><a name="h2xs-utility"><dt>h2xs utility: <a href="../ch21_03.htm#INDEX-3710">21.3.1. XS and XSUBs</a></dt><dd><dl> <dt><a href="../ch21_03.htm#INDEX-3719">21.3.2. Creating Extensions</a></dt><a name="h2xs"><dt>h2xs: <a href="../ch22_03.htm#INDEX-3940">22.3. Creating CPAN Modules</a></dt></dl></dd><a name="hacker"><a name="handlers"><dd><dl> <a name="overload"> <dt>overload: <a href="../ch13_01.htm#INDEX-2607">13.1. The overload Pragma</a></dt><dd><dl> <dt><a href="../ch13_02.htm#INDEX-2612">13.2. Overload Handlers</a></dt> <a name="missing"> <dt>missing: <a href="../ch13_05.htm#INDEX-2632">13.5. When an Overload Handler Is Missing (nomethod and fallback)</a></dt> </dl></dd> <a name="overloading"> <dt>overloading, <a name="as_string-handler">as_string handler: <a href="../ch13_03.htm#INDEX-">13.3. Overloadable Operators</a></dt> <a name="for-signals"> <dt>for signals: <a href="../ch16_01.htm#INDEX-2898">16.1. Signals</a></dt></dl></dd><a name="handles"><dt>handles: <a href="../ch01_02.htm#INDEX-39">1.2.1. Variable Syntax</a></dt><dd><dl> <a name="directories"> <dt>directories: <a href="../ch32_01.htm#INDEX-5502">32.1.5. Filehandle, Directory Handle, and Stream I/O Utilities</a></dt><dd><dl> </dl></dd> <a name="references-to"> <dt>references to: <a href="../ch08_02.htm#INDEX-1995">8.2.4. Handle References</a></dt> <a name="tied-base-class-definitons-for"> <dt>tied, base class definitons for: <a href="../ch32_01.htm#INDEX-5657">32.1.14. Convenient Classes</a></dt></dl></dd><a name="hard-links-filenames"><dt>hard links, filenames: <a href="../ch29_02.htm#INDEX-4973">29.2.85. link</a></dt><a name="hard-references"><dt>hard references: <a href="../ch03_02.htm#INDEX-814">3.2. The Arrow Operator</a></dt><dd><dl> <dt><a href="../ch08_01.htm#INDEX-1955">8.1. What Is a Reference?</a></dt> <dt><a href="../ch08_02.htm#INDEX-1975">8.2. Creating References</a></dt> <a name="%SIG-array"> <dt>%SIG array: <a href="../ch16_01.htm#INDEX-2896">16.1. Signals</a></dt> <a name="using"> <dt>using: <a href="../ch08_03.htm#INDEX-2006">8.3. Using Hard References</a></dt><dd><dl> <a name="closures"> <dt>closures: <a href="../ch08_03.htm#INDEX-2031">8.3.7. Closures</a></dt> </dl></dd></dl></dd><a name="hardware-devices"><a name="hardware-drivers-Perl-modules-for-interacting-with"><dt>hardware drivers, Perl modules for interacting with: <a href="../ch22_01.htm#INDEX-3814">22.1. The CPAN modules Directory</a></dt><a name="hashDepth-option-debugger"><dt>hashDepth option (debugger): <a href="../ch20_03.htm#INDEX-3620">20.3.3. Debugger Options</a></dt><a name="hashes"><dt>hashes: <a href="../ch01_02.htm#INDEX-38">1.2.1. Variable Syntax</a></dt><dd><dl> <dt><a href="../ch01_02.htm#INDEX-79">1.2.1.2. Pluralities</a></dt> <dt><a href="../ch01_02.htm#INDEX-88">1.2.1.2.2. Hashes.</a></dt> <dt><a href="../ch02_03.htm#INDEX-432">2.3. Built-in Data Types</a></dt> <dt><a href="../ch02_09.htm#INDEX-707">2.9. Hashes</a></dt> <a name="-printing-out-in-sorted-order"> <dt> printing out in sorted order: <a href="../ch04_04.htm#INDEX-1105">4.4.3. foreach Loops</a></dt> <a name="anonymous"> <dt>anonymous</dt><dd><dl> <a name="data-structure-for-objects"> <dt>data structure for objects: <a href="../ch12_07.htm#INDEX-2521">12.7. Managing Instance Data</a></dt> <a name="references-to"> <dt>references to: <a href="../ch12_04.htm#INDEX-2408">12.4. Object Construction</a></dt> </dl></dd> <a name="anonymous-references-to"> <dt>anonymous, references to: <a href="../ch08_02.htm#INDEX-1983">8.2.2.2. The anonymous hash composer</a></dt> <a name="binding-DBM-files-to"> <dt>binding DBM files to: <a href="../ch29_02.htm#INDEX-4712">29.2.22. dbmopen</a></dt> <a name="buckets"> <a name="cascading-conditionals-using-instead-of"> <dt>cascading conditionals, using instead of: <a href="../ch04_05.htm#INDEX-1158">4.5.1. Case Structures</a></dt> <a name="of-complex-records"> <dt>of complex records: <a href="../ch09_06.htm#INDEX-2167">9.6.3. Generation of a Hash of Complex Records</a></dt> <a name="deleting-values-from"> <dt>deleting values from: <a href="../ch29_02.htm#INDEX-4723">29.2.24. delete</a></dt> <a name="elements-giving-temporary-values-to"> <dt>elements, giving temporary values to: <a href="../ch29_02.htm#INDEX-4982">29.2.87. local</a></dt> <a name="exists-function-and"> <dt>exists function and: <a href="../ch29_02.htm#INDEX-4755">29.2.34. exists</a></dt> <a name="flat-lookup-tables-providing-access-to"> <dt>flat lookup tables, providing access to: <a href="../ch09_01.htm#INDEX-2077">9. Data Structures</a></dt> <a name="HV-hash-value-typedef-in-C"> <dt>HV (hash value) typedef in C: <a href="../ch21_02.htm#INDEX-3692">21.2. Internal Data Types</a></dt> <a name="%INC-for-modules"> <dt>%INC for modules: <a href="../ch11_01.htm#INDEX-2287">11.1. Using Modules</a></dt> <a name="initializing-with-x-operator"> <dt>initializing with x operator: <a href="../ch03_07.htm#INDEX-855">3.7. Multiplicative Operators</a></dt> <a name="instead-of-linear-searches"> <dt>instead of linear searches: <a href="../ch24_02.htm#INDEX-4198">24.2.1. Time Efficiency</a></dt> <a name="inverting"> <dt>inverting: <a href="../ch29_02.htm#INDEX-5170">29.2.132. reverse</a></dt> <a name="keys"> <a name="keys-finding-number-in"> <dt>keys, finding number in: <a href="../ch02_09.htm#INDEX-719">2.9. Hashes</a></dt> <a name="keys-returning-list-of"> <dt>keys, returning list of: <a href="../ch29_02.htm#INDEX-4947">29.2.79. keys</a></dt> <a name="key-value-pair-precedence"> <dt>key/value pair precedence: <a href="../ch02_09.htm#INDEX-715">2.9. Hashes</a></dt> <a name="key-value-pairs"> <dt>key/value pairs: <a href="../ch02_03.htm#INDEX-436">2.3. Built-in Data Types</a></dt><dd><dl> <dt><a href="../ch02_09.htm#INDEX-708">2.9. Hashes</a></dt> <a name="capturing-from-string-with-m--g-operator"> <dt>capturing from string with m//g operator: <a href="../ch05_02.htm#INDEX-1382">5.2.2. The m// Operator (Matching)</a></dt> </dl></dd> <a name="key-value-pairs-in"> <dt>key/value pairs in: <a href="../ch01_02.htm#INDEX-92">1.2.1.2.2. Hashes.</a></dt> <a name="multidimensional"> <dt>multidimensional: <a href="../ch09_04.htm#INDEX-2141">9.4. Hashes of Hashes</a></dt><dd><dl> <a name="accessing-and-printing"> <dt>accessing and printing: <a href="../ch09_04.htm#INDEX-2148">9.4.3. Access and Printing of a Hash of Hashes</a></dt> <a name="generation-of"> <dt>generation of: <a href="../ch09_04.htm#INDEX-2145">9.4.2. Generation of a Hash of Hashes</a></dt> </dl></dd> <a name="names-for"> <dt>names for: <a href="../ch02_04.htm#INDEX-454">2.4. Variables</a></dt> <a name="of-arrays"> <dt>of arrays: <a href="../ch09_02.htm#INDEX-2114">9.2. Hashes of Arrays</a></dt><dd><dl> <dt><a href="../ch09_03.htm#INDEX-2128">9.3. Arrays of Hashes</a></dt> <a name="access-and-printing-of"> <dt>access and printing of: <a href="../ch09_02.htm#INDEX-2119">9.2.3. Access and Printing of a Hash of Arrays</a></dt> <a name="generating"> <dt>generating: <a href="../ch09_02.htm#INDEX-2118">9.2.2. Generation of a Hash of Arrays</a></dt><dd><dl> <dt><a href="../ch09_03.htm#INDEX-2132">9.3.2. Generation of an Array of Hashes</a></dt> </dl></dd> </dl></dd> <a name="output-style-changing-in-debugger"> <dt>output style, changing in debugger: <a href="../ch20_03.htm#INDEX-3623">20.3.3. Debugger Options</a></dt> <a name="passing-by-reference-into-or-out-of-functions"> <dt>passing by reference into or out of functions: <a href="../ch06_03.htm#INDEX-1845">6.3. Passing References</a></dt> <a name="Perl-data-organization-in"> <dt>Perl data organization in: <a href="../ch09_01.htm#INDEX-2106">9.1.5. Common Mistakes</a></dt> <a name="processing-functions-for"> <dt>processing, functions for: <a href="../ch29_01.htm#INDEX-">29.1. Perl Functions by Category</a></dt> <a name="references-as-keys"> <dt>references as keys: <a href="../ch08_05.htm#INDEX-2056">8.5.1. References Don't Work as Hash Keys</a></dt> <a name="references-to"> <dt>references to: <a href="../ch08_01.htm#INDEX-1972">8.1. What Is a Reference?</a></dt>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -