PowTrees.LINQPad
0.1.1
There is a newer version of this package available.
See the version list below for details.
See the version list below for details.
dotnet add package PowTrees.LINQPad --version 0.1.1
NuGet\Install-Package PowTrees.LINQPad -Version 0.1.1
This command is intended to be used within the Package Manager Console in Visual Studio, as it uses the NuGet module's version of Install-Package.
<PackageReference Include="PowTrees.LINQPad" Version="0.1.1" />
For projects that support PackageReference, copy this XML node into the project file to reference the package.
paket add PowTrees.LINQPad --version 0.1.1
The NuGet Team does not provide support for this client. Please contact its maintainers for support.
#r "nuget: PowTrees.LINQPad, 0.1.1"
#r directive can be used in F# Interactive and Polyglot Notebooks. Copy this into the interactive tool or source code of the script to reference the package.
// Install PowTrees.LINQPad as a Cake Addin #addin nuget:?package=PowTrees.LINQPad&version=0.1.1 // Install PowTrees.LINQPad as a Cake Tool #tool nuget:?package=PowTrees.LINQPad&version=0.1.1
The NuGet Team does not provide support for this client. Please contact its maintainers for support.
PowTrees
Table of content
Introduction
Tree structure with algorithms
Usage
JSON Serialization
TNod<T> root;
var jsonOpt = new JsonSerializerOptions();
jsonOpt.Converters.Add(NodConverterFactory.Instance);
var str = JsonSerializer.Serialize(root, jsonOpt);
var rootOut = JsonSerializer.Deserialize<TNod<T>>(str, jsonOpt)!;
FoldL
Map a tree recursively. For each node, we use the node and the mapped parent as input
Signature:
static TNod<U> FoldL<T, U>(
this TNod<T> root,
Func<TNod<T>, U, U> fun,
U seed
);
Example:
record Rec(int Val, int Ofs); // where Ofs is an offset we want to apply to Val
// root =
// ┌►(30,0)
// │
// (10,0)──►(20,3)─┤ ┌►(50,0)
// └►(40,6)─┤
// └►(60,1)
// 1. Apply Ofs on the node and its descendents:
// ---------------------------------------------
root.FoldL((nod, acc) => acc + nod.V.Ofs, 0)
┌►3
│
0──►3─┤ ┌►9
└►9─┤
└►10
// 2. Apply Ofs on the node descendents only:
// ------------------------------------------
root.FoldL((nod, acc) => acc + nod.ParentOr(e => e.Ofs, 0), 0)
┌►3
│
0──►0─┤ ┌►9
└►3─┤
└►9
// 3. Create a dictionary from the nodes to their accumulators
// -----------------------------------------------------------
root.Zip(root.FoldL(fun))
.ToDictionary(
e => e.First.V,
e => e.Second.V
);
As these cases are quite common, there are some utility functions to implement them easily:
static TNod<U> FoldL_Parent<T, U>(
this TNod<T> root,
Func<T, U> get,
Func<U, U, U> fun,
U seed
);
static IReadOnlyDictionary<T, U> FoldL_Dict<T, U>(
this TNod<T> root,
Func<T, U, U> fun,
U seed
) where T : notnull;
static IReadOnlyDictionary<T, U> FoldL_Parent_Dict<T, U>(
this TNod<T> root,
Func<T, U> get,
Func<U, U, U> fun,
U seed
) where T : notnull;
Build a node lookup map
If you transform a tree (A) into tree (B) without changing its shape (just changing the node content, not children). Very often, you then need to map the nodes of B back to A. For this use:
static IReadOnlyDictionary<TNod<T>, TNod<U>> BuildNodeLookup<T, U>(TNod<T> rootSrc, TNod<U> rootDst);
var lookupMap = TreeUtils.BuildNodeLookup(B, A);
License
MIT
Product | Versions Compatible and additional computed target framework versions. |
---|---|
.NET | net6.0-windows7.0 is compatible. net7.0-windows was computed. net8.0-windows was computed. net8.0-windows7.0 is compatible. |
Compatible target framework(s)
Included target framework(s) (in package)
Learn more about Target Frameworks and .NET Standard.
NuGet packages
This package is not used by any NuGet packages.
GitHub repositories
This package is not used by any popular GitHub repositories.
Version | Downloads | Last updated |
---|---|---|
0.1.2 | 126 | 6/30/2024 |
0.1.1 | 112 | 6/30/2024 |
0.1.0 | 113 | 6/30/2024 |
0.0.48 | 166 | 9/15/2023 |
0.0.47 | 130 | 9/3/2023 |
0.0.46 | 149 | 8/23/2023 |
0.0.45 | 131 | 8/22/2023 |
0.0.44 | 184 | 8/5/2023 |
0.0.43 | 157 | 7/30/2023 |
0.0.42 | 154 | 7/18/2023 |
0.0.41 | 157 | 7/15/2023 |
0.0.40 | 154 | 7/15/2023 |
0.0.39 | 155 | 7/12/2023 |
0.0.38 | 158 | 7/12/2023 |
0.0.37 | 174 | 7/11/2023 |
0.0.36 | 156 | 7/10/2023 |
0.0.35 | 151 | 7/10/2023 |
0.0.34 | 152 | 7/9/2023 |
0.0.33 | 148 | 7/8/2023 |
0.0.32 | 149 | 7/5/2023 |
0.0.31 | 154 | 7/5/2023 |
0.0.30 | 163 | 7/5/2023 |
0.0.29 | 152 | 7/4/2023 |
0.0.28 | 155 | 7/2/2023 |
0.0.27 | 141 | 6/21/2023 |
0.0.26 | 139 | 6/20/2023 |
0.0.25 | 138 | 6/20/2023 |
0.0.24 | 145 | 6/15/2023 |
0.0.23 | 144 | 6/15/2023 |
0.0.22 | 139 | 6/15/2023 |
0.0.21 | 145 | 6/12/2023 |
0.0.20 | 144 | 6/12/2023 |
0.0.19 | 149 | 6/5/2023 |
0.0.18 | 132 | 6/3/2023 |
0.0.17 | 139 | 6/3/2023 |
0.0.16 | 133 | 6/1/2023 |
0.0.15 | 139 | 5/31/2023 |
0.0.14 | 133 | 5/28/2023 |
0.0.13 | 136 | 5/28/2023 |
0.0.12 | 133 | 5/12/2023 |
0.0.10 | 150 | 4/24/2023 |
0.0.9 | 155 | 4/24/2023 |
0.0.8 | 311 | 12/4/2022 |
0.0.7 | 316 | 11/26/2022 |
0.0.6 | 311 | 11/26/2022 |