carray 1.5.1 → 1.5.2

Sign up to get free protection for your applications and to get access to all the features.
Files changed (174) hide show
  1. checksums.yaml +4 -4
  2. data/{LICENSES → LICENSE} +0 -0
  3. data/NEWS.md +42 -0
  4. data/README.md +5 -5
  5. data/TODO.md +16 -0
  6. data/carray.gemspec +9 -5
  7. data/ext/ca_iter_block.c +3 -5
  8. data/ext/ca_iter_dimension.c +4 -5
  9. data/ext/ca_iter_window.c +2 -4
  10. data/ext/ca_obj_array.c +394 -124
  11. data/ext/ca_obj_bitarray.c +3 -5
  12. data/ext/ca_obj_bitfield.c +3 -5
  13. data/ext/ca_obj_block.c +6 -8
  14. data/ext/ca_obj_fake.c +3 -5
  15. data/ext/ca_obj_farray.c +3 -5
  16. data/ext/ca_obj_field.c +15 -17
  17. data/ext/ca_obj_grid.c +5 -6
  18. data/ext/ca_obj_mapping.c +2 -4
  19. data/ext/ca_obj_object.c +3 -5
  20. data/ext/ca_obj_reduce.c +2 -4
  21. data/ext/ca_obj_refer.c +5 -7
  22. data/ext/ca_obj_repeat.c +2 -4
  23. data/ext/ca_obj_select.c +2 -4
  24. data/ext/ca_obj_shift.c +3 -5
  25. data/ext/ca_obj_transpose.c +3 -5
  26. data/ext/ca_obj_unbound_repeat.c +58 -81
  27. data/ext/ca_obj_window.c +7 -9
  28. data/ext/carray.h +13 -8
  29. data/ext/carray_access.c +111 -18
  30. data/ext/carray_attribute.c +136 -197
  31. data/ext/carray_call_cfunc.c +1 -3
  32. data/ext/carray_cast.c +344 -143
  33. data/ext/carray_cast_func.rb +1 -2
  34. data/ext/carray_class.c +28 -36
  35. data/ext/carray_conversion.c +49 -59
  36. data/ext/carray_copy.c +16 -32
  37. data/ext/carray_core.c +51 -44
  38. data/ext/carray_element.c +25 -44
  39. data/ext/carray_generate.c +71 -50
  40. data/ext/carray_iterator.c +13 -15
  41. data/ext/carray_loop.c +53 -82
  42. data/ext/carray_mask.c +87 -117
  43. data/ext/carray_math.rb +8 -10
  44. data/ext/carray_mathfunc.c +1 -3
  45. data/ext/carray_numeric.c +19 -3
  46. data/ext/carray_operator.c +45 -32
  47. data/ext/carray_order.c +72 -65
  48. data/ext/carray_sort_addr.c +14 -21
  49. data/ext/carray_stat.c +1 -3
  50. data/ext/carray_stat_proc.rb +2 -4
  51. data/ext/carray_test.c +28 -30
  52. data/ext/carray_undef.c +1 -3
  53. data/ext/carray_utils.c +12 -4
  54. data/ext/extconf.rb +1 -1
  55. data/ext/mkmath.rb +1 -1
  56. data/ext/ruby_carray.c +11 -6
  57. data/ext/ruby_ccomplex.c +1 -3
  58. data/ext/ruby_float_func.c +1 -3
  59. data/ext/version.h +5 -7
  60. data/lib/carray.rb +2 -0
  61. data/lib/carray/autoload/autoload_gem_numo_narray.rb +6 -6
  62. data/lib/carray/broadcast.rb +45 -0
  63. data/lib/carray/construct.rb +21 -4
  64. data/lib/carray/iterator.rb +1 -0
  65. data/lib/carray/ordering.rb +28 -2
  66. data/spec/Classes/CABitfield_spec.rb +58 -0
  67. data/spec/Classes/CABlockIterator_spec.rb +114 -0
  68. data/spec/Classes/CABlock_spec.rb +205 -0
  69. data/spec/Classes/CAField_spec.rb +39 -0
  70. data/spec/Classes/CAGrid_spec.rb +75 -0
  71. data/spec/Classes/CAMap_spec.rb +0 -0
  72. data/{test/test_CAMapping.rb → spec/Classes/CAMapping_spec.rb} +35 -36
  73. data/spec/Classes/CAObject_attribute_spec.rb +33 -0
  74. data/spec/Classes/CAObject_spec.rb +33 -0
  75. data/spec/Classes/CARefer_spec.rb +93 -0
  76. data/spec/Classes/CARepeat_spec.rb +65 -0
  77. data/spec/Classes/CASelect_spec.rb +22 -0
  78. data/spec/Classes/CAShift_spec.rb +16 -0
  79. data/spec/Classes/CAStruct_spec.rb +71 -0
  80. data/{test/test_CATranspose.rb → spec/Classes/CATranspose_spec.rb} +20 -21
  81. data/spec/Classes/CAUnboudRepeat_spec.rb +78 -0
  82. data/spec/Classes/CAWindow_spec.rb +54 -0
  83. data/spec/Classes/CAWrap_spec.rb +8 -0
  84. data/{test/test_CArray.rb → spec/Classes/CArray_spec.rb} +48 -92
  85. data/spec/Classes/CScalar_spec.rb +55 -0
  86. data/spec/Features/feature_130_spec.rb +19 -0
  87. data/spec/Features/feature_attributes_spec.rb +280 -0
  88. data/spec/Features/feature_boolean_spec.rb +97 -0
  89. data/spec/Features/feature_broadcast.rb +100 -0
  90. data/spec/Features/feature_cast_function.rb +19 -0
  91. data/spec/Features/feature_cast_spec.rb +33 -0
  92. data/spec/Features/feature_class_spec.rb +84 -0
  93. data/spec/Features/feature_complex_spec.rb +42 -0
  94. data/{test/test_composite.rb → spec/Features/feature_composite_spec.rb} +17 -18
  95. data/spec/Features/feature_convert_spec.rb +46 -0
  96. data/spec/Features/feature_copy_spec.rb +123 -0
  97. data/spec/Features/feature_creation_spec.rb +84 -0
  98. data/spec/Features/feature_element_spec.rb +144 -0
  99. data/spec/Features/feature_extream_spec.rb +54 -0
  100. data/spec/Features/feature_generate_spec.rb +74 -0
  101. data/spec/Features/feature_index_spec.rb +69 -0
  102. data/spec/Features/feature_mask_spec.rb +574 -0
  103. data/spec/Features/feature_math_spec.rb +97 -0
  104. data/spec/Features/feature_order_spec.rb +146 -0
  105. data/spec/Features/feature_ref_store_spec.rb +209 -0
  106. data/spec/Features/feature_serialization_spec.rb +125 -0
  107. data/spec/Features/feature_stat_spec.rb +397 -0
  108. data/spec/Features/feature_virtual_spec.rb +48 -0
  109. data/spec/Features/method_eq_spec.rb +81 -0
  110. data/spec/Features/method_is_nan_spec.rb +12 -0
  111. data/spec/Features/method_map_spec.rb +54 -0
  112. data/spec/Features/method_max_with.rb +20 -0
  113. data/spec/Features/method_min_with.rb +19 -0
  114. data/spec/Features/method_ne_spec.rb +18 -0
  115. data/spec/Features/method_project_spec.rb +188 -0
  116. data/spec/Features/method_ref_spec.rb +27 -0
  117. data/spec/Features/method_round_spec.rb +11 -0
  118. data/spec/Features/method_s_linspace_spec.rb +48 -0
  119. data/spec/Features/method_s_span_spec.rb +14 -0
  120. data/spec/Features/method_seq_spec.rb +47 -0
  121. data/spec/Features/method_sort_with.rb +43 -0
  122. data/spec/Features/method_sorted_with.rb +29 -0
  123. data/spec/Features/method_span_spec.rb +42 -0
  124. data/spec/Features/method_wrap_readonly_spec.rb +43 -0
  125. data/{test → spec/UnitTest}/test_CAVirtual.rb +0 -0
  126. data/spec/spec_all.rb +0 -1
  127. data/utils/convert_test.rb +73 -0
  128. data/utils/{extract_rdoc.rb → extract_yard.rb} +7 -12
  129. metadata +77 -60
  130. data/spec/CABlockIterator/CABlockIterator_spec.rb +0 -113
  131. data/spec/CArray/bug/store_spec.rb +0 -27
  132. data/spec/CArray/index/repeat_spec.rb +0 -10
  133. data/spec/CArray/method/eq_spec.rb +0 -80
  134. data/spec/CArray/method/is_nan_spec.rb +0 -12
  135. data/spec/CArray/method/ne_spec.rb +0 -18
  136. data/spec/CArray/method/round_spec.rb +0 -11
  137. data/spec/CArray/object/_attribute_spec.rb +0 -32
  138. data/spec/CArray/object/s_new_spec.rb +0 -31
  139. data/spec/CArray/serialize/Serialization_spec.rb +0 -89
  140. data/test/test_130.rb +0 -23
  141. data/test/test_ALL.rb +0 -49
  142. data/test/test_CABitfield.rb +0 -59
  143. data/test/test_CABlock.rb +0 -208
  144. data/test/test_CAField.rb +0 -40
  145. data/test/test_CAGrid.rb +0 -76
  146. data/test/test_CAMmap.rb +0 -11
  147. data/test/test_CARefer.rb +0 -94
  148. data/test/test_CARepeat.rb +0 -66
  149. data/test/test_CASelect.rb +0 -23
  150. data/test/test_CAShift.rb +0 -17
  151. data/test/test_CAWindow.rb +0 -55
  152. data/test/test_CAWrap.rb +0 -9
  153. data/test/test_CComplex.rb +0 -83
  154. data/test/test_CScalar.rb +0 -91
  155. data/test/test_attribute.rb +0 -281
  156. data/test/test_block_iterator.rb +0 -17
  157. data/test/test_boolean.rb +0 -99
  158. data/test/test_cast.rb +0 -33
  159. data/test/test_class.rb +0 -85
  160. data/test/test_complex.rb +0 -43
  161. data/test/test_convert.rb +0 -79
  162. data/test/test_copy.rb +0 -141
  163. data/test/test_creation.rb +0 -85
  164. data/test/test_element.rb +0 -146
  165. data/test/test_extream.rb +0 -55
  166. data/test/test_generate.rb +0 -75
  167. data/test/test_index.rb +0 -71
  168. data/test/test_mask.rb +0 -578
  169. data/test/test_math.rb +0 -98
  170. data/test/test_order.rb +0 -147
  171. data/test/test_ref_store.rb +0 -211
  172. data/test/test_stat.rb +0 -406
  173. data/test/test_struct.rb +0 -72
  174. data/test/test_virtual.rb +0 -49
