Home > Store

Squeak-A Quick Trip to ObjectLand

Register your product to gain access to bonus material or receive a coupon.

Squeak-A Quick Trip to ObjectLand

Book

  • Sorry, this book is no longer in print.
Not for Sale

About

Features

Topic coverage includes:

  • An overview of fundamental object-oriented concepts: object, class, message, method, and more.
  • The basic building blocks of the Squeak programming language.
  • Successful strategies for debugging and testing.
  • Booleans and blocks.
  • Iteration and recursion.
  • Code writing: style, comment, convention.
  • A glimpse into the future of Squeak.

Description

  • Copyright 2002
  • Dimensions: 7-3/8" x 9-1/4"
  • Pages: 328
  • Edition: 1st
  • Book
  • ISBN-10: 0-201-73114-2
  • ISBN-13: 978-0-201-73114-9

With Squeak, developers have a free, complete, portable, high-performance, open source Smalltalk-80 implementation whose virtual machine is written entirely in Smalltalk, making it simple to debug, analyze, and change your code. This book's unique format and bite-size structure makes it easy to learn Squeak -- regardless of your previous experience with objects. Squeak: A Quick Trip to ObjectLand overcomes the traditional Smalltalk learning curve by presenting Squeak in the format of a running conversation between a programmer and an imaginary "Object Wizard." You'll start with the basics of object development, then learn key Squeak concepts that let you write real software almost immediately. Next, build your skills incrementally, mastering numbers, debugging and testing, the class hierarchy, collections, Booleans and blocks, conditional execution, iteration and recursion, streams and files, and more. For every developer who wishes to learn Squeak -- regardless of previous experience.

Downloads

CD Contents

Untitled Document Download the CD Contents related to this title.

Sample Content

Downloadable Sample Chapter

Click below for Sample Chapter related to this title:
korienekch05.pdf

Table of Contents



Preface.


Acknowledgments.


About the Authors.

PART I. WELCOME TO OBJECTLAND.

 0. As our Story Begins.
 1. A View of ObjectLand.
 2. ObjectLand.
 3. A View of the Tools.

PART II. PROGRAMMING IN OBJECTLAND.

 4. Smalltalk: The Language.
 5. Back to ObjectLand.
 6. Debugging and Testing.
 7. The Class Hierarchy.
 8. Numbers et al.
 9. Collections.
10. Booleans and Blocks.
11. More Blocks.
12. Files and Streams.

PART III. ADVANCED OBJECTLAND.

13. Object-Oriented Thinking and Design.
14. An Introduction to Morphic.
15. Morphic Programming.
Glossary.
For More Information.
Index. 0201731142T11262001

Preface

We have read our share of programming-language books and have learned much and little. The style used by conventional programming-language books is a blend between that of a reference book and that of a code-examples book, with some explanatory comments squeezed in between. When approaching the creation of this book, we never considered writing it in a conventional format. The unconventional nature of Smalltalk demands a novel approach. So, we wrote the book in the form of dialogues involving a human named Jim, who has reasons to converse about the nuances of the object-oriented paradigm, Smalltalk programming, and the Squeak environment. The dialogues take place between Jim and the Objective Wizard (an outspoken, outlandish, and outstanding object) in some chapters, and between Jim and the Objective Librarian (a well-spoken and reflective object) in other chapters.

It bears noting that the setting for this book is the virtual world of ObjectLand. However, since, as of yet, humans are unable to enter ObjectLand, you will want to keep in mind that ObjectLand's real-world analogue is Squeak.The intent of this book is to teach the reader to solve problems in the object-oriented paradigm and to implement solutions using the object-oriented programming language called Smalltalk in the Squeak environment. It must be read from start to finish and read completely. As you read it, you will soon realize that it is not a reference book. It is more like a storybook with To Do Lists. Read it as you would read a story. It has a plot; it has character; it's meant to entertain.

The other big difference between this book and conventional programming books is that you should have a current version of Squeak running in a computer next to you while you are reading. You can participate in the story, and the To Do Lists ask you to complete tasks to reinforce the chapters' information.

The conversation between Jim and the Objective Wizard contains English sentences interspersed with Smalltalk code. You can easily recognize the Smalltalk code because it is always in a different typeface--this one.

This book can be read in about 15 sittings. That's one chapter per sitting. The completion of the To Do Lists is mandatory. A To Do List appears at the conclusion of each chapter. You will notice that the completed To Do code is not included with the book. The reason for this is that we all know you will look at it as soon as a To Do task gets difficult. We don't want you to look at our solutions to these tasks. We want you to work through the difficulties and reap the learning rewards. If you really want to see our solutions, then check the "About the Authors" section to find out where we are.

Learning Smalltalk and the Squeak environment can be a tricky task, but after teaching introductory and advanced Smalltalk classes for a few years, we have figured out how people learn to use Smalltalk. We have found this book's approach to be an extremely effective path to understanding the object-oriented concepts and gaining skill in solving problems by writing squeaky clean code--in Squeak.

Try it, it works!

Once you have completed this book, you probably will not need it again. You will have been introduced to the cast of characters and will have learned the story. You will need a more advanced book. We suggest that you continue your journey up the Smalltalk learning curve by rambling through the list of texts for further reading that we've included in the back of this book--or perhaps, look for a future ObjectLand book someday.

Gene Korienek
Tom Wrensch
Doug Dechow
August 2001



0201731142P11262001

Index

Page numbers followed by f and t indicate figures and tables, respectively.
A

AlignmentMorph class, 254

allSatisfy message, 199–200

Analogy, definition of, 289

and message vs. & message, 184

Animation (thinking tool), 289
     problem-solving with, 230

Animation, of objects, 282–286

Anthropomorphism
     definition of, 289
     problem-solving with, 231–232

Appearance menu item, 51, 51f

Application(s)
     definition of, 289
     prototypes of, in Smalltalk, 27

Argument, definition of, 289

Arithmetic, 147–157. See also Number class
     execution order for, 152
     heuristics for, 155

Array(s)
     in animation, 283–284
     creating, 96

Array collection, 164–167
     nil in, 166

Assignment, definition of, 289
B

Background process(es), 200–201

Bag collection, 164–165

Binary message(s), 88, 289–290

Blacky, definition of, 290

Block(s)
     definition of, 97, 186–187, 290
     types of, 187–190

Blue button, 19, 20f

Boolean class, 183–186

BorderedMorph, 271f
     creating, 267–268, 268f

Browser, function of, 60
C

Cartesian coordinate system
     viewing, for morphs, 249–250
     for visual display, 248–249

Cascade message, 89–91

Categories
     browsing, 61, 63f
     creating, 66–67, 67f
     definition of, 61, 137
     finding, 137–138
     for messages, 237
     for methods, 273–274, 274f, 285, 285t
     second-level, 137
     top-level, 137

Character(s), definition of, 96

Character class, 151

Class(es)
     browsing, 62, 63f
     creating, 68, 273, 279–287
     definition of, 39, 85, 290
     extending, 272–275, 275f
     finding, 63–65, 64f, 65f, 135–136, 141
     message interfaces for, 237
     of Morphic framework, 252–258
     objects in, 7
     removing, 76
     saving, 75
     subclasses for, 111, 272–275, 275f
     superclasses for, 111

Class comment(s), viewing, 247

Class definition
     contents of, 40
     creating, 236, 282, 284
     inheritance in, 282
     methods in, 41

Class hierarchy
     inheritance in, 111–112
     polymorphic messages in, 110
     vs. Smalltalk, 84
     for Stream, 175–176

Class method(s), in class definition, 40

Class name(s), syntax for, 86

Class variable(s)
     in class definition, 40
     definition of, 290
     scope and usage of, 98, 103

Code
     errors reported by, 122
     optimizing, 128–129

collect message, 189

Collection(s), 159–179
     saving to files, 217

Collection class(es)
     conversion messages for, 173–174
     hierarchy of, 161–162
     iteration messages for, 189–190
     messages for, 162–163
     subclasses of, 163–173, 178

Color palette, in changing morph color, 266f

Comparison message(s), 185

Compiler error(s), 122–123

Compiler, in saving methods, 101

Composite morph(s), 252
     disassembling, 278–279, 279f

ComputerLand, definition of, 290

Conditional statements, 186

Conversion message, for collections, 173–174

Coordinate system
     viewing for morphs, 249–250
     for visual display, 248–249

Cursor(s), HandMorph class as, 255–256
D

3D subproject, 18

DataStream class, 210, 215–216

Date class, 151

Debugger, 125–126

definition of, 289

detect message, 199

Dictionary collection, 172

Directory (ies), creating and deleting, 214. See also FileDirectory class

Do it, 29f
     definition of, 290
     vs. Print it, 28

do message, 189

Drool, superconducting, 290

Dynamic binding
     definition of, 290
     and polymorphism, 108
E

Embedded code, debugging with, 126–127

Embedding
     definition of, 267
     disassembling, 278–279, 279f
     of morphs, 271–272, 272f

Encapsulation, 107–108, 115, 290

Error(s)
     compiler for, 122–123
     exceptions for, 202–203
     runtime, 122, 123–125
     sources for reporting, 122

error: method, 123

Event handling, in mouse click, 282

Exception class, for errors, 202–203

Execution, order of, 91–94, 103, 152, 293. See also Do it

Expression(s), 91
     components of, 94–95
     definition of, 42
     in methods, 43
F

false pseudo variable, 98–99, 183

File(s), 211–213
     closing, 213
     opening, 72–73, 73f, 211
     saving, 74–75, 211
     saving objects to, 216–217

File in, 77–78, 77f

File out, 75

FileDirectory class, 210, 214. See also Directory (ies)

FileStream object, 210–211

Float class, 154

fork message, 201

Form class, 280
     in animation, 283

Fraction class, 155

Full screen menu items, 53
G

Games subproject, 18

Garbage collector, 290. See also Blacky

get method, 108

Global variable(s), 95
     defining, 97
     scope and usage of, 98, 103
     Wo

Updates

Submit Errata

More Information

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.

Overview


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information


To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.

Surveys

Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.

Newsletters

If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information


Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.

Security


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.

Children


This site is not directed to children under the age of 13.

Marketing


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information


If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.

Choice/Opt-out


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information


Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents


California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure


Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.

Links


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact


Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice


We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020