Programming: Principles and Practice Using C++ ,

Second Edition Stroustrup download

https://textbookfull.com/product/programming-principles-and-
practice-using-c-second-edition-stroustrup/

Download full version ebook from https://textbookfull.com

We believe these products will be a great fit for you. Click
the link to download now, or visit textbookfull.com
to discover even more!

Programming Principles and Practice Using C 3rd

Edition Stroustrup

https://textbookfull.com/product/programming-principles-and-
practice-using-c-3rd-edition-stroustrup/

Programming Principles and Practice Using C Third

Edition Bjarne Stroustrup

https://textbookfull.com/product/programming-principles-and-
practice-using-c-third-edition-bjarne-stroustrup/

Primary Mathematics Textbook 2B Jennifer Hoerst

https://textbookfull.com/product/primary-mathematics-
textbook-2b-jennifer-hoerst/

Handbook of Macroeconomics, Volume 2A-2B SET 1st

Edition John B. Taylor

https://textbookfull.com/product/handbook-of-macroeconomics-
volume-2a-2b-set-1st-edition-john-b-taylor/
A Tour of C++ Stroustrup

https://textbookfull.com/product/a-tour-of-c-stroustrup/

A Tour of C++ Stroustrup

https://textbookfull.com/product/a-tour-of-c-stroustrup-2/

Biota Grow 2C gather 2C cook Loucas

https://textbookfull.com/product/biota-grow-2c-gather-2c-cook-
loucas/

A Tour of C 3rd Edition Stroustrup B.

https://textbookfull.com/product/a-tour-of-c-3rd-edition-
stroustrup-b/

Tour of C A C In Depth Series 3rd Edition Stroustrup

https://textbookfull.com/product/tour-of-c-a-c-in-depth-
series-3rd-edition-stroustrup/
About This eBook

ePUB is an open, industry-standard format for eBooks. However,

support of ePUB and its many features varies across reading devices
and applications. Use your device or app settings to customize the
presentation to your liking. Settings that you can customize often
include font, font size, single or double column, landscape or portrait
mode, and figures that you can click or tap to enlarge. For additional
information about the settings and features on your reading device
or app, visit the device manufacturer’s Web site.
Many titles include programming code or configuration examples.
To optimize the presentation of these elements, view the eBook in
single-column, landscape mode and adjust the font size to the
smallest setting. In addition to presenting code and configurations in
the reflowable text format, we have included images of the code
that mimic the presentation found in the print book; therefore,
where the reflowable format may compromise the presentation of
the code listing, you will see a “Click here to view code image” link.
Click the link to view the print-fidelity code image. To return to the
previous page viewed, click the Back button on your device or app.
Programming: Principles and
Practice Using C++
Second Edition

Bjarne Stroustrup

Upper Saddle River, NJ • Boston • Indianapolis • San Francisco

New York • Toronto • Montreal • London • Munich • Paris • Madrid
Capetown • Sydney • Tokyo • Singapore • Mexico City
Many of the designations used by manufacturers and sellers to
distinguish their products are claimed as trademarks. Where those
designations appear in this book, and the publisher was aware of a
trademark claim, the designations have been printed with initial
capital letters or in all capitals.
A complete list of photo sources and credits appears on pages 1273–
1274.
The author and publisher have taken care in the preparation of this
book, but make no expressed or implied warranty of any kind and
assume no responsibility for errors or omissions. No liability is
assumed for incidental or consequential damages in connection with
or arising out of the use of the information or programs contained
herein.
For information about buying this title in bulk quantities, or for
special sales opportunities (which may include electronic versions;
custom cover designs; and content particular to your business,
training goals, marketing focus, or branding interests), please
contact our corporate sales department at
[email protected] or (800) 382-3419.
For government sales inquiries, please contact
[email protected].
For questions about sales outside the United States, please contact
[email protected].
Visit us on the Web: informit.com/aw
Library of Congress Cataloging-in-Publication Data
Stroustrup, Bjarne, author.
Programming : principles and practice using C++ / Bjarne
Stroustrup. — Second edition.
pages cm
Includes bibliographical references and index.
ISBN 978-0-321-99278-9 (pbk. : alk. paper)
1. C++ (Computer program language) I. Title.
 QA76.73.C153S82 2014
005.13'3—dc23

2014004197
Copyright © 2014 Pearson Education, Inc.
All rights reserved. Printed in the United States of America. This
publication is protected by copyright, and permission must be
obtained from the publisher prior to any prohibited reproduction,
storage in a retrieval system, or transmission in any form or by any
means, electronic, mechanical, photocopying, recording, or likewise.
To obtain permission to use material from this work, please submit a
written request to Pearson Education, Inc., Permissions Department,
One Lake Street, Upper Saddle River, New Jersey 07458, or you may
fax your request to (201) 236-3290.
ISBN-13: 978-0-321-99278-9
ISBN-10: 0-321-99278-4
Text printed in the United States on recycled paper at RR Donnelley
in Crawfordsville, Indiana.
First printing, May 2014
Contents

