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: N

-n command-line option, writing filters: 7.14.3.2. Command-line options

Nagle Algorithm: 17.3.3. Discussion

name-value pairs, passing subroutines by named parameter: 10.7.3. Discussion

named pipes: 16.11.1. Problem

sigrand program: 16.23. Program: sigrand

names of current subroutines. determining: 10.4.1. Problem

namespaces, XML: 22.. Namespaces

natural logarithms: 2.12.2. Solution

navigating Web with robots: 20.11.1. Problem

NDBM files: 14.. Introduction

nested

elements, XML: 22.. Namespaces

HTML tags: 20.6.3. Discussion

pattern matching: 6.17.1. Problem

subroutines: 10.16.1. Problem

Net::DNS module: 18.1.3. Discussion

18.16. Program: expn and vrfy

Net::FTP module: 18.2.2. Solution

Net::hostent module: 13.5.3. Discussion

Net::LDAP module: 18.8.2. Solution

netlock program: 7.24. Program: netlock

Net::NNTP module: 18.4.2. Solution

Net::Ping module: 18.7.2. Solution

Net::POP3 module: 18.5.2. Solution

Netscape history.db file: 14.19. Program: ggh—Grep Netscape Global History

Net::SMTP module: 18.9.3. Discussion

expn and vrfy programs: 18.16. Program: expn and vrfy

Net::Telnet module: 18.6.2. Solution

new( ): 7.22.3. Discussion

new_from_fd( ): 7.9.2. Solution

newlines (see line breaks whitespace)

NFA (non-deterministic finite automata): 6.. The Tricky Bits

NFC( ): 1.9.3. Discussion

NFD( ): 1.9.2. Solution

NFKC( ): 1.9.3. Discussion

NFKD( ): 1.9.3. Discussion

noecho input mode: 15.10.2. Solution

NOFILE constant: 7.7.3. Discussion

non-blocking I/O: 7.20.1. Problem

non-deterministic finite automata (NFA): 6.. The Tricky Bits

non-greedy pattern matching: 6.. The Tricky Bits

vs. greedy pattern matching: 6.15.1. Problem

non-numeric strings, converting to numbers: 2.. Introduction

NOT functionality in regular expressions: 6.18.1. Problem

notes, Apache requests: 21.11.3. Discussion

nounder_demo program: 13.15.4. Tie Example: Outlaw $_

n2perm( ): 4.20. Program: permute

nstore( ): 11.13.3. Discussion

numbers: 1.4.1. Problem

2.. Introduction

adding commas to: 2.16.1. Problem

complex (imaginary): 2.14.1. Problem

converting between characters and values: 1.4.1. Problem

converting binary, octal, and hexadecimal: 2.15.1. Problem

decimal places, controlling: 13.14.5. Example: Overloaded FixNum Class

floating-point: 2.. Introduction

comparing: 2.3.1. Problem

rounding: 2.2.1. Problem

logarithms: 2.12.1. Problem

matrix multiplication: 2.13.1. Problem

operating on integer series: 2.4.1. Problem

plural words based on: 2.17.1. Problem

primes, calculating: 2.18. Program: Calculating Prime Factors

random: 2.. Introduction

biasing: 2.9.1. Problem

generating: 2.6.1. Problem

Roman numerals: 2.5.1. Problem

scalars as: 2.. Introduction

strings as valid numbers: 2.1.1. Problem

trigonometry: 2.10.1. Problem

numerical comparison (<=>) operator: 4.15.2. Solution

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