Ir para o conteúdo
debya
Português
Entrar Cadastre-se grátis
Ver no Bluesky Acompanhar esta conta

KG.cxx 💻

@aikathg.bsky.social did:plc:tmyif2lansps6apqfgleo4rc

Humano semi-funcional. As vezes posto coisas sobre programação, matemática, xadrez, músicas japonesas, etc. Coshuler, curso técnico em Informática e estudante de CC 🏳️‍🌈🏳️‍⚧️

No Bluesky desde

Seguidores
196
Seguindo
136
Posts
1.340
Dias nos rankings
0

Resumo

KG.cxx 💻 (@aikathg.bsky.social) é um usuário do Bluesky desde 29 agosto 2024. Tem 196 seguidores, segue 136 contas e publicou 1.340 posts.

Aparições nos rankings

Os melhores dias em que posts desta conta entraram na lista diária do Debya.

Esta conta ainda não apareceu em um ranking diário.

Posts curtidos recentemente

Curtidas públicas da rede Bluesky.

  • Andrew J. Bromage@pseudonym73.bsky.social

    For the array search part, don't forget that vector instructions exist these days. With SSE2, for example, you can do four 32-bit float comparisons in parallel, _mm_movemask to put the result in an integer register, then bsr/bsf on that. ARM Neon has all this too.

    Ver post
  • Andrew J. Bromage@pseudonym73.bsky.social

    If you have a lot of floats and you need to binary search, you can use this variant: unsigned logl = ceil_log_2(y.size()); int i = 0; for (unsigned k = 1 << (logl-1); k > 4; k >>= 1) { int t = i + k; if (yt >= y[t]) i = t; // Conditional move instruction }

    Ver post
  • Andrew J. Bromage@pseudonym73.bsky.social

    After this, i is now pointing at an aligned subsequence of four floats that you can do the vector comparison trick on. This is the fastest way I've found to do this kind of search on modern hardware, assuming that you can't exploit the distribution of y somehow (e.g. bucketing).

    Ver post
  • Jeff Silksong Coelho@jeffquesado.ulivre.dev

    Unfortunately I guess there is none. Perhaps a binary search can help, but I can't think of a O(1) algorithm

    Ver post
  • Calle Svensson@zetatwo.bsky.social

    I think this is a very sound approach. The rule of thumb I got from my friend who builds fuzzers is that for lists up to ~1000 elements, the fastest thing you can do is a linear search so a good initial guess plus that sounds optimal.

    Ver post

Entre para ver mais

Contas que bloqueia

No Bluesky, bloqueios são registros públicos.