// SPDX-License-Identifier: MIT
// Copyright (c) 2026 Incoprea
// Apply a noncascading character map
// Not compiled or tested in-world
// Setup: Edit the sample inputs, then touch as owner.
// Stop / restore: Remove or disable. All transformations are previews in owner chat.
// Notes: Each map key must be exactly one character. First matching map entry wins; generated replacements are never mapped again.
// License: see LICENSE in this distribution.
// Original Incoprea example. MIT.
string TEXT="A&B<C";
list MAP=["&","and","<"," before "];
default
{
    touch_start(integer touches)
    {
        if(llDetectedKey(0)!=llGetOwner())return;
        if(llGetListLength(MAP)%2)
        {
            llOwnerSay("Incomplete map.");
            return;
        }
        integer i;
        for(i=0;i<llGetListLength(MAP);i+=2)if(llStringLength(llList2String(MAP,i))!=1)
        {
            llOwnerSay("Map keys must be single characters.");
            return;
        }
        string result="";
        for(i=0;i<llStringLength(TEXT);++i)
        {
            string c=llGetSubString(TEXT,i,i);
            integer j;
            integer found;
            for(j=0;j<llGetListLength(MAP);j+=2)if(!found && llList2String(MAP,j)==c)
            {
                result+=llList2String(MAP,j+1);
                found=TRUE;
            }
            if(!found)result+=c;
        }
        llOwnerSay(result);
    }
    changed(integer flags)
    {
        if(flags & CHANGED_OWNER)llResetScript();
    }
}