Preface
Chapter 0 Notes to the Reader
0.1 The structure of this book
0.1.1 General approach
0.1.2 Drills, exercises, etc.
0.1.3 What comes after this book?
0.2 A philosophy of teaching and learning
0.2.1 The order of topics
0.2.2 Programming and programming language
0.2.3 Portability
0.3 Programming and computer science
0.4 Creativity and problem solving
0.5 Request for feedback
0.6 References
0.7 Biographies
Bjarne Stroustrup
Lawrence “Pete” Petersen
Chapter 1 Computers, People, and Programming
1.1 Introduction
1.2 Software
1.3 People
1.4 Computer science
1.5 Computers are everywhere
1.5.1 Screens and no screens
1.5.2 Shipping
1.5.3 Telecommunications
 1.5.4 Medicine
1.5.5 Information
1.5.6 A vertical view
1.5.7 So what?
1.6 Ideals for programmers

Part I The Basics

Chapter 2 Hello, World!
2.1 Programs
2.2 The classic first program
2.3 Compilation
2.4 Linking
2.5 Programming environments
Chapter 3 Objects, Types, and Values
3.1 Input
3.2 Variables
3.3 Input and type
3.4 Operations and operators
3.5 Assignment and initialization
3.5.1 An example: detect repeated words
3.6 Composite assignment operators
3.6.1 An example: find repeated words
3.7 Names
3.8 Types and objects
3.9 Type safety
3.9.1 Safe conversions
3.9.2 Unsafe conversions
Chapter 4 Computation
 4.1 Computation
4.2 Objectives and tools
4.3 Expressions
4.3.1 Constant expressions
4.3.2 Operators
4.3.3 Conversions
4.4 Statements
4.4.1 Selection
4.4.2 Iteration
4.5 Functions
4.5.1 Why bother with functions?
4.5.2 Function declarations
4.6 vector
4.6.1 Traversing a vector
4.6.2 Growing a vector
4.6.3 A numeric example
4.6.4 A text example
4.7 Language features
Chapter 5 Errors
5.1 Introduction
5.2 Sources of errors
5.3 Compile-time errors
5.3.1 Syntax errors
5.3.2 Type errors
5.3.3 Non-errors
5.4 Link-time errors
5.5 Run-time errors
5.5.1 The caller deals with errors
 5.5.2 The callee deals with errors
5.5.3 Error reporting
5.6 Exceptions
5.6.1 Bad arguments
5.6.2 Range errors
5.6.3 Bad input
5.6.4 Narrowing errors
5.7 Logic errors
5.8 Estimation
5.9 Debugging
5.9.1 Practical debug advice
5.10 Pre- and post-conditions
5.10.1 Post-conditions
5.11 Testing
Chapter 6 Writing a Program
6.1 A problem
6.2 Thinking about the problem
6.2.1 Stages of development
6.2.2 Strategy
6.3 Back to the calculator!
6.3.1 First attempt
6.3.2 Tokens
6.3.3 Implementing tokens
6.3.4 Using tokens
6.3.5 Back to the drawing board
6.4 Grammars
6.4.1 A detour: English grammar
6.4.2 Writing a grammar
 6.5 Turning a grammar into code
6.5.1 Implementing grammar rules
6.5.2 Expressions
6.5.3 Terms
6.5.4 Primary expressions
6.6 Trying the first version
6.7 Trying the second version
6.8 Token streams
6.8.1 Implementing Token_stream
6.8.2 Reading tokens
6.8.3 Reading numbers
6.9 Program structure
Chapter 7 Completing a Program
7.1 Introduction
7.2 Input and output
7.3 Error handling
7.4 Negative numbers
7.5 Remainder: %
7.6 Cleaning up the code
7.6.1 Symbolic constants
7.6.2 Use of functions
7.6.3 Code layout
7.6.4 Commenting
7.7 Recovering from errors
7.8 Variables
7.8.1 Variables and definitions
7.8.2 Introducing names
7.8.3 Predefined names
 7.8.4 Are we there yet?
