haskell/stackage
1
0
Fork 0
mirror of https://github.com/commercialhaskell/stackage.git synced 2026-02-02 09:30:28 +01:00
Code Issues Actions Packages Projects Releases Wiki Activity

Merge pull request #5390 from galenhuntington/master

Browse Source 
Fix blog links.
This commit is contained in:
Joe Kachmar 2020-05-25 13:27:43 -04:00 committed by GitHub
commit e4491dd495
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
3 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
DATA-FLOW.md
View File

@ -26,7 +26,7 @@ There are three inputs into the data flow:
## Travis ## Travis
For [various For [various
reasons](https://www.fpcomplete.com/blog/2015/05/distributing-packages-without-sysadmin), reasons](https://tech.fpcomplete.com/blog/2015/05/distributing-packages-without-sysadmin),
we leverage Travis CI for running some processes. In particular: we leverage Travis CI for running some processes. In particular:
* [all-cabal-files](https://github.com/commercialhaskell/all-cabal-files/blob/hackage/.travis.yml) * [all-cabal-files](https://github.com/commercialhaskell/all-cabal-files/blob/hackage/.travis.yml)

2
MAINTAINERS.md
View File

@ -4,7 +4,7 @@ The idea behind Stackage is that, if all packages work with the newest versions
* All packages are buildable and testable from Hackage. We recommend [the Stack Travis script](https://docs.haskellstack.org/en/stable/travis_ci/), which ensures a package is not accidentally incomplete. * All packages are buildable and testable from Hackage. We recommend [the Stack Travis script](https://docs.haskellstack.org/en/stable/travis_ci/), which ensures a package is not accidentally incomplete.
* All packages are compatible with the newest versions of all dependencies (You can find restrictive upper bounds by visiting http://packdeps.haskellers.com/feed?needle=PACKAGENAME). * All packages are compatible with the newest versions of all dependencies (You can find restrictive upper bounds by visiting http://packdeps.haskellers.com/feed?needle=PACKAGENAME).
* All packages in a snapshot are compatible with the versions of libraries that ship with the GHC used in the snapshot ([more information on lenient lower bounds](https://www.fpcomplete.com/blog/2014/05/lenient-lower-bounds)). * All packages in a snapshot are compatible with the versions of libraries that ship with the GHC used in the snapshot ([more information on lenient lower bounds](https://tech.fpcomplete.com/blog/2014/05/lenient-lower-bounds)).
Packages in Stackage are not patched: all package changes occur upstream in Hackage. Packages in Stackage are not patched: all package changes occur upstream in Hackage.

6
README.md
View File

@ -20,7 +20,7 @@ We welcome all packages, provided:
* The package author/maintainer agrees to the [maintainers agreement](https://github.com/commercialhaskell/stackage/blob/master/MAINTAINERS.md). * The package author/maintainer agrees to the [maintainers agreement](https://github.com/commercialhaskell/stackage/blob/master/MAINTAINERS.md).
* The package is buildable and testable from Hackage. We recommend [the Stack Travis script](https://docs.haskellstack.org/en/stable/travis_ci/), which ensures a package is not accidentally incomplete. * The package is buildable and testable from Hackage. We recommend [the Stack Travis script](https://docs.haskellstack.org/en/stable/travis_ci/), which ensures a package is not accidentally incomplete.
* The package is compatible with the newest versions of all dependencies (You can find restrictive upper bounds by visiting http://packdeps.haskellers.com/feed?needle=PACKAGENAME). * The package is compatible with the newest versions of all dependencies (You can find restrictive upper bounds by visiting http://packdeps.haskellers.com/feed?needle=PACKAGENAME).
* The package is compatible with the versions of libraries that ship with GHC ([more information on lenient lower bounds](https://www.fpcomplete.com/blog/2014/05/lenient-lower-bounds)). * The package is compatible with the versions of libraries that ship with GHC ([more information on lenient lower bounds](https://tech.fpcomplete.com/blog/2014/05/lenient-lower-bounds)).
Full details on how to add and test a package can be found in the [maintainers agreement](https://github.com/commercialhaskell/stackage/blob/master/MAINTAINERS.md#adding-a-package). Full details on how to add and test a package can be found in the [maintainers agreement](https://github.com/commercialhaskell/stackage/blob/master/MAINTAINERS.md#adding-a-package).
@ -109,14 +109,14 @@ There are a number of answers to this question:
and packages depending on them - are fixed to GHC versions. Common and packages depending on them - are fixed to GHC versions. Common
examples of this are containers and transformers. There's a lot more examples of this are containers and transformers. There's a lot more
information on this in information on this in
[an FP Complete blog post](https://www.fpcomplete.com/blog/2014/05/lenient-lower-bounds) [an FP Complete blog post](https://tech.fpcomplete.com/blog/2014/05/lenient-lower-bounds)
__How long do you maintain an LTS build?__ __How long do you maintain an LTS build?__
We only guarantee that we will maintain a single LTS major version at We only guarantee that we will maintain a single LTS major version at
a time, and that it will be maintained for at least three months. This a time, and that it will be maintained for at least three months. This
is the is the
[originally proposed support window](https://www.fpcomplete.com/blog/2014/12/backporting-bug-fixes), [originally proposed support window](https://tech.fpcomplete.com/blog/2014/12/backporting-bug-fixes),
and hasn't changed since then. and hasn't changed since then.
That said, we do maintain the capability to keep multiple LTS runs That said, we do maintain the capability to keep multiple LTS runs