Index: H

h2ph tool : 12.14. Using h2ph to Translate C #include Files

h2xs tool

12.8. Preparing a Module for Distribution

12.15. Using h2xs to Make a Module with C Code

handles : (see filehandles)

handling signals : (see signals)

hard links : 9.0. Introduction

hashes

4.6. Extracting Unique Elements from a List

5.0. Introduction

adding elements to

5.1. Adding an Element to a Hash

10.11. Prototyping Functions

anonymous : 11.0. Introduction

of arrays : 11.2. Making Hashes of Arrays

arrays and : 5.0. Introduction

comparing for keys : 5.11. Finding Common or Different Keys in Two Hashes

deleting elements of : 5.3. Deleting from a Hash

dutree program : 5.16. Program: dutree

finding most common anything : 5.14. Finding the Most Common Anything

for list unions, intersections, differences : 4.7. Finding Elements in One Array but Not Another

inverting : 5.8. Inverting a Hash

merging : 5.10. Merging Hashes

multiple values per key : 5.7. Hashes with Multiple Values Per Key

presizing : 5.13. Presizing a Hash

printing : 5.5. Printing a Hash

reading/writing records to file : 11.10. Reading and Writing Hash Records to Text Files

references as elements : 5.12. Hashing References

references to : 11.3. Taking References to Hashes

representing data relationships : 5.15. Representing Relationships Between Data

retrieving in insertion order : 5.6. Retrieving from a Hash in Insertion Order

slices of : 4.7. Finding Elements in One Array but Not Another

sorting elements : 5.9. Sorting a Hash

testing for keys : 5.2. Testing for the Presence of a Key in a Hash

ties for (examples) : 13.15. Creating Magic Variables with tie

traversing : 5.4. Traversing a Hash

HEAD method : 19.0. Introduction

head(�) (LWP::Simple) : 20.7. Finding Stale Links

=head2 pod directive : 12.16. Documenting Your Module with Pod

headerfy program (example) : 6.6. Matching Multiple Lines

help

documentation conventions : Conventions Used in This Book

Perl references : Other Books

pod documentation for modules : 12.16. Documenting Your Module with Pod

sorting =head1 sections : 15.19. Program: tkshufflepod

web references : 19.0. Introduction

here documents : 1.0. Introduction

indenting : 1.11. Indenting Here Documents

hex(�) : 2.16. Converting Between Octal and Hexadecimal

hexadecimal numbers : 2.16. Converting Between Octal and Hexadecimal

hidden(�) : 19.12. Writing a Multiscreen CGI Script

high-resolution timers : 3.9. High-Resolution Timers

history.db file, grepping : 14.11. Program: ggh - Grep Netscape Global History

hiweb program (example) : 19.1. Writing a CGI Script

hopdelta program : 3.11. Program: hopdelta

hostname, obtaining your own : 17.8. Finding Your Own Name and Address

HotKey module : 15.8. Using POSIX termios

hours : (see date and time)

HREF fields, substitutions for : 20.15. Program: hrefsub

hrefsub program (example) : 20.15. Program: hrefsub

HTML

converting ASCII to/from : 20.4. Converting ASCII to HTML

extracting tags : 20.6. Extracting or Removing HTML Tags

extracting URLs from : 20.3. Extracting URLs

finding stale/fresh links : 20.7. Finding Stale Links

formatting, shortcuts in CGI.pm : 19.7. Formatting Lists and Tables with HTML Shortcuts

putting links around URLs : 6.21. Program: urlify

templates : 20.9. Creating HTML Templates

text substitutions : 20.14. Program: htmlsub

HTML forms : 19.0. Introduction

automating submission : 20.2. Automating Form Submission

saving/mailing : 19.13. Saving a Form to a File or Mail Pipe

sticky widgets : 19.11. Creating Sticky Widgets

HTML::Entities module : 20.4. Converting ASCII to HTML

HTML::FormatText module : 20.5. Converting HTML to ASCII

HTML::LinkExtor module : 20.3. Extracting URLs

HTML::TreeBuilder module : 20.5. Converting HTML to ASCII

htmlsub program (example) : 20.14. Program: htmlsub

HTTP methods

19.0. Introduction

19.1. Writing a CGI Script

HTTP, debugging exchanges in : 19.9. Debugging the Raw HTTP Exchange

hyperlinks : 9.0. Introduction

stale/fresh : 20.7. Finding Stale Links

Copyright © 2002 O'Reilly & Associates. All rights reserved.