Immanuel Haffner

I suppose a simpler (and faster) solution to computing the number of bits required can be found [here](https://users.rust-lang.org/t/logarithm-of-integers/8506/5). While this gives you `floor(log2(x))`, we can use it to implement `ceil(log2(x))`...

Oh man... this PR is one and a half years old by now. I may or may not give it another attempt to get this merged. Not in the near...

It's appreciated, thanks!

Well, i ditched tree-sitter-based features for the most part and use LSP semantic tokens instead. It's probably slower, but also nicer. You can have different Highlight groups for local variables...

Hey @rasulomaroff , thanks for the quick response. I meant it *enters* insert mode. I did already see the comment you linked and I am using that workaround. Still, I...

Highlights are not affected. Sure, let's see what Telescope folks have to say. So far, they say it may be because of a nvim issue that has already been fixed...

@oxfist what is needed to get this in?

Very cool. I am no longer maintaining this so idk when and if I find time to review and merge. Let's see if folks from UdS can do it

CC @lucagretscher @marcelmaltry

Sure, would be great to have. FYI you can also check out [our GitLab CI config](https://gitlab.cs.uni-saarland.de/bigdata/mutable/mutable/-/blob/main/.gitlab-ci.yml?ref_type=heads) to learn how mu*t*able is built and tested