Язык программирования C++ (Страуструп)

.
++

/ ++
++
.......................................................................................................................7
:.......................................................................................................................................................7
...........................................................................................................................................................8
...................................................................................................................................8
..............................................................................................................9
...................................................................................................................................9
.....................................................................................................................10
......................................................................................................................................................10
.......................................................................................................................................10
.............................................................................................................................................................11
..................................................................................................................................11
.............................................................................................................................................11
++ ....................................................................................................................................13
...................................................................................................................................13
.........................................................................................................................................14
++....................................................................................................15
.................................................................................................................................16
......................................................................................................................16
.................................................................................................................................................17
1. ++............................................................................................................................18
1.1 ........................................................................................................................................................18
1.2 .......................................................................................................................18
1.2.1 ............................................................................................................19
1.2.2 ................................................................................................................19
1.2.3 ...................................................................................................................................20
1.2.4 ...................................................................................................................22
1.2.5 - ....................................................................................23
1.3 " "..............................................................................................................................................24
1.3.1 ............................................................................................................24
1.3.2 ..............................................................................................25
1.3.3 ................................................................................................................................25
1.3.4 .................................................................................................................25
1.3.5 .....................................................................................................................................................26
1.3.6 .......................................................................................................................................................28
1.4 ......................................................................................................................29
1.4.1 ......................................................................................................................29
1.4.2 ..............................................................................................................30
1.4.3 ...........................................................................................................................................31
1.4.4 ....................................................................................................................31
1.4.5 ..............................................................................................................................32
1.4.6 ....................................................................................................................32
1.5 - ......................................................................33
1.5.1 ......................................................................................................................................33
1.5.2 ............................................................................................................................................34
1.5.3 .................................................................................................................35
1.5.4 ............................................................................................................................................36
1.6 ....................................................................................................................................37
2. ...............................................................................................................38
2.1 .....................................................................................................................................................38
2.1.1 ...................................................................................................................................39
2.1.2 ......................................................................................................................................40
2.1.3 ..............................................................................................................................40
2.2 .............................................................................................................................................................40
2.3 ................................................................................................................................................................41
2.3.1 ..........................................................................................................................................41
2.3.2 ..................................................................................................................42
2.3.3 ....................................................................................................................................43
2.3.4 void......................................................................................................................................................43
2.3.5 ...................................................................................................................................................44
2.3.6 .....................................................................................................................................................44
2.3.7 ................................................................................................................................46
2.3.8 ..................................................................................................................................................47
2.3.9 ............................................................................................................................48
2.3.10 .....................................................................................................................................................49
2.4 ......................................................................................................................................................51
2.4.1 .......................................................................................................................................51
-2-
.
++
2.4.2 ..............................................................................................................51
2.4.3 ............................................................................................................................52
2.4.4 ........................................................................................................................................................52
2.4.5 ............................................................................................................................................................53
2.5 .............................................................................................................................53
2.5.1. ...........................................................................................................................................54
2.6. .............................................................................................................................................55
2.6.1 ............................................................................................................................................................55
2.6.2. ..............................................................................................................................................55
2.7 ......................................................................................................................................................57
3. .............................................................................................................58
3.1 ......................................................................................................................................................58
3.1.1 ..................................................................................................................................................58
3.1.2 ...........................................................................................................................................61
3.1.3 .................................................................................................................................................63
3.1.4 ....................................................................................................................................64
3.1.5 ......................................................................................................................................................65
3.1.6 .................................................................................................................65
3.2 ..............................................................................................................................................66
3.2.1 ........................................................................................................................................................68
3.2.2 ................................................................................................................................68
3.2.3 ............................................................................................................................69
3.2.4 .........................................................................................................70
3.2.5 ................................................................................................................................71
3.2.6 .....................................................................................................................................72
3.3 ............................................................................................................................................74
3.3.1 ..........................................................................................................................74
3.3.2 goto............................................................................................................................................76
3.4 .............................................................................................................76
3.5 .......................................................................................................................................................77
4......................................................................................................................................................................80
4.1 ............................................................................................................................................................80
4.2 ........................................................................................................................................................80
4.3 .........................................................................................................................................82
4.3.1 ..........................................................................................................83
4.3.2 .....................................................................................................84
4.4 ...............................................................................................86
4.5 ....................................................................................................................................87
4.6 .............................................................................................................................................................88
4.6.1 .....................................................................................................................................88
4.6.2 ...............................................................................................................................88
4.6.3 .................................................................................................................................89
4.6.4 ............................................................................................................................90
4.6.5 -........................................................................................................................................91
4.6.6 ......................................................................................................................92
4.6.7 ..........................................................................................................94
4.6.8 ..........................................................................................................94
4.6.9 ...............................................................................................................................95
4.7 ...................................................................................................................................................98
4.8 .......................................................................................................................................................99
5. ................................................................................................................................................................101
5.1 ..............................................................................................................................101
5.2 ...............................................................................................................................................101
5.2.1 -............................................................................................................................................101
5.2.2 .......................................................................................................................................................102
5.2.3 .........................................................................................................................................103
5.2.4 .........................................................................................................................................105
5.2.5 ...................................................................................................................................................106
5.2.6 ..............................................................................................................................................107
5.3 ..............................................................................................................................107
5.3.1 ...................................................................................................................107
5.3.2 ...................................................................................................................110
5.4 ..................................................................................................................................................112
5.4.1 ........................................................................................................................................................112
5.4.2 ...........................................................................................................................113
5.4.3 ...................................................................................................................................114
5.4.4 ...................................................................................................................................115
-3-
.
++
5.4.5 ..................................................................................................................................115
5.4.6 .......................................................................................................................116
5.5 ........................................................................................................................118
5.5.1 ...........................................................................................................................118
5.5.2 ..................................................................................................................................119
5.5.3 ....................................................................................................................................119
5.5.4 ......................................................................................................................120
5.5.5 ........................................................................................................................121
5.5.6 .................................................................................................................................122
5.6 .....................................................................................................................................................122
6....................................................................................................................................................................124
6.1 ..............................................................................................................................124
6.2 .......................................................................................................................................124
6.2.1 -........................................................................................................................................126
6.2.2 .................................................................................................................126
6.2.3 .....................................................................................................................................127
6.2.4 ..................................................................................................................................................127
6.2.5 .............................................................................................................................129
6.3 .......................................................................................................................................130
6.4 ..................................................................................................................131
6.4.1 ........................................................................................................................................131
6.4.2 ....................................................................................................................................133
6.4.3 ............................................................................................................................135
6.5 .......................................................................................................................137
6.5.1 .........................................................................................137
6.5.2 .................................................................................................................138
6.5.3 .................................................................................................................139
6.6 ............................................................................................................................................142
6.6.1 .................................................................................................................................143
6.6.2 ......................................................................................................................144
6.7 ...........................................................................................................................................145
6.7.1 ....................................................................................................................146
6.7.2 ..............................................................................................................................148
6.8 .....................................................................................................................................................149
7....................................................................................................................................................................151
7.1 ..........................................................................................................................................................151
7.2 ....................................................................................................................................151
7.2.1 ...............................................................................................................152
7.2.2 ..................................................................................................152
7.2.3 .................................................................................153
7.3 ......................................................................................153
7.3.1 ...........................................................................................................................................154
7.3.2 .......................................................................................................................155
7.3.3 ......................................................................................................................................156
7.4 ..........................................................................................................................................................158
7.5 ............................................................................................................................................158
7.6 ....................................................................................................................158
7.7 ......................................................................................................................................................160
7.8 ................................................................................................................................................162
7.9 .....................................................................................................................................163
7.10 ................................................................................................................................164
7.11 ...........................................................................................................................................165
7.12 ..............................................................................................................................................167
7.13 ..........................................................................................................................................168
7.14 ...................................................................................................................................................168
8. ................................................................................................................................171
8.1 ..........................................................................................................................................................171
8.2 .....................................................................................................................................171
8.3 ..............................................................................................................................173
8.3.1 ..........................................................................................................173
8.3.2 .........................................................................................................175
8.3.3 ....................................................................................................................................177
8.3.4 ...................................................................................................................................................179
8.4 ..........................................................................................................................181
8.4.1 ...................................................................................181
8.4.2 ....................................................................182
8.4.3 .......................................................................................183
-4-
.
++
8.4.4 ....................................................................................................................183
8.4.5 ........................................................184
8.5 .......................................................................................185
8.6 ...............................................................................................................................186
8.7 ..........................................................................................................188
8.7.1 .........................................................................188
8.8 ...................................................................................................................................189
8.9 .....................................................................................................................................................194
9....................................................................................................................................................................195
9.1 ..........................................................................................................................................195
9.1.1 .........................................................................196
9.1.2 .............................................................................................197
9.2 .........................................................................................................................197
9.3 .................................................................................................................................199
9.3.1 ...........................................................................................................200
9.3.2 ..............................................................................................................202
9.4 ............................................................................................................................................204
9.4.1 .................................................................................................................205
9.4.2 .....................................................................................................................................207
9.4.3 .................................................................................................................................207
9.4.4 ..........................................................................................................208
9.5 .................................................................................................209
9.6 ........................................................................................................................................211
9.6.1 .............................................................................................................212
9.7 ..............................................................................................................213
9.8 ..............................................................................................................213
9.9 .....................................................................................................................................................215
10. ................................................................................................................................................217
10.1 ...................................................................................................................................................217
10.2 ..........................................................................................................................................................218
10.2.1 ......................................................................................................................218
10.2.2 ............................................................................................................219
10.3 ..............................................................................................................................................................220
10.3.1 .........................................................................................................................220
10.3.2 ...................................................................................................................................222
10.3.3 ...............................................................................................................224
10.4 ............................................................................................................................................224
10.4.1 ios..................................................................................................................................................224
10.4.1.1 ........................................................................................................................225
10.4.1.2 .....................................................................................................................................225
10.4.1.3 .........................................................................................................................226
10.4.1.4 ....................................................................................................................................227
10.4.1.5 .......................................................................................................................228
10.4.1.6 ................................................................................................................228
10.4.2 ........................................................................................................................................229
10.4.2.1 -..................................................................................231
10.4.3 ostream.........................................................................................................................................231
10.4.4 istream..........................................................................................................................................232
10.5 .............................................................................................................................................232
10.5.1 ...................................................................................................................................233
10.5.2 ..................................................................................................................................234
10.5.3 ...........................................................................................................................................235
10.6 - ..............................................................................................................................................236
10.7 ...................................................................................................................................................238
11. .................................................................................................239
11.1 ........................................................................................................................................................239
11.2 .............................................................................................................................................241
11.3 ..........................................................................................................................................242
11.3.1 .........................................................................................................................................244
11.3.2 ............................................................................................................................245
11.3.3 ............................................................................................................................246
11.3.3.1 1: ..........................................................................................................247
11.3.3.2 2: ...........................................................................................247
11.3.3.3 3: .......................................................................................................248
11.3.3.4 4: ..................................................................................................248
11.3.3.5 ......................................................................................................249
11.3.3.6 ..................................................................................................................249
-5-
.
++
11.3.4 ............................................................................................................................250
11.3.5 ..........................................................................................................................................251
11.3.6 ......................................................................................................................................252
11.3.7 .......................................................................................................................................252
11.4 ...................................................................................................................................252
11.4.1 .....................................................................................................................253
11.4.2 ......................................................................................................................................................253
11.4.3 .............................................................................................................................254
11.5 ...................................................................................................................................................255
11.6 ........................................................................................................256
12. ++...............................................................................................................258
12.1 ...............................................................................................258
12.1.1 .........................................................................................................................259
12.1.2 ...............................................................................................................260
12.1.3 ....................................................................................261
12.1.4 .................................................................................................................................263
12.2 ............................................................................................................................................................265
12.2.1 ?....................................................................................................................265
12.2.2 ...................................................................................................................................266
12.2.3 .............................................................................................268
12.2.4 ................................................................................................................269
12.2.5 .........................................................................................................271
12.2.6 ....................................................................................................................274
12.2.7 .....................................................................................................................274
12.2.7.1 ......................................................................................................................................275
12.2.7.2 ..................................................................................................................................276
12.2.8 ..............................................................................................................277
12.3 ...................................................................................................................................................278
12.4 ............................................................................................................................280
12.5 ...................................................................................................................................................281
13. ..................................................................................................283
13.1 ........................................................................................................................................................283
13.2 ..........................................................................................................................................284
13.3 ........................................................................................................................................286
13.4 .............................................................................................................................................289
13.5 ..............................................................................................................291
13.5.1 ................................................................................................................................292
13.5.2 Type_info......................................................................................................................................293
13.5.3 .........................................................................295
13.5.4 ................................................................................295
13.5.5
......................296
13.6 ..................................................................................................................................297
13.7 ........................................................................................................................299
13.8 ..................................................................................................................................300
13.9 ...................................................................................................................................302
13.10 ..................................................................................................................................305
13.10.1 ...................................................................................................................................306
13.10.2 .......................................................................................................................307
13.10.3 ..............................................................................................310
13.11 .................................................................................................................................................311
-6-
++

. " ++" ,
. , ,
++, ,
( ) .
. , ,
.
++.
.
:
, .
,
.
, ,
, - .
, ++
. ++.
:
++ . -
- AT&T Bell Laboratories (-,
). .
(), ().
, ,
. . . ++ " ++ ".
-7-
++
" "
( )
, ++.
, .
, ++, .
,
. .

++ -

. ,
, , .
,
. ,
""
.
++. 1 10 ,
. 11 13
. ++. ,
, ,
. ,
, ,
-, , ,
.
++ . , . , ++
, . ++
, - , . ,
, .
, , ,
.
, , .
, , , , ,
, .., - " 100% "
, .
""
, .
. ,
,
.
, .
.
, .
,
. , ++,
. , .

, ,
, , , ,
, , , , ,
, , , ,
. ++ 1985 1991
. . : ,
, . ,
++, , ,
X3J16 ++.
-, .

-8-
++

" , ".
(..)
++ - ,
.
. ,
. , ,
.
. ,
. ,
.
-. ,
, .
++ . - .
, , ,
,
. ++
, . , ++ ,
: , -, ,
, . ++
, ""
(, , , ..).
.
, ++ .
, . ++
. , ,
++.
,
. ++,
.

++ ,
.
, , , , , ,
, , , , ,
.
/.
++ ,
, , ,
. : , , ,
, , , .
, , , ,
, , ++,
Bell Labs , , 26-27 1985 .
-, .-
-9-
++

" - ,- ".
.
,
++. ++, ,
, ++.
; .
++.

. 1 10 . 11 13
++.
.
++ . , ,
, .
, C++ , ,
. , , ,
, , .
,
. , ,
.
1 ++.
.
. ,
- .
.
2, 3 4 ++, :
, . ,
, . .
5 - 8 , . 5
- . , (),
, , , , . 6
, .
( ) ,
. 7 ,
, ,
, , . 8
, .. ++, .
9 ,
. 10 ostream istream,
-.
11 - 13 , ++
. 11
. 12 ++
. 13 .
++.
$$2.3.4, 3.4 2.
R, , $$R.8.5.5.

++.
, . ,
, , , , ,
,
++, , , , ..
++, ,
.
- 10 -
.
++
, , ,
DEC VAX 11/8550 10- UNIX
[25]. , ++, .
" ++", .. .
, . ,
, ,
.
. .
, .
,
. , , (*1) ,
(*2) , (*3) - .
, . (*1) ,
.
, , , (*5)
.

2 - 4. ([1])
.
5 - 8. , -
. ++ .

++ . ,
: , -
. , .
++ . ,
.
, . ++
.
,
.
,
, . ,
.
, , 16 , ,
32- .
++ , :
UNIX.
++ . , ,
,
.
++ ,
.
. ,
, . ,
, ,
.

