Index: srfi-4-utils
===================================================================
--- srfi-4-utils	(revisão 25595)
+++ srfi-4-utils	(cópia de trabalho)
@@ -18,28 +18,62 @@
 
 === Procedures
 
+<procedure>s8vector-fold :: F * X0 * V [* V1 ... VN] -> XN</procedure><br>
+<procedure>u8vector-fold :: F * X0 * V [* V1 ... VN] -> XN</procedure><br>
+<procedure>s16vector-fold :: F * X0 * V [* V1 ... VN] -> XN</procedure><br>
+<procedure>u16vector-fold :: F * X0 * V [* V1 ... VN] -> XN</procedure><br>
+<procedure>s32vector-fold :: F * X0 * V [* V1 ... VN] -> XN</procedure><br>
+<procedure>u32vector-fold :: F * X0 * V [* V1 ... VN] -> XN</procedure><br>
+<procedure>f32vector-fold :: F * X0 * V [* V1 ... VN] -> XN</procedure><br>
+<procedure>f64vector-fold :: F * X0 * V [* V1 ... VN] -> XN</procedure>
 
-For each value of {{TAG}} in {{{ s8, u8, s16, u16, s32, u32, f32, f64
-}}}, the following procedures are defined:
-
-<procedure>TAGvector-fold :: F * X0 * V [* V1 ... VN] -> XN</procedure>
-
 where {{F :: V(I) [ * V1(I) ... VN(I)] * AX -> AX}}
 
-<procedure>TAGvector-map  :: F * V [ * V1 ... VN] -> V</procedure>
+<procedure>s8vector-map  :: F * V [ * V1 ... VN] -> V</procedure><br>
+<procedure>u8vector-map  :: F * V [ * V1 ... VN] -> V</procedure><br>
+<procedure>s16vector-map  :: F * V [ * V1 ... VN] -> V</procedure><br>
+<procedure>u16vector-map  :: F * V [ * V1 ... VN] -> V</procedure><br>
+<procedure>s32vector-map  :: F * V [ * V1 ... VN] -> V</procedure><br>
+<procedure>u32vector-map  :: F * V [ * V1 ... VN] -> V</procedure><br>
+<procedure>f32vector-map  :: F * V [ * V1 ... VN] -> V</procedure><br>
+<procedure>f64vector-map  :: F * V [ * V1 ... VN] -> V</procedure>
 
-<procedure>TAGvector-foldi :: F * X0 * V [ * V1 ... VN] -> XN</procedure>
+<procedure>s8vector-foldi :: F * X0 * V [ * V1 ... VN] -> XN</procedure><br>
+<procedure>u8vector-foldi :: F * X0 * V [ * V1 ... VN] -> XN</procedure><br>
+<procedure>s16vector-foldi :: F * X0 * V [ * V1 ... VN] -> XN</procedure><br>
+<procedure>u16vector-foldi :: F * X0 * V [ * V1 ... VN] -> XN</procedure><br>
+<procedure>s32vector-foldi :: F * X0 * V [ * V1 ... VN] -> XN</procedure><br>
+<procedure>u32vector-foldi :: F * X0 * V [ * V1 ... VN] -> XN</procedure><br>
+<procedure>f32vector-foldi :: F * X0 * V [ * V1 ... VN] -> XN</procedure><br>
+<procedure>f64vector-foldi :: F * X0 * V [ * V1 ... VN] -> XN</procedure>
 
 where {{F :: I * V(I) [ * V1(I) ... VN(I)] * AX -> AX}}
 
-<procedure>TAGvector-mapi  :: F * V [* V1 ... VN] -> V</procedure>
 
+<procedure>s8vector-mapi  :: F * V [* V1 ... VN] -> V</procedure><br>
+<procedure>u8vector-mapi  :: F * V [* V1 ... VN] -> V</procedure><br>
+<procedure>s16vector-mapi  :: F * V [* V1 ... VN] -> V</procedure><br>
+<procedure>u16vector-mapi  :: F * V [* V1 ... VN] -> V</procedure><br>
+<procedure>s32vector-mapi  :: F * V [* V1 ... VN] -> V</procedure><br>
+<procedure>u32vector-mapi  :: F * V [* V1 ... VN] -> V</procedure><br>
+<procedure>f32ector-mapi  :: F * V [* V1 ... VN] -> V</procedure><br>
+<procedure>f64vector-mapi  :: F * V [* V1 ... VN] -> V</procedure>
+
 where {{F :: I * V(I) [* V1(I) ... VN(I)] -> V}}
 
-<procedure>TAGvector-quick-sort!  :: V * ELT< [ * START * END] -> V</procedure>
 
+<procedure>s8vector-quick-sort!  :: V * ELT< [ * START * END] -> V</procedure><br>
+<procedure>u8vector-quick-sort!  :: V * ELT< [ * START * END] -> V</procedure><br>
+<procedure>s16vector-quick-sort!  :: V * ELT< [ * START * END] -> V</procedure><br>
+<procedure>u16vector-quick-sort!  :: V * ELT< [ * START * END] -> V</procedure><br>
+<procedure>s32vector-quick-sort!  :: V * ELT< [ * START * END] -> V</procedure><br>
+<procedure>u32vector-quick-sort!  :: V * ELT< [ * START * END] -> V</procedure><br>
+<procedure>f32vector-quick-sort!  :: V * ELT< [ * START * END] -> V</procedure><br>
+<procedure>f64vector-quick-sort!  :: V * ELT< [ * START * END] -> V</procedure>
+
 where {{F :: i1 * V(i1) * i2 * V(i2) -> boolean}}
 
+
 == Examples
 
 
