<html><head><meta http-equiv="content-type" content="text/html; charset=utf-8"></head><body dir="auto"><span style="background-color: rgba(255, 255, 255, 0);">Lookup Data Structures in the FreeBSD Kernel, Firecrow Slivernight<br><a href="x-apple-data-detectors://0" dir="ltr" x-apple-data-detectors="true" x-apple-data-detectors-type="calendar-event" x-apple-data-detectors-result="0" style="text-decoration-color: rgba(0, 0, 0, 0.258824);">2019-05-01 @ 18:45</a> - Suspenders, <a href="x-apple-data-detectors://1" dir="ltr" x-apple-data-detectors="true" x-apple-data-detectors-type="address" x-apple-data-detectors-result="1" style="text-decoration-color: rgba(0, 0, 0, 0.258824);">108 Greenwich Street</a>; typically on the<br>second floor, otherwise on the first<br>Abstract<br><br>Lookup Data Structures in the FreeBSD Kernel will be a tour of Red/Black<br>Trees and Radix trees as they appear in the source code. An overview of<br>what problem the structure solves as well as an in depth look at the<br>call strucuture of each will be covered. The structures will also be<br>compared to assess their strengths/weaknesses for example red black<br>trees are organized to rebalence on write and be stateless on read,<br>whereas radix trees have a more predicable insertion method.<br><br><br><br>More Info:<br><a href="https://www.nycbug.org/index?action=view&id=10667" dir="ltr" x-apple-data-detectors="true" x-apple-data-detectors-type="link" x-apple-data-detectors-result="2">https://www.nycbug.org/index?action=view&id=10667</a></span><br><div dir="ltr"><div><br></div></div></body></html>