Waffle on GitHub: https://github.com/hyperrealgopher/waffle
Waffle on Matrix (official chat): https://matrix.to/#/!ErxkIgxbsTfPysApWD:privacytools.io?via=privacytools.io
It's very weird to me that there's no cheap rackmount HDD bays. I only need power and a nice bay system for the HDDs.
The install script for Broadcom MSM totally messed up my Debian install...
Downloads/ $ ls
zsh: command not found: ls
git_prompt_info:3: permission denied: /dev/null
I have a rackmount server I administrate with a #vt320 terminal. Today I just built and installed my own DAS (basically an overglorified rackmount external HDD enclosure supporting many HDDs) using a spare rackmount server case (which I eventually want to replace in the future, because it's very unfriendly for installing and removing HDDs and cannot hold many).
I was inspired by this guide: https://www.serverbuilds.net/16-bay-das
#tarcat should be finished soon. I just have to add nice onscreen instructions for all the shortcuts, a way to print out a key to stdout or to file, and a nice key viewer/editor. Sorry for the lack of docs
The point of #tarcat is to make managing all your tapes and their keys very easy by using a barcode system. You should be able to use this application for any backup medium, though. RDX also uses barcodes! However, you can use any unique identifier, not just barcodes.
I should add its useful for compressing anything/creating archives in general too!
I don't see enough people talk about what a great tool #zpaq is! It's a wonderful and easy-to-use CLI journaling archiver for incremental backups that uses one of the best compression algorithms. It also has support for password/encryption.
> Minimum number of characters to delete from a string so that each character appears unique number of times. Note: You can delete all occurrences of characters.
I did a coding puzzle and then benchmarked it against my friend's solutions as well as some Haskeller experts' solution which was actually functional.
> A binary gap within a positive integer N is any maximal sequence of consecutive zeros that is surrounded by ones at both ends in the binary representation of N.
I'm not a big fan of lens in #Haskell due to the weird/cryptic errors that can occur and all the magic that happens with them. I thought I was being ignorant, but some Haskell experts told me that sometimes lens is awful and magic like that.
I was challenged to a coding puzzle! Counting the largest amount of 0s between two instances of 1 in binary representations of integers!
An interesting conversation ensued about how conversion from integer to binary is o(1) if the integers are bounded!
Fosstodon is an English speaking Mastodon instance that is open to anyone who is interested in technology; particularly free & open source software.