@@ -0,0 +1,97 @@
1
+
2
+ require 'carray'
3
+ require "rspec-power_assert"
4
+
5
+ describe "TestMath " do
6
+
7
+ example "zerodiv" do
8
+ zero = CArray.int(3,3) { 0 }
9
+ one = CArray.int(3,3) { 1 }
10
+ expect { 1/zero }.to raise_error(ZeroDivisionError)
11
+ expect { one/zero }.to raise_error(ZeroDivisionError) # div, div!
12
+ expect { one/0 }.to raise_error(ZeroDivisionError)
13
+ expect { one/zero }.to raise_error(ZeroDivisionError)
14
+ expect { one % 0 }.to raise_error(ZeroDivisionError) # mod, mod!
15
+ expect { one % zero }.to raise_error(ZeroDivisionError)
16
+ expect { zero.rcp }.to raise_error(ZeroDivisionError) # rcp!
17
+ expect { zero.rcp_mul(1) }.to raise_error(ZeroDivisionError) # rcp_mul!
18
+ expect { zero.rcp_mul(one) }.to raise_error(ZeroDivisionError)
19
+ expect { 0 ** (-one) }.to raise_error(ZeroDivisionError) # pow, pow!
20
+ expect { zero ** (-one) }.to raise_error(ZeroDivisionError)
21
+ end
22
+
23
+ example "cmp" do
24
+ a = CA_INT([0,1,2,3,4])
25
+ b = CA_INT([4,3,2,1,0])
26
+
27
+ # ---
28
+ is_asserted_by { CA_INT8([-1, -1, 0, 1, 1]) == (a <=> 2) }
29
+ is_asserted_by { CA_INT8([1, 1, 0, -1, -1]) == (2 <=> a) }
30
+ is_asserted_by { CA_INT8([-1, -1, 0, 1, 1]) == (a <=> b) }
31
+ end
32
+
33
+ example "bit_op" do
34
+ a = CArray.int(10).seq!
35
+
36
+ # ---
37
+ is_asserted_by { a.convert {|x| ~x } == (~a) }
38
+
39
+ is_asserted_by { a.convert {|x| x & 1 } == (a & 1) }
40
+ is_asserted_by { (a & 1) == (1 & a) }
41
+
42
+ is_asserted_by { a.convert { |x| x | 1 } == (a | 1) }
43
+ is_asserted_by { (a | 1) == (1 | a) }
44
+
45
+ is_asserted_by { a.convert { |x| x ^ 1 } == (a ^ 1) }
46
+ is_asserted_by { (a ^ 1) == (1 ^ a) }
47
+
48
+ # ---
49
+ is_asserted_by { a.convert { |x| x << 1 } == (a << 1) }
50
+ is_asserted_by { a.convert { |x| 1 << x } == (1 << a) }
51
+
52
+ is_asserted_by { a.convert { |x| x >> 1 } == (a >> 1) }
53
+ is_asserted_by { a.convert { |x| 1 >> x } == (1 >> a) }
54
+ end
55
+
56
+ example "max_min" do
57
+ a = CArray.int(3,3).seq!
58
+ b = a.reverse
59
+
60
+ # ---
61
+ is_asserted_by { CA_INT32([[8,7,6],
62
+ [5,4,5],
63
+ [6,7,8]]) == a.pmax(b) }
64
+ is_asserted_by { CA_INT32([[0,1,2],
65
+ [3,4,3],
66
+ [2,1,0]]) == a.pmin(b) }
67
+ # ---
68
+ is_asserted_by { CA_INT32([[0,0,0],
69
+ [0,0,0],
70
+ [0,0,0]]) == a.pmin(0) }
71
+ is_asserted_by { CA_INT32([[8,8,8],
72
+ [8,8,8],
73
+ [8,8,8]]) == a.pmax(8) }
74
+ # ---
75
+ is_asserted_by { CA_INT32([[0,0,0],
76
+ [0,0,0],
77
+ [0,0,0]]) == CA_INT32(0).pmin(a) }
78
+ is_asserted_by { CA_INT32([[8,8,8],
79
+ [8,8,8],
80
+ [8,8,8]]) == CA_INT32(8).pmax(a) }
81
+ # ---
82
+ is_asserted_by { CA_INT32([[8,7,6],
83
+ [5,4,5],
84
+ [6,7,8]]) == CAMath.max(a, b) }
85
+ is_asserted_by { CA_INT32([[0,1,2],
86
+ [3,4,3],
87
+ [2,1,0]]) == CAMath.min(a, b) }
88
+ # ---
89
+ is_asserted_by { CA_INT32([[0,0,0],
90
+ [0,0,0],
91
+ [0,0,0]]) == CAMath.min(0,a,b,8) }
92
+ is_asserted_by { CA_INT32([[8,8,8],
93
+ [8,8,8],
94
+ [8,8,8]]) == CAMath.max(0,a,b,8) }
95
+ end
96
+
97
+ end
@@ -0,0 +1,146 @@
1
+
2
+ require 'carray'
3
+ require "rspec-power_assert"
4
+
5
+ describe "TestCArrayOrder " do
6
+
7
+ example "where" do
8
+ # ---
9
+ a = CArray.int(3,3).seq!
10
+ c = (a % 2).eq(0)
11
+ is_asserted_by { a[c] == c.where.int }
12
+ end
13
+
14
+ example "index" do
15
+ # ---
16
+ a = CArray.float(3,3).seq!
17
+ is_asserted_by { CA_INT32([[0,1,2],
18
+ [3,4,5],
19
+ [6,7,8]]) == a.address }
20
+ is_asserted_by { CA_INT32([0, 1, 2]) == a.index(0) }
21
+ is_asserted_by { CA_INT32([0, 1, 2]) == a.index(1) }
22
+ end
23
+
24
+ example "indices" do
25
+ # ---
26
+ a = CArray.float(3,3).seq!
27
+ a.indices {|x, y|
28
+ is_asserted_by { CA_INT32([[0,0,0],
29
+ [1,1,1],
30
+ [2,2,2]]) == x }
31
+ is_asserted_by { CA_INT32([[0,1,2],
32
+ [0,1,2],
33
+ [0,1,2]]) == y }
34
+ }
35
+ end
36
+
37
+ example "reverse" do
38
+ a = CArray.int32(3,3).seq!
39
+ b = CArray.int32(3,3).seq!(8,-1)
40
+
41
+ # ---
42
+ is_asserted_by { b == a.reverse }
43
+ is_asserted_by { b == a.reversed }
44
+
45
+ c = a.to_ca.reverse!
46
+ is_asserted_by { b == c }
47
+ end
48
+
49
+ example "sort" do
50
+ a = CA_INT32([[5,4,3],
51
+ [0,1,2],
52
+ [8,7,6]])
53
+ s = CA_INT32([[0,1,2],
54
+ [3,4,5],
55
+ [6,7,8]])
56
+ # ---
57
+ is_asserted_by { s == a.sort }
58
+ b = a.to_ca
59
+ b.sort!
60
+ is_asserted_by { s == b }
61
+ end
62
+
63
+ example "sort_addr" do
64
+ a = CA_INT32([[5,4,3],
65
+ [0,1,2],
66
+ [8,7,6]])
67
+ # ---
68
+ is_asserted_by { CA_SIZE([[3,4,5],
69
+ [2,1,0],
70
+ [8,7,6]]) == a.sort_addr }
71
+ is_asserted_by { CA_INT32([[5,4,3],
72
+ [0,1,2],
73
+ [8,7,6]]) == a.order }
74
+ # ---
75
+ is_asserted_by { CA_SIZE([[6,7,8],
76
+ [0,1,2],
77
+ [5,4,3]]) == a.sort_addr.reverse }
78
+ is_asserted_by { CA_INT32([[3,4,5],
79
+ [8,7,6],
80
+ [0,1,2]]) == a.order(-1) }
81
+ end
82
+
83
+ # example "uniq" do
84
+ # a = CArray.int(100).random!(10)
85
+ #
86
+ # # ---
87
+ # is_asserted_by { a.to_a.uniq, a.uniq.to_a)
88
+ #
89
+ # end
90
+
91
+ example "search" do
92
+ # ---
93
+ a = CArray.int(9,9).seq!
94
+ is_asserted_by { 50 == a.bsearch(50) }
95
+ is_asserted_by { 50 == a.search(50) }
96
+ is_asserted_by { [5, 5] == a.bsearch_index(50) }
97
+ is_asserted_by { [5, 5] == a.search_index(50) }
98
+ # ---
99
+ a = CArray.int(9,9).seq!(0,2)
100
+ is_asserted_by { nil == a.bsearch(51) }
101
+ is_asserted_by { nil == a.search(51) }
102
+ is_asserted_by { nil == a.bsearch_index(51) }
103
+ is_asserted_by { nil == a.search_index(51) }
104
+ # ---
105
+ a = CArray.float(9,9).span!(0..80)
106
+ is_asserted_by { 50 == a.bsearch(50) }
107
+ is_asserted_by { 50 == a.search(50) }
108
+ is_asserted_by { [5, 5] == a.bsearch_index(50) }
109
+ is_asserted_by { [5, 5] == a.search_index(50) }
110
+
111
+ is_asserted_by { nil == a.bsearch(50.0001) }
112
+ is_asserted_by { nil == a.search(50.0001) }
113
+ is_asserted_by { nil == a.bsearch_index(50.0001) }
114
+ is_asserted_by { nil == a.search_index(50.0001) }
115
+ # ---
116
+ a = CArray.float(9,9).span!(0..80)
117
+ is_asserted_by { 50 == a.search(50.0001, 0.0001) }
118
+ is_asserted_by { [5, 5] == a.search_index(50.0001, 0.0001) }
119
+
120
+ is_asserted_by { nil == a.search(50.0001, 1.0e-05) }
121
+ is_asserted_by { nil == a.search_index(50.0001, 1.0e-05) }
122
+ end
123
+
124
+ example "search_nearest " do
125
+ # ---
126
+ a = CArray.int(9,9).seq!
127
+ is_asserted_by { 50 == a.search_nearest(50) }
128
+ is_asserted_by { [5, 5] == a.search_nearest_index(50) }
129
+ # ---
130
+ a = CArray.int(9,9).seq!(0,2)
131
+ is_asserted_by { 25 == a.search_nearest(51) }
132
+ is_asserted_by { [2, 7] == a.search_nearest_index(51) }
133
+ # ---
134
+ a = CArray.float(9,9).span!(0..80)
135
+ is_asserted_by { 50 == a.search_nearest(50) }
136
+ is_asserted_by { [5, 5] == a.search_nearest_index(50) }
137
+
138
+ is_asserted_by { 50 == a.search_nearest(50.5) }
139
+ is_asserted_by { [5, 5] == a.search_nearest_index(50.5) }
140
+
141
+ # first detected
142
+ is_asserted_by { 49 == a.search_nearest(49.5) }
143
+ is_asserted_by { [5, 4] == a.search_nearest_index(49.5) }
144
+
145
+ end
146
+ end
@@ -0,0 +1,209 @@
1
+
2
+ require 'carray'
3
+ require "rspec-power_assert"
4
+
5
+ describe "TestCArrayRefStore " do
6
+
7
+ example "access_point" do
8
+ # ---
9
+ a = CArray.int(3,3).seq!
10
+ is_asserted_by { 0 == a[0, 0] }
11
+ is_asserted_by { 4 == a[1, 1] }
12
+ is_asserted_by { 8 == a[-1, -1] }
13
+ expect { a[0,3] }.to raise_error(IndexError)
14
+ expect { a[-4,0] }.to raise_error(IndexError)
15
+
16
+ # ---
17
+ a = CArray.int(3,3).seq!
18
+ a[0,0] = -1
19
+ a[1,1] = -2
20
+ a[-1,-1] = -3
21
+ is_asserted_by { (-1) == a[0, 0] }
22
+ is_asserted_by { (-2) == a[1, 1] }
23
+ is_asserted_by { (-3) == a[-1, -1] }
24
+ expect { a[0,3] = -4 }.to raise_error(IndexError)
25
+ expect { a[-4,0] = -5 }.to raise_error(IndexError)
26
+ end
27
+
28
+ example "access_block" do
29
+ # ---
30
+ a = CArray.int(3,3).seq!
31
+ is_asserted_by { CA_INT([1, 4, 7]) == a[0..-1, 1] }
32
+ is_asserted_by { CA_INT([[1], [4], [7]]) == a[0..-1, [1]] }
33
+ is_asserted_by { CABlock == a[0..2, 0..2].class }
34
+ is_asserted_by { a == a[0..2, 0..2] }
35
+ is_asserted_by { CABlock == a[nil, nil].class }
36
+ is_asserted_by { a == a[nil, nil] }
37
+ is_asserted_by { a == a[-3..-1, -3..-1] }
38
+ is_asserted_by { CA_INT([[0, 1, 2], [3, 4, 5]]) == a[0..1, nil] }
39
+ is_asserted_by { CA_INT([[0, 2], [3, 5]]) == a[0..1, [nil, 2]] }
40
+ expect { a[0,0..3] }.to raise_error(IndexError)
41
+ expect { a[-4..-1,0] }.to raise_error(IndexError)
42
+ expect { a[0,[0,3,2]] }.to raise_error(IndexError)
43
+ expect { a[0,[0,4]] }.to raise_error(IndexError)
44
+
45
+ # ---
46
+ a = CArray.int(3,3).seq!
47
+ is_asserted_by { CA_INT([[0, 1, 2], [3, 4, 5], [6, 7, 8]]) == a }
48
+
49
+ # ---
50
+ a = CArray.int(3,3).seq!
51
+ a[0..-1, 1] = 9
52
+ is_asserted_by { CA_INT([[0, 9, 2], [3, 9, 5], [6, 9, 8]]) == a }
53
+
54
+ # ---
55
+ a = CArray.int(3,3).seq!
56
+ a[0..-1, [1]] = 9
57
+ is_asserted_by { CA_INT([[0, 9, 2], [3, 9, 5], [6, 9, 8]]) == a }
58
+
59
+ # ---
60
+ a = CArray.int(3,3).seq!
61
+ a[nil, nil] = 9
62
+ is_asserted_by { CA_INT([[9, 9, 9], [9, 9, 9], [9, 9, 9]]) == a }
63
+
64
+ # ---
65
+ a = CArray.int(3,3).seq!
66
+ a[0..1, [nil,2]] = 9
67
+ is_asserted_by { CA_INT([[9, 1, 9], [9, 4, 9], [6, 7, 8]]) == a }
68
+
69
+ # ---
70
+ a = CArray.int(3,3).seq!
71
+ expect { a[0,0..3] = -3 }.to raise_error(IndexError)
72
+ expect { a[-4..-1,0] = -4 }.to raise_error(IndexError)
73
+ expect { a[0,[0,3,2]] = -5 }.to raise_error(IndexError)
74
+ expect { a[0,[0,4]] = -6 }.to raise_error(IndexError)
75
+ end
76
+
77
+ example "access_selection" do
78
+ # ---
79
+ a = CArray.int(3,3).seq!;
80
+ is_asserted_by { CA_INT([0, 1, 2, 3, 4]) == a[a < 5] }
81
+
82
+ # ---
83
+ a = CArray.int(3,3).seq!
84
+ a[a < 5] = 1
85
+ is_asserted_by { CA_INT([[1, 1, 1], [1, 1, 5], [6, 7, 8]]) == a }
86
+ end
87
+
88
+ # example "access_mapping" do
89
+ # # ---
90
+ # a = CArray.int(3,3).seq!;
91
+ # m = a.shuffle
92
+ # is_asserted_by { 10*m, (10*a)[m])
93
+
94
+ # ---
95
+ # a = CArray.int(3,3).seq!
96
+ # b = 10*a
97
+ # m = a.shuffle
98
+ # a[m] = (10*m)
99
+ # is_asserted_by { b, a)
100
+ # end
101
+
102
+ example "access_grid" do
103
+ # ---
104
+ a = CArray.int(3,3).seq!;
105
+ is_asserted_by { CA_INT([[1, 2], [4, 5]]) == a[CA_INT([0, 1]), 1..2] }
106
+ is_asserted_by { CA_INT([[0, 2], [6, 8]]) == a[+[0, 2], +[0, 2]] }
107
+
108
+ # ---
109
+ a = CArray.int(3,3).seq!
110
+ a[+[0,2],+[0,2]] = 9
111
+ is_asserted_by { CA_INT([[9, 1, 9], [3, 4, 5], [9, 7, 9]]) == a }
112
+ end
113
+
114
+ example "access_repeat" do
115
+ # ---
116
+ # See test_CARepeat
117
+ end
118
+
119
+ example "access_method" do
120
+ # ---
121
+ a = CArray.int(3,3).seq!
122
+ is_asserted_by { CA_INT([0, 1, 2, 3, 4]) == a[:lt, 5] }
123
+
124
+ # ---
125
+ a = CArray.int(3,3).seq!
126
+ a[:lt,5] = 1
127
+ is_asserted_by { CA_INT([[1, 1, 1], [1, 1, 5], [6, 7, 8]]) == a }
128
+ end
129
+
130
+ example "access_address" do
131
+ # ---
132
+ a = CArray.int(3,3).seq!
133
+ is_asserted_by { 0 == a[0] }
134
+ is_asserted_by { 4 == a[4] }
135
+ is_asserted_by { 8 == a[-1] }
136
+ expect { a[9] }.to raise_error(IndexError)
137
+ expect { a[-10] }.to raise_error(IndexError)
138
+
139
+ # ---
140
+ a = CArray.int(3,3).seq!
141
+ a[0] = -1
142
+ a[4] = -2
143
+ a[-1] = -3
144
+ is_asserted_by { (-1) == a[0, 0] }
145
+ is_asserted_by { (-2) == a[1, 1] }
146
+ is_asserted_by { (-3) == a[-1, -1] }
147
+ expect { a[9] = -4 }.to raise_error(IndexError)
148
+ expect { a[-10] = -5 }.to raise_error(IndexError)
149
+ end
150
+
151
+ example "access_address_block" do
152
+ # ---
153
+ a = CArray.int(3,3).seq!
154
+ is_asserted_by { CA_INT([4]) == a[[4]] }
155
+ is_asserted_by { CA_INT([0, 1, 2, 3]) == a[[(0..3)]] }
156
+ is_asserted_by { CARefer == a[nil].class }
157
+ is_asserted_by { CA_INT([0, 1, 2, 3, 4, 5, 6, 7, 8]) == a[nil] }
158
+ expect { a[0..9] }.to raise_error(IndexError)
159
+ expect { a[-10..-1] }.to raise_error(IndexError)
160
+
161
+ # ---
162
+ a = CArray.int(3,3).seq!
163
+ is_asserted_by { CA_INT([[0, 1, 2], [3, 4, 5], [6, 7, 8]]) == a }
164
+
165
+ # ---
166
+ a = CArray.int(3,3).seq!
167
+ a[[1..-1,3]] = 9
168
+ is_asserted_by { CA_INT([[0, 9, 2], [3, 9, 5], [6, 9, 8]]) == a }
169
+
170
+ # ---
171
+ a = CArray.int(3,3).seq!
172
+ a[[1,3,3]] = 9
173
+ is_asserted_by { CA_INT([[0, 9, 2], [3, 9, 5], [6, 9, 8]]) == a }
174
+
175
+ # ---
176
+ a = CArray.int(3,3).seq!
177
+ a[nil] = 9
178
+ is_asserted_by { CA_INT([[9, 9, 9], [9, 9, 9], [9, 9, 9]]) == a }
179
+
180
+ # ---
181
+ a = CArray.int(3,3).seq!
182
+ expect { a[0..9] = -3 }.to raise_error(IndexError)
183
+ expect { a[-10..-1] = -4 }.to raise_error(IndexError)
184
+ end
185
+
186
+ example "access_address_selection" do
187
+ # ---
188
+ a = CArray.int(3,3).seq!;
189
+ a1 = a.flatten
190
+ is_asserted_by { CA_INT([0, 1, 2, 3, 4]) == a[a1 < 5] }
191
+
192
+ # ---
193
+ a = CArray.int(3,3).seq!
194
+ a[a1 < 5] = 1
195
+ is_asserted_by { CA_INT([[1, 1, 1], [1, 1, 5], [6, 7, 8]]) == a }
196
+ end
197
+
198
+ example "access_address_grid" do
199
+ # ---
200
+ a = CArray.int(3,3).seq!;
201
+ is_asserted_by { CA_INT([0, 2, 4, 6, 8]) == a[+[0, 2, 4, 6, 8]] }
202
+
203
+ # ---
204
+ a = CArray.int(3,3).seq!
205
+ a[+[0,2,4,6,8]] = 9
206
+ is_asserted_by { CA_INT([[9, 1, 9], [3, 9, 5], [9, 7, 9]]) == a }
207
+ end
208
+
209
+ end