public static void Test1_basic_LL_tests()
{
LL <int> empty_int = null;
foreach (var node in empty_int.chain("foo", 3).chain("bar", 4).LIFO())
{
Console.WriteLine(node.name + " " + node.pay); // mainly to test chaining from null
}
// hmm thats neat :)
// also single assignment. empty int is still null
D.Assert(empty_int.LIFO().ToArray().SequenceEqual(new LL <int> [0]));
D.Assert(empty_int.LIFO_shadowed().ToArray().SequenceEqual(new LL <int> [0]));
AUX.AssertThrows <LL_Exception> (() => empty_int.findPay("any key -- the LL is empty "));
var zing = ((LL <string>)null).
chain("v1", "val1").
chain("v2", "boioioioioiing").
chain("v1", "shadowed");
foreach (var node in zing.LIFO_shadowed())
{
Console.WriteLine(node.name + " " + node.pay);
}
AUX.AssertThrows <LL_Exception> (() => zing.findNode("non present key"));
Console.WriteLine("================= LL ok ============= ");
}
public IEnumerable <Ref> refs()
{
var seen = new HashSet <string>();
foreach (var n in ownLL_head.LIFO())
{
if (!seen.Contains(n.name))
{
seen.Add(n.name);
yield return(LL2Ref(n));
}
}
foreach (var n in origLL_head.LIFO())
{
if (!seen.Contains(n.name))
{
seen.Add(n.name);
yield return(LL2Ref(n));
}
}
}
public static IEnumerable <LL <T> > LIFO_shadowed <T> (this LL <T> node_in)
{
var seen = new HashSet <string>();
foreach (var node in node_in.LIFO())
{
if (!seen.Contains(node.name))
{
seen.Add(node.name);
yield return(node);
}
}
}
public CH_deltaScope instantiate() // resolves all preCHs , triggers their instantiation to proper CHs
// using the decl interface is too headscratchy, becuase the original order between decls and refs (not within them) would have to be reconstructed ( self shadowing )
{
LL <TypedCH> CHdelt_own = null;
foreach (var n in ownLL_head.LIFO().Reverse())
{
CHdelt_own = CHdelt_own.chain(n.name, n.pay.CH);
}
LL <TypedCH> CHdelt_externals = null;
foreach (var n in externals.LIFO().Reverse())
{
CHdelt_externals = CHdelt_externals.chain(n.name, n.pay.CH);
}
return(new CH_deltaScope(origScope, CHdelt_own, CHdelt_externals));
}
