Perly Linked Lists: What they look like, and why bother Date: This event took place live on June 19 2013 Presented by: Steven Lembark Duration: Approximately 60 minutes. Cost: Free Questions? Please send email to webcast@oreilly.com Description:Linked lists are still useful even in the world of auto-extending arrays: for effective memory management and simpler threading. The first part of this webcast talk describes how to implement generic linked-list containers using Perl syntax; the second portion shows an efficient Object-oriented list manager that avoids the most common pitfalls of OO linked lists. About Steven LembarkSteven Lembark is a consultant working with ETL and automation code. 
|
|
|
|
Almost Done
Please confirm the information below before signing in.
{* #socialRegistrationForm *} {* socialRegistration_firstName *} {* socialRegistration_lastName *} {* socialRegistration_displayName *} {* socialRegistration_emailAddress *} {* providerName *} {* profileURL *} {* profilePreferredUsername *} {* profileIdentifier *}We will use your personal data in accordance with our Privacy Policy.