Tech-invite3GPPspaceIETFspace
96959493929190898887868584838281807978777675747372717069686766656463626160595857565554535251504948474645444342414039383736353433323130292827262524232221201918171615141312111009080706050403020100
in Index   Prev   Next

RFC 0154

Exposition Style

Pages: 1
Unclassified
Obsoletes:  0132
Updates:  0107

ToP   noToC   RFC0154 - Page 1
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 ]