My idea is, I want to distribute a patch.
But I build my patches with layers of abstractions.
So I want to make a recursive map of the dependency tree, including any external libraries needed, so I can know what needs to be included when I distribute the patch.
Has anyone tried this?
I will probably do this with an external program, probably Perl (not within Pd).
First it seems I really need to understand how to Pd does conflict resolution in case of name clashes.
Next, it seems one must know the search path.
This is a bit easier on Linux systems b/c it just requires parsing a flat file.
On Windows it requires parsing the Registry (which I admit is still a big mystery for me).
On My machine, I am finding the search path here:
HKEY_USERS\S-1-5-21-1970324843-3388967453-2642309065-1000\Software\Classes\VirtualStore\MACHINE\SOFTWARE\Wow6432Node\Pd\
npath=12 means 12 directories to search, each being path1=(path1) path2=(path2) ... path12=(path12)
I also find this repeated here:
HKEY_USERS\S-1-5-21-1970324843-3388967453-2642309065-1000_Classes\VirtualStore\MACHINE\SOFTWARE\Wow6432Node\Pd
One question is, where does this strange string come from? Is this guaranteed to be the same on every Windows systems?
S-1-5-21-1970324843-3388967453-2642309065-1000 S-1-5-21-1970324843-3388967453-2642309065-1000_Classes
Ugh. Anyway, just looking for some general guidance here.
Thanks, BH