[ViewVC] Diff of: cvs/libecb/ecb.pod

Comparing libecb/ecb.pod (file contents):
Revision 1.11 by sf-exg, Thu May 26 21:18:52 2011 UTC vs.
Revision 1.13 by sf-exg, Thu May 26 22:14:52 2011 UTC

 equivalently the number of bits set to 0 before the least significant
 bit set), starting from 0. If C<x> is 0 the result is undefined. A
 common use case is to compute the integer binary logarithm, i.e.,
 floor(log2(n)). For example:
-  ecb_ctz32(3) = 1
+  ecb_ctz32(3) = 0
-  ecb_ctz32(6) = 2
+  ecb_ctz32(6) = 1
 =item int ecb_popcount32 (uint32_t x)
 Returns the number of bits set to 1 in C<x>. For example:
 =item uint32_t ecb_bswap16 (uint32_t x)
 =item uint32_t ecb_bswap32 (uint32_t x)
+These two functions return the value of the 16-bit (32-bit) variable
+C<x> after reversing the order of bytes.
 =item uint32_t ecb_rotr32 (uint32_t x, unsigned int count)
 =item uint32_t ecb_rotl32 (uint32_t x, unsigned int count)
 These two functions return the value of C<x> after shifting all the bits
 =over 4
 =item element_count = ecb_array_length (name) [MACRO]
-=back
+Returns the number of elements in the array C<name>. For example:
+  int primes[] = { 2, 3, 5, 7, 11 };
+  int sum = 0;
+  for (i = 0; i < ecb_array_length (primes); i++)
+    sum += primes [i];
+=back

-–
+Removed lines
-+
+Added lines
-<
+Changed lines
->
+Changed lines