Memory layout of a data structure: Difference between revisions
Content added Content deleted
Thundergnat (talk | contribs) (Rename Perl 6 -> Raku, alphabetize, minor clean-up) |
SqrtNegInf (talk | contribs) m (→{{header|Raku}}: Fix comment: Perl 6 --> Raku) |
||
| Line 844: | Line 844: | ||
In the absence of shaped arrays, you can do the usual bit-twiddling tricks on a native integer of sufficient size. (Such an integer could presumably be mapped directly to a device register.) |
In the absence of shaped arrays, you can do the usual bit-twiddling tricks on a native integer of sufficient size. (Such an integer could presumably be mapped directly to a device register.) |
||
<lang perl6>$signal +|= 1 +< signal_ground;</lang> |
<lang perl6>$signal +|= 1 +< signal_ground;</lang> |
||
Using a native int is likelier to work on a big-endian machine in any case. Another almost-there solution is the mapping of C representational types into |
Using a native int is likelier to work on a big-endian machine in any case. Another almost-there solution is the mapping of C representational types into Raku for native interfaces, but it does not yet support bit fields. |
||
=={{header|REXX}}== |
=={{header|REXX}}== |
||