Chapter 8 Technicalities: Functions, etc.
8.1 Technicalities
8.2 Declarations and definitions
8.2.1 Kinds of declarations
8.2.2 Variable and constant declarations
8.2.3 Default initialization
8.3 Header files
8.4 Scope
8.5 Function call and return
8.5.1 Declaring arguments and return type
8.5.2 Returning a value
8.5.3 Pass-by-value
8.5.4 Pass-by-const-reference
8.5.5 Pass-by-reference
8.5.6 Pass-by-value vs. pass-by-reference
8.5.7 Argument checking and conversion
8.5.8 Function call implementation
8.5.9 constexpr functions
8.6 Order of evaluation
8.6.1 Expression evaluation
8.6.2 Global initialization
8.7 Namespaces
8.7.1 using declarations and using directives
Chapter 9 Technicalities: Classes, etc.
9.1 User-defined types
9.2 Classes and members
9.3 Interface and implementation
 9.4 Evolving a class
9.4.1 struct and functions
9.4.2 Member functions and constructors
9.4.3 Keep details private
9.4.4 Defining member functions
9.4.5 Referring to the current object
9.4.6 Reporting errors
9.5 Enumerations
9.5.1 “Plain” enumerations
9.6 Operator overloading
9.7 Class interfaces
9.7.1 Argument types
9.7.2 Copying
9.7.3 Default constructors
9.7.4 const member functions
9.7.5 Members and “helper functions”
9.8 The Date class

Part II Input and Output

Chapter 10 Input and Output Streams
10.1 Input and output
10.2 The I/O stream model
10.3 Files
10.4 Opening a file
10.5 Reading and writing a file
10.6 I/O error handling
10.7 Reading a single value
10.7.1 Breaking the problem into manageable parts
10.7.2 Separating dialog from function
 10.8 User-defined output operators
10.9 User-defined input operators
10.10 A standard input loop
10.11 Reading a structured file
10.11.1 In-memory representation
10.11.2 Reading structured values
10.11.3 Changing representations
Chapter 11 Customizing Input and Output
11.1 Regularity and irregularity
11.2 Output formatting
11.2.1 Integer output
11.2.2 Integer input
11.2.3 Floating-point output
11.2.4 Precision
11.2.5 Fields
11.3 File opening and positioning
11.3.1 File open modes
11.3.2 Binary files
11.3.3 Positioning in files
11.4 String streams
11.5 Line-oriented input
11.6 Character classification
11.7 Using nonstandard separators
11.8 And there is so much more
Chapter 12 A Display Model
12.1 Why graphics?
12.2 A display model
12.3 A first example
 12.4 Using a GUI library
12.5 Coordinates
12.6 Shapes
12.7 Using Shape primitives
12.7.1 Graphics headers and main
12.7.2 An almost blank window
12.7.3 Axis
12.7.4 Graphing a function
12.7.5 Polygons
12.7.6 Rectangles
12.7.7 Fill
12.7.8 Text
12.7.9 Images
12.7.10 And much more
12.8 Getting this to run
12.8.1 Source files
Chapter 13 Graphics Classes
13.1 Overview of graphics classes
13.2 Point and Line
13.3 Lines
13.4 Color
13.5 Line_style
13.6 Open_polyline
13.7 Closed_polyline
13.8 Polygon
13.9 Rectangle
13.10 Managing unnamed objects
13.11 Text
 13.12 Circle
13.13 Ellipse
13.14 Marked_polyline
13.15 Marks
13.16 Mark
13.17 Images
Chapter 14 Graphics Class Design
14.1 Design principles
14.1.1 Types
14.1.2 Operations
14.1.3 Naming
14.1.4 Mutability
14.2 Shape
14.2.1 An abstract class
14.2.2 Access control
14.2.3 Drawing shapes
14.2.4 Copying and mutability
14.3 Base and derived classes
14.3.1 Object layout
14.3.2 Deriving classes and defining virtual functions
14.3.3 Overriding
14.3.4 Access
14.3.5 Pure virtual functions
14.4 Benefits of object-oriented programming
Chapter 15 Graphing Functions and Data
15.1 Introduction
15.2 Graphing simple functions
15.3 Function
 15.3.1 Default Arguments
15.3.2 More examples
15.3.3 Lambda expressions
15.4 Axis
15.5 Approximation
15.6 Graphing data
15.6.1 Reading a file
15.6.2 General layout
15.6.3 Scaling data
15.6.4 Building the graph
Chapter 16 Graphical User Interfaces
16.1 User interface alternatives
16.2 The “Next” button
16.3 A simple window
16.3.1 A callback function
16.3.2 A wait loop
16.3.3 A lambda expression as a callback
16.4 Button and other Widgets
16.4.1 Widgets
16.4.2 Buttons
16.4.3 In_box and Out_box
16.4.4 Menus
16.5 An example
16.6 Control inversion
16.7 Adding a menu
16.8 Debugging GUI code

Part III Data and Algorithms

