HP 3000 Manuals HP 3000 Manuals
Crunched Sets
Table 5-6 shows how the HP Pascal packing algorithm allocates and
aligns a crunched set when it is the element of an array or the field of
a record.
Table 5-6. Allocation and Alignment of Crunched Sets in Arrays and Records
(HP Pascal Packing Algorithm)
------------------------------------------------------------------------------------------
| | | |
| Structure Containing Set | Allocation | Alignment |
| | | |
------------------------------------------------------------------------------------------
| | | |
| Unpacked array | * Minimum # | Byte |
| | | |
------------------------------------------------------------------------------------------
| | | |
| Unpacked record | * Minimum # | Byte |
| | | |
------------------------------------------------------------------------------------------
| | | |
| Packed array | * Minimum # | Byte |
| | | |
------------------------------------------------------------------------------------------
| | | |
| Packed record | * Minimum # | Bit |
| | | |
------------------------------------------------------------------------------------------
* Minimum number of bits required to represent every member of the set.