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:STANDARD DTSTART:20101107T020000 RDATE:20101107T020000 RDATE:20111106T020000 RDATE:20121104T020000 RDATE:20131103T020000 RDATE:20141102T020000 RDATE:20151101T020000 RDATE:20161106T020000 RDATE:20171105T020000 RDATE:20181104T020000 RDATE:20191103T020000 TZOFFSETFROM:-0700 TZOFFSETTO:-0800 TZNAME:PST END:STANDARD BEGIN:DAYLIGHT DTSTART:20110313T020000 RDATE:20110313T020000 RDATE:20120311T020000 RDATE:20130310T020000 RDATE:20140309T020000 RDATE:20150308T020000 RDATE:20160313T020000 RDATE:20170312T020000 RDATE:20180311T020000 RDATE:20190310T020000 TZOFFSETFROM:-0800 TZOFFSETTO:-0700 TZNAME:PDT END:DAYLIGHT END:VTIMEZONE BEGIN:VEVENT CREATED;VALUE=DATE-TIME:20110208T232607Z DTEND;TZID=America/Los_Angeles;VALUE=DATE-TIME:20110215T113000 DTSTART;TZID=America/Los_Angeles;VALUE=DATE-TIME:20110215T103000 DTSTAMP;VALUE=DATE-TIME:20110208T232607Z LAST-MODIFIED;VALUE=DATE-TIME:20110208T232607Z UID:http://calagator.org/events/1250459772 DESCRIPTION:Presented by Johan Tibell. \;\n \;\nThe most commonly u sed map (dictionary) data type in Haskell is implemented using a size ba lanced tree. While size balanced trees provide good asymptotic performan ce\, their real world performance is not stellar\, especially when used with keys which are expensive to compare\, such as strings. \;\n \ ;\nIn this talk we will look at two different map implementations that u se hashing to achieve better real world performance. The implementations have different performance characteristics: one provides very fast look -ups while the other trades better insert performance for somewhat slowe r look-ups. I will describe the design of these data structures and show some early benchmark results.\n\nTags: galois\, tech talk\, haskell\, d ata structures\n\nImported from: http://calagator.org/events/1250459772 URL:http://corp.galois.com/blog/2011/2/8/tech-talk-faster-persistent-data -structures-through-hashing.html SUMMARY:Galois Tech Talk: Faster Persistent Data Structures Through Hashi ng LOCATION:Galois\, Inc: 421 SW 6th Ave. Suite 300\, Portland OR 97204 US SEQUENCE:1 END:VEVENT BEGIN:VEVENT CREATED;VALUE=DATE-TIME:20110524T194146Z DTEND;TZID=America/Los_Angeles;VALUE=DATE-TIME:20110527T143000 DTSTART;TZID=America/Los_Angeles;VALUE=DATE-TIME:20110527T130000 DTSTAMP;VALUE=DATE-TIME:20110524T194146Z LAST-MODIFIED;VALUE=DATE-TIME:20110524T234707Z UID:http://calagator.org/events/1250460642 DESCRIPTION:Scrap Your Zippers: A Generic Zipper \;\nfor Heterogeneous Types \;\n \;\nMichael Adams\, Indiana University \;\n \;\ nAbstract \;\nThe zipper type provides the ability to efficiently edi t tree-shaped data in a purely functional setting by providing constant time edits at a focal point in an immutable structure. It is used in a n umber of applications and is widely applicable for manipulating tree-sha ped data structures. \;\n \;\nThe traditional zipper suffers from two major limitations\, however. First\, it operates only on homogeneou s types. That is to say\, every node the zipper visits must have the sam e type. In practice\, many tree-shaped types do not satisfy this conditi on\, and thus cannot be handled by the traditional zipper. Second\, the traditional zipper involves a significant amount of boilerplate code. A custom implementation must be written for each type the zipper traverses . This is error prone and must be updated whenever the type being traver sed changes. \;\n \;\nThe generic zipper presented in this talk ov ercomes these limitations. It operates over any type and requires no bo ilerplate code to be written by the user. The only restriction is that t he types traversed must be instances of the Data class from the Scrap yo ur Boilerplate framework. \;\n \;\nBiography \;\nMichael D. Ada ms will be completing his Ph.D. in Computer Science at Indiana Universit y this summer. He has a B.S. in Computer Science\, a B.S in Computer En gineering and a Minor in Mathematics from the University of Kansas. \;\n \;\nHis research interests are the implementation and constructi on of programming languages\, compilers and software analysis tools that help programmers more easily implement\, reason about\, prove correct a nd improve the performance of their programs. This includes areas such as type systems\, static analysis\, control-flow analysis\, compilers an d optimization. \;\n \;\nIn spring 2007\, he worked on the X10 lan guage for an internship at IBM Research. In summer 2007\, he worked on t he Glasgow Haskell Compiler at Microsoft Research. In 2008-2010 he worke d for Cadence Research on the Chez Scheme compiler. \;\n \;\nHe is an avid swing dancer and cyclist.\n\nTags: cs\, functional\, data struc tures\n\nImported from: http://calagator.org/events/1250460642 URL:http://www.cs.pdx.edu/ SUMMARY:PSU CS Colloquium: Scrap Your Zippers: A Generic Zipper for Heter ogeneous Types LOCATION:Portland State University FAB\, Room 86-09: 1900 SW Fourth Avenu e\, Portland Oregon 97201 US SEQUENCE:4 END:VEVENT BEGIN:VEVENT CREATED;VALUE=DATE-TIME:20200114T223833Z DTEND;TZID=America/Los_Angeles;VALUE=DATE-TIME:20200208T120000 DTSTART;TZID=America/Los_Angeles;VALUE=DATE-TIME:20200208T110000 DTSTAMP;VALUE=DATE-TIME:20200114T223833Z LAST-MODIFIED;VALUE=DATE-TIME:20200114T223833Z UID:http://calagator.org/events/1250476690 DESCRIPTION:In this Meetup\, we're going to have fun coding together\, so bring your laptop if you can. Our plan is to run through coding example s from https://www.freecodecamp.org/. I'll give you a problem\, you can try to solve it\, then we'll work on it together. We'll be going through the JavaScript algorithms and data structures section. \;\n \;\nY ou're welcome to join us and code other projects as well. \;\n \;\ nBe inspired! \;\nKnowledge Mavens\n\nTags: javascript\, data structu res\, algorithms\, programming\, software development\, engineering\, co mputer science\n\nImported from: http://calagator.org/events/1250476690 URL:https://www.meetup.com/KnowledgeMavens/events/267906538/ SUMMARY:JavaScript Coding Follow Along LOCATION:Portland Community Church: 7100 Southwest Scholls Ferry Road\, B eaverton OR 97008 US SEQUENCE:1 END:VEVENT END:VCALENDAR