mirror of
https://github.com/zap-proto/cs.git
synced 2026-10-30 15:05:32 +00:00
zeekay
2aa8261f86
Finishes the in-flight capnp→ZAP rebrand on this branch. The prior commits
renamed identifiers/namespaces/files/projects (Capnp.Net.Runtime→Zap.Net.Runtime,
CapnpC→ZapC, .capnp→.zap) but left the human-readable brand name "Cap'n Proto"
throughout doc-comments, .csproj/.nuspec descriptions, README, MSBuild .xaml
rule display names, and the generated XML doc. This completes brand neutrality:
- Replace 154 "Cap'n Proto" / 4 "Cap'n-Proto" / 1 "Cap'n'p" prose occurrences
with "ZAP" across 32 first-party files (runtime, generator, zapc-csharp,
MSBuild integration, chocolatey nuspecs, README, docs, XML doc).
- Revert the LICENSE provenance URL to the real upstream fork
(c80k/capnproto-dotnetcore) — upstream-fork license headers must stay.
- Canonicalize project/repo URLs to github.com/zap-proto/cs (were fabricated
c80k/zap-dotnetcore) in csproj/nuspec/VERIFICATION/README badges.
- Canonicalize docs URLs zap-protocol(.github.io|/zap-cs|/zap-cpp-core)
→ zap-proto.dev / github.com/zap-proto/{cs,cpp-core}.
- Collapse redundant "zap \"ZAP\"" PackageTags to "zap".
Verified consistent (no toolchain on host): every .sln/.csproj ProjectReference
resolves; all namespaces are Zap*/ZapC*; MSBuild task chain
(GenerateZapFileCodeBehindTask, ZapFiles ItemGroup, _ZapcCsharp_TaskAssembly)
is uniformly renamed; props/targets/xaml/coverage/chocolatey carry no capnp.
Deliberately preserved as upstream-derived test data (not first-party source):
upstream Cap'n Proto schema fixtures (rpc.zap, rpc-twoparty.zap, json.zap,
rpc-csharp.zap), golden compiler-error outputs (errors.txt), and the
machine-generated DO-NOT-EDIT test.zap.{c++,h}. Their "Cap'n Proto" strings are
the literal output of the external schema compiler the compat test matches.
99 lines
2.5 KiB
C#
99 lines
2.5 KiB
C#
using Microsoft.Extensions.Logging;
|
|
using System;
|
|
using System.Collections.Generic;
|
|
|
|
namespace Zap.Net.Runtime.Tests
|
|
{
|
|
public class DecisionTree
|
|
{
|
|
readonly ILogger Logger = Logging.CreateLogger<DecisionTree>();
|
|
|
|
readonly List<bool> _decisions = new List<bool>();
|
|
readonly Stack<int> _freezeStack = new Stack<int>();
|
|
int _pos, _freezeCounter;
|
|
|
|
public DecisionTree()
|
|
{
|
|
_freezeStack.Push(0);
|
|
}
|
|
|
|
public DecisionTree(params bool[] initialDecisions): this()
|
|
{
|
|
_decisions.AddRange(initialDecisions);
|
|
}
|
|
|
|
public bool MakeDecision()
|
|
{
|
|
if (_pos >= _decisions.Count)
|
|
{
|
|
_decisions.Add(false);
|
|
}
|
|
|
|
try
|
|
{
|
|
return _decisions[_pos++];
|
|
}
|
|
catch (ArgumentOutOfRangeException)
|
|
{
|
|
Logger.LogError($"WTF?! {_pos - 1}, {_decisions.Count}");
|
|
throw;
|
|
}
|
|
}
|
|
|
|
public void Freeze()
|
|
{
|
|
_freezeStack.Push(_pos);
|
|
}
|
|
|
|
public bool NextRound()
|
|
{
|
|
_pos = 0;
|
|
|
|
for (int i = 0; i < _freezeCounter; i++)
|
|
_freezeStack.Pop();
|
|
|
|
while (_freezeStack.Count > 1)
|
|
{
|
|
int end = _freezeStack.Pop();
|
|
int begin = _freezeStack.Peek();
|
|
|
|
for (int i = end - 1; i >= begin; i--)
|
|
{
|
|
if (_decisions[i] == false)
|
|
{
|
|
_decisions[i] = true;
|
|
_freezeStack.Clear();
|
|
_freezeStack.Push(0);
|
|
return true;
|
|
}
|
|
//else
|
|
//{
|
|
// _decisions.RemoveAt(i);
|
|
//}
|
|
}
|
|
|
|
++_freezeCounter;
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
public override string ToString()
|
|
{
|
|
return "[" + string.Join("|", _decisions) + "]";
|
|
}
|
|
|
|
public void Iterate(Action testMethod)
|
|
{
|
|
Logger.LogInformation("Starting decision-tree based combinatorial test");
|
|
int iter = 0;
|
|
do
|
|
{
|
|
Logger.LogInformation($"Iteration {iter}: pattern {ToString()}");
|
|
testMethod();
|
|
++iter;
|
|
} while (NextRound());
|
|
}
|
|
}
|
|
}
|