Unable to load image

new emoji modal :horny:

Good morning sirs,

New emoji modal implementation just dropped like 10 hours ago, I am sure some burgers noticed. What changed?

  • now you can select options to make the emoji larger, mirrored or patted directly in the modal

  • better search performance: logarithmic time complexity in exchange of linear space complexity in the numbers of tags per emoji

  • better render performance, every time you make a search or change tab it won't re-generate the whole DOM from scratch; although there's still room for improvement

  • if you hover over an emoji you'll get some infos

  • emoji modal is well behaved, it won't try to overwrite a selection without your consent

  • emoji modal will let you know when your search query results in an empty set 💅

  • backend: now it is possible to add tags to non-marsey emojis


I hope this clears things up

![](/images/16518214146882863.webp)

82
Jump in the discussion.

No email address required.

better search performance: logarithmic time complexity in exchange of linear space complexity in the numbers of tags per emoji

I'm actually neurodivergent enough to want to know the details for this.

Jump in the discussion.

No email address required.

Jump in the discussion.

No email address required.

let mid = (low + high) >>> 1;

Ok now youre just showing off

Jump in the discussion.

No email address required.

I forgot than in JS you can do (low + high)//2 to use integer division and using floor() felt stupid

Jump in the discussion.

No email address required.

Anyone that uses bit shifts for division by multiples of 2 is based and redpilled tbh

Jump in the discussion.

No email address required.

Copyright (C) 2022 Dr Steven Transmisia, anti-hate engineer

fricking lol. Daily reminder that there's probably more algorithm design happening in that one js document than 99% of software devs will ever implement themselves (outside of school)

I don't JS on principal, is there a need in this case to unsigned right shift? Does js sometimes wrap around when bit shifting if both numbers are >= 0?

Jump in the discussion.

No email address required.

It's just a fancy division by 2 to get the mid index lol

Jump in the discussion.

No email address required.

In any event, I have a feeling that the true nerd approach would be to construct a radix tree. Should use less memory (I’m not sure about this part, js has interesting memory management) and be quite a bit faster, at least in theory. Not that it matters, this plenty good

Jump in the discussion.

No email address required.

I know, was wondering if it needed to be unsigned. Love your work

Jump in the discussion.

No email address required.

Link copied to clipboard
Action successful!
Error, please refresh the page and try again.