- Changes ArithPriorityQueue to use stl::vector<>'s plus stl's heap algorithms instea...
authorTim King <taking@cs.nyu.edu>
Thu, 24 Feb 2011 16:52:15 +0000 (16:52 +0000)
committerTim King <taking@cs.nyu.edu>
Thu, 24 Feb 2011 16:52:15 +0000 (16:52 +0000)
commitd21fc6157aa190944d9e3181de883c080cb6ce3f
tree589d4b4d0d90148eb71219c84e1db74abf34cfe7
parentc40d5678a4bbd73bde711149004206e37176661b
- Changes ArithPriorityQueue to use stl::vector<>'s plus stl's heap algorithms instead of stl's priority queue (which is really an stl vector plus the stl heap algorithms).  This offers more control of the underlying data structure.
src/theory/arith/arith_priority_queue.cpp
src/theory/arith/arith_priority_queue.h
src/theory/arith/simplex.cpp