From f8003a65079652a678ef5fa790e10975592c4587 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Marek=20Lema=C5=84czyk?= <marek@lemanczyk.eu>
Date: Fri, 17 Mar 2023 01:08:09 +0100
Subject: [PATCH] Added README.md & LICENSE.md to the package.

---
 .../Recyclable.Collections.Concurrent.csproj  | 54 ++++++++++---------
 buy-me-a-coffee.svg                           |  1 +
 2 files changed, 30 insertions(+), 25 deletions(-)
 create mode 100644 buy-me-a-coffee.svg

diff --git a/Recyclable.Collections.Concurrent/Recyclable.Collections.Concurrent.csproj b/Recyclable.Collections.Concurrent/Recyclable.Collections.Concurrent.csproj
index 6805e15..0d48adf 100644
--- a/Recyclable.Collections.Concurrent/Recyclable.Collections.Concurrent.csproj
+++ b/Recyclable.Collections.Concurrent/Recyclable.Collections.Concurrent.csproj
@@ -1,30 +1,34 @@
 <Project Sdk="Microsoft.NET.Sdk">
 
-  <PropertyGroup>
-	<TargetFramework>net6.0</TargetFramework>
-	<TargetFrameworks>net6.0;net7.0</TargetFrameworks>
-	<ImplicitUsings>enable</ImplicitUsings>
-	<Nullable>enable</Nullable>
-	<GeneratePackageOnBuild>true</GeneratePackageOnBuild>
-	<PackageId>Recyclable.Collections.Concurrent</PackageId>
-	<PackageVersion>0.0.1-test</PackageVersion>
-	<Authors>Marek Lemańczyk</Authors>
-	<Company>N/A</Company>
-	<Product>Recyclable.Collections.Concurrent</Product>
-	<PackageTags>Recyclable ArrayPool Array Pool List Sortable Sort Parallel Concurrent</PackageTags>
-	<Description>Recyclable.Collections.Concurrent project is an open source framework targeting at providing parallel operations on dynamic lists, using recyclable memory arrays. It aims at providing minimal memory footprint.</Description>
-	<PackageProjectUrl>https://github.com/mlemanczyk/Recyclable.Collections.Concurrent</PackageProjectUrl>
-	<RepositoryUrl>https://github.com/mlemanczyk/Recyclable.Collections.Concurrent</RepositoryUrl>
-	<Copyright>Marek Lemańczyk 2023</Copyright>
-	<PackageLicenseFile>LICENSE.md</PackageLicenseFile>
-	<PackageReadmeFile>README.md</PackageReadmeFile>
-	<RepositoryType>git</RepositoryType>
-	<PackageReleaseNotes>Test </PackageReleaseNotes>
-  </PropertyGroup>
+	<PropertyGroup>
+		<TargetFramework>net6.0</TargetFramework>
+		<TargetFrameworks>net6.0;net7.0</TargetFrameworks>
+		<ImplicitUsings>enable</ImplicitUsings>
+		<Nullable>enable</Nullable>
+		<GeneratePackageOnBuild>true</GeneratePackageOnBuild>
+		<PackageId>Recyclable.Collections.Concurrent</PackageId>
+		<PackageVersion>0.0.1-test</PackageVersion>
+		<Authors>Marek Lemańczyk</Authors>
+		<Company>N/A</Company>
+		<Product>Recyclable.Collections.Concurrent</Product>
+		<PackageTags>Recyclable ArrayPool Array Pool List Sortable Sort Parallel Concurrent</PackageTags>
+		<Description>Recyclable.Collections.Concurrent project is an open source framework targeting at providing parallel operations on dynamic lists, using recyclable memory arrays. It aims at providing minimal memory footprint.</Description>
+		<PackageProjectUrl>https://github.com/mlemanczyk/Recyclable.Collections.Concurrent</PackageProjectUrl>
+		<RepositoryUrl>https://github.com/mlemanczyk/Recyclable.Collections.Concurrent</RepositoryUrl>
+		<Copyright>Marek Lemańczyk 2023</Copyright>
+		<PackageLicenseFile>LICENSE.md</PackageLicenseFile>
+		<PackageReadmeFile>README.md</PackageReadmeFile>
+		<RepositoryType>git</RepositoryType>
+		<PackageReleaseNotes>Test </PackageReleaseNotes>
+	</PropertyGroup>
 
-  <ItemGroup>
-	<None Include="..\LICENSE.md" Link="LICENSE.md" />
-	<None Include="..\README.md" Link="README.md" />
-  </ItemGroup>
+	<ItemGroup>
+		<None Include="..\LICENSE.md" Pack="true" PackagePath="" Link="LICENSE.md">
+			<CopyToOutputDirectory>Always</CopyToOutputDirectory>
+		</None>
+		<None Include="..\README.md" Pack="true" PackagePath="" Link="README.md">
+			<CopyToOutputDirectory>PreserveNewest</CopyToOutputDirectory>
+		</None>
+	</ItemGroup>
 
 </Project>
diff --git a/buy-me-a-coffee.svg b/buy-me-a-coffee.svg
new file mode 100644
index 0000000..5dac9fa
--- /dev/null
+++ b/buy-me-a-coffee.svg
@@ -0,0 +1 @@
+<svg xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" width="236" height="20" role="img" aria-label="Buy me a coffee"><title>Buy me a coffee</title><linearGradient id="s" x2="0" y2="100%"><stop offset="0" stop-color="#bbb" stop-opacity=".1"/><stop offset="1" stop-opacity=".1"/></linearGradient><clipPath id="r"><rect width="236" height="20" rx="3" fill="#fff"/></clipPath><g clip-path="url(#r)"><rect width="137" height="20" fill="#555"/><rect x="137" width="99" height="20" fill="#4c1"/><rect width="236" height="20" fill="url(#s)"/></g><g fill="#fff" text-anchor="middle" font-family="Verdana,Geneva,DejaVu Sans,sans-serif" text-rendering="geometricPrecision" font-size="110"><text aria-hidden="true" x="695" y="150" fill="#010101" transform="scale(.1)" textLength="auto"><a href="https://www.buymeacoffee.com/mlemanczyk">Buy me a coffee</a></text><text x="695" y="140" transform="scale(.1)" fill="#fff" textLength="auto"><a href="https://www.buymeacoffee.com/mlemanczyk"/></text><text aria-hidden="true" x="705" y="150" fill="#010101" fill-opacity=".3" transform="scale(.1)" textLength="890">Buy me a coffee</text><text x="695" y="142" transform="scale(.1)" fill="#fff" textLength="auto"><a href="https://www.buymeacoffee.com/mlemanczyk">Buy me a coffee</a></text><text aria-hidden="true" x="1890" y="142" fill="#010101" transform="scale(.1)" textLength="auto"><a href="https://www.buymeacoffee.com/mlemanczyk">$1 - $10</a></text></g></svg>
\ No newline at end of file