Standard output
= Iteration 1 / 200 =
Execution scenario (parallel part):
| send(2) | send(6) | receive() |
| send(-6) | send(-8) | receive() |
| send(1) | receive() | send(4) |
Execution scenario (post part):
[]
= Iteration 2 / 200 =
Execution scenario (parallel part):
| send(-8) | receive() | receive() |
| receive() | send(5) | send(-4) |
| send(-8) | send(-2) | receive() |
Execution scenario (post part):
[]
= Iteration 3 / 200 =
Execution scenario (parallel part):
| send(-8) | receive() | receive() |
| receive() | receive() | receive() |
| receive() | send(4) | receive() |
Execution scenario (post part):
[]
= Iteration 4 / 200 =
Execution scenario (parallel part):
| receive() | send(6) | receive() |
| send(1) | send(4) | receive() |
| receive() | send(0) | receive() |
Execution scenario (post part):
[]
= Iteration 5 / 200 =
Execution scenario (parallel part):
| receive() | receive() | send(-10) |
| send(10) | send(4) | send(-9) |
| receive() | send(-7) | send(7) |
Execution scenario (post part):
[]
= Iteration 6 / 200 =
Execution scenario (parallel part):
| send(1) | send(-8) | send(6) |
| send(-4) | receive() | send(9) |
| receive() | send(-1) | send(10) |
Execution scenario (post part):
[]
= Iteration 7 / 200 =
Execution scenario (parallel part):
| send(4) | send(7) | receive() |
| send(-8) | receive() | receive() |
| send(4) | receive() | send(1) |
Execution scenario (post part):
[]
= Iteration 8 / 200 =
Execution scenario (parallel part):
| send(7) | send(-7) | receive() |
| receive() | receive() | receive() |
| receive() | receive() | send(4) |
Execution scenario (post part):
[]
= Iteration 9 / 200 =
Execution scenario (parallel part):
| receive() | send(0) | receive() |
| send(5) | receive() | send(4) |
| send(9) | send(7) | send(4) |
Execution scenario (post part):
[]
= Iteration 10 / 200 =
Execution scenario (parallel part):
| send(3) | send(5) | send(9) |
| send(-3) | receive() | receive() |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 11 / 200 =
Execution scenario (parallel part):
| send(3) | receive() | receive() |
| receive() | send(-10) | receive() |
| send(-3) | send(-4) | send(10) |
Execution scenario (post part):
[]
= Iteration 12 / 200 =
Execution scenario (parallel part):
| send(2) | receive() | receive() |
| send(8) | receive() | send(0) |
| send(0) | receive() | send(1) |
Execution scenario (post part):
[]
= Iteration 13 / 200 =
Execution scenario (parallel part):
| receive() | send(-1) | send(6) |
| receive() | send(4) | send(9) |
| send(3) | receive() | send(-4) |
Execution scenario (post part):
[]
= Iteration 14 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| send(2) | receive() | send(-4) |
| send(3) | send(-5) | receive() |
Execution scenario (post part):
[]
= Iteration 15 / 200 =
Execution scenario (parallel part):
| send(0) | send(-7) | receive() |
| receive() | receive() | receive() |
| send(7) | receive() | send(-3) |
Execution scenario (post part):
[]
= Iteration 16 / 200 =
Execution scenario (parallel part):
| send(10) | send(7) | send(-8) |
| send(-4) | send(1) | receive() |
| receive() | receive() | send(-7) |
Execution scenario (post part):
[]
= Iteration 17 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| receive() | receive() | receive() |
| send(-3) | receive() | send(0) |
Execution scenario (post part):
[]
= Iteration 18 / 200 =
Execution scenario (parallel part):
| receive() | send(9) | send(-4) |
| send(-1) | send(-9) | receive() |
| receive() | receive() | send(2) |
Execution scenario (post part):
[]
= Iteration 19 / 200 =
Execution scenario (parallel part):
| send(8) | send(6) | receive() |
| receive() | receive() | receive() |
| receive() | send(-3) | receive() |
Execution scenario (post part):
[]
= Iteration 20 / 200 =
Execution scenario (parallel part):
| send(-4) | send(-6) | send(-7) |
| receive() | send(3) | receive() |
| send(-4) | send(-1) | receive() |
Execution scenario (post part):
[]
= Iteration 21 / 200 =
Execution scenario (parallel part):
| send(4) | receive() | receive() |
| send(-3) | send(-4) | send(-7) |
| send(-4) | send(-1) | send(-2) |
Execution scenario (post part):
[]
= Iteration 22 / 200 =
Execution scenario (parallel part):
| receive() | receive() | send(-1) |
| send(10) | receive() | receive() |
| receive() | send(7) | receive() |
Execution scenario (post part):
[]
= Iteration 23 / 200 =
Execution scenario (parallel part):
| send(-4) | receive() | receive() |
| receive() | receive() | send(0) |
| send(-4) | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 24 / 200 =
Execution scenario (parallel part):
| receive() | receive() | send(8) |
| send(-1) | send(0) | send(-6) |
| send(1) | send(3) | receive() |
Execution scenario (post part):
[]
= Iteration 25 / 200 =
Execution scenario (parallel part):
| receive() | send(9) | receive() |
| receive() | send(6) | receive() |
| receive() | send(6) | receive() |
Execution scenario (post part):
[]
= Iteration 26 / 200 =
Execution scenario (parallel part):
| send(5) | receive() | receive() |
| send(-9) | send(-4) | receive() |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 27 / 200 =
Execution scenario (parallel part):
| send(-10) | receive() | receive() |
| send(-10) | receive() | receive() |
| send(-8) | receive() | send(-5) |
Execution scenario (post part):
[]
= Iteration 28 / 200 =
Execution scenario (parallel part):
| send(0) | send(-3) | send(-2) |
| send(-6) | receive() | send(1) |
| receive() | receive() | send(3) |
Execution scenario (post part):
[]
= Iteration 29 / 200 =
Execution scenario (parallel part):
| send(8) | send(-1) | send(-5) |
| receive() | send(2) | receive() |
| receive() | send(7) | send(-6) |
Execution scenario (post part):
[]
= Iteration 30 / 200 =
Execution scenario (parallel part):
| send(0) | send(10) | receive() |
| send(7) | send(-9) | send(-4) |
| receive() | send(3) | receive() |
Execution scenario (post part):
[]
= Iteration 31 / 200 =
Execution scenario (parallel part):
| receive() | send(-5) | send(1) |
| receive() | receive() | receive() |
| receive() | send(4) | send(-6) |
Execution scenario (post part):
[]
= Iteration 32 / 200 =
Execution scenario (parallel part):
| receive() | send(6) | send(-1) |
| receive() | send(-8) | send(7) |
| receive() | receive() | send(-5) |
Execution scenario (post part):
[]
= Iteration 33 / 200 =
Execution scenario (parallel part):
| receive() | receive() | send(3) |
| send(-6) | receive() | send(10) |
| send(10) | receive() | send(-5) |
Execution scenario (post part):
[]
= Iteration 34 / 200 =
Execution scenario (parallel part):
| receive() | send(-10) | receive() |
| receive() | send(9) | receive() |
| send(-2) | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 35 / 200 =
Execution scenario (parallel part):
| send(4) | receive() | receive() |
| receive() | receive() | receive() |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 36 / 200 =
Execution scenario (parallel part):
| receive() | send(5) | receive() |
| receive() | send(1) | receive() |
| send(-4) | send(-1) | send(1) |
Execution scenario (post part):
[]
= Iteration 37 / 200 =
Execution scenario (parallel part):
| send(1) | send(-8) | receive() |
| send(10) | send(3) | send(10) |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 38 / 200 =
Execution scenario (parallel part):
| send(3) | send(-1) | send(0) |
| receive() | send(-5) | send(5) |
| receive() | send(-6) | receive() |
Execution scenario (post part):
[]
= Iteration 39 / 200 =
Execution scenario (parallel part):
| send(-6) | send(8) | receive() |
| receive() | send(-9) | receive() |
| send(2) | send(6) | receive() |
Execution scenario (post part):
[]
= Iteration 40 / 200 =
Execution scenario (parallel part):
| receive() | send(-8) | receive() |
| receive() | send(-1) | receive() |
| send(0) | send(1) | send(-3) |
Execution scenario (post part):
[]
= Iteration 41 / 200 =
Execution scenario (parallel part):
| receive() | send(7) | receive() |
| receive() | receive() | send(9) |
| receive() | send(7) | send(1) |
Execution scenario (post part):
[]
= Iteration 42 / 200 =
Execution scenario (parallel part):
| send(-6) | send(2) | send(9) |
| receive() | receive() | send(9) |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 43 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| receive() | send(-2) | send(-9) |
| receive() | receive() | send(-8) |
Execution scenario (post part):
[]
= Iteration 44 / 200 =
Execution scenario (parallel part):
| send(-5) | send(-9) | send(-1) |
| send(-9) | receive() | receive() |
| receive() | receive() | send(3) |
Execution scenario (post part):
[]
= Iteration 45 / 200 =
Execution scenario (parallel part):
| receive() | send(1) | send(-10) |
| send(-2) | receive() | receive() |
| receive() | send(-7) | send(-4) |
Execution scenario (post part):
[]
= Iteration 46 / 200 =
Execution scenario (parallel part):
| receive() | send(-8) | receive() |
| send(0) | receive() | receive() |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 47 / 200 =
Execution scenario (parallel part):
| send(7) | send(6) | send(-7) |
| receive() | receive() | send(4) |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 48 / 200 =
Execution scenario (parallel part):
| receive() | send(-10) | send(5) |
| send(-1) | receive() | receive() |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 49 / 200 =
Execution scenario (parallel part):
| send(-8) | receive() | send(8) |
| send(0) | send(-9) | send(10) |
| send(3) | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 50 / 200 =
Execution scenario (parallel part):
| send(-5) | receive() | send(-9) |
| send(-9) | send(1) | send(-7) |
| receive() | receive() | send(-6) |
Execution scenario (post part):
[]
= Iteration 51 / 200 =
Execution scenario (parallel part):
| send(2) | send(-3) | send(1) |
| send(4) | send(0) | send(8) |
| send(-7) | send(-10) | receive() |
Execution scenario (post part):
[]
= Iteration 52 / 200 =
Execution scenario (parallel part):
| send(4) | receive() | send(-1) |
| receive() | receive() | send(-1) |
| send(1) | send(-1) | receive() |
Execution scenario (post part):
[]
= Iteration 53 / 200 =
Execution scenario (parallel part):
| send(9) | receive() | receive() |
| send(-8) | send(1) | receive() |
| send(-5) | send(-4) | receive() |
Execution scenario (post part):
[]
= Iteration 54 / 200 =
Execution scenario (parallel part):
| receive() | receive() | send(-1) |
| send(6) | receive() | receive() |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 55 / 200 =
Execution scenario (parallel part):
| receive() | send(10) | receive() |
| receive() | receive() | send(10) |
| receive() | receive() | send(-2) |
Execution scenario (post part):
[]
= Iteration 56 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| receive() | send(9) | receive() |
| send(5) | send(-2) | send(-8) |
Execution scenario (post part):
[]
= Iteration 57 / 200 =
Execution scenario (parallel part):
| receive() | send(-5) | receive() |
| receive() | send(1) | send(6) |
| send(3) | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 58 / 200 =
Execution scenario (parallel part):
| receive() | send(9) | receive() |
| send(-7) | receive() | send(-10) |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 59 / 200 =
Execution scenario (parallel part):
| receive() | send(-1) | send(3) |
| send(5) | receive() | receive() |
| receive() | send(-10) | send(6) |
Execution scenario (post part):
[]
= Iteration 60 / 200 =
Execution scenario (parallel part):
| send(-3) | receive() | send(8) |
| send(5) | send(-10) | receive() |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 61 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| send(0) | receive() | send(10) |
| receive() | send(1) | send(1) |
Execution scenario (post part):
[]
= Iteration 62 / 200 =
Execution scenario (parallel part):
| send(-3) | send(-5) | send(-9) |
| receive() | send(1) | send(-10) |
| receive() | receive() | send(-3) |
Execution scenario (post part):
[]
= Iteration 63 / 200 =
Execution scenario (parallel part):
| receive() | receive() | send(8) |
| receive() | send(-1) | receive() |
| receive() | send(-3) | receive() |
Execution scenario (post part):
[]
= Iteration 64 / 200 =
Execution scenario (parallel part):
| send(9) | send(-4) | receive() |
| receive() | receive() | send(6) |
| receive() | send(-5) | send(9) |
Execution scenario (post part):
[]
= Iteration 65 / 200 =
Execution scenario (parallel part):
| receive() | send(-8) | send(2) |
| receive() | send(-1) | send(-2) |
| send(2) | send(5) | receive() |
Execution scenario (post part):
[]
= Iteration 66 / 200 =
Execution scenario (parallel part):
| send(-6) | receive() | receive() |
| receive() | receive() | receive() |
| send(4) | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 67 / 200 =
Execution scenario (parallel part):
| receive() | send(5) | receive() |
| send(9) | receive() | send(9) |
| send(-3) | send(-6) | send(-7) |
Execution scenario (post part):
[]
= Iteration 68 / 200 =
Execution scenario (parallel part):
| receive() | receive() | send(7) |
| send(-5) | receive() | receive() |
| send(10) | send(3) | receive() |
Execution scenario (post part):
[]
= Iteration 69 / 200 =
Execution scenario (parallel part):
| receive() | send(-4) | send(-6) |
| receive() | receive() | receive() |
| receive() | send(-7) | send(8) |
Execution scenario (post part):
[]
= Iteration 70 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| receive() | receive() | receive() |
| send(8) | send(3) | send(1) |
Execution scenario (post part):
[]
= Iteration 71 / 200 =
Execution scenario (parallel part):
| receive() | send(-4) | send(7) |
| receive() | send(-1) | send(-8) |
| send(-10) | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 72 / 200 =
Execution scenario (parallel part):
| receive() | receive() | send(2) |
| receive() | receive() | receive() |
| send(-8) | send(0) | receive() |
Execution scenario (post part):
[]
= Iteration 73 / 200 =
Execution scenario (parallel part):
| send(0) | send(6) | send(-9) |
| receive() | send(-5) | send(1) |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 74 / 200 =
Execution scenario (parallel part):
| receive() | send(2) | send(-3) |
| receive() | send(-10) | receive() |
| send(0) | send(9) | receive() |
Execution scenario (post part):
[]
= Iteration 75 / 200 =
Execution scenario (parallel part):
| send(-4) | send(-4) | receive() |
| send(10) | receive() | receive() |
| receive() | send(2) | receive() |
Execution scenario (post part):
[]
= Iteration 76 / 200 =
Execution scenario (parallel part):
| receive() | send(-7) | send(2) |
| send(3) | receive() | receive() |
| receive() | receive() | send(2) |
Execution scenario (post part):
[]
= Iteration 77 / 200 =
Execution scenario (parallel part):
| send(-7) | receive() | receive() |
| receive() | receive() | send(9) |
| send(3) | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 78 / 200 =
Execution scenario (parallel part):
| send(9) | send(-5) | receive() |
| receive() | send(-5) | send(2) |
| send(5) | send(5) | receive() |
Execution scenario (post part):
[]
= Iteration 79 / 200 =
Execution scenario (parallel part):
| receive() | send(2) | receive() |
| receive() | send(-8) | receive() |
| receive() | send(7) | receive() |
Execution scenario (post part):
[]
= Iteration 80 / 200 =
Execution scenario (parallel part):
| send(-9) | receive() | send(-7) |
| send(2) | receive() | receive() |
| receive() | send(2) | receive() |
Execution scenario (post part):
[]
= Iteration 81 / 200 =
Execution scenario (parallel part):
| receive() | send(-1) | send(0) |
| send(-6) | send(-2) | receive() |
| send(-3) | send(-1) | send(-7) |
Execution scenario (post part):
[]
= Iteration 82 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| receive() | receive() | receive() |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 83 / 200 =
Execution scenario (parallel part):
| send(9) | send(-1) | send(3) |
| send(-3) | send(2) | receive() |
| send(-1) | receive() | send(-3) |
Execution scenario (post part):
[]
= Iteration 84 / 200 =
Execution scenario (parallel part):
| receive() | send(-2) | send(-1) |
| receive() | receive() | receive() |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 85 / 200 =
Execution scenario (parallel part):
| send(3) | send(5) | send(8) |
| send(0) | receive() | receive() |
| send(-1) | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 86 / 200 =
Execution scenario (parallel part):
| send(7) | receive() | send(-3) |
| send(1) | send(-5) | send(8) |
| receive() | receive() | send(-4) |
Execution scenario (post part):
[]
= Iteration 87 / 200 =
Execution scenario (parallel part):
| receive() | send(5) | send(6) |
| send(8) | send(1) | send(-7) |
| send(6) | send(-4) | receive() |
Execution scenario (post part):
[]
= Iteration 88 / 200 =
Execution scenario (parallel part):
| send(-9) | receive() | receive() |
| send(2) | send(-3) | receive() |
| receive() | send(-1) | receive() |
Execution scenario (post part):
[]
= Iteration 89 / 200 =
Execution scenario (parallel part):
| receive() | send(0) | send(7) |
| send(10) | receive() | send(5) |
| send(-10) | send(3) | send(7) |
Execution scenario (post part):
[]
= Iteration 90 / 200 =
Execution scenario (parallel part):
| send(9) | send(-4) | receive() |
| send(6) | receive() | receive() |
| receive() | send(-3) | send(9) |
Execution scenario (post part):
[]
= Iteration 91 / 200 =
Execution scenario (parallel part):
| receive() | receive() | send(-7) |
| receive() | send(-2) | receive() |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 92 / 200 =
Execution scenario (parallel part):
| send(-5) | send(5) | receive() |
| send(-10) | send(-4) | receive() |
| send(-6) | send(-3) | receive() |
Execution scenario (post part):
[]
= Iteration 93 / 200 =
Execution scenario (parallel part):
| receive() | send(-6) | receive() |
| send(-10) | receive() | send(5) |
| send(0) | receive() | send(5) |
Execution scenario (post part):
[]
= Iteration 94 / 200 =
Execution scenario (parallel part):
| send(1) | receive() | receive() |
| send(10) | send(10) | receive() |
| send(-1) | send(-4) | receive() |
Execution scenario (post part):
[]
= Iteration 95 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| send(8) | send(6) | receive() |
| send(1) | send(-4) | send(4) |
Execution scenario (post part):
[]
= Iteration 96 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| send(-7) | send(-4) | send(-9) |
| send(7) | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 97 / 200 =
Execution scenario (parallel part):
| receive() | receive() | send(0) |
| receive() | receive() | send(2) |
| receive() | receive() | send(10) |
Execution scenario (post part):
[]
= Iteration 98 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| receive() | receive() | receive() |
| send(0) | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 99 / 200 =
Execution scenario (parallel part):
| receive() | send(-1) | receive() |
| send(7) | receive() | receive() |
| send(-7) | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 100 / 200 =
Execution scenario (parallel part):
| receive() | send(8) | send(3) |
| send(10) | send(7) | send(6) |
| receive() | send(3) | send(9) |
Execution scenario (post part):
[]
= Iteration 101 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| send(5) | receive() | send(3) |
| send(1) | send(8) | receive() |
Execution scenario (post part):
[]
= Iteration 102 / 200 =
Execution scenario (parallel part):
| send(-9) | send(-5) | receive() |
| receive() | send(-4) | receive() |
| receive() | send(6) | send(6) |
Execution scenario (post part):
[]
= Iteration 103 / 200 =
Execution scenario (parallel part):
| receive() | receive() | send(-9) |
| receive() | receive() | send(-9) |
| receive() | receive() | send(2) |
Execution scenario (post part):
[]
= Iteration 104 / 200 =
Execution scenario (parallel part):
| receive() | receive() | send(-8) |
| receive() | receive() | send(6) |
| send(-8) | send(-8) | receive() |
Execution scenario (post part):
[]
= Iteration 105 / 200 =
Execution scenario (parallel part):
| send(-7) | receive() | receive() |
| receive() | receive() | receive() |
| send(-9) | send(-10) | send(10) |
Execution scenario (post part):
[]
= Iteration 106 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| send(7) | send(-6) | receive() |
| receive() | send(3) | send(-2) |
Execution scenario (post part):
[]
= Iteration 107 / 200 =
Execution scenario (parallel part):
| receive() | send(5) | send(8) |
| send(8) | send(-4) | send(4) |
| receive() | send(-7) | send(-4) |
Execution scenario (post part):
[]
= Iteration 108 / 200 =
Execution scenario (parallel part):
| send(-3) | send(2) | send(8) |
| send(4) | send(-7) | receive() |
| receive() | send(-3) | receive() |
Execution scenario (post part):
[]
= Iteration 109 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| receive() | receive() | receive() |
| receive() | receive() | send(-4) |
Execution scenario (post part):
[]
= Iteration 110 / 200 =
Execution scenario (parallel part):
| send(-1) | receive() | send(8) |
| send(4) | receive() | receive() |
| send(-1) | send(4) | receive() |
Execution scenario (post part):
[]
= Iteration 111 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| receive() | receive() | send(3) |
| send(5) | send(8) | receive() |
Execution scenario (post part):
[]
= Iteration 112 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| send(7) | receive() | receive() |
| receive() | send(-10) | send(-6) |
Execution scenario (post part):
[]
= Iteration 113 / 200 =
Execution scenario (parallel part):
| send(8) | send(-7) | send(10) |
| receive() | receive() | send(-3) |
| send(1) | receive() | send(-9) |
Execution scenario (post part):
[]
= Iteration 114 / 200 =
Execution scenario (parallel part):
| receive() | send(1) | send(7) |
| send(3) | receive() | send(3) |
| receive() | send(-3) | receive() |
Execution scenario (post part):
[]
= Iteration 115 / 200 =
Execution scenario (parallel part):
| send(9) | receive() | receive() |
| receive() | receive() | receive() |
| send(-10) | send(8) | receive() |
Execution scenario (post part):
[]
= Iteration 116 / 200 =
Execution scenario (parallel part):
| receive() | receive() | send(-9) |
| receive() | send(-5) | receive() |
| receive() | send(9) | send(10) |
Execution scenario (post part):
[]
= Iteration 117 / 200 =
Execution scenario (parallel part):
| receive() | receive() | send(-8) |
| send(-10) | send(-5) | receive() |
| receive() | send(-8) | receive() |
Execution scenario (post part):
[]
= Iteration 118 / 200 =
Execution scenario (parallel part):
| send(4) | receive() | receive() |
| receive() | receive() | send(-8) |
| send(-6) | send(6) | send(-4) |
Execution scenario (post part):
[]
= Iteration 119 / 200 =
Execution scenario (parallel part):
| send(2) | receive() | send(-7) |
| send(10) | send(-3) | send(9) |
| receive() | send(5) | send(2) |
Execution scenario (post part):
[]
= Iteration 120 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| send(6) | receive() | receive() |
| send(8) | receive() | send(6) |
Execution scenario (post part):
[]
= Iteration 121 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| receive() | receive() | send(-9) |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 122 / 200 =
Execution scenario (parallel part):
| send(-3) | receive() | send(-4) |
| send(0) | send(8) | receive() |
| send(-8) | receive() | send(10) |
Execution scenario (post part):
[]
= Iteration 123 / 200 =
Execution scenario (parallel part):
| send(-7) | receive() | receive() |
| send(3) | send(-4) | receive() |
| receive() | send(3) | send(5) |
Execution scenario (post part):
[]
= Iteration 124 / 200 =
Execution scenario (parallel part):
| receive() | send(-8) | receive() |
| receive() | receive() | receive() |
| send(-4) | send(-5) | receive() |
Execution scenario (post part):
[]
= Iteration 125 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| send(2) | receive() | receive() |
| send(3) | send(-3) | receive() |
Execution scenario (post part):
[]
= Iteration 126 / 200 =
Execution scenario (parallel part):
| receive() | send(-7) | receive() |
| send(-8) | send(-10) | send(-3) |
| send(6) | receive() | send(2) |
Execution scenario (post part):
[]
= Iteration 127 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| receive() | receive() | receive() |
| send(-9) | receive() | send(-1) |
Execution scenario (post part):
[]
= Iteration 128 / 200 =
Execution scenario (parallel part):
| send(-8) | send(2) | receive() |
| send(-5) | send(-9) | send(7) |
| receive() | send(-1) | send(-4) |
Execution scenario (post part):
[]
= Iteration 129 / 200 =
Execution scenario (parallel part):
| receive() | send(5) | send(-6) |
| send(-7) | send(2) | send(2) |
| send(-1) | send(1) | receive() |
Execution scenario (post part):
[]
= Iteration 130 / 200 =
Execution scenario (parallel part):
| send(-7) | receive() | receive() |
| receive() | receive() | send(8) |
| send(-5) | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 131 / 200 =
Execution scenario (parallel part):
| send(3) | receive() | receive() |
| send(8) | receive() | send(4) |
| send(4) | receive() | send(-2) |
Execution scenario (post part):
[]
= Iteration 132 / 200 =
Execution scenario (parallel part):
| receive() | send(2) | send(-9) |
| receive() | send(-8) | receive() |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 133 / 200 =
Execution scenario (parallel part):
| receive() | send(4) | send(-7) |
| send(-3) | send(7) | send(3) |
| send(-5) | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 134 / 200 =
Execution scenario (parallel part):
| send(2) | receive() | send(2) |
| receive() | receive() | receive() |
| send(8) | send(-5) | receive() |
Execution scenario (post part):
[]
= Iteration 135 / 200 =
Execution scenario (parallel part):
| receive() | send(4) | send(2) |
| receive() | send(10) | send(-4) |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 136 / 200 =
Execution scenario (parallel part):
| send(-2) | receive() | receive() |
| send(-7) | receive() | receive() |
| send(1) | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 137 / 200 =
Execution scenario (parallel part):
| send(1) | receive() | send(2) |
| send(0) | receive() | receive() |
| send(1) | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 138 / 200 =
Execution scenario (parallel part):
| send(-9) | receive() | receive() |
| send(4) | receive() | receive() |
| send(-4) | receive() | send(-8) |
Execution scenario (post part):
[]
= Iteration 139 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| send(3) | send(7) | receive() |
| receive() | send(0) | send(-5) |
Execution scenario (post part):
[]
= Iteration 140 / 200 =
Execution scenario (parallel part):
| receive() | receive() | send(-10) |
| send(-3) | receive() | send(7) |
| receive() | receive() | send(-10) |
Execution scenario (post part):
[]
= Iteration 141 / 200 =
Execution scenario (parallel part):
| send(-9) | receive() | receive() |
| receive() | send(0) | send(-1) |
| send(10) | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 142 / 200 =
Execution scenario (parallel part):
| send(3) | send(3) | send(-10) |
| send(9) | receive() | receive() |
| send(8) | send(-2) | receive() |
Execution scenario (post part):
[]
= Iteration 143 / 200 =
Execution scenario (parallel part):
| receive() | send(-2) | send(8) |
| receive() | send(-6) | send(3) |
| receive() | receive() | send(10) |
Execution scenario (post part):
[]
= Iteration 144 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| send(5) | receive() | send(-10) |
| send(7) | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 145 / 200 =
Execution scenario (parallel part):
| receive() | receive() | send(-3) |
| receive() | send(-5) | send(0) |
| receive() | send(-8) | receive() |
Execution scenario (post part):
[]
= Iteration 146 / 200 =
Execution scenario (parallel part):
| send(7) | send(-4) | send(9) |
| receive() | receive() | receive() |
| receive() | send(5) | send(0) |
Execution scenario (post part):
[]
= Iteration 147 / 200 =
Execution scenario (parallel part):
| send(-10) | send(-9) | receive() |
| receive() | receive() | receive() |
| receive() | send(-6) | receive() |
Execution scenario (post part):
[]
= Iteration 148 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| receive() | send(-6) | receive() |
| receive() | send(10) | send(4) |
Execution scenario (post part):
[]
= Iteration 149 / 200 =
Execution scenario (parallel part):
| send(8) | send(2) | send(10) |
| receive() | receive() | send(5) |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 150 / 200 =
Execution scenario (parallel part):
| receive() | receive() | send(-8) |
| send(6) | send(-8) | send(5) |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 151 / 200 =
Execution scenario (parallel part):
| receive() | receive() | send(2) |
| receive() | send(2) | receive() |
| send(0) | send(-6) | send(-4) |
Execution scenario (post part):
[]
= Iteration 152 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| send(5) | send(-4) | send(-9) |
| receive() | send(-5) | receive() |
Execution scenario (post part):
[]
= Iteration 153 / 200 =
Execution scenario (parallel part):
| receive() | send(-7) | send(8) |
| send(-8) | receive() | send(-3) |
| receive() | send(-5) | send(9) |
Execution scenario (post part):
[]
= Iteration 154 / 200 =
Execution scenario (parallel part):
| send(1) | receive() | receive() |
| receive() | send(-6) | receive() |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 155 / 200 =
Execution scenario (parallel part):
| receive() | send(6) | receive() |
| send(6) | send(9) | send(-7) |
| send(7) | send(-2) | receive() |
Execution scenario (post part):
[]
= Iteration 156 / 200 =
Execution scenario (parallel part):
| receive() | send(-10) | send(8) |
| receive() | send(4) | receive() |
| receive() | send(6) | send(-4) |
Execution scenario (post part):
[]
= Iteration 157 / 200 =
Execution scenario (parallel part):
| send(-3) | send(-3) | receive() |
| receive() | receive() | receive() |
| receive() | send(-8) | send(-10) |
Execution scenario (post part):
[]
= Iteration 158 / 200 =
Execution scenario (parallel part):
| send(5) | send(6) | send(-4) |
| send(3) | send(7) | send(-6) |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 159 / 200 =
Execution scenario (parallel part):
| receive() | send(2) | receive() |
| send(-6) | receive() | receive() |
| send(-2) | send(10) | send(-10) |
Execution scenario (post part):
[]
= Iteration 160 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| receive() | send(-3) | receive() |
| send(-1) | send(6) | send(5) |
Execution scenario (post part):
[]
= Iteration 161 / 200 =
Execution scenario (parallel part):
| receive() | send(-5) | receive() |
| send(-10) | send(4) | send(2) |
| send(7) | receive() | send(5) |
Execution scenario (post part):
[]
= Iteration 162 / 200 =
Execution scenario (parallel part):
| send(7) | receive() | send(4) |
| receive() | receive() | send(7) |
| send(-1) | send(8) | send(3) |
Execution scenario (post part):
[]
= Iteration 163 / 200 =
Execution scenario (parallel part):
| send(8) | receive() | receive() |
| receive() | send(2) | send(4) |
| send(4) | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 164 / 200 =
Execution scenario (parallel part):
| receive() | receive() | send(-1) |
| send(4) | send(-3) | send(6) |
| send(-1) | send(10) | receive() |
Execution scenario (post part):
[]
= Iteration 165 / 200 =
Execution scenario (parallel part):
| send(4) | send(8) | send(-10) |
| send(-6) | receive() | receive() |
| receive() | send(-8) | receive() |
Execution scenario (post part):
[]
= Iteration 166 / 200 =
Execution scenario (parallel part):
| send(-8) | receive() | send(6) |
| send(4) | send(-9) | send(-1) |
| send(-4) | send(5) | send(-7) |
Execution scenario (post part):
[]
= Iteration 167 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| receive() | receive() | send(-5) |
| send(-10) | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 168 / 200 =
Execution scenario (parallel part):
| send(-2) | send(2) | receive() |
| send(8) | send(5) | receive() |
| send(8) | send(10) | receive() |
Execution scenario (post part):
[]
= Iteration 169 / 200 =
Execution scenario (parallel part):
| send(-8) | receive() | receive() |
| send(-5) | send(6) | send(10) |
| send(7) | send(3) | receive() |
Execution scenario (post part):
[]
= Iteration 170 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| send(5) | receive() | send(-2) |
| send(9) | send(-1) | receive() |
Execution scenario (post part):
[]
= Iteration 171 / 200 =
Execution scenario (parallel part):
| receive() | send(2) | send(-2) |
| send(0) | receive() | send(-7) |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 172 / 200 =
Execution scenario (parallel part):
| send(3) | receive() | receive() |
| send(5) | send(-9) | send(-8) |
| receive() | send(-3) | send(8) |
Execution scenario (post part):
[]
= Iteration 173 / 200 =
Execution scenario (parallel part):
| receive() | send(-6) | receive() |
| send(-8) | send(1) | receive() |
| send(10) | send(-6) | send(3) |
Execution scenario (post part):
[]
= Iteration 174 / 200 =
Execution scenario (parallel part):
| receive() | receive() | send(3) |
| send(9) | send(-2) | receive() |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 175 / 200 =
Execution scenario (parallel part):
| send(6) | receive() | send(-7) |
| send(2) | send(4) | receive() |
| send(-6) | send(-3) | send(-3) |
Execution scenario (post part):
[]
= Iteration 176 / 200 =
Execution scenario (parallel part):
| receive() | send(-1) | receive() |
| send(-8) | send(-7) | send(-2) |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 177 / 200 =
Execution scenario (parallel part):
| receive() | send(-4) | receive() |
| send(-8) | receive() | receive() |
| send(3) | send(3) | receive() |
Execution scenario (post part):
[]
= Iteration 178 / 200 =
Execution scenario (parallel part):
| receive() | send(-7) | receive() |
| send(3) | send(9) | receive() |
| receive() | send(-6) | send(1) |
Execution scenario (post part):
[]
= Iteration 179 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| receive() | receive() | send(8) |
| receive() | receive() | send(-5) |
Execution scenario (post part):
[]
= Iteration 180 / 200 =
Execution scenario (parallel part):
| send(-2) | receive() | send(4) |
| send(3) | send(-1) | receive() |
| receive() | receive() | send(-2) |
Execution scenario (post part):
[]
= Iteration 181 / 200 =
Execution scenario (parallel part):
| send(5) | send(6) | send(-8) |
| receive() | receive() | receive() |
| receive() | send(-7) | send(6) |
Execution scenario (post part):
[]
= Iteration 182 / 200 =
Execution scenario (parallel part):
| send(6) | send(-8) | receive() |
| send(2) | receive() | send(-2) |
| receive() | send(-5) | send(8) |
Execution scenario (post part):
[]
= Iteration 183 / 200 =
Execution scenario (parallel part):
| send(-3) | send(-2) | receive() |
| send(0) | send(-7) | receive() |
| receive() | receive() | send(10) |
Execution scenario (post part):
[]
= Iteration 184 / 200 =
Execution scenario (parallel part):
| receive() | send(-9) | receive() |
| send(-6) | receive() | send(7) |
| send(-4) | send(-4) | send(2) |
Execution scenario (post part):
[]
= Iteration 185 / 200 =
Execution scenario (parallel part):
| receive() | send(2) | receive() |
| receive() | send(-9) | send(6) |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 186 / 200 =
Execution scenario (parallel part):
| send(-5) | send(-3) | receive() |
| send(2) | receive() | receive() |
| send(5) | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 187 / 200 =
Execution scenario (parallel part):
| receive() | receive() | send(2) |
| receive() | receive() | receive() |
| receive() | receive() | send(5) |
Execution scenario (post part):
[]
= Iteration 188 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| send(-9) | receive() | receive() |
| receive() | send(10) | send(8) |
Execution scenario (post part):
[]
= Iteration 189 / 200 =
Execution scenario (parallel part):
| receive() | send(-10) | send(2) |
| send(5) | send(-3) | send(-6) |
| send(0) | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 190 / 200 =
Execution scenario (parallel part):
| send(1) | send(-3) | receive() |
| send(6) | receive() | send(-4) |
| send(1) | send(-9) | receive() |
Execution scenario (post part):
[]
= Iteration 191 / 200 =
Execution scenario (parallel part):
| receive() | receive() | receive() |
| send(0) | receive() | receive() |
| send(-4) | send(7) | send(7) |
Execution scenario (post part):
[]
= Iteration 192 / 200 =
Execution scenario (parallel part):
| send(-1) | receive() | send(5) |
| send(7) | send(7) | receive() |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 193 / 200 =
Execution scenario (parallel part):
| send(1) | receive() | send(-5) |
| receive() | send(9) | receive() |
| receive() | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 194 / 200 =
Execution scenario (parallel part):
| receive() | send(9) | receive() |
| receive() | receive() | send(-2) |
| send(8) | receive() | receive() |
Execution scenario (post part):
[]
= Iteration 195 / 200 =
Execution scenario (parallel part):
| send(4) | send(-10) | send(1) |
| receive() | send(-4) | receive() |
| receive() | receive() | send(-1) |
Execution scenario (post part):
[]
= Iteration 196 / 200 =
Execution scenario (parallel part):
| receive() | send(6) | send(-5) |
| send(-5) | send(4) | send(5) |
| send(-5) | send(8) | send(-7) |
Execution scenario (post part):
[]
= Iteration 197 / 200 =
Execution scenario (parallel part):
| receive() | receive() | send(-6) |
| receive() | send(8) | send(-2) |
| receive() | send(-4) | receive() |
Execution scenario (post part):
[]
= Iteration 198 / 200 =
Execution scenario (parallel part):
| receive() | receive() | send(-8) |
| send(-9) | send(2) | receive() |
| receive() | send(-2) | send(0) |
Execution scenario (post part):
[]
= Iteration 199 / 200 =
Execution scenario (parallel part):
| send(7) | receive() | receive() |
| send(3) | receive() | receive() |
| receive() | send(5) | receive() |
Execution scenario (post part):
[]
= Iteration 200 / 200 =
Execution scenario (parallel part):
| receive() | receive() | send(3) |
| receive() | send(-2) | receive() |
| receive() | send(1) | receive() |
Execution scenario (post part):
[]


