2 libc-extension.cc -- compensate for lacking libc functions.
5 source file of the flowerlib
7 (c) 1997 Han-Wen Nienhuys <hanwen@stack.nl>
12 #include "libc-extension.hh"
16 strnlwr( char* start_l ,int n)
18 char * p = start_l + n;
19 while ( --p >= start_l) {
20 *p = tolower( *p ); /* a macro on some compilers */
26 strnupr( char* start_l, int n)
28 char * p = start_l + n;
29 while ( --p >= start_l) {
30 *p = toupper( *p ); /* a macro on some compilers */
37 /** locate a substring. #memmem# finds the first occurrence of
38 #needle# in #haystack#
42 memmem(Byte const * haystack, int haystack_len,
43 Byte const *needle,int needle_len)
45 Byte const * end_haystack = haystack + haystack_len - needle_len;
46 Byte const * end_needle = needle + needle_len ;
48 /* Ahhh ... Some minimal lowlevel stuff. This *is* nice; Varation
49 is the spice of life */
50 while (haystack < end_haystack) {
51 Byte const *subneedle_l = needle;
52 Byte const *subhaystack_l = haystack;
53 while (subneedle_l < end_needle) {
54 if (*subneedle_l++ != *subhaystack_l++)
55 goto next; // yeah. I should be prosecuted.
58 // completed the needle. Gotcha.
59 return (char*) haystack;
68 memrchr(Byte const * p, int n, char c)
81 my_swap(T &t1, T &t2, T &tmp)
89 strrev( Byte* byte_l, int length_i )
93 Byte* left_l = byte_l;
94 Byte* right_l = byte_l + length_i;
96 while ( right_l > left_l ) {
97 my_swap(*right_l-- , *left_l++ , tmp_byte);
103 int snprintf ( char *str, size_t,
104 char const *format, ... )
107 va_start(ap, format);
108 int i = vsprintf(str, format, ap);