BEGIN:VCALENDAR PRODID;X-RICAL-TZSOURCE=TZINFO:-//Calagator//EN CALSCALE:GREGORIAN X-WR-CALNAME:Calagator METHOD:PUBLISH VERSION:2.0 BEGIN:VTIMEZONE TZID;X-RICAL-TZSOURCE=TZINFO:America/Los_Angeles BEGIN:DAYLIGHT DTSTART:20140309T020000 RDATE:20140309T020000 TZOFFSETFROM:-0800 TZOFFSETTO:-0700 TZNAME:PDT END:DAYLIGHT END:VTIMEZONE BEGIN:VEVENT CREATED;VALUE=DATE-TIME:20140423T224806Z DTEND;TZID=America/Los_Angeles;VALUE=DATE-TIME:20140513T210000 DTSTART;TZID=America/Los_Angeles;VALUE=DATE-TIME:20140513T180000 DTSTAMP;VALUE=DATE-TIME:20140423T224806Z LAST-MODIFIED;VALUE=DATE-TIME:20140510T040430Z UID:http://calagator.org/events/1250466061 DESCRIPTION:First talk at 7PM\, come early for networking\, or hacking.&# 13\;\n \;\n \;\nIntroduction to Splay Trees \;\n \;\nWhat\, why and how they can be used. I'll go over how splaying works\, how we u se it in OlegDB\, why it can be a better choice than binary trees for ce rtain situations and how the splaying algorithm can/can't be applied to other kinds of trees. \;\n \;\nQuinlan Pfiffer: OlegDB coauthor 3\;\n \;\n \;\n \;\nx86 machine language programming in the bas h shell \;\n \;\nCompilers\, and assemblers are seemingly magical programs that turn text into something the CPU can process directly. I d ecided the best way to demystify things was to implement my own solution . \;\n \;\nDaniel Johnson: pdxbyte founder\, and full stack techn ology generalist\n\nTags: C\, C++\, cpp\, ASM\, assembly\, compiled\, ru st\, epdx:group=pdxbyte\n\nImported from: http://calagator.org/events/12 50466061 URL:http://pdxbyte.org SUMMARY:pdxbyte users group (C/C++/Assembly) LOCATION:New Relic: 111 SW 5th Avenue\, Suite 2700\, Portland Oregon 9720 4 United States SEQUENCE:2 END:VEVENT END:VCALENDAR