keneanung

-- pattern:
-- \b(?|(black)-(\w+)|(\w+)-(black)|(black))\b

-- alternative pattern (less readable but easier to use when copy pasting as only one occurence of a colour needs to be changed):
-- (?(DEFINE)(black))\b(?|((?1))-(\w+)|(\w+)-((?1))|((?1)))\b

-- tests:
-- black solid-black black-hued [works]
-- test haired test eyed test red-haired blue-eyed [works]
-- scarred red [works]

keneanung

Done:

• Use ccache to speed up builds
• Document SDK installation on windows (Done by Vadi)
• Add automated coverity scans
• Check Windows MinGW 5.3 issues (see Mudlet/Mudlet#1176)
• Fix technical debts:
  • Correct file count for lcf
  • Remove sourced-in zziplib code
  • Update boost
• Install updated 7-zip (see https://www.cisecurity.org/advisory/a-vulnerability-in-7-zip-could-allow-for-arbitrary-code-execution_2018-049/)

keneanung

I merged this list with https://gist.github.com/keneanung/9e69479609a0b59ac6d5dd61ecc27771

keneanung

Keybase proof

I hereby claim:

• I am keneanung on github.
• I am keneanung (https://keybase.io/keneanung) on keybase.
• I have a public key whose fingerprint is C86C 916D A8DE 6AFA C841 D6B0 9466 DDE3 7294 7F5B

To claim this, I am signing this object:

keneanung

tempAlias("^kconfig bashing addTarget \\w*?(\\d+)$", [[
  for _, item in ipairs(keneanung.bashing.room) do
    if item.id == matches[2] then
      keneanung.bashing.addPossibleTarget(item.name)
      return
    end
  end
]])

keneanung

import System.Environment
import Data.List
import Control.Monad


--Remember: foldM for list monads uses EACH element as input for the next fold!!
queen :: Int -> [[Int]]
queen n = foldM foldingFunction [] [1..n]
  where
    -- Our folding function. It works like this: 

keneanung

-- Script name: catchFirstChanged

-- User defined event handler: keneanung.bashing.targetList.firstChanged

function catchFirstChanged(newTarget)
  echo("Our new target is " .. newTarget)
end