Skip to content

Latest commit

 

History

History
235 lines (161 loc) · 8.37 KB

File metadata and controls

235 lines (161 loc) · 8.37 KB

Changelog

All notable changes to this project will be documented in this file.

The format is based on Keep a Changelog, and this project adheres to Semantic Versioning.

TODO: Rename this section when releasing a new version.
Types of changes: Added, Removed, Deprecated, Changed, Fixed

Added

  • doc: Add CHANGELOG.md (#189)

Changed

Fixed

1.1.0 - 2025-12-12

Added

  • feat(api): Add Derangements (#150)
  • Allow calling stirlings1 and stirlings2 with Integer arguments (#193)
  • Add multiset_permutations method that doesn't require length (#164)
  • doc: add more examples and test for partitions (#181)

Changed

  • Optimize permutations with low effort (no change in algorithm) (#184)
  • Optimize permutations by implementing it via multiset_permutations (#186)
  • ci: workaround for tagbot permissions (#183)
  • Bump actions/checkout from 4 to 5 (#198)
  • Bump actions/checkout from 5 to 6 (#202)
  • ci: use macos-15-intel (#203)

Fixed

  • Bugfix: include empty combination (#129)
  • Bugfix: let integer_partitions(0) == [Int[]] (#179)

1.0.3 - 2025-05-03

Added

  • doc: Add powerset(a) to README.md #106
  • doc: Add install instructions #111
  • doc: Setup Documenter #112
  • doc: add examples for permutations.jl #173
  • ci: MassInstallAction: Install the CI workflow on this repository #102
  • ci: enable dependabot for GitHub actions #131
  • ci: MassInstallAction: Install the CompatHelper workflow on this repository #145

Removed

  • Remove undef symbol gamma #178

Changed

  • performance: faster permutations, based on what rdeits suggested #122
  • performance: inline Base.iterate(c::Combinations, s) method to avoid allocations #148
  • performance: Improve performance of derangement/subfactorial with iterative implementation #146
  • performance: Make multiexponents type stable #136
  • performance: Improve factorial(n, k) performance for BigInt #149
  • ci: Test on latest Julia release as well #144
  • ci: reopen doctest #159
  • ci: update CI workflow (CI.yml, CompatHelper.yml, TagBot.yml) #160
  • ci: use codecov token #161
  • ci: run julia with default arch #174
  • ci: Many dependabot bump pr

Fixed

  • bugfix: Update hyperfactorial to handle the 0 and 1 condition #107
  • bugfix: Check overflow in multinomial #172
  • doc: narayana and prevprod tweaks #115
  • doc: fix documentation of multiset_permutations #141
  • doc: fix typo in levicivita doc #180
  • ci: fix doc deploy #153
  • ci: README: Update readme badge #154

1.0.2 - 2020-05-14

Added

Removed

  • Remove stale dependency on Polynomials.jl #94

Changed

Fixed

1.0.1 - 2020-04-22

Added

  • ci: Install TagBot as a GitHub Action #90

Removed

Changed

  • compat: Bump Polynomials compat to include v0.7, v0.8 #91

Fixed

1.0.0 - 2019-11-29

Added

  • Added lobbnum and Narayana numbers #76
  • Add partial derangements partialderangement #78
  • Add a Project file, remove REQUIRE, declare version 1.0 #88

Removed

Changed

  • Improve nthperm! argument checking #14
  • performance: Corrected and optimized bellnum #74
  • performance: Give access to non-allocating combinations iterator #73
  • performance: nthperm(): Replace one %= by a -= remainder - divisor computed earlier #55
  • performance: Make partitions type-stable #35
  • performance: Make partitions type-stable (deconflicted) #75
  • doc: readme: Remove reference to Base.combinations #77

Fixed

  • Fix deprecations for using lexcmp #70

0.7.0 - 2018-08-10

0.6.0 - 2018-03-31

0.5.0 - 2017-11-23

0.4.0 - 2017-03-17

0.3.0 - 2015-11-07

0.2.0 - 2015-11-06

0.1.1 - 2014-10-31

0.0.1 - 2014-03-17