Chapter 17 Vector and Free Store
17.1 Introduction
17.2 vector basics
17.3 Memory, addresses, and pointers
17.3.1 The sizeof operator
17.4 Free store and pointers
17.4.1 Free-store allocation
17.4.2 Access through pointers
17.4.3 Ranges
17.4.4 Initialization
17.4.5 The null pointer
17.4.6 Free-store deallocation
17.5 Destructors
17.5.1 Generated destructors
17.5.2 Destructors and free store
17.6 Access to elements
17.7 Pointers to class objects
17.8 Messing with types: void* and casts
17.9 Pointers and references
17.9.1 Pointer and reference parameters
17.9.2 Pointers, references, and inheritance
17.9.3 An example: lists
17.9.4 List operations
17.9.5 List use
17.10 The this pointer
17.10.1 More link use
Chapter 18 Vectors and Arrays
18.1 Introduction
 18.2 Initialization
18.3 Copying
18.3.1 Copy constructors
18.3.2 Copy assignments
18.3.3 Copy terminology
18.3.4 Moving
18.4 Essential operations
18.4.1 Explicit constructors
18.4.2 Debugging constructors and destructors
18.5 Access to vector elements
18.5.1 Overloading on const
18.6 Arrays
18.6.1 Pointers to array elements
18.6.2 Pointers and arrays
18.6.3 Array initialization
18.6.4 Pointer problems
18.7 Examples: palindrome
18.7.1 Palindromes using string
18.7.2 Palindromes using arrays
18.7.3 Palindromes using pointers
Chapter 19 Vector, Templates, and Exceptions
19.1 The problems
19.2 Changing size
19.2.1 Representation
19.2.2 reserve and capacity
19.2.3 resize
19.2.4 push_back
19.2.5 Assignment
19.2.6 Our vector so far
 19.3 Templates
19.3.1 Types as template parameters
19.3.2 Generic programming
19.3.3 Concepts
19.3.4 Containers and inheritance
19.3.5 Integers as template parameters
19.3.6 Template argument deduction
19.3.7 Generalizing vector
19.4 Range checking and exceptions
19.4.1 An aside: design considerations
19.4.2 A confession: macros
19.5 Resources and exceptions
19.5.1 Potential resource management problems
19.5.2 Resource acquisition is initialization
19.5.3 Guarantees
19.5.4 unique_ptr
19.5.5 Return by moving
19.5.6 RAII for vector
Chapter 20 Containers and Iterators
20.1 Storing and processing data
20.1.1 Working with data
20.1.2 Generalizing code
20.2 STL ideals
20.3 Sequences and iterators
20.3.1 Back to the example
20.4 Linked lists
20.4.1 List operations
20.4.2 Iteration
20.5 Generalizing vector yet again
 20.5.1 Container traversal
20.5.2 auto
20.6 An example: a simple text editor
20.6.1 Lines
20.6.2 Iteration
20.7 vector, list, and string
20.7.1 insert and erase
20.8 Adapting our vector to the STL
20.9 Adapting built-in arrays to the STL
20.10 Container overview
20.10.1 Iterator categories
Chapter 21 Algorithms and Maps
21.1 Standard library algorithms
21.2 The simplest algorithm: find()
21.2.1 Some generic uses
21.3 The general search: find_if()
21.4 Function objects
21.4.1 An abstract view of function objects
21.4.2 Predicates on class members
21.4.3 Lambda expressions
21.5 Numerical algorithms
21.5.1 Accumulate
21.5.2 Generalizing accumulate()
21.5.3 Inner product
21.5.4 Generalizing inner_product()
21.6 Associative containers
21.6.1 map
21.6.2 map overview
 21.6.3 Another map example
21.6.4 unordered_map
21.6.5 set
21.7 Copying
21.7.1 Copy
21.7.2 Stream iterators
21.7.3 Using a set to keep order
21.7.4 copy_if
21.8 Sorting and searching
21.9 Container algorithms

Part IV Broadening the View

Chapter 22 Ideals and History
22.1 History, ideals, and professionalism
22.1.1 Programming language aims and philosophies
22.1.2 Programming ideals
22.1.3 Styles/paradigms
22.2 Programming language history overview
22.2.1 The earliest languages
22.2.2 The roots of modern languages
22.2.3 The Algol family
22.2.4 Simula
22.2.5 C
22.2.6 C++
22.2.7 Today
22.2.8 Information sources
Chapter 23 Text Manipulation
23.1 Text
23.2 Strings
 23.3 I/O streams
23.4 Maps
23.4.1 Implementation details
23.5 A problem
23.6 The idea of regular expressions
23.6.1 Raw string literals
23.7 Searching with regular expressions
23.8 Regular expression syntax
23.8.1 Characters and special characters
23.8.2 Character classes
23.8.3 Repeats
23.8.4 Grouping
23.8.5 Alternation
23.8.6 Character sets and ranges
23.8.7 Regular expression errors
23.9 Matching with regular expressions
23.10 References
Chapter 24 Numerics
24.1 Introduction
24.2 Size, precision, and overflow
24.2.1 Numeric limits
24.3 Arrays
24.4 C-style multidimensional arrays
24.5 The Matrix library
24.5.1 Dimensions and access
24.5.2 1D Matrix
24.5.3 2D Matrix
24.5.4 Matrix I/O
 24.5.5 3D Matrix
