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:20160313T020000 RDATE:20160313T020000 TZOFFSETFROM:-0800 TZOFFSETTO:-0700 TZNAME:PDT END:DAYLIGHT END:VTIMEZONE BEGIN:VEVENT CREATED;VALUE=DATE-TIME:20160927T232527Z DTEND;TZID=America/Los_Angeles;VALUE=DATE-TIME:20161004T220000 DTSTART;TZID=America/Los_Angeles;VALUE=DATE-TIME:20161004T180000 DTSTAMP;VALUE=DATE-TIME:20160927T232527Z LAST-MODIFIED;VALUE=DATE-TIME:20160927T232945Z UID:http://calagator.org/events/1250470883 DESCRIPTION:We'll have pizza &\; beer starting at 6pm\, so stop by ear ly if you want to have dinner and socialize before the presentations. 3\;\n \;\n##PRESENTATIONS at 7pm \;\n \;\nHow do *you* get from cat to dog? Ryan Wise will talk about his project that: \;\n \;\ n"\;illustrates breadth-first search and A* search in Ruby and solve s the following example problem: \;\nFind the fewest edits it takes to transform one word into another with all intermediate words being fou nd in a dictionary. E.g.\, a shortest transformation from "\;cat&qu ot\; to "\;dog"\; could look like this: cat-->\; cot--> \; dot-->\; dog. Note that each step represents one edit (one letter changed\, added\, or subtracted) and that each edit lands us on another dictionary word. This pattern continues until the target word is foun d."\; \;\n \;\nLauren Voswinkel will round off this months mee tup with a code-retreat exercise. \;\n \;\n"\;We'll take 30-45 minutes to work on Conway's Game of Life. Pair programming is *highly* encouraged\, but is not required. This month we will just be talking abo ut the problem and getting a feel for the problem set. In subsequent mon ths\, we'll be doing the same exercise\, however\, there will be restric tions put in place to force us to think about our code and our designs m ore in depth. After each coding exercise\, we'll take some time to talk about what we learned during the exercise\, as well as what approaches w orked and what didn't. The whole idea of this exercise is to have a spac e and time to actively practice coding."\; \;\n \;\n**Please B ring Your Laptops** \;\n \;\nAfter presentations we'll have more s ocializing time. \;\n \;\n##**Thanks to New Relic for providing th e venue and beer\, pizza &\; snacks this month!** \;\n \;\n \;\nARRIVING BY BIKE? Cyclists are welcome to park their bikes in the Ne w Relic office. Bikes are not allowed in the building lobby\, however\, and must use the freight elevator. To get your bike up to the 29th floor \, enter the building's parking lot by going down the ramp at 5th and Pi ne. Go past the booth -- no need to pick up a ticket -- and turn right. Go straight until you almost run into the elevator lobby\, then go right again. On the back side of the elevator block you'll see a beat up pair of double doors marked "\;freight elevator."\; You can get up b y buzzing in with the intercom\, and saying you're here for New Relic. R ide on up to the 29th floor\, you'll easily find the bike parking. \; \n \;\nABOUT THE GROUP: *The Portland Ruby Brigade\, also known as pd xruby and pdx.rb\, is a user group for Ruby programmers in the Portland\ , Oregon area. The group welcomes all programmers interested in the lang uage and its implementations\, tools\, libraries and frameworks\, such a s Ruby on Rails. The group has been meeting since August 2002 for presen tations\, demos and discussions. Every month 35-75 people come together to share their knowledge\, projects and enthusiasm for Ruby. If you'd li ke to present or have a topic you'd like discussed\, please post to the mailing list. The group usually meets on the first Tuesday of the month\ , "\;Ruby Tuesday"\; -- see you there!* \;\n\n\nImported from : http://calagator.org/events/1250470883 URL:http://pdxruby.org/ SUMMARY:Portland Ruby Brigade monthly meeting LOCATION:New Relic: 111 SW 5th Avenue\, Suite 2700\, Portland Oregon 9720 4 United States SEQUENCE:3 END:VEVENT END:VCALENDAR