Skip to content

Commit 7e34bc2

Browse files
committed
Add action to mirror commits to codeberg
1 parent 3a571b3 commit 7e34bc2

File tree

2 files changed

+26
-1
lines changed

2 files changed

+26
-1
lines changed
Lines changed: 25 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,25 @@
1+
# Copyright (c) 2025 Morwenn
2+
# SPDX-License-Identifier: MIT
3+
4+
name: Mirror Commits to Codeberg
5+
6+
on: [push, workflow_dispatch]
7+
8+
jobs:
9+
mirror-to-codeberg:
10+
name: Mirror to Codeberg
11+
12+
runs-on: ubuntu-latest
13+
14+
steps:
15+
- name: Checkout
16+
uses: actions/checkout@v5
17+
with:
18+
fetch-depth: 0
19+
20+
- name: Mirror
21+
uses: yesolutions/[email protected]
22+
with:
23+
REMOTE: 'https://codeberg.org/Morwenn/cpp-sort.git'
24+
GIT_USERNAME: Morwenn
25+
GIT_PASSWORD: ${{ secrets.GIT_PASSWORD }}

docs/Miscellaneous-utilities.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -373,7 +373,7 @@ auto m = get<foo_tag>(mm);
373373
#include <cpp-sort/utility/quicksort_adversary.h>
374374
```
375375

376-
`utility::quicksort_adversary` is a function template that implements an algorithm described by M. D. McIlroy in [*A Killer Adversary for Quicksort*][quicksort-adversary], which attempts to trigger the quadratic case of many quicksort implementations by trying to guess the pivot and forcing the testing comparison to perform a certain set of comparisons.
376+
`utility::quicksort_adversary` is a function template that implements an algorithm described by M. D. McIlroy in [*A Killer Adversary for Quicksort*][quicksort-adversary], which attempts to trigger the quadratic case of many quicksort implementations by trying to guess the pivot and forcing the tested algorithm to perform a certain set of comparisons.
377377

378378
```cpp
379379
template<typename Sorter, typename Integer>

0 commit comments

Comments
 (0)