github.com/Interlisp.medley
1
0
Fork 0
mirror of synced 2026-01-12 00:42:56 +00:00
Code Issues Projects Releases Wiki Activity
Interlisp.medley/library/HASHFILE.TEDIT
Larry Masinter 08852f7b55
Add TEDIT files for many Library packages (#1181) 
* WHERE-IS library doc

* Gather keyboard files, add VIRTUAL.TEDIT

* add UNIXCOMM.TEDIT

* rest of TEdit library files

* save table of contents index for reworking

* Don't move around VIRTUALKEYBOARDS files; will move in separate commit

* Add MATMULT from Envos/Medley
2023-07-07 11:25:17 -07:00

181 lines
27 KiB
Plaintext
Raw Permalink Blame History

This file contains invisible Unicode characters

This file contains invisible Unicode characters that are indistinguishable to humans but may be processed differently by a computer. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

1
Lisp Library Modules, Medley Release 1.0, HASH-FILE
1
Lisp Library Modules, Medley Release 1.0, HASH-FILE
HASH-FILE
1
HASH-FILE
1
HASH-FILE
6
Hash-File(HASH-FILE NIL Hash-File NIL NIL 133) is similar to but not compatible with the library module, Hash. Hash-File is modeled after the Common Lisp hash table facility, and Hash was modeled after the Interlisp hash array facility.
Hash files, like hash tables, are objects which efficiently map from a given Lisp object, called the key, to another Lisp object, called the value. Hash tables store this mapping in memory, while hash files store the mapping in a specially formatted file. Hash files are generally slower to access than hash tables, but they do not absorb memory and they are persistent over Lisp images. Hash files are recommended for large databases which do not change very often.
Since hash files are not stored in memory, hashing for EQ or EQL keys does not make sense. Memory references written to file in one session will probably not be valid in another. For this reason, the default hashing is for EQUAL keys, and then only those which can be dependably printed and read.
All of the code for Hash-File is in a package called Hash-File. Througout this document Lisp symbols are printed as though in a package which uses the packages Hash-File and Lisp.
Requirements
1
Hash files must reside on a random-access device (not a TCP/IP file server).
Installation
1
Load HASH-FILE.DFASL from the Library.
Functions
1
Hash-File has functions to create a new hash file, to open and close existing hash files, and to store and retrieve data in hash files.
Creating a Hash File
(make-hash-file(MAKE-HASH-FILE (Function) make-hash-file NIL NIL 133) file-name size &key . keys) [Function]
Creates and returns a new hash file in file-name opened for input and output. Size indicates the table size and should be an integer somewhat larger than the maximum number of keys under which you expect to store values in this hash file. (The hash file grows as required, so this number need not be accurate. See the section , "Rehashing," below.) The keyword arguments are explained as this document progresses.
Opening and Closing Hash Files
(open-hash-file (OPEN-HASH-FILE (Function) open-hash-file NIL NIL 133) file-name &key :direction . other-keys ) [Function]
Opens an existing hash file and returns it. The :direction argument must be one of :input or :io. If opened for :in put then storing values in the hash file is disallowed. The default for :direction is :input. Other key arguments are the same as for make-hash-file and are explained as this document progresses.
(close-hash-file (CLOSE-HASH-FILE (Function) close-hash-file NIL NIL 134) hash-file) [Function]
Closes the file for hash-file, ensuring that all data has been saved. The backing file is always kept coherent; thus t<><74>he only reason to close the <20>hash-file is to ensure that the backing file is properly written to disk. All the functions mentioned in this document which operate on hash files open the file when necessary; thus it is safe to call close-hash-file at almost any time.
Storing and Retrieving Data
(get-hash-file key hash-file &optional default) [Function]
Retrieves the value stored under key in hash-file. Returns default if there is nothing stored under key. The default for default is nil. Also returns a second value which is true if something was found under key and false otherwise.
(get-hash-file key hash-file) [Setf place]
Values can be stores in a hash file with:
(setf (get-hash-file key hash-file) new-value)
Accordingly, incf, decf, push, pop and any other macro that accepts generalized variables work with get-hash-file.
(map-hash-file function hash-file) [Function]
For each entry in hash-file, function is called with the key and value stored.
Note: It is unsafe to change a hash file while mapping over it. The integrity of the file may be lost.
(rem-hash-file key hash-file) [Function]
Removes any entry for key in hash-file. Returns t if there was such an entry, nil otherwise.
Other Functions
(copy-hash-file hash-file file-name &optional new-size) [Function]
Makes and returns a hash file in file-name with the same contents as hash-file. Much slower than il:copyfile, but performs garbage collection, often resulting in a smaller file.
(hash-file-count hash-file) [Function]
Returns the number of entries in hash-file.
(hash-file-p object) [Function]
Returns t if object is a hash file, nil otherwise.
(hash-file-p object)<29><> <20>r<EFBFBD>(typep object 'hash-file)
File Format
1
Hash-File uses a linked bucket implementation as illustrated in Figure 3.
((SKETCH %{DSK%}<FILES>HASH-FILE.SKETCH;1 VERSION 3 PRIRANGE (113 . 0) SKETCHCONTEXT ((ROUND 1 BLACK) (MODERN 10 (MEDIUM REGULAR REGULAR)) (LEFT BASELINE) (CURVE 18.0 8) NIL NIL (CENTER CENTER) (NIL NIL NIL) T NIL POINTS 1 NIL)) ((0.025 72.0 (PRI 5)) (TEXTBOX (72.0 655.0 144.0 25.0) ("size") 1 (CENTER CENTER) (MODERN 18 (MEDIUM REGULAR REGULAR)) ((128.5 658.0 31 19)) BLACK (ROUND 2 BLACK) NIL (NIL NIL NIL))) ((0.07 19.6 (PRI 8)) (TEXT (56.0 . 640.0) ("1") 1.4 (RIGHT BASELINE) (TERMINAL 12 (MEDIUM REGULAR REGULAR)) ((46.2 634.2 9.8 19.6)) BLACK)) ((0.025 72.0 (PRI 11)) (TEXTBOX (72.0 632.0 144.0 25.0) ("count") 1 (CENTER CENTER) (MODERN 18 (MEDIUM REGULAR REGULAR)) ((120.0 635.0 48 19)) BLACK (ROUND 2 BLACK) NIL (NIL NIL NIL))) ((0.025 72.0 (PRI 13)) (TEXTBOX (72.0 568.0 144.0 25.0) ("pointer-1") 1 (CENTER CENTER) (MODERN 18 (MEDIUM REGULAR REGULAR)) ((105.0 571.0 78 19)) BLACK (ROUND 2 BLACK) NIL (NIL NIL NIL))) ((0.05 19.0 (PRI 15)) (TEXT (60.0 . 576.0) ("hash-fn(key-1, size)+2" "hash-fn(key-2, size)+2") 1 (RIGHT BASELINE) (MODERN 18 (MEDIUM REGULAR REGULAR)) ((-128.0 580.0 188 19) (-128.0 561.0 188 19)) BLACK)) ((0.025 72.0 (PRI 18)) (TEXTBOX (72.0 216.0 144.0 25.0) ("pointer-3") 1 (CENTER CENTER) (MODERN 18 (MEDIUM REGULAR REGULAR)) ((105.0 219.0 78 19)) BLACK (ROUND 2 BLACK) NIL (NIL NIL NIL))) ((0.05 19.0 (PRI 20)) (TEXT (60.0 . 392.0) ("size+2") 1 (RIGHT BASELINE) (MODERN 18 (MEDIUM REGULAR REGULAR)) ((1.0 386.5 59 19)) BLACK)) ((0.0 48.0 (PRI 24)) (WIRE ((264 . 624) (272 . 624) (272 . 528)) (ROUND 2 BLACK) NIL NIL 1 (262 526 12 100) NIL)) ((0.0 48.0 (PRI 24)) (WIRE ((264.0 . 383.99994) (272.0 . 383.99994) (272.0 . 479.99994)) (ROUND 2 BLACK) NIL NIL 1 (262.0 381.99994 12.0 100.0) NIL)) ((0.05 19.0 (PRI 25)) (TEXT (272.0 . 504.0) ("Table") 1 (CENTER BASELINE) (MODERN 18 (BOLD REGULAR REGULAR)) ((249.0 498.5 46 19)) BLACK)) ((0.05 19.0 (PRI 30)) (TEXT (56.0 . 664.0) ("0") 1 (RIGHT BASELINE) (MODERN 18 (MEDIUM REGULAR REGULAR)) ((46.0 658.5 10 19)) BLACK)) ((0.05 15.0 (PRI 31)) (TEXT (56.0 . 688.0) ("file position in pointers") 1 (RIGHT BASELINE) (MODERN 14 (BOLD REGULAR REGULAR)) ((-100 683.5 156 15)) BLACK)) ((0.025 72.0 (PRI 49)) (TEXTBOX (72.0 440.0 144.0 25.0) ("pointer-2") 1 (CENTER CENTER) (MODERN 18 (MEDIUM REGULAR REGULAR)) ((105.0 443.0 78 19)) BLACK (ROUND 2 BLACK) NIL (NIL NIL NIL))) ((0.05 19.0 (PRI 53)) (TEXT (60.0 . 228.0) ("pointer-1") 1 (RIGHT BASELINE) (MODERN 18 (MEDIUM REGULAR REGULAR)) ((-18.0 222.5 78 19)) BLACK)) ((0.05 15.0 (PRI 57)) (TEXT (56.0 . 352.0) ("file position in bytes") 1 (RIGHT BASELINE) (MODERN 14 (BOLD REGULAR REGULAR)) ((-81 347.5 137 15)) BLACK)) ((0.05 19.0 (PRI 58)) (TEXT (60.0 . 328.0) ("pointer-2") 1 (RIGHT BASELINE) (MODERN 18 (MEDIUM REGULAR REGULAR)) ((-18.0 322.5 78 19)) BLACK)) ((0.05 19.0 (PRI 59)) (TEXT (60.0 . 448.0) ("hash-fn(key-3, size)+2") 1 (RIGHT BASELINE) (MODERN 18 (MEDIUM REGULAR REGULAR)) ((-128.0 442.5 188 19)) BLACK)) ((0.07 19.6 (PRI 61)) (TEXT (72.0 . 304.0) ("key-1") 1.4 (LEFT BASELINE) (TERMINAL 12 (MEDIUM REGULAR REGULAR)) ((71.4 298.19998 49.0 19.6)) BLACK)) ((0.07 19.6 (PRI 65)) (TEXT (72.0 . 284.0) ("value-1") 1.4 (LEFT BASELINE) (TERMINAL 12 (MEDIUM REGULAR REGULAR)) ((71.4 278.6 68.6 19.6)) BLACK)) ((0.07 19.6 (PRI 66)) (TEXT (72.0 . 200.0) ("key-3") 1.4 (LEFT BASELINE) (TERMINAL 12 (MEDIUM REGULAR REGULAR)) ((71.4 194.59999 49.0 19.6)) BLACK)) ((0.07 19.6 (PRI 67)) (TEXT (72.0 . 180.0) ("value-3") 1.4 (LEFT BASELINE) (TERMINAL 12 (MEDIUM REGULAR REGULAR)) ((71.4 175.0 68.6 19.6)) BLACK)) ((0.07 19.6 (PRI 71)) (TEXT (72.0 . 112.0) ("key-2") 1.4 (LEFT BASELINE) (TERMINAL 12 (MEDIUM REGULAR REGULAR)) ((71.4 106.4 49.0 19.6)) BLACK)) ((0.07 19.6 (PRI 72)) (TEXT (72.0 . 92.0) ("value-2") 1.4 (LEFT BASELINE) (TERMINAL 12 (MEDIUM REGULAR REGULAR)) ((71.4 86.799995 68.6 19.6)) BLACK)) ((0.05 19.0 (PRI 73)) (TEXT (60.0 . 140.0) ("pointer-3") 1 (RIGHT BASELINE) (MODERN 18 (MEDIUM REGULAR REGULAR)) ((-18.0 134.5 78 19)) BLACK)) ((0.05 19.0 (PRI 74)) (TEXT (320.0 . 664.0) ("The size of the table") 1 (LEFT BASELINE) (MODERN 18 (MEDIUM REGULAR REGULAR)) ((320.0 658.5 167 19)) BLACK)) ((0.05 19.0 (PRI 75)) (TEXT (320.0 . 640.0) ("The number of entries in the file") 1 (LEFT BASELINE) (MODERN 18 (MEDIUM REGULAR REGULAR)) ((320.0 634.5 266 19)) BLACK)) ((0.05 19.0 (PRI 76)) (TEXT (320 . 584) ("A collision leading to a
" "bucket of length two") 1 (LEFT BASELINE) (MODERN 18 (MEDIUM REGULAR REGULAR)) ((320 588.0 188 19) (320 569.0 179 19)) BLACK)) ((0.05 19.0 (PRI 78)) (TEXT (320 . 520) ("An empty bucket") 1 (LEFT BASELINE) (MODERN 18 (MEDIUM REGULAR REGULAR)) ((320 514.5 141 19)) BLACK)) ((0.0 54.0 (PRI 81)) (OPENCURVE ((216.0 . 447.99997) (224.0 . 428.09756) (224.0 . 355.2195) (216.0 . 339.99997)) (ROUND 2 BLACK) NIL (NIL (SOLID 18.0 11.076687)) 1 (213.0 316.99997 15.2 155.2) (NIL ((216.0 . 339.99997) (227.06137 . 339.41757) (224.6065 . 333.0271))))) ((0.0 36.0 (PRI 81)) (OPENCURVE ((216.0 . 220.0) (224.0 . 207.31706) (224.0 . 161.65854) (216.0 . 148.0)) (ROUND 2 BLACK) NIL (NIL (SOLID 18.0 8.669468)) 1 (213.0 132.0 15.2 104.799995) (NIL ((216.0 . 148.0) (223.10548 . 152.96707) (224.66803 . 147.84195))))) ((0.0 170.0 (PRI 81)) (OPENCURVE ((216 . 576) (232 . 512) (232 . 292) (216 . 236)) (ROUND 2 BLACK) NIL (NIL (SOLID 18.0 10)) 1 (211 166 26.4 480.0) (NIL ((216 . 236) (225.16692 . 239.99597) (225.76495 . 233.84464))))) ((0.05 19.0 (PRI 82)) (TEXT (320.0 . 448.0) ("A bucket of length one") 1 (LEFT BASELINE) (MODERN 18 (MEDIUM REGULAR REGULAR)) ((320.0 442.5 191 19)) BLACK)) ((0.0 64.0 (PRI 89)) (WIRE ((264.0 . 87.99994) (272.0 . 87.99994) (272.0 . 215.99994)) (ROUND 2 BLACK) NIL NIL 1 (262.0 85.99994 12.0 132.0) NIL)) ((0.0 56.0 (PRI 90)) (WIRE ((264.0 . 376.0) (272.0 . 376.0) (272.0 . 264.0)) (ROUND 2 BLACK) NIL NIL 1 (262.0 262.0 12.0 116.0) NIL)) ((0.05 19.0 (PRI 91)) (TEXT (272.0 . 240.0) ("Data") 1 (CENTER BASELINE) (MODERN 18 (BOLD REGULAR REGULAR)) ((252.0 234.5 40 19)) BLACK)) ((0.0 4.0 (PRI 93)) (WIRE ((264 . 680) (272 . 680) (272 . 672)) (ROUND 2 BLACK) NIL NIL 1 (262 670 12 12) NIL)) ((0.0 4.0 (PRI 94)) (WIRE ((264 . 632) (272 . 632) (272 . 640)) (ROUND 2 BLACK) NIL NIL 1 (262 630 12 12) NIL)) ((0.05 19.0 (PRI 95)) (TEXT (272.0 . 652.0) ("Header") 1 (CENTER BASELINE) (MODERN 18 (BOLD REGULAR REGULAR)) ((241.5 646.5 61 19)) BLACK)) ((0.028825851 74.249344 (PRI 106)) (GROUP (70 501.17413 148.49869 28.825851) (((0.0259314 72.51187 (PRI 103)) (BOX (72.474945 502.17413 145.02374 25.931398) (ROUND 2 BLACK) NIL 1 (NIL NIL NIL))) ((0.0 72.0 (PRI 105)) (WIRE ((72 . 504) (216 . 528)) (ROUND 2 BLACK) NIL NIL 1 NIL NIL))) (144 . 520))) ((0.028825851 74.249344 (PRI 107)) (GROUP (70 133.17415 148.49869 28.825851) (((0.0259314 72.51187 (PRI 103)) (BOX (72.474945 134.17415 145.02374 25.931398) (ROUND 2 BLACK) NIL 1 (NIL NIL NIL))) ((0.0 72.0 (PRI 105)) (WIRE ((72 . 136) (216 . 160)) (ROUND 2 BLACK) NIL NIL 1 NIL NIL))) (144 . 152))) ((0.028825851 74.249344 (PRI 108)) (GROUP (70 317.17413 148.49869 28.825851) (((0.0259314 72.51187 (PRI 103)) (BOX (72.474945 318.17413 145.02374 25.931398) (ROUND 2 BLACK) NIL 1 (NIL NIL NIL))) ((0.0 72.0 (PRI 105)) (WIRE ((72 . 320) (216 . 344)) (ROUND 2 BLACK) NIL NIL 1 NIL NIL))) (144 . 336))) ((0.05 13.0 (PRI 111)) (TEXT (432 . 576) ("") 1 (CENTER BASELINE) (MODERN 10 (MEDIUM REGULAR REGULAR)) ((432.0 572.5 0 13)) BLACK)) ((0.05 13.0 (PRI 112)) (TEXT (400 . 512) ("") 1 (CENTER BASELINE) (MODERN 10 (MEDIUM REGULAR REGULAR)) ((400.0 508.5 0 13)) BLACK)) ((0.05 13.0 (PRI 113)) (TEXT (408 . 416) ("") 1 (CENTER BASELINE) (MODERN 10 (MEDIUM REGULAR REGULAR)) ((408.0 412.5 0 13)) BLACK)))
(-93.79124 82.536285 630.2771 619.02216)
1.8758247
8
Figure 3. Hash File Format
Pointers are 32-bit integers written as four 8-bit bytes. There are two pointers of header (holding the size and count) followed by size pointers of table. Except for in the header and null pointers, all pointers are file-positions in bytes. Every such pointer points to the position on the file of the next pointer in the bucket. Immediately following the next pointer on the file are the printed representation of the key and value for the entry. New entries, including ones for old keys, are always added at the end of the file.
Rehashing
1
When the number of keys with values in the file reaches a threshold, rehashing is performed to keep bucket lengths from getting too long. This threshold is expressed as a fraction of the table size.
rehash-threshold [Keyword argument]
Should be floating point number between zero and one. When the product of the table size and the rehash threshold of a hash file is greater than its hash-file-count then the hash file is automatically rehashed. The default for this keyword argument is the value of the special variable hash-file::*rehash-threshold* whose global binding is by default 0.875.
Rehashing is accomplished by having copy-hash-file make a new hash file with a larger size in a new version of the file. The new hash file structure is then smashed into the old one so that pointers to the old one are still valid.
rehash-size [Keyword argument]
Should be floating point number larger than one. The next prime larger than the product of this and the old table size is used to as the size for the new table. The default for this keyword argument is the value of the special variable hash-file::*rehash-size* whose global binding is by default 2.0.
hash-file::*delete-old-version-on-rehash* [Special variable]
If true, when rehashing generates a new version of the backing file the old version is automatically deleted. The default top-level value for this variable is nil.
Rehashing is very expensive. Thus, when possible, you should attempt to make good estimates for the size argument to make-hash-file.
Programmer's Interface
1
There may be applications in which you want to store things in hash files but which could not be printed and read by the functions print and read. The following hooks are provided for this purpose.
value-read-fn [Keyword argument]
Called by get-hash-file with one argument of <20><>a<> stream to read a value. The file position is set to the same position as it was when this value was written. Default is hash-file::default-read-fn which binds *package* to the XCL package and *readtable* to the XCL readtable before calling read.
value-print-fn [Keyword argument]
Called by the setf method for get-hash-file with the object to be stored and the stream to print it on. The file position of the stream will be at the end of the file and there are no limitations as to how much can be printed. Default is hash-file::default-print-fn which binds *package* to the XCL package, *readtable* to the XCL readtable and *print-base* to 10 before calling print.
Example: A hash file with circular values.
(defun print-circular-object (object stream)
(let ((*print-circle* t))
(hash-file::default-print-fn object stream)))
(setq hash-file-with-circular-values
(make-hash-file "{core}foo" 10
:value-print-fn #'print-circular-object))
(setq l (list "foo"))
(setf (cdr l) l) <20><><00>O<EFBFBD> #1= ("foo" . #1#)
(setf (get-hash-file "bar" hash-file-with-circular-values) l)
(get-hash-file "bar" hash-file-with-circular-values)<29><>
<20>O <20> #1= ("foo" . #1#)
(eq * l) <20><><00>O<EFBFBD> nil
key-read-fn [Keyword argument]
Called by get-hash-file with one argument of <20><>a<> stream to read a key. The file postion is set to the same position as it was when this key was written. Default is hash-file::default-read-fn, described above.
key-print-fn [Keyword argument]
Called by the setf method for get-hash-file with the object to be stored and the stream to print it on. The file position of the stream is at the end of the file and there are no limitations as to how much can be printed. Default is hash-file::default-print-fn, described above.
Note: The value reader is called immediately after the key reader. Thus, the key reader must be sure to read all that the key printer printed so that the file position is appropriate for the value reader. However, the value reader is free to not read all that the value printer printed.
You might now think that you could make a hash file whose keys were circular by simply specifying our circular reader and printer for the key print and read functions, but this would not be sufficient. You also need the following hooks:
key-compare-fn [Keyword argument]
Called when searching a bucket to determine whether the correct key/value pair has been reached yet. Default is equal.
key-hash-fn [Keyword argument]
Called with a key and a range. Should return an integer between zero and range-1 with the following property:
key-hash-fn(x) = key-hash-fn(y) iff key-compare-fn(x,y)
The default key-hash-fn is hash-file::hash-object which works on symbols, strings, lists, bit-vectors, pathnames, characters and numbers. (Any object whose printed representation can be dependably read in as an object equal to the original.)
Note: This function will work on circular lists, as it only proceeds a fixed depth down a structure. Thus to hash on circular keys you also need to provide a key comparer which is able to compare circular keys, as most defintions of equal are not.
Performance
1
A linked bucket implementation generally gives shorter bucket lengths, but uses more file space. The effects of this upon performance are difficult to judge.
The following table shows the distribution of bucket lengths in a Where-Is hash file containing 27,157 entries with a table size of 50,021.
length number of buckets this length
0 29,279 (empty buckets)
1 15,461
2 4334
3 794
4 125
5 23
6 4
7 1
This information was gathered by the function hash-file::histogram.
[This page intentionally left blank](LIST ((PAGE NIL (PAPERSIZE LETTER FOLIOINFO (ARABIC "" "") STARTINGPAGE# 133) (0 0 612 792) ((FOLIO NIL (PARALOOKS (QUAD RIGHT) CHARLOOKS (SUPERSCRIPT 0 INVISIBLE OFF SELECTPOINT OFF PROTECTED OFF SIZE 10 FAMILY HELVETICA OVERLINE OFF STRIKEOUT OFF UNDERLINE OFF EXPANSION REGULAR SLOPE REGULAR WEIGHT MEDIUM INVERTED OFF USERINFO NIL STYLE NIL) FORMATINFO (ARABIC "" "")) (270 15 288 36) NIL) (HEADING NIL (HEADINGTYPE FOOTINGR) (54 27 558 36) NIL) (TEXT NIL NIL (54 54 504 702) NIL))) (PAGE NIL (PAPERSIZE LETTER FOLIOINFO (ARABIC "" "")) (0 0 612 792) ((FOLIO NIL (PARALOOKS (QUAD LEFT) CHARLOOKS (SUPERSCRIPT 0 INVISIBLE OFF SELECTPOINT OFF PROTECTED OFF SIZE 10 FAMILY HELVETICA OVERLINE OFF STRIKEOUT OFF UNDERLINE OFF EXPANSION REGULAR SLOPE REGULAR WEIGHT MEDIUM INVERTED OFF USERINFO NIL STYLE NIL) FORMATINFO (ARABIC "" "")) (54 15 288 36) NIL) (HEADING NIL (HEADINGTYPE FOOTINGV) (54 27 558 36) NIL) (HEADING NIL (HEADINGTYPE VERSOHEAD) (54 762 558 36) NIL) (TEXT NIL NIL (54 54 504 684) NIL))) (PAGE NIL (PAPERSIZE LETTER FOLIOINFO (ARABIC "" "")) (0 0 612 792) ((FOLIO NIL (PARALOOKS (QUAD RIGHT) CHARLOOKS (SUPERSCRIPT 0 INVISIBLE OFF SELECTPOINT OFF PROTECTED OFF SIZE 10 FAMILY HELVETICA OVERLINE OFF STRIKEOUT OFF UNDERLINE OFF EXPANSION REGULAR SLOPE REGULAR WEIGHT MEDIUM INVERTED OFF USERINFO NIL STYLE NIL) FORMATINFO (ARABIC "" "")) (270 15 288 36) NIL) (HEADING NIL (HEADINGTYPE FOOTINGR) (54 27 558 36) NIL) (HEADING NIL (HEADINGTYPE RECTOHEAD) (54 762 558 36) NIL) (TEXT NIL NIL (54 54 504 684) NIL)))))-<00><00><01>
T2<00><00><01><01>,HH<01>
,HH<01> 2<01><00>2<00><00><01> <01>,<00><00><01>
2HH<01><01>2HH<01>
<01>3<01><01>T2l<00><01><00>,l<00><01>,ll<01>2H`<01>
<01>,$$<01>3<01><01>T,HH<01>
,HH<01>,HH<01>,<00><00><01> -<01>T3<01><01>T-<01><00><01>T200<01>F<01><01> PAGEHEADING VERSOHEADF<01><01> PAGEHEADING RECTOHEADE<01><01> PAGEHEADINGFOOTINGVE<01><01> PAGEHEADINGFOOTINGR HELVETICA
CLASSIC
CLASSIC
 HELVETICA TITAN
CLASSIC HELVETICA HELVETICACLASSIC
CLASSIC
TERMINAL
MODERN
MODERN
MODERN MODERNMODERNMODERN
 HRULE.GETFNMODERN
5 HRULE.GETFNMODERN
4
 HRULE.GETFNMODERN

 HRULE.GETFNMODERN

 HRULE.GETFNMODERN
%IM.INDEX.GETFN<00>
e
 %
 D
+
<00>

 HRULE.GETFNMODERNM

 HRULE.GETFNMODERN


 HRULE.GETFNMODERN<00>
6IM.INDEX.GETFNMODERN
 
 

'

 O

6IM.INDEX.GETFNMODERN
 & 


1



J

i

8IM.INDEX.GETFN



Z
;
<00>
 

!
 
 "
 
 
(

 




*
    

 



B

  


 *
 h




 


& 

!


F
 

!

  



 


       HRULE.GETFNMODERNL
 <20> SKIO.GETFN.2MODERN
<00>
 <01>
 
 HRULE.GETFNMODERN<00>
 

<00>
y
*

$
<00>
 

<00>
(
 *

<00>


e



 HRULE.GETFNMODERN<00>

5
 



~


%
  

<00>




,
~<00>'
>4 
 
 



y





<00>

 $

<00>
 

q

 

o

:

<00>
 <00>
 
 HRULE.GETFNMODERN <00>
<00>


(J
.

$
J<><01>z<EFBFBD>
Reference in New Issue View Git Blame Copy Permalink