24.6 An example: solving linear equations
24.6.1 Classical Gaussian elimination
24.6.2 Pivoting
24.6.3 Testing
24.7 Random numbers
24.8 The standard mathematical functions
24.9 Complex numbers
24.10 References
Chapter 25 Embedded Systems Programming
25.1 Embedded systems
25.2 Basic concepts
25.2.1 Predictability
25.2.2 Ideals
25.2.3 Living with failure
25.3 Memory management
25.3.1 Free-store problems
25.3.2 Alternatives to the general free store
25.3.3 Pool example
25.3.4 Stack example
25.4 Addresses, pointers, and arrays
25.4.1 Unchecked conversions
25.4.2 A problem: dysfunctional interfaces
25.4.3 A solution: an interface class
25.4.4 Inheritance and containers
25.5 Bits, bytes, and words
25.5.1 Bits and bit operations
25.5.2 bitset
 25.5.3 Signed and unsigned
25.5.4 Bit manipulation
25.5.5 Bitfields
25.5.6 An example: simple encryption
25.6 Coding standards
25.6.1 What should a coding standard be?
25.6.2 Sample rules
25.6.3 Real coding standards
Chapter 26 Testing
26.1 What we want
26.1.1 Caveat
26.2 Proofs
26.3 Testing
26.3.1 Regression tests
26.3.2 Unit tests
26.3.3 Algorithms and non-algorithms
26.3.4 System tests
26.3.5 Finding assumptions that do not hold
26.4 Design for testing
26.5 Debugging
26.6 Performance
26.6.1 Timing
26.7 References
Chapter 27 The C Programming Language
27.1 C and C++: siblings
27.1.1 C/C++ compatibility
27.1.2 C++ features missing from C
27.1.3 The C standard library
27.2 Functions
27.2.1 No function name overloading
27.2.2 Function argument type checking
27.2.3 Function definitions
27.2.4 Calling C from C++ and C++ from C
27.2.5 Pointers to functions
27.3 Minor language differences
27.3.1 struct tag namespace
27.3.2 Keywords
27.3.3 Definitions
27.3.4 C-style casts
27.3.5 Conversion of void*
27.3.6 enum
27.3.7 Namespaces
27.4 Free store
27.5 C-style strings
27.5.1 C-style strings and const
27.5.2 Byte operations
27.5.3 An example: strcpy()
27.5.4 A style issue
27.6 Input/output: stdio
27.6.1 Output
27.6.2 Input
27.6.3 Files
27.7 Constants and macros
27.8 Macros
27.8.1 Function-like macros
27.8.2 Syntax macros
27.8.3 Conditional compilation
 27.9 An example: intrusive containers

Part V Appendices
Appendix A Language Summary
A.1 General
A.1.1 Terminology
A.1.2 Program start and termination
A.1.3 Comments
A.2 Literals
A.2.1 Integer literals
A.2.2 Floating-point-literals
A.2.3 Boolean literals
A.2.4 Character literals
A.2.5 String literals
A.2.6 The pointer literal
A.3 Identifiers
A.3.1 Keywords
A.4 Scope, storage class, and lifetime
A.4.1 Scope
A.4.2 Storage class
A.4.3 Lifetime
A.5 Expressions
A.5.1 User-defined operators
A.5.2 Implicit type conversion
A.5.3 Constant expressions
A.5.4 sizeof
A.5.5 Logical expressions
A.5.6 new and delete
A.5.7 Casts
A.6 Statements
A.7 Declarations
A.7.1 Definitions
A.8 Built-in types
A.8.1 Pointers
A.8.2 Arrays
A.8.3 References
A.9 Functions
A.9.1 Overload resolution
A.9.2 Default arguments
A.9.3 Unspecified arguments
A.9.4 Linkage specifications
A.10 User-defined types
A.10.1 Operator overloading
A.11 Enumerations
A.12 Classes
A.12.1 Member access
A.12.2 Class member definitions
A.12.3 Construction, destruction, and copy
A.12.4 Derived classes
A.12.5 Bitfields
A.12.6 Unions
A.13 Templates
A.13.1 Template arguments
A.13.2 Template instantiation
A.13.3 Template member types
A.14 Exceptions
A.15 Namespaces
A.16 Aliases
 A.17 Preprocessor directives
