mlemanczyk/Recyclable.Collections.Concurrent
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Added README.md & LICENSE.md to the package.

Browse Source
This commit is contained in:
Marek Lemańczyk committed 2023-03-17 01:08:09 +01:00
1 parent cad7768f54
commit f8003a6507
2 files changed
+30 -25
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

Recyclable.Collections.Concurrent/Recyclable.Collections.Concurrent.csproj
+29 -25
View File
@@ -1,30 +1,34 @@
<Project Sdk="Microsoft.NET.Sdk"> <Project Sdk="Microsoft.NET.Sdk">
<PropertyGroup> <PropertyGroup>
<TargetFramework>net6.0</TargetFramework> <TargetFramework>net6.0</TargetFramework>
<TargetFrameworks>net6.0;net7.0</TargetFrameworks> <TargetFrameworks>net6.0;net7.0</TargetFrameworks>
<ImplicitUsings>enable</ImplicitUsings> <ImplicitUsings>enable</ImplicitUsings>
<Nullable>enable</Nullable> <Nullable>enable</Nullable>
<GeneratePackageOnBuild>true</GeneratePackageOnBuild> <GeneratePackageOnBuild>true</GeneratePackageOnBuild>
<PackageId>Recyclable.Collections.Concurrent</PackageId> <PackageId>Recyclable.Collections.Concurrent</PackageId>
<PackageVersion>0.0.1-test</PackageVersion> <PackageVersion>0.0.1-test</PackageVersion>
<Authors>Marek Lemańczyk</Authors> <Authors>Marek Lemańczyk</Authors>
<Company>N/A</Company> <Company>N/A</Company>
<Product>Recyclable.Collections.Concurrent</Product> <Product>Recyclable.Collections.Concurrent</Product>
<PackageTags>Recyclable ArrayPool Array Pool List Sortable Sort Parallel Concurrent</PackageTags> <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> <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> <PackageProjectUrl>https://github.com/mlemanczyk/Recyclable.Collections.Concurrent</PackageProjectUrl>
<RepositoryUrl>https://github.com/mlemanczyk/Recyclable.Collections.Concurrent</RepositoryUrl> <RepositoryUrl>https://github.com/mlemanczyk/Recyclable.Collections.Concurrent</RepositoryUrl>
<Copyright>Marek Lemańczyk 2023</Copyright> <Copyright>Marek Lemańczyk 2023</Copyright>
<PackageLicenseFile>LICENSE.md</PackageLicenseFile> <PackageLicenseFile>LICENSE.md</PackageLicenseFile>
<PackageReadmeFile>README.md</PackageReadmeFile> <PackageReadmeFile>README.md</PackageReadmeFile>
<RepositoryType>git</RepositoryType> <RepositoryType>git</RepositoryType>
<PackageReleaseNotes>Test </PackageReleaseNotes> <PackageReleaseNotes>Test </PackageReleaseNotes>
</PropertyGroup> </PropertyGroup>
<ItemGroup> <ItemGroup>
<None Include="..\LICENSE.md" Link="LICENSE.md" /> <None Include="..\LICENSE.md" Pack="true" PackagePath="" Link="LICENSE.md">
<None Include="..\README.md" Link="README.md" /> <CopyToOutputDirectory>Always</CopyToOutputDirectory>
</ItemGroup> </None>
<None Include="..\README.md" Pack="true" PackagePath="" Link="README.md">
<CopyToOutputDirectory>PreserveNewest</CopyToOutputDirectory>
</None>
</ItemGroup>
</Project> </Project>
buy-me-a-coffee.svg
+1
View File
@@ -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>
Side by Side

After

Width:  |  Height:  |  Size: 1.4 KiB