The SCT_PrintSelectedArea template generates code to allow the user to select an area on the screen and then print the selected area to the default printer.
Print Option Select one of the choices from the dropdown list. The choices and their meaning are as follows:
Scale Scales the printed screen by the integer scaling factors specified in the param_wScaleX and param_wScaleY parameters. If the scaling is set too large, the screen may extend off the printed page and will be clipped.
X Scale Specifies the x-axis scaling factor for the printed window. The x and y scaling factors are only used if the Scale option above is selected.
Y Scale Specifies the y-axis scaling factor for the printed window.
X Position Specifies the x-axis origin for the printed window.
Y Position Specifies the y-axis origin for the printed window.
Check for Error This check box controls the generation of error checking code. If an error is returned from the Screen Capture Tools library, and error message will be displayed.
Result Field Select the local data variable that will store the result of the library call. Default is SCT_wResult.
This template generates code similar to the following:
SCT_PrintSelectedArea() !print user selected rectangle
See Also: SCT_PrintSelectedArea Procedure


| Modifier and Type | Field and Description |
|---|---|
protected long |
handle |
| Modifier | Constructor and Description |
|---|---|
protected |
Group(long handle) |
| Modifier and Type | Method and Description |
|---|---|
static int |
compare(Group group1,
Group group2)
Compare two groups.
|
static Group |
difference(Group group1,
Group group2)
Set difference of two groups.
|
Group |
excl(int[] ranks)
Create a subset group excluding specified processes.
|
void |
free()
Java binding of the MPI operation
MPI_GROUP_FREE . |
protected static long |
getEmpty() |
int |
getRank()
Rank of this process in the group.
|
int |
getSize()
Java binding of the MPI operation
MPI_GROUP_SIZE . |
Group |
incl(int[] ranks)
Create a subset group including specified processes.
|
static Group |
intersection(Group group1,
Group group2)
Set intersection of two groups.
|
boolean |
isNull()
Test if group object is null.
|
Group |
rangeExcl(int[][] ranges)
Create a subset group excluding processes specified
by strided intervals of ranks.
|
Group |
rangeIncl(int[][] ranges)
Create a subset group including processes specified
by strided intervals of ranks.
|
static int[] |
translateRanks(Group group1,
int[] ranks1,
Group group2)
Translate ranks within one group to ranks within another.
|
static Group |
union(Group group1,
Group group2)
Set union of two groups.
|
protected static long getEmpty()
public int getSize() throws MPIException
MPI_GROUP_SIZE
.MPIException
- Signals that an MPI exception of some sort has occurred.public int getRank() throws MPIException
Java binding of the MPI operation MPI_GROUP_RANK
.
MPI.UNDEFINED
if this process is not a member of the group.MPIException
- Signals that an MPI exception of some sort has occurred.public void free() throws MPIException
MPI_GROUP_FREE
.free
in interface Freeable
MPIException
- Signals that an MPI exception of some sort has occurred.public boolean isNull()
public static int[] translateRanks(Group group1, int[] ranks1, Group group2) throws MPIException
Java binding of the MPI operation MPI_GROUP_TRANSLATE_RANKS
.
Result elements are MPI.UNDEFINED
where no correspondence exists.
group1
- a groupranks1
- array of valid ranks in group1group2
- another groupMPIException
- Signals that an MPI exception of some sort has occurred.public static int compare(Group group1, Group group2) throws MPIException
Java binding of the MPI operation MPI_GROUP_COMPARE
.
group1
- first groupgroup2
- second groupMPI.IDENT
if the group members and group order are exactly
the same in both groups, MPI.SIMILAR
if the group members are
the same but the order is different, MPI.UNEQUAL
otherwise.MPIException
- Signals that an MPI exception of some sort has occurred.public static Group union(Group group1, Group group2) throws MPIException
Java binding of the MPI operation MPI_GROUP_UNION
.
group1
- first groupgroup2
- second groupMPIException
- Signals that an MPI exception of some sort has occurred.public static Group intersection(Group group1, Group group2) throws MPIException
MPI_GROUP_INTERSECTION
.group1
- first groupgroup2
- second groupMPIException
- Signals that an MPI exception of some sort has occurred.public static Group difference(Group group1, Group group2) throws MPIException
MPI_GROUP_DIFFERENCE
.group1
- first groupgroup2
- second groupMPIException
- Signals that an MPI exception of some sort has occurred.public Group incl(int[] ranks) throws MPIException
Java binding of the MPI operation MPI_GROUP_INCL
.
ranks
- ranks from this group to appear in new groupMPIException
- Signals that an MPI exception of some sort has occurred.public Group excl(int[] ranks) throws MPIException
Java binding of the MPI operation MPI_GROUP_EXCL
.
ranks
- ranks from this group not to appear in new groupMPIException
- Signals that an MPI exception of some sort has occurred.public Group rangeIncl(int[][] ranges) throws MPIException
Java binding of the MPI operation MPI_GROUP_RANGE_INCL
.
The triplets are of the form (first rank, last rank, stride)
indicating ranks in this group to be included in the new group.
The size of the first dimension of ranges
is the number
of triplets. The size of the second dimension is 3.
ranges
- array of integer tripletsMPIException
- Signals that an MPI exception of some sort has occurred.public Group rangeExcl(int[][] ranges) throws MPIException
Java binding of the MPI operation MPI_GROUP_RANGE_EXCL
.
Triplet array is defined as for rangeIncl
, the ranges
indicating ranks in this group to be excluded from the new group.
ranges
- array of integer tripletsMPIException
- Signals that an MPI exception of some sort has occurred.


