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
)
21 *p
= tolower (*p
); /* a macro on some compilers */
27 strnupr (char* start_l
, int n
)
29 char * p
= start_l
+ n
;
30 while (--p
>= start_l
)
32 *p
= toupper (*p
); /* a macro on some compilers */
39 /** locate a substring. #memmem# finds the first occurrence of
40 #needle# in #haystack#
44 memmem (Byte
const * haystack
, int haystack_len
,
45 Byte
const *needle
,int needle_len
)
47 Byte
const * end_haystack
= haystack
+ haystack_len
- needle_len
;
48 Byte
const * end_needle
= needle
+ needle_len
;
50 /* Ahhh ... Some minimal lowlevel stuff. This *is* nice; Varation
51 is the spice of life */
52 while (haystack
< end_haystack
)
54 Byte
const *subneedle_l
= needle
;
55 Byte
const *subhaystack_l
= haystack
;
56 while (subneedle_l
< end_needle
)
58 if (*subneedle_l
++ != *subhaystack_l
++)
59 goto next
; // yeah. I should be prosecuted.
62 // completed the needle. Gotcha.
63 return (char*) haystack
;
72 memrchr (Byte
const * p
, int n
, char c
)
86 my_swap (T
&t1
, T
&t2
, T
&tmp
)
94 strrev (Byte
* byte_l
, int length_i
)
98 Byte
* left_l
= byte_l
;
99 Byte
* right_l
= byte_l
+ length_i
;
101 while (right_l
> left_l
)
103 my_swap (*right_l
-- , *left_l
++ , tmp_byte
);
109 int snprintf (char *str
, size_t,
110 char const *format
, ...)
113 va_start (ap
, format
);
114 int i
= vsprintf (str
, format
, ap
);