Bug#1011343: WISHLIST: Offical ALL-IN-ONE images?

2022-06-25 Thread Zhang Boyang
Hi, Some good news, I tested: 1) Build my unofficial DVD set (17 DVDs), and merge them using the merge script on my Debian machine. 2) Build my unofficial DLBD set (2 DLBDs), and merge them using the merge script on my Debian machine. 3) Merge 2 DLBDs using the merge script under a Alpine

Bug#1011343: WISHLIST: Offical ALL-IN-ONE images?

2022-06-25 Thread Thomas Schmitt
Hi, Zhang Boyang wrote: > These experiments all succeeded. Thank you very much! Good Job! :) Thank you for testing and challenging. I wrote: > > For now i decided to take the 50 seconds with dash. > if you really want to reduce runtime I would suggest using > `sort -s -u -k 2 merged_md5sum.txt

Re: bullseye CD/DVD for arm64

2022-06-25 Thread Cyril Brulebois
Hi, Wilhelm MOSER (2022-06-18): > Ja, das ist mir schon klar nur wenn debina das release macht dann muss doch > zumindest das notwendigste funktionieren. > Wenn in der LXDe dann bei XY die Maus nicht geht ist das eben ein bug wenn > ich das ding sber nich mal installieren kann dann setzt es aus.

Re: New Ukrainian Mirror

2022-06-25 Thread Cyril Brulebois
Hi Ivan, s...@ukr.net (2022-06-07): > Please add a new Debian CD mirror. > > Name: FastMirror > Site: https://fastmirror.pp.ua/ > Repo link: (http|https|rsync)://fastmirror.pp.ua/debian > and > (http|https|rsync)://fastmirror.pp.ua/debian-cd >

Re: New Ukrainian Mirror

2022-06-25 Thread Cyril Brulebois
Cyril Brulebois (2022-06-25): > Thanks for reaching out to us, but according to [1], you should be using > a form [2] instead. > > 1. https://www.debian.org/mirror/ftpmirror#submit > 2. https://www.debian.org/mirror/submit Sorry, I failed to notice you were requesting the addition of a regular

Bug#1011343: WISHLIST: Offical ALL-IN-ONE images?

2022-06-25 Thread Zhang Boyang
Hi, On 2022/6/26 03:30, Thomas Schmitt wrote: Complexity-wise this replaces a slow O(n) algorithm by a faster O(n) and an additional O(n * log(n)) run. At some size of Debian the slow speed of the linear loop will be compensated by the sorting complexity. But there is still room: A sort of 11,00