What you get
-
Online participation in laboratory exercises
-
Individual support from trainers
-
Opportunity for scholarship for free education
-
Interactive platform access and real-time training
-
Learning resources and homework check
-
Examinations and assessment
-
Participation in practical projects
-
Certificates and diplomas
-
Assistance in getting a job


|
| | Vector3 (float x, float y, float z) |
| | Creates a new 3D vector with the specified values. More...
|
| |
| | Vector3 (float w=1) |
| | Creates a homogeneous 2D vector with the specified w value. More...
|
| |
| | Vector3 (const Vector2 ©) |
| | Inserts the specified Vector2 into the top of a new Vector3. More...
|
| |
| | Vector3 (const Vector3 ©) |
| | Constructs a copy of the specified vector. More...
|
| |
|
const float & | x () const |
| |
|
void | x (const float &x) |
| |
|
const float & | y () const |
| |
|
void | y (const float &y) |
| |
|
const float & | z () const |
| |
|
void | z (const float &z) |
| |
| Vector3 | operator+ (const Vector3 &other) const |
| | Adds two Vector3 instances together, and returns the result. More...
|
| |
| Vector3 | operator- (const Vector3 &other) const |
| | Subtracts a Vector3 from this, and returns the result. More...
|
| |
| Vector3 | operator* (const Vector3 &other) const |
| | Multiplies the individual values of two Vector3 instances together, and returns the result. More...
|
| |
| Vector3 | operator* (const float &other) const |
| | Multiplies the individual values of this Vector3 with a scalar, and returns the result. More...
|
| |
| Vector3 | operator/ (const float &other) const |
| | Divides the individual values of this Vector3 with a scalar, and returns the result. More...
|
| |
| bool | operator== (const Vector3 &other) const |
| | Tests two Vector3 instances for equality. More...
|
| |
| bool | operator!= (const Vector3 &other) const |
| | Tests two Vector3 instances for inequality. More...
|
| |
| Vector3 & | operator+= (const Vector3 &other) |
| | Adds another Vector3 to this, and returns the result as a reference. More...
|
| |
| Vector3 & | operator-= (const Vector3 &other) |
| | Subtracts another Vector3 from this, and returns the result as a reference. More...
|
| |
| Vector3 & | operator*= (const Vector3 &other) |
| | Multiplies the individual values of this Vector3 with another, and returns the result as a reference. More...
|
| |
| Vector3 & | operator*= (const float &other) |
| | Multiplies the individual values of this Vector3 with a scalar, and returns the result as a reference. More...
|
| |
| Vector3 & | operator/= (const float &other) |
| | Divides the individual values of this Vector3 with a scalar, and returns the result as a reference. More...
|
| |
| float & | operator[] (const int &index) |
| | Accesses a value at the specified index in the vector, from top to bottom. More...
|
| |
| float | at (int y) const |
| | Returns the (const) value at the n:th vector index, from top to bottom. More...
|
| |
| float | dot (const Vector3 &other) const |
| | Calculates the dot product between this vector and another. More...
|
| |
| Vector3 | cross (const Vector3 &other) const |
| | Calculates the cross product between this vector and another. More...
|
| |
| float | length () const |
| | Returns the length of this point from the origin (0, 0, 0). More...
|
| |
| Vector3 | norm () const |
| | Normalizes the vector, turning it into a unit vector. More...
|
| |
| Vector3 | getReflection (const Vector3 &normal) const |
| | Calculates the reflection of a vector against a specified normal. More...
|
| |
| std::string | to_string () const |
| | Returns a formatted multi-line string representation of the vector. More...
|
| |
Class to represent a 3-dimensional point vector.


