WARNING! This is purely experimental code at this point! It doesn't work, and should not be used in your code!

Introduction

This is an implementation of the prolly tree data structure. It is designed to be asynchronous, concurrent, quick, and relatively light. All of the goals described below are currently aspirational. The work here is only in the planning stage.