Most recent activity
-
I remember it being a little wet when cooking the chicken, so it was hard ti get the slight crisped edges (I think I over-yoghurted the marinade).
Here's another one that's been good enough it's written up (https://www.theguardian.com/lifeandstyle/2010/dec/11/game-recipes-hugh-fearnley-whittingstall)
-
-
Also Felicity Cloake, this chicken tikka recipe: https://www.theguardian.com/lifeandstyle/wordofmouth/2014/apr/24/how-to-cook-perfect-chicken-tikka-masala
can confirm the korma recipe is good.
-
-
I like Richard Baxter's work https://www.richardbaxter.co.uk/ranges#/111/
-
If you don't actually need a regular expression, eg you're using PCRE or similar, then you want a negative lookahead:
(beatrix(?!ie)|(?!bea)trixie)
It is possible to do it with standard regular expressions (since every regular language can be negated), but it's much more painful.
Edit: for completeness, here's what that would look like:
(?:(?:(?:[^b]|b(?:b|eb)*?(?:[^be]|e[^ab]))*?(?:b(?:b|eb)*e?)??(trixie))|(?:(beatrix)(?:(?:[^i]|i+[^ei])*?i*?)))
(?: )
is a non-capturing group,*?
and??
are lazy (rather than greedy) matching, negations constructed using this tool http://www.formauri.es/personal/pgimeno/misc/non-match-regex/As you can see, it gets messy fast.
-
I have a refurbed (all but as new) humanscale world, which didn't break the bank at ~£150; has been very comfortable, from https://studiomodern.co.uk/product/humanscale-graphite-diffrient-world-chair-2/
-
-
Bitsets ftw
#[inline] fn unique(s: &[u8], n: usize) -> bool { s.iter() .fold(0u32, |acc, &c| acc | (1u32.wrapping_shl(c as u32))) .count_ones() == n as u32 } fn solve(inp: &[u8], n: usize) -> usize { if let Some((i, _)) = inp.windows(n).enumerate().find(|(_, win)| unique(win, n)) { i + n } else { unreachable!() } } pub fn part1(inp: &[u8]) -> usize { solve(inp, 14) } pub fn part2(inp: &[u8]) -> usize { solve(inp, 14) }
-
Person, occasional wit.