resume
unabridged.
三人行，必有我师焉
If I walk amongst three people, there is something to learn from at least one.
People
Readings


I'm a header 1!
Hello there jbhango!
This is a link to Youtube
This is a link to Netflix
This is a link to DisneyPlus


Overall Personality Score
Name: {{ request.args.get('full_name') }}
| Personality Characteristics | Meaning |
|---|---|
| Open | Imaginative & Insightful |
| Conscientious | Organised & Disciplined |
| Extroversion | Social & Outgoing |
| Neuroticism | Prone to Stress & Worry |
| Agreeable | Trusting & Helpful |
Personality Dashboard with Facet
Name: {{ request.args.get('full_name') }}
Select One:


{% include "header.html" %} {% load static %}
{% include "sidebar.html" with date=prediction_date %}
{% include "topbar.html" %}
Games Predicted as of {{prediction_date}}
{%for g in predicted_games%}
{{g.game_date}} - {{g.away_team}} @ {{g.home_team}}
{% include "plots/game_outcome.html" with game_pk=g.game_pk game_pred=g.game_pred home_abb=g.home_abb away_abb=g.away_abb home_color=g.home_color away_color=g.away_color %}
{% endfor %}
{% include "footer_scripts.html" %}


Inexperienced Germany not among Euros contenders – Toni Kroos
by FSA EditorGermany have work to do if they are to be considered contenders at Euro 2020 despite cruising to qualification, says Toni Kroos.
Toni Kroos acknowledges Germany are lacking experience and could not be considered Euro 2020 contenders as things stand, although he is not writing off their chances.
Germany qualified for a record 13th European Championship with a 4-0 defeat of Belarus in Monchengladbach on Saturday.
Matthias Ginter broke the deadlock at the end of a frustrating first half, before Leon Goretzka doubled the hosts’ lead and then Kroos struck twice.
The scoreline belied some of the difficulties the 2014 world champions faced, though, reliant on Manuel Neuer to make three fine saves – including from Igor Stasevich’s penalty.
Joachim Low has disposed of a number of senior men since a poor 2018 World Cup, and Kroos, one of the remaining established stars, sees there is work to do for a young group.
“We are still lacking a little bit in experience, but certain procedures are working better and better,” he said, as reported by UEFA.com.
“We will know where we stand shortly before the tournament. Currently, I would not count us amongst the top favourites. But that doesn’t always mean anything.”
Like Kroos and Neuer, Ginter was central to the victory, having a hand in the second and third goals after scoring the opener at Borussia-Park, the home of club side Borussia Monchengladbach.
The smart flick was Ginter’s first strike for his country, prompting comment from Neuer that it was “about time”.
“His first Germany goal tonight? Well, after 29 games, it is about time,” Neuer said. “No, he did very well to score in style.”
Ginter added: “Scoring a goal like this as a central defender – that goes to show that nothing is impossible. Manu is right – after 29 games, it was about time.
“Scoring here in Gladbach is the icing on the cake.”


