Combined Library
The Combined Library is comprised of about 40 functions all of which are released under CC-by v3.0 license.
The library is still being worked on so only some of the compiled functions will be posted at this time All functions in the library are hand optimized.
String Functions
str_replace
The design of the logic had to overcome two hurdles. The first was keeping it from searching previous replacements (otherwise you could fall into an infinite loop or infinitely grow the memory). The second was so that it could do null replacements. Both of these hurdles were overcome but at the cost of some readability.
The way it works is it keeps an Unsearched Buffer (UB) which is a subset of the Input Buffer (IB) and it records the Position of the UB in the IB (P). Each iteration it searches the UB and adds that resulting index to the P, then it uses P as the index to replace that section in the IB, finally it recalculates the new P, then is uses IB with the new P to update UB.
string str_replace(string src, string from, string to) {//replaces all occurrences of 'from' with 'to' in 'src'. integer len = (~-(llStringLength(from))); if(~len) { string buffer = src; integer b_pos = -1; integer to_len = (~-(llStringLength(to))); @loop;//instead of a while loop, saves 5 bytes (and run faster). integer to_pos = ~llSubStringIndex(buffer, from); if(to_pos) { // b_pos -= to_pos; // src = llInsertString(llDeleteSubString(src, b_pos, b_pos + len), b_pos, to); // b_pos += to_len; // buffer = llGetSubString(src, (-~(b_pos)), 0x8000); buffer = llGetSubString(src = llInsertString(llDeleteSubString(src, b_pos -= to_pos, b_pos + len), b_pos, to), (-~(b_pos += to_len)), 0x8000); jump loop; } } return src; }
Trim
string TrimRight(string src, string chrs) {//Trims characters from the right end of the string integer i = llStringLength(src); do;while(~llSubStringIndex(chrs, llGetSubString(src, i = ~ -i, i)) && i); return llDeleteSubString(src, -~i, 0xFFFF); } string TrimLeft(string src, string chrs) {//Trims characters from the left end of the string integer i = ~llStringLength(src); do;while(i && ~llSubStringIndex(chrs, llGetSubString(src, (i = -~i), i))); return llDeleteSubString(src, 0xFFFF0000, ~-i); } string TrimBoth(string src, string chrs) {//Trims characters from both ends of the string integer i = ~llStringLength(src); do;while(i && ~llSubStringIndex(chrs, llGetSubString(src, (i = -~i), i))); i = llStringLength(src = llDeleteSubString(src, 0xFFFF0000, (~-(i)))); do;while(~llSubStringIndex(chrs, llGetSubString(src, (i = ~-i), i)) && i); return llDeleteSubString(src, (-~(i)), 0xFFFF); }
List Functions
list_replace
The design of the logic had to overcome two hurdles. The first was keeping it from searching previous replacements (otherwise you could fall into an infinite loop or infinitely grow the memory). The second was so that it could do null replacements. Both of these hurdles were overcome but at the cost of some readability.
The way it works is it keeps an Unsearched Buffer (UB) which is a subset of the Input Buffer (IB) and it records the Position of the UB in the IB (P). Each iteration it searches the UB and adds that resulting index to the P, then it uses P as the index to replace that section in the IB, finally it recalculates the new P, then is uses IB with the new P to update UB.
list list_replace(list src, list from, list to) {//replaces all occurrences of 'from' with 'to' in 'src'. integer len = ~([] != from); if(~len) { list buffer = src; integer b_pos = -1; integer to_len = ~([] != to); @loop;//instead of a while loop, saves 5 bytes (and run faster). integer to_pos = ~llListFindList(buffer, from); if(to_pos) { // b_pos -= to_pos; // src = llListReplaceList(src, to, b_pos, b_pos + len); // b_pos += to_len; // buffer = llList2List(src, (-~(b_pos)), 0x4000); buffer = llList2List(src = llListReplaceList(src, to, b_pos -= to_pos, b_pos + len), (-~(b_pos += to_len)), 0x4000); jump loop; } } return src; }