PrioritySearchTree

Settings | Report Duplicate

0

I Use This!

Inactive

Commits : Listings

Analyzed about 23 hours ago. based on code collected 2 days ago.

Commit Message	Contributor	Files Modified	Lines Added	Lines Removed	Code Location	Date
Jun 19, 2025 — Jun 19, 2026 Showing page 2 of 3 Search / Filter on:
Fixed a bug where creating the tree would crash if n was one less than a power of 2	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Separated partitioning and sorting into their own class for ease of modular testing	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Proved that a full sort is necessary with the given buildTree algorithm.	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Added lots of testing code for build tree...there's a bug here somewhere	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Implemented simple stableInPlace01Partition	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Reimplemented explore using Knuth's algorithm	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Partial rewrite of array and pointer implementations to make the root point the highest point, to more easily compare the different implementations.	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Implemented enumerate3Sided	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Implemented highest3Sided	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Fixed a bug in leftMostNE where best X was not being checked	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Implemented highestNE	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Implemented leftMostNE	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Lots of cleanup	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Implemented insertionSort which should be good enough until 0,1 stable sort is implemented	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Building the in-place PST seems to work, verified for a tree of size 4	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Now calculating nodes at last level	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Now sorting in place by x-coordinate	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Created stub for new implementation	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Moved testing code into a single file	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Reorganization of file structure to remove duplication	Simon David Pratt as Simon Pratt	More...				about 15 years ago
No longer storing median X, since it is just as fast to query left child for max X, or right child for min X	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Removed iterative tree building	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Implemented an iterative version of buildTree	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Implemented a 3 bounded query that doesn't use stored median	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Merged in pointer branch	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Added some code to measure time taken for each operation	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Minor cleanup for testing against pointer version	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Got rid of 4 boundary searches	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Implemented maxYinRange	Simon David Pratt as Simon Pratt	More...				about 15 years ago
Implemented min/max X in range	Simon David Pratt as Simon Pratt	More...				about 15 years ago

←
1
2
3
→