Building momentum and my methodology
Posted on May 17, 2020
An exceedingly good week in the labs mainly thanks to the power of consistency:
Reminder that you can always check my solutions here:
This week I focused on more DOM attacks, CORS issues, XXE attacks and request smuggling. I still don't properly trust myself to spot a DOM vulnerability out in the wild, but I think I have a decent grip over CORS. XXE and request smuggling were entirely new to me.
I never really took the time to explore XML properly, often just bruteforcing my way though it with regex (or how to exponentially multiply the complexity of your code!). I spent some more time on it this week and it's starting to click, although what helped tremendously was this video by PwnFunction on XXE
Request smuggling was something completely new to me and I took my time experimenting and learning since it's something I can see myself often using in my real engagements. The Burp HTTP Smuggler extension helps a lot in identifying potential targets, although I need to test it more outside the labs. It did, however, push me to reach that point where I struggle to take in new information because I need to digest the one I have just learned, so I decided to slow down a bit for the weekend and play some Kenshi. Great game, would karate chop a cannibal and steal his hat again.
My methodology
This is by no means set in stone, and as proof is the fact that I took my time with the request smuggling labs, but I try to stick to the following:
Apprentice Difficulty: 15 minutes
Practitioner Difficulty : 30 minutes
Expect Difficulty: 45 minutes
That's about how long I'll spend on a lab before looking up the solution, although sometimes I'll push it if I feel like I'm close. I'm not ashamed to look at the solutions at all, since many labs can be in the unknown unknowns area - things I don't even know I don't know. I do read the main page for every attack before attempting the labs (e.g. XXE labs) and I do intend to frequently return to those labs and rely less on the solutions to gain a deeper understanding. At the moment, I'm just trying to expose myself to new and diverse attack vectors.
Next week seems to be quite busy, so we'll see if I can keep my momentum going.


You must declare the "bookmarks" permission in the extension manifest to use the bookmarks API. For example:
{ "name": "My extension", ... "permissions": [ "bookmarks" ], ... }
Bookmarks are organized in a tree, where each node in the tree is either a bookmark or a folder (sometimes called a group). Each node in the tree is represented by a $(ref:bookmarks.BookmarkTreeNode) object.
BookmarkTreeNode
properties
are used throughout the chrome.bookmarks
API.
For example, when you call
$(ref:bookmarks.create),
you pass in the new node's parent (parentId
),
and, optionally, the node's
index
, title
, and url
properties.
See $(ref:bookmarks.BookmarkTreeNode)
for information about the properties a node can have.
Note: You cannot use this API to add or remove entries in the root folder. You also cannot rename, move, or remove the special "Bookmarks Bar" and "Other Bookmarks" folders.
The following code creates a folder with the title "Extension bookmarks".
The first argument to create()
specifies properties
for the new folder.
The second argument defines a function
to be executed after the folder is created.
chrome.bookmarks.create({'parentId': bookmarkBar.id, 'title': 'Extension bookmarks'}, function(newFolder) { console.log("added folder: " + newFolder.title); });
The next snippet creates a bookmark pointing to the developer documentation for extensions. Since nothing bad will happen if creating the bookmark fails, this code doesn't bother to define a callback function.
chrome.bookmarks.create({'parentId': extensionsFolderId, 'title': 'Extensions doc', 'url': 'http://code.google.com/chrome/extensions'});
For an example of using this API, see the basic bookmarks sample. For other examples and for help in viewing the source code, see Samples.


Through Beaujolais, to Lyon
Back on the road, I went south. The ride to Mâcon was great, along a new bike path. The last 15 km or so was to a place called Romanènche-Thorins in Beaujolais. I was right next to Georges Duboeuf, so I checked out what was new. Actually, it was a little rainy starting in Mâcon, and the computer navigation send me down an unmaintained dirt road. Oops! Once I got food (by backtracking 6 km), all I wanted to do was watch Star Trek. In English. Very much in English.
The next day I went to the northern edge of Lyon, then east to a suburb along the Rhône. There's a ginormous hill to get into Lyon, it turns out - the river Saône goes though a narrow passage that wasn't on the recommended bike path. Actually, the bicycle infrastructure was pretty poor throughout Beaujolais - I mostly relied on the voice directions from my map application. The GPS file I downloaded send me up what was basially a hiking trail, and I of course got a flat.
Lyon
I took a break in Lyon, and saw some of the tourist areas.
Lyon to Villebois
Next up, it's East along the Rhône to a place called Villebois.
Villebois to Les Avenières
The next leg was nice. Not too many pictures, and it was only 65 km or so - since it's getting hilly, I got more conservative on the distance, so I got in at 4 PM.
I did have Yet Another Breakdown – it's the front luggage rack's turn to break. It broke at a really good time, when I was stopped, and about 1 km from my lunch stop. The way it's broken, I was able to kludge it back together with some heavy-duty cotton string and a couple of bungee cords; that'll be good enough to get me to September 13th.


Here is a sample page showing some basic use cases for the proposed pseudo class :where(). Try resizing the browser window and the text area to see how the various elements respond. Note, no media queries were used to make this page, it all uses the javascript shim for the :where() pseudo class.
These buttons control the padding on the body, this demonstrates resizing that cannot be captured by media-queries.


The Assert task adds an assertion capability to Ant projects. This task works in a manner very similar to the Java assert keyword, and provides a limited "design by contract" facility to Ant. This is very useful for testing build scripts prior to putting them into production.
The Assert task verifies that a given property has a given value and throws a BuildException if the property value is not as expected or the property does not exist.
Also like Java's assert keyword, the Assert task must be 'turned on' using the property ant.enable.asserts . If not set, or is set to false , the Assert task works exactly like the Sequential task. If the Variable task is used to define this property, then it can be turned on and off as needed throughout a build.
This task can hold other tasks including Assert.
The Assert task may contain one 'bool' element. The 'bool' element is identical to the ConditionTask, but unlike the ConditionTask, is actually a Task. The 'bool' element can contain all the conditions permitted by the ConditionTask, plus the IsPropertyTrue , IsPropertyFalse , StartsWith , EndsWith , IsGreaterThan , IsLessThan and conditions. See the If task for examples of using these conditionals.
Table 4.1. Assert Task Attributes
| Attribute | Description | Default | Required |
|---|---|---|---|
| name | The name of the property to test for. | none | Yes |
| exists | Test for existence or non-existence of the property. | True | No |
| value | The value to test for, implies 'exists=true'. If the value in the project is different than this value, a BuildException will be thrown and the build will stop. | none | No |
| execute | Should the tasks contained in this task be executed? It may be useful to set this to false when testing build files. | True | No |
| failonerror | Should the build halt if the assertion fails? Setting this to false is contrary to the intented use of assertions, but may be useful in certain situations. | True | No |
As stated above, the Assert task may contain a nested "bool" task, otherwise, the Assert task does not support any nested elements apart from Ant tasks. Any valid Ant task may be embedded within the assert task.
In the following example, the first assert task checks that the wait property exists and does not execute the echo and sleep tasks. The second assert task checks that the wait property exists, has a value of 2, and executes the echo task.
<property name="wait" value="2"/> <assert name="wait" execute="false"> <echo> Waiting ${wait} seconds... Click the red button to stop waiting. </echo> <sleep seconds="${wait}"/> </assert> <assert name="wait" value="2" execute="true"> <echo>done waiting!</echo> </assert> |
The next example shows Assert being used in a unit test for the "limit" task:
<property name="ant.enable.asserts" value="true"/> <target name="test2"> <!-- should not stop 'sleep' task, should print out '_passed_' --> <stopwatch name="timer"/> <limit maxwait="5"> <sleep seconds="1"/> <echo>_passed_</echo> </limit> <stopwatch name="timer" action="total"/> <assert message="Too much time."> <bool> <islessthan arg1="${timer}" arg2="2"/> </bool> </assert> </target> |
If the ant.enable.asserts property is set to false, then in the above example, the echo , sleep , and echo tasks will all execute.
Copyright © 2003 Ant-Contrib Project. All rights Reserved.


