/[projects]/dao/FuldDaekningWorker/src/dk/daoas/fulddaekning/LookupMain.java |
Parent Directory | Revision Log
Sticky Revision: |
Switch to a K-d tree based implementation
int to short
arbejd med 2 dæknings sæt og lav den mindste mindre
Also cache all non-covered addresses in local memory
1) Brug en CyclicBarrier til at kordinerer main + worker threads 2) Træk alle dækkede adresser ud til at starte med og lav in memory søgning ud fra BBox for at finde søge sættet over dækkede adresser
threadpool - now it actually works
use a threadPool instead of launching 100's of threads
mere sikker auto-beregning af max-cores
Add auto-detect of max-workers
Move main() to it's own class
This form allows you to request diffs between any two revisions of this file. For each of the two "sides" of the diff, enter a numeric revision.
ViewVC Help | |
Powered by ViewVC 1.1.20 |