Data Structures and Benchmarking for Pharo [Large - 350h]

This project introduces a library of 7 data structures to the Pharo ecosystem, replacing O(N) bottlenecks with resilient, mathematically proven structures (including B Trees, K-D Trees, and Persistent Arrays). Following a full design approach, the implementations will be stress-tested using Competitive Programming datasets to guarantee architectural integrity under heavy load. Finally, the project utilizes VM-level tools (TimeProfiler and MemoryProfiler) to empirically benchmark performance, delivering production-ready infrastructure alongside interactive visual inspectors.