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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
|
<!doctype html public "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html>
<!--
Generated from r6rs-lib.tex by tex2page, v 20070803
(running on MzScheme 371, unix),
(c) Dorai Sitaram,
http://www.ccs.neu.edu/~dorai/tex2page/tex2page-doc.html
-->
<head>
<title>
r6rs-lib
</title>
<link rel="stylesheet" type="text/css" href="r6rs-lib-Z-S.css" title=default>
<meta name=robots content="index,follow">
</head>
<body>
<div id=slidecontent>
<div align=right class=navigation>[Go to <span><a href="r6rs-lib.html">first</a>, <a href="r6rs-lib-Z-H-2.html">previous</a></span><span>, <a href="r6rs-lib-Z-H-4.html">next</a></span> page<span>; </span><span><a href="r6rs-lib-Z-H-1.html#node_toc_start">contents</a></span><span><span>; </span><a href="r6rs-lib-Z-H-21.html#node_index_start">index</a></span>]</div>
<p></p>
<a name="node_chap_2"></a>
<h1 class=chapter>
<div class=chapterheading><a href="r6rs-lib-Z-H-1.html#node_toc_node_chap_2">Chapter 2</a></div><br>
<a href="r6rs-lib-Z-H-1.html#node_toc_node_chap_2">Bytevectors</a></h1>
<p></p>
<p>
Many applications deal with blocks of binary data by accessing
them in various ways—extracting signed or unsigned numbers of
various sizes. Therefore, the <tt>(rnrs bytevectors (6))</tt><a name="node_idx_62"></a>library
provides a single type for
blocks of binary data with multiple ways to access that data. It deals
with integers and floating-point representations
in various sizes with specified endianness.</p>
<p>
Bytevectors<a name="node_idx_64"></a>are objects of a disjoint
type. Conceptually, a bytevector represents a sequence of 8-bit
bytes. The description of bytevectors uses the term <a name="node_idx_66"></a><em>byte</em>
for an exact integer object in the interval { <tt>-</tt> 128, <tt>...</tt>, 127} and the
term <a name="node_idx_68"></a><em>octet</em> for an exact integer object in the interval {0,
<tt>...</tt>, 255}. A byte corresponds to its two’s complement
representation as an octet.</p>
<p>
The length of a bytevector is the number of bytes it contains. This
number is fixed. A valid index into a bytevector is an exact,
non-negative integer object less than the length of the bytevector.
The first byte of a bytevector has index 0;
the last byte has an index one less than the length of the bytevector.</p>
<p>
Generally, the access procedures come in different flavors according
to the size of the represented integer and the endianness of the
representation. The procedures also distinguish signed and unsigned
representations.
The signed representations all use two’s complement.</p>
<p>
Like string literals, literals representing bytevectors do not need to
be quoted:
</p>
<tt>#vu8(12 23 123) ⇒ #vu8(12 23 123)<p></tt></p>
<p>
</p>
<a name="node_sec_2.1"></a>
<h2 class=section><a href="r6rs-lib-Z-H-1.html#node_toc_node_sec_2.1">2.1 Endianness</a></h2>
<p>Many operations described in this chapter accept an
<a name="node_idx_70"></a><em>endianness</em> argument. Endianness describes the encoding of
exact integer objects as several contiguous bytes in a bytevector [<a href="r6rs-lib-Z-H-21.html#node_bib_4">4</a>].
For this purpose, the binary representation of the integer object is split into
consecutive bytes. <a name="node_idx_72"></a>The little-endian
encoding places the least significant byte of an integer first, with
the other bytes following in increasing order of significance.
<a name="node_idx_74"></a>The big-endian encoding places the most
significant byte of an integer first, with the other bytes following
in decreasing order of significance. </p>
<p>
This terminology also applies to IEEE-754 numbers: IEEE 754 describes
how to represent a floating-point number as an exact integer object, and
endianness describes how the bytes of such an integer are laid out in
a bytevector.</p>
<p>
</p>
<blockquote><em>Note: </em>
Little- and big-endianness are only the most common kinds of
endianness. Some architectures distinguish between the endianness
at different levels of a binary representation.
</blockquote><p>
</p>
<a name="node_sec_2.2"></a>
<h2 class=section><a href="r6rs-lib-Z-H-1.html#node_toc_node_sec_2.2">2.2 General operations</a></h2>
<p></p>
<p></p>
<div align=left><tt>(<a name="node_idx_76"></a>endianness<i> <endianness symbol></i>)</tt> syntax </div>
<p>
The name of <endianness symbol> must be a symbol describing an
endianness. An implementation must support at least the symbols
<tt>big</tt> and <tt>little</tt>, but may support other endianness
symbols. <tt>(endianness <endianness symbol>)</tt> evaluates to
the symbol named <endianness symbol>. Whenever one of the
procedures operating on bytevectors accepts an endianness as an
argument, that argument must be one of these symbols. It is a syntax
violation for <endianness symbol> to be anything other than an
endianness symbol supported by the implementation.</p>
<p>
</p>
<blockquote><em>Note: </em>
Implementors should use widely accepted designations
for endianness symbols other than <tt>big</tt> and <tt>little</tt>.
</blockquote><p>
</p>
<blockquote><em>Note: </em>
Only the name of <endianness symbol> is significant.
</blockquote>
<p></p>
<p>
</p>
<p></p>
<div align=left><tt>(<a name="node_idx_78"></a>native-endianness<i></i>)</tt> procedure </div>
<p>
Returns the endianness symbol associated implementation’s preferred
endianness (usually that of the underlying machine architecture).
This may be any <endianness symbol>, including a symbol other
than <tt>big</tt> and <tt>little</tt>.
</p>
<p> </p>
<p>
</p>
<p></p>
<div align=left><tt>(<a name="node_idx_80"></a>bytevector?<i> obj</i>)</tt> procedure </div>
<p>
Returns <tt>#t</tt> if <i>obj</i> is a bytevector,
otherwise returns <tt>#f</tt>.
</p>
<p></p>
<p>
</p>
<p></p>
<div align=left><tt>(<a name="node_idx_82"></a>make-bytevector<i> k</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_84"></a>make-bytevector<i> k fill</i>)</tt> procedure </div>
<p>
Returns a newly allocated bytevector of <i>k</i> bytes.</p>
<p>
If the <i>fill</i> argument is missing, the initial contents of the
returned bytevector are unspecified.</p>
<p>
If the <i>fill</i> argument is present, it must be an exact integer
object in
the interval { <tt>-</tt> 128, <tt>...</tt> 255} that specifies the initial value
for the bytes of the bytevector: If <i>fill</i> is positive, it is
interpreted as an octet; if it is negative, it is interpreted as a byte.
</p>
<p> </p>
<p>
</p>
<p></p>
<div align=left><tt>(<a name="node_idx_86"></a>bytevector-length<i> bytevector</i>)</tt> procedure </div>
<p>
Returns, as an exact integer object, the number of bytes in <i>bytevector</i>.
</p>
<p></p>
<p>
</p>
<p></p>
<div align=left><tt>(<a name="node_idx_88"></a>bytevector=?<i> <i>bytevector<sub>1</sub></i> <i>bytevector<sub>2</sub></i></i>)</tt> procedure </div>
<p>
Returns <tt>#t</tt> if <i>bytevector<sub>1</sub></i> and <i>bytevector<sub>2</sub></i> are equal—that
is, if they have the same length and equal bytes at all valid indices.
It returns <tt>#f</tt> otherwise.
</p>
<p></p>
<p>
</p>
<p></p>
<div align=left><tt>(<a name="node_idx_90"></a>bytevector-fill!<i> bytevector fill</i>)</tt>
</div>
The <i>fill</i> argument is as in the description of the <tt>make-bytevector</tt> procedure.
The <tt>bytevector-fill!</tt> procedure stores <i>fill</i> in every element of <i>bytevector</i>
and returns unspecified values. Analogous to <tt>vector-fill!</tt>.
<p></p>
<p>
</p>
<p></p>
<div align=left><tt>(bytevector-copy! <i>source</i> <i>source-start</i></tt> procedure </div>
<a name="node_idx_92"></a><tt><br>
<i>target</i> <i>target-start</i> <i>k</i>)</tt><p>
<i>Source</i> and <i>target</i> must be bytevectors.
<i>Source-start</i>, <i>target-start</i>,
and <i>k</i> must be non-negative exact integer objects that satisfy</p>
<p>
</p>
<div align=left><img src="r6rs-lib-Z-G-1.gif" border="0" alt="[r6rs-lib-Z-G-1.gif]"></div><p>
where <em>l</em><sub><i>source</i></sub> is the length of <i>source</i> and
<em>l</em><sub><i>target</i></sub> is the length of <i>target</i>.</p>
<p>
The <tt>bytevector-copy!</tt> procedure copies the bytes from <i>source</i> at indices
</p>
<div align=left><img src="r6rs-lib-Z-G-2.gif" border="0" alt="[r6rs-lib-Z-G-2.gif]"></div><p>
to consecutive indices in <i>target</i> starting at <i>target-index</i>.</p>
<p>
This must work even if the memory regions for the source and the target
overlap, i.e., the bytes at the target location after the copy must be
equal to the bytes at the source location before the copy.</p>
<p>
This returns unspecified values.
</p>
<tt>(let ((b (u8-list->bytevector ’(1 2 3 4 5 6 7 8))))<br>
(bytevector-copy! b 0 b 3 4)<br>
(bytevector->u8-list b)) ⇒ (1 2 3 1 2 3 4 8)<p></tt>
</p>
<p></p>
<p>
</p>
<p></p>
<div align=left><tt>(<a name="node_idx_94"></a>bytevector-copy<i> bytevector</i>)</tt> procedure </div>
<p>
Returns a newly allocated copy of <i>bytevector</i>.
</p>
<p></p>
<p>
</p>
<a name="node_sec_2.3"></a>
<h2 class=section><a href="r6rs-lib-Z-H-1.html#node_toc_node_sec_2.3">2.3 Operations on bytes and octets</a></h2>
<p></p>
<p></p>
<div align=left><tt>(<a name="node_idx_96"></a>bytevector-u8-ref<i> bytevector k</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_98"></a>bytevector-s8-ref<i> bytevector k</i>)</tt> procedure </div>
<p>
<i>K</i> must be a valid index of <i>bytevector</i>.</p>
<p>
The <tt>bytevector-u8-ref</tt> procedure returns the byte at index <i>k</i> of <i>bytevector</i>,
as an octet.</p>
<p>
The <tt>bytevector-s8-ref</tt> procedure returns the byte at index <i>k</i> of <i>bytevector</i>,
as a (signed) byte.</p>
<p>
</p>
<tt>(let ((b1 (make-bytevector 16 -127))<br>
(b2 (make-bytevector 16 255)))<br>
(list<br>
(bytevector-s8-ref b1 0)<br>
(bytevector-u8-ref b1 0)<br>
(bytevector-s8-ref b2 0)<br>
(bytevector-u8-ref b2 0))) <br> ⇒ (-127 129 -1 255)<p></tt>
</p>
<p> </p>
<p>
</p>
<p></p>
<div align=left><tt>(<a name="node_idx_100"></a>bytevector-u8-set!<i> bytevector k octet</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_102"></a>bytevector-s8-set!<i> bytevector k byte</i>)</tt> procedure </div>
<p>
<i>K</i> must be a valid index of <i>bytevector</i>.</p>
<p>
The <tt>bytevector-u8-set!</tt> procedure stores <i>octet</i> in element <i>k</i> of
<i>bytevector</i>.</p>
<p>
The <tt>bytevector-s8-set!</tt> procedure stores the two’s-complement representation of
<i>byte</i> in element <i>k</i> of <i>bytevector</i>.</p>
<p>
Both procedures return unspecified values.</p>
<p>
</p>
<tt>(let ((b (make-bytevector 16 -127)))<br>
<br>
(bytevector-s8-set! b 0 -126)<br>
(bytevector-u8-set! b 1 246)<br>
<br>
(list<br>
(bytevector-s8-ref b 0)<br>
(bytevector-u8-ref b 0)<br>
(bytevector-s8-ref b 1)<br>
(bytevector-u8-ref b 1))) <br> ⇒ (-126 130 -10 246)<p></tt>
</p>
<p></p>
<p>
</p>
<p></p>
<div align=left><tt>(<a name="node_idx_104"></a>bytevector->u8-list<i> bytevector</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_106"></a>u8-list->bytevector<i> list</i>)</tt> procedure </div>
<p>
<i>List</i> must be a list of octets.</p>
<p>
The <tt>bytevector->u8-list</tt> procedure returns a newly allocated list of the octets of
<i>bytevector</i> in the same order.</p>
<p>
The <tt>u8-list->bytevector</tt> procedure returns a newly allocated bytevector whose
elements are the elements of list <i>list</i>, in
the same order. It is analogous to <tt>list->vector</tt>.
</p>
<p></p>
<p>
</p>
<a name="node_sec_2.4"></a>
<h2 class=section><a href="r6rs-lib-Z-H-1.html#node_toc_node_sec_2.4">2.4 Operations on integers of arbitrary size</a></h2>
<p></p>
<p></p>
<div align=left><tt>(<a name="node_idx_108"></a>bytevector-uint-ref<i> bytevector k endianness size</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_110"></a>bytevector-sint-ref<i> bytevector k endianness size</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_112"></a>bytevector-uint-set!<i> bytevector k n endianness size</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_114"></a>bytevector-sint-set!<i> bytevector k n endianness size</i>)</tt> procedure </div>
<p>
<i>Size</i> must be a positive exact integer object. <i>K</i>, <tt>...</tt>,
<i>k</i> + <i>size</i> <tt>-</tt> 1 must be valid indices of <i>bytevector</i>.</p>
<p>
The <tt>bytevector-uint-ref</tt> procedure retrieves the exact integer object corresponding to the
unsigned representation of size <i>size</i> and specified by <i>endianness</i>
at indices <i>k</i>, <tt>...</tt>, <i>k</i> + <i>size</i> <tt>-</tt> 1.</p>
<p>
The <tt>bytevector-sint-ref</tt> procedure retrieves the exact integer object corresponding to the two’s-complement representation of size <i>size</i> and specified by <i>endianness</i> at
indices <i>k</i>, <tt>...</tt>, <i>k</i> + <i>size</i> <tt>-</tt> 1.</p>
<p>
For <tt>bytevector-uint-set!</tt>, <i>n</i> must be an exact
integer object in the interval {0, <tt>...</tt>, 256<sup>mathit<em>s</em><em>i</em><em>z</em><em>e</em></sup> <tt>-</tt> 1}.</p>
<p>
The <tt>bytevector-uint-set!</tt> procedure stores the unsigned representation of size <i>size</i>
and specified by <i>endianness</i> into <i>bytevector</i> at indices
<i>k</i>, <tt>...</tt>, <i>k</i> + <i>size</i> <tt>-</tt> 1.</p>
<p>
For <tt>bytevector-sint-set!</tt>, <i>n</i> must be an exact
integer object in
the interval { <tt>-</tt> 256<sup>mathit<em>s</em><em>i</em><em>z</em><em>e</em></sup>/2, <tt>...</tt>,
256<sup>mathit<em>s</em><em>i</em><em>z</em><em>e</em></sup>/2 <tt>-</tt> 1}.
<tt>bytevector-sint-set!</tt> stores the two’s-complement
representation of size <i>size</i> and specified by <i>endianness</i>
into <i>bytevector</i> at indices <i>k</i>, <tt>...</tt>, <i>k</i> + <i>size</i> <tt>-</tt> 1.</p>
<p>
The <tt>...</tt><tt>-set!</tt> procedures return unspecified values.</p>
<p>
</p>
<tt>(define b (make-bytevector 16 -127))<br>
<br>
(bytevector-uint-set! b 0 (- (expt 2 128) 3)<br>
(endianness little) 16)<br>
<br>
(bytevector-uint-ref b 0 (endianness little) 16)<br> ⇒<br>
#xfffffffffffffffffffffffffffffffd<br>
<br>
(bytevector-sint-ref b 0 (endianness little) 16)<br> ⇒ -3<br>
<br>
(bytevector->u8-list b)<br> ⇒ (253 255 255 255 255 255 255 255<br>
255 255 255 255 255 255 255 255)<br>
<br>
(bytevector-uint-set! b 0 (- (expt 2 128) 3)<br>
(endianness big) 16)<br>
(bytevector-uint-ref b 0 (endianness big) 16) <br> ⇒<br>
#xfffffffffffffffffffffffffffffffd<br>
<br>
(bytevector-sint-ref b 0 (endianness big) 16) <br> ⇒ -3<br>
<br>
(bytevector->u8-list b) <br> ⇒ (255 255 255 255 255 255 255 255<br>
255 255 255 255 255 255 255 253))<p></tt>
</p>
<p></p>
<p>
</p>
<p></p>
<div align=left><tt>(<a name="node_idx_116"></a>bytevector->uint-list<i> bytevector endianness size</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_118"></a>bytevector->sint-list<i> bytevector endianness size</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_120"></a>uint-list->bytevector<i> list endianness size</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_122"></a>sint-list->bytevector<i> list endianness size</i>)</tt> procedure </div>
<p>
<i>Size</i> must be a positive exact integer object. For <tt>uint-list->bytevector</tt>, <i>list</i> must be a list of exact
integer objects in the interval {0, <tt>...</tt>, 256<sup>mathit<em>s</em><em>i</em><em>z</em><em>e</em></sup> <tt>-</tt> 1}. For
<tt>sint-list->bytevector</tt>, <i>list</i> must be a list of exact
integer objects in the interval { <tt>-</tt> 256<sup>mathit<em>s</em><em>i</em><em>z</em><em>e</em></sup>/2, <tt>...</tt>,
256<sup>mathit<em>s</em><em>i</em><em>z</em><em>e</em></sup>/2 <tt>-</tt> 1}. The length of <i>bytevector</i> or,
respectively, of <i>list</i> must be divisible by <i>size</i>.</p>
<p>
These procedures convert between lists of integer objects and their consecutive
representations according to <i>size</i> and <i>endianness</i> in the
<i>bytevector</i> objects in the same way as <tt>bytevector->u8-list</tt> and <tt>u8-list->bytevector</tt> do for one-byte representations.</p>
<p>
</p>
<tt>(let ((b (u8-list->bytevector ’(1 2 3 255 1 2 1 2))))<br>
(bytevector->sint-list b (endianness little) 2)) <br> ⇒ (513 -253 513 513)<br>
<br>
(let ((b (u8-list->bytevector ’(1 2 3 255 1 2 1 2))))<br>
(bytevector->uint-list b (endianness little) 2)) <br> ⇒ (513 65283 513 513)<p></tt>
</p>
<p></p>
<p>
</p>
<a name="node_sec_2.5"></a>
<h2 class=section><a href="r6rs-lib-Z-H-1.html#node_toc_node_sec_2.5">2.5 Operations on 16-bit integers</a></h2>
<p></p>
<p></p>
<div align=left><tt>(<a name="node_idx_124"></a>bytevector-u16-ref<i> bytevector k endianness</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_126"></a>bytevector-s16-ref<i> bytevector k endianness</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_128"></a>bytevector-u16-native-ref<i> bytevector k</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_130"></a>bytevector-s16-native-ref<i> bytevector k</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_132"></a>bytevector-u16-set!<i> bytevector k n endianness</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_134"></a>bytevector-s16-set!<i> bytevector k n endianness</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_136"></a>bytevector-u16-native-set!<i> bytevector k n</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_138"></a>bytevector-s16-native-set!<i> bytevector k n</i>)</tt> procedure </div>
<p>
<i>K</i> must be a valid index of <i>bytevector</i>; so must
<i>k</i> + 1. For <tt>bytevector-u16-set!</tt> and <tt>bytevector-u16-native-set!</tt>, <i>n</i> must be an exact integer object in
the interval {0, <tt>...</tt>, 2<sup>16</sup> <tt>-</tt> 1}. For <tt>bytevector-s16-set!</tt>
and <tt>bytevector-s16-native-set!</tt>, <i>n</i> must be an exact
integer object in the interval { <tt>-</tt> 2<sup>15</sup>, <tt>...</tt>, 2<sup>15</sup> <tt>-</tt> 1}.</p>
<p>
These retrieve and set two-byte representations of numbers at indices
<i>k</i> and <i>k</i> + 1, according to the endianness specified by
<i>endianness</i>. The procedures with <tt>u16</tt> in their names deal with the
unsigned representation; those with <tt>s16</tt> in their names deal
with the two’s-complement representation.</p>
<p>
The procedures with <tt>native</tt> in their names employ the native
endianness, and work only at aligned indices:
<i>k</i> must be a multiple of 2.</p>
<p>
The <tt>...</tt><tt>-set!</tt> procedures return unspecified values.</p>
<p>
</p>
<tt>(define b<br>
(u8-list->bytevector<br>
’(255 255 255 255 255 255 255 255<br>
255 255 255 255 255 255 255 253)))<br>
<br>
(bytevector-u16-ref b 14 (endianness little)) <br> ⇒ 65023<br>
(bytevector-s16-ref b 14 (endianness little)) <br> ⇒ -513<br>
(bytevector-u16-ref b 14 (endianness big)) <br> ⇒ 65533<br>
(bytevector-s16-ref b 14 (endianness big)) <br> ⇒ -3<br>
<br>
(bytevector-u16-set! b 0 12345 (endianness little))<br>
(bytevector-u16-ref b 0 (endianness little)) <br> ⇒ 12345<br>
<br>
(bytevector-u16-native-set! b 0 12345)<br>
(bytevector-u16-native-ref b 0) ⇒ 12345<br>
<br>
(bytevector-u16-ref b 0 (endianness little)) <br> ⇒ <i>unspecified</i><p></tt>
</p>
<p></p>
<p>
</p>
<a name="node_sec_2.6"></a>
<h2 class=section><a href="r6rs-lib-Z-H-1.html#node_toc_node_sec_2.6">2.6 Operations on 32-bit integers</a></h2>
<p></p>
<p></p>
<div align=left><tt>(<a name="node_idx_140"></a>bytevector-u32-ref<i> bytevector k endianness</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_142"></a>bytevector-s32-ref<i> bytevector k endianness</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_144"></a>bytevector-u32-native-ref<i> bytevector k</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_146"></a>bytevector-s32-native-ref<i> bytevector k</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_148"></a>bytevector-u32-set!<i> bytevector k n endianness</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_150"></a>bytevector-s32-set!<i> bytevector k n endianness</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_152"></a>bytevector-u32-native-set!<i> bytevector k n</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_154"></a>bytevector-s32-native-set!<i> bytevector k n</i>)</tt> procedure </div>
<p>
<i>K</i>, <tt>...</tt>, <i>k</i> + 3 must be valid indices of
<i>bytevector</i>.
For <tt>bytevector-u32-set!</tt> and <tt>bytevector-u32-native-set!</tt>, <i>n</i> must be an exact integer
object in
the interval {0, <tt>...</tt>, 2<sup>32</sup> <tt>-</tt> 1}. For <tt>bytevector-s32-set!</tt>
and <tt>bytevector-s32-native-set!</tt>, <i>n</i> must be an exact
integer object in the interval { <tt>-</tt> 2<sup>31</sup>, <tt>...</tt>, 2<sup>32</sup> <tt>-</tt> 1}.</p>
<p>
These retrieve and set four-byte representations of numbers at indices <i>k</i>,
<tt>...</tt>, <i>k</i> + 3, according to the endianness specified by <i>endianness</i>. The
procedures with <tt>u32</tt> in their names deal with the unsigned representation;
those with <tt>s32</tt> with the two’s-complement representation.</p>
<p>
The procedures with <tt>native</tt> in their names employ the native endianness, and
work only at aligned indices: <i>k</i> must be a multiple of 4.</p>
<p>
The <tt>...</tt><tt>-set!</tt> procedures return unspecified values.</p>
<p>
</p>
<tt>(define b<br>
(u8-list->bytevector<br>
’(255 255 255 255 255 255 255 255<br>
255 255 255 255 255 255 255 253)))<br>
<br>
(bytevector-u32-ref b 12 (endianness little)) <br> ⇒ 4261412863<br>
(bytevector-s32-ref b 12 (endianness little)) <br> ⇒ -33554433<br>
(bytevector-u32-ref b 12 (endianness big)) <br> ⇒ 4294967293<br>
(bytevector-s32-ref b 12 (endianness big)) <br> ⇒ -3<p></tt>
</p>
<p></p>
<p>
</p>
<a name="node_sec_2.7"></a>
<h2 class=section><a href="r6rs-lib-Z-H-1.html#node_toc_node_sec_2.7">2.7 Operations on 64-bit integers</a></h2>
<p></p>
<p></p>
<div align=left><tt>(<a name="node_idx_156"></a>bytevector-u64-ref<i> bytevector k endianness</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_158"></a>bytevector-s64-ref<i> bytevector k endianness</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_160"></a>bytevector-u64-native-ref<i> bytevector k</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_162"></a>bytevector-s64-native-ref<i> bytevector k</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_164"></a>bytevector-u64-set!<i> bytevector k n endianness</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_166"></a>bytevector-s64-set!<i> bytevector k n endianness</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_168"></a>bytevector-u64-native-set!<i> bytevector k n</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_170"></a>bytevector-s64-native-set!<i> bytevector k n</i>)</tt> procedure </div>
<p>
<i>K</i>, <tt>...</tt>, <i>k</i> + 7 must be valid indices of
<i>bytevector</i>.
For <tt>bytevector-u64-set!</tt> and <tt>bytevector-u64-native-set!</tt>, <i>n</i> must be an exact integer
object in
the interval {0, <tt>...</tt>, 2<sup>64</sup> <tt>-</tt> 1}. For <tt>bytevector-s64-set!</tt>
and <tt>bytevector-s64-native-set!</tt>, <i>n</i> must be an exact
integer object in the interval { <tt>-</tt> 2<sup>63</sup>, <tt>...</tt>, 2<sup>64</sup> <tt>-</tt> 1}.</p>
<p>
These retrieve and set eight-byte representations of numbers at
indices <i>k</i>, <tt>...</tt>, <i>k</i> + 7, according to the endianness
specified by <i>endianness</i>. The procedures with <tt>u64</tt> in their names deal
with the unsigned representation; those with <tt>s64</tt> with the
two’s-complement representation.</p>
<p>
The procedures with <tt>native</tt> in their names employ the native endianness, and
work only at aligned indices: <i>k</i> must be a multiple of 8.</p>
<p>
The <tt>...</tt><tt>-set!</tt> procedures return unspecified values.</p>
<p>
</p>
<tt>(define b<br>
(u8-list->bytevector<br>
’(255 255 255 255 255 255 255 255<br>
255 255 255 255 255 255 255 253)))<br>
<br>
(bytevector-u64-ref b 8 (endianness little)) <br> ⇒ 18302628885633695743<br>
(bytevector-s64-ref b 8 (endianness little)) <br> ⇒ -144115188075855873<br>
(bytevector-u64-ref b 8 (endianness big)) <br> ⇒ 18446744073709551613<br>
(bytevector-s64-ref b 8 (endianness big)) <br> ⇒ -3<p></tt>
</p>
<p></p>
<p>
</p>
<a name="node_sec_2.8"></a>
<h2 class=section><a href="r6rs-lib-Z-H-1.html#node_toc_node_sec_2.8">2.8 Operations on IEEE-754 representations</a></h2>
<p></p>
<p></p>
<div align=left><tt>(<a name="node_idx_172"></a>bytevector-ieee-single-native-ref<i> bytevector k</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_174"></a>bytevector-ieee-single-ref<i> bytevector k endianness</i>)</tt> procedure </div>
<p>
<i>K</i>, <tt>...</tt>, <i>k</i> + 3 must be valid indices of
<i>bytevector</i>. For <tt>bytevector-ieee-single-native-ref</tt>, <i>k</i> must
be a multiple of 4.</p>
<p>
These procedures return the inexact real number object that best
represents the IEEE-754 single-precision number represented by the
four bytes beginning at index
<i>k</i>.
</p>
<p></p>
<p>
</p>
<p></p>
<div align=left><tt>(<a name="node_idx_176"></a>bytevector-ieee-double-native-ref<i> bytevector k</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_178"></a>bytevector-ieee-double-ref<i> bytevector k endianness</i>)</tt> procedure </div>
<p>
<i>K</i>, <tt>...</tt>, <i>k</i> + 7 must be valid indices of
<i>bytevector</i>. For <tt>bytevector-ieee-double-native-ref</tt>, <i>k</i> must
be a multiple of 8.</p>
<p>
These procedures return the inexact real number object that best
represents the IEEE-754 double-precision number represented by the
eight bytes beginning at index <i>k</i>.
</p>
<p></p>
<p>
</p>
<p></p>
<div align=left><tt>(<a name="node_idx_180"></a>bytevector-ieee-single-native-set!<i> bytevector k x</i>)</tt> procedure </div>
<div align=left><tt>(bytevector-ieee-single-set! <i>bytevector</i></tt> procedure </div>
<tt><br>
<i>k</i> <i>x</i> <i>endianness</i>)</tt><p>
<i>K</i>, <tt>...</tt>, <i>k</i> + 3 must be valid indices of
<i>bytevector</i>. For <tt>bytevector-ieee-single-native-set!</tt>, <i>k</i> must
be a multiple of 4.</p>
<p>
These procedures store an IEEE-754 single-precision representation of <i>x</i> into
elements <i>k</i> through <i>k</i> + 3 of <i>bytevector</i>, and return
unspecified values.
</p>
<p></p>
<p>
</p>
<p></p>
<div align=left><tt>(<a name="node_idx_182"></a>bytevector-ieee-double-native-set!<i> bytevector k x</i>)</tt> procedure </div>
<div align=left><tt>(bytevector-ieee-double-set! <i>bytevector</i></tt> procedure </div>
<tt><br>
<i>k</i> <i>x</i> <i>endianness</i>)</tt><p>
<i>K</i>, <tt>...</tt>, <i>k</i> + 7 must be valid indices of
<i>bytevector</i>. For <tt>bytevector-ieee-double-native-set!</tt>, <i>k</i> must
be a multiple of 8.</p>
<p>
These procedures store an IEEE-754 double-precision representation of <i>x</i> into
elements <i>k</i> through <i>k</i> + 7 of <i>bytevector</i>, and return
unspecified values.
</p>
<p></p>
<p>
</p>
<a name="node_sec_2.9"></a>
<h2 class=section><a href="r6rs-lib-Z-H-1.html#node_toc_node_sec_2.9">2.9 Operations on strings</a></h2>
<p>This section describes procedures that convert between strings and
bytevectors containing Unicode encodings of those strings. When
decoding bytevectors, encoding errors are handled as with the <tt>replace</tt> semantics of textual I/O (see
section <a href="r6rs-lib-Z-H-9.html#node_sec_8.2.4">8.2.4</a>): If an invalid or incomplete
character encoding is encountered, then the replacement character
U+FFFD is appended to the string being generated, an appropriate
number of bytes are ignored, and decoding continues with the following
bytes.</p>
<p>
</p>
<p></p>
<div align=left><tt>(<a name="node_idx_184"></a>string->utf8<i> string</i>)</tt> procedure </div>
<p>
Returns a newly allocated (unless empty) bytevector that
contains the UTF-8 encoding of the given string.
</p>
<p></p>
<p>
</p>
<p></p>
<div align=left><tt>(<a name="node_idx_186"></a>string->utf16<i> string</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_188"></a>string->utf16<i> string endianness</i>)</tt> procedure </div>
<p>
If <i>endianness</i> is specified, it must be the symbol <tt>big</tt> or the symbol <tt>little</tt>. The <tt>string->utf16</tt>
procedure returns a newly allocated (unless empty) bytevector that
contains the UTF-16BE or UTF-16LE encoding of the given string (with
no byte-order mark). If endianness is not specified or is <tt>big</tt>,
then UTF-16BE is used. If endianness is <tt>little</tt>, then UTF-16LE
is used.
</p>
<p></p>
<p>
</p>
<p></p>
<div align=left><tt>(<a name="node_idx_190"></a>string->utf32<i> string</i>)</tt> procedure </div>
<div align=left><tt>(<a name="node_idx_192"></a>string->utf32<i> string endianness</i>)</tt> procedure </div>
<p>
If <i>endianness</i> is specified, it must be the symbol <tt>big</tt> or the symbol <tt>little</tt>. The <tt>string->utf32</tt>
procedure returns
a newly allocated (unless empty) bytevector that contains the UTF-32BE
or UTF-32LE encoding of the given string (with no byte mark). If
endianness is not specified or is <tt>big</tt>, then UTF-32BE is used.
If endianness is <tt>little</tt>, then UTF-32LE is used.
</p>
<p></p>
<p>
</p>
<p></p>
<div align=left><tt>(<a name="node_idx_194"></a>utf8->string<i> bytevector</i>)</tt> procedure </div>
<p>
Returns a newly allocated (unless empty) string whose character
sequence is encoded by the given bytevector.
</p>
<p></p>
<p>
</p>
<p></p>
<div align=left><tt>(<a name="node_idx_196"></a>utf16->string<i> bytevector endianness</i>)</tt> procedure </div>
<div align=left><tt>(utf16->string <i>bytevector</i></tt> procedure </div>
<tt><br>
<i>endianness</i> <i>endianness-mandatory</i>)</tt><p>
<i>Endianness</i> must be the symbol <tt>big</tt> or
the symbol <tt>little</tt>. The <tt>utf16->string</tt> procedure returns
a newly allocated (unless empty) string whose character sequence is
encoded by the given bytevector. <i>Bytevector</i> is decoded
according to UTF-16BE or UTF-16LE: If <i>endianness-mandatory?</i> is
absent or <tt>#f</tt>, <tt>utf16->string</tt> determines the endianness
according to a UTF-16 BOM at the beginning of <i>bytevector</i> if a
BOM is present; in this case, the BOM is not decoded as a character.
Also in this case, if no UTF-16 BOM is present, <i>endianness</i>
specifies the endianness of the encoding. If
<i>endianness-mandatory?</i> is a true value, <i>endianness</i>
specifies the endianness of the encoding, and any UTF-16 BOM in the
encoding is decoded as a regular character.</p>
<p>
</p>
<blockquote><em>Note: </em>
A UTF-16 BOM is either a sequence of bytes <tt>#</tt>xFE,
<tt>#</tt>xFF specifying <tt>big</tt> and UTF-16BE, or <tt>#</tt>xFF,
<tt>#</tt>xFE specifying <tt>little</tt> and UTF-16LE.
</blockquote>
<p></p>
<p>
</p>
<p></p>
<div align=left><tt>(<a name="node_idx_198"></a>utf32->string<i> bytevector endianness</i>)</tt> procedure </div>
<div align=left><tt>(utf32->string <i>bytevector</i></tt> procedure </div>
<tt><br>
<i>endianness</i> <i>endianness-mandatory</i>)</tt><p>
<i>Endianness</i> must be the symbol <tt>big</tt> or
the symbol <tt>little</tt>. The <tt>utf32->string</tt> procedure returns
a newly allocated (unless empty) string whose character sequence is
encoded by the given bytevector. <i>Bytevector</i> is decoded
according to UTF-32BE or UTF-32LE: If <i>endianness-mandatory?</i> is
absent or <tt>#f</tt>, <tt>utf32->string</tt> determines the endianness
according to a UTF-32 BOM at the beginning of <i>bytevector</i> if a
BOM is present; in this case, the BOM is not decoded as a character.
Also in this case, if no UTF-32 BOM is present, <i>endianness</i>
specifies the endianness of the encoding. If
<i>endianness-mandatory?</i> is a true value, <i>endianness</i>
specifies the endianness of the encoding, and any UTF-32 BOM in the
encoding is decoded as a regular character.</p>
<p>
</p>
<blockquote><em>Note: </em>
A UTF-32 BOM is either a sequence of bytes <tt>#</tt>x00,
<tt>#</tt>x00, <tt>#</tt>xFE, <tt>#</tt>xFF specifying <tt>big</tt> and UTF-32BE, or <tt>#</tt>xFF, <tt>#</tt>xFE,
<tt>#</tt>x00, <tt>#</tt>x00, specifying <tt>little</tt> and
UTF-32LE.
</blockquote>
<p></p>
<p>
</p>
<p></p>
<div class=smallskip></div>
<p style="margin-top: 0pt; margin-bottom: 0pt">
<div align=right class=navigation>[Go to <span><a href="r6rs-lib.html">first</a>, <a href="r6rs-lib-Z-H-2.html">previous</a></span><span>, <a href="r6rs-lib-Z-H-4.html">next</a></span> page<span>; </span><span><a href="r6rs-lib-Z-H-1.html#node_toc_start">contents</a></span><span><span>; </span><a href="r6rs-lib-Z-H-21.html#node_index_start">index</a></span>]</div>
</p>
<p></p>
</div>
</body>
</html>
|
