diff --git a/CHANGELOG.md b/CHANGELOG.md --- a/CHANGELOG.md +++ b/CHANGELOG.md @@ -92,3 +92,11 @@ * Add Hype section to README * Some code and documentation cleanup + +## 1.0.1.4 -- 2025-01-07 + +* Bump version constraints on base and random + +* Test with new versions of GHC + +* Fix typos and make minor changes to README diff --git a/LICENSE b/LICENSE --- a/LICENSE +++ b/LICENSE @@ -1,6 +1,6 @@ MIT License -Copyright (c) 2024 Kyle Beechly +Copyright (c) 2024-2025 Kyle Beechly Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal diff --git a/README.md b/README.md --- a/README.md +++ b/README.md @@ -1,5 +1,16 @@ # Tensort [![Hackage](https://img.shields.io/hackage/v/tensort.svg)](https://hackage.haskell.org/package/tensort) + + "Super great stuff! kabeech dives into iid errors in comparison sorting, ropes + it, pulls it down, and hogties it six ways to Sunday." - + David H. Ackley + + + +------- + Tensort is a family of sorting algorithms that are tunable to adjust to the priorities of the task at hand. @@ -18,7 +29,7 @@      
- When sorting a randomly shuffled deck of cards, Quicksort makes 202 positional errors, Mergesort makes 201, Bubblesort makes 4, Tensort makes 51, Mundane Robustsort makes 11, and Magic Robustsort makes @@ -169,7 +180,7 @@       <figure> - <img src=
- When sorting a randomly shuffled deck of cards, Quicksort makes 202 positional errors, Mergesort makes 201, Bubblesort makes 4, Tensort makes 51, Mundane Robustsort makes 11, and Magic Robustsort makes 1 @@ -1077,7 +1088,7 @@      
- Michael Caine looking upset with Michael Standing
=4.3.0.0 && <= 4.20.0.1, + build-depends: base >=4.3.0.0 && < 4.22, mtl >= 2.2.2 && < 2.4, - random >= 1.0.0.3 && < 1.3, + random >= 1.0.0.3 && < 1.4, random-shuffle >= 0.0.4 && < 0.1, -- Directories containing source files.