projects / pspp / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: cefdafc) | patch
sort: Change priority queue implementation from heap to binary tree.
authorBen Pfaff <blp@cs.stanford.edu>
Sat, 20 Mar 2010 05:18:15 +0000 (22:18 -0700)
committerBen Pfaff <blp@cs.stanford.edu>
Mon, 3 May 2010 04:29:21 +0000 (21:29 -0700)
commit7c96e98d5ee26ca08d9d31e84b08e79f1183663d
tree1877f82179b91fe785939919ceecb1ed3c6e72e5tree | snapshot
parentcefdafcfaac44a96cade3fc1db68c8eeeb718fabcommit | diff
sort: Change priority queue implementation from heap to binary tree.

This is not so great in itself--it is probably a wash for performance,
and might be a loss--but it does make it possible to discover duplicate
sort keys while reading the data, which will be useful in an upcoming
commit.
src/math/sort.c diff | blob | history
Unnamed repository; edit this file to name it for gitweb.