Carson Wentz Asked Cameraman What Tony Romo Said About Reviewed TD Call Since ‘He’s Always Right’
by Darrelle LincolnThings have certainly changd since Tony Romo retired from the NFL.
The former Dallas Cowboys quarterback and current NFL color commentator for CBS has been known to correctly predict play calls before they happened and he has become loved for it.
Romo and play-by-play announcer Jim Nantz were at Lincoln Financial Field this past Sunday to call the Super Bowl LII rematch between the Philadelphia Eagles and New England Patriots for CBS. At the start of the second quarter, Eagles tight end Dallas Goedert seemed to cross the goal line before the Patriots forced a fumble, but it had to be reviewed.
Eagles quarterback Carson Wentz wasn’t willing to wait, so he asked a cameraman what Tony Romo thought about it.
Romo commented on air by saying he wished Wentz “would tell my wife that” he’s always right.
It did end up staying a touchdown that put the Eagles up 10-0, but they wouldn’t score another point for the remainder of the game and lost 17-10.


Panel Demo
The panel
addon allows you to display panels above or below
an editor. Click the
links in the previous paragraph to add panels to the editor.
The panel
addon allows you to display panels above or below
an editor. Click the
links in the previous paragraph to add panels to the editor.


A sequence of bytes.
The string type is a sequence of bytes. It corresponds directly to the string Lua type.


|
|
Vote Instructions (Read Carefully) Info: In order to get the maximum of the rewards for voting, you need to Vote in all Banners on our Website (WWW.L2Mythras.Eu). After Voting successfully you can type .vote ingame to claim your Rewards (Vote Coins as a Standard Reward & 1 or 2 items from the Random Category).
Voting is the most important thing for our Server and every Server. Voting for us will bring more players and it'll give you a better Gameplay.
|
|
|
|
Reward List (Standard & Random Rewards)
Standard Reward with 100% Chance: 2 to 5 Vote Coins
Random Reward with 5% Chance: 1 Scroll Blessed Enchant Weapon S
Random Reward with 5% Chance: 1 Scroll Blessed Enchant Armor S
Random Reward with 3% Chance: 1 Soul Crystall Stage 16 (Red/Blue/Green)
Random Reward with 5% Chance: 1 Soul Crystall Stage 15 (Red/Blue/Green)
Random Reward with 8% Chance: 1 Top LS Level 84
Random Reward with 15% Chance: 1 High LS Level 84
Random Reward with 15% Chance: 1 Giant's Codex - Mastery
Random Reward with 18% Chance: 1 Scroll Enchant Weapon S
Random Reward with 26% Chance: 1 Scroll Enchant Armor S
Random Reward with 80% Chance: 1 Attribute Stone (All Kinds)
Random Reward with 40% Chance: 1 Attribute Crystal (All Kinds)
|
|
|
|
Vote Coins Info: You can exchange Vote Coins for extra Rewards. Click the button on the Right to claim your Vote Gifts.
|
|
|