A.17.1 #include
A.17.2 #define
Appendix B Standard Library Summary
B.1 Overview
B.1.1 Header files
B.1.2 Namespace std
B.1.3 Description style
B.2 Error handling
B.2.1 Exceptions
B.3 Iterators
B.3.1 Iterator model
B.3.2 Iterator categories
B.4 Containers
B.4.1 Overview
B.4.2 Member types
B.4.3 Constructors, destructors, and assignments
B.4.4 Iterators
B.4.5 Element access
B.4.6 Stack and queue operations
B.4.7 List operations
B.4.8 Size and capacity
B.4.9 Other operations
B.4.10 Associative container operations
B.5 Algorithms
B.5.1 Nonmodifying sequence algorithms
B.5.2 Modifying sequence algorithms
B.5.3 Utility algorithms
 B.5.4 Sorting and searching
B.5.5 Set algorithms
B.5.6 Heaps
B.5.7 Permutations
B.5.8 min and max
B.6 STL utilities
B.6.1 Inserters
B.6.2 Function objects
B.6.3 pair and tuple
B.6.4 initializer_list
B.6.5 Resource management pointers
B.7 I/O streams
B.7.1 I/O streams hierarchy
B.7.2 Error handling
B.7.3 Input operations
B.7.4 Output operations
B.7.5 Formatting
B.7.6 Standard manipulators
B.8 String manipulation
B.8.1 Character classification
B.8.2 String
B.8.3 Regular expression matching
B.9 Numerics
B.9.1 Numerical limits
B.9.2 Standard mathematical functions
B.9.3 Complex
B.9.4 valarray
B.9.5 Generalized numerical algorithms
B.9.6 Random numbers
Other documents randomly have
different content
Elsie Marley is grown so fine,
She won’t get up to serve her swine,
But lies in bed till eight or nine,
And surely she does take her time.

And do you ken Elsie Marley, honey?

The wife that sells the barley, honey;
She’s lost her pocket and all her money,
Aback o’ the bush i’ th’ garden, honey.

Elsie Marley is so neat,

It is hard for one to walk the street,
But every lad and lass they meet,
Cries, do you ken Elsie Marley, honey?

Elsie Marley wore a straw hat,

Now she’s got a velvet cap,
She may thank Lambton men for that,
Do you ken Elsie Marley, honey.

Elsie keeps wine, gin, and ale,

In her house below the dale.
Where every tradesman up and down,
Does call and spend his half-a-crown.

The farmers, as they come that way,

They drink with Elsie every day,
And call the fiddler for to play
The tune of “Elsie Marley,” honey.

The pitmen and the keelmen trim,

They drink bumbo made of gin,
And for to dance they do begin,
The tune of “Elsie Marley,” honey.

The sailors they will call for flip,

A th f th hi
As soon as they come from the ship,
And then begin to dance and skip,
To the tune of “Elsie Marley,” honey.

Those gentlemen that go so fine,

They’ll treat her with a bottle of wine,
And freely they’ll sit down and dine
Along with Elsie Marley, honey.

So to conclude these lines I’ve penn’d,

Hoping there’s none I do offend,
And thus my merry joke doth end,
Concerning Elsie Marley, honey.
And do you ken, &c.
CHESTER LADS FOR EVER.
Thro’ Durham County, fam’d of old,
Thro’ England, be it ever told,
That Chester lads stood forth so bold,
And Chester lads for ever.

When Frenchmen heard of their intent,

To Bonaparte in haste they sent,
And said, since Chester thus is bent,
We are ruin’d, sirs, for ever.

O dreadful news! said Bonaparte,

Enough to break each Frenchman’s heart;
But let us try, with all our art,
Those Chester lads to sever.

Then firmly spoke Monsieur Otto,

The Chester lads you little know,
If them you think to overthrow;
For they will fight for ever.

Tho’ many millions you have slain,

Yet what you’ve done is all in vain;
You’ll never beat the Chester men,
Nor cope with them—no never.

The Consul call’d a council straight,

And long and learned the debate;
Each Frenchman tried, with all his weight,
How France he might deliver.

The issue of this parliament

Was peace—the glorious grand event,
Which gave each British heart content.
And Chester lads for ever!!!
LUMLEY LEADS TO GLORY.

Come all ye lads who wish to shine

Bright in Chester story,
Haste to arms, and form the line,
Where Lumley leads to glory.

Charge the musket, point the lance,

Brave the worst of dangers;
Tell the blustering sons of France,
That Chester fears no strangers.

Chester, when the lion’s rous’d,

And the flag is rearing,
Always finds her sons dispos’d
To drub the foe that’s daring.
Charge the musket, &c.

Honor for the brave to share,

Is the noblest booty;
Guard the coast, protect the fair,
For that’s a Briton’s duty.
Charge the musket, &c.

Beat the drums, the music sound,

