blob: 3198216ff625026930a69f10af4fd6e4ea3392c2 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
|
Network Working Group S. Crocker
Request for Comments: #154 UCLA
NIC: #6759 12 May 1971
Categories: C.4
Updates: #107
Obsoletes: #132
Exposition Style
As a pedagogical device for describing functions such as the one
below
|
| +-----------------
| /:
| / :
| / :
| / :
| / :
| / :
-----+------------------------------------
| a
|
where two formulae, f1 and f2, are necessary for adjoining domains but
the function is continous at the boundary point, I usually write the
description in the form
f(x) = f1(x) for x =< a
f(x) = f2(x) for x >= a
The astute reader will note that the domains overlap, but that
f1(a) = f2(a), so no semantic ambiguity obtains.
[ This RFC was put into machine readable form for entry ]
[ into the online RFC archives by Naoki Matsuhira 5/97 ]
Crocker [Page 1]
^L
|
