├── .gitignore ├── 00.c ├── 01.c ├── 02.c ├── 03.c ├── 04.c ├── 05.c ├── 06.c ├── 07.c ├── 08.c ├── 09.c ├── 10.c ├── 11.c ├── 12.c ├── 13.c ├── 14.c ├── 15.c ├── 16.c ├── 17.c ├── 18.c ├── 19.c ├── 20.c ├── 21.c ├── 22.c ├── 23.c ├── 24.c ├── 25.c ├── 26.c ├── 27.c ├── 28.c ├── 29.c ├── 30.c ├── Cstring.man ├── LICENSE ├── README.md ├── cstring.h └── news.c /.gitignore: -------------------------------------------------------------------------------- 1 | # Prerequisites 2 | *.d 3 | 4 | # Object files 5 | *.o 6 | *.ko 7 | *.obj 8 | *.elf 9 | 10 | # Linker output 11 | *.ilk 12 | *.map 13 | *.exp 14 | 15 | # Precompiled Headers 16 | *.gch 17 | *.pch 18 | 19 | # Libraries 20 | *.lib 21 | *.a 22 | *.la 23 | *.lo 24 | 25 | # Shared objects (inc. Windows DLLs) 26 | *.dll 27 | *.so 28 | *.so.* 29 | *.dylib 30 | 31 | # Executables 32 | *.exe 33 | *.out 34 | *.app 35 | *.i*86 36 | *.x86_64 37 | *.hex 38 | 39 | # Debug files 40 | *.dSYM/ 41 | *.su 42 | *.idb 43 | *.pdb 44 | 45 | # Kernel Module Compile Results 46 | *.mod* 47 | *.cmd 48 | .tmp_versions/ 49 | modules.order 50 | Module.symvers 51 | Mkfile.old 52 | dkms.conf 53 | -------------------------------------------------------------------------------- /00.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | //create a new string from a constant string 5 | char *d="\ec\e[44;36m"; 6 | char *s; 7 | print(d); 8 | s=newString("hello world..."); 9 | print(s); 10 | free(s); 11 | return 0; 12 | } 13 | -------------------------------------------------------------------------------- /01.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | //add text into a string 5 | char *d="\ec\e[44;36m"; 6 | char *s; 7 | print(d); 8 | s=newString("hello world..."); 9 | s=catString(s,"hi..."); 10 | print(s); 11 | frees(s); 12 | return 0; 13 | } 14 | -------------------------------------------------------------------------------- /02.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | //add a sub string to start of the string 5 | char *d="\ec\e[44;36m"; 6 | char *s; 7 | print(d); 8 | s=newString("hello world..."); 9 | s=frontString(s,'*',20); 10 | print(s); 11 | frees(s); 12 | return 0; 13 | } 14 | -------------------------------------------------------------------------------- /03.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | char *s; 6 | print(d); 7 | s=strString('*',20); 8 | print(s); 9 | replaceCharString(s,'*','!'); 10 | print(s); 11 | frees(s); 12 | return 0; 13 | } 14 | -------------------------------------------------------------------------------- /04.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //append part of a string 6 | char *s; 7 | char *s2; 8 | print(d); 9 | s2=strString('*',20); 10 | s=newString("hello world..."); 11 | s=catNString(s,s2,5); 12 | print(s); 13 | frees(s); 14 | frees(s2); 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /05.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //replace a string in other 6 | char *s; 7 | char *s2; 8 | print(d); 9 | s=newString("hello world..."); 10 | s2=replaceString(s,"world","wr"); 11 | print(s2); 12 | frees(s); 13 | frees(s2); 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /06.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //create a list 6 | char *lst; 7 | print(d); 8 | lst=newPointer("item 1"); 9 | lst=addPointer(lst,"item 2"); 10 | printList(lst); 11 | frees(lst); 12 | return 0; 13 | } 14 | -------------------------------------------------------------------------------- /07.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //split a string 6 | char *lst; 7 | char *s; 8 | print(d); 9 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 10 | lst=splitString(s,','); 11 | printList(lst); 12 | frees(lst); 13 | frees(s); 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /08.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //rtrim string remove spaces and null chaters from rigth of the string 6 | char *s; 7 | char *ss; 8 | print(d); 9 | s=newString("hello world... "); 10 | ss=rtrim(s); 11 | print(s); 12 | print(ss); 13 | frees(s); 14 | frees(ss); 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /09.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //ltrim string remove spaces and null chaters from left of the string 6 | char *s; 7 | char *ss; 8 | print(d); 9 | s=newString(" hello world..."); 10 | print(s); 11 | ss=ltrim(s); 12 | print(ss); 13 | frees(s); 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /10.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //mid string creates a new string using part of a sub string 6 | char *s; 7 | char *ss; 8 | print(d); 9 | s=newString("012345678901234567890"); 10 | print(s); 11 | ss=mid(s,5,10); 12 | print(ss); 13 | frees(s); 14 | frees(ss); 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /11.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //rigth string create n char of the rigth of the string 6 | char *s; 7 | char *ss; 8 | print(d); 9 | s=newString("012345678901234567890"); 10 | print(s); 11 | ss=rigths(s,10); 12 | print(ss); 13 | frees(s); 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /12.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //lefts string return n char from a string 6 | char *s; 7 | char *ss; 8 | print(d); 9 | s=newString("012345678901234567890"); 10 | print(s); 11 | ss=lefths(s,10); 12 | print(ss); 13 | frees(s); 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /13.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //edit string create add same chars to the midlle of a string 6 | char *s; 7 | char *ss; 8 | print(d); 9 | s=newString("012345678901234567890"); 10 | print(s); 11 | ss=edit(s,10,10,'>'); 12 | print(ss); 13 | frees(ss); 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /14.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //deledit string delete same char in midlle of a string 6 | char *s; 7 | char *ss; 8 | print(d); 9 | s=newString("012345678901234567890"); 10 | print(s); 11 | deledit(s,10,7); 12 | print(s); 13 | frees(s); 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /15.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //split a string 6 | char *lst; 7 | char *s; 8 | print(d); 9 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 10 | lst=splitString(s,','); 11 | printList(lst); 12 | frees(lst); 13 | frees(s); 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /16.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //new list add item 6 | char *lst; 7 | print (d); 8 | lst=newPointer("1st item"); 9 | lst=addPointer(lst,"2st item"); 10 | printList(lst); 11 | frees(lst); 12 | return 0; 13 | } 14 | -------------------------------------------------------------------------------- /17.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //delete item 6 | char *lst; 7 | char *s; 8 | int pos=3; 9 | print(d); 10 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 11 | lst=splitString(s,','); 12 | deleteItem(lst,pos); 13 | printList(lst); 14 | frees(lst); 15 | frees(s); 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /18.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //insert item at position index 6 | char *lst; 7 | char *s; 8 | int pos=3; 9 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 10 | lst=splitString(s,','); 11 | lst=insertItem(lst,pos,"new item"); 12 | printList(lst); 13 | frees(lst); 14 | frees(s); 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /19.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //insert item at end of the list 6 | char *lst; 7 | char *s; 8 | int pos=3; 9 | print(d); 10 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 11 | lst=splitString(s,','); 12 | lst=addPointer(lst,"new item"); 13 | printList(lst); 14 | frees(lst); 15 | frees(s); 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /20.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //clone list 6 | char *lst; 7 | char *newlst; 8 | char *s; 9 | int pos=3; 10 | print(d); 11 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 12 | lst=splitString(s,','); 13 | newlst=cloneList(lst); 14 | printList(newlst); 15 | frees(lst); 16 | frees(newlst); 17 | frees(s); 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /21.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //clone list item 6 | char *lst; 7 | char *newlst; 8 | char *s; 9 | int pos=3; 10 | print(d); 11 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 12 | lst=splitString(s,','); 13 | newlst=holeItem(lst,pos); 14 | printList(newlst); 15 | frees(lst); 16 | frees(s); 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /22.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //change list item 6 | char *lst; 7 | char *newlst; 8 | char *s; 9 | int pos=3; 10 | print(d); 11 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 12 | lst=splitString(s,','); 13 | lst=holeItem(lst,pos); 14 | setItem(lst,pos,"new item"); 15 | printList(lst); 16 | frees(lst); 17 | frees(s); 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /23.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //get list item 6 | char *lst; 7 | char *s; 8 | char *s1; 9 | int pos=3; 10 | print(d); 11 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 12 | lst=splitString(s,','); 13 | s1=getItem(lst,pos); 14 | print(s1); 15 | frees(lst); 16 | frees(s); 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /24.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //count of list item 6 | char *lst; 7 | char *s; 8 | char *s1; 9 | int pos=0; 10 | print(d); 11 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 12 | lst=splitString(s,','); 13 | printList(lst); 14 | pos=countList(lst); 15 | printf("count: %d\n",pos); 16 | frees(lst); 17 | frees(s); 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /25.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //toString of list item 6 | char *lst; 7 | char *s; 8 | char *s1; 9 | int pos=0; 10 | print(d); 11 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 12 | lst=splitString(s,','); 13 | printList(lst); 14 | s1=ListToString(lst,'|'); 15 | print(s1); 16 | frees(lst); 17 | frees(s); 18 | frees(s1); 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /26.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //revert of list item 6 | char *lst; 7 | char *lst2; 8 | char *s; 9 | char *s1; 10 | int pos=0; 11 | print(d); 12 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 13 | lst=splitString(s,','); 14 | lst2=invertList(lst); 15 | printList(lst2); 16 | frees(lst2); 17 | frees(lst); 18 | frees(s); 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /27.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //order of list item 6 | char *lst; 7 | char *lst2; 8 | char *s; 9 | char *s1; 10 | int pos=0; 11 | print(d); 12 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 13 | lst=splitString(s,','); 14 | lst2=invertList(lst); 15 | frees(lst); 16 | lst=orderList(lst2); 17 | printList(lst); 18 | frees(lst2); 19 | frees(s); 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /28.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //decedent order of list item 6 | char *lst; 7 | char *lst2; 8 | char *s; 9 | char *s1; 10 | int pos=0; 11 | print(d); 12 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 13 | lst=splitString(s,','); 14 | lst2=zorderList(lst); 15 | printList(lst2); 16 | frees(lst); 17 | frees(lst2); 18 | frees(s); 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /29.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //create a dinamic list and is nodes and frees all nodes 6 | char *lst; 7 | char *lst2; 8 | char *s; 9 | char *s1; 10 | int n=0; 11 | int pos=0; 12 | char ss[2080]; 13 | print(d); 14 | s=ss; 15 | for(n=0;n<16;n++){ 16 | sprintf(s,"item %d",n); 17 | if(n==0){ 18 | lst=newList(s); 19 | }else{ 20 | lst=addList(lst,s); 21 | } 22 | } 23 | printList(lst); 24 | freeList(lst); 25 | return 0; 26 | } 27 | -------------------------------------------------------------------------------- /30.c: -------------------------------------------------------------------------------- 1 | #include "cstring.h" 2 | 3 | int main(){ 4 | char *d="\ec\e[44;36m"; 5 | //list a number of itens 6 | char *lst; 7 | char *lst2; 8 | char *s; 9 | char *s1; 10 | int n=0; 11 | int pos=0; 12 | char ss[2080]; 13 | print(d); 14 | s=ss; 15 | for(n=0;n<64;n++){ 16 | sprintf(s,"item %d",n); 17 | if(n==0){ 18 | lst=newList(s); 19 | }else{ 20 | lst=addList(lst,s); 21 | } 22 | } 23 | printnList(lst,16,16); 24 | freeList(lst); 25 | return 0; 26 | } 27 | -------------------------------------------------------------------------------- /Cstring.man: -------------------------------------------------------------------------------- 1 | for not out of memory of a string you must 2 | ------------------------------------------ 3 | //create a new string from a constant string 4 | char *s; 5 | s=newString("hello world..."); 6 | print(s); 7 | free(s); 8 | ------------------------------------------- 9 | //add text into a string 10 | char *s; 11 | s=newString("hello world..."); 12 | s=catString(s,"hi..."); 13 | print(s); 14 | frees(s); 15 | ---------------------------------------------- 16 | //create a string to same char 17 | char *s; 18 | s=strString('*',20); 19 | frees(s); 20 | ---------------------------------------------- 21 | //add a sub string to start of the string 22 | char *s; 23 | s=newString("hello world..."); 24 | s=appendString(s,'*',20); 25 | print(s); 26 | frees(s); 27 | ---------------------------------------------- 28 | //add a sub string to start of the string 29 | char *s; 30 | s=newString("hello world..."); 31 | s=frontString(s,'*',20); 32 | print(s); 33 | frees(s); 34 | ---------------------------------------------- 35 | //replacing chars only 36 | char *s; 37 | s=strString('*',20); 38 | print(s); 39 | replaceCharString(s,'*','!'); 40 | print(s); 41 | frees(s); 42 | ---------------------------------------------- 43 | //append part of a string 44 | char *s; 45 | char *s2; 46 | s2=strString('*',20); 47 | s=newString("hello world..."); 48 | s=catNString(s,s2,5); 49 | print(s); 50 | frees(s); 51 | frees(s2); 52 | ---------------------------------------------- 53 | //replace a string in other 54 | char *s; 55 | char *s2; 56 | s=newString("hello world..."); 57 | s2=replaceString(s1,"world","wr"); 58 | print(s2); 59 | frees(s); 60 | frees(s2); 61 | ---------------------------------------------- 62 | //create a list 63 | char *lst; 64 | lst=newPointer("item 1"); 65 | lst=addPointer(lst,"item 2"); 66 | printList(lst); 67 | frees(lst); 68 | ---------------------------------------------- 69 | //split a string 70 | char *lst; 71 | char *s; 72 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 73 | lst=splitString(s,','); 74 | printList(lst); 75 | frees(lst); 76 | frees(s); 77 | ---------------------------------------------- 78 | //format of a list firth item is the size of the array 79 | ---------------------------------------------- 80 | //rtrim string remove spaces and null chaters from rigth of the string 81 | char *s; 82 | char *ss; 83 | s=newString("hello world... "); 84 | ss=rtrim(s); 85 | print(s); 86 | print(ss); 87 | frees(s); 88 | frees(ss); 89 | ---------------------------------------------- 90 | //ltrim string remove spaces and null chaters from left of the string 91 | char *s; 92 | char *ss; 93 | s=newString(" hello world..."); 94 | print(s); 95 | ss=ltrim(s); 96 | print(ss); 97 | frees(s); 98 | ---------------------------------------------- 99 | //mid string creates a new string using part of a sub string 100 | char *s; 101 | char *ss; 102 | s=newString("012345678901234567890"); 103 | print(s); 104 | ss=mid(s,5,10); 105 | print(ss); 106 | frees(s); 107 | frees(ss); 108 | ---------------------------------------------- 109 | //rigth string create n char of the rigth of the string 110 | char *s; 111 | char *ss; 112 | s=newString("012345678901234567890"); 113 | print(s); 114 | ss=rigths(s,10); 115 | print(ss); 116 | frees(s); 117 | frees(ss); 118 | ---------------------------------------------- 119 | //lefts string return n char from a string 120 | char *s; 121 | char *ss; 122 | s=newString("012345678901234567890"); 123 | print(s); 124 | ss=lefts(s,10); 125 | print(ss); 126 | frees(s); 127 | ---------------------------------------------- 128 | //edit string create add same chars to the midlle of a string 129 | char *s; 130 | char *ss; 131 | s=newString("012345678901234567890"); 132 | print(s); 133 | ss=edit(s,10,10,'>'); 134 | print(ss); 135 | frees(s); 136 | frees(ss); 137 | ---------------------------------------------- 138 | //deledit string delete same char in midlle of a string 139 | char *s; 140 | char *ss; 141 | s=newString("012345678901234567890"); 142 | print(s); 143 | ss=deledit(s,10,7); 144 | print(ss); 145 | frees(s); 146 | ------------------------------------------------------ 147 | ****LISTS 148 | ------------------------------------------------------ 149 | //split a string 150 | char *lst; 151 | char *s; 152 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 153 | lst=splitString(s,','); 154 | printList(lst); 155 | frees(lst); 156 | frees(s); 157 | --------------------------------------------------- 158 | //new list add item 159 | char *lst; 160 | lst=newPoiter("1st item"); 161 | lst=addPoiter(lst,"2st item"); 162 | printList(lst); 163 | frees(lst); 164 | ----------------------------------------------------- 165 | //delete item 166 | char *lst; 167 | char *s; 168 | int pos=3; 169 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 170 | lst=splitString(s,','); 171 | lst=deleteItem(lst,pos); 172 | printList(lst); 173 | frees(lst); 174 | frees(s); 175 | ----------------------------------------------------- 176 | //insert item at position index 177 | char *lst; 178 | char *s; 179 | int pos=3; 180 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 181 | lst=splitString(s,','); 182 | lst=insertItem(lst,pos,"new item"); 183 | printList(lst); 184 | frees(lst); 185 | frees(s); 186 | ----------------------------------------------------- 187 | //insert item at end of the list 188 | char *lst; 189 | char *s; 190 | int pos=3; 191 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 192 | lst=splitString(s,','); 193 | lst=addPointer(lst,"new item"); 194 | printList(lst); 195 | frees(lst); 196 | frees(s); 197 | ----------------------------------------------------- 198 | //clone list 199 | char *lst; 200 | char newlst; 201 | char *s; 202 | int pos=3; 203 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 204 | lst=splitString(s,','); 205 | newlst=cloneList(lst); 206 | printList(newlst); 207 | frees(lst); 208 | frees(newlst); 209 | frees(s); 210 | ----------------------------------------------------- 211 | //clone list item 212 | char *lst; 213 | char *s; 214 | int pos=3; 215 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 216 | lst=splitString(s,','); 217 | lst=holeitem(lst,pos); 218 | printList(newlst); 219 | frees(lst); 220 | frees(s); 221 | ----------------------------------------------------- 222 | //change list item 223 | char *lst; 224 | char *s; 225 | int pos=3; 226 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 227 | lst=splitString(s,','); 228 | lst=holeitem(lst,pos); 229 | setItem(lst,pos,"new item"); 230 | printList(newlst); 231 | frees(lst); 232 | frees(s); 233 | ----------------------------------------------------- 234 | //get list item 235 | char *lst; 236 | char *s; 237 | char *s1; 238 | int pos=3; 239 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 240 | lst=splitString(s,','); 241 | s1=getitem(lst,pos); 242 | print(s1); 243 | frees(lst); 244 | frees(s); 245 | frees(s1); 246 | ----------------------------------------------------- 247 | //count of list item 248 | char *lst; 249 | char *s; 250 | char *s1; 251 | int pos=0; 252 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 253 | lst=splitString(s,','); 254 | printList(lst); 255 | pos=countList(lst); 256 | printf("%d\n",pos); 257 | frees(lst); 258 | frees(s); 259 | ----------------------------------------------------- 260 | //toString of list item 261 | char *lst; 262 | char *s; 263 | char *s1; 264 | int pos=0; 265 | print(d); 266 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 267 | lst=splitString(s,','); 268 | printList(lst); 269 | s1=ListToString(lst,'|'); 270 | print(s1); 271 | frees(lst); 272 | frees(s); 273 | frees(s1); 274 | ----------------------------------------------------- 275 | //revert of list item 276 | char *lst; 277 | char *lst2; 278 | char *s; 279 | char *s1; 280 | int pos=0; 281 | print(d); 282 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 283 | lst=splitString(s,','); 284 | lst2=invertList(lst); 285 | printList(lst2); 286 | frees(lst2); 287 | frees(lst); 288 | frees(s); 289 | ----------------------------------------------------- 290 | //order of list item 291 | char *lst; 292 | char *lst2; 293 | char *s; 294 | char *s1; 295 | int pos=0; 296 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 297 | lst=splitString(s,','); 298 | lst2=invertList(lst); 299 | frees(lst); 300 | lst=orderList(lst2); 301 | printList(lst); 302 | frees(lst2); 303 | frees(s); 304 | ----------------------------------------------------- 305 | //decedent order of list item 306 | char *lst; 307 | char *lst2; 308 | char *s; 309 | char *s1; 310 | int pos=0; 311 | s=newString("arg0,arg1,arg2,arg3,arg4,arg5"); 312 | lst=splitString(s,','); 313 | lst2=zorderList(lst); 314 | printList(lst2); 315 | frees(lst); 316 | frees(lst2); 317 | frees(s); 318 | ----------------------------------------------------- 319 | //create a dinamic list and is nodes and frees all nodes 320 | char *lst; 321 | char *lst2; 322 | char *s; 323 | char *s1; 324 | int n=0; 325 | int pos=0; 326 | char ss[2080]; 327 | s=ss; 328 | for(n=0;n<16;n++){ 329 | sprintf(s,"item %d",n); 330 | if(n==0){ 331 | lst=newList(s); 332 | }else{ 333 | lst=addList(lst,s); 334 | } 335 | } 336 | printList(lst); 337 | freeList(lst); 338 | ----------------------------------------------------- 339 | //list a number of itens 340 | char *lst; 341 | char *lst2; 342 | char *s; 343 | char *s1; 344 | int n=0; 345 | int pos=0; 346 | char ss[2080]; 347 | s=ss; 348 | for(n=0;n<64;n++){ 349 | sprintf(s,"item %d",n); 350 | if(n==0){ 351 | lst=newList(s); 352 | }else{ 353 | lst=addList(lst,s); 354 | } 355 | } 356 | printnList(lst,16,16); 357 | freeList(lst); 358 | ----------------------------------------------------- 359 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # gcc_strings 2 | Gcc string create and resize it safety 3 | -------------------------------------------------------------------------------- /cstring.h: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | const char *Nnulls=""; 6 | void frees(char *c){ 7 | if(c!=NULL)free(c); 8 | } 9 | //print string 10 | void print(const char *a){ 11 | if (a!=NULL)puts(a); 12 | } 13 | char *addPointer(char *c1,const char *c){ 14 | char *cc; 15 | const char *ccc; 16 | int *i; 17 | int *it; 18 | int ii; 19 | char *nulls=""; 20 | int count; 21 | int mes=0; 22 | if(c==NULL){ 23 | ccc=nulls; 24 | }else{ 25 | ccc=c; 26 | } 27 | cc=NULL; 28 | if(c1!=NULL){ 29 | i=(int *) c1; 30 | count=*(i+0); 31 | count++; 32 | *(i+0)=count; 33 | cc=realloc(c1,(count*4)+8); 34 | if(cc!=NULL){ 35 | it=(int *)cc; 36 | mes=count; 37 | *(it+mes)=(int)(ccc); 38 | } 39 | } 40 | return cc; 41 | } 42 | void printList(const char *cc){ 43 | int *i; 44 | char *c; 45 | int n; 46 | int count=0; 47 | if(cc!=NULL){ 48 | i=(int *) cc; 49 | count=*(i+0); 50 | for(n=0;n-1){ 62 | i=(int *) cc; 63 | count=*(i+0); 64 | if(position-1){ 82 | ccc=addPointer(cc,Nnulls); 83 | i=(int *) ccc; 84 | count=*(i+0); 85 | if(positionposition-1;n--){ 87 | c=(char *) *(i+(n+1)); 88 | *(i+n+2)=(int)(c); 89 | } 90 | } 91 | } 92 | return ccc; 93 | } 94 | char *getItem(const char *cc,const int nn){ 95 | int *i; 96 | char *c; 97 | int n; 98 | int count=0; 99 | c=NULL; 100 | if(cc!=NULL){ 101 | i=(int *) cc; 102 | count=*(i+0); 103 | n=nn; 104 | if (n-1;n--){ 202 | c=(char *) *(i+(n+1)); 203 | if(n==count-1){ 204 | lst=newPointer(c); 205 | }else{ 206 | lst=addPointer(lst,c); 207 | } 208 | } 209 | } 210 | return lst; 211 | } 212 | //create a new string from a constante 213 | char *newString(const char *a){ 214 | const char *aa; 215 | char *c; 216 | char *cc=""; 217 | size_t i=5; 218 | if (a!=NULL){ 219 | i=i+strlen(a); 220 | aa=a; 221 | }else{ 222 | i=5; 223 | aa=cc; 224 | } 225 | c=malloc(i); 226 | if(c!=NULL && aa!=NULL)strcpy(c,aa); 227 | return c; 228 | } 229 | //append same text into it string 230 | char *catString(char *a,const char *b){ 231 | char *aa; 232 | const char *bb; 233 | char *c; 234 | size_t i=5; 235 | char *nulls=""; 236 | int b0=0; 237 | if (a==NULL){ 238 | aa=newString(nulls); 239 | b0=-1; 240 | }else{ 241 | i=i+strlen(a); 242 | aa=a; 243 | } 244 | if (b==NULL){ 245 | bb=nulls; 246 | }else{ 247 | i=i+strlen(b)+5; 248 | bb=b; 249 | } 250 | c=realloc(aa,i); 251 | if(c!=NULL && aa!=NULL && bb!=NULL)strcat(c,bb); 252 | return c; 253 | } 254 | //fill new string 255 | char *strString(const char a,const size_t i){ 256 | char *c; 257 | int n; 258 | size_t ii=i+5; 259 | c=malloc(ii); 260 | if(c!=NULL){ 261 | memset(c,a,i); 262 | c[i]=0; 263 | } 264 | return c; 265 | } 266 | //add a string to end of a string 267 | char *appendString(char *cc,char a,const size_t i){ 268 | char *aa; 269 | char *c; 270 | char *ccc; 271 | size_t n=i+5; 272 | char *nulls=""; 273 | int b0=0; 274 | if (cc==NULL){ 275 | aa=newString(nulls); 276 | b0=-1; 277 | n=0; 278 | }else{ 279 | n=n+strlen(cc); 280 | aa=cc; 281 | } 282 | c=NULL; 283 | ccc=strString(a,i); 284 | if (aa!=NULL && ccc!=NULL){ 285 | c=catString(aa,ccc); 286 | free(ccc); 287 | } 288 | return c; 289 | } 290 | //add a string to front of a string 291 | char *frontString(char *cc,const char a,const size_t i){ 292 | char *aa; 293 | char *c; 294 | char *ccc; 295 | char *nulls=""; 296 | int b0=0; 297 | size_t n=i+5; 298 | if (cc==NULL){ 299 | aa=newString(nulls); 300 | b0=-1; 301 | }else{ 302 | n=n+strlen(cc); 303 | aa=cc; 304 | } 305 | c=NULL; 306 | ccc=strString(a,i); 307 | if (aa!=NULL && ccc!=NULL){ 308 | c=catString(ccc,aa); 309 | free(aa); 310 | b0=0; 311 | } 312 | if(aa!=NULL && b0)free(aa); 313 | return c; 314 | } 315 | //replace chars 316 | void *replaceCharString(char *c,const char cc,const char c1){ 317 | char *ccc; 318 | char *cccc; 319 | int r=0; 320 | ccc=c; 321 | if(c!=NULL){ 322 | while (r!=1){ 323 | cccc=strchr(ccc,cc); 324 | if(cccc!=NULL){ 325 | ccc=cccc+1; 326 | cccc[0]=c1; 327 | }else{ 328 | r=1; 329 | } 330 | } 331 | } 332 | } 333 | //append same text into it string 334 | char *catNString(char *a,const char *b,const size_t n){ 335 | char *c; 336 | char *cc; 337 | char *aa; 338 | const char *bb; 339 | char *nulls=""; 340 | int b0=0; 341 | int b1=0; 342 | size_t i=n+6; 343 | if (a==NULL){ 344 | aa=newString(nulls); 345 | b0=-1; 346 | }else{ 347 | i=i+strlen(a); 348 | aa=a; 349 | } 350 | if (b==NULL){ 351 | bb=nulls; 352 | }else{ 353 | bb=b; 354 | } 355 | 356 | c=realloc(aa,i); 357 | if(c!=NULL){ 358 | cc=c+strlen(aa); 359 | strncpy(cc,bb,n); 360 | cc[n]=0; 361 | } 362 | return c; 363 | } 364 | //replace string 365 | char *replaceString(char *c,const char *cc,const char *c1){ 366 | const char *cl; 367 | const char *cll; 368 | char *c2; 369 | char *ccc; 370 | char *cccc; 371 | char *nulls=""; 372 | int l=0; 373 | size_t n=0; 374 | int r=0; 375 | ccc=c; 376 | c2=newString(""); 377 | 378 | if (c==NULL){ 379 | ccc=nulls; 380 | l=0; 381 | }else{ 382 | ccc=c; 383 | } 384 | 385 | if (cc==NULL){ 386 | cl=nulls; 387 | l=0; 388 | }else{ 389 | cl=cc; 390 | l=strlen(cl); 391 | } 392 | 393 | if (c1==NULL){ 394 | cll=nulls; 395 | }else{ 396 | cll=c1; 397 | } 398 | 399 | 400 | 401 | r=0; 402 | while (r!=1){ 403 | cccc=strstr(ccc,cl); 404 | if(cccc!=NULL){ 405 | n=cccc-ccc; 406 | catNString(c2,ccc,n); 407 | catString(c2,cll); 408 | ccc=cccc+l; 409 | }else{ 410 | r=1; 411 | catString(c2,ccc); 412 | } 413 | } 414 | return c2; 415 | } 416 | //new list 417 | char *splitString(char *c,const char cc){ 418 | char *c2; 419 | char *c1; 420 | char *ccc; 421 | char *cccc; 422 | int count=0; 423 | int r=0; 424 | int b=0; 425 | char *arr; 426 | ccc=c; 427 | if(c==NULL){ 428 | ccc=newString(""); 429 | b=-1; 430 | }else{ 431 | ccc=c; 432 | } 433 | while (r!=1){ 434 | cccc=strchr(ccc,cc); 435 | if(cccc!=NULL){ 436 | if(count==0){ 437 | arr=newPointer(ccc); 438 | }else{ 439 | arr=addPointer(arr,ccc); 440 | } 441 | ccc=cccc+1; 442 | cccc[0]=0; 443 | count++; 444 | }else{ 445 | if(count==0){ 446 | arr=newPointer(ccc); 447 | }else{ 448 | arr=addPointer(arr,ccc); 449 | } 450 | r=1; 451 | } 452 | } 453 | if(b && ccc!=NULL)free(ccc); 454 | return arr; 455 | } 456 | char *ltrim(char *c){ 457 | char *cc=NULL; 458 | size_t t=0; 459 | size_t n=0; 460 | if(c!=NULL){ 461 | t=strlen(c); 462 | for(n=0;n32){ 464 | cc=c+n; 465 | n=t+2; 466 | }else{ 467 | if(c[n]==0){ 468 | cc=c+n; 469 | n=t+2; 470 | } 471 | } 472 | } 473 | } 474 | return cc; 475 | } 476 | char *rtrim(char *c){ 477 | char *cc; 478 | char *ccc; 479 | size_t t=0; 480 | size_t n=0; 481 | if (c==NULL){ 482 | cc=newString(""); 483 | }else{ 484 | cc=newString(c); 485 | } 486 | if(cc!=NULL){ 487 | ccc=cc; 488 | t=strlen(cc); 489 | for(n=0;n32){ 491 | ccc=cc+n; 492 | } 493 | } 494 | ccc[0]=0; 495 | } 496 | return cc; 497 | } 498 | 499 | 500 | 501 | char *returnNull(char *c){ 502 | char *cc; 503 | if(c==NULL){ 504 | cc=newString(""); 505 | }else{ 506 | cc=c; 507 | } 508 | return cc; 509 | } 510 | 511 | char *trim(char *c){ 512 | char *cc=NULL; 513 | if(c!=NULL){ 514 | cc=ltrim(c); 515 | cc=rtrim(cc); 516 | } 517 | return cc; 518 | } 519 | char *mid(const char *c,const int start,const int sizes){ 520 | char const *cc; 521 | int n=0; 522 | char *ccc; 523 | if(c!=NULL){ 524 | ccc=NULL; 525 | if (start<=(int) strlen(c)){ 526 | n=sizes; 527 | cc=c+start; 528 | n=(int) sizes; 529 | if (sizes>(int) strlen(cc))n=(int)strlen(cc); 530 | ccc=catNString(ccc,cc,(size_t) sizes); 531 | } 532 | } 533 | return ccc; 534 | } 535 | char *rigths(char *c,const int sizes){ 536 | char *cc; 537 | int n=0; 538 | cc=c; 539 | if (c!=NULL){ 540 | n=(strlen(c)-sizes); 541 | if (n<1)n=0; 542 | cc=c+n; 543 | } 544 | return cc; 545 | } 546 | char *lefths(char *c,const int sizes){ 547 | char *cc; 548 | char *ccc; 549 | int n=0; 550 | cc=c; 551 | ccc=NULL; 552 | if (c!=NULL){ 553 | n=(int)sizes; 554 | if (n>(int)strlen(c))n=(int)strlen(c); 555 | ccc=catNString(ccc,c,n); 556 | } 557 | return ccc; 558 | } 559 | char *edit(char *c,const int position,const int add,const char ch ){ 560 | char *cc; 561 | char *ccc; 562 | char *cp; 563 | cc=NULL; 564 | ccc=NULL; 565 | cp=NULL; 566 | if (c!=NULL && position>0 && add>0){ 567 | if(position<(int)strlen(c)){ 568 | ccc=strString(ch,add); 569 | cc=c+position; 570 | cp=newString(cc); 571 | cc[0]=0; 572 | cc=c; 573 | cc=catString(cc,ccc); 574 | frees(ccc); 575 | cc=catString(cc,cp); 576 | frees(cp); 577 | } 578 | } 579 | return cc; 580 | } 581 | void deledit(char *c,const int position,const int sub){ 582 | char *cc; 583 | char *ccc; 584 | char *cp; 585 | int n=0; 586 | cc=NULL; 587 | ccc=NULL; 588 | cp=NULL; 589 | if (c!=NULL && position>0 && sub>0){ 590 | if(position<(int)strlen(c)){ 591 | ccc=c+position; 592 | n=position-sub; 593 | if (n<1)n=0; 594 | cp=c+n; 595 | strcpy(cp,ccc); 596 | } 597 | } 598 | } 599 | char *ListToString(const char *cc,char ch){ 600 | int *i; 601 | char *c; 602 | char *s1; 603 | char chh[5]; 604 | int n; 605 | int count=0; 606 | s1=NULL; 607 | chh[0]=ch; 608 | chh[1]=0; 609 | if(cc!=NULL){ 610 | i=(int *) cc; 611 | count=*(i+0); 612 | s1=newString(""); 613 | for(n=0;n0)lst=newPointer(c); 639 | if(count>1){ 640 | for(n=1;n0)lst=newPointer(c); 672 | if(count>1){ 673 | for(n=1;n0){ 678 | lst=insertItem(lst,nn,c); 679 | nn=counts+1; 680 | } 681 | } 682 | counts++; 683 | } 684 | 685 | } 686 | } 687 | return lst; 688 | } 689 | char *newList(char *c){ 690 | char *cc; 691 | char *lst; 692 | cc=newString(c); 693 | lst=newPointer(cc); 694 | return lst; 695 | } 696 | char *addList(char *lst1,char *c){ 697 | char *cc; 698 | char *lst; 699 | cc=newString(c); 700 | lst=addPointer(lst1,cc); 701 | return lst; 702 | } 703 | void freeList(char *cc){ 704 | int *i; 705 | char *c; 706 | int n; 707 | int count=0; 708 | if(cc!=NULL){ 709 | i=(int *) cc; 710 | count=*(i+0); 711 | for(n=0;ncount)ssizes=count; 731 | if (sstarts>ssizes)sstarts=ssizes-1; 732 | for(n=sstarts;n'); 48 | print (s2); 49 | frees(s2); 50 | frees(s1); 51 | s1=newString("Hello ........World.."); 52 | deledit(s1,13,8); 53 | print (s1); 54 | frees(s1); 55 | return 0; 56 | } 57 | --------------------------------------------------------------------------------