balmeyer, to random
@balmeyer@piaille.fr avatar

Je suis allé manger avant de déclarer avoir faim, économisant ainsi un message inutile sur ce réseau.

sebsauvage, to firefox French
@sebsauvage@framapiaf.org avatar


Voici un script Python qui va faire du nettoyage (VACUUM, une sorte de "compactage") de toutes les bases SQLite de Firefox.
À faire tourner dans le répertoire de votre profile (taper about:profiles pour trouver le répertoire)

https://sebsauvage.net/paste/?e8596837d8ad95fa#hPyELDDgud3qmMFdUZE52s7rdY/8n9sP8MuLj2Laykw=

nbwpuk, to wordpress
nbwpuk, to wordpress

" 6.4 comes with several enhancements to the wp_get_loading_optimization_attributes() function which was introduced in 6.3 as a central place to manage loading attributes, specifically for images and iframes."

Image loading optimization enhancements in 6.4 – Make WordPress Core https://make.wordpress.org/core/2023/10/18/image-loading-optimization-enhancements-in-6-4/

ColinTheMathmo, to random
@ColinTheMathmo@mathstodon.xyz avatar

More information about this:

https://mathstodon.xyz/@ColinTheMathmo/111179219517536920

My previous counting had an error, so I'm reposting.

I want to create a schedule with as few clashes as possible ... a perfect tournament is clearly impossible via pigeonhole.

Counting a clash as

  • Being paired with the same player twice
  • Playing against the same player twice

I now have a tournament with 19 clashes. Which is an odd number in both senses.

Can anyone do better?

I'll recap the details in a reply to this post.

ColinTheMathmo,
@ColinTheMathmo@mathstodon.xyz avatar

I'd be really happy if people boosted this for reach, but I think I'm pretty much done now. I'm sure this has been done to death elsewhere, but nothing I've read seems to be easily adaptable to this context. If feels like it's just a but minimisation problem with lots of nasty combinatorics.




hywan, to ArtificialIntelligence
@hywan@fosstodon.org avatar

A second look at array layouts, https://espindo.la/posts/array-layouts.html.

This article presents an algorithm about a branch-less binary-search, and compares performances across compilers (clang and gcc).

AllanBarte, to random French
@AllanBarte@mastodon.social avatar

Don de Bernard Arnault : ne nous leurrons pas. La charité coûte bien moins cher aux super-riches que l'impôt juste qu'ils devraient payer.
Et ce, sans compter, ici, le bénéfice d'une opération médiatique menée avec la complicité du gouvernement.

Si toi aussi tu es milliardaire, c'est par là :
▶️ https://ko-fi.com/allanbarte

▶️ Source : https://www.francetvinfo.fr/replay-radio/le-vrai-du-faux/vrai-ou-faux-le-don-de-bernard-arnault-aux-restos-du-c-ur-represente-t-il-0-004-de-sa-fortune-personnelle-comme-l-affirme-alexis-corbiere_6020147.html

datascience, to random

Polars is a lightning fast DataFrame library/in-memory query engine with parallel execution and cache efficiency. And now you can use is with the tidyverse syntax: https://www.tidypolars.etiennebacher.com/

  • All
  • Subscribed
  • Moderated
  • Favorites
  • megavids
  • cubers
  • rosin
  • mdbf
  • Youngstown
  • love
  • slotface
  • khanakhh
  • ngwrru68w68
  • kavyap
  • Durango
  • thenastyranch
  • DreamBathrooms
  • magazineikmin
  • provamag3
  • cisconetworking
  • GTA5RPClips
  • osvaldo12
  • InstantRegret
  • tacticalgear
  • ethstaker
  • everett
  • modclub
  • anitta
  • tester
  • Leos
  • normalnudes
  • JUstTest
  • All magazines