++ [8], .
,
. , , BCPL [13].
BCPL ++. BCPL,
, ++ - VALOF.
SIMULA-67 [2,3]; ( c
). inspect SIMULA-67 ++.
. ++
, ,
- 11 -
.
-68 [24].
++
++
. ,
. ,
. , :
, - static const,
(protected), .
, ++ , .
[10,18,20,21 23].
- ,
( )
CLU.
CLU [11], ML [26]. ,
1985 1991 .. ( , -
), ++,
.
, " " [16], , 1980 .
, ,
. SIMULA-67 , . "
" .
, .
, , .
++ , , 1983 .,
++ .
++ ( ) , 1983 .
. ++ .
+ . ,
. , ++ , ++.
D, , -
. ++
[12].
++ ,
, . -
.
++ . ,
. " ++" " ++".
, ,
.
.
++,
. 1987 . , ++
[22].
, ++
. ,
++ .
AT&T Bell Laboratories ,
.
, .. ,
AT&T. ,
.
20 ,
ANSI ++. "
++" [4]. .
, Hewlett-Packard 1989 . ANSI
X3J16. , ++ ANSI ( )
ISO ( ).
++ ,
. , complex, vector stack,
. .
. ,
. task, [19] 13 $$6.8
, " ".
. task .
- 12 -
.
++
. ,
, . .
- ($$10),
. ($$10.4.2). map ($$8.8) .. Pool ($$13.10),
($$5.5.6).
Vector, Map, Slist sort, 8.
++
++ :
(1) , ;
(2) ;
(3) ;
(4) UNIX.
, , " " ,
, , . , "
" ( )
.
++ , , ,
. , ,
(., , [15]). :
(1) , ++,
, ++ ;
(2) ,
++
;
(3) , ;
++ ;
(4) ++
, , ,
. ++
, ,
.
, ++ [14].
ANSI [27] , , ,
" ". , , void*
ANSI , ++. , ++
, . ++ ,
($$R.18). ++ ANSI C, [9].
,
,
++.
++ .
, ++ . ,
() , ++ , (. "
" ). , ++.
, [8] ++.
++ .

++ , , ,
C++. ,
, , , , ..
, . new, delete throw, ,
++
.
++ ( )
, . ,
,
- 13 -
.
.
++
,
. ++
, .
, .
. ++ ,
, . ,
,
. ,
, . ,
,
,
.
++ .
. (, 1000 )
, . ,
, . 10 000
, , ,
. ++ , ,
25000 . ,
.
, , . ,
, ,
. ,
, .
, ,
.
, ,
, ..
++ ,
.
. ,
.
, ++ , ,
. ,
. ++ ,
. ,

. 11 12.
, ,
.. , .
,
, ,
.
, ,
. ++ : ++,
, ..,
, . ++ ,
, , , .

:
, ,
. , " ".
"" ,
. . ,
" ",
, . ,
, .
, , ,
, .
- .
, , , .
- 14 -
.
++
; ,
. , ,
, .. .

.
. ,
++ .
++
, :
, , , ,
, . , ,
, ,
. .
,
.
. - ; :
, . , ,
.
,
. , :
? () ?
? ,
, , , . , ,
,
, .
, :
, , ..
, .
, ,
. ++ , , .
, .
, ,
, , .
"" - () . A B.
"A B", "A B", "A B"
- . "A B", ,
.
, , -
, .. ,
.
. ,
, .
()
($$6.5). , ,
, .. .
, .
.
. ,
, . +
+ ($$5.4.1).
,
, , ,
, .
, ,
, .
.
. , "
T", T . , ,
. - ,
, , .
- 15 -
.
++
, , ,
, .
, .
" ++?" "
?". : " , , , "
" ". ++ ,
, .

" ", ++.
, ,
.
, .
. , , .
, ! , .
[1] ,
,

.
, .
[a] "" ,
[b] "" ,
.
[c] , ,
.
[d] , .
[2] ,
, :
[] .
[b] ( ).
[c] -.
[d] friend ( , [], [b] [c]).
[e] - .
[f] " "; .
[g] - .

, ++
. ++.
" " ($$R.18). ,
++ ,
. ++: const ($$2.5) enum ($$2.5.1),
; inline ($$4.6.2),
, ; ($$8),
. , ,
, ++ , .
malloc(), new ($$3.2.6). ,
, .
, - , ;
($$2.6.2). void*,
, . -
, - .
, ++,
extern "C" ($$4.4).
,
, , -
.
- 16 -
++

. ,
, , .
[1] A.V.Aho, J.E.Hopcroft, and J.D.Ulman: Data Structures and Algoritms. Addison-Wesley, Reading,
Massachusetts. 1983.
[2] O-J.Dahl, B.Myrhaug, and K.Nugaard: SIMULA Common Base Language. Norwegian Computing Ctnter
S-22. Oslo, Norway. 1970
[3] O-J.Dahl and C.A.R.Hoare: Hierarhical Program Construction in Structured Programming. Academic
Press, New York. 1972. pp. 174-220.
[4] Margaret A.Ellis and Bjarne Stroustrup: The Annotated C++ Reference Manual. Addison-Wesley, Reading,
Massachusetts. 1990.
[5] A.Goldberg and D.Rodson: SMALLTALK-80 - The Language and Its Implementation. Addison-Wesley,
Reading, Massachusetts. 1983.
[6] R.E.Griswold et.al.: The Snobol14 Programming Language. Prentice-Hall, Englewood Cliffs, New Jersy,
1970.
[7] R.E.Griswold and M.T.Griswold: The ICON Programming Language. Prentice-Hall, Englewood Cliffs,
New Jersy. 1983.
[8] Brian W.Kernighan and Dennis M.Ritchie: The C Programming Language. Prentice-Hall, Englewood
Cliffs, New Jersy. 1978. Second edition 1988.
[9] Andrew Koenig and Bjarne Stroustrup: C++: As Close to C as possible - but no closer. The C++ Report.
Vol.1 No.7. July 1989.
[10] Andrew Koenig and Bjarne Stroustrup: Exception Handling for C++ (revised). Proc USENIX C++
Conference, April 1990. Also, Journal of Object Oriented Programming, Vol.3 No.2, July/August 1990.
pp.16-33.
[11] Barbara Liskov et.al.: CLU Reference Manual. MIT/LCS/TR-225.
[12] George Orwell: 1984. Secker and Warburg, London. 1949.
[13] Martin Richards and Colin Whitby-Strevens: BCPL - The Language and Its Compiler. Cambridge
University Press. 1980.
[14] L.Rosler: The Evolution of C - Past and Future. AT&T Bell Laboratories Technical Journal. Vol.63 No.8
Part 2. October 1984. pp.1685-1700.
[15] Ravi Sethi: Uniform Syntax for Type Expressions and Declarations. Software Practice & Experience,
Vol.11. 1981. pp.623-628.
[16] Bjarne Stroustrup: Adding Classes to C: An Exercise in Language Evolution. Software Practice &
Experience, Vol.13. 1983. pp.139-61.
[17] Bjarne Stroustrup: The C++ Programming Language. Addison-Wesley. 1986.
[18] Bjarne Stroustrup: Multiple Inheritance for C++. Proc. EUUG Spring Conference, May 1987. Also
USENIX Computer Systems, Vol.2 No 4, Fall 1989.
[19] Bjarne Stroustrup and Jonathan Shopiro: A Set of C classes for Co-Routine Style Programming. Proc.
USENIX C++ conference, Santa Fe. November 1987. pp.417-439.
[20] Bjarne Stroustrup: Type-safe Linkage for C++. USENIX Computer Systems, Vol.1 No.4 Fall 1988.
[21] Bjurne Stroustrup: Parameterized Type for C++. Proc. USENIX C++ Conference, Denver, October 1988.
pp.1-18. Also, USENIX Computer Systems, Vol.2 No.1 Winter 1989.
[22] Bjarne Stroustrup: Standardizing C++. The C++ Report. Vol.1 No.1. January 1989.
[23] Bjarne Stroustrup: The Evolution of C++: 1985-1989. USENIX Computer Systems, Vol.2 No.3. Summer
1989.
[24] P.M.Woodward and S.G.Bond: Algol 68-R Users Guide. Her Majesty's Stationery Office, London. 1974.
[25] UNIX Time-Sharing System: Programmer's Manual. Research Version, Tenth Edition. AT&T Bell
Laboratories, Murray Hill, New Jersy, February 1985.
[26] Aake Wilkstroem: Functional Programming Using ML. Prentice-Hall, Englewood Cliffs, New Jersy. 1987.
[27] X3 Secretariat: Standard - The C Language. X3J11/90-013. Computer and Business Equipment
Manufactures Association, 311 First Street, NW, Suite 500, Washington, DC 20001, USA.

11.
- 17 -
++
1. ++
" , , ".
(" VI", II)
++.
.
. ,
.
1.1
++ , :
-
- .
.
$$1.2 "", "" "" . ,
.
" " ". ++ - "
". , ,
- . C
++. - "
" " - ".
,
.
$$1.3 .
, , , , -
. 2, 3 4.
$$1.4 , .
, , , ,
, ,
. 5, 7, 8 9.
$$1.5 - . ,
, .
6.
$$1.6
, ++ .
, ,
.
- ,
, , ,
. , .
, .
1.2
- - , ""
. - , :
, -
.
. ,
, ,
( , ).
, ,
. , . ,
- ,
, .
- 18 -
.
++
()
, . , ,
.
- . ,
.
, , .
, , ,
. . ,
, ,
. :
[1] .
[2] ,
.
[3] .
[4] ,
.
[5] ,
.
.
. : ", ,
".
, , ++
- . ,
, - .

, . .
1.2.1
(, , ) :
, ; !
, .

. , ,
, , , (,
, , ...) .. , 60, 68,
.

. ,
:
double sqrt ( double arg )
{
//
}
void some_function ()
{
double root = sqrt ( 2 );
// ..
}
// , .
.
1.2.2

. .
, .
:
, ; ,
- 19 -
.
++
" ".
,
. ""
. - . :
[1] (, push () pop ()).
[2] , (, )
.
[3] .
-2 , .
, :
// , :
void push ( char );
char pop ();
const int stack_size = 100;
, stack.h,
:
#include "stack.h"
static char v [ stack_size ];
//
//
//
//

``static''
/

static char * p = v;
void push ( char c )
{
//
}
char pop ()
{
//, ,
}
, , ,
. : v p
, .. (), .
:
#include "stack.h"
//
void some_function ()
{
push ( 'c' );
char c = pop ();
if ( c != 'c' ) error ( "" );
}
, ,
, .. , ,
, . ++
, ($$5.4.3 $
$5.4.4). ++, , ,
, .. .
1.2.3
,
. ,
:
class stack_id { /* ... */ };
// stack_id
//
//
stack_id create_stack ( int size ); //

//
void push ( stack_id, char );
char pop ( stack_id );
- 20 -
.
destroy_stack ( stack_id );
++
//
, , ,
, "",
.
"" . ,
. "" ,
, ""
.
, ,
. (
), . ,
(- ) ,
( stack_id ). ,
, , , :
void f ()
{
stack_id s1;
stack_id s2;
s1 = create_stack ( 200 );
// : s2
push ( s1,'a' );
char c1 = pop ( s1 );
destroy_stack ( s2 );
// : s1
s1 = s2;
//
//
// ,
// s2
, , ,
, .
, Clu, ++ ,
, , .
, , ,
.
. , , ,
. " "
, $$4.6. :
, ; .
, ,
,
, .
, ,
:
class complex
{
double re, im;
public:
complex(double r, double i) { re=r; im=i; }
complex(double r) // float->complex
{ re=r; im=0; }
friend complex operator+(complex, complex);
friend complex operator-(complex, complex); //
friend complex operator-(complex)
//
friend complex operator*(complex, complex);
friend complex operator/(complex, complex);
// ...
};
- 21 -
.
++
(.. ) complex
. (private): re im
, complex.
:
complex operator + ( complex a1, complex a2 )
{
return complex ( a1.re + a2.re, a1.im + a2.im );
}
:
void f ()
{
complex
complex
complex
// ...
c = - (
}
a = 2.3;
b = 1 / a;
c = a + b * complex ( 1, 2.3 );
a / b ) + 2;
( ) .
1.2.4
" ".
. ,
. . , ,
shape (). , : (circle),
(triangle) (square). :
class point { /* ... */ };
class color { /* ... */ };
shape :
enum kind { circle, triangle, square };
class shape
{
point center;
color col;
kind k;
//
public:
point where () { return center; }
void move ( point to ) { center = to; draw (); }
void draw ();
void rotate ( int );
//
};
" " k , , draw () rotate (), ,
( ,
k -). draw () :
void shape :: draw ()
{
switch ( k )
{
case circle:
//
break;
case triangle:
//
break;
case square:
//
break;
}
}
, . , .
- 22 -
.
++
, . ,
, , . ,
,
.
. , ,
, .
, ,
,
(.. shape).
1.2.5 -
, (, ,
..) (, - ,
, , ..). , .
, ,
- . .
, . ,
:
class shape
{
point center;
color col;
// ...
public:
point where () { return center; }
void move ( point to ) { center = to; draw(); }
virtual void draw ();
virtual void rotate ( int );
// ...
};
, , (..
) , virtual
(). ++ : "
, ". ,
:
void rotate_all ( shape v [], int size, int angle )
// "v" "size"
// "angle"
{
int i = 0;
while ( i<size )
{
v [ i ] . rotate ( angle );
i = i + 1;
}
}
, , -
( ):
class circle : public shape
{
int radius;
public:
void draw () { /* ... */ };
void rotate ( int ) {} // ,
};
++ circle shape, shape
circle. , ""
"" circle shape .

:
, ; ;
.
- 23 -
.
++
, .
-
, .
, , , , . ,
,
, . , -
, , .
.
.
. :
, "" ,
.
, - ,
, [2] [6],
11.
, ,
, , . ,
, .
1.3 " "

, ,
. - .
++ ( ), -
.
.
1.3.1
++ :
main () { }
, main, .
{ } ++ .
() main. ++
main(), .
- . , Hello, World!
( !):
#include <iostream.h>
int main ()
{
cout << "Hello, World!\n";
}
#include <iostream.h> , ,
-, iostream.h.

cout << "Hello, World!\n"
. << ("") .
"Hello, World!\n" cout.
, . : \
. \n
( ), Hello, world!
, main(), ,
. , - "" .
/ 10.
- 24 -
++
1.3.2
. ,
. ,
int inch;
, inch int, .. inch .
- , . . ,
, .
, " " , :
char
short
int
long
. :
float
double
long double
. char ,
( ). int ,
( ).
:
+
*
/
%
(, )
(, )
()
()
( )
:
==
!=
<
<=
>=
()
( )
( )
( )
( )
++
, :
double d;
int i;
short s;
// ...
d = d + i;
i = s * i;
= .
1.3.3
:
char v [ 10 ]; // 10
:
char * p; //
[] " ", * " ".
, v 10 : v [ 0 ] ... v [ 9 ].
:
p = & v [ 3 ]; // p 4- v
& .
1.3.4
++ .
if, switch while.
- 25 -
.
++
. ,
i, - c:
int main ()
{
const float fac = 2.54;
float x, in, cm;
char ch = 0;
cout << "enter length: ";

cin >> x;
//
cin >> ch
//
if ( ch == 'i' )
{
//
in = x;
cm = x * fac;
}
else if ( ch == 'c' )
{ //
in = x / fac;
cm = x;
}
else
in = cm = 0;
cout << in << " in = " << cm << " cm\n";
>> (" ") ; cin .

, >>, , ;
.
switch () .
:
switch ( ch )
{
case 'i':
in = x;
cm = x * fac;
break;
case 'c':
in = x / fac;
cm = x;
break;
default:
in = cm = 0;
break;
}
break .
. ,
default. default .
, 10 :
int v1 [ 10 ];
int v2 [ 10 ];
// ...
for ( int i=0; i<10; i++ ) v1 [ i ] = v2 [ i ];
: " i , i 10, i-
i." (++) 1.
1.3.5
- ,
, . , :
extern float pow ( float, int );
// pow ()
- 26 -
.
++
int main ()
{
for ( int i=0; i<10; i++ ) cout << pow ( 2, i ) << '\n';
}
. pow float int,
float. ,
.
,
, , .
. , pow(12.3,"abcd")
, "abcd" , int. pow(2,i)
( 2) (float),
. pow :
float pow ( float x, int n )
{
if ( n < 0 )
error ( ": pow () ");
switch ( n )
{
case 0: return 1;
case 1: return x;
default: return x * pow ( x, n-1 );
}
}
, ( ),
( ).
return.
, ,
, . ,
, . ,
: - , - :
int pow ( int, int );
double pow ( double, double );
//...
x = pow ( 2,10 );
// pow ( int, int )
y = pow ( 2.0, 10.0 );// pow ( double, double )
;
7.
" ", " ".
, .
, :
void swap ( int * p, int * q )
{
int t = * p;
* p = * q;
* q = t;
}
* ( ),
, . :
void f ( int i, int j )
{
swap ( & i, & j );
}
, :
void swap (int & r1, int & r2 )
{
int t = r1;
r1 = r2;
r2 = t;
}
void g ( int i, int j )
- 27 -
.
{
swap ( i, j );
}
++
T T& " T". ,

. , swap
.
1.3.6
++ "". ""
, - .
, , . extern
, . :
extern "C" double sqrt ( double );
extern ostream cout;

- , .
, . ,
sqrt math.h, ,
4, :
#include <math.h>
//...
x = sqrt ( 4 );
,
, . ,
, -, ($$4.3).
, ,
.
( - <math.h>)
, . - /usr/include/CC. ,
, , .
:
#include "math1.h"
#include "/usr/bs/math2.h"
math1.h math2.h /usr/bs.
, ,
. header.h :
// header.h
extern char * prog_name;
extern void f();
main.c :
// main.c
#include "header.h"
char * prog_name = ", ";
int main ()
{
f();
}
f.c:
// f.c
#include <stream.h>
#include "header.h"
void f ()
{
cout << prog_name << '\n';
}
++ -
++.
- 28 -
.
:
++
$ CC main.c f.c -o silly

$ silly
,
$
++ ($$5.4).
1.4

( ) .
. , , ,
.
.
1.4.1
,
.
.
:
class vector
{
// ...
public:
void init ( init size );
};
// init ()
// vector
// ...
void f ()
{
vector v;
// v
v.init ( 10 );
//
}
. ,
. ,
(
). .
, ,
. ,
. ++ .
, , ~ ( ++
). :
class vector
{
int sz;
//
int * v;
//
public:
vector ( int );
//
~vector ();
//
int& operator [] ( int index ); //
};
vector :
vector::vector ( int s )
{
if ( s <= 0 )
error ( " " );
sz = s;
v = new int [ s ];
// s
- 29 -
.
}
++
vector :
vector::~vector ()
{
delete [] v;
}
// ,
// v
++ new ,
( , " ").
.
,
(., , $$9.4).
1.4.2

, , .
. vector:
void f ()
{
vector v1 ( 100 );
vector v2 = v1;
v1 = v2;
// ...
// v2,
// v1
// v2 v1
v2 v1.
, :
class vector
{
int * v;
int sz;
public:
// ...
void operator = ( const vector & ); //
vector ( const vector & );
//
};
, vector
. :
void vector::operator = ( const vector & a )
//
{
if ( sz != a.sz )
error ( " =" );
for ( int i = 0; i < sz; i++ ) v [ i ] = a.v [ i ];
}
" " ,
, , :
vector::vector ( const vector & a )
//
{
sz = a.sz;
//
v = new int [ sz ];
//
for ( int i = 0; i < sz; i++ )
//
v [ i ] = a.v [ i ];
}
++ T(const T&) T.
T T.
T(const T&)
.
- 30 -
++
1.4.3
, ? ,
, Vector. ,
, ,
"" :
template < class T > class Vector
{ // T
T * v;
int sz;
public:
Vector ( int s )
{
if ( s <= 0 )
error ( " Vector " );
v = new T [ sz = s ];
// s T
}
T & operator [] ( int i );
int size () { return sz; }
// ...
};
. .
Vector ,
.
template<class T>, , , ( ).
:
void f ()
{
Vector < int > v1 ( 100 );
Vector < complex > v2 ( 200 );
//
//
//
v2 [ i ] = complex ( v1 [ x ], v1 [
// ...
100
200

y ] );
}
, ,
. , Clu .
-
, .
1.4.4
,
(, , " "). , -68
Clu .
vector. , ,
? vector ,
, ( ,
). : ,
. .
:
class vector {
//
class range { };
// ...
};
vector::operator[]() ,
. " " ("throw the
exception"):
int & vector::operator [] ( int i )
{
if ( i < 0 || sz <= i ) throw range ();
return v [ i ];
- 31 -
.
}
++
, , ,
range (vector::range);
.
:
void f ( int i )
{
try
{
//
//
vector v ( i );
// ...
v [ i + 1 ] = 7;
// range
// ...
g (); // range
//
}
catch ( vector::range )
{
error ( "f (): vector range error" );
return;
}
}
.
9.
1.4.5
, , ,
, complex(double),
++. , ,
, :
complex
complex
a = b +
a = b +
a = complex ( 1 );
b = 1;
complex ( 2 );
2;
// : 1 -> complex ( 1 )
// : 2 -> complex ( 2)
++ ,
, . ,
, "" (, , , )
( ).
:
complex a = 2;
complex b = a + 2;
b = 2 + a;
// : operator + ( a, complex ( 2 ))
// : operator + ( complex ( 2 ), a )
"+" ,
. , complex ,
- .
1.4.6
, - , :
,- ,
. :
template < class T >
class stack
{
public:
virtual void push ( T ) = 0;
virtual T pop () = 0;
};
//
//
=0 , , stack
- 32 -
.
++
, .. .
, :
class cat { /* ... */ };
stack < cat > s;
// : -
void some_function ( stack <cat> & s, cat kitty ) //
{
s.push ( kitty );
cat c2 = s.pop ();
// ...
}
,
.
. , :
class astack : public stack < T >
{
//
// -
// ...
public:
astack ( int size );
~astack ();
void push ( T );
T pop ();
};
:
class lstack : public stack < T >
{
// ...
};
:
void g ()
{
lstack < cat > s1 (
astack < cat > s2 (
cat Ginger;
cat Snowball;
some_function ( s1,
some_function ( s2,
}
100 );
100 );
Ginger );
Snowball );
, , , (..
g()), (.. some_function())
. ,
.
1.5 -
-
, - (
, , ).
-. , (
). ,
, , . , ,
, . -
,
, .
1.5.1
- -
- 33 -
.
++
- , . ,
, p. p->rotate(45)? ++
, , rotate()
. , p->rotate() , p
, rotate .
, ( ),
. ,
.
, , , $$1.2.5:
class shape
{
// ...
public:
// ...
virtual void rotate ( int );
// ...
};
p , , :
T * p;
T - shape . , ,
p, rotate(), int. , p>rotate(45) .
shape::rotate() ,
. , rotate ,
, .
, , circle::rotate,
.
, rotate .
shape :
center
vtbl:
color
&X::draw
&Y::rotate
...
...
vtbl
, vtbl,
, ... . X Y ,
. circle X Y circle.
, .
1.5.2

. , "
-". ++ . , ,
,
. , ,
Smalltalk, " -".
:
template < class T > class stack
{
T * p;
int sz;
public:
stack ( int );
~stack ();
void push ( T );
T & pop ();
};
,
plane ():
- 34 -
.
stack < plane * > cs ( 200 );
void f ()
{
cs.push ( new Saab900 );
cs.push ( new Saab37B );
cs.pop () -> takeoff ();

++
// :
// plane*, car*
// : Saab 37B -
// , .. plane
,
:
//
// ; ++
Stack s;
//
//
void f ()
{
s.push ( new Saab900 );
s.push ( new Saab37B );
s.pop () -> takeoff ();
// : Saab 37B -
// :
//
}
, ,
, ++.
,
, . ++
, Smalltalk
,
. , ++ ,
, .
1.5.3
A B, B A. .. B A . , , B
A1 A2. .
.
displayed task. ,
, - , .
, , :
class my_displayed_task: public displayed, public task
{
//
};
class my_task: public task {
//
// , .. displayed
//
};
class my_displayed: public displayed
{
//
// .. task
//
};
,
. , , ,
, , . ++
, .
.
:
- 35 -
.
++
class task
{
public:
void trace ();
// ...
};
class displayed
{
public:
void trace ();
// ...
};
class my_displayed_task:public displayed, public task
{
// trace ()
};
void g ( my_displayed_task * p )
{
p -> trace (); // :
}
++ - ,
. :
,
, ,
. ++ ,
, :
class my_displayed_task:public displayed, public task
{
// ...
public:
void trace ()
{
//
displayed::trace (); // trace () displayed
task::trace ();
// trace () task
}
// ...
};
void g ( my_displayed_task * p )
{
p -> trace (); //
}
1.5.4
( - , )
" ". ,
? , - ,
: , , , . :
class window
{
// ...
protected:
Rectangle inside;
// ...
};
class dumb_terminal : public window
{
// ...
public:
void prompt ();
// ...
};
window inside Rectangle (protected),
- , , dumb_terminal::prompt(),
- 36 -
.
++
, . window::inside .
(, ""
) , ,
(, " "
).
: ,
, , .
. , -
, . ++
(private) .
complex shape.
, .. ,
. $$6.6
.
1.6
++ " ", .
.
, ,
- , , ,
, :
;
;

;
.
, (
, )
, . ,
,
. , , , , ,
, - .
,
, ,
.
,
, . ++
, , ,
. , ++ , ,
, .
,
, .
, , .
, .
, .
, ,
.
++ ,
, ,
($$12.2). ++,
, .
, ,
" ".
, , , .
- 37 -
++
2.
" ".
(.. )
(char, int, float ..)
(, , ..). , ,
, . , , ,
, . ++
. ,
. , ++,
.
. 5 7.
2.1
() , ++.
, , , .
, :
char ch;
int count = 1;
char* name = "Njal";
struct complex { float re, im; };
complex cvar;
extern complex sqrt(complex);
extern int error_number;
typedef complex point;
float real(complex* p) { return p->re; };
const double pi = 3.1415926535897932385;
struct user;
template<class T> abs(T a) { return a<0 ? -a : a; }
enum beer { Carlsberg, Tuborg, Thor };
, .
, .. ,
. ch, count, name cvar .
, , . real
. pi 3.1415926535897932385.
complex . point complex, point
complex. :
extern complex sqrt(complex);
struct user;
, , , - .
sqrt - . error_number
int error_number. -
user, , . ++
, .
.
:
int count;
int count;
// :
extern short error_number; // :
( extern . #4.2):
"" , :
struct complex { float re, im; };
typedef complex point;
float real(complex* p) { return p->re };
const double pi = 3.1415926535897932385;
- 38 -
.
++
, "" ; , ,
:
int count = 1;
char* name = "Bjarne";
//...
count = 2;
name = "Marian";
:
char ch;
, , .
2.1.1
. ,
. ( "
"), ,
. (
" "), ,
.
; .. ,
. ( ) .
:
int x;
void f()
{
int x;
x = 1;
{
int x;
x = 2;
}
x = 3;
}
int* p = &x;
// x
// x x
// x
// x
// x
// x
// x
. ,
. - , ,
. , .
, i x,
.

:: , :
int x;
void f2()
{
int x = 1;
::x = 2;
}
// x
// x
.
( ,
- . $$R.3.2). , ,
. :
int x;
void f3()
{
int x = x;
}
//
. ,
: " ". , ::,
. :
int x = 11;
void f4()
//
{
int y = x;
// x
- 39 -
.
++
int x = 22;
y = x;
// x
}
y x, .. 11,
x, .. 22.
, :
void f5(int x)
{
int x;
}
//
x . ,
.
2.1.2
"", , .
"", , *p[a+10]=7. ,
" ".
: " - , ,
" ($$R.3.7). (lvalue - left value, .. )
", ".
(. $$2.5). , const,
.
2.1.3
,
, . ,
( ) .
static, .
, " " , :
int a = 1;
void f()
{
int b = 1;
f()
static int c = a;
cout << " a = " << a++
<< " b = " << b++
<< " c = " << c++ << '\n';
}
int main()
{
while (a < 4) f();
}
//
//
:
a = 1 b = 1 c = 1
a = 2 b = 1 c = 2
a = 3 b = 1 c = 3
'' #include <iostream>.
, .
"++" , . . a++ : 1 a.
static, ,
(#2.4.5). new delete,
, (. $$3.2.6).
2.2
() . .
_. ++ .
,
(, ), , , . ,
, ++,
, . (, $ )
- 40 -
.
++
. ++ (.
$$R.2.4), :
hello
DEFINED
var0
this_is_a_most_unusially_long_name
foO
bAr
u_name
HorseSense
var1
CLASS
_class
___
,
:
012
pay.due
a fool
foo~bar
$sys
.name
class
if
3var
, Count count - .
, , . ,
, ,
,
.

, , var10 - , var
10. elseif - (), else if.
2.3
() . ,
(.. , ), .
:
int error_number;
float real(complex* p);
error_number int (), ,
. real ,
complex. , . ,
int complex, . ,
. ,
sizeof ( , ) new (
). :
int main()
{
int* p = new int;
cout << "sizeof(int) = " << sizeof(int) '\n';
}
($$3.2.5),
:
float f;
char* p;
//...
long ll = long(p);
int i = int(f);
// p long
// f int
2.3.1
++
. :
char
short int
int
long int
.
:
float
double
long double
, ,
..:
unsigned char
- 41 -
.
unsigned short int
unsigned int
unsigned long int
++
, :
signed
signed
signed
signed
char
short int
int
long int
int , signed
. signed char :
3 - unsigned char, signed char char (. $$R.3.6.1).
( ) int ,
.. long long int, unsigned - unsigned int. , , ,
int. , int:
const a = 1;
static x;
// ,
//
, int,
. (. $$R.7.1).
char. 8
. ++ char, sizeof(char)
1. char
. , unsigned char , , ,
. , unsigned char char
. , signed char .
, ,
.
,
. , ,
(, int) . ,
, , .
:
1==sizeof(char)<=sizeof(short)<=sizeof(int)<=sizeof(long)
sizeof(float)<=sizeof(double)<=sizeof(long double)
sizeof(I)==sizeof(signed I)==sizeof(unsigned I)
I char, short, int long. , char
, 8 , short - , 16 long - , 32 . char
.
, char 0..127. - .
,
. , , unsigned int, ,
.
unsigned, , ,
, :
unsigned surprise = -1;
( ).
2.3.2
.
, , , .
$$R.4 $$R.5.4.
- , .
,
, . ,
,
, 8 :
int i1 = 256+255;
char ch = i1
int i2 = ch;
// ch == 255
// i2 == ?
- 42 -
.
++
ch=i1 ( !),
i2, ch " ", .. 8 .
i2? DEC VAX, char , -1,
Motorola 68K, char - , 255. ++
, ,
.
2.3.3
( ) ,
:
*
&
[]
()
, , . :
int* a;
float v[10];
char* p[20];
// 20
void f(int);
struct str { short length; char* p; };
$$R.8.
, , :
int v[10];
i = v[3];
int* p;
i = *p;
//
//
//
//
, , ,
* & , [] () - . ,
, . , [] ,
*, :
int* v[10];
int (*p)[10];
//
//
, .
.
. , :
int x, y;
// int x; int y;
, ,
( ). :
int* p, y;
int x, *p;
int v[10], *p;
// int* p; int y; int* y;

// int x; int* p;
// int v[10]; int* p;
, , , .
2.3.4 void
void ,
. void .
, .
void f();
void* pv;
// f
//
void*.
, void* (). ,
void*.
, . void*
, .
. ,
. :
void* malloc(unsigned size);
void free(void*);
- 43 -
.
void f()
//
{
int* pi = (int*)malloc(10*sizeof(int));
char* pc = (char*)malloc(10);
//...
free(pi);
free(pc);
}
++
: () - ,
pi void*, malloc(), int.
; $
$3.2.6.
2.3.5
T T T*. , T*
T. , , :
int* pi;
char** cpp;
int (*vp)[10];
int (*fp)(char, char*);
//
//
//
//
char
10

char char*, int
- (), .. ,
. .
* . :
char c1 = 'a';
char* p = &c1;
char c2 = *p;
// p c1
// c2 = 'a'
, p,- c1, , c1, 'a'.

c2 *p 'a'.
. , ,
( ):
int strlen(char* p)
{
int i = 0;
while (*p++) i++;
return i;
}
-: ,
.
int strlen(char* p)
{
char* q = p;
while (*q++) ;
return q-p-1;
}
; $$4.6.9
2.3.6
T T[size] " size T". 0 size1. :
float v[3]; // :
// v[0], v[1], v[2]
int a[2][5];
// ,
char* vpc;
// 32
, :
extern "C" int strlen(const char*); // <string.h>
char alpha[] = "abcdefghijklmnopqrstuvwxyz";
main()
{
int sz = strlen(alpha);
- 44 -
.
for (int i=0; i<sz; i++) {
char ch = alpha[i];
cout << '\''<< ch << '\''
<< " = " <<int(ch)
<< " = 0" << oct(ch)
<< " = 0x" << hex(ch) << '\n';
}
}
++
oct() hex()
. <iostream.h>. alpha
strlen() <string.h>, alpha ($$2.4.4).
ASCII :
'a' = 97 = 0141 = 0x61
'b' = 98 = 0142 = 0x62
'c' = 99 = 0143 = 0x63
...
, alpha: ,
, .
- , , .
, ,
:
char v[9];
v = "a string";
//
(. $$7.10).
, ;
. ,
. :
int
int
char
char
v1[]
v2[]
v3[]
v4[]
=
=
=
=
{
{
{
{
1, 2, 3, 4 };
'a', 'b', 'c', 'd' };
1, 2, 3, 4 };
'a', 'b', 'c', 'd' };
v3 v4 - ( ) ; v4 ,
. char
.
.
, , . -
(. $$3.2.2). :
int bad[5,2];
//

int v[5][2];
int bad = v[4,1];
int good = v[4][1];
//
//
, , , 5
char:
char v[2][5];
, .
char v[2][5] = {
{ 'a', 'b', 'c', 'd', 'e' },
{ '0', '1', '2', '3', '4' }
};
main() {
for (int i = 0; i<2; i++) {
for (int j = 0; j<5; j++)
cout << "v[" << i << "][" << j
<< "]=" << v[i][j] << " ";
cout << '\n';
}
}
- 45 -
.
:
++
v[0][0]=a v[0][1]=b v[0][2]=c v[0][3]=d v[0][4]=e

v[1][0]=0 v[1][1]=1 v[1][2]=2 v[1][3]=3 v[1][4]=4
2.3.7
++ .
, alpha :
int main()
{
char alpha[] = "abcdefghijklmnopqrstuvwxyz";
char* p = alpha;
char ch;
while (ch = *p++)
cout << ch << " = " << int (ch)
<< " = 0" << oct(ch) << '\n';
}
p :
char* p = &alpha[0];
-,
. ,
strlen :
void f()
{
extern "C" int strlen(const char*);
char v[] = "Annemarie";
char* p = v;
strlen(p);
strlen(v);
}
// <string.h>
, : ,
v ($$4.6.3).
+, -, ++ --
. p T*, , p
T. p+1 , p-1 - .
, () p+1 sizeof(T) , p.

main()
{
char cv[10];
int iv[10];
char* pc = cv;
int* pi = iv;
cout << "char* " << long(pc+1)-long(pc) << '\n';
cout << "int* " << long(pi+1)-long(pi) << '\n';
}
, (Maccintosh) , - ,
:
char* 1
int* 4
long ($$3.2.5).
"" int, ++
int (.. sizeof(int)<sizeof(char*)).
,
( ).
() , .
; .
, ,
( ),
. :
- 46 -
.
void f()
{
int v1[10];
int v2[10];
int i = &v1[5]-&v1[3];
i = &v1[5]-&v2[3];
int* p = v2+2;
p = v2-2;
}
++
//
//
//
//
2

p == &v2[2]
*p
, .
, ++ .
,
. , , .
(. $$1.4.3).
2.3.8
,
() . :
struct address {
char* name;
long number;
char* street;
char* town;
char* state[2];
int
zip;
};
//
//
//
//
//
//
"Jim Dandy"
61
"South Street"
"New Providence"
'N' 'J'
7974
, address, .
, , .
: ++ ,
, .
address , ,
. () . :
address jd;
jd.name = "Jim Dandy";
jd.number = 61;
struct , . :
address jd = {
"Jim Dandy",
61, "South Street",
"New Providence", {'N','J'}, 7974
};
($$5.2.4). , jd.state
"NJ". '\0', "NJ" ,
, jd.state. c ,
->. :
void print_addr(address* p)
{
cout << p->name << '\n'
<< p->number << ' ' << p->street << '\n'
<< p->town << '\n'
<< p->state[0] << p->state[1]
<< ' ' << p->zip << '\n';
}
,
. :
address current;
address set_current(address next)
{
address prev = current;
current = next;
return prev;
- 47 -
.
}
++
, , , (== !=), .
(. 7).
.
, ,
( ,
). -
. "" . ,
sizeof(address) 24, 22, .
, , ,
. :
struct link{
link* previous;
link* successor;
};
, .

struct no_good {
no_good member;
};
( no_good). (
) ,
. :
struct list;
struct link {
link* pre;
link* suc;
list* member_of;
};
struct list {
link* head;
};
//
list, link .
, ,
. :
class S;
extern S a;
S f();
void g(S);
// 'S' -
, S :
void h()
{
S a;
f();
g(a);
}
// : S -
// : S -
// : S -
2.3.9
, . ,
:
struct s1 { int a; };
struct s2 { int a; };
:
s1 x;
s2 y = x;
// :
, , :
s1 x;
int i = x;
// :
- 48 -
.
++
, , , , . ,
typedef, , .
:
typedef char* Pchar;
Pchar p1, p2;
char* p3 = p1;
.
2.3.10
.
, (.$$7). X&
X. :
int i = 1;
int& r = i;
int x = r;
r = 2;
// r i
// x = 1
// i = 2;
, .. , .
, .
, , ,
int ii = 0;
int& rr = ii;
rr++;
// ii 1
++ , rr++ rr; ++
, .. ii. ,
: , .
, rr, &rr.
, .
, (.. ,
; . $$R.3.7). T . ,
&T , T. :
[1] -, , (.$$R.8.4.3);
[2] ;
[3] , .
:
double& dr = 1;
const double& cdr = 1;
// :
//
:
double* cdrp;
double temp;
temp = double(1);
cdrp = &temp;
// ,
:
,
, . ,
.
(.$$R.6.3). ,
. :
void incr(int& aa) { aa++; }
void f()
{
int x = 1;
incr(x);
// x = 2
}
, ,
incr aa x. , ,
, . ,
, :
int next(int p) { return p+1; }
- 49 -
.
void inc(int* p) { (*p)++; }
void g()
{
int x = 1;
x = next(x);
inc(&x);
}
++
// x = 2
// x = 3
, , ,
.
. .

pair:
struct pair {
char* name;
int val;
};
//
//
, .
find(), , .
pair (: ).
- . , ,
:
const int large = 1024;
static pair vec[large+1];
pair* find(const char* p)
/*
// "pair":
// p, , "pair",
// "pair"
*/
{
for (int i=0; vec[i].name; i++)
if (strcmp(p,vec[i].name)==0) return &vec[i];
if (i == large) return &vec[large-1];
return &vec[i];
}
value(), , (
):
int& value(const char* p)
{
pair* res = find(p);
if (res->name == 0) {
// ,
//
res->name = new char[strlen(p)+1];
strcpy(res->name,p);
res->val = 0;
// 0
}
return res->val;
}
() value() , (
) . , , :
const int MAX = 256;
//
main()
//
{
char buf[MAX];
while (cin>>buf) value(buf)++;
for (int i=0; vec[i].name; i++)
cout << vec[i].name << ": " << vec [i].val<< '\n';
}
while cin buf
(. 10), , , .
vec find(). for
cin .
aa bb bb aa aa bb aa aa
- 50 -
.
:
++
aa: 5
bb: 3
[] ($$8.8)
.
2.4
++ : ,
. , (0)
, char[].
. - ,
. ++ : (1)
const , ; (2)
; (3) .
2.4.1
: , ,
. :
0
1234
976
12345678901234567890
int, , int,
long. ,
. , , x (0x),
( 16), , ,
, ( 8).
:
0
02
077
0123
: 0, 2, 63, 83.
:
0x0
0x2
0x3f
0x53
a, b, c, d, e f 10, 11,
12, 13, 14 15, .
, .
, , int 16- , 0xffff
-1.
, 65535.
U unsigned. , L
long. :
void f(int);
void f(unsigned int);
void f(long int);
void g()
{
f(3);
// f(int)
f(3U);
// f(unsigned int)
f(3L);
// f(long int)
}
2.4.2
double. ,
, .
:
1.23
.23
0.23
1.
1.0
1.2e10
1.23e-15
, . , 65.43 e-21
, :
65.43
21
. float,
, f:
- 51 -
.
3.14159265f
++
2.0f
2.997925f
2.4.3
, , , 'a' '0'.
,
, , .
, , . ,
, ASCII, '0' 48,
EBCDIC, 240.
.
, , :

NL(LF)
HT
VT
BS
CR
FF
BEL
\
?
'
"
NUL
ooo
hhh
\n
\t
\v
\b
\r
\f
\a
\\
\?
\'
\"
\0
\ooo
\xhhh
, . - char.
, ,
( \) (
\x).
.
, . :
'\6'
'\60'
'\137'
'\x6'
'\x30'
'\x05f'
6
48
95
ASCII ack
ASCII '0'
ASCII '_'
. ,
(. ). ,
,
.
2.4.4
- , :
" "
, :
('\0'), 0.
sizeof("asdf")==5;
" ", "asdf" char[5].
"" char[1]. , s
strlen(s)==sizeof(s)-1, strlen() '\0'.
\.
, " \.
'\n', :
cout << " \007\n"
7 - ASCII BEL (), \a.
"" :
" ,
"
, :
char alpha[] = "abcdefghijklmnopqrstuvwxyz"
- 52 -
++
"ABCDEFGHIJKLMNOPQRSTUVWXYZ";
, , , alpha
:
"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
'\0', . , "asdf\000hjkl" strcpy() strlen()
"asdf".
,
. , ,
. .
:
char v1[] = "a\x0fah\0129";
char v2[] = "a\xfah\129";
char v3[] = "a\xfad\127";
// 'a' '\xfa' 'h' '\12' '9'

// 'a' '\xfa' 'h' '\12' '9'
// 'a' '\xfad' '\127'
2.4.5
(0) int. ($$R.4) 0
, , .
, 0. , .
( ) " " .
2.5
const,
, :
const int model = 90;
const int v[] = { 1, 2, 3, 4 };
, . -
const, , :
model = 200;
model++;
//
//
, const , ,
.
const:
const char* peek(int i)
{
return hidden[i];
}
// -
, ,
, . , ,
const, (, "" ).
- , ,
. , , ( )
, . ,
, ,
. ,
.
, : .
"" const, , ,
:
const char* pc = "asdf";
pc[3] = 'a';
pc = "ghjk";
//
//
//
, , *
const. :
char *const cp = "asdf";
cp[3] = 'a';
cp = "ghjk";
// -
//
//
- 53 -
.
++
, , const, :
const char *const cpc = "asdf";
cpc[3] = 'a';
cpc = "ghjk";
// - const
//
//
,
, .
. - const, ,
:
char* strcpy(char* p, const char* q); // *q
, .. . ,
const,
, :
int a = 1;
const int c = 2;
const int* p1 = &c;
const int* p2 = &a;
int* p3 = &c;
*p3 = 7;
//
//
//
//
2.5.1.
, , const.
:
enum { ASM, AUTO, BREAK };
, ,
. 0
, :
const ASM = 0;
const AUTO = 1;
const BREAK = 2;
, :
enum keyword { ASM, AUTO, BREAK };
.
int. ( int )
. :
void f()
{
keyword k = ASM;
int i = ASM;
k = i
//
k = keyword(i);
i = k;
k = 4;
//
}
, int :
int .
keyword int, ,
, . ,
keyword key;
switch (key) {
case ASM:
// -
break;
case BREAK:
// -
break;
}
, keyword
. . :
- 54 -
.
enum int16 {
sign=0100000,
most_significant=040000,
least_significant=1
};
++
,
.
2.6.
,
, . :
[1] ;
[2] .
, - . ,
.
, , , , ,
. , ,
, .
2.6.1
, ( : ,
) char, char ++ ,
. ,
, . ,
, . .
,
:
struct sreg {
unsigned enable : 1;
unsigned page : 3;
unsigned : 1;
unsigned mode : 2;
unsigned : 4;
unsigned access : 1;
unsigned length : 1;
unsigned non_resident : 1;
};
//
//
DEC PDP11/45 (,
).
: , .
($$R.3.6.1 $$R.9.6), .
: . sreg
:
sreg* sr0 = (sreg*)0777572;
//...
if (sr0->access) {
//
sr0->access = 0;
}
//
, ,
. ,
, . ,
, , ,
char! , char int ,
. -
.
2.6.2.
, .
, :
- 55 -
.
++
struct entry {
char* name;
char type;
char* string_value;
// type == 's'
int
int_value;
// type == 'i'
};
void print_entry(entry* p)
{
switch(p->type) {
case 's':
cout << p->string_value;
break;
case 'i':
cout << p->int_value;
break;
default:
cerr << "type corrupted\n";
break;
}
}
string_value int_value , ,
. ,
, , :
struct entry {
char* name;
char type;
union {
char* string_value;
int
int_value;
};
};
// type == 's'
// type == 'i'
, entry string_value int_value

, , entry. ,
,
.
,
, . , ,
,
. ,
($
$5.4.6).
"-" ( ,
, ,
). "" int int* VAX,
:
struct fudge {
union {
int i;
int* p;
};
};
fudge a;
a.i = 4095;
int* p = a.p;
//
, .. int int*
, , .
,
($$3.2.5).
, . ,
fudge, , 0:
fudge.p = 0;
int i = fudge.i;
// i 0
, . , fudge
- 56 -
.
:
++
union fudge {
int i;
int* p;
};
() , . ,
(. $$5.4.6).
2.7
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
(*1) "Hello, world" (. $$1.3.1).

(*1) $$2.1 : ,
; ,
, .
(*1) : ; 10 ;
10 ; ; ; ; -; .
.
(*1.5) , .
sizeof.
(*1.5) , 'a' 'z' '0' '9'
. . ,
.
(*1) 0 . :
.$$2.6.2.
(*1.5) , double.
(*2) : char,
short,int,long, float, double, long double, unsigned, char*, int* void*? -
? , int* ?
? , ?
(*1) ,
++ ? ? - ,
?
(*1) , .
int*. ,
int&.
(*1) str : char str[] = "a short string";
"a short string"?
(*1.5) . ,
. : -
, - ,
.
(*1) typedef : unsigned char, unsigned char, ,
, , 7 ,
7 8 7 .
(*1) f(char), g(char&) h(const char&) ,
'a', 49, 3300, c, uc, sc, c - char, uc - unsigned char sc - signed char.
? ?
- 57 -
++
3.
" "
( )
++ ,
, .
. ,
. ,
.
3.1
.

. . ,
:
r=2.5
area=pi*r*r
( pi ). :
2.5
19.635
2.5, - 19.635.
: , ,
. , ,
,
, , ,
. ,
(200 ),
, ++.
3.1.1
:
:
END
- END
// END -
-:
PRINT
// PRINT - '\n' ';'
PRINT -
:
+
-
:
/
*
:
NUMBER
// ++
NAME
// ++ '_'
NAME =
-
( )
, ,
, . - , *,
/, +, - ( ) =. .
- 58 -
.
++
, .
. ++,
, .
, .
(, END, NUMBER, + -) get_token().
expr(), term() prim().
, .
, .
get_token(). get_token()
curr_tok. curr_tok
token_value:
enum token_value {
NAME,
NUMBER,
END,
PLUS='+', MINUS='-', MUL='*',
PRINT=';', ASSIGN='=', LP='(',
};
token_value curr_tok;
DIV='/',
RP=')'
, get_token() , curr_tok
, .
. ,
, . ""
. expr() .
, :
double expr()
{
double left = term();
for(;;)
switch(curr_tok) {
case PLUS:
get_token();
left += term();
break;
case MINUS:
get_token();
left -= term();
break;
default:
return left;
}
}
//
// ``''
// '+'
// '-'
. ,
, . , 2-3+4 (23)+4, . for(;;) -
, "".
for, while(1). switch ,
+ - , return
(default).
+= -= .
: left=left+term() left=left-term(). left+=term() left-=term()
, . @
x@=y x=x@y, , x .
:
+
&
<<
>>
:
+=
-=
*=
/=
%=
&=
|=
^=
<<=
>>=
, a + =1 (-
+ =). : % - , &, | ^ -
, ; << >> . term()
get_token() expr(). 4
. , ,
.
expr(), term(), , , prim(), , ,
- 59 -
.
++
expr(). - ,
prim() :
double expr();
//
term() , expr()
:
double term()
//
{
double left = prim();
for(;;)
switch(curr_tok)
{
case MUL:
get_token();
// '*'
left *= prim();
break;
case DIV:
get_token();
// '/'
double d = prim();
if (d == 0) return error(" 0");
left /= d;
break;
default:
return left;
}
}
, ,
, .
error() . d ,
, . .

.
. , ,
,
. , = , ==
.
prim, , expr term().
, - . :
double number_value;
char name_string[256];
double prim()
//
{
switch (curr_tok) {
case NUMBER:
//
get_token();
return number_value;
case NAME:
if (get_token() == ASSIGN) {
name* n = insert(name_string);
get_token();
n->value = expr();
return n->value;
}
return look(name_string)->value;
case MINUS:
//
get_token();
return -prim();
case LP:
get_token();
double e = expr();
if (curr_tok != RP) return error(" )");
get_token();
return e;
case END:
return 1;
default:
return error(" ");
- 60 -
.
}
}
++
NUMBER ( ), .
get_token() number_value.
, , ,
. .
: , (
token_value), ( ) .
curr_tok, NUMBER
number_value. ,
, .
($$3.5 [15]).
NUMBER number_value,
NAME name_string. , -
, , , ,
.
. $$3.1.3; , ,
:
struct name {
char* string;
name* next;
double value;
};
next , :
name* look(const char*);
name* insert(const char*);
name, -.
look() "", . ,
,
.
3.1.2
- . ,
, "" ,
.
, , ,
.
, .
get_token(). ,
. .

. get_token()
.
, '\n' ,
. , '\n'
, .
(, ..). do,
while, , do :
char ch;
do {
// '\n'
if(!cin.get(ch)) return curr_tok = END;
} while (ch!='\n' && isspace(ch));
cin.get(ch) ch. if(!
cin.get(ch)) - , cin .
END, . ! (NOT) ,
get() .
- isspace() <ctype.h> , ($
$10.3.1). , , .
, isspace(),
. isalpha(), isdigit() isalnum(), get_token().
- 61 -
.
++
,
. , ,
. '\n' ';', , :
switch (ch) {
case ';':
case '\n':
cin >> ws;
//
return curr_tok=PRINT;
, , ,
get_token(). ws, <stream.h>,
. ,
get_token(). ,
, . ('\n' ';') PRINT,
curr_tok.
:
case '0':
case '1':
case '2':
case '3':
case '4':
case '5':
case '6':
case '7':
case '8':
case '9':
case '.':
cin.putback(ch);
cin >> number_value;
return curr_tok=NUMBER;
, ,- ,
; . >>
double, :
( ) cin, number_value. , ..
NAME, , :
if (isalpha(ch)) {
char* p = name_string;
*p++ = ch;
while (cin.get(ch) && isalnum(ch)) *p++ = ch;
cin.putback(ch);
*p = 0;
return curr_tok=NAME;
}
name_string , .
isalpha() isalnum() <ctype.h>. isalnum(c) , c - ,
.
, , :
token_value get_token()
{
char ch;
do {
// '\n'
if(!cin.get(ch)) return curr_tok = END;
} while (ch!='\n' && isspace(ch));
switch (ch) {
case ';':
case '\n':
cin >> ws;
//
case '*':
case '/':
case '+':
case '-':
case '(':
case ')':
- 62 -
.
case '=':
return curr_tok=token_value(ch);
case '0': case '1': case '2': case '3':
case '5': case '6': case '7': case '8':
case '.':
cin.putback(ch);
cin >> number_value;
return curr_tok=NUMBER;
default:
// NAME,
if (isalpha(ch)) {
char* p = name_string;
*p++ = ch;
while (cin.get(ch) && isalnum(ch))
cin.putback(ch);
*p = 0;
return curr_tok=NAME;
}
error(" ");
}
}
++
case '4':
case '9':
NAME=
*p++ = ch;
, token_value
( ).
3.1.3
:
name* look(char* p, int ins =0);
, , , .
=0 , , look()
. , look("sqrt2"),
look("sqrt2",0), .. , .
, :
inline name* insert(const char* s) { return look(s,1); }
, :
struct name {
char* string;
name* next;
double value;
};
next . -
name:
const TBLSZ = 23;
name* table[TBLSZ];
,
table .
look() - (,
-, ):
int ii = 0;
// -
const char* pp = p;
while (*pp) ii = ii<<1 ^ *pp++;
if (ii < 0) ii = -ii;
ii %= TBLSZ;
, ^ (" ") p
ii. x^y 1 , x y
. ^ ii ,
ii. :
ii <<= 1;
ii ^= *pp++;
- ^, +.
- 63 -
.
- .
++
if (ii < 0) ii = -ii;

ii %= TBLSZ;
, ii 0...TBLSZ-1. , % -
. look:
#include <string.h>
name* look(const char* p, int ins =0)
{
int ii = 0;
// -
const char* pp = p;
if (ii < 0) ii = -ii;
ii %= TBLSZ;
for (name* n=table[ii]; n; n=n->next)
//
if (strcmp(p,n->string) == 0) return n;
if (ins == 0) error(" ");
name* nn = new name;
//
nn->string = new char[strlen(p)+1];
strcpy(nn->string,p);
nn->value = 1;
nn->next = table[ii];
table[ii] = nn;
return nn;
}
- ii next.
strcmp(). ,
, .
name
new (. $$3.2.6), .
, , .
. strlen() ,
, new , strcpy() .
<string.h>:
extern int strlen(const char*);
extern int strcmp(const char*, const char*);
extern char* strcpy(char*, const char*);
3.1.4
, . error
, :
int no_of_errors;
double error(const char* s)
{
cerr << "error: " << s << "\n";
no_of_errors++;
return 1;
}
cerr .
error() , , ,
. , ,
. .
get_token() , error()
. .
,
. exit(),
($$10.5.1) ,
. - abort(),

( ). .
, (.
$$9), 200 .
- 64 -
++
3.1.5
, ,
. main():
int main()
{
// :
insert("pi")->value = 3.1415926535897932385;
insert("e")->value = 2.7182818284590452354;
while (cin) {
get_token();
if (curr_tok == END) break;
if (curr_tok == PRINT) continue;
cout << expr() << '\n';
}
return no_of_errors;
}
, main() , ,
, . . ,
.
main . :
cout << expr() << '\n';
cin , -
, END ,
get_token() . break
switch (.. for, while do). PRINT (.. '\n' ';')
expr() . continue
, :
while (cin) {
// ...
if (curr_tok == PRINT) continue;
cout << expr() << "\n";
}
:
while (cin) {
// ...
if (curr_tok == PRINT) goto end_of_loop;
cout << expr() << "\n";
end_of_loop: ;
}
$$R.6
3.1.6
, ,
, , . ,
. ,
.
, main(). main()
: ( argc) (
argv). - , argv char*[argc+1].
( , ) argv[0], argc
. ,
dc 150/1.1934
:
argc
argv[0]
argv[1]
argv[2]
2
"dc"
"150/1.1934"
0
; , ,
. ,
- 65 -
.
++
($$10.5.2). , cin ,
, :
int main(int argc, char* argv[])
{
switch(argc) {
case 1:
//
break;
case 2:
//
cin = *new istream(argv[1],strlen(argv[1]));
break;
default:
error(" ");
return 1;
}
// main
}
istrstream - istream, ,
. istrstream <strstream.h>,
<iostream.h>. ,
main() switch. main() ,
. , ,
:
dc "rate=1.1934;150/rate;19.75/rate;217/rate"
, ';' UNIX .
.
3.2
++ $$R.7. .
.
. class_name
, member - , object - , , pointer , , expr - , lvalue () - ,
. (type) (
*, () ..). , .
" ",
- " ". , a=b=c a=(b=c), a+b+c (a+b)+c, *p++ *(p++),
(*p)++.
- 66 -
++
++
::
::
.
->
[]
()
()
sizeof
sizeof
++
++
--~
!
+
&
*
new
delete
delete[]
()
. *
->*
*
/
%
+
<<
>>
<
<=
>
>=
==
!=
&
^
|
&&
||
?:
=
*=
/=
%=
+=
-=
<<=
>>=
&=
|=
^=
,
()
()

()

()
()
()

()
class_name :: member
:: name
object . member
pointer -> member
pointer [ expr ]
expr ( expr_list )
type ( expr_list )
sizeof expr
sizeof ( type )
lvalue ++
++ lvalue
lvalue --- lvalue
~ expr
! expr
- expr
+ expr
& lvalue
* expr
new type
delete pointer
delete[] pointer
( type ) expr
object . pointer-to-member
pointer -> pointer-to-member
expr * expr
expr / expr
expr % expr
expr + expr
expr - expr
expr << expr
expr >> expr
expr < expr
expr <= expr
expr > expr
expr >= expr
expr == expr
expr != expr
expr & expr
expr ^ expr
expr | expr
expr && expr
expr || expr
expr? expr : expr
lvalue = expr
lvalue *= expr
lvalue /= expr
lvalue %= expr
lvalue += expr
lvalue -= expr
lvalue <<= expr
lvalue >>= expr
lvalue &= expr
lvalue |= expr
lvalue ^= expr
expr , expr
, ,
. " ". ,
a+b*c a+(b*c), * , +; a+b-c (a+b)-c,
+ - , + - " ".
- 67 -
++
3.2.1
++ , .
, , ,
. ,
, ,
" " (.. ).
,
if (i<=0 || max<i)
// ...
: " i , max i". ,

if ( (i<=0) || (max<i) )
// ...
,
if (i <= (0||max) < i)
// ...
, , ,
, :
if ( (i<=0) || (max<i) )
// ...
. , , ,
. , ,
, . ,
"" . ,
if (i&mask == 0)
// ! & ==
i (i&mask), 0. == ,
&, i&(mask==0). :
if ((i&mask) == 0)
// ...
, ,
:
if (0 <= a <= 99)
// ...
, (0<=a)<=99, 0, 1,
a (, , a 1). , a 0...99, :
if (0<=a && a<=99)
// ...
, == () = ():
if (a = 7)
// ...
// :
, "=" "".
.
3.2.2
, , . :
int i = 1;
v[i] = i++;
v[1]=1, v[2]=1.
, .
,
.
&&
||
, . ,
b=(a=2,a+1) b 3. || $$3.2.1, && $
$3.3.1. , ,
. :
f1(v[i],i++);
f2( (v[i],i++) )
//
//
f1 : v[i] i++,
- 68 -
.
++
.
- . .
f2 , , : (v[i],
i++). i++.
. , a*(b/c) (a*b)/c
( - ). ,
a*(b/c) (a*b)/ .
3.2.3
++
. ++lvalue lvalue+=1, , lvalue=lvalue+1
, lvalue . ,
, . (--). ++
. ++x (. .
1) x. , y=++x y=(x+=1). , x++
x. , y=x++ y=(t=x,x+=1,t), t - ,
x.
, 1
1 , ,
. , p++ . p T*
:
long(p+1) == long(p) + sizeof(T);
.
, , , :
inline void cpy(char* p, const char* q)
{
while (*p++ = *q++) ;
}
++ ( ) , - ,
.
while (*p++ = *q++) ;
, .
, C C++ .
:
int length = strlen(q)
for (int i = 0; i<=length; i++) p[i] = q[i];
: ; -
; ,
, . :
for (int i = 0; q[i] !=0 ; i++) p[i] = q[i];
p[i] = 0;
//
p q - , i, :
while (*q !=0) {
*p = *q;
p++;
q++;
}
*p = 0;
//
//
//
,
, :
while (*q != 0) {
*p++ = *q++;
}
*p = 0;
//
, *p++ = *q++ *q. ,

:
while ((*p++ = *q++) != 0)
{ }
- 69 -
.
++
, *q , *q *p,
. ,
, , , "!= 0" , ..
.
, :
while (*p++ = *q++) ;
, ? ++
! ?
strlen(), . ,
, .

<string.h>:
int strcpy(char*, const char*);
3.2.4

&
>>
<<
, char, short, int, long .

.

( ).
, . &
, | , ^
. . ,
<iostream.h>:
class ios {
public:
enum io_state {
goodbit=0, eofbit=1, failbit=2, badbit=4
};
// ...
};
:
cout.state = ios::goodbit;
ios , io_state ios,
, goodbit.
:
if (cout.state&(ios::badbit|ios::failbit))
//
, & , "|".
, , :
cin.state |= ios::eofbit;
|= , (.. state==ios::badbit),
cin.state =ios::eofbit;
. :
ios::io_state diff = cin.state^cout.state;
, io_state, ,
. , ,
, - ,
.
, ($$R.9.6)
, .
. , 16 32- :
unsigned short middle(int a) { return (a>>8)&0xffff; }
- 70 -
.
++
:
&&
||
0 1,
if, while for ($$3.3.1). , !0 ( ) 1, ~0 (
) " ", -1
.
3.2.5
.
, . :
float r = float(1);
1 1.0f.
, (
).
: ,
, , (double)a , , double(a).
, . ,
,
char* p = (char*)0777;
:
typedef char* Pchar;
char* p = Pchar(0777);
, .
:
Pname n2 = Pbase(n1->tp)->b_name; //
Pname n3 = ((Pbase)n2->tp)->b_name;
//
-> , ,
:
((Pbase)(n2->tp))->b_name

. ,
any_type* p = (any_type*)&some_object;
(some_object) p
(any_type). , some_object any_type,
.
, . ,
, , , .
, ,
, . ,
, ,
, , (struct) (.
$$2.6.1). ,
, ,
. :
int i = 1;
char* pc = "asdf";
int* pi = &i;
i = (int)pc;
pc = (char*)i;
//
//
//
pi = (int*)pc;
pc = (char*)pi; //
//
//
: pc .
sizeof(int)
, sizeof(char*)
: pc
char*
, int*
, .
. ,
- 71 -
.
++
. ,
( ) void*, void*
.
++ , (
) . ,
.
3.2.6
, (.$$2.1.3).
.
, ,
, , . ,
, , . ,
, , .
new, delete
. , new, , .
,
, .
, .
,
. :
struct enode {
token_value oper;
enode* left;
enode* right;
};
enode* expr()
{
enode* left = term();
for(;;)
switch(curr_tok) {
case PLUS:
case MINUS:
get_token();
enode* n = new enode;
n->oper = curr_tok;
n->left = left;
n->right = term();
left = n;
break;
default:
return left;
}
}
, :
void generate(enode* n)
{
switch (n->oper) {
case PLUS:
//
delete n;
}
}
, new, , ,
delete. , , new.
" ", , ,
new . delete
, new, . delete
.
new , :
char* save_string(const char* p)
{
char* s = new char[strlen(p)+1];
- 72 -
.
strcpy(s,p);
return s;
}
++
, , new, delete
. :
{
if (argc < 2) exit(1);
char* p = save_string(arg[1]);
delete[] p;
}
, , new,
, (, ). delete
, delete[] .
($$R.5.3.3-4):
void* operator new(size_t);
void operator delete(void*);
size_t - , <stddef.h>.
operator new() .
, new ?
, . , :
char* p = new char [100000000];
. new , ,
set_new_handler() <new.h>. ,
:
#include <new.h>
#include <stdlib.h>
void out_of_store()
{
cerr << "operator new failed: out of store\n";
exit(1);
}
int main()
{
set_new_handler(&out_of_store);
char* p = new char[100000000];
cout << "done, p = " << long(p) << '\n';
}
, "done", :
operator new failed: out of store
// new :
new_handler , .
new delete (, ,
operator new operator delete), new_handler
new. , " ",
delete . , , .
new 0,
. new_handler . , :
#include <stream.h>
main()
{
char* p = new char[100000000];
cout << "done, p = " << long(p) << '\n';
}
done, p = 0
- 73 -
.
++
, ! , ,
new_handler, : .
new (
; .$$R.5.5.6).
3.3
++ $$R.6.
. .

:
{ - opt }
opt ;
if ( )
if ( ) else
switch ( )
while ( )
do while ( )
for (--for opt; opt)
case - :
default :
break ;
continue ;
return
opt ;
goto ;
:
-:
--for:
opt ;
, ,
( ).
3.3.1
if switch:
if ( )
if ( ) else
switch ( )
++ ( , ).
:
==
!=
<
>
<=
>=
1, , 0 .
TRUE 1 FALSE 0.
if, , ,
( ). ,
. a ,
if (a)
// ...
if (a != 0) ...

- 74 -
.
&&
||
!
++
. && || ,
. ,
if (p && l<p->count)
// ...
p, , l<p->count.
if . ,
if (a <= b)
max = b;
else
max = a;

max = (a<=b) ? b : a;
, ,
.
(switch) if. ,
switch (val) {
case 1:
f();
break;
case 2:
g();
break;
default:
h();
break;
}
:
if (val == 1)
f();
else if (val == 2)
g();
else
h();
, ,
: val .
, , .
- , ,
, . ,
switch (val)
case 1:
cout <<
case 2:
cout <<
default:
cout <<
}
//
"case 1\n";
"case 2\n";
"default: case not found\n";
val==1 :
case 1
case 2
default: case not found
,
. .
break, return goto.
:
switch (val) {
//
case 0:
cout << "case 0\n";
case1:
- 75 -
.
case 1:
cout << "case 1\n";
return;
case 2:
cout << "case 2\n";
goto case1;
default:
cout << "default: case not found\n";
return;
}
++
val 2 :
case 2
case 1
, goto:
goto case 2;
//
3.3.2 goto
goto - ++:
goto ;
:
, , ,
++ , , .. . , goto
.
, goto ,
. - -
.
, goto . -
. , break
. :
void f()
{
int i;
int j;
for ( i = 0; i < n; i++)
for (j = 0; j<m; j++)
if (nm[i][j] == a) goto found;
// a
// ...
found:
// nm[i][j] == a
}
continue, . , $$3.1.5.
3.4
, ,
.
, , - .
. .
,
. , ,
:
[1] ,
[2] ,
[3] .
, .
, .
, , ,
. ,
- 76 -
.
:
//
//
//
//
//
//
//
++
"v" .
"v" "f()".

"init()".
"cleanup()".
"weird()".
"f()" .
++ .
, ($$4.2)
, ($$5.5).
, .
:
a = b + c;
count++;
// a b+c
// count
, . ,
.
, . ,
.
:
[1] : , ,
, ..;
[2] ;
[3] , : ,
( ) , , ,
;
[4] ;
[5] , ;
[6] .
:
//
/*
tbl.c: .

. " ..." . 411.
*/
// swap() , AT&T 3B20.
/************************************
(c) 1991 AT&T, Inc

**************************************/
.
, , - ,
.
, //,
/* */, .
3.5
1.
(*1) for while:

for (i=0; i<max_length; i++)
if (input_line[i] == '?') quest_count++;
, ,
*p=='?'.
2.
(*1) , :
a = b + c * d << 2 & 8
a & 077 != 3
a == b || a == c && c < 5
- 77 -
.
c = x != 0
0 <= i < 7
f(1,2) + 3
a = - 1 + + b -- - 5
a = b == c ++
a = b = c = 0
a[4][2] *= * b ? c : * d * 2
a-b, c=d
++
3.
(*2) 5 ++, .
4.
(*2) 10 ++.
5.
(*1) ++?
?
6.
(*1) , :
*p++
*--p
++a-(int*)p->m
*p.m
*a[i]
7.
(*2) : strlen() - , strcpy() - strcmp() . ?

, <string.h> .
8.
(*1) , :
void f(int a, int b)
{
if (a = 3) // ...
if (a&077 == 0) // ...
a := b+1;
}
, .
9.
(*2) cat(), - ,
. ,
new. rev() ,
. , rev(p) p ..
10. (*2) ?
void send(register* to, register* from, register count)
// .
{
register n=(count+7)/8;
switch (count%8) {
case 0: do { *to++ = *from++;
case 7:
*to++ = *from++;
case 6:
*to++ = *from++;
case 5:
*to++ = *from++;
case 4:
*to++ = *from++;
case 3:
*to++ = *from++;
case 2:
*to++ = *from++;
case 1:
*to++ = *from++;
} while (--n>0);
}
}
?
11. (*2) atoi(), -
. , atoi("123") 123. atoi() ,
,
, ++. ++.
itoa() .
12. (*2) get_token() ($$3.12) , ,
, .
- 78 -
.
++
13. (*2) $$3.1 , sqrt(), log() sin(). :
.
, .
14. (*3) . :
, .
, .
, .
, .
15. (*1.5) , symbol
name_string number_value:
struct symbol {
token_value tok;
union {
char* name_string;
};
};
16. (*2.5) , ++. ,
cin : // /* */.
cout. ( , ).
. //, /* */
, .
17. (*2) ,
.
- 79 -
++
4.
, - .
- .
,
. ,
, , ,
. , :
, , , ,
, . .
4.1
++ , ($$R.3.2).
( , ),
( , const). ,
, . ,
++ , ,
. .
, , ,
.
, .

. ,
.
,
.
. .
, .
"" ,
expr(), term() prim(). , :
(), , . ,
. .
. ,
"" ,
.
, ,
,
. ,
, , ,
. , ,
, . ,
, . , .
- , .
.
4.2
, , ,
, ,
. , , ,
. :
// file1.c
int a = 1;
int f() { /* - */ }
// file2.c
extern int a;
int f();
void g() { a = f(); }
g() a f(), file1.c. extern
, a file2.c , .
- 80 -
.
++
a, extern ,
.
. , .
:
// file1.c:
int a = 1;
int b = 1;
extern int c;
// file2.c:
int a;
extern double b;
extern int c;
: a ("int a;" - , "int
a=0;"); b , ; c , .
( ) , , ,
.
, ++:
// file1.c:
int a;
int f() { return a; }
// file2.c:
int a;
int g() { return f(); }
-, f() file2.c, f() . -,
, a .
static, . :
// file1.c:
static int a = 6;
static int f() { /* ... */ }
// file2.c:
static int a = 7;
static int f() { /* ... */ }
, a f .
a f().
static,
, .
,
. , ,
. ,
, .
, , .. , .
.
, , - :
// file1.c:
struct S { int a; char b; };
extern void f(S*);
// file2.c:
struct S { int a; char b; };
void f(S* p) { /* ... */ }
:
++. (
).
- ,
. , .. typedef, ,
:
// file1.c:
- 81 -
.
typedef int T;
const int a = 7;
inline T f(int i) { return i+a; }
++
// file2.c:
typedef void T;
const int a = 8;
inline T f(double d) { cout<<d; }
:
// file3.c:
extern const int a;
const int a = 77;
// file4.c:
extern const int a;
void g() { cout<<a; }
g() 77.
4.3
.
, , .
, , . :
, , ,
.
#include,
( ) .
#include "-"
, , -. ,
++, . ,
, ++.
.
: , ,
. ,
, , :
CC -E file.c
file.c ( !), , CC
-E .
( INCLUDE)
< >. :
#include <stream.h>
#include "myheader.h"
//
//
,
( /usr/include/CC,
/usr/include). , :
#include < stream.h>
// <stream.h>
, .
, ,
. ,
, , , , ,
.
, :

struct point { int x, y; };

template<class T>
class V { /* ... */ }
inline char get() { return *p++; }
extern int a;
const float pi = 3.141593;
- 82 -
++
enum bool { false, true };
class Matrix;
#include <signal.h>
#define Case break;case
/* */
, , ,
. ,
:

char get() { return *p++; }

int a;
const tb[i] = { /* ... */ };
.h, ,
, .c. "h-" "-" .
: .C, cxx, .cpp .cc.
. $$4.7. , ++
, , ++ :
(const), - (inline),
, , ($$8).
, ,
. ,
. ,
, ,
.
4.3.1
:
, , ,
. .
.c: lex.c, syn.c, table.c main.c.
dc.h ,
.c :
// dc.h:
enum token_value {
NAME,
NUMBER,
END,
PLUS='+', MINUS='-', MUL='*', DIV='/',
PRINT=';', ASSIGN='=', LP='(', RP=')'
};
extern int no_of_errors;
extern double error(const char* s);
extern token_value get_token();
extern token_value curr_tok;
extern double number_value;
extern char name_string[256];
extern double expr();
extern double term();
extern double prim();
struct name {
char* string;
name* next;
double value;
};
extern name* look(const char* p, int ins = 0);
, lex.c :
// lex.c:
#include "dc.h"
#include <ctype.h>
token_value get_token() { /* ... */ }
, , ,
- 83 -
.
++
, , . ,
lex.c
// ...
, .
, get_token() token_value, int,
lex.c : .
syn.c :
// syn.c:
#include "dc.h"
double prim() { /* ... */ }
double term() { /* ... */ }
double expr() { /* ... */ }
table.c :
// table.c:
#include "dc.h"
extern char* strcmp(const char*, const char*);
const int TBLSZ = 23;
name* table[TBLSZ];
name* look(char* p, int ins) { /* ... */ }
, table.c,
. ,
.c extern. " ",
, ,
. , strlen()
main.c. , ..
strlen() (, ).
, dc.h extern,
. ,
. ,
, . , !
, main.c:
// main.c: , ,
#include "dc.h"
double error(char* s) { /* ... */ }
int main(int argc, char* argv[]) { /* ... */ }
.
,
( , ; . 5-9).
.
, , . ,
. , .
.
4.3.2
,
. ,
, .
. :
, , .
.c .h, , . .c
.h, .h, .
. , error()
, <iostream.h>.
, . main.c:
- 84 -
.
// error.h:
extern int no_of_errors;
extern double error(const char* s);
++
// error.c
#include "error.h"
int no_of_errors;
double error(const char* s) { /* ... */ }
.c .h ,
.h , .c .
, .
:
// table.h:
struct name {
char* string;
name* next;
double value;
};
extern name* look(const char* p, int ins = 0);
// table.h:
#include "error.h"
#include <string.h>
#include "table.h"
const int TBLSZ = 23;
name* table[TBLSZ];
name* look(const char* p, int ins) { /* ... */ }
, <string.h>.
.
// lex.h:
enum token_value {
NAME,
NUMBER,
END,
PLUS='+',
MINUS='-',
MUL='*',
PRINT=';', ASSIGN='=',
LP='(',
RP= ')'
};
extern token_value curr_tok;
extern double number_value;
extern char name_string[256];
.
, get_token() number_value
name_string, .
// lex.c:
#include <ctype.h>
#include "error.h"
#include "lex.h"
:
// syn.h:
extern double expr();
extern double term();
extern double prim();
// syn.c:
#include "error.h"
#include "lex.h"
#include "syn.h"
- 85 -
++
double prim() { /* ... */ }

double term() { /* ... */ }
double expr() { /* ... */ }
, :
// main.c:
#include "error.h"
#include "lex.h"
#include "syn.h"
#include "table.h"
int main(int argc, char* argv[]) { /* ... */ }

. ,
++. , ,
. : ,
10 50 ,
500 . ,
, . :
, 10 (
).
(, ),
.
4.4
++ , , , ++
, . ,
, , ,
, . ,
,
, , , ,
, ,
. , . ,
strcpy ,
:
extern "C" char* strcpy(char*, const char*);

strcpy() . , ,
. extern "C"
, ++, , . ,
extern "C" , ,
.
.
"C" ,
. :
extern "C" {
char* strcpy(char*, const char);
int strcmp(const char*, const char*)
int strlen(const char*)
// ...
}
, ,
++, :
extern "C" {
#include <string.h>
}
+
+. :
#ifdef __cplusplus
- 86 -
.
extern "C" {
#endif
char* strcpy(char*, const char*);
int strcmp(const char*, const char*);
int strlen(const char*);
// ...
#ifdef __cplusplus
}
#endif
++
__cplusplus , extern "C" { ...},

.
extern "C" { ... } ,
, :
extern "C" {
//
// :
static int st;
int glob;
}
, - st
, glob .
, extern "C"
. , , extern "C",
, C++ , . :
extern "C" int f();
int g()
{
return f(1); // :
}
4.5
( ): " ", " -
". ++? ,
. ,
. .
.o, .c.
.h, .o .
,
. :
extern "C" {
double
double
double
double
double
// ...
//
//
sqrt(double); // <math.h>
sin(double);
cos(double);
exp(double);
log(double);
}
sqrt.c, sin.c, cos.c, exp.c log.c, .
math.a :
$ CC -c sqrt.c sin.c cos.c exp.c log.c
$ ar cr math.a sqrt.o sin.o cos.o exp.o log.o
$ ranlib math.a
$ .
, . ar ()
math.a. , .
ranlib ( ), , ,
ar. ,
:
$ CC myprog.c math.a
- 87 -
.
++
: math.a?
.o, :
$ CC myprog.c sqrt.o sin.o cos.o exp.o log.o
, , .o .
. myprog sqrt() cos(),
, , :
$ CC myprog.c sqrt.o cos.o
, .. cos() sin().
, CC .a (
math.a), , , .o.
, (
, ,
).
.
4.6
++ - - ,
. , .
.
4.6.1
, ( )
, . :
extern
extern
extern
extern
double sqrt(double);
elem* next_elem();
char* strcpy(char* to, const char* from);
void exit(int);
:
, , . ,
, :
double sr2 = sqrt(2);
sqrt() 2.0.
++ .
. ,
.
4.6.2
- , .
- , . :
extern void swap(int*, int*);
void swap(int* p, int* q)
{
int t = *p;
*p = *q;
*q = *t;
}
//
//
, :
void search(table* t, const char* key, const char*)
{
//
// ...
}
, , .
.
,
, , .
- 88 -
.
++
, (inline). :
inline fac(int i) { return i<2 ? 1 : n*fac(n-1); }
inline , fac
, ($$R.7.1.2).
fac(6) 720. -, -,
, , . ,
, , 6*5*4*3*2*1, 6*fac(5), fac(6).

, , , -
. inline .
4.6.3
,
.
. ,
, .
($$4.6.5). ,
($$4.6.8), ($$4.6.7).
:
void f(int val, int& ref)
{
val++;
ref++;
}
f() val++ ,
ref++ - .
void g()
{
int i = 1;
int j = 1;
f(i,j);
}
j, i. i , j
. $$2.3.10 , ,
, , (. $$10.2.2). ,
, , .
const, ,
, :
void f(const large& arg)
{
// "arg"
//
}
const ,
:
void g(large& arg); // , g() arg
: const , .
, , , const ,
. :
extern int strlen(const char*); // <string.h>
extern char* strcpy(char* to, const char* from);
extern int strcmp(const char*, const char*);
.
, .
, const , ,
($1.4.2).
- 89 -
.
++
, , , const&,
const . const T&,
, , T,
.
float fsqrt(const float&);
void g(double d)
{
float r;
r = fsqrt(2.0f);
r = fsqrt(r);
r = fsqrt(d);
// sqrt
//
//
//
//
//

, 2.0f
r

, float(d)
}
- const ,
, :
void update(float&
void g(double d)
{
float r;
update(2.0f);
update(r);
update(d);
}
i);
// : -
// : r
// :
4.6.4
void, . :
int f() { }
void g() { }
//
//
return . :
int fac(int n) { return (n>1) ? n*fac(n-1) : 1; }
return:
int fac(int n)
{
if (n > 1)
return n*fac(n-1);
else
return 1;
}
, .
, return , .
return ,
. :
double f()
{
// ...
return 1;
}
// double(1)

. ,
. ,
, :
int* f()
{
int local = 1;
// ...
return &local;
}
//
, , - :
- 90 -
.
int& f()
{
int local = 1;
// ...
return local;
}
++
//
, , .
:
int& f() { return 1; }
//
4.6.5 -
, .
:
int strlen(const char*);
void f()
{
char v[] = "";
strlen(v);
strlen("");
}
, T[] T*, .
- . ,
, .
. ,
. , ,
. , . :
, , (.
$$1.2.5). :
void compute1(int* vec_ptr, int vec_size); // 1-
struct vec {
// 2-
int* ptr;
int size;
};
void compute2(vec v);
, ,
. :
char* day[] = {
"mon", "tue", "wed", "thu", "fri", "sat", "sun"
};
, - .
, :
void print_m34(int m[3][4])
{
for (int i = 0; i<3; i++) {
for (int j = 0; j<4; J++)
cout << ' ' << m[i][j];
cout << '\n';
}
}
, - ,
.
($$R.8.2.4),
:
void print_mi4(int m[][4], int dim1)
{
for ( int i = 0; i<dim1; i++) {
for ( int j = 0; j<4; j++)
cout << ' ' << m[i][j];
cout << '\n';
}
- 91 -
.
}
++
- . ""
:
void print_mij(int m[][], int dim1, int dim2)
{
for ( int i = 0; i<dim1; i++) {
for ( int j = 0; j<dim2; j++)
cout << ' ' << m[i][j];
cout << '\n';
}
}
//
-, m[][] ,
. -, m[i][j]
*(*(m+i)+j), , , , . :
void print_mij(int** m, int dim1, int dim2)
{
for (int i = 0; i< dim1; i++) {
for (int j = 0; j<dim2; j++)
cout << ' ' << ((int*)m)[i*dim2+j]; //
cout << '\n';
}
}
, , ,
, . ,
:
int* v = (int*)m;
// ...
v[i*dim2+j]
.
. ,
(. 18 $$7.13).
4.6.6
.
, .
.
++ . :
+, ,
, . , ,
.. . :
void print(int);
void print(const char*)
//
//
- . ,
, .
, , , .
, sqrt, print open, .
, , , + , * << ($$7.2),
($$5.2.4 $$7.3.1), .
f , f .
, ,
f. ,
,
. :
void print(double);
void print(long);
void f()
{
print(1L);
print(1.0);
print(1);
//
//
//
//
- 92 -
print(long)
print(double)
, :
print(long(1)) print(double(1)) ?
.
}
++
$$R.13.2. .
:
[1] :
(, ,
T const T).
[2] ,
$$R.4.1 (.. char int, short int int),
float double.
[3] , $$R.4
(, int double, derived* base*, unsigned int).
[4] ($$R.12.3).
[5] ... .
, ,
.
++. print:
void
void
void
void
void
print(int);
print(const char*);
print(double);
print(long);
print(char);
print() :
void h(char c, int i, short s, float f)
{
print(c);
// : print(char)
print(i);
// : print(int)
print(s);
// :
// print(int)
print(f);
// :
// print(double)
print('a');
// : print(char)
print(49);
// : print(int)
print(0);
// : print(int)
print("a");
// :
// print(const char*)
}
print(0) print(int), 0 int. print('a')
print(char), .. 'a' - char ($$R.2.5.2).
,
, .
,
, ,
. :
int pow(int, int);
double pow(double, double);
// <math.h>
complex pow(double, complex);
// <complex.h>
complex pow(complex, int);
complex pow(complex, double);
complex pow(complex, complex);
void k(complex z)
{
int i = pow(2,2);
// pow(int,int)
double d = pow(2.0,2); // pow(double,double)
complex z2 = pow(2,z); // pow(double,complex)
complex z3 = pow(z,2); // pow(complex,int)
complex z4 = pow(z,z); // pow(complex,complex)
}
- 93 -
++
4.6.7
,
. , , (,
, . $$5.2.4).
. .
,
.
void print (int value, int base =10);
void F()
{
print(31);
print(31,10);
print(31,16);
print(31,2);
}
:
31 31 1f 11111
print:
void print(int value, int base);
inline void print(int value) { print(value,10); }

print, .
,
.
:
int f(int, int =0, char* =0);
int g(int =0, int =0, char*);
int h(int =0, int, char* =0);
//
//
//
, * = ,
*= :
int nasty(char*=0);
//
4.6.8
, .
(...), : ", ,
". :
int printf(const char* ...);
printf char*, (
) . :
printf("Hello, world\n");
printf("My name is %s %s\n", first_name, second_name);
printf("%d + %d = %d\n", 2,3,5);

. printf ,
. ,
. , %s -" char*", %d
-" int" (. $$10.6). ,
,
. ,
printf("My name is %s %s\n",2);
, ( ) . .
, ,
. char short int, float double,
, , .
, , ,
. ,
, , .
- 94 -
.
++
, ,
.
, :
extern "C" int fprintf(FILE*, const char* ...);
extern "C" int execl(const char* ...);
, <stdarg.h>,
. ,
. .
, :
extern void error(int ...)
extern char* itoa(int);
main(int argc, char* argv[])
{
switch (argc) {
case 1:
error(0,argv[0],(char*)0);
break;
case 2:
error(0,argv[0],argv[1],(char*)0);
break;
default:
error(1,argv[0],
"With",itoa(argc-1),"arguments",(char*)0);
}
// ...
}
itoa , .
:
#include <stdarg.h>
void error(int severity ...)
/*
"severity" ( )
,
*/
{
va_list ap;
va_start(ap,severity);
//
for (;;) {
char* p = va_arg(ap,char*);
if (p == 0) break;
cerr << p << ' ';
}
va_end(ap);
//
cerr << '\n';
if (severity) exit(severity);
}
va_start() va_list.
va_start va_list .
va_arg(). va_arg
. va_arg() ,
, . ,
va_start, va_end. , va_start()
, - . va_end()
.
0 (char*)0 , sizeof(int) sizeof(char*).
, ,
, .
4.6.9
: . ,
, . :
void error(char* p) { /* ... */ }
void (*efct)(char*);
//
- 95 -
.
void f()
{
efct = &error;
(*efct)("error");
}
++
// efct error
// error efct
(efct )
- *efct. () ,
*, *efct("error"). *(efct("error")), .
. , efct("error") ,
.. , efct , ,
.
, ,
.
. :
void (*pf)(char*);
void f1(char*);
int f2(char*);
void f3(int*);
void f()
{
pf = &f1;
pf = &f2;
pf = &f3;
(*pf)("asdf");
(*pf)(1);
int i = (*pf)("qwer");
//
//
//
//
void(char*)
void(char*);
int(char*);
void(int*);
//
//
//
//
//
//
//
:
: void int
}
, .
,
. :
typedef int (*SIG_TYP)(int);
// <signal.h>
typedef void (SIG_ARG_TYP)(int);
SIG_TYP signal(int, SIG_ARG_TYP);
. ,
, , ,
. , :
typedef void (*PF)();
PF edit_ops[] = { //
&cut, &paste, &snarf, &search
};
PF file_ops[] = { //
&open, &reshape, &close, &write
};
, ,
. :
PF* button2 = edit_ops;
PF* button3 = file_ops;
,
. , - , ,
. .
,
. , , , 3
2, :
(*button2[3])();
,
. , .
.
, .. ,
:
- 96 -
.
++
typedef int (*CFT)(void*,void*);
void sort(void* base, unsigned n, unsigned int sz, CFT cmp)
/*
"base" n
;
, cmp.
"sz".
:
*/
{
for (int i=0; i<n-1; i++)
for (int j=n-1; i<j; j--) {
char* pj = (char*)base+j*sz; // b[j]
char* pj1 = pj - sz;
// b[j-1]
if ((*cmp)(pj,pj1) < 0) {
// b[j] b[j-1]
for (int k = 0; k<sz; k++) {
char temp = pj[k];
pj[k] = pj1[k];
pj1[k] = temp;
}
}
}
}
sort ; ( ),
, . sort()
, qsort() - .
. , sort()
:
struct user {
char* name;
//
char* id;
//
int dept;
//
};
typedef user* Puser;
user heads[] = {
"Ritchie D.M.",
"dmr",
"Sethi R.",
"ravi",
"SZYmanski T.G.",
"tgs",
"Schryer N.L.",
"nls",
"Schryer N.L.",
"nls",
"Kernighan B.W.",
"bwk",
};
void print_id(Puser v, int n)
{
for (int i=0; i<n; i++)
cout << v[i].name << '\t'
<< v[i].id << '\t'
<< v[i].dept << '\n';
}
11271,
11272,
11273,
11274,
11275
11276
, .
, ,
, , :
int cmp1(const void* p, const void* q)
// ,
{
return strcmp(Puser(p)->name, Puser(q)->name);
}
int cmp2(const void* p, const void* q)
//
{
return Puser(p)->dept - Puser(q)->dept;
}
:
int main()
- 97 -
.
{
sort(heads,6,sizeof(user), cmp1);
print_id(heads,6);
//
cout << "\n";
sort(heads,6,sizeof(user),cmp2);
print_id(heads,6);
//
}
++
-, ($$R.13.3).
, - void*
, .
int cmp3(const mytype*, const mytype*);
sort(). ,
, cmp3() mytype*.
, .
4.7
$$R.16. ++ , .
: , .
, ,
, .
,
. , , ,
, , , ,
. - ,
++ .
:
#define
-. ,
=

= -
. :
#define mac(a,b)
argument1: a argument2: b
mac , .
a b mac().
expanded = mac(foo bar, yuk yuk)

expanded = argument1: foo bar argument2: yuk yuk
.
:
// :
#define print(a,b) cout<<(a)<<(b)
#define print(a,b,c) cout<<(a)<<(b)<<(c)
// :
#define fac(n) (n>1) ?n*fac(n-1) :1
C++,
. ,
, .
.
:
#define Case break;case
#define forever for(;;)
:
- 98 -
.
#define PI 3.141593
#define BEGIN {
#define END }
++
:
#define SQUARE(a) a*a
#define INCR_xx (xx)++
#define DISP = 4
, :
int xx = 0;
void f() {
int xx = 0;
xx = SQUARE(xx+2);
INCR_xx;
if (a-DISP==b) {
// ...
}
}
//
//
//
//
//

xx = xx +2*xx+2;
xx
a-=4==b

($$2.1.1), , , .
:
#define MIN(a,b) (((a)<(b))?(a):(b))
, ,
/* */, ++ ,
//. :
#define m2(a) something(a)
/* */
, , ,
. , .
, , , , ,
.
const, inline . :
const int answer = 42;
template<class T>
inline T min(T a, T b) { return (a<b)?a:b; }
4.8
1.
(*1) :
, ; ; ,
; , . ,
. : typedef.
2.
(*1) ? ?
typedef int (rifii&) (int, int);
3.
(*1.5) , , "Hello, world". (name)

"Hello, name". ,
: "Hello, ...".
4.
(1.5) , , ,
cout.
, cat concatenation - ).
5.
(*2) ++. ,
.
#define enum, const inline. .c
, , ++. malloc() free()
new delete. .
6.
(*2) sort() ($$4.6.9), .
7.
(*2) tnode $$R.9.3. ,

tnode. tnode. ,
. tnode ,
, new
- 99 -
.
++
. , tnode.
8.
(*1) itoa(), $$4.6.8.
9.
(*2) , .
/usr/include /usr/include/CC ( ,
). .
10. (*2) , . (
).
11. (*2) , cin cout
. : s
s^key[i], key - ,
. key ,
.
key. key ( ),
.
12. (*3) , ,
, (.. key) . : . D Kahn "The Codebreakers",
Macmillan, 1967, New York, . 207-213.
13. (*3) ,
- printf() %s, %c %d.
. printf() . %s
, $$10.6. <stdarg.h>.
14. (*1) ,
typedef?
15. (*2) ,
. ? ?
, i x?
16. (*1) ?
#define PI = 3.141593;
#define MAX(a,b) a>b?a:b
#define fac(a) (a)*fac((a)-1)
17. (*3) , .
cin, cout. . :
,
.
18. (*2) , (2)
sqrt(), <math.h>.
sqrt() .
19. (*2) print() $$4.6.7.
- 100 -
++
5.
" , , int float"
-
,
, . ,
, , , , .
, ,
(.. ) .
++ , .
5.1
, , ++ ,
. , .

. .
. , ++ float +,
-, * .. ,
. ,
, .
, trunk_module (-),
- explosion (), , , - list_of_paragraphs (). ,
.
. ,
.
- (,
) ,
(, , ).
, ,
( " ").
:
$$5.2 . , .
,
. - .
-, .
- .
.
$$5.3 . ,
.
$$5.4 .
. , , ,
. .
. , .
$$5.5 . ,
. , (
), .
,

.
5.2
- . ,
, , ,
.
5.2.1 -
, ,
, :
struct date { int month, day, year; };
- 101 -
.
date today;
void set_date(date*, int, int, int);
void next_date(date*);
void print_date(const date*);
// ...
++
date . ,
:
struct date {
int month, day, year;
void set(int, int, int);
void get(int*, int* int*);
void next();
void print();
};
-.
, :
date today;
date my_birthday;
void f()
{
my_birthday.set(30,12,1950);
today.set(18,1,1991);
my_birthday.print();
today.next();
}
- ,
- :
void date::next()
{
if (++day > 28 ) {
//
}
}
- .
, .
5.2.2
date, ,
, date.
, :
class date {
public:
void set(int, int, int);
void get(int*, int*, int*);
void next();
void print()
};
public () . ,
(private) , -. - . ,
. -
, :
void date::print()
//
{
cout << month << '/' << day << '/' << year ;
}
date :
void backdate()
{
today.day--;
//
- 102 -
.
}
++
, .
(, December, 36, 1985) -,
- .
: date
. ,
-.
.
,
.
5.2.3
- ,
:
class X {
int m;
public:
int readm() { return m; }
};
void f(X aa, X bb)
{
int a = aa.readm();
int b = bb.readm();
// ...
}
readm() m aa.m, - bb.m.
- , ,
. this. ,
- X this
X *const this;
, , - .
, (*const). , .. this -
. X:
class X {
int m;
public:
int readm() { return this->m; }
};
this . this -,
. - ,
:
class dlink {
dlink* pre; //
dlink* suc; //
public:
void append(dlink*);
// ...
};
void dlink::append(dlink* p)
{
p->suc = suc;
// .. p->suc = this->suc
p->pre = this;
// "this"
suc->pre = p;
// .. this->suc->pre = p
suc = p;
// .. this->suc = p
}
dlink* list_head;
void f(dlink* a, dlink* b)
{
// ...
list_head->append(a);
list_head->append(b);
}
- 103 -
.
++
, 8.
, , this, pre suc.
dlink, - dlink::append() .
++ , .
- , , ,
. , , (..
this*), const :
class X {
int m;
public:
readme() const { return m; }
writeme(int i) { m = i; }
};
- const , -
- :
void f(X& mutable, const X& constant)
{
mutable.readme();
//
mutable.writeme(7); //
constant.readme();
//
constant.writeme(7); //
}
, X::writeme()
. , . -
"" ,
const. , readme() writeme() :
class X {
int m;
public:
readme() const;
writeme(int i);
};
readme() const .
this - X const X *const. ,
this :
class X {
int m;
public:
// ...
void implicit_cheat() const { m++; } //
void explicit_cheat() const { ((X*)this)->m++; }
//
};
const , "" .
, " " ,
. , " " ,
() .
,
. , ,
, , - .
, const:
class calculator1 {
int cache_val;
int cache_arg;
// ...
public:
int compute(int i) const;
// ...
};
- 104 -
.
int calculator1::compute(int i) const
{
if (i == cache_arg) return cache_val;
//
((calculator1*)this)->cache_arg = i;
((calculator1*)this)->cache_val = val;
return val;
}
++
, const:
struct cache {
int val;
int arg;
};
class calculator2 {
cache* p;
// ...
public:
int compute(int i) const;
// ...
};
int calculator2::compute(int i) const
{
if (i == p->arg) return p->val;
//
p->arg = i;
p->val = val;
return val;
}
, const , -.
,
($$7.1.6).
5.2.4
set_date() -
. , ,
, ,
. ,
. ,
. - , :
class date {
// ...
date(int, int, int);
};
, .
, :
date today = date(23,6,1983);
date xmas(25,12,0);
date my_birthday;
//
// ,
.
:
class date {
public:
// ...
date(int, int, int);
date(int, int);
date(int);
date();
date(const char*);
};
//
//
//
//
//
, ,
,

:

- 105 -
.
++
,
($$4.6.6). ,
:
date today(4);
date july4("July 4, 1983");
date guy("5 Nov");
date now;
//
c date .
, - - .
, , , ,
.
. date , : "
".
class date {
public:
// ...
date(int d =0, int m =0, y=0);
// ...
};
date::date(int d, int m, int y)
{
day = d ? d : today.day;
month = m ? m : today.month;
year = y ? y : today.year;
//
// ...
}
,
. , - , ,
. , , .. 1 .
.. (year==-1) 1 . .. (year==1). , ,
.

. , :
date d = today;
//
, ,
. X ,
X::X(const X&). $$7.6.
5.2.5
, , ,
. - ,
. X ~X (" ").
, (. $$3.2.6),
. , , ,
:
class char_stack {
int size;
char* top;
char* s;
public:
char_stack(int
~char_stack()
void push(char
void pop()
{
};
sz) { top=s=new char[size=sz]; }

{ delete[] s; } //
c) { *top++ = c; }
return *--top; }
char_stack , :
void f()
{
char_stack s1(100);
- 106 -
.
char_stack s2(200);
s1.push('a');
s2.push(s1.pop());
char ch = s2.pop();
cout << ch << '\n';
}
++
f(), char_stack, 100

s1 200 s2. f() ,
, .
5.2.6
, .
, ,
, . , , , .
. C++
, - ,
, .
- (inline). -
, , . , ,
, char_stack ,
, ! ,
. , ,
.
.
- inline :
class char_stack {
int size;
char* top;
char* s;
public:
char pop();
// ...
};
inline char char_stack::pop()
{
return *--top;
}
, -, ,
($$R.7.1.2). .
5.3
? ,
. , " ",
. , ,
. ,
.
: , , ,
, .. .
: ?
. , .
.
5.3.1
- , ,
, .
, 3. :
struct name {
char* string;
name* next;
double value;
- 107 -
.
};
++
table ( ):
// table.h
class table {
name* tbl;
public:
table() { tbl = 0; }
name* look(char*, int = 0);
name* insert(char* s) { return look(s,1); }
};
3 , .
, .. :
#include "table.h"
table globals;
table keywords;
table* locals;
main()
{
locals = new table;
// ...
}
table::look(),
:
#include <string.h>
name* table::look(char* p, int ins)
{
for (name* n = tbl; n; n=n->next)
if (ins == 0) error(" ");
nn->value = 1;
nn->next = tbl;
tbl = nn;
return nn;
}
table , (- ),
. , , ,
, table, :
class table {
name** tbl;
int size;
public:
table(int sz = 15);
~table();
name* look(char*, int = 0);
name* insert(char* s) { return look(s,1); }
};
,
. ,
, , .
, ,
. :
table::table(int sz)
{
if (sz < 0) error(" ");
tbl = new name*[size = sz];
for ( int i = 0; i<sz; i++) tbl[i] = 0;
}
- 108 -
.
table::~table()
{
for (int i = 0; i<size; i++) {
name* nx;
for (name* n = tbl[i]; n; n=nx) {
nx = n->next;
delete n->string;
delete n;
}
}
delete tbl;
}
++
name, table::~table().
($$3.13):
name* table::look(const char* p, int ins)
{
int ii = 0;
char* pp = p;
if (ii < 0) ii = -ii;
ii %= size;
for (name* n=tbl[ii]; n; n=n->next)
nn->value = 1;
nn->next = tbl[ii];
tbl[ii] = nn;
return nn;
}
, - ,
- .
. , . , ,
. , ,
. ( ),
, .
.
: ++ ,
?
? ,
, , ?
- .
, , , (.. )
.
, ""
. , ,
,
. ,
. ,
.
-,
. , ++ ,
(struct).
++.
, ++ ,
. 6
, $$13.3 ,
. -
, , ,
.
- 109 -
++
5.3.2
( )
, ( ).
, . ,
, .
. , ,
.
intset, " ":
class intset {
int cursize, maxsize;
int *x;
public:
intset(int m, int n);
~intset();
int member(int t) const;
void insert(int t);
void start(int& i) const
void ok(int& i) const
void next(int& i) const
};
// m 1..n
// t ?
// t
{ i = 0; }
{ return i<cursize; }
{ return x[i++]; }
, .
, .
, , . ,
:
void error(const char *s)
{
cerr << "set: " << s << '\n';
exit(1);
}
intset main(), :
, - :
{
if (argc != 3) error(" ");
int count = 0;
int m = atoi(argv[1]);
//
int n = atoi(argv[2]);
// 1..n
intset s(m,n);
while (count<m) {
int t = randint(n);
if (s.member(t)==0) {
s.insert(t);
count++;
}
}
print_in_order(&s);
}
argc 3, .
, argv[0] , .
extern "C" int atoi(const char*)
,
. , ,
,
. rand:
extern "C" int rand();
int randint(int u)
{
int r = rand();
if (r < 0) r = -r;
// :
//
// 1..u
- 110 -
.
return 1 + r%u;
}
++
,
-. ,
, :
intset::intset(int m, int n)
// m 1..n
{
if (m<1 || n<m) error(" intset");
cursize = 0;
maxsize = m;
x = new int[maxsize];
}
intset::~intset()
{
delete x;
}
, :
void intset::insert(int t)
{
if (++cursize > maxsize) error(" ");
int i = cursize-1;
x[i] = t;
while (i>0 && x[i-1]>x[i]) {
int t = x[i];
// x[i] x[i-1]
x[i] = x[i-1];
x[i-1] = t;
i--;
}
}
, :
int intset::member(int t) const //
{
int l = 0;
int u = cursize-1;
while (l <= u) {
int m = (l+u)/2;
if (t < x[m])
u = m-1;
else if (t > x[m])
l = m+1;
else
return 1;
//
}
return 0;
//
}
, ,
( , intset,
). ,
( intset ?).
: start() - , ok() - ,
, next() - :
class intset {
// ...
void start(int& i) const
int ok(int& i) const
int next(int& i) const
};
{ i = 0; }
{ return i<cursize; }
{ return x[i++]; }
, ,
. .
, .
print_in_order:
- 111 -
.
++
void print_in_order(intset* set)
{
int var;
set->sart(var);
while (set->ok(var)) cout << set->next(var) << '\n';
}
$$7.8.
5.4
.
, ($$5.4.1). , ($
$5.4.2) ($$5.4.3),
($$5.4.4). (static),
, , ($$5.4.5).
, , ()
($$5.4.6).
5.4.1
: vector () matrix ().
, . ,
, . ,
0 3, 0 3.
elem(), .
multiply () :
vector multiply(const matrix& m, const vector& v);
{
vector r;
for (int i = 0; i<3; i++) { // r[i] = m[i] * v;
r.elem(i) = 0;
for (int j = 0; j<3; j++)
r.elem(i) +=m.elem(i,j) * v.elem(j);
}
return r;
}
, .
multiply() elem() 4*(1+4*3) . elem()
, ,
, . , elem()
,
, .
multiply vector matrix,
,
elem(). , .
, , . -
, - , .
, friend (). :
class matrix;
class vector {
float v[4];
// ...
friend vector multiply(const matrix&, const vector&);
};
class matrix {
vector v[4];
// ...
friend vector multiply(const matrix&, const vector&);
};
- , .
, this,
. friend .
, ,
. friend ,
- 112 -
.
, .
++
multiply, :
vector multiply(const matrix& m, const vector& v)
{
vector r;
for (int i = 0; i<3; i++) { // r[i] = m[i] * v;
r.v[i] = 0;
for ( int j = 0; j<3; j++)
r.v[i] +=m.v[i][j] * v.v[j];
}
return r;
}
, - ,
. .
- :
class x {
// ...
void f();
};
class y {
// ...
friend void x::f();
};
, .
:
class x {
friend class y;
// ...
};
- y x.
5.4.2
.
:: ( ):
class X {
int m;
public:
int readm() const { return m; }
void setm(int m) { X::m = m; }
};
X::setm() m m, ,
X::m. :: .
:: .
read, put, open, -,
, . :
class my_file {
// ...
public:
int open(const char*, const char*);
};
int my_file::jpen(const char* name, const char* spec)
{
// ...
if (::open(name,flag)) { // open() UNIX(2)
// ...
}
// ...
}
- 113 -
++
5.4.3
. :
class set {
struct setmem {
int mem;
setmem* next;
setmem(int m, setmem* n) { mem=m; next=n; }
};
setmem* first;
public:
set() { first=0; }
insert(int m) { first = new setmem(m,first); }
// ...
};
:
setmem m1(1,0);
// : setmem
//
,
, :
class setmem {
friend class set;
// set
int mem;
setmem* next;
setmem(int m, setmem* n) { mem=m; next=n; }
//
};
class set {
setmem* first;
public:
set() { first=0; }
insert(int m) { first = new setmem(m,first); }
// ...
};
- , ,
(. $$12.3).
- ( ) ,
:
class X {
struct M1 { int m; };
public:
struct M2 { int m; };
M1 f(M2);
};
void f()
{ M1 a;
M2 b;
X::M1 c;
X::M2 d;
}
//
//
//
//
: `M1'
: `M1'
: X::M1
, .
- X::
. :
M1 X::f(M2 a)
{ /* ... */ }
X::M1 X::f(M2 a)
{ /* ... */ }
// : `M1'
//
X::M1 X::f(X::M2 a) // , X::

{ /* ... */ }
- 114 -
++
5.4.4
- , , ,
. , ,
. ,
. ,
:
class task {
// ...
static task* chain;
// ...
};
chain , , , ..
task. task,
, .
:
if (task::chain == 0)
// -
- chain.
.
,
. -, ,
:
class task {
// ...
static task* task_chain;
static void shedule(int);
// ...
};
- , -
, , :
task* task::task_chain = 0;
void task::shedule(int p) { /* ... */ }
, .
, static
. , : ,
, ?
static ++. ,
, : " " , ..
, , ""
, .. , .
- static.
5.4.5
. - ,
, $$4.6.9,
. ,
& , , &class_name::member_name.
" X", X::*. :
struct cl
{
char* val;
void print(int x) { cout << val << x << '\n'; }
cl(char* v) { val = v; }
};
:
typedef void (cl::*PMFI)(int);
int main()
{
- 115 -
.
cl z1("z1 ");
cl z2("z2 ");
cl* p = &z2;
PMFI pf = &cl::print;
z1.print(1);
(z1.*pf)(2);
z2.print(3);
(p->*pf)(4);
}
++
typedef .
.* ->* , ,
. () , .* ->*, .
($$6.2.5) .
5.4.6
- , , ..
struct s { ...

class s { public: ...
, ($
$R.9.5). ,
, , . ,
:
union tok_val {
char* p;
char v[8];
long i;
double d;
};
//
//
//
//
( 8 )

, ,
, . :
void strange(int i)
{
tok_val x;
if (i)
x.p = "2";
else
x.d = 2;
sqrt(x.d);
// , i != 0
}
,
:
tok_val val1 = 12;
tok_val val2 = "12";
// : int tok_val
// : char* tok_val
:
union tok_val {
char* p;
char v[8];
long i;
double d;
tok_val(const char*);
tok_val(int ii)
{ i = ii; }
tok_val(double dd) { d = dd; }
};
//
//
//
//
//
( 8 )

p v

(. $$4.6.6 $$7.3). :
void f()
{
tok_val a = 10;
// a.i = 10
- 116 -
.
tok_val b = 10.0;
}
++
// b.d = 10.0
(, char* char[8] int char ..), ,

, , ,
. :
tok_val::tok_val(const char* pp)
{
if (strlen(pp) <= 8)
strncpy(v,pp,8);
//
else
p = pp;
//
}
.
strncpy() strcpy() , ,
.
, ,
, ,
. , ,
:
class tok_val {
public:
enum Tag { I, D, S, N };
private:
union {
const char* p;
char v[8];
long i;
double d;
};
Tag tag;
void check(Tag t) { if (tag != t) error(); }
public:
Tag get_tag() { return tag; }
tok_val(const char* pp);
tok_val(long ii)
{ i = ii; tag = I; }
tok_val(double dd) { d = dd; tag = D; }
long& ival()
{ check(I); return i;
double& fval()
{ check(D); return d;
const char*& sval() { check(S); return p;
char* id()
{ check(N); return v;
};
tok_val::tok_val(const char* pp)
{
if (strlen(pp) <= 8) {
tag = N;
strncpy(v,pp,8);
}
else {
tag = S;
p = pp;
}
}
}
}
}
}
//
//
//
tok_val :
void f()
{
tok_val t1("");
tok_val t2(" ");
char s[8];
strncpy(s,t1.id(),8);
strncpy(s,t2.id(),8);
}
// v
// p
//
// check()
- 117 -
.
++
Tag get_tag() , , tok_val
. ,
. , , , , ,
char*, int double:
extern tok_val no_arg;
void error(
const char* format,
tok_val a1 = no_arg,
tok_val a2 = no_arg,
tok_val a3 = no_arg);
5.5
, .
, , .
:
[1] , ,
, , ;
[2] ,
;
[3] , new delete;
[4] -, ,
.
, ($$7.3)
($$R.12.2). .
, .
table $$5.3.1.
5.5.1
,
. ,
. ,
:
void f(int i)
{
table aa;
table bb;
if (i>0) {
table cc;
// ...
}
// ...
}
aa bb ( ) f(),
f() - bb, aa. f() i , cc bb
.
aa bb - table, aa=bb bb aa (. $
$2.3.8). ( )
, , :
void h()
{
table t1(100);
table t2 = t1;
table t3(200);
t3 = t2;
}
//
//
table : t1 t3. t2,

. , table : t1, t2
t3! , - ,
h() t1, t2 t3 ,
t1. , t3, .
- 118 -
.
(. $$1.4.2 $$7.6).
++
5.5.2
:
table tbl(100);
void f(int i)
{
static table tbl2(i);
}
int main()
{
f(200);
// ...
}
, $$5.3.1, : tbl tbl2.
table::~table() : tbl tbl2 main().
,
, .
,
.
main() . ,
. ()
, main() ()
main().
++ .
,
. <iostream.h>. cin, cout cerr?
? :
, , ?
:
main() (. $$10.5.1).
,
, , .
exit(),
. , abort(),
. , exit() . exit()
. , ,
, ($$9).

: .
, .
5.5.3
:
main()
{
table*
table*
delete
delete
}
p = new table(100);
q = new table(200);
p;
p; // ,
table::table() , table::~table().
, .. ++ , ,
new. q , p !
p q . , ,
, . p - .
delete
, . ,
.
new delete (. $$3.2.6 $$6.7). ,
- 119 -
.
++
new delete (. $$5.5.6 $
$6.7.2). $$5.5.5.
5.5.4
:
class classdef {
table members;
int no_of_members;
// ...
classdef(int size);
~classdef();
};
, , , classdef ,
size, : table::table() size.
, , :
classdef::classdef(int size)
:members(size)
{
no_of_members = size;
// ...
}
(.. table::table()) ( )
, (.. classdef::classdef()).
, .
( ):
class classdef {
table members;
table friends;
int no_of_members;
// ...
classdef(int size);
~classdef();
};
( ),
:
: friends(size), members(size), no_of_members(size)
{
// ...
}
, .
,
, , , ,
. , no_of_members
, .
, .
, table::table() , 15,
:
: members(size), no_of_members(size)
{
// ...
}
friends 15.
, (, classdef),
, ,
.

: :
- 120 -
.
class classdef {
table* members;
table* friends;
int no_of_members;
// ...
};
++
{
members = new table(size);
friends = new table; //
// table
no_of_members = size;
// ...
}
new, delete:
classdef::~classdef()
{
// ...
delete members;
delete friends;
}
, , members friends
, . ,
, -.
5.5.5
,
, .. , . ,
table tbl[10];
10 , table::table(15),
table::table() 15.
.
,
.
, . ,
new, .
,
, :
void f()
{
table*
table*
delete
delete
t1 = new table;
t2 = new table[10];
t1;
t2;
//
// :
// 10
, t2 - :
void g(int sz)
{
table* t1 = new table;
table* t2 = new table[sz];
delete t1;
delete[] t2;
}
.
delete[]
. ++
.
- 121 -
++
5.5.6
, , ,
.
,
,
.
name, table. :
struct name {
char* string;
name* next;
double value;
name(char*, double, name*);
~name();
void operator delete(void*, size_t);
private:
enum { NALL = 128 };
static name* nfree;
};
name::operator new() name::operator delete() ()
operator new() operator delete().
, operator
new() operator delete(). , , "" ,
name, ;
. nfree :
void* name::operator new(size_t)
{
register name* p = nfree; //
if (p)
nfree = p->next;
else {
//
name* q = (name*) new char[NALL*sizeof(name) ];
for (p=nfree=&q[NALL-1]; q<p; p--) p->next = p-1;
(p+1)->next = 0;
}
return p;
}
, new, , delete
. ,
, . , name::operator new()
name 16 , operator new()
20 .
, name::operator new() :
name* q= new name[NALL];
, .. new name::name().
:
void name::operator delete(void* p, size_t)
{
((name*)p)->next = nfree;
nfree = (name*) p;
}
void* name* ,
, name,
sizeof(name). size_t name::operator new() name::operator
delete() . , $$6.7. ,
name, names.
5.6
1.
(*1) 3 ,
table.
- 122 -
.
++
2. (*1) tnode ($$R.9) ..,
tnode ..
3.
(*1) intset ($$5.3.2) .
4.
(*1) intset tnode. tnode .
5.
(*3) , ,
, +, -, * /.
:
class expr {
// ...
public:
expr(char*);
int eval();
void print();
};
expr::expr() -, .
expr::eval() , expr::print()
cout. :
expr("123/4+123*4-3");
cout << "x = " << x.eval() << "\n";
x.print();
expr:
, . ,
: , , ..
6.
7.
8.
9.
(*1) char_queue ( ) ,
. : (1) (2) . .
(*2) histogram (),
, .
. , . : <task.h>.
(*2) ,
. ,
draw, "" . : <task.h> intset.
(*2) date ($$5.2.2 $$5.2.4), char_stack ($$5.2.5) intset ($$5.3.2),
- ( ). class friend.
, -.
10. 10.(*3) ,
. , ,
.
11. 11.(*2) expr 5 ,
=. 10.
12. 12.(*1) :
main()
{
cout << " \n";
}
, :
main() .
- 123 -
++
6.
.
- .
. - ,
. ,
.
,
. ,
,
.
.
6.1
, ,
.
, , .
,
, . ,
, , .. .
,
, , ,
- . , ,
, - .
:
$$6.2 ,
.
$$6.3 ,
.
$$6.4
$$6.5
, ,
.
$$6.6 .
$$6.7 .
, .
6.2
, . ,
, :
struct employee {
char*
name;
short
age;
short
department;
int
salary;
employee* next;
// ...
};
//
//
//
//
//
next (employee).
(manager):
struct manager {
employee emp;
employee* group;
short
level;
// ...
};
// employee
//
, employee emp manager.

- 124 -
.
++
, emp
. manager (manager*) employee (employee*),
. ,
manager employee.
manager*, employee emp.
. , manager employee
:
struct manager : employee {
employee* group;
short level;
// ...
};
manager employee, , , employee
manager. group manager employee (name, age ..).
:
employee
^
|
manager
, ,
. , -
. ,
. ,
.
employee manager, ,
:
void f()
{
manager m1, m2;
employee e1, e2;
employee* elist;
elist = &m1;
m1.next = &e1;
e1.next = &m2;
m2.next = &e2;
e2.next = 0;
}
//
//
//
//
//
m1
e1
m2
m2

elist
elist
elist
elist
, manager* employee*.
, employee*
manager*.
, derived base, derived
, base.
base derived :
void g()
{
manager mm;
employee* pe = &mm;
employee ee;
manager* pm = &ee;
pm->level = 2;
pm = (manager*) pe;
pm->level = 2;
//
//
//
//
//
//
//
//
//
//
:

: ee
`level'
: pe
mm manager
: pm mm
manager,
`level'
}
, ,
. . , ++
, , ,
pe pm,
(. $$13.5).
- 125 -
++
6.2.1 -
employee manager ,
. :
class employee {
char* name;
// ...
public:
employee* next;
};
void print() const;

// ...
// ,
//
class manager : public employee {

// ...
public:
void print() const;
// ...
};
. - manager
employee? employee
- manager? employee
, manager?
, ?
:
void manager::print() const
{
cout << " "
<< name << '\n';
}

, .. . , ,
this, name this->name. ,
manager::print() :
, name .
, : -
.
() ,
. , ,
- .
, , .
.. , , ,
. , , (. $$6.6.1).
, -
:
{
employee::print();
//
//
}
, :: , print() manager.
++. :
{
print();
}
//
//
manager::print().
6.2.2
. ,
- 126 -
.
++
, :
class employee {
// ...
public:
// ...
employee(char* n, int d);
};
// ...
public:
// ...
manager(char* n, int i, int d);
};
.
, :
manager::manager(char* n, int l, int d)
: employee(n,d), level(l), group(0)
{
}
employee::employee() :
employee::employee(char* n, int d)
: name(n), department(d)
{
next = list;
list = this;
}
list employee.
: , , ,
. : , ,
. ,
.
6.2.3
:
class employee {
class director : public manager {
/* ... */ };
/* ... */ };
/* ... */ };
.
, :
class temporary {
/* ... */ };
class secretary : public employee { /* ... */ };
class tsec
: public temporary, public secretary { /* ... */ };
class consultant
: public temporary, public manager { /* ... */ };
, ++ (
$$6.5.3). :
6.2.4
,
: ,
base*? :
[1] , ($$6.4.2);
[2] , ;
[3] ($$6.2.5).
- 127 -
.
++

(, , ..). [1] , ..
. [2] [3] , ..
( , ). [3] -
[2].
[1] [3]; 8.
, .. [2]. manager/employee
:
struct employee {
enum empl_type { M, E };
empl_type type;
employee* next;
char*
name;
short
department;
// ...
};
struct manager : employee {
employee* group;
short
level;
// ...
};
, , :
void print_employee(const employee* e)
{
switch (e->type) {
case E:
cout << e->name << '\t' << e->department << '\n';
// ...
break;
case M:
// ...
manager* p = (manager*) e;
cout << "level" << p->level << '\n';
// ...
break;
}
}
:
void f(const employee* elist)
{
for (; elist; elist=elist->next) print_employee(elist);
}
, , ,
: ,
. . -
. -
. ,
, ,
, - . ,
print() , :
void print(const employee* e)
{
// ...
if (e->type == M) {
manager* p = (manager*) e;
cout << "level" << p->level << '\n';
// ...
}
}
if, , ,
- 128 -
.
++
. , ,
. ,
, .. , .
, .
,
. ,
. , ,
, ,
.
6.2.5
,
. ,
.
:
class employee {
char* name;
short department;
// ...
employee* next;
static employee* list;
public:
employee(char* n, int d);
// ...
static void print_list();
virtual void print() const;
};
virtual () , print()
, print() - .
.
, (
, . $$6.3). :
void employee::print() const
{
cout << name << '\t' << department << '\n';
// ...
}
, ,
. ,
. ,
:
employee* group;
short
level;
// ...
public:
manager(char* n, int d);
// ...
void print() const;
};
print_employee() - print(), .
employee ($$6.2.2). :
void employee::print_list()
{
for ( employee* p = list; p; p=p->next) p->print();
}
.
int main()
{
employee e("J.Brown",1234);
manager m("J.Smith",2,1234);
- 129 -
.
employee::print_list();
}
++
J.Smith 1234
level 2
J.Brown 1234
, , employee_list()
, manager!
, employee
. ,
.
, , .
, . ,
, .
::, ,
manager::print(), .
. :
( ), ::
. ,
, .
- manager::print().
manager::print(), employee::print(),
.
6.3
employee ,
. , . , , shape,
(), . shape
. ,
shape:
class shape {
// ...
public:
virtual void rotate(int) { error("shape::rotate"); }
virtual void draw() { error("shape::draw"): }
// ,
// ...
};
shape ( ) , :
shape s;
// : `` ''
, s .
shape .
, = 0:
class shape {
// ...
public:
virtual void rotate(int) = 0;
virtual void draw() = 0;
};
//
//
, , .
:
shape s;
// : shape
:
class circle : public shape {
int radius;
public:
void rotate(int) { }
void draw();
// :
// shape::rotate
// :
- 130 -
.
};
++
// shape::draw
circle(point p, int r);
, ,
. :
class X {
public:
virtual void f() = 0;
virtual void g() = 0;
};
X b;
// : X
class Y : public X {
void f(); // X::f
};
Y b;
// : Y
class Z : public Y {
void g(); // X::g
};
Z c;
//
-
. ,
:
class character_device {
public:
virtual int open() = 0;
virtual int close(const char*) = 0;
virtual int read(const char*, int) =0;
virtual int write(const char*, int) = 0;
virtual int ioctl(int ...) = 0;
// ...
};
character_device.
,
.
6.4
.
:
[1] : ;
, , ;
[2] : (, ,
) ;
[3] : , ,
.
, ,
. ,
, , ,
. .
, , .
, ,
, .
, .
6.4.1
,
- 131 -
.
++
. , :
, ( -, ,
..), , ..
, ,
++, .
put_point() put_line().
point:
// screen.h
const int XMAX=40;
const int YMAX=24;
struct point {
int x, y;
point() { }
point(int a,int b) { x=; y=b; }
};
extern
inline
extern
extern
void
void
void
void
extern
extern
extern
extern
void
void
void
void
put_point(int a, int b);

put_point(point p) { put_point(p.x,p.y); }
put_line(int, int, int, int);
put_line(point a, point b)
{ put_line(a.x,a.y,b.x,b.y); }
screen_init();
screen_destroy();
screen_refresh();
screen_clear();
, (put_...),
screen_init(). , ,
screen_refresh(). ,
,
. :
#include "screen.h"
#include <stream.h>
enum color { black='*', white=' ' };
char screen[XMAX] [YMAX];
void screen_init()
{
for (int y=0; y<YMAX; y++)
for (int x=0; x<XMAX; x++)
screen[x] [y] = white;
}
void screen_destroy() { }
.
.
, :
inline int on_screen(int a, int b) //
{
return 0<=a && a <XMAX && 0<=b && b<YMAX;
}
void put_point(int a, int b)
{
if (on_screen(a,b)) screen[a] [b] = black;
}
put_line():
void put_line(int x0, int y0, int x1, int y1)
/*
(x0,y0) - (x1,y1).
: b(x-x0) + a(y-y0) = 0.
- 132 -
.
abs(eps),
eps = 2*(b(x-x0)) + a(y-y0).
. Newman, Sproull
``Principles of interactive Computer Graphics''
McGraw-Hill, New York, 1979. pp. 33-34.
*/
{
register int dx = 1;
int a = x1 - x0;
if (a < 0) dx = -1, a = -a;
register int dy = 1;
int b = y1 - y0;
if (b < 0) dy = -1, b = -b;
int two_a = 2*a;
int two_b = 2*b;
int xcrit = -b + two_a;
register int eps = 0;
++
for (;;) {
put_point(x0,y0);
if (x0==x1 && y0==y1) break;
if (eps <= xcrit) x0 +=dx, eps +=two_b;
if (eps>=a || a<b) y0 +=dy, eps -=two_a;
}
:
void screen_clear() { screen_init(); }
void screen_refresh()
{
for (int y=YMAX-1; 0<=y; y--) { //
for (int x=0; x<XMAX; x++)
//
cout << screen[x] [y];
cout << '\n';
}
}
,
, .
6.4.2
. ,
( shape) ,
(, ..).
, shape:
struct shape {
static shape* list;
shape* next;
shape() { next = list; list = this; }
virtual point north() const = 0;
virtual point south() const = 0;
virtual point east() const = 0;
virtual point west() const = 0;
virtual point neast() const = 0;
virtual point seast() const = 0;
virtual point nwest() const = 0;
virtual point swest() const = 0;
virtual void move(int, int) = 0;
};
draw(), move().
, .
: north - , ... , neast - -, ... , swest - -.
, .
shape::shape() shape::list.
next, shape.
- 133 -
.
, shape .
++
.
, . ,
, .. :
class line : public shape {
/*
["w", "e" ]
north() - ``
, ''
*/
point w, e;
public:
point north() const { return point((w.x+e.x)/2,e.y<w.y?w.y:e:y); }
point south() const { return point((w.x+e.x)/2,e.y<w.y?e.y:w.y); }
point east() const;
point west() const;
point neast() const;
point seast() const;
point nwest() const;
point swest() const;
void move(int a, int b)
{ w.x +=a; w.y +=b; e.x +=a; e.y +=b; }
void draw() { put_line(w,e); }
line(point a, point b) { w = a; e = b; }
line(point a, int l) { w = point(a.x+l-1,a.y); e = a; }
};
:
class rectangle : public shape {
/*
nw ------ n ----- ne
|
|
|
|
w
c
e
|
|
|
|
sw ------ s ----- se
*/
point sw, ne;
public:
point north() const { return point((sw.x+ne.x)/2,ne.y); }
point south() const { return point((sw.x+ne.x)/2,sw.y); }
point east() const;
point west() const;
point neast() const { return ne; }
point seast() const;
point nwest() const;
point swest() const { return sw; }
void move(int a, int b)
{ sw.x+=a; sw.y+=b; ne.x+=a; ne.y+=b; }
void draw();
rectangle(point,point);
};
. ,
:
rectangle::rectangle(point a, point b)
{
if (a.x <= b.x) {
if (a.y <= b.y) {
sw = a;
ne = b;
}
else {
sw = point(a.x,b.y);
ne = point(b.x,a.y);
}
}
- 134 -
.
else {
if (a.y <= b.y) {
sw = point(b.x,a.y);
ne = point(a.x,b.y);
}
else {
sw = b;
ne = a;
}
}
}
++
, :
void rectangle::draw()
{
point nw(sw.x,ne.y);
point se(ne.x,sw.y);
put_line(nw,ne);
put_line(ne,se);
put_line(se,sw);
put_line(sw,nw);
}
:
void shape_refresh();
//
void stack(shape* p, const shape* q); // p q
, ;
. , , :
void shape_refresh()
{
screen_clear();
for (shape* p = shape::list; p; p=p->next) p->draw();
screen_refresh();
}
, , .
(south()) (north()) :
void stack(shape* p, const shape* q) // p q
{
point n = q->north();
point s = p->south();
p->move(n.x-s.x,n.y-s.y+1);
}
, , ,
,
. ,
.
6.4.3
. myshape ( ,
), main(), .
myshape:
#include "shape.h"
class myshape : public rectangle {
line* l_eye;
//
line* r_eye;
//
line* mouth;
//
public:
myshape(point, point);
void draw();
void move(int, int);
};
myshape:
myshape::myshape(point a, point b) : rectangle(a,b)
- 135 -
.
++
{
int ll = neast().x-swest().x+1;
int hh = neast().y-swest().y+1;
l_eye = new line(point(swest().x+2,swest().y+hh*3/4),2);
r_eye = new line(point(swest().x+ll-4,swest().y+hh*3/4),2);
mouth = new line(point(swest().x+2,swest().y+hh/4),ll-4);
}
, , shape_refresh() .
my_shape, .
myshape. ,
. "" , draw():
void myshape::draw()
{
rectangle::draw();
int a = (swest().x+neast().x)/2;
int b = (swest().y+neast().y)/2;
put_point(point(a,b));
}
myshape rectangle
(l_eye, r_eye mouth):
void myshape::move(int a, int b)
{
rectangle::move(a,b);
l_eye->move(a,b);
r_eye->move(a,b);
mouth->move(a,b);
}
, :
int main()
{
screen_init();
shape* p1 = new rectangle(point(0,0),point(10,10));
shape* p2 = new line(point(0,15),17);
shape* p3 = new myshape(point(15,10),point(27,18));
shape_refresh();
p3->move(-10,-10);
stack(p2,p3);
stack(p1,p2);
shape_refresh();
screen_destroy();
return 0;
}
, , shape_refresh() stack(), ,
(, , ).
:
***********
*
*
*
*
*
*
*
*
*
*
*
*
*
*
***********
*****************
***********
*
*
* **
** *
*
*
*
*
*
*
*
* ******* *
*
*
- 136 -
.
***********
++
6.5
$$1.5.3 $$6.2.3 , . ,
: . ,
task,
displayed. (
satellite) :
class satellite : public task, public displayed {
// ...
};
. ,
.
satellite task
displayed:
void f(satellite&
{
s.draw();
//
s.delay(10); //
s.xmit();
//
}
s)
displayed::draw()
task::delay()
satellite::xmit()
, satellite task displayed:

void highlight(displayed*);
void suspend(task*);
void g(satellite* p)
{
highlight(p);
// highlight((displayed*)p)
suspend(p);
// suspend((task*)p);
}
, () :
task displayed satellite.
, , :
class task {
// ...
virtual pending() = 0;
};
class displayed {
// ...
};
class satellite : public task, public displayed {
// ...
void pending();
void draw();
};
satellite::draw() satellite::pending() satellite ,
displayed task, .
,
displayed, task satellite. satellite task displayed,
(, , task displayed ).
.
6.5.1

. , task displayed link, satellite
:
- 137 -
.
class task : public link {
// link
// ( )
// ...
};
++
class displayed : public link {

// link
// ( )
// ...
};
. link ,
. , link,
, . satellite
:
,
(. $$6.5.3).
6.5.2
, - :
class task {
// ...
virtual debug_info* get_debug();
};
class displayed {
// ...
virtual debug_info* get_debug();
};
satellite :
void f(satellite* sp)
{
debug_info* dip = sp->get_debug(); //:
dip = sp->task::get_debug();
//
dip = sp->displayed::get_debug(); //
}
, ,
:
class satellite : public task, public derived {
// ...
debug_info* get_debug()
{
debug_info* dip1 = task:get_debug();
debug_info* dip2 = displayed::get_debug();
return dip1->merge(dip2);
}
};
satellite . satellite::get_debug()
get_debug() , ,
get_debug() satellite.
, ,
. ,
, .
. , , ,
.
, , ,
$$13.8 draw() Window Cowboy.
,
. , ,
"- ".
(, ),
- 138 -
.
. , $$6.2.5
++
void manager::print()
{
employee::print();
// ...
}
, employee - manager. ,
employee manager,
print() . , - :
class employee {
// ...
virtual void print();
};
class foreman : public employee {
// ...
void print();
};
class manager : public foreman {
// ...
void print();
};
foreman::print() ,
. :
class foreman : public employee {
typedef employee inherited;
// ...
void print();
};
class manager : public foreman {
typedef foreman inherited;
// ...
void print();
};
void manager::print()
{
inherited::print();
// ...
}
, , , ,
inherited . - ,
inherited .
6.5.3
,
.
, , ( ),
.
,
"" . -
.
, , .
.
(. $$13.2 $$8.7). -
. ++ - ,
, .
.
"" ,
:
- 139 -
.
class window {
//
virtual void draw();
};
++
window - draw().
, (window).
( ) (draw):
class window_w_border : public virtual window {
// " "
// ,
void draw();
};
class window_w_menu : public virtual window {
// " "
// ,
void draw();
};
:
class window_w_border_and_menu
: public virtual window,
public window_w_border,
public window_w_menu {
// " "
void draw();
};
.
, , window
window .
window .
window_w_border_and_menu:
,
$$6.5, satellite.
, ,
. , ,
, .
draw(). ,
. , :
void window_w_border::draw()
{
window::draw();
//
}
void window_w_menu::draw()
{
window::draw();
//
}
. ,
($$6.2.1), . ,
:
void window_w_border_and_menu::draw() // !
{
window_w_border::draw();
window_w_menu::draw();
// ,
//
}
. , ,
, , .
window::draw() !
- 140 -
.
++
, . .
, . ,
, , . _draw(),
, draw()
, . window
:
class window {
//
void _draw();
void draw();
};
:
class window_w_border : public virtual window {
// " "
// ,
void _draw();
void draw();
};
void window_w_border::draw()
{
window::_draw();
_draw();
//
};
,
window::draw(), window::_draw()
:
class window_w_border_and_menu
public window_w_border,
public window_w_menu {
void _draw();
void draw();
};
void window_w_border_and_menu::draw()
{
window::_draw();
window_w_border::_draw();
window_w_menu::_draw();
_draw();
// ,
//
}
window::draw() window::_draw(),
.
window window_w_border window_w_menu
.
, ,
,
. :
,
.
, - ,
. ,
. window get_input():
class window {
//
virtual void get_input();
};
, ,
:
- 141 -
.
class window_w_banner : public virtual window {
// " "
void draw();
void update_banner_text();
};
++
void window_w_banner::update_banner_text()
{
// ...
get_input();
//
}
get_input() , ,
:
class window_w_menu : public virtual window {
// " "
// ,
void draw();
void get_input(); // window::get_input()
};
:
class window_w_banner_and_menu
public window_w_banner,
public window_w_menu
{
void draw();
};
, - :
class window_w_input : public virtual window {
// ...
void draw();
void get_input(); // window::get_input
};
class window_w_input_and_menu
public window_w_input,
{
// : window_w_input
// window_w_menu
// window::get_input
void draw();
};
, :
window_w_input window_w_menu , "-",
- :
class window_w_input_and_menu
public window_w_input,
{
void draw();
void get_input();
};
window_w_input_and_menu::get_input() get_input().
$$R.10.1.1.
6.6
(private), (protected) (public):
X - X.
- 142 -
.
++
X - X,
-
X (. $$5.4.1).
.
: ,
( ), , (
) .
. ,
. , -, ..
, :
class X {
private:
enum { A, B };
void f(int);
int a;
};
void X::f(int i)
{
if (i<A) f(i+B);
a++;
}
void g(X& x)
{
int i = X::A;
x.f(2);
x.a++;
}
// : X::A
// : X::f
// : X::a
6.6.1
, window .
_draw() ,
, .
. ,
draw() . ,
window - :
class window {
public:
// ...
protected:
void _draw();
// ,
private:
//
};
, , window_w_border
window_w_menu.
_ , ,
: , _, ,
. , , (
).
, :
class X {
//
int priv;
protected:
int prot;
public:
int publ;
void m();
- 143 -
.
};
++
X::m :
void X::m()
{
priv = 1;
prot = 2;
publ = 3;
}
//
//
//
:
class Y : public X {
void mderived();
};
Y::mderived()
{
priv = 1;
prot = 2;
//
//
//
//
publ = 3;
: priv
: prot ,
mderived() Y
: publ
}
:
void f(Y* p)
{
p->priv = 1;
p->prot = 2;
//
//
//
//
p->publ = 3;
: priv
: prot , f()
X Y
: publ
6.6.2
, :
class X {
public:
int a;
// ...
};
class Y1 : public X { };
class Y2 : protected X { };
class Y3 : private X { };
X - Y1, , , ()
Y1* X*, X:
void f(Y1* py1, Y2* py2, Y3* py3)
{
X* px = py1;
// : X - Y1
py1->a = 7;
//
px = py2;
// : X - Y2
py2->a = 7;
//
px = py3;
// : X - Y3
py3->a = 7;
//
}

class Y2 : protected X { };
class Z2 : public Y2 { void f(); };
X - Y2, Y2,
Y2 ( Z2) () Y2* X*.
X:
void Z2::f(Y1* py1, Y2* py2, Y3* py3)
{
X* px = py1;
// : X - Y1
- 144 -
.
py1->a = 7;
px = py2;
py2->a = 7;
px = py3;
py3->a = 7;
//
//
//
//
//
//
++
: X - Y2,
Z2 - Y2
: X - Y3
, :
class Y3 : private X { void f(); };
X - Y3, Y3
() Y3* X*.
X:
void Y3::f(Y1* py1, Y2* py2, Y3* py3)
{
X* px = py1;
// : X - Y1
py1->a = 7;
//
px = py2;
// : X - Y2
py2->a = 7;
//
px = py3;
// : X - Y3,
// Y3::f Y3
py3->a = 7;
//
}
6.7
operator new() operator delete(),
. , ( ), ,
. ,
employee ($$6.2.5) :
class employee {
// ...
public:
};
void* employee::operator new(size_t s)
{
// `s'
//
}
void
{
//
//
//
}
employee::operator delete(void* p, size_t s)

`p' `s' ,
employee::operator new();

size_t . -
.
sizeof(employee), - sizeof(manager).
. ,
( ) size_t
operator delete(), ,
.
, operator delete()? ,
operator delete(), , ;
:
int level;
// ...
};
- 145 -
.
void f()
{
employee* p = new manager; //
delete p;
}
++
. ,
. employee:
class employee {
// ...
public:
// ...
virtual ~employee();
};
:
employee::~employee() { }
( ),
employee (
), .
:
void f()
{
employee* p = new manager; //
delete p;
}
( )
employee::operator new(sizeof(manager))

employee::operator delete(p,sizeof(manager))
,
, ,
size_t. , ,
. ""
, .
, ,
, .. , ,
, :
class X {
// ...
public:
// ...
virtual void f();
virtual ~X();
// X ,
//
};
6.7.1
, : "
?" - . : ",
".
,
. , - .
, . -
, .
.
, ,
. , ,
. ,
- 146 -
.
++
, . .
, , ,
. .
" "
, :
class expr {
// ...
public:
expr();
//
virtual expr* new_expr() { return new expr(); }
};
new_expr() expr,
. new_expr() ,
:
class conditional : public expr {
// ...
public:
conditional(); //
expr* new_expr() { return new conditional(); }
};
, , expr, " ":
void user(expr* p1, expr* p2)
{
expr* p3 = p1->new_expr();
expr* p4 = p2->new_expr();
// ...
}
p3 p4 , .
,
, :
class expr {
// ...
expr* left;
expr* right;
public:
// ...
// `s' `this'
inline void copy(expr* s);
// , this
virtual expr* clone(int deep = 0);
};
deep ( )
, ( ).
0 .
clone() , , :
void fct(expr* root)
{
expr* c1 = root->clone(1);
expr* c2 = root->clone();
// ...
}
//
//
, clone() expr .
:
void expr::copy(expression* s, int deep)
{
if (deep == 0) { //
*this = *s;
}
else { // :
left = s->clone(1);
right = s->clone(1);
- 147 -
.
// ...
}
}
++
expr::clone() expr ( expr

), expr,
:
expr* expr::clone(int deep)
{
expr* r = new expr(); //
r->copy(this,deep);
// `*this' `r'
return r;
}
clone() expr ,
- ( ):
class arithmetic : public expr {
// ...
// - =>
// clone
};
, -, clone():
class conditional : public expression {
expr* cond;
public:
inline void copy(cond* s, int deep = 0);
expr* clone(int deep = 0);
// ...
};
copy() clone() expression:
expr* conditional::clone(int deep)
{
conditional* r = new conditional();
r->copy(this,deep);
return r;
}
void conditional::copy(expr* s, int deep)
{
if (deep == 0) {
*this = *s;
}
else {
expr::copy(s,1); // expr
cond = s->cond->clone(1);
}
}
expr::copy()
expr::clone() (.. ).
.
copy() clone()
($$1.4.2) _draw() draw() ($$6.5.3). ,
copy() . ,
clone(). , .
6.7.2
new . ,
? .
:
class X {
// ...
public:
X(int);
- 148 -
.
// ...
};
++
, :
// :
void* operator new(size_t, void* p) { return p; }
new :
char
void
{
X*
//
}
buffer[sizeof(X)];
f(int i)
p = new(buffer) X(i); // X buffer
...
operator new(), new,

($$R.13.2). operator new() size_t.
new.
operator new()
. ,
:
class Arena {
// ...
virtual void* alloc(size_t) = 0;
virtual void free(void*) = 0;
};
void operator new(size_t sz, Arena* a)
{
return a.alloc(sz);
}
(Arena):
extern Arena* Persistent;
extern Arena* Shared;
void g(int i)
{
X* p = new(Persistent) X(i);
X* q = new(Shared) X(i);
// ...
}
//
//
// X
// X
,
, .
:
void h(X* p)
{
p->~X();
Persistent->free(p);
}
//
//
, ,
, , , . , ,
, ,
.
6.8
1.
(*1)
class base {
public:
virtual void iam() { cout << "base\n"; }
};
base iam(),
. iam() .
base* iam() .
- 149 -
.
++
2. (*2) ($$6.4.1) .
3.
(*2) triangle () circle ().
4.
(*2) , , .
, .
5.
(*2) shape , line rectangle,

.
6.
(*2)
class char_vec {
int sz;
char element [1];
public:
static new_char_vec(int s);
char& operator[] (int i) { return element[i]; }
// ...
};
new_char_vec()
char_vec , element[].
?
7.
(*1) , shape $$6.4, ,

.
8.
(*1.5) , satellite $$6.5, ,

.
9.
(*2) , window $$6.5.3,

, .
10. (*2) ,
. - ,
, .
, ,
. - , , .
, .
.
11. (*2) clone() $$6.7.1,
Arena ($$6.7.2), . Arena
Arena.
12. (*2) Circle (), Square () Triangle (),
shape. intersect() Shape*,
, , .
. ,
, ,
.
13. (*5) , . :
<task.h>. . task
(). task (
task::save() task::restore()) .
, task. ,
, .
. ,
. task::delay(long),
"" . : task,
? .
queue (). ,
. .
, ?
- 150 -
++
7.
, ,
, .
-
++.
, .
, (),
[], ->, .
. , ,
,
.
7.1
,
. , ++ int +, -, *, / .. ( )
. ,
, , .
, . ,
, , ++
.
, , ++ .
,
,
. :
class complex {
double re, im;
public:
};
,
, + *.
operator+
operator*. , b c complex, b+c ( ) operator+(b,c).
:
void f()
{
complex a = complex(1,3.1);
complex b = complex(1.2,2);
complex c = b;
a = b+c;
b = b+c*a;
c = a*b+complex(1,2);
}
, b=b+(c*a),
b=(b+c)*a.
7.2
, :
+
=
|=
||
<
<<
++
*
>
>>
--
/
+=
>>=
->*
%
-=
<<=
,
^
*=
==
->
&
/=
!=
[]
|
%=
<=
()
~
^=
>=
new
!
&=
&&
delete
: ($$7.9), ($$7.7), ($
$7.8), ($$3.2.6).
, . ,
% , !. ,
, .
- 151 -
.
++
pow(), ** . ,
. , **
, . ,
: ** ( )
( )? a**p a*(*p) (a)**(p)?
operator, ,
, operator<<. .
:
void f(complex a, complex b)
{
complex c = a + b;
complex d = operator+(a,b);
}
//
//
complex .
7.2.1
- ,
. , @ aa @ bb
aa.operator(bb), operator@(aa,bb). ,
($$R.13.2).
- ,
. @ @aa
aa.operator@(), operator@(aa). ,
($$R.13.2).
@ @aa aa.operator@(int),
operator@(aa,int). $$7.10. ,
($$13.2).
, ++. ,
% , + . :
class X {
// ( `this'):
X* operator&();
// &
// ( )
X operator&(X);
// & ( )
X operator++(int);
//
X operator&(X,X);
// : &
X operator/();
// : /
};
// ( )
X
X
X
X
X
X
operator-(X);
operator-(X,X);
operator--(X&,int);
operator-();
operator-(X,X,X);
operator%(X);
//
//
//
//
//
//

:
:
: %
[] $$7.7, () $$7.8, -> $$7.9, ++ -- $$7.10.
7.2.2
. ,
operator=, operator[], operator() operator-> -.
, .
,
. , a int, ++a a+=1,
a=a+1. ,
. , operator+=() complex
complex::operator+() complex operator=().
, = (), &( ) , (
) .
, :
- 152 -
.
class X {
// ...
private:
void operator=(const X&);
void operator&();
void operator,(const X&);
// ...
};
void f(X a, X b)
{
a= b;
&a;
a,b
}
++
// : =
// : &
// : ,
,
.
7.2.3
, ,
( , new delete, ).
, ,
. , ,
. , ++ , ( =,
&, , ).
, , -. ,
aa 2, -
aa+2 aa.operator+(2), 2+aa ,
int, + 2.operator+(aa). ,
aa+2 2+aa -.
, .
.
, $$R.13.2.
7.3
,
-, . ,
:
class complex {
double re, im;
public:
friend complex operator+(complex, double);
friend complex operator+(double, complex);
friend complex operator-(complex, double);
friend complex operator-(complex, double);
friend complex operator-(double, complex);
complex operator-(); // friend complex operator*(complex, complex);
friend complex operator*(complex, double);
friend complex operator*(double, complex);
// ...
};
, :
void f()
{
complex a(1,1), b(2,2), c(3,3), d(4,4), e(5,5);
a = -b-c;
b = c*2.0*c;
c = (d+e)*a;
}
- 153 -
.
++
- , operator*() complex
double . ,
(, , complex <complex.h>).
7.3.1
, , ,
double complex:
class complex {
// ...
complex(double r) { re=r; im=0; }
};
complex, double.
.
:
complex z1 = complex(23);
complex z2 = 23;
z1 z2 complex(23).
.
, ,
. , complex :
class complex {
double re, im;
public:
complex(double r, double i =0) { re=r; im=i; }
complex operator+=(complex);
complex operator*=(complex);
// ...
};

. ,
. , a=b*2
a = operator*(b, complex( double(2), double(0) ) )
, + , , ,
. , ,
,
operator*=(double):
class complex {
double re, im;
public:
complex(double r, double i =0) { re=r; im=i; }
complex& operator+=(complex);
complex& operator*=(complex);
complex& operator*=(double);
// ...
};
*= += ,
, "" * + ,
:
inline complex& complex::operator+=(complex a)
{
re += a.re;
im += a.im;
return *this;
}
,
- 154 -
.
++
, "" .
:
inline complex operator+(complex a, complex b)
{
return complex(a.re+b.re, a.im+b.im);
}
return ,
. , , ,
, * + *= += ,
:
matrix& matrix::operator*=(const matrix& a)
{
// ...
return *this;
}
matrix operator*(const matrix& a, const matrix& b)
{
matrix prod = a;
prod *= b;
return prod;
}
,
, , .. .
, ($$7.3.3).
, ,
,- ,
.
7.3.2
, :
[1] (
).
[2] , .
[3] , .
, ,
. - X::operator T(), T ,
X T. , tiny (),
0..63,
:
class tiny {
char v;
void assign(int i)
{ if (i>63) { error(" "); v=i&~63; }
v=i;
}
public:
tiny(int i) { assign(i) }
tiny(const tiny& t) { v = t.v; }
tiny& operator=(const tiny& t) { v = t.v; return *this; }
tiny& operator=(int i) { assign(i); return *this; }
operator int() { return v; }
};
tiny, int.
tiny .
tiny tiny::operator int(),
tiny int. , int, tiny,
int :
void main()
{
- 155 -
.
tiny c1 = 2;
tiny c2 = 62;
tiny c3 = c2 -c1;
tiny c4 = c3;
int i = c1 + c2;
c1 = c2 + 2 * c1;
c2 = c1 - i;
c3 = c2;
}
++
//
//
//
//
//
//
c3 = 60
i = 64

( )
: c1 = 0 ( 66)
: c2 = 0
( )
tiny, .
, [].
,
( 100,
, - ..).
, + *.
,
( ) ,
. istream
ostream, , , :
while (cin>>x) cout<<x;
cin>>x istream&. ,
cin, while (. $$10.3.2). -
, , ,
.
, .
. ,
.
, , X::intof(), ,
, ,
X::operator int().
7.3.3
X ,
X, X.

. ,
.
, . :
class x { /* ... */ x(int); x(char*); };
class y { /* ... */ y(int); };
class z { /* ... */ z(x); };
x f(x);
y f(y);
z g(z);
void k1()
{
f(1);
// , : f(x(1)) f(y(1))
f(x(1));
f(y(1));
g("asdf"); // , g(z(x("asdf")))
}
,
:
class x { /* ... */ x(int); };
void h(double);
void h(x);
void k2()
{
h(1);
}
h(1) h(double(1)), h(x(1)),
- 156 -
.
++
.
, , $$4.6.6 $$R.13.2, .
,
. .
, .
. ,
, .
.
(, , ),
. ,
, .
, ,
, complex .

. , aa=f(1)
f(1), aa . aa x,
f(x(1)), x. aa
y, f(y(1)). g("asdf"),
g(z(x("asdf))) . ,
,
. ,
,
.. ,
! ,
, ,
.
,
:
class quad {
// ...
public:
quad(double);
// ...
};
quad operator+(quad,quad);
void f(double a1, double a2)
{
quad r1 = a1+a2;
quad r2 = quad(a1)+a2;
}
//
//
// quad
, ,
, , .
, , ,
:
class real {
// ...
public:
operator double();
operator int();
// ...
};
void g(real a)
{
double d = a;
int i = a;
d = a;
i = a;
}
//
//
//
//
d
i
d
i
=
=
=
=
a.double();
a.int();
a.double();
a.int();
,
.
- 157 -
++
7.4
, 1.2 12e3
double. , -
.
. ,
. , complex <complex.h>
zz1*3+zz2*complex(1,2) , . *
, + complex(3) complex(1,2)
.
7.5
complex
. ,
double, , .
. ,
:
class matrix {
double m[4][4];
public:
matrix();
friend matrix operator+(const matrix&, const matrix&);
friend matrix operator*(const matrix&, const matrix&);
};

. , ..
, .
:
matrix operator+(const matrix& arg1, const& arg2)
{
matrix sum;
for (int i = 0; i<4; i++)
for (int j=0; j<4; j++)
sum.m[i] [j] = arg1.m[i][j] + arg2.m[i][j];
return sum;
}
operator+() , .
:
class matrix {
// ...
friend matrix& operator+(const matrix&, const matrix&);
friend matrix& operator*(const matrix&, const matrix&);
};
, .
,
. ,
. ,
. (
) ,
. .
7.6
string:
struct string {
char* p;
int size;
// , p
string(int size) { p = new char[size=sz]; }
~string() { delete p; }
};
- 158 -
.
++
- , .
. $$5.5.1
:
void f()
{
string s1(10);
string s2(20)
s1 = s2;
}
, s1 = s2
, . f() s1 s2 ,
, .
string:
struct string {
char* p;
int size;
// , p
string& operator=(const string&);
};
string& string::operator=(const string& a)
{
if (this !=&a) {
// , s=s
delete p;
p = new char[size=a.size];
strcpy(p,a.p);
}
return *this;
}
string .
f() , :
void f()
{
string s1(10);
string s2 = s1;
}
// ,
string string::string(int),
. ,
. string::operator(), : p
, . ,
, . ,
. ,
, :
struct string {
char* p;
int size;
// , p
string& operator=(const string&);
string(const string&);
};
string::string(const string& a)
{
p=new char[size=sz];
strcpy(p,a.p);
}
X X(const X&).
, .
, . X , ,
, ,
, :
- 159 -
.
class X {
// ...
X(something);
X(const X&);
operator=(const X&);
++
//
//
//
//
//
~X();
,

:

,
};
, :
. , ..
. .
, .
:
string g(string arg)
{
return arg;
}
main()
{
string s = "asdf";
s = g(s);
}
, g() s "asdf". s
s, string. s
g() string(const string&).
, s. , ,
. , , ,
string::~string() (. $$R.12.2).
X X::operator=(const X&) X::X(const X&)
, .
X. ,
, , , ,
.
, :
class Record {
string name, address, profession;
// ...
};
void f(Record& r1)
{
Record r2 = r1;
}
string r1 string::operator=(const
string&). - .
.
.
7.7
operator[] .
() . , ,
. $$2.3.10,
, .
. :
class assoc {
struct pair {
char* name;
int val;
};
pair* vec;
int max;
int free;
- 160 -
.
assoc(const assoc&);
assoc& operator=(const assoc&);
public:
assoc(int);
int& operator[](const char*);
void print_all();
};
++
//
//
assoc pair max. free

.
assoc,
. :
assoc::assoc(int s)
{
max = (s<16) ? 16 : s;
free = 0;
vec = new pair[max];
}
, $$2.3.10. ,
, assoc :
#include <string.h>
int& assoc::operator[](const char* p)
/*
( pair):
p, ,
, p
*/
{
register pair* pp;
for (pp=&vec[free-1]; vec<=pp; pp-- )
if (strcmp(p,pp->name) == 0) return pp->val;
if (free == max) {
//:
pair* nvec = new pair[max*2];
for (int i=0; i<max; i++) nvec[i] = vec[i];
delete vec;
vec = nvec;
max = 2*max;
}
pp = &vec[free++];
pp->name = new char[strlen(p)+1];
strcpy(pp->name,p);
pp->val = 0;
// = 0
return pp->val;
}
assoc ,
- .
. :
void assoc::print_all()
{
for (int i = 0; i<free; i++)
cout << vec[i].name << ": " << vec[i].val << '\n';
}
, :
main()
{
//
//
const MAX = 256; //

char buf[MAX];
assoc vec(512);
while (cin>>buf) vec[buf]++;
vec.print_all();
, .
$$7.14 [20].
- 161 -
.
$$8.8.
++
operator[]() . , x[y] == y[x]

, x . ,
, ($$7.2.2, . $$7.9).
7.8
, .. (-),
, , - - .
. operator()()
.
, ,
, ,
.
assoc.
assoc_iterator, assoc
. , assoc,
friend:
class assoc {
friend class assoc_iterator;
pair* vec;
int max;
int free;
public:
assoc(int);
int& operator[](const char*);
};
:
class assoc_iterator {
const assoc* cs;
// assoc
int i;
//
public:
assoc_iterator(const assoc& s) { cs = &s; i = 0; }
pair* operator()()
{ return (i<cs->free)? &cs->vec[i++] : 0; }
};
assoc assoc_iterator ,
() ( pair) .
0:
main()
//
//
const MAX = 256;

//
char buf[MAX];
assoc vec(512);
while (cin>>buf) vec[buf]++;
assoc_iterator next(vec);
pair* p;
while ( p = next(vec) )
cout << p->name << ": " << p->val << '\n';
}
, :
, .
, .
,
. , first(),
next() last(), ++ , ,
(. $$8.8). , operator()
.
operator() -.
- 162 -
++
7.9
-> .
,
class Ptr {
// ...
X* operator->();
};
Ptr X ,
:
void f(Ptr p)
{
p->m = 7;
}
// (p.operator->())->m = 7
p p.operator->() m, .
operator->() . ,
, - -> :
void g(Ptr p)
{
X* q1 = p->;
X* q2 = p.operator->();
}
//
//
-> " ", .. ,

. , RecPtr
Rec, . RecPtr
, .
RecPtr::operator->() , RecPtr
.
class RecPtr {
Rec* in_core_address;
const char* identifier;
// ...
public:
RecPtr(const char* p)
: identifier(p) { in_core_address = 0; }
~RecPtr()
{ write_to_disc(in_core_address,identifier); }
Rec* operator->();
};
Rec* RecPtr::operator->()
{
if (in_core_address == 0)
in_core_address = read_from_disc(identifier);
return in_core_address;
}
:
main(int argc, const char* argv)
{
for (int i = argc; i; i--) {
RecPtr p(argv[i]);
p->update();
}
}
, RecPtr (. $$8), Record
. ,
.
-> , * []. ,
Y* p;

- 163 -
.
p->m == (*p).m == p[0].m
++
, . , , :
class X {
Y* p;
public:
Y* operator->() { return p; }
Y& operator*() { return *p; }
Y& operator[](int i) { return p[i]; }
};
,
, , x ,
++, += = +, ++x x+=1 x=x+1.
-> [] ,
. ,
, -> ,
. ->, ++
, (. $$12.2.8 13.9).
7.10
" ",
++ -- , ,
. ,
" ", ,
. :
void f1(T a)
{
T v[200];
T* p = &v[10];
p--;
*p = a;
++p;
*p = a;
//
// : `p' ,
//
//
p CheckedPtrToT,
, .
,
:
class CheckedPtrToT {
// ...
};
void f2(T a)
{
T v[200];
CheckedPtrToT p(&v[0],v,200);
p--;
*p = a;
++p;
*p = a;
//
// :
// `p'
//
++,
. , CheckedPtrToT
:
class CheckedPtrToT {
T* p;
T* array;
int size;
public:
// `p'
- 164 -
};
++
// `a' `s'
CheckedPtrToT(T* p, T* a, int s);
// `p'
//
CheckedPtrToT(T* p);
T* operator++();
//
T* operator++(int);
//
T* operator--();
//
T* operator--(int);
//
T& operator*();
//
int , .
,
. , operator++
, , ,
.
"" ++ --.
CheckedPtrToT
:
void f3(T a)
{
T v[200];
CheckedPtrToT p(&v[0],v,200);
p.operator--(1);
p.operator*() = a;
p.operator++();
p.operator*() = a;
//
// :
// `p'
//
}
$$7.14 [19] CheckedPtrToT,
($$9.10[2]) ,
. ++ --
$$8.8.
7.11
string.
, , C++.
#include <string.h>
class string {
struct srep {
char* s;
//
int n;
//
srep() { n = 1; }
};
srep *p;
public:
string(const char *);
// string x = "abc"
string();
// string x;
string(const string &);
// string x = string ...
string& operator=(const char *);
string& operator=(const string &);
~string();
char& operator[](int i);
friend ostream& operator<<(ostream&, const string&);
friend istream& operator>>(istream&, string&);
friend int operator==(const string &x, const char *s)
{ return strcmp(x.p->s,s) == 0; }
friend int operator==(const string &x, const string &y)
{ return strcmp(x.p->s,y.p->s) == 0; }
friend int operator!=(const string &x, const char *s)
{ return strcmp(x.p->s,s) != 0; }
friend int operator!=(const string &x, const string &y)
{ return strcmp(x.p->s,y.p->s) != 0; }
};
- 165 -
.
:
++
string::string()
{
p = new srep;
p->s = 0;
}
string::string(const string& x)
{
x.p->n++;
p = x.p;
}
string::string(const char* s)
{
p = new srep;
p->s = new char[ strlen(s)+1 ];
strcpy(p->s, s);
}
string::~string()
{
if (--p->n == 0) {
delete[] p->s;
delete p;
}
}
.
, :
string& string::operator=(const char* s)
{
if (p->n > 1) {
//
p->n--;
p = new srep;
}
else
//
delete[] p->s;
p->s = new char[ strlen(s)+1 ];
strcpy(p->s, s);
return *this;
}
string& string::operator=(const string& x)
{
x.p->n++;
// ``st = st''
if (--p->n == 0) {
delete[] p->s;
delete p
}
p = x.p;
return *this;
}
.
( << , ):
ostream& operator<<(ostream& s, const string& x)
{
return s << x.p->s << " [" << x.p->n << "]\n";
}
($$10.3.1):
istream& operator>>(istream& s, string& x)
{
char buf[256];
s >> buf;
// : buf
// . $$10.3.1
- 166 -
.
x = buf;
cout << "echo: " << x << '\n';
return s;
}
++
. :
void error(const char* p)
{
cerr << p << '\n';
exit(1);
}
char& string::operator[](int i)
{
if (i<0 || strlen(p->s)<i) error(" ");
return p->s[i];
}
.
, . ,
done, , .
.
int main()
{
string x[100];
int n;
cout << " \n";
for ( n = 0; cin>>x[n]; n++) {
if (n==100) {
error(" ");
return 99;
}
string y;
cout << (y = x[n]);
if (y == "done") break;
}
cout << " \n";
for (int i=n-1; 0<=i; i--) cout << x[i];
return 0;
}
7.12
,
-, -. , ,
($$R.12), ,
. , , ,
-.
X:
class X {
// ...
X(int);
int m1();
int m2() const;
friend int f1(X&);
friend int f2(const X&);
friend int f3(X);
};
, X::m1() X::m2() X.
X(int) , X::m1() X::m2():
void g()
{
1.m1();
1.m2();
}
// : X(1).m1()
// : X(1).m2()
- 167 -
.
++
f1() ($$4.6.3), -
const. f2() f3() :
void h()
{
f1(1);
f2(1);
f3(1);
}
// : f1(X(1))
// : f2(X(1));
// : f3(X(1));
, ,
- const. ,
(=, *, ++ ..),
.
, ,
,
const . ,
, (+, -, || ..).
, - - . ,
, . ,
m inv(m), m.inv(). , inv()
m, , m, , inv() .
- -.
. , - .
, .
- , ,
- . , -
.
, - this.
, , ,
.
7.13
, .
, ,
. , ,
+ , .
.
, , int,
.

. ,
, , ,
, , .
7.14
1.
(*2) string. + += ,
" ".
?
2.
(*1.5) ().
3.
(*3) string ,
. ,
, .
4.
(*2) string ,
, .. string ,
.
5.
(*3) string ,
. ,
, . ,
.
- 168 -
.
++
6. (*4) string, :
, (..
) .
7.
(*2) ?
struct X {
int i;
X(int);
operator+(int);
};
struct Y {
int i;
Y(X);
operator+(X);
operator int();
};
extern X operator*(X,Y);
extern int f(X);
X x = 1;
Y y = x;
int i = 2;
int main()
{
i + 10;
x + y + i;
f(y);
}
y + 10;
x * X +i;
y + y;
y + 10 * y;
f(7);
106 + y;
X Y . ,
.
8.
(*2) INT, int. :

INT::operator int().
9.
(*1) RINT, int, ,

: + ( ), - ( ), *, / %.
: RINT::operator int().
10. (*3) LINT, RINT,

64 .
11. (*4) , . :
, string.
12. (*2) ,
. : INT + -, ;
int INT. , , ,
.
13. (*3) [12] . ,
, . , , .
14. (*2) complex ($$7.3), tiny ($$7.3.2) string ($$7.11),
. -. .
, .
5.3.
15. (*2) vec4 .
operator[]. : +, -, *,
/, =, +=, -=, *= /=.
16. (*3) mat4 vec4.
operator[], vec4. .
mat4 , .
17. (*2) vector, vec4,
vector::vector(int).
18. (*3) matrix, mat4,
- 169 -
.
matrix::matrix(int,int).
++
19. (*3) CheckedPtrToT $$7.10 .

, , , : *, ->, =, ++ --.
,
.
20. (*1.5) $$7.7 ,
.
- 170 -
++
8.

-
.
,
, , . ,
() ,
, , sort ().
.
,
sort().
, .
8.1
, .. ,
- . , , -
. 5 7 ,
, . , $$5.3.2 .
,
,
. , ,
-.
(.. )
. Vector $$1.4.3.
stack ()
.
. ,
. .
8.2
, ,
. ,
:
template<class T>
class stack {
T* v;
T* p;
int sz;
public:
stack(int s) { v = p = new T[sz=s]; }
~stack() { delete[] v; }
void push(T a) { *p++ = a; }
T pop() { return *--p; }
int size() const { return p-v; }
};
. ,
.
template<class T> , T,
, . ,
T , .
T , template<class T>. ,
T , . , sc T
char.
, , <>,
( ), . ,
sc stack<char>:
stack<char> sc(100);
//
, stack<char>
:
- 171 -
.
class stack_char {
char* v;
char* p;
int sz;
public:
stack_char(int s) { v = p = new char[sz=s]; }
~stack_char() { delete[] v; }
void push(char a) { *p++ = a; }
char pop() { return *--p; }
int size() const { return p-v; }
};
++
, - , ,
, ++. , , , ,
. , , "" .
, .
, , , stack_char, ,
stack<T>. ,
, int shape*, ,
.
stack,
:
stack<shape*> ssp(200);
stack<Point> sp(400);
void f(stack<complex>& sc)
{
sc.push(complex(1,2));
complex z = 2.5*sc.pop();
stack<int>*p = 0;
p = new stack<int>(800);
for ( int i = 0; i<400; i++) {
p->push(i);
sp.push(Point(i,i+400));
}
// ...
//
//
//
//

Point
`
complex'
//
//
//
}
- stack ,
.
, stack
:
template<class T> class stack {
T* v;
T* p;
int sz;
public:
stack(int);
~stack();
void push(T);
T pop();
int size() const;
};
- stack - ,
- , .
, ,
. , :
template<class T> void stack<T>::push(T a)
{
*p++ = a;
}
- 172 -
.
template<class T> stack<T>::stack(int s)
{
v = p = new T[sz=s];
}
++
, stack<T> <T> ,
stack<T>::stack - .
, ,
.
stack<shape*>, stack<Point>
stack<int>, stack<shape*> stack<Point>, push() stack<complex>,
stack<int> stack<Point> pop() stack<complex>.
-, :
void stack<complex>::push(complex a) { *p++ = a; }
- . ,
- ,
- . -
, .
, .
,
. ,
. ,
, ,
, . , ,
, .
8.3
, ,
,
. ,
($$12.2). ,
.
8.3.1
, ,
.
, .
, . ,
.
slink, :
struct slink {
slink* next;
slink() { next = 0; }
slink(slink* p) { next = p; }
};
, , slink, :
class slist_base {
// ...
public:
int insert(slink*);
int append(slink*);
slink* get();
// ...
};
//
//
//
,
, slink, slist_base.
slist_base ( ) ,
. ,
, .
, ,
- 173 -
.
.
++
slist_base :
void f()
{
slist_base slb;
slb.insert(new slink);
// ...
slink* p = slb.get();
// ...
delete p;
}
slink ,
. slist_base, , slink,
. , name (),
:
class name : public slink {
// ...
};
void f(const char* s)
{
slist_base slb;
slb.insert(new name(s));
// ...
name* p = (name*)slb.get();
// ...
delete p;
}
, slist_base slink,
slink*,
slist_base::get(), name*. . ,
slink , .
slist_base:
template<class T>
class Islist : private slist_base {
public:
void insert(T* a) { slist_base::insert(a); }
T* get() { return (T*) slist_base::get(); }
// ...
};
Islist::get() , Islist ,
T T . ,
slist_base Islist. ,
.
Islist (intrusive singly linked list) .
:
void f(const char* s)
{
Islist<name> ilst;
ilst.insert(new name(s));
// ...
name* p = ilst.get();
// ...
delete p
}
:
class expr : public slink {
// ...
};
void g(expr* e)
{
- 174 -
.
Islist<name> ilst;
ilst.insert(e);
}
++
// : Islist<name>::insert(),
// name*
// ...
. -,
( ,
, Islist). -,
, Islist . -,
slist_base (
), , , ..
slist_base, .
. ,
,
. ,
. , ,
,
.
, Islist , slink.
Islist int, -
, slink. , ,
Islist ($$6.5.1).
8.3.2
""
. ,
, .
, , :
template<class T>
struct Tlink : public slink {
T info;
Tlink(const T& a) : info(a) { }
};
Tlink<T> T , slink.
, info(a), info=a.
,
($$7.11). (, String)
Tlink(const T& a) { info = a; }
, String, .
, , Islist,
:
template<class T>
class Slist : private slist_base {
public:
void insert(const T& a)
{ slist_base::insert(new Tlink<T>(a)); }
void append(const T& a)
{ slist_base::append(new Tlink<T>(a)); }
T get();
// ...
};
template<class T>
T Slist<T>::get()
{
Tlink<T>* lnk = (Tlink<T>*) slist_base::get();
T i = lnk->info;
delete lnk;
return i;
}
Slist , Ilist. , Slist
, slink, :
- 175 -
.
void f(int i)
{
Slist<int> lst1;
Slist<int> lst2;
lst1.insert(i);
lst2.insert(i);
// ...
int i1 = lst1.get();
int i2 = lst2.get();
// ...
}
++
, , Islist,
. ,
Slist Tlink, Slist
Tlink, T.
, . -, Tlink
(. $
$5.5.6).
. -, , "" ,
, ,
:
void f(name* p)
{
Islist<name> lst1;
Slist<name*> lst2;
lst1.insert(p);
lst2.insert(p);
//
//
//
//
`*p'
`p'

...
}
, ,
. ,
.
Slist insert(), Slist
, , .
, ,
. f() lst2.
, Slist::insert() ,
insert(), , , ( ) :
class smiley : public circle {
/* ... */ };
void g1(Slist<circle>& olist, const smiley& grin)
{
olist.insert(grin);
// !
}
circle smiley. ,
, . ,
, ""
:
void g2(Slist<shape>& olist, const circle& c)
{
olist.insert(c);
// :
//
}
"" :
void g3(Slist<shape*>& plist, const smiley& grin)
{
olist.insert(&grin);
//
}
- :
void g4(Slist<shape&>& rlist, const smiley& grin)
{
- 176 -
.
rlist.insert(grin);
++
// : ,
// (shape&&)
, , .

Slist::insert(T&);

Slist::insert(shape&&);
, .
, :
template<class T>
class Splist : private
public:
void insert(T* p)
void append(T* p)
T* get() { return
};
Slist<void*> {
{ Slist<void*>::insert(p); }
{ Slist<void*>::append(p); }
(T*) Slist<void*>::get(); }
class Isplist : private slist_base {

public:
void insert(T* p) { slist_base::insert(p); }
void append(T* p) { slist_base::append(p); }
T* get() { return (T*) slist_base::get(); }
};

.
, , , .
, , , :
typedef Slist< Slist<date> > dates;
.
> , , >>
typedef Slist<Slist<date>> dates;
. , typedef
, . typedef
, .
, , ,
. ,
T T, :
template<class T> class mytemplate {
T ob;
Slist<T> slst;
// ...
};
:
template<class T, class Slist<t> > class mytemplate {
T obj;
Slist<T> slst;
// ...
};
$$8.6 $$R.14.2 , .
8.3.3
slist_base . . ,
get() .
slist_handler(). ,
, 9.
slist_base:
- 177 -
.
++
class slist_base {
slink* last; // last->next
public:
void insert(slink* a);
//
void append(slink* a);
//
slink* get();
//
//
void clear() { last = 0; }
slist_base() { last = 0; }
slist_base(slink* a) { last = a->next = a; }
friend class slist_base_iter;
};
insert append,
:
void slist_base_insert(slink* a)
{
if (last)
a->next = last->next;
else
last = a;
last->next = a;
}
//
, last->next - .
void slist_base::append(slink* a) //
{
if (last) {
a->next = last->next;
last = last->next = a;
}
else
last = a->next = a;
}
slist* slist_base::get() //
{
if (last == 0)
slist_handler(" ");
slink* f = last->next;
if (f== last)
last = 0;
else
last->next = f->next;
return f;
}
, slist_handler - , .
slist_handler(" ");

(*slist_handler)(" ");
new_handler ($$3.2.6), ,
:
typedef void (*PFV)(const char*);
PFV set_slist_handler(PFV a)
{
PFV old = slist_handler;
slist_handler = a;
return old;
}
PFV slist_handler = &default_slist_handler;
, 9,
, slist_handler.
- 178 -
++
8.3.4
slist_base , . ,
slist_base_iter,
. , , $$7.8:
class slist_base_iter {
slink* ce;
//
slist_base* cs;
//
public:
inline slist_base_iter(slist_base& s);
inline slink* operator()()
};
slist_base_iter::slist_base_iter(slist_base& s)
{
cs = &s;
ce = cs->last;
}
slink* slist_base_iter::operator()()
// 0,
{
slink* ret = ce ? (ce=ce->next) : 0;
if (ce == cs->last) ce = 0;
return ret;
}
, Slist Islist.
:
template<class T> class Islist_iter;
template<class T> class Islist {
friend class Islist_iter<T>;
// ...
};
template<class T> class Slist_iter;
template<class T> class Slist {
friend class Slist_iter<T>;
// ...
};
, .
.
:
template<class T>
class Islist_iter : private slist_base_iter {
public:
Islist_iter(Islist<T>& s) : slist_base_iter(s) { }
T* operator()()
{ return (T*) slist_base_iter::operator()(); }
};
template<class T>
class Slist_iter : private slist_base_iter {
public:
Slist_iter(Slist<T>& s) : slist_base_iter(s) { }
inline T* operator()();
};
T* Slist_iter::operator()()
{
return ((Tlink<T>*) slist_base_iter::operator()())->info;
}
, ,
( , ). ,
.

- 179 -
.
. :
++
void f(name* p)
{
Islist<name> lst1;
Slist<name> lst2;
lst1.insert(p);
lst2.insert(p);
// ...
Islist_iter<name> iter1(lst1);
const name* p;
while (p=iter1()) {
list_iter<name> iter2(lst1);
const name* q;
while (q=iter2()) {
if (p == q) cout << "" << *p << '\n';
}
}
}
.
.
. operator()() next().
,
,
. ,
, . ,
" " "
".
, ,
,
. ,
. :
class slist_base {
// ...
slink* last; // last->next
slink* current; //
public:
// ...
slink* head() { return last?last->next:0; }
slink* current() { return current; }
void set_current(slink* p) { current = p; }
slink* first() { set_current(head()); return current; }
slink* next();
slink* prev();
};
,
, ,
:
void f(Islist<name>& ilst)
// -
{
list_iter<name> slow(ilst); //
name* p;
while (p = slow()) {
ilst.set_current(p); //
name* q;
while (q = ilst.next())
if (strcmp(p->string,q->string) == 0)
cout << "" << p << '\n';
}
}
$$8.8.
- 180 -
++
8.4
-. ,
, .. ,
. ,
. ,
sort().
.
, ,
. sort() ,
.
, . ,
, , , .
8.4.1
sort():
template<class T> void sort(Vector<T>&);
void f(Vector<int>& vi,
Vector<String>& vc,
Vector<int>& vi2,
Vector<char*>& vs)
{
sort(vi);
// sort(Vector<int>& v);
sort(vc);
// sort(Vector<String>& v);
sort(vi2);
// sort(Vector<int>& v);
sort(vs);
// sort(Vector<char*>& v);
}
sort() .
,
. ,
:
template<class T> void sort(Vector<T>& v)
/*

*/
{
unsigned n = v.size();
for (int j=n-1; i<j; j--)
if (v[j] < v[j-1]) { // v[j] v[j-1]
T temp = v[j];
v[j] = v[j-1];
v[j-1] = temp;
}
}
$$4.6.9.
, v.
( ,
, . ,
sizeof.
, . . <
, , char*, ,
. (, ,
). sort() (
) , , .
char*

sort(Vector<char*>&):
void sort(Vector<char*>& v)
{
- 181 -
.
for ( int j=n-1; i<j; j--)
if (strcmp(v[j],v[j-1])<0) {
// v[j] v[j-1]
char* temp = v[j];
v[j] = v[j-1];
v[j-1] = temp;
}
}
++
sort(),
, Vector<char*>&
. ""

.
8.4.2
"" sort() (
<). , Vector. ,
, .
sort() ,
<:
template<class T> void sort(SortableVector<T>& v)
{
if (v.lessthan(v[j],v[j-1])) {
// v[j] v[j-1]
T temp = v[j];
v[j] = v[j-1];
v[j-1] = temp;
}
}
SortableVector ( ) :
template<class T> class SortableVector
: public Vector<T>, public Comparator<T> {
public:
SortableVector(int s) : Vector<T>(s) { }
};
Comparator ():
template<class T> class Comparator {
public:
inline static lessthan(T& a, T& b)
{ return strcmp(a,b)<0; }
// ...
};
// ""
, < char*,
:
class Comparator<char*> {
public:
inline static lessthan(const char* a, const char* b)
// ""
{ return strcmp(a,b)<0; }
// ...
};
char* ,
.
, .
.
, , , ,
.
Comparator char*,
SortableVector char* , , , :
- 182 -
.
void f(SortableVector<int>& vi,
SortableVector<String>& vc,
SortableVector<int>& vi2,
SortableVector<char*>& vs)
{
sort(vi);
sort(vc);
sort(vi2);
sort(vs);
}
++
, , , SortableVector
Vector. ,
SortableVector, , ,
. Vector Comparator SortableVector ( ,
, Vector) , Comparator
. .
Comparator ,
.
8.4.3
Vector,
sort(). , :
template<class T> void sort(Vector<T>& v, Comparator<T>& cmp)
{
for (int i = 0; i<n-1; i++)
for ( int j = n-1; i<j; j--)
if (cmp.lessthan(v[j],v[j-1])) {
// v[j] v[j-1]
T temp = v[j];
v[j] = v[j-1];
v[j-1] = temp;
}
}
,
. :
Vector<String>& vc,
Vector<int>& vi2,
Vector<char*>& vs)
{
Comparator<int> ci;
Comparator<char*> cs;
Comparator<String> cc;
sort(vi,ci);
// sort(Vector<int>&);
sort(vc,cc);
// sort(Vector<String>&);
sort(vi2,ci); // sort(Vector<int>&);
sort(vs,cs);
// sort(Vector<char*>&);
}
, Comparator , lessthan
. , ,
, , ,
.
8.4.4
Comparator
. "" , .
, . ,
( ), ..
, , :
template<class T> void sort(Vector<T>& v)
{
- 183 -
.
if (Comparator<T>::lessthan(v[j],v[j-1])) {
// v[j] v[j-1]
T temp = v[j];
v[j] = v[j-1];
v[j-1] = temp;
}
}
++
sort():
Vector<String>& vc,
Vector<int>& vi2,
Vector<char*>& vs)
{
sort(vi);
// sort(Vector<int>&);
sort(vc);
// sort(Vector<String>&);
sort(vi2); // sort(Vector<int>&);
sort(vs);
// sort(Vector<char*>&);
}
, ,
, , , ,
, , , lessthan.
, .
, (
) . , sort()
, ,
char*, $
$8.4.1. Comparator char*
.
8.4.5
, sort()
Comparator .
. , "" sort(),
,
(. 3 $$8.9). sort() ,
Comparator:
template<class T, class Comp> class Sort {
public:
static void sort(Vector<T>&);
};
, , typedef Comparator:
template<class T> class Comparator {
public:
typedef T T; // Comparator<T>::T
static int lessthan(T& a, T& b) {
return a < b;
}
// ...
};
:
class Comparator<char*> {
public:
typedef char* T;
static int lessthan(T a, T b) {
return strcmp(a,b) < 0;
}
// ...
};
, , Sort:
template<class T, class Comp> class Sort {
- 184 -
.
public:
static void sort(Vector<T>&);
};
++
:
Vector<String>& vc,
Vector<int>& vi2,
Vector<char*>& vs)
{
Sort< int,Comparator<int> >::sort(vi);
Sort< String,Comparator<String> >:sort(vc);
Sort< int,Comparator<int> >::sort(vi2);
Sort< char*,Comparator<char*> >::sort(vs);
}
sort() :
template<class T, class Comp>
void Sort<T,Comp>::sort(Vector&l

Язык

Язык программирования C++ (Страуструп)

Загружено:

Сведения о документе

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Язык программирования C++ (Страуструп)

Загружено:

Авторское право:

Доступные форматы

.

stack_id create_stack ( int size ); //

1.3 " "

cout << "enter length: ";

>> (" ") ; cin .

T T& " T". ,

$ CC main.c f.c -o silly

cs.pop () -> takeoff ();

// int* p; int y; int* y;

, p,- c1, , c1, 'a'.

v[0][0]=a v[0][1]=b v[0][2]=c v[0][3]=d v[0][4]=e

// 'a' '\xfa' 'h' '\12' '9'

, entry string_value int_value

(*1) "Hello, world" (. $$1.3.1).

if (ii < 0) ii = -ii;

: " i , max i". ,

, *p++ = *q++ *q. ,

, char, short, int, long .

(*1) for while:

(*2) : strlen() - , strcpy() - strcmp() . ?

struct point { int x, y; };

char get() { return *p++; }

double prim() { /* ... */ }

__cplusplus , extern "C" { ...},

(*1.5) , , "Hello, world". (name)

(*2) sort() ($$4.6.9), .

(*2) tnode $$R.9.3. ,

(*1) itoa(), $$4.6.8.

sz) { top=s=new char[size=sz]; }

f(), char_stack, 100

X::M1 X::f(X::M2 a) // , X::

(, char* char[8] int char ..), ,

table : t1 t3. t2,

(*1) intset ($$5.3.2) .

(*1) intset tnode. tnode .

, employee emp manager.

void print() const;

class manager : public employee {

circle(point p, int r);

put_point(int a, int b);

, satellite task displayed:

class displayed : public link {

employee::operator delete(void* p, size_t s)

expr::clone() expr ( expr

operator new(), new,

(*2) triangle () circle ().

(*2) shape , line rectangle,

(*1) , shape $$6.4, ,

(*1.5) , satellite $$6.5, ,

(*2) , window $$6.5.3,

[] $$7.7, () $$7.8, -> $$7.9, ++ -- $$7.10.

assoc pair max. free

const MAX = 256; //

operator[]() . , x[y] == y[x]

const MAX = 256;

-> " ", .. ,

(*2) INT, int. :

(*1) RINT, int, ,

10. (*3) LINT, RINT,

19. (*3) CheckedPtrToT $$7.10 .

class Isplist : private slist_base {

, p++ = q++ *q. ,