It’s any unicode character that uses the zero-width joiner or other code points that are considered “invisible”. I opened an issue here: https://github.com/LemmyNet/lemmy/issues/3888.
Oh fucking lord. I made the mistake of attempting to look into the characters, so I could make a PR. It’s unicode, it’s fucking unicode, of course it’s a nightmare.
Yeah lol. It’s not a very difficult fix really. Rather than checking if the string contains any invisible characters, it should check if it only contains invisible characters. The way they’re doing it now unintentionally breaks a lot of stuff (breaking stuff unintentionally is a pretty common thing with unicode lol).
It’s any unicode character that uses the zero-width joiner or other code points that are considered “invisible”. I opened an issue here: https://github.com/LemmyNet/lemmy/issues/3888.
Oh fucking lord. I made the mistake of attempting to look into the characters, so I could make a PR. It’s unicode, it’s fucking unicode, of course it’s a nightmare.
Yeah lol. It’s not a very difficult fix really. Rather than checking if the string contains any invisible characters, it should check if it only contains invisible characters. The way they’re doing it now unintentionally breaks a lot of stuff (breaking stuff unintentionally is a pretty common thing with unicode lol).
It’s honestly easier to just check if it starts with those.
It is, yeah, which is why I suggested that in the issue :)
Hey, at least I get to laugh at unicode: “combining grapheme joiner”, “the name of this character is misleading; it does not actually join graphemes”.
Ahh ok, Thank you