Guest User

Untitled

a guest
Dec 18th, 2018
66
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 3.11 KB | None | 0 0
  1. use packed_simd::{m8x64, shuffle, u8x64};
  2.  
  3. fn shuffle_right(v: u8x64) -> u8x64 {
  4. shuffle!(
  5. v,
  6. [
  7. 63, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22,
  8. 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44,
  9. 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62
  10. ]
  11. )
  12. }
  13.  
  14. fn shuffle_left(v: u8x64) -> u8x64 {
  15. shuffle!(
  16. v,
  17. [
  18. 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,
  19. 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46,
  20. 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 0
  21. ]
  22. )
  23. }
  24.  
  25. fn step(src: &[u8x64; 52], dst: &mut [u8x64; 52]) {
  26. let mask = m8x64::new(
  27. false, true, true, true, true, true, true, true, true, true, true, true, true, true, true,
  28. true, true, true, true, true, true, true, true, true, true, true, true, true, true, true,
  29. true, true, true, true, true, true, true, true, true, true, true, true, true, true, true,
  30. true, true, true, true, true, true, false, false, false, false, false, false, false, false,
  31. false, false, false, false, false,
  32. );
  33. let open = u8x64::splat(0);
  34. let tree = u8x64::splat(1);
  35. let lumber = u8x64::splat(2);
  36.  
  37. for (dst, src) in dst[1..51].iter_mut().zip(src.windows(3)) {
  38. let t = src[0];
  39. let c = src[1];
  40. let b = src[2];
  41.  
  42. let tl = shuffle_left(t);
  43. let tr = shuffle_right(t);
  44. let l = shuffle_left(c);
  45. let r = shuffle_right(c);
  46. let bl = shuffle_left(b);
  47. let br = shuffle_right(b);
  48.  
  49. let tree_tl = tl & tree;
  50. let tree_tr = tr & tree;
  51. let tree_l = l & tree;
  52. let tree_r = r & tree;
  53. let tree_bl = bl & tree;
  54. let tree_br = br & tree;
  55. let tree_t = t & tree;
  56. let tree_b = b & tree;
  57.  
  58. let tree_counts = tree_tl + tree_tr + tree_l + tree_r + tree_bl + tree_br + tree_t + tree_b;
  59. let new_open = tree_counts.ge(u8x64::splat(3)).select(tree, open);
  60.  
  61. let lumber_tl = tl & lumber;
  62. let lumber_tr = tr & lumber;
  63. let lumber_l = l & lumber;
  64. let lumber_r = r & lumber;
  65. let lumber_bl = bl & lumber;
  66. let lumber_br = br & lumber;
  67. let lumber_t = t & lumber;
  68. let lumber_b = b & lumber;
  69.  
  70. let lumber_counts_times_two = lumber_tl
  71. + lumber_tr
  72. + lumber_l
  73. + lumber_r
  74. + lumber_bl
  75. + lumber_br
  76. + lumber_t
  77. + lumber_b;
  78.  
  79. let new_tree = lumber_counts_times_two
  80. .ge(u8x64::splat(6))
  81. .select(lumber, tree);
  82.  
  83. let new_lumber = (tree_counts.ge(u8x64::splat(1))
  84. | lumber_counts_times_two.ge(u8x64::splat(2)))
  85. .select(lumber, open);
  86.  
  87. let is_lumber = c.eq(lumber);
  88. let is_tree = c.eq(tree);
  89.  
  90. let new_cells = is_tree.select(new_tree, is_lumber.select(new_lumber, new_open));
  91.  
  92. *dst = mask.select(new_cells, u8x64::splat(0));
  93. }
  94. }
Add Comment
Please, Sign In to add comment