projects / pspp / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 76a3cf1) | 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>
Sat, 29 Nov 2014 20:44:55 +0000 (12:44 -0800)
commit48ae4b998c76c9aaad4dca9090752cb9bd6e9f29
tree0be5df8f288545ee02b52dbe510e476a7e35c200tree | snapshot
parent76a3cf1c00e1dbd24075e7fbf0e1adffcdadbbb0commit | 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.