ListPool.csproj

<Project Sdk="Microsoft.NET.Sdk">

  <PropertyGroup>
    <TargetFrameworks>netstandard2.1;netstandard2.0</TargetFrameworks>
    <Nullable>enable</Nullable>
    <LangVersion>latest</LangVersion>
    <Authors>Fausto David Suarez Rosario</Authors>
    <Title>ListPool</Title>
    <AssemblyName>ListPool</AssemblyName>
    <PackageId>ListPool</PackageId>
    <Description>
      ListPool and ValueListPool are optimized allocation free implementations of IList using ArrayPool.

      Changelog:
      * Performance enhancement in the method AddRange(T[] items) for ListPool and ValueListPool
      * ValueListPool now can be created with parameterless constructor 

      ListPool is the general use of the implementation, we recommend to use ListPool for most of the cases. ValueListPool is the zero heap allocations implementation, it is optimal working along stackalloc initial buffer for small lists. Note, because it is a struct it is passed by value, not by reference.
    </Description>
    <PackageTags>ASP.NET;List;System.Buffers;ArrayPool;ListPool;Performance;Span</PackageTags>
    <RepositoryUrl>https://github.com/faustodavid/ListPool</RepositoryUrl>
    <GeneratePackageOnBuild>true</GeneratePackageOnBuild>
    <PackageLicenseFile>LICENSE</PackageLicenseFile>
    <PackageVersion>2.3.3-beta</PackageVersion>
    <PackageReleaseNotes>
      Changelog:
      * Performance enhancement in the method AddRange(T[] items) for ListPool and ValueListPool
      * ValueListPool now can be created with parameterless constructor 
    </PackageReleaseNotes>
    <Copyright>Copyright © Fausto David Suarez Rosario 2020</Copyright>
  </PropertyGroup>

  <ItemGroup>
    <None Include="..\..\LICENSE">
      <Pack>True</Pack>
      <PackagePath></PackagePath>
    </None>
  </ItemGroup>

  <ItemGroup>
    <PackageReference Include="System.Memory" Version="4.5.3" />
  </ItemGroup>

</Project>