align-toparrow-leftarrow-rightbackbellblockcalendarcamerachatcheckchevron-downchevron-leftchevron-rightchevron-small-downchevron-small-leftchevron-small-rightchevron-small-upchevron-upcircle-with-crosscrosseditfacebookglobegoogleimagesinstagramlocation-pinmagnifying-glassmailmoremuplabelShape 3 + Rectangle 1outlookpersonplusImported LayersImported LayersImported Layersshieldstartwitteryahoo

Laptop + Brain = Results

As May Mason once said, "Now is the time for all good people to cut some code." Tonight we'll be hacking in languages of all stripes, for the glory of the greater algorithm. It's like a pub quiz, but there's only one round and it's Programming.

As usual we're upstairs in the Crown & Anchor & the schedule is:

18:00 - Doors open. Arrive, chat, order food.
19:15 - Kickoff. Choose tonight's hack, form teams.
19:30 - Hack, Hack, Hack!
21:00 - Show & Tell.

After last month's musical hackery, there's a feeling in the air that there's no I we can't O, so let's see what May's hack night brings...

See you there,

Kris


Join or login to comment.

    • Ben V.

      By switching from boxed to unboxed vectors I got a 100x speedup!

      1 · May 16, 2014

    • Dominic S.

      That is very cool!

      May 16, 2014

    • Peter J.

      Good fun night. Of course, I have some after-the-event further thoughts... :)

      // Start with bitsPerElem...
      val bitsPerElem = 16
      val k = (bitsPerElem * 0.7).toInt
      val m = 1 << bitsPerElem

      // Stealing from Ben's, perhaps use Boolean for storage
      val storage = new Array[Boolean](m)

      The problem with both Array[Byte] and Array[Boolean] is that it's likely down to the compiler to decide if it's better or not to actually use an Array[Int] when implementing the array (for speed). My guess is it will.

      If storage should really be as small as possible - which was probably the idea here - another idea is to use "Array[Int](m / 32)", then split the hash into array position and bit position (of 32 positions) within that array position.

      May 15, 2014

  • Husam H.

    I enjoyed last night's event immensely. This group has gained a new 'regular' :)

    3 · May 15, 2014

  • Adam A.

    Python team's code:
    https://github.com/funkotron/inbloom

    Thanks again Kris for a year of brilliant hack nights :)

    1 · May 15, 2014

  • Kris J.

    Here's the Clojure team's code: https://github.com/krisajenkins/bloom

    Great fun as always. :-)

    May 15, 2014

  • edsykes

    Hi, an unfortunate clash with a work engagement. What time will you all be going with if my work engagement finishes early?

    May 14, 2014

    • Kris J.

      The coding finishes shortly after 9, but we'll be hanging around and talking tech until closing time. :-)

      May 14, 2014

  • Ciro I.

    Hi, i m not a programmer, but i d like learn and talk about this world. Am i welcome or it is only for professional?

    May 8, 2014

    • Kris J.

      You're completely welcome Ciro. Interest is the only requirement. :-)

      3 · May 8, 2014

People in this
Meetup are also in:

Sign up

Meetup members, Log in

By clicking "Sign up" or "Sign up using Facebook", you confirm that you accept our Terms of Service & Privacy Policy