Strahinja Val Markovic
30c9637992
Using the vector indexing suite from Boost.Python
...
This removes the need for a special overload for AddCandidatesToDatabase. Also,
the GetFuture function now provides a more sensible API with the list being
returned instead of accepted as an out parameter.
2012-07-08 15:34:44 -07:00
Strahinja Val Markovic
fb5d25fc81
The cpp file's header should be included first
2012-07-06 14:06:21 -07:00
Strahinja Val Markovic
174687c4bc
Renaming ConcurrentStack to ConcurrentLatestValue
2012-07-06 12:14:25 -07:00
Strahinja Val Markovic
5d6e839118
Newly inserted identifiers are added immediately
2012-05-12 15:20:03 -07:00
Strahinja Val Markovic
a8e9b61f3f
Going back to 2-4 threads
2012-05-11 10:09:52 -07:00
Strahinja Val Markovic
6e1c7f8429
Optimized the use of threads somewhat
2012-05-10 22:35:08 -07:00
Strahinja Val Markovic
ba76e3f6e6
List instead of vector for storing candidates
...
This should be faster because appending to a list is O(1), and only amort. O(1)
when appending to a vector.
2012-05-10 21:56:19 -07:00
Strahinja Val Markovic
0c0ecc24c4
Using custom collection of Boost libs
2012-05-09 21:45:30 -07:00