HIDEAWAY A film review by Jon A. Webb Copyright 1995 Jon A. Webb
Directed by Brett Leonard Written by Andrew Kevin Walker and Neal Jimenez With Jeff Goldblum (Hatch), Christine Lahti (Lindsey), Alicia Silverstone (Regina), Jeremy Sisto (Vassago).
This is a standard horror film, with average direction and writing for this genre (which is to say, they aren't too great). Production values are pretty good; the effects, which seem familiar to me from previews and other promotion of THE LAWNMOWER MAN are probably the best thing technically about this film--though I this particular class of computer effects has been used up.
The role for Jeff Goldblum is weak but okay; the other actors don't have an awful lot to do except the usual--run around and act scared or diabolical as the case may be.
The story opens nicely, with a creepy Satanic murder-suicide. Jeff Goldblum is then in an accident and dies, experiencing special effects oddly reminiscent of the wormhole from STAR TREK: DEEP SPACE NINE. When he comes back, he starts experiencing visions of violent murders. It took me a while to figure out what was going on--maybe I wasn't too quick on the uptake here but I found the false leads and their resolution pretty satisfying.
Jeff Goldblum spends quite a bit of time trying to figure out what's going on. Most of this time he doesn't have much to do but sit around and look puzzled, have visions, scribble, or make phone calls to the police. Given this limitation, he's pretty successful at making this part of the film fun to watch. I don't know how many times he has to act like he's seeing something elsewhere which leads him to some great insight--but each time he manages to do it a little differently. This shows how a good actor can help save a film with weak writing.
Jeremy Sisto has a nice greasy creepiness to him; he brings something extra to his role, and is fun to watch. I can see him quite easily as every (horror movie) father's greatest fear; the nice-looking young man his daughter brings home who sees the girl not as a work of art, but as raw materials.
I would have liked this film a lot better if it has been a little more campy. The scene at the end, with the appearance of the younger daughter, would have been enhanced a hell of a lot if when we see Alicia Silverstone's face she was allowed to roll her eyes a little ("They're *still* thinking about her! What, am I invisible?") If you're making a film like this, and you can't make it really good, try to make it really fun. All the raw materials were there (silly father, roller coaster, shotgun, etc.)
All in all I'd give this film a B for the good acting of Jeff Goldblum and Jeremy Sisto and the okay special effects. If you really enjoy this sort of thing, you'll probably enjoy this one; but I wouldn't go expecting to be scared or intrigued much.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Home
Contact
Brad Diesel
Call me whenever you can...
4 Hours Ago
John Pierce
I got your message bro
4 Hours Ago
Nora Silvester
The subject goes here
4 Hours Ago
See All Messages
15
15 Notifications
4 new messages
3 mins
8 friend requests
12 hours
3 new reports
2 days
See All Notifications
Item Master
Home
ItemMaster

Choose...
Company
Choose...
UserId
Name
Full Name
Style
Size
Rate
Add

Edit

Delete

Clear


Module: Concurrent::Actor::InternalDelegations
- Includes:
- PublicDelegations, Logger::Severity
- Included in:
- AbstractContext, Behaviour::Abstract
- Defined in:
- lib-edge/concurrent/actor/internal_delegations.rb
Instance Method Summary collapse
-
#behaviour(behaviour_class) ⇒ undocumented
see Core#behaviour.
-
#behaviour!(behaviour_class) ⇒ undocumented
see Core#behaviour!.
- #children ⇒ undocumented
- #context ⇒ AbstractContext
- #context_class ⇒ undocumented (also: #actor_class) included from PublicDelegations
- #dead_letter_routing ⇒ undocumented
- #executor ⇒ undocumented included from PublicDelegations
-
#log(level, message = nil, &block) ⇒ undocumented
delegates to core.log.
- #name ⇒ undocumented included from PublicDelegations
- #parent ⇒ undocumented included from PublicDelegations
- #path ⇒ undocumented included from PublicDelegations
- #redirect(reference, envelope = self.envelope) ⇒ undocumented
- #reference ⇒ undocumented (also: #ref) included from PublicDelegations
- #terminate!(reason = nil) ⇒ undocumented
- #terminated? ⇒ Boolean
Instance Method Details
#behaviour(behaviour_class) ⇒ undocumented
see Core#behaviour
49 50 51 |
# File 'lib-edge/concurrent/actor/internal_delegations.rb', line 49 def behaviour(behaviour_class) core.behaviour(behaviour_class) end |
#behaviour!(behaviour_class) ⇒ undocumented
see Core#behaviour!
54 55 56 |
# File 'lib-edge/concurrent/actor/internal_delegations.rb', line 54 def behaviour!(behaviour_class) core.behaviour!(behaviour_class) end |
#children ⇒ undocumented
8 9 10 |
# File 'lib-edge/concurrent/actor/internal_delegations.rb', line 8 def children core.children end |
#context ⇒ AbstractContext
44 45 46 |
# File 'lib-edge/concurrent/actor/internal_delegations.rb', line 44 def context core.context end |
#context_class ⇒ undocumented Also known as: actor_class Originally defined in module PublicDelegations
#dead_letter_routing ⇒ undocumented
34 35 36 |
# File 'lib-edge/concurrent/actor/internal_delegations.rb', line 34 def dead_letter_routing context.dead_letter_routing end |
#executor ⇒ undocumented Originally defined in module PublicDelegations
#log(level, message = nil, &block) ⇒ undocumented
delegates to core.log
29 30 31 |
# File 'lib-edge/concurrent/actor/internal_delegations.rb', line 29 def log(level, = nil, &block) core.log(level, , &block) end |
#name ⇒ undocumented Originally defined in module PublicDelegations
#parent ⇒ undocumented Originally defined in module PublicDelegations
#path ⇒ undocumented Originally defined in module PublicDelegations
#redirect(reference, envelope = self.envelope) ⇒ undocumented
38 39 40 41 |
# File 'lib-edge/concurrent/actor/internal_delegations.rb', line 38 def redirect(reference, envelope = self.envelope) reference.(envelope., envelope.future) Behaviour::MESSAGE_PROCESSED end |
#reference ⇒ undocumented Also known as: ref Originally defined in module PublicDelegations
#terminate!(reason = nil) ⇒ undocumented
13 14 15 |
# File 'lib-edge/concurrent/actor/internal_delegations.rb', line 13 def terminate!(reason = nil) behaviour!(Behaviour::Termination).terminate!(reason) end |
#terminated? ⇒ Boolean
18 19 20 |
# File 'lib-edge/concurrent/actor/internal_delegations.rb', line 18 def terminated? behaviour!(Behaviour::Termination).terminated? end |


If Disco Elysium was prototyped today.
In this exercise, I'll simulate the planning stage of Disco Elysium using a variety of prototyping techniques:
Here we try a bunch of screen layouts, colour-coded as follows:
On the left, we split gameplay and conversation down the middle, but it feels like we're giving too much space to the conversation. We try to make it smaller, but is it too small?
Let's try thirds. That looks nice. OK, how about inventory? On the left below gameplay, or on the right below the conversation?
Definitely below conversation, so we can have a nice, large gameplay area. But let's not be all squares. How about a trapezoid? And a ...bit... more space for conversation. OK, that looks good.
Right, that's a good layout. Let's see some rough concept art in it, shall we?
Dark and gritty, just like the protagonist.
OK, stop. I know this is based on my novel and all, but is there a way we can test the dialogue before we spend LOADS of time drawing stuff and coding something?
I mean, we already spent LOADS of time on the wireframes...
We've got just the tool.
Twine.
You mean this?
Not THAT kind of Twine...
This next section is Copyright © Alexei Pepers / @ampepers
Don't skip ahead. Click the red Continue button to follow the story...


Welcome to the Laptop product configurator
Please provide us with some information to your request to start the product configurator
Name
Please provide your name that we can identify your request.
E-Mail
Please provide your email address so that we can get back to you.
Address
Please provide your address.
Zip
Please provide your zip.
Existing Customer ID
Please provide your customer id that we can identify your request.
Product configurator:
Please configure your product to receive an offer.
Information
User:
Severity:
Laptop:
CPU
i5
i7
RAM
8GB
16GB
Display Size
15'
17'
HDD
500GB
1T'
Amount
50
Response


readdir
(PHP 4, PHP 5, PHP 7)
readdir — 从目录句柄中读取条目
说明
string readdir ([ resource $dir_handle ] )
返回目录中下一个文件的文件名。文件名以在文件系统中的排序返回。
参数
dir_handle
目录句柄的 resource，之前由 opendir() 打开
返回值
成功则返回文件名或者在失败时返回 FALSE
Warning
此函数可能返回布尔值 FALSE，但也可能返回等同于 FALSE 的非布尔值。请阅读布尔类型
章节以获取更多信息。应使用 === 运算符来测试此函数的返回值。
范例
Example #1 列出目录中的所有文件
请留意下面例子中检查 readdir() 返回值的风格。这里明确地测试返回值是否全等于（值
和类型都相同——更多信息参见比较运算符）FALSE，否则任何目录项的名称求值为 FALSE
的都会导致循环停止（例如一个目录名为“0”）。
Example #2 列出当前目录的所有文件并去掉 . 和 ..
参见
• is_dir() - 判断给定文件名是否是一个目录
• glob() - 寻找与模式匹配的文件路径
• opendir() - 打开目录句柄
• scandir() - 列出指定路径中的文件和目录
User Contributed Notes 28 notes
===============================================================================
A function I created to non-recursively get the path of all files and folders
including sub-directories of a given folder.
Though I have not tested it completely, it seems to be working.
[],
* 'dirs' => [],
* )
* @author sreekumar
* @param string $root
* @result array
*/
function read_all_files($root = '.'){
$files = array('files'=>array(), 'dirs'=>array());
$directories = array();
$last_letter = $root[strlen($root)-1];
$root = ($last_letter == '\\' || $last_letter == '/') ? $root : $root.
DIRECTORY_SEPARATOR;
$directories[] = $root;
while (sizeof($directories)) {
$dir = array_pop($directories);
if ($handle = opendir($dir)) {
while (false !== ($file = readdir($handle))) {
if ($file == '.' || $file == '..') {
continue;
}
$file = $dir.$file;
if (is_dir($file)) {
$directory_path = $file.DIRECTORY_SEPARATOR;
array_push($directories, $directory_path);
$files['dirs'][] = $directory_path;
} elseif (is_file($file)) {
$files['files'][] = $file;
}
}
closedir($handle);
}
}
return $files;
}
?>
===============================================================================
A variation on listing all the files in a directory recursively. The code
illustrates a basic technique : the use of an auxiliary function. It avoids
building temporary lists which are merged on the way back. Note that the array
which collects the information must be passed by reference.
===============================================================================
Looking through the examples, I can't see any that do a simple check on the
value of the directory resource that opendir returns and is subsequently used
by readdir.
If opendir returns false, and you simply pass this to the readdir call in the
while loop, you will get an infinite loop.
A simple test helps prevent this:
===============================================================================
code:
$object,
'size' => filesize($filename),
'perm' => permission($filename),
'type' => filetype($filename),
'time' => date("d F Y H:i:s",
filemtime($filename))
);
$dir_objects[] = $file_object;
}
return $dir_objects;
}
?>
call:
output sample:
Array
(
[0] => Array
(
[name] => api
[size] => 0
[perm] => drwxrwxrwx
[type] => dir
[time] => 28 May 2007 01:55:02
)
[1] => Array
(
[name] => classes
[size] => 0
[perm] => drwxrwxrwx
[type] => dir
[time] => 26 May 2007 00:56:44
)
[2] => Array
(
[name] => config.inc.php
[size] => 143
[perm] => -rw-rw-rw-
[type] => file
[time] => 26 May 2007 13:13:19
)
[3] => Array
(
[name] => index.php
[size] => 131
[perm] => -rw-rw-rw-
[type] => file
[time] => 26 May 2007 22:15:18
)
[4] => Array
(
[name] => modules
[size] => 0
[perm] => drwxrwxrwx
[type] => dir
[time] => 28 May 2007 00:47:40
)
[5] => Array
(
[name] => temp
[size] => 0
[perm] => drwxrwxrwx
[type] => dir
[time] => 28 May 2007 04:49:33
)
)
===============================================================================
===============================================================================
Here is an updated version of preg_find() [which has been linked from the glob
() man page for years] - this function should provide most of what you want
back from reading files, directories, different sorting methods, recursion, and
perhaps most powerful of all the ability to pattern match with a PCRE regex.
You can get preg_find here: http://www.pgregg.com/projects/php/preg_find/
preg_find.php.txt
or if you prefer colourful .phps format: http://www.pgregg.com/projects/php/
preg_find/preg_find.phps
or scoll down to the end of this note.
I wrote several examples on how to use it on my blog at: http://www.pgregg.com/
forums/viewtopic.php?tid=73
simple glob() type replacement:
$files = preg_find('/./', $dir);
recursive?
$files = preg_find('/./', $dir, PREG_FIND_RECURSIVE);
pattern match? find all .php files:
$files = preg_find('/\.php$/D', $dir, PREG_FIND_RECURSIVE);
sorted alphabetically?
$files = preg_find('/\.php$/D', $dir, PREG_FIND_RECURSIVE|PREG_FIND_SORTKEYS);
sorted in by filesize, in descending order?
$files = preg_find('/./', $dir,
PREG_FIND_RECURSIVE|PREG_FIND_RETURNASSOC |PREG_FIND_SORTFILESIZE|
PREG_FIND_SORTDESC);
$files=array_keys($files);
sorted by date modified?
$files = preg_find('/./', $dir,
PREG_FIND_RECURSIVE|PREG_FIND_RETURNASSOC |PREG_FIND_SORTMODIFIED);
$files=array_keys($files);
Ok, the PHP note says my note is too long, so please click on one of the above
links to get it.
===============================================================================
## List and Rename all files on recursive directories with "recursive
directory name" as template + filename
## Advice: other files in the same directory will result in a warning
## scriptname : Recursive Dir_Renfiles_dirname-filename.php
";
$count = -1;
$handle2 = @opendir($file);
while (false !== ($file2 = @readdir($handle2))) {
echo "$file2";
if ($count <10 ){ @rename("$file/$file2", "$file/$file"
."_$file2");}
else { @rename("$file/$file2", "$file/$file"."_$file2"
);}
echo "
";
$count = $count + 1;
}
echo "
";
}
}
closedir($handle);
}
?>
===============================================================================
A very flexible function to recursively list all files in a directory with the
option to perform a custom set of actions on those files and/or include extra
information about them in the returned data.
----------
SYNTAX:
$array = process_dir ( $dir , $recursive = FALSE )
$dir (STRING) = Directory to process
$recursive (BOOLEAN) = [Optional] Recursive if set to TRUE
RETURN VALUES:
The function returns an indexed array, one entry for every file. Each entry
is an associative array, containing the basic information 'filename' (name of
file) and 'dirpath' (directory component of path to file), and any additional
keys you configure. Returns FALSE on failure.
----------
To allow you to configure another key, the entry for each file is stored in
an array, "$entry" for each iteration. You can easily return any additional
data for a given file using $entry['keyname'] = ... (Note that this data can be
any variable type - string, bool, float, resource etc)
There is a string variable "$path" available, which contains the full path of
the current file, relative to the initial "$dir" supplied at function call.
This data is also available in it's constituent parts, "$dir" and "$file".
Actions for each file can be constructed on the basis of these variables. The
variables "$list", "$handle" and "$recursive" should not be used within your
code.
----------
Simply insert you code into the sections indicated by the comments below and
your away!
The following example returns filename, filepath, and file modified time (in a
human-readable string) for all items, filesize for all files but not
directories, and a resource stream for all files with 'log' in the filename
(but not *.log files).
$file, 'dirpath' => $dir);
//---------------------------------------------------------//
// - SECTION 1 - //
// Actions to be performed on ALL ITEMS //
//----------------- Begin Editable ------------------//
$entry['modtime'] = filemtime($path);
//----------------- End Editable ------------------//
do if (!is_dir($path)) {
//---------------------------------------------------------//
// - SECTION 2 - //
// Actions to be performed on FILES ONLY //
//----------------- Begin Editable ------------------//
$entry['size'] = filesize($path);
if (strstr(pathinfo($path,PATHINFO_BASENAME),'log')) {
if (!$entry['handle'] = fopen($path,r)) $entry['handle'] = "FAIL";
}
//----------------- End Editable ------------------//
break;
} else {
//---------------------------------------------------------//
// - SECTION 3 - //
// Actions to be performed on DIRECTORIES ONLY //
//----------------- Begin Editable ------------------//
//----------------- End Editable ------------------//
break;
} while (FALSE);
$list[] = $entry;
}
}
}
closedir($handle);
return $list;
} else return FALSE;
}
$result = process_dir('C:/webserver/Apache2/httpdocs/processdir',TRUE);
// Output each opened file and then close
foreach ($result as $file) {
if (is_resource($file['handle'])) {
echo "\n\nFILE (" . $file['dirpath'].'/'.$file['filename'] . "):\n\n" .
fread($file['handle'], filesize($file['dirpath'].'/'.$file['filename']));
fclose($file['handle']);
}
}
?>
===============================================================================
Below will return an array of file names and folders in directory
ReadFolderDirectory($dir."/".
$sub);
}
}
}
closedir($handler);
}
return $listDir;
}
?>
===============================================================================
If dir_handle is not a proper resource, null will be returned instead of false.
===============================================================================
loop through folders and sub folders with option to remove specific files.
';
foreach($ffs as $ff){
if(is_array($exclude) and !in_array($ff,$exclude)){
if($ff != '.' && $ff != '..'){
if(!is_dir($dir.'/'.$ff)){
echo '


--- title: 'Not Just for the Dogs: Roasted Marrow Bone Recipe' layout: post date: '2015-11-19 14:08:29 -0500' type: post parent_id: 0 published: true image: assets/images/post-img/marrow.jpg status: publish categories: - Beef meta: _thumbnail_id: 252 _edit_last: 1 _posts_by_tag_page_fields: a:2:{s:12:"widget_title";s:0:"";s:11:"widget_tags";s:0:"";} _wpghs_github_path: _posts/2015-11-19-not-just-for-the-dogs-roasted-marrow-bone-recipe.md _sha: 854917356a15b59cce0f2789464f0c191be3235f author: login: mkelley email<EMAIL_ADDRESS>display_name: Mike first_name: Mike last_name: Kelley ---
This readily available, cost-effective superfood offers unmatched goodness for the athlete in all of us.


{% extends "base.html" %} {% block content %} User Profile Save picture {{form.as_p}} Update Change Password Programmatic Keys Notifications {% if urls.user.api_activate %} Activate Send an activation e-mail to the user. {% endif %} Delete {% endblock %}


---
layout: post
title: I've Become an Open Source Developer
categories: []
tags: []
status: publish
type: post
published: true
meta:
_original_post_id: ''
_original_import_author: John Duprey
author:
---
Its hard to believe that after all these years of working with and promoting open source software, that I've finally become an open source developer. I started a project called
Kamikaze-QSCM on
tigris.org's site.
Kamikaze is a source control query tool similar to
Mozilla's bonsai. The
0.1 release is pretty basic. It only works with
Subversion and requires a
MySQL database. Future versions will support other SCM's like CVS and will, hopefully, be DB agnostic.
It ain't easy holding down a 40+ hour job and contributing to open source, but hopefully it will be rewarding. I've enjoyed working on this project and have learned a lot. I have lots of software ideas I'd like to implement not related to this project - all in good time.? Perhaps I'll write more on this later, but now I must sleep. 8-) ZZzzzzzz...
Norah Jones - House Of Blues - Los Angeles, - Cold Cold Heart


Created by Viktor Farcic & Jordi Falguera for Technology Conversations / @vfarcic / @jordi_falguera
"The hardest part of building a software system is
precisely deciding what to build." Fred Brooks.
Narrative:
In Order to [benefit]
As a [role]
I Want to [feature]
Scenario: [description]
Given [context or precondition]
When [event or action]
Then [outcome validation]
Java code:@When("user clicks the $id button")
public final void clickButton(final String id) {
// Code that clicks the button with specified ID
}
BDD step: When user clicks the login button
CommonSteps - WebSteps - MyWebSiteSteps - BackOfficeSteps - DatabaseSteps - OracleSteps - MySQLSteps - DB2Steps - APISteps - JSONSteps - WebServiceSteps - OperationsSteps - ShellSteps - WindowsSteps - TelnetSteps
BDD story: When visitor types<EMAIL_ADDRESS>into the email field When visitor types password mysecret into the password field When visitor clicks the register button
BDD story: When Web user clicks the $id element When Web user clicks the $id link When Back office user clicks the $id button
BDD story: Given Web user is using Firefox browser Given Web user opened http://www.google.com When Web user types behavior driven development in the search field Then the first result is Behavior-driven development - Wikipedia
BDD Story: Given Web user is using selected browser
Java code@When("Web user clicks the $id element")
@Aliases(values={
"Web user clicks the $id button",
"Web user clicks the $id link"
}
public final void clickElement(final String id) {
...
}
BDD story: Given user is on the home screen When user types<EMAIL_ADDRESS>into the email field When user types my_secret into the password field When user clicks the login button Then confirmation screen is opened
BDD story: Given user is logged in
Java code:@Given("user is logged in")
@Composite(steps = {
"Given user is on the home screen",
"When user types<EMAIL_ADDRESS>into the email field",
"When user types my_secret into the password field",
"When user clicks the login button",
"Then confirmation screen is opened"
}
Scenario: Visitors are able to register Given visitor is on the home screen Given visitor is NOT logged in When visitor clicks the register button Then login screen is loaded When visitor types email <email> When visitor types password <password> When visitor clicks the register button Then text <text> is displayed Examples: |email |password |text |<EMAIL_ADDRESS>|mysecret |Welcome<EMAIL_ADDRESS>|<EMAIL_ADDRESS>|secret |Password is too short | |john.doe |mysecret |Email is incorrect |


Our team of professionals will help you in maintainance of equipments after guarantee period.
We are commited to maintain world-class quality standards with cost-effective rates.
We promise to give you world-class maintanance service on time.
Our goal is to be a global player, So we passionate with our work to provide best quality services.
The continuous cooperation and support of our professional team has helped us to understand and deliver state of the art scientific instruments right from basic lab equipment to most sophisticated instruments for research labs. We believe that our tremendous success belongs to our expert engineers, managers, co-workers and other significant team members who have put their best efforts in the growth of the organization. It is their dedication and commitment that makes us the most trusted scientific instruments brand among our all satisfied clients.

The salt spray test is a standardized and popular corrosion test method, used to check corrosion resistance of materials and surface coatings.
Double walled heated and convection unit, with the outer rust prooﬁng wall made up powder coated PCRC sheet sand inner wall made up of stainless steel of grade304
Interior chamber is made of stainless steel 304 with mirror ﬁnish. The outer wall is made up of Mild Steel. The door is solid and lockable with a micro switch enabling.
Bio-safety Cabinets are made of Mild steel with epoxy powder coating and the working table is made of heavy gauge stainless steel sheet of grade ss-304.
The materials of fume hoods are carefully chosen between industrial grades ﬁre resistant commercial wooden boards covered with laminated sheets
Our Lab refrigerator is totally environmental friendly and weather resistant. Its interiors made of SS-304 (AISI Grade) and exteriors made of powder coated CRCA steel, totally corrosion free metal components.
Our Cold Room is totally environmental friendly and we at her resistant. Its interiors made of SS-304 (AISI Grade) and exteriors made of powder coated CRCA steel, totally corrosion free metal components.
Our Mortuary chamber is totally environmental friendly and weather resistant. Its interiors made of SS-304(AISI Grade) and exteriors made of powder coated CRCA steel, totally corrosion free metal components.
These are very sturdy double walled units with outer chamber is made of CRCA steel with bacteria resistance coating & inner chamber is made of high grade stainless steel sheet (SS-304 grade).
Co2 incubators are widely used in scientiﬁc research to grow and maintain microbiological cell cultures. Typical ﬁelds of application include tissue engineering, in neuroscience, vitro fertilization, cancer research and other cell research.
VACUUM OVENS are used for Heating & Drying applications under vacuum condition performed in various laboratories. The inner wall made up S.S and outer wall made up M.S sheet duly powder coated. Separate multi selves provided for comfortable test applications.
Senior management team has 20+ year of experience in this field and we obliged to provide you the best product and sevices with the help of them.
Cross functional teams from AMMATRON INSTURUMENTS, R&D, Quality Assurance and Senior Management, are regularly assembled to review and implement areas for improvement.
Our customers are confident that only with the best quality, reliable, and dependable products, can they be sure of the accuracy of their research and procedures.
Our customers are confident that only with the best quality, reliable, and dependable products for their research and procedures.


Start Quiz!
View Leaderboard
Question Timer:
Congratulations!


Learning Icelandic Online is an online learning tool created to help you learn some essential words and phrases you might need on your travels.
Click the buttons below to start learning.


There is {{length}} article between the two articles.
There are {{length}} articles between the two articles.


Toggle navigation
DU AAC
About
Services
Contact
Sign in
Sign up
Character Search
Top 5 players
{{player.name}}
Empty widget
This is a sample widget. :)


ASCIImation:
Play Controls:
Start
Stop
Animation:
Blank
Exercise
Juggler
Bike
Dive
Custom
Font Size:
Tiny
Medium
Large
Extra Large
XXL
Speed:
Turbo


Detalles
by
PyLadies - Thu, 09 Apr 2020
About the PyLadies Global Council
The beginnings
At PyCon US 2019, several PyLadies organizers and other key stakeholders met to discuss the future of PyLadies (minutes). This meeting was called to discuss several topics including, but not limited to: organizational priorities, resource management, and fundraising.
Overwhelmingly one of the largest takeaways from the workshop included the need to create a global leadership model to help PyLadies tackle these topics and continue to build for the future.
What does the PyLadies Global Council Do
TODO


--- layout: page title: "Privacy policy" permalink: /privacy-policy/ main_image_path: main_image_caption: frontpage: false homepage_description_markdown: frontpagetitle: Privacy policy archive: false images: - image_path: image_title: "" image_description: _options: main_image_path: width: 1200 height: 1200 resize_style: "contain" mime_type: "image/jpeg" _comments: title: Page title permalink: Be careful editing this main_image_path: Image used to represent your page archive: Not used yet! frontpage: Show this page on the homepage homepage_description_markdown: Text used on homepage if shown frontpagetitle: Alternative title for home page use images: Add and edit images here ---
Your privacy, and your experience of using this site is important to me.
This website is an on-line portfolio for Jo Broad and KindleCo. The site is not used to sell any goods or services directly.
It additionally offers the visitor some links to published resources. These are available to read or download for free. Where you go to a third party source of information, KindleCo is not responsible for the content or accuracy of external sites.
If you use our online contact form via this website, we will only store the information you supply to respond to your enquiry. Your details will never be passed to a third party without your permission. We do not currently publish a newsletter or undertake mailshots.
As a very small enterprise, every effort is made to keep your personal information and data secure.
You can contact us, via this website, at any time to ask to have any details you submit through it, removed from our records.
Thank you.
This site uses cookies to help us continue to improve visitor experience. If you use this site, we’ll assume you’re OK with this.
We use Google Analytics to compile anonymous, aggregated statistics that allow us to understand how users use the website and to help us improve it. Google sets a cookie for this purpose. We do not use tracking cookies to record web sites you have previously visited.


|
src/app/app.component.ts
|
component |
AppComponent |
0 %
(0/1)
|
|
src/app/confirm-button/confirm-button/confirm-button.component.ts
|
component |
ConfirmButtonComponent |
0 %
(0/7)
|
|
src/app/drawer/drawer.service.ts
|
class |
DrawerRef |
0 %
(0/6)
|
|
src/app/drawer/drawer.service.ts
|
injectable |
DrawerService |
0 %
(0/7)
|
|
src/app/drawer/drawer.service.ts
|
variable |
DRAWER_DATA |
0 %
(0/1)
|
|
src/app/drawer/drawer/drawer.component.ts
|
component |
DrawerComponent |
0 %
(0/8)
|
|
src/app/expenses/amount/amount.component.ts
|
component |
AmountComponent |
25 %
(1/4)
|
|
src/app/expenses/card/card.component.ts
|
component |
CardComponent |
12 %
(1/8)
|
|
src/app/expenses/currency.service.ts
|
injectable |
CurrencyService |
0 %
(0/5)
|
|
src/app/expenses/currency.service.ts
|
variable |
|
0 %
(0/1)
|
|
src/app/expenses/expense.ts
|
interface |
Amount |
0 %
(0/3)
|
|
src/app/expenses/expense.ts
|
interface |
Expense |
0 %
(0/9)
|
|
src/app/expenses/expense.ts
|
interface |
ExpenseStore |
0 %
(0/3)
|
|
src/app/expenses/expenses.provider.service.ts
|
injectable |
ExpensesProviderService |
0 %
(0/14)
|
|
src/app/expenses/expenses.provider.service.ts
|
variable |
headers |
0 %
(0/1)
|
|
src/app/expenses/expenses.provider.service.ts
|
variable |
|
0 %
(0/1)
|
|
src/app/expenses/expenses.service.ts
|
injectable |
ExpensesService |
0 %
(0/11)
|
|
src/app/expenses/expenses.service.ts
|
interface |
Store |
0 %
(0/6)
|
|
src/app/expenses/expenses.service.ts
|
variable |
initialStore |
0 %
(0/1)
|
|
src/app/expenses/expenses.service.ts
|
variable |
itemsPerPage |
0 %
(0/1)
|
|
src/app/expenses/form/form.component.ts
|
component |
FormComponent |
6 %
(1/15)
|
|
src/app/expenses/form/form.component.ts
|
class |
MyErrorStateMatcher |
50 %
(1/2)
|
|
src/app/expenses/list/list.component.ts
|
component |
ListComponent |
7 %
(1/13)
|
|
src/app/expenses/loader/loader.component.ts
|
component |
LoaderComponent |
33 %
(1/3)
|
|
src/app/pagination/pagination/pagination.component.ts
|
component |
PaginationComponent |
12 %
(1/8)
|
|
src/environments/environment.prod.ts
|
variable |
environment |
0 %
(0/1)
|
|
src/environments/environment.ts
|
variable |
environment |
0 %
(0/1)
|


resource odbc_connect ( string $dsn , string $user , string $password [, int $cursor_type ] )
The connection id returned by this functions is needed by other ODBC functions. You can have multiple connections open at once as long as they either use different db or different credentials. With some ODBC drivers, executing a complex stored procedure may fail with an error similar to: "Cannot open a cursor on a stored procedure that has anything other than a single select statement in it". Using SQL_CUR_USE_ODBC may avoid that error. Also, some drivers don't support the optional row_number parameter in odbc_fetch_row(). SQL_CUR_USE_ODBC might help in that case, too.
Returns an ODBC connection id or 0 (FALSE) on error.


INFO:
Join StackOverflow-Lite today
Create a free account
Ask, answer and comment on any questions!
Hello, Guest!
Welcome to, StackOverFlow Lite
STACK TIP
This is a platform for asking useful questions on any aspect of life and getting feedback from others on the platform.To ask a question, you must create an account by signing up if you do not have an account or log into your account. Use the links on the top right hand of this page as needed.


--- layout: page title: "About" description: "." header-img: "img/main_bg.jpg" ---
I work at Helix, LLC. My opinions are not necessarily those of my employer.
Also: I have a secret identity. I like making cool imagery.