# toot 0.25.0 released
It's been a little while, enjoy. :)
* Show character count when composing (#121)
* Include changelog and license in sourceballs (#133)
* Fix searching by hashtag which include the '#' (#134)
* Upgrade search to v2 (#135)
* Fix compatibility with Python < 3.6 (don't use fstrings)
James Mickens - My Love Letter To Computer Science Is Very Short And I Also Forgot To Mail It
I love this guy.
I've known about snake_case and CamelCase for ages, but today I learned that lisps use kebab-case. :)
Radio blaring the same Christmas hits. But I have the antidote. https://www.youtube.com/watch?v=mxVo5mjK4eg
Cool article on butterflies.
Tickets for Brussels acquired. Confirming my presence at #fosdem 2020. \o/
So, an hour later I'm no wiser. :) Sounds like it should be pretty easy, and I'm possibly missing something obvious. If anyone knows the solution let me know.
This is trivially solved in code, and I've done so, but I like messing around with regexes and this would make me happy.
Finally, I tried matching the character in the lookbehind, and while this kind of thing works for a positive lookbehind, e.g. this matches any letter preceeded by itself:
It does not work for negative lookbehind. This does not match anything:
Another attempt was using the \K delimiter which allows for variable-length lookabehinds by matching anything before it and discarding it. However there is no negative variant of \K so it's of no use here.
But if you want to make it generic, e.g. match any letter, you might try using backreferences:
This produces the error: "lookbehind assertion is not fixed length" since the regex engine cannot know how big the backref is.
It's simple for a single character, e.g. the "c" from the example above:
This uses negative lookbehind and lookahead to make sure the two c's are not preceeded or followed by any other c's.
Tried solving today's #adventofcode using only regex, and it turns out that it's not easy to match a string containing any character consecutively repeated exactly 2 times (but no more).
For example, I want to match "abccd", but not "abcccd".
Server run by the main developers of the project It is not focused on any particular niche interest - everyone is welcome as long as you follow our code of conduct!