Manly and united;
Danger face, maintain your ground,
And see your country righted.
Charge the musket, &c.
CHESTER VOLUNTEERS.
Tune—There’s na Luck about the House.
And are ye sure the tale is true?
Again the news relate,
That Chester is to raise a corps
To fight for king and state.
Then let us fill a bumper full,
To Scarborough’s noble thane,
Who under his protection has
The men of Chester ta’en.

If Chester men are firm and true,

And by each other stand,
No foreign foe can venture then
To stain our native land.
But if they should assail our coast,
Compell’d by want and need,
When Chester banners are display’d,
They’ll fly from hence with speed.
Then let us fill, &c.

In former times our Chester youths

Their country’s foes expell’d;
Whose conquering monarch, in those days,
The crowns of Europe held:
Should then the sons of France pretend
With Chester Sons to vie,
If they suppose they’re better men,
E’en let them come and try.
Then let us fill, &c.

The king our noble father is,

The queen our mother dear;
The prince’s brothers soldiers are,
Whom we shall here revere:
Them we’ll defend with might and main,
Against all sorts of foes;
Should they command to fight like men
Should they command to fight like men,
Or aim their treacherous blows.
Then let us fill, &c.
THE DURHAM VOLUNTEERS.
Tune—Anacreon in Heaven.
When Britannia her sons calls to aid her in arms,
And fell war, with its horrors, our island does threat,
The true British feeling each bosom that warms,
Prompts away to the beach, the invader to meet.
And along with the brave,
Who their country will save,
And whose only retreat is a glorious grave.
See each son of Dunelm, and the old winding Wear,
The patriot, the loyal, the brave Volunteer.

Let the foes of old England unite to enslave

Her free bands, from whose fury so oft they have fled;
We’ll prove, by their ruin who escape the wild wave,
We can fight like our sires, who at Agincourt bled;
Their great deeds we’ll review,
And example pursue,
And prove we’ve the blood of the same race so true.
Determined to save what than life is more dear,
Our country, our laws, march each brave Volunteer.

Vain boasting Monsieur always lower’d his proud flag,

Whenever he met our bold tars on the sea;
And of conquest on shore let the Corsican brag;
Here the length of their graves their sole conquest shall be!
Let them vapour and threat,
Boast their armies so great,
Old England united can never be beat:
This often prov’d fact each loyal heart cheers,
Of their country’s best guardians, her brave Volunteers.

The proud Don, through all time, shall his madness deplore,
When his Wealth and his Indies are conquer’d by thee;
And treach’rous Mynheer mourn, a vassal, once more,
From the shackles of which, our brave sires made him free.
Then Mynheer, Don, and Gaul,
We here challenge you all
 We here challenge you all,
And believe British bayonets will your spirits appal;
For your pride to chastise, see a nation appears;
In the van march her loyal, her brave Volunteers!

Come the day when the foe on our shore dare descend,
Like the lion defending his den, each will feel;
For the world ’gainst our safety in vain will contend,
While fair freedom and courage support their lov’d weal:
And along with the brave,
Who their country will save,
And whose only retreat is a glorious grave,
With the first in the field, ’gainst each foe will appear,
The loyal and patriot sons of the Wear.

February, 1805.

King James I. in the 15th year of his Reign, came to Durham on

Good Friday, April, 1617, where he was kindly received by the Mayor
and Corporation of that loyal City, and, on his Entrance, the Body
Corporate addressed him as follows:—
 Durham’s old city thus salutes her king,
With entertainments such as she can bring;
And cannot wait upon his majesty,
With shew of greatness, but humility,
Makes her express herself in moderate guise:
In this deserted north, far from your eyes;
For your great prelate (James) of late adored,
Her dignities, for which we oft implored
Your highest aid, to give continuance;
And so confirmed by your dread sovereignce:
But what our royal James did grant herein,
Our bishop James hath much oppugnant been.
Small force bears down small power, where force and might
Hath greater strength than equity and right.
The last are only in your breast included:
Subjects’ griefs known, are ne’er from you secluded;
From your most gracious grant we therefore pray,
That the fair sunshine of your brightest day,
Would smile upon your city, whose clear beams
Exhale the troubles of our former streams;
Let not, O Powerful Prince, our ancient state,
For one man’s will, to be depopulate!

Tho’ one seeks our undoing, yet to you,

All our hearts pray, and all our knees shall bow;
And this dull cell of earth, in which we live,
Unto your name its latest praise shall give;
Confirm our grant, good king! Durham’s old city
Will powerful be, if bless’d with James’s pity.

The verses being ended, the mayor was placed in rank next before
the sword borne before the king, and bearing the mace of the city all
the way to the Cathedral Church.
DURHAM OLD WOMEN.

As aw was gannin to Durham

Aw met wi’ three jolly brisk women,
Aw ask’d what news at Durham?
They said joyful news is coming:
There’s three sheep’s heads i’ the pot,
A peck o’ peasmeal in the pudding.
They jump’d, laugh’d, and skipp’d at that,
For the joyful days are coming.
Fal la la.
 EPITAPH
On John Simpson, of Hamsterly,
Woolcomber.
BY ISAAC GARNER.

While visiting this dark abode,

Here, reader, turn thy wand’ring eyes;
Tread light, for underneath this sod,
Simpson, the Village Poet, lies.

The people’s follies, and their vice,

As frequently as he found leisure,
He hunted down (as cats do mice)
In strains of true poetic measure.

So neatly he his subject hit,

So well he temper’d truth with sense;
The simple marvell’d at his wit,
And wise men seldom took offence.

His genius and invention such,

From each event he’d something gather;
For nought ’scap’d his satiric touch,
That fairly came within his tether.

Nor ’scap’d he death;—His race is run,

(So fall the witty and the brave!)
His wool is comb’d, his thread is spun;
And daisies flourish round his grave!
 ODE
To the River Darwent.
Lov’d stream, that meanders along,
Where the steps of my infancy stray’d;
When first I attun’d the rude song,
That nature all artless essay’d.

Though thy borders be stripp’d of each tree,

That smil’d in their vernal array;
Their image still pictures to me,
Thy villagers gambolling gay.

Nor by fancy shall aught be unseen,

While thy fountains flow murmuring by;
I have danc’d in the Dance on the green,
I have wept with the woe-begun age.

Thy blessings how many and rare!

Far distant the mildue of health,
Where guilt vainly decorates care,
And wickedness broods over wealth.

The dress of the body and mind,

For ages exactly the same:
No travel the manners refin’d,
And fashion pass’d by as it came.

Ah! which of thy sons canst thou boast,

Like Maddison,[78] made to explore:
To give to the silver girt coast,
The worth that was foreign before!

Each language, each humour, his own,

All Europe was proud to improve;
Whom Belgium sits down to bemoan,
Whom Gallia could listening love.

Say, when will thou cease to complain?

 Oh Darwent, thy destiny cries;
Far off, on the banks of the Seine,
Thy darling, thy Maddison—dies!

[78] Mr Maddison was secretary to the English Ambassador at

the French Court, about the end of the American war: his death
was rather singular; the ambassador had been invited to a large
dinner party, given by some of the members of the French
Government; but being rather ill at the time, he sent his secretary
as his deputy, who went accordingly, and came home extremely
ill, and soon after died, with all the symptoms of being poisoned;
a mark of favour which the French had intended to have paid to
the ambassador, had not fortune forbid it! The circumstances of
this curious affair, which made considerable noise at the time,
were never rightly known.
THE HEXHAMSHIRE LASS.
Its hey for the buff and the blue,
Hey for the cap and the feather;
Hey for the bonny lassie true,
That lives in Hexhamshire.
Thro’ by the Saiby Syke,
And o’er the moss and the mire,
I’ll go to see my lass,
Who lives in Hexhamshire.

Her father lov’d her well,

Her mother lov’d her better;
I love the lass mysel’,
But, alas! I cannot get her.
Thro’ by, &c.

Oh, this love, this love!

Of this love I am weary!
Sleep I can get none,
For thinking on my deary!
Thro’ by, &c.

My heart is like to break,

My bosom is on fire;
So well I love the lass
That lives in Hexhamshire.
Thro’ by, &c.

Her petticoat is silk,

And plaited round with siller;
Her shoes are tied with tape,
She’ll wait ’til I go till her.
Thro’ by, &c.

Were I where I would be,

I would be beside her;
But here a while I must be,
 Whatever may betide her.
Thro’ by, &c.

Hey for the thick and the thin,

Hey for the mud and the mire;
And hey for the bonny lass
That lives in Hexhamshire.
Thro’ by, &c.
The Northumbrian’s Sigh for his
native Country.

At home wad I be,

And my supper wad I see,
And marry with a lass
Of my own country.

If I were at hame,
I wad ne’er return agean,
But marry with a lass
In my own country.

There’s the oak and the ash,

And the bonny ivy tree;
How canst thou gan away, love,
And leave me?

O stay, my love, stay,

And do not gang away;
O stay, my love, stay,
Along with me.
Welcome to our website – the ideal destination for book lovers and
knowledge seekers. With a mission to inspire endlessly, we offer a
vast collection of books, ranging from classic literary works to
specialized publications, self-development books, and children's
literature. Each book is a new journey of discovery, expanding
knowledge and enriching the soul of the reade

Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.

Let us accompany you on the journey of exploring knowledge and

personal growth!

textbookfull.com