home | O'Reilly's CD bookshelfs | FreeBSD | Linux | Cisco | Cisco Exam  


Book Home

Perl CookbookSearch this book

Symbols & Numbers | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

Index: R

race conditions: 19.4.3. Discussion
rad2deg( ): 2.10.3. Discussion
radians, vs. degrees: 2.10.1. Problem
radiobuttons: 15.14.3. Discussion
rand( ): 2.6.2. Solution
8.6.2. Solution
random
email signatures: 16.23. Program: sigrand
lines in files
ordering of: 8.7.1. Problem
selecting: 8.6.1. Problem
numbers: 2.. Introduction
biasing: 2.9.1. Problem
generating: 2.6.1. Problem
random-access files, updating: 8.13.1. Problem
random-access I/O: 8.12.1. Problem
randomizing arrays: 4.18.1. Problem
Range header: 20.17.2. Solution
raw I/O layer: 8.. I/O Layers
8.11.3. Discussion
read( )
fixed-length records: 8.. Advanced Operations
8.15.2. Solution
I/O layers: 8.. Advanced Operations
random-access files: 8.12.4. See Also
readdir( ): 9.5.2. Solution
globbing: 9.6.3. Discussion
reading
files (see file access file contents)
records: 7.. I/O Operations
with pattern separators: 6.7.1. Problem
Usenet messages: 18.4.1. Problem
reading and writing
determining whether data can be read or written: 17.3.2. Solution
hash records to text files: 11.10.1. Problem
RSS files: 22.9.1. Problem
records: 11.. Records
binary tree structures: 11.17. Program: Binary Trees
closures as objects: 11.7.1. Problem
comma-separated (see CSV)
constructing: 11.9.1. Problem
counting in files: 8.2.1. Problem
fixed-length: 8.. Advanced Operations
reading: 8.15.1. Problem
lastlog file: 8.26. Program: laston
random-access I/O: 8.12.1. Problem
reading: 7.. I/O Operations
with pattern separators: 6.7.1. Problem
reading and writing to text files: 11.10.1. Problem
variable-length: 8.9.1. Problem
wtmp file: 8.24. Program: tailwtmp
recursively processing files in directories: 9.7.1. Problem
recv( ), TCP, communicating over: 17.3.2. Solution
redirect( ): 19.7.3. Discussion
ref( ): 11.. References
13.. Under the Hood
references: 11.. References
anonymous data: 11.. Anonymous Data
to arrays: 11.1.1. Problem
arrays of scalar references: 11.6.1. Problem
autovivification: 11.. Anonymous Data
closures as objects: 11.7.1. Problem
to functions: 11.4.1. Problem
as hash keys: 13.15.7. Tie Example: Hash That Allows Lookups by Key or Value
as hash values: 5.13.2. Solution
to hashes: 11.3.1. Problem
hashes of arrays: 11.2.1. Problem
11.2.1. Problem
iterating over arrays by: 4.6.1. Problem
to methods: 11.8.1. Problem
to packages, indirect: 12.16.1. Problem
passing arrays and hashes by: 10.5.1. Problem
reference count: 11.. References
returning subroutines by: 10.9.1. Problem
to scalars: 11.5.1. Problem
self-referential structures: 13.13.1. Problem
symbolic: 1.12.2. Solution
12.16.2. Solution
typed: 11.. References
weak, coping with circular data structures using: 11.15.1. Problem
Regexp::Common module: 2.1.3. Discussion
6.17.3. Discussion
register_function( ): 22.7.3. Discussion
regular expressions: 6.. Introduction
backtracking: 6.. The Tricky Bits
6.16.3. Discussion
checking strings for valid numbers: 2.1.1. Problem
commas in numbers: 2.16.3. Discussion
commenting: 6.4.1. Problem
copying and substituting: 6.1.1. Problem
doubled words: 6.16.1. Problem
eager matching: 6.. The Tricky Bits
email addresses: 6.19.1. Problem
extracting ranges of lines: 6.8.1. Problem
fuzzy matching: 6.13.1. Problem
\G anchor: 6.14.3. Discussion
globbing filenames: 9.6.1. Problem
greedy vs. non-greedy matching: 6.. The Tricky Bits
6.15.1. Problem
honoring locale settings: 6.12.1. Problem
logical functionality in: 6.18.1. Problem
matching
abbreviations: 6.20.1. Problem
letters: 6.2.1. Problem
within multiple lines: 6.6.1. Problem
nested patterns: 6.17.1. Problem
Nth occurrence: 6.5.1. Problem
shell globs as: 6.9.1. Problem
from where last pattern ended: 6.14.1. Problem
words: 6.3.1. Problem
parsing HTML: 20.18.2. Solution
pattern-matching modifiers: 6.. Pattern-Matching Modifiers
Boolean connectives: 6.18.3. Discussion
progressive matching: 6.5.3. Discussion
tcgrep program: 6.22. Program: tcgrep
testing for invalid patterns: 6.11.1. Problem
urlify program: 6.21. Program: urlify
useful, list of: 6.23. Regular Expression Grab Bag
RelaxNG schema: 22.. Schemas
rename( ): 9.9.2. Solution
modifying files with temporary files: 7.15.2. Solution
rename script, example: 9.9.3. Discussion
rep program: 15.12.3. Description
report( ), processing server logs: 20.13.3. Discussion
Representational State Transfer (REST): 18.. Introduction
require operator: 10.. Introduction
12.. Modules
trapping errors in: 12.2.1. Problem
Resize( ), thumbnailing images: 15.19.3. Discussion
REST (Representational State Transfer): 18.. Introduction
restarting servers on demand: 17.18.1. Problem
retrieve( ): 11.13.2. Solution
return context, subroutines: 10.6.1. Problem
return statement: 10.10.2. Solution
return values, subroutines
returning by reference: 10.9.1. Problem
returning failure: 10.10.1. Problem
skipping selected: 10.8.1. Problem
reverse( ): 1.7.2. Solution
4.11.2. Solution
inverting hashes: 5.9.2. Solution
reversing
array elements: 4.11.1. Problem
hashes: 5.9.2. Solution
words or characters in strings: 1.7.1. Problem
revhash_demo program: 13.15.7. Tie Example: Hash That Allows Lookups by Key or Value
revnum( ): 4.15.3. Discussion
rewinddir( ): 9.5.3. Discussion
rfrm program: 18.15. Program: rfrm
Rich Site Summary (see RSS)
right angle bracket (>), file-access modes: 7.. I/O Operations
7.1.3. Discussion
rmdir( ): 9.8.3. Discussion
rmtree( ): 9.8.2. Solution
robots for Web traversal: 20.11.1. Problem
rollback( ): 14.15.2. Solution
roman( ): 2.5.3. Discussion
Roman module: 2.5.2. Solution
Roman numerals: 2.5.1. Problem
rounding floating-point numbers: 2.2.1. Problem
RSS (Rich Site Summary): 22.9.1. Problem
files, reading and writing: 22.9.1. Problem
runtime
loading modules at: 12.3.1. Problem
scoping: 10.13.3.3. Using local( ) on parts of aggregates


Symbols & Numbers | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z
Library Navigation Links

Copyright © 2003 O'Reilly & Associates, Inc. All Rights Reserved.