Guest User

Untitled

a guest
Oct 18th, 2017
65
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.91 KB | None | 0 0
  1. int entrycondition1 = 10;
  2. // int entrycondition1 = arrayOfDifferentEntryConditions[threadIdx.x];
  3. int exitcondition1 = 5;
  4. // int exitcondition1 = arrayOfDifferentExitConditions[threadIdx.x];
  5.  
  6.  
  7.  
  8. int numberofentries = 0;
  9. int culumnArrayLines = 10000000;
  10.  
  11. for (int n = 0; n < culumnArrayLines; n++) { //outerloop
  12. bool contin = false;
  13.  
  14. if (comparecolumn1[n] > entrycondition1 && contin == false) { //entry
  15. contin = true;
  16.  
  17.  
  18. for (int m = n + 1; m < culumnArrayLines && contin == true; m++) { //innerloop
  19.  
  20. if (basecolumn[m] - basecolumn[n] > exit) { //exit
  21. contin = false;
  22. n = m;
  23. numberofentries++;
  24. }
  25. else if (m == culumnArrayLines - 1) {
  26. n = m;
  27. }
  28.  
  29. }
  30. }
  31. }
  32.  
  33. if (comparecolumn1[threadIdx.x] > entrycondition1 && contin == false) { //entry
  34. contin = true;
  35.  
  36. ...
Add Comment
Please, Sign In to add comment