// SPDX-License-Identifier: MIT
// Copyright (c) 2026 Incoprea
// Resolve aliases with cycle protection
// Not compiled or tested in-world
// Setup: Edit the small sample lists and touch as owner. These examples print previews only.
// Stop / restore: Remove or disable; no simulator objects or persistent records are changed.
// Notes: Alias keys must be unique. The traversal is bounded and reports loops rather than hanging; it does not execute the resolved text.
// License: see LICENSE in this distribution.
// Original Incoprea example. MIT.
list ALIASES=["old-lamp","garden-lamp","garden-lamp","lamp-v3"];
string START="old-lamp";
default
{
    touch_start(integer touches)
    {
        if(llDetectedKey(0)!=llGetOwner())return;
        if(llGetListLength(ALIASES)%2 || llGetListLength(ALIASES)>40)
        {
            llOwnerSay("Use up to 20 alias pairs.");
            return;
        }
        list keys;
        integer i;
        for(i=0;i<llGetListLength(ALIASES);i+=2)
        {
            string k=llList2String(ALIASES,i);
            if(k=="" || llListFindList(keys,[k])!=-1)
            {
                llOwnerSay("Empty or duplicate alias key.");
                return;
            }
            keys += [k];
        }
        string value=START;
        list visited;
        integer steps;
        while(steps<=20)
        {
            if(llListFindList(visited,[value])!=-1)
            {
                llOwnerSay("Alias cycle at "+value);
                return;
            }
            visited += [value];
            integer at=llListFindList(keys,[value]);
            if(at==-1)
            {
                llOwnerSay("Resolved: "+value+" via "+llList2CSV(visited));
                return;
            }
            value=llList2String(ALIASES,at*2+1);
            ++steps;
        }
        llOwnerSay("Traversal bound reached.");
    }
    changed(integer flags)
    {
        if(flags & CHANGED_OWNER)llResetScript();
    }
}