Skip to content

BenjaminCosman/combinatorics

View on GitHub ↗Related repositories →

This Python module supplements Python's itertools module, filling in gaps in the following areas of basic combinatorics: (A) ordered and unordered m-way combinations, (B) generalizations of the four basic occupancy problems (aka "balls in boxes"), and (C) constrained permutations, otherwise known as the off-by-m problem.

active 2026-06-252026-06-25 (UTC)

Complete coverage26,405 / 26,405 hourly files (100%) · 2 absent upstream2023-08-152026-08-19 (UTC)
Events
1
Pushes
0
Pull requests
0
Issues
0
Stars
0
Forks
0

Activity over time

Daily event counts in the loaded window

Line chart, 1 days from 2026-06-25 to 2026-06-25. Pushes: 0 total, peak 0 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 0 total, peak 0 in a day.

  • Pushes
  • Pull requests
  • Issues
  • Comments
  • Stars

Stars, PRs, issues and forks are under-captured in the later part of this window. GH Archive progressively stopped capturing non-push events during 2026 — −95% or worse by the end of the window. Every series here except Pushes fades for that reason, so a decline above reflects the archive, not this repository. Pushes stay reliable throughout, so read them, and the contributor counts derived from them, as the real signal. Data health has the measurements.

Top contributors

Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity

Nobody pushed, opened or commented here in the loaded window — this repo's activity is stars and forks only.

Recent activity

Latest issues, pull requests and releases

No issue or PR events — this repo's activity is pushes only.

Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 0 stars here means stars gained during the window, not the repo's star count.