| < Day Day Up > |
|
Packages, 379–380
source program distribution, 380
scope resolution modifiers, 380
Paint method, 188–189, 192, See also Animator
corrected repaint, 292, 296, 298
repaint event generation, 204–205
Parallel computing, 16
Parent thread, 37, 411
Partial ordering, 7, 27
Passive objects, 69
components, 79
concurrent program design methodology, 71–76
definition, 411
gas station simulation, 81
implementation through state diagrams, 69, 73, 74
implementing as monitors, 69, 74–76
Path Class programs, 183, 184
Path interface, 184–186
Persistent objects, 110, 121
Person objects, program for storing, 144
Polymorphism, 138–139, 143, 145
Post-conditions, 75–76
Pre-condition code, 75
Primitives
aggregate properties, 338
arrays, 116
Java variable-identifier type matching, 99–100
PrintMessage object, 396–400
PrintTable class, 130, 134–143
Priorities, 35
Private inheritance, 324
Private scope, 380
Problem decomposition, 303
Problem definition, object construction for, 333, 334
Problem description, 69, 70
Procedural, definition, 411
Procedural program execution model, 32–34
Procedural reuse, 247–248, 306, 310–316, 411
Processes, 28–31, 411
ProcessEvent method, 212
Producer/consumer program, 70–71
Program complexity, 329
Program context, 28, 411
Program counter (PC), 28, 32–33, 35–37, 411
Program execution models, 32–38
Program management, 367–380
accessor methods, 372
definition files, 375
design and, 367–369
final classes and methods, 376
implementation attributes not defined in Java, 370–373
indenting style, 371–372
inner classes, 376–378
interactive development environments (IDEs), 373
make utility, 378–379
modules, 368
naming conventions, 369, 370–371
packages, 379–380
scope resolution modifiers, 376, 379, 380
source code control, 373
source file names, 373–374
stateless methods, 375–377
Program safety, See also Exceptions
bounded buffer program, 79
complete synchronization, 51
coordinating threads, 55
deadlock, See Deadlock
definition, 412
effective and ineffective strategies, 42–43, 47–48
inductive proof, 48–49
locking objects, 45–48
memory allocation, 106–109
method return values, 159–161, 281
nondeterminism, 40–41
race conditions, 42–45, See also Race conditions
runtime data type tags and, 102–105
synchronized modifier, 49–51
testing, 42
type mismatch, 98–99, See also Data types; Type matching
wait and notify methods, 51–54
"Programming to a fact," 132
"Programming to an interface," 132, 138
"Programming to a promise," 134–137
Program stack, definition, 412
Promise concept, 134
Propagating an exception, 165–167, 412
Protected scope, 380
Public scope, 380
Pump class program, 282–283
PumpManager class, 278–279, 286
| < Day Day Up > |
|