First commit

Apress · Oct 13, 2016 · b0dfacd · b0dfacd
commit b0dfacd
Show file tree

Hide file tree

Showing 1,321 changed files with 620,977 additions and 0 deletions.
diff --git a/4250.pdf b/4250.pdf
diff --git a/4251.pdf b/4251.pdf
diff --git a/9781590597491.jpg b/9781590597491.jpg
diff --git a/LICENSE.txt b/LICENSE.txt
@@ -0,0 +1,27 @@
+Freeware License, some rights reserved
+
+Copyright (c) 2009 Ray Lischner
+
+Permission is hereby granted, free of charge, to anyone obtaining a copy 
+of this software and associated documentation files (the "Software"), 
+to work with the Software within the limits of freeware distribution and fair use. 
+This includes the rights to use, copy, and modify the Software for personal use. 
+Users are also allowed and encouraged to submit corrections and modifications 
+to the Software for the benefit of other users.
+
+It is not allowed to reuse,  modify, or redistribute the Software for 
+commercial use in any way, or for a user�s educational materials such as books 
+or blog articles without prior permission from the copyright holder. 
+
+The above copyright notice and this permission notice need to be included 
+in all copies or substantial portions of the software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS OR APRESS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
+
diff --git a/README.md b/README.md
@@ -0,0 +1,15 @@
+#Apress Source Code
+
+This repository accompanies [*Exploring C++*](http://www.apress.com/9781590597491) by Ray Lischner (Apress, 2009).
+
+![Cover image](9781590597491.jpg)
+
+Download the files as a zip using the green button, or clone the repository to your machine using Git.
+
+##Releases
+
+Release v1.0 corresponds to the code in the published book, without corrections or updates.
+
+##Contributions
+
+See the file Contributing.md for more information on how you can contribute to this repository.
diff --git a/contributing.md b/contributing.md
@@ -0,0 +1,14 @@
+# Contributing to Apress Source Code
+
+Copyright for Apress source code belongs to the author(s). However, under fair use you are encouraged to fork and contribute minor corrections and updates for the benefit of the author(s) and other readers.
+
+## How to Contribute
+
+1. Make sure you have a GitHub account.
+2. Fork the repository for the relevant book.
+3. Create a new branch on which to make your change, e.g. 
+`git checkout -b my_code_contribution`
+4. Commit your change. Include a commit message describing the correction. Please note that if your commit message is not clear, the correction will not be accepted.
+5. Submit a pull request.
+
+Thank you for your contribution!
diff --git a/cover.png b/cover.png
diff --git a/data/explore14.txt b/data/explore14.txt
@@ -0,0 +1,19 @@
+Exploration 14
+
+The Map Data Structure
+
+Now that you understand the basics, it's time to move on to more exciting challenges.
+Let's write a real program--something non-trivial, but still simple enough to master
+this early in the book. Your task is to write a program that reads words and counts
+the frequency of each unique word. For the sake of simplicity, a word is a string of
+non-space characters separated by whitespace. Be aware, however, that by this
+definition, words end up including punctuation characters, but we'll worry about
+fixing that problem later.
+
+This is a complicated program, touching on everything you've learned about C++ so far.
+If you want to exercise your new understanding of file I/O, read from a named file. If
+you prefer the simplicity, read from the standard input. Before jumping in and trying
+to write a program, take a moment to think about the problem and the tools you need to
+solve it. Write pseudo-code for the program. Try to write C++ code where you can, and
+make up whatever else you need to tackle the problem. Keep it simple: and don't dwell
+on trying to get syntax details correct.
diff --git a/data/index.html b/data/index.html
@@ -0,0 +1,32 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
+<HTML>
+<HEAD>
+	<META HTTP-EQUIV="CONTENT-TYPE" CONTENT="text/html; charset=utf-8">
+	<TITLE>Exploring C++: Data Files</TITLE>
+	<META NAME="AUTHOR" CONTENT="Ray Lischner">
+</HEAD>
+<BODY>
+<H1><A HREF="../index.html"><IMG SRC="../cover.png" ALT="cover" ALIGN=LEFT WIDTH=127 HEIGHT=168 BORDER=1></A>Exploring
+C++: The Programmer's Introduction to C++</H1>
+<H2>Data Files</H2>
+<br clear="left"><P>The following lists some helpful data files to feed to some of the
+example programs. See also the <A HREF="../projects/index.html">projects</A>
+and all the <A HREF="../listings/index.html">code listings</A>.</P>
+<P>Exploration 14: Use <A HREF="explore14.txt">explore14.txt</A>
+as sample input to the word-counting programs.</P>
+
+<p>Exploration 51: Words, words, words. Use <a href="sorted-words.txt">sorted-words.txt</a>
+and <a href="shuffled-words.txt">shuffled-words.txt</a>
+as input to Listing 51-2. Compare the speed of the program using these two files, which
+differ only in the order.
+These files are from <a href="http://wordlist.sourceforge.net/">wordlist</a> on SourceForge.</p>
+
+<p>Exploration 52: palindrome input files
+<ul>
+<li><a href="palindrome-utf8.txt">palindrome-utf8.txt</a>
+<li><a href="palindrome-8859-1.txt">palindrome-8859-1.txt</a>
+</ul></p>
+
+<p><a href="http://validator.w3.org/check?uri=referer"><img src="../valid-html32.png" height="31" width="88"></a></p>
+</BODY>
+</HTML>
diff --git a/data/palindrome-8859-1.txt b/data/palindrome-8859-1.txt
@@ -0,0 +1,5 @@
+palindrome
+Eve
+Madam, I'm Adam
+L�on saw I was No�l
+�A man--a plan--a canal! Panama!
diff --git a/data/palindrome-utf8.txt b/data/palindrome-utf8.txt
@@ -0,0 +1,5 @@
+not a palindrome
+Eve
+Madam, I’m Adam
+Lëon saw I was Noël
+¡A man—a plan—a canal! Panama!