Skip to content

Comments

feat(SimpleGraph): taking twice from a walk equals taking the minimum#35292

Open
Rida-Hamadani wants to merge 17 commits intoleanprover-community:masterfrom
Rida-Hamadani:Walk.take_take
Open

feat(SimpleGraph): taking twice from a walk equals taking the minimum#35292
Rida-Hamadani wants to merge 17 commits intoleanprover-community:masterfrom
Rida-Hamadani:Walk.take_take

Conversation

@Rida-Hamadani
Copy link
Collaborator

this is an analogue to List.take_take.


Open in Gitpod

@github-actions
Copy link

github-actions bot commented Feb 14, 2026

PR summary 60d0c4b32a

Import changes for modified files

No significant changes to the import graph

Import changes for all files
Files Import difference

Declarations diff

+ take_take

You can run this locally as follows
## summary with just the declaration names:
./scripts/declarations_diff.sh <optional_commit>

## more verbose report:
./scripts/declarations_diff.sh long <optional_commit>

The doc-module for scripts/declarations_diff.sh contains some details about this script.


No changes to technical debt.

You can run this locally as

./scripts/technical-debt-metrics.sh pr_summary
  • The relative value is the weighted sum of the differences with weight given by the inverse of the current value of the statistic.
  • The absolute value is the relative value divided by the total sum of the inverses of the current values (i.e. the weighted average of the differences).

@github-actions github-actions bot added the t-combinatorics Combinatorics label Feb 14, 2026
@Rida-Hamadani Rida-Hamadani changed the title feat(SimpleGraph): taking twice from a walk is equivalent to taking the minimum feat(SimpleGraph): taking twice from a walk equals taking the minimum Feb 14, 2026
Co-authored-by: Snir Broshi <26556598+SnirBroshi@users.noreply.github.com>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

t-combinatorics Combinatorics

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants