immutable-ruby 0.0.4 → 0.2.0

Sign up to get free protection for your applications and to get access to all the features.
Files changed (356) hide show
  1. checksums.yaml +4 -4
  2. data/lib/immutable/_core.rb +3067 -0
  3. data/lib/immutable/core_ext/enumerable.rb +1 -1
  4. data/lib/immutable/core_ext/io.rb +1 -1
  5. data/lib/immutable/core_ext.rb +2 -2
  6. data/lib/immutable/deque.rb +17 -17
  7. data/lib/immutable/enumerable.rb +10 -10
  8. data/lib/immutable/hash.rb +4 -941
  9. data/lib/immutable/list.rb +36 -36
  10. data/lib/immutable/nested.rb +8 -8
  11. data/lib/immutable/set.rb +3 -583
  12. data/lib/immutable/sorted_set.rb +29 -27
  13. data/lib/immutable/trie.rb +2 -2
  14. data/lib/immutable/vector.rb +3 -1549
  15. data/lib/immutable/version.rb +1 -1
  16. data/lib/immutable.rb +9 -9
  17. metadata +34 -696
  18. data/lib/immutable/core_ext/struct.rb +0 -9
  19. data/spec/fixtures/io_spec.txt +0 -3
  20. data/spec/lib/immutable/core_ext/array_spec.rb +0 -13
  21. data/spec/lib/immutable/core_ext/enumerable_spec.rb +0 -29
  22. data/spec/lib/immutable/core_ext/io_spec.rb +0 -28
  23. data/spec/lib/immutable/deque/clear_spec.rb +0 -33
  24. data/spec/lib/immutable/deque/construction_spec.rb +0 -29
  25. data/spec/lib/immutable/deque/copying_spec.rb +0 -19
  26. data/spec/lib/immutable/deque/dequeue_spec.rb +0 -34
  27. data/spec/lib/immutable/deque/empty_spec.rb +0 -39
  28. data/spec/lib/immutable/deque/enqueue_spec.rb +0 -27
  29. data/spec/lib/immutable/deque/first_spec.rb +0 -17
  30. data/spec/lib/immutable/deque/inspect_spec.rb +0 -23
  31. data/spec/lib/immutable/deque/last_spec.rb +0 -17
  32. data/spec/lib/immutable/deque/marshal_spec.rb +0 -33
  33. data/spec/lib/immutable/deque/new_spec.rb +0 -43
  34. data/spec/lib/immutable/deque/pop_spec.rb +0 -36
  35. data/spec/lib/immutable/deque/pretty_print_spec.rb +0 -23
  36. data/spec/lib/immutable/deque/push_spec.rb +0 -36
  37. data/spec/lib/immutable/deque/random_modification_spec.rb +0 -33
  38. data/spec/lib/immutable/deque/rotate_spec.rb +0 -68
  39. data/spec/lib/immutable/deque/shift_spec.rb +0 -29
  40. data/spec/lib/immutable/deque/size_spec.rb +0 -19
  41. data/spec/lib/immutable/deque/to_a_spec.rb +0 -26
  42. data/spec/lib/immutable/deque/to_ary_spec.rb +0 -35
  43. data/spec/lib/immutable/deque/to_list_spec.rb +0 -24
  44. data/spec/lib/immutable/deque/unshift_spec.rb +0 -30
  45. data/spec/lib/immutable/hash/all_spec.rb +0 -53
  46. data/spec/lib/immutable/hash/any_spec.rb +0 -53
  47. data/spec/lib/immutable/hash/assoc_spec.rb +0 -51
  48. data/spec/lib/immutable/hash/clear_spec.rb +0 -42
  49. data/spec/lib/immutable/hash/construction_spec.rb +0 -38
  50. data/spec/lib/immutable/hash/copying_spec.rb +0 -13
  51. data/spec/lib/immutable/hash/default_proc_spec.rb +0 -72
  52. data/spec/lib/immutable/hash/delete_spec.rb +0 -39
  53. data/spec/lib/immutable/hash/dig_spec.rb +0 -34
  54. data/spec/lib/immutable/hash/each_spec.rb +0 -77
  55. data/spec/lib/immutable/hash/each_with_index_spec.rb +0 -29
  56. data/spec/lib/immutable/hash/empty_spec.rb +0 -43
  57. data/spec/lib/immutable/hash/eql_spec.rb +0 -75
  58. data/spec/lib/immutable/hash/except_spec.rb +0 -42
  59. data/spec/lib/immutable/hash/fetch_spec.rb +0 -57
  60. data/spec/lib/immutable/hash/fetch_values_spec.rb +0 -22
  61. data/spec/lib/immutable/hash/find_spec.rb +0 -43
  62. data/spec/lib/immutable/hash/flat_map_spec.rb +0 -35
  63. data/spec/lib/immutable/hash/flatten_spec.rb +0 -98
  64. data/spec/lib/immutable/hash/get_spec.rb +0 -79
  65. data/spec/lib/immutable/hash/has_key_spec.rb +0 -31
  66. data/spec/lib/immutable/hash/has_value_spec.rb +0 -27
  67. data/spec/lib/immutable/hash/hash_spec.rb +0 -29
  68. data/spec/lib/immutable/hash/inspect_spec.rb +0 -30
  69. data/spec/lib/immutable/hash/invert_spec.rb +0 -30
  70. data/spec/lib/immutable/hash/key_spec.rb +0 -27
  71. data/spec/lib/immutable/hash/keys_spec.rb +0 -15
  72. data/spec/lib/immutable/hash/map_spec.rb +0 -45
  73. data/spec/lib/immutable/hash/marshal_spec.rb +0 -28
  74. data/spec/lib/immutable/hash/merge_spec.rb +0 -82
  75. data/spec/lib/immutable/hash/min_max_spec.rb +0 -45
  76. data/spec/lib/immutable/hash/new_spec.rb +0 -70
  77. data/spec/lib/immutable/hash/none_spec.rb +0 -48
  78. data/spec/lib/immutable/hash/partition_spec.rb +0 -35
  79. data/spec/lib/immutable/hash/pretty_print_spec.rb +0 -34
  80. data/spec/lib/immutable/hash/put_spec.rb +0 -111
  81. data/spec/lib/immutable/hash/reduce_spec.rb +0 -35
  82. data/spec/lib/immutable/hash/reject_spec.rb +0 -61
  83. data/spec/lib/immutable/hash/reverse_each_spec.rb +0 -27
  84. data/spec/lib/immutable/hash/sample_spec.rb +0 -13
  85. data/spec/lib/immutable/hash/select_spec.rb +0 -57
  86. data/spec/lib/immutable/hash/size_spec.rb +0 -51
  87. data/spec/lib/immutable/hash/slice_spec.rb +0 -44
  88. data/spec/lib/immutable/hash/sort_spec.rb +0 -26
  89. data/spec/lib/immutable/hash/store_spec.rb +0 -75
  90. data/spec/lib/immutable/hash/subset_spec.rb +0 -42
  91. data/spec/lib/immutable/hash/superset_spec.rb +0 -42
  92. data/spec/lib/immutable/hash/take_spec.rb +0 -35
  93. data/spec/lib/immutable/hash/to_a_spec.rb +0 -13
  94. data/spec/lib/immutable/hash/to_hash_spec.rb +0 -21
  95. data/spec/lib/immutable/hash/to_proc_spec.rb +0 -39
  96. data/spec/lib/immutable/hash/update_in_spec.rb +0 -79
  97. data/spec/lib/immutable/hash/values_at_spec.rb +0 -33
  98. data/spec/lib/immutable/hash/values_spec.rb +0 -23
  99. data/spec/lib/immutable/list/add_spec.rb +0 -25
  100. data/spec/lib/immutable/list/all_spec.rb +0 -57
  101. data/spec/lib/immutable/list/any_spec.rb +0 -49
  102. data/spec/lib/immutable/list/append_spec.rb +0 -38
  103. data/spec/lib/immutable/list/at_spec.rb +0 -29
  104. data/spec/lib/immutable/list/break_spec.rb +0 -69
  105. data/spec/lib/immutable/list/cadr_spec.rb +0 -38
  106. data/spec/lib/immutable/list/chunk_spec.rb +0 -28
  107. data/spec/lib/immutable/list/clear_spec.rb +0 -24
  108. data/spec/lib/immutable/list/combination_spec.rb +0 -33
  109. data/spec/lib/immutable/list/compact_spec.rb +0 -34
  110. data/spec/lib/immutable/list/compare_spec.rb +0 -30
  111. data/spec/lib/immutable/list/cons_spec.rb +0 -25
  112. data/spec/lib/immutable/list/construction_spec.rb +0 -110
  113. data/spec/lib/immutable/list/copying_spec.rb +0 -19
  114. data/spec/lib/immutable/list/count_spec.rb +0 -36
  115. data/spec/lib/immutable/list/cycle_spec.rb +0 -28
  116. data/spec/lib/immutable/list/delete_at_spec.rb +0 -18
  117. data/spec/lib/immutable/list/delete_spec.rb +0 -16
  118. data/spec/lib/immutable/list/drop_spec.rb +0 -30
  119. data/spec/lib/immutable/list/drop_while_spec.rb +0 -38
  120. data/spec/lib/immutable/list/each_slice_spec.rb +0 -51
  121. data/spec/lib/immutable/list/each_spec.rb +0 -40
  122. data/spec/lib/immutable/list/each_with_index_spec.rb +0 -28
  123. data/spec/lib/immutable/list/empty_spec.rb +0 -23
  124. data/spec/lib/immutable/list/eql_spec.rb +0 -61
  125. data/spec/lib/immutable/list/fill_spec.rb +0 -49
  126. data/spec/lib/immutable/list/find_all_spec.rb +0 -70
  127. data/spec/lib/immutable/list/find_index_spec.rb +0 -35
  128. data/spec/lib/immutable/list/find_spec.rb +0 -42
  129. data/spec/lib/immutable/list/flat_map_spec.rb +0 -51
  130. data/spec/lib/immutable/list/flatten_spec.rb +0 -30
  131. data/spec/lib/immutable/list/grep_spec.rb +0 -46
  132. data/spec/lib/immutable/list/group_by_spec.rb +0 -41
  133. data/spec/lib/immutable/list/hash_spec.rb +0 -21
  134. data/spec/lib/immutable/list/head_spec.rb +0 -19
  135. data/spec/lib/immutable/list/include_spec.rb +0 -35
  136. data/spec/lib/immutable/list/index_spec.rb +0 -37
  137. data/spec/lib/immutable/list/indices_spec.rb +0 -61
  138. data/spec/lib/immutable/list/init_spec.rb +0 -28
  139. data/spec/lib/immutable/list/inits_spec.rb +0 -28
  140. data/spec/lib/immutable/list/insert_spec.rb +0 -46
  141. data/spec/lib/immutable/list/inspect_spec.rb +0 -29
  142. data/spec/lib/immutable/list/intersperse_spec.rb +0 -28
  143. data/spec/lib/immutable/list/join_spec.rb +0 -63
  144. data/spec/lib/immutable/list/last_spec.rb +0 -23
  145. data/spec/lib/immutable/list/ltlt_spec.rb +0 -19
  146. data/spec/lib/immutable/list/map_spec.rb +0 -45
  147. data/spec/lib/immutable/list/maximum_spec.rb +0 -39
  148. data/spec/lib/immutable/list/merge_by_spec.rb +0 -51
  149. data/spec/lib/immutable/list/merge_spec.rb +0 -59
  150. data/spec/lib/immutable/list/minimum_spec.rb +0 -39
  151. data/spec/lib/immutable/list/multithreading_spec.rb +0 -47
  152. data/spec/lib/immutable/list/none_spec.rb +0 -47
  153. data/spec/lib/immutable/list/one_spec.rb +0 -49
  154. data/spec/lib/immutable/list/partition_spec.rb +0 -115
  155. data/spec/lib/immutable/list/permutation_spec.rb +0 -55
  156. data/spec/lib/immutable/list/pop_spec.rb +0 -25
  157. data/spec/lib/immutable/list/product_spec.rb +0 -23
  158. data/spec/lib/immutable/list/reduce_spec.rb +0 -53
  159. data/spec/lib/immutable/list/reject_spec.rb +0 -45
  160. data/spec/lib/immutable/list/reverse_spec.rb +0 -34
  161. data/spec/lib/immutable/list/rotate_spec.rb +0 -36
  162. data/spec/lib/immutable/list/sample_spec.rb +0 -13
  163. data/spec/lib/immutable/list/select_spec.rb +0 -70
  164. data/spec/lib/immutable/list/size_spec.rb +0 -25
  165. data/spec/lib/immutable/list/slice_spec.rb +0 -229
  166. data/spec/lib/immutable/list/sorting_spec.rb +0 -46
  167. data/spec/lib/immutable/list/span_spec.rb +0 -76
  168. data/spec/lib/immutable/list/split_at_spec.rb +0 -43
  169. data/spec/lib/immutable/list/subsequences_spec.rb +0 -23
  170. data/spec/lib/immutable/list/sum_spec.rb +0 -23
  171. data/spec/lib/immutable/list/tail_spec.rb +0 -30
  172. data/spec/lib/immutable/list/tails_spec.rb +0 -28
  173. data/spec/lib/immutable/list/take_spec.rb +0 -30
  174. data/spec/lib/immutable/list/take_while_spec.rb +0 -46
  175. data/spec/lib/immutable/list/to_a_spec.rb +0 -39
  176. data/spec/lib/immutable/list/to_ary_spec.rb +0 -41
  177. data/spec/lib/immutable/list/to_list_spec.rb +0 -19
  178. data/spec/lib/immutable/list/to_set_spec.rb +0 -17
  179. data/spec/lib/immutable/list/transpose_spec.rb +0 -19
  180. data/spec/lib/immutable/list/union_spec.rb +0 -31
  181. data/spec/lib/immutable/list/uniq_spec.rb +0 -35
  182. data/spec/lib/immutable/list/zip_spec.rb +0 -23
  183. data/spec/lib/immutable/nested/construction_spec.rb +0 -101
  184. data/spec/lib/immutable/set/add_spec.rb +0 -77
  185. data/spec/lib/immutable/set/all_spec.rb +0 -51
  186. data/spec/lib/immutable/set/any_spec.rb +0 -51
  187. data/spec/lib/immutable/set/clear_spec.rb +0 -33
  188. data/spec/lib/immutable/set/compact_spec.rb +0 -30
  189. data/spec/lib/immutable/set/construction_spec.rb +0 -18
  190. data/spec/lib/immutable/set/copying_spec.rb +0 -13
  191. data/spec/lib/immutable/set/count_spec.rb +0 -36
  192. data/spec/lib/immutable/set/delete_spec.rb +0 -71
  193. data/spec/lib/immutable/set/difference_spec.rb +0 -49
  194. data/spec/lib/immutable/set/disjoint_spec.rb +0 -25
  195. data/spec/lib/immutable/set/each_spec.rb +0 -45
  196. data/spec/lib/immutable/set/empty_spec.rb +0 -44
  197. data/spec/lib/immutable/set/eqeq_spec.rb +0 -103
  198. data/spec/lib/immutable/set/eql_spec.rb +0 -109
  199. data/spec/lib/immutable/set/exclusion_spec.rb +0 -47
  200. data/spec/lib/immutable/set/find_spec.rb +0 -35
  201. data/spec/lib/immutable/set/first_spec.rb +0 -28
  202. data/spec/lib/immutable/set/flatten_spec.rb +0 -46
  203. data/spec/lib/immutable/set/grep_spec.rb +0 -57
  204. data/spec/lib/immutable/set/grep_v_spec.rb +0 -59
  205. data/spec/lib/immutable/set/group_by_spec.rb +0 -59
  206. data/spec/lib/immutable/set/hash_spec.rb +0 -22
  207. data/spec/lib/immutable/set/include_spec.rb +0 -60
  208. data/spec/lib/immutable/set/inspect_spec.rb +0 -47
  209. data/spec/lib/immutable/set/intersect_spec.rb +0 -25
  210. data/spec/lib/immutable/set/intersection_spec.rb +0 -52
  211. data/spec/lib/immutable/set/join_spec.rb +0 -64
  212. data/spec/lib/immutable/set/map_spec.rb +0 -59
  213. data/spec/lib/immutable/set/marshal_spec.rb +0 -28
  214. data/spec/lib/immutable/set/maximum_spec.rb +0 -36
  215. data/spec/lib/immutable/set/minimum_spec.rb +0 -36
  216. data/spec/lib/immutable/set/new_spec.rb +0 -53
  217. data/spec/lib/immutable/set/none_spec.rb +0 -47
  218. data/spec/lib/immutable/set/one_spec.rb +0 -47
  219. data/spec/lib/immutable/set/partition_spec.rb +0 -52
  220. data/spec/lib/immutable/set/product_spec.rb +0 -23
  221. data/spec/lib/immutable/set/reduce_spec.rb +0 -55
  222. data/spec/lib/immutable/set/reject_spec.rb +0 -50
  223. data/spec/lib/immutable/set/reverse_each_spec.rb +0 -38
  224. data/spec/lib/immutable/set/sample_spec.rb +0 -13
  225. data/spec/lib/immutable/set/select_spec.rb +0 -73
  226. data/spec/lib/immutable/set/size_spec.rb +0 -17
  227. data/spec/lib/immutable/set/sorting_spec.rb +0 -65
  228. data/spec/lib/immutable/set/subset_spec.rb +0 -51
  229. data/spec/lib/immutable/set/sum_spec.rb +0 -23
  230. data/spec/lib/immutable/set/superset_spec.rb +0 -51
  231. data/spec/lib/immutable/set/to_a_spec.rb +0 -30
  232. data/spec/lib/immutable/set/to_list_spec.rb +0 -35
  233. data/spec/lib/immutable/set/to_set_spec.rb +0 -19
  234. data/spec/lib/immutable/set/union_spec.rb +0 -63
  235. data/spec/lib/immutable/sorted_set/above_spec.rb +0 -51
  236. data/spec/lib/immutable/sorted_set/add_spec.rb +0 -62
  237. data/spec/lib/immutable/sorted_set/at_spec.rb +0 -24
  238. data/spec/lib/immutable/sorted_set/below_spec.rb +0 -51
  239. data/spec/lib/immutable/sorted_set/between_spec.rb +0 -51
  240. data/spec/lib/immutable/sorted_set/clear_spec.rb +0 -43
  241. data/spec/lib/immutable/sorted_set/copying_spec.rb +0 -20
  242. data/spec/lib/immutable/sorted_set/delete_at_spec.rb +0 -18
  243. data/spec/lib/immutable/sorted_set/delete_spec.rb +0 -89
  244. data/spec/lib/immutable/sorted_set/difference_spec.rb +0 -22
  245. data/spec/lib/immutable/sorted_set/disjoint_spec.rb +0 -25
  246. data/spec/lib/immutable/sorted_set/drop_spec.rb +0 -55
  247. data/spec/lib/immutable/sorted_set/drop_while_spec.rb +0 -34
  248. data/spec/lib/immutable/sorted_set/each_spec.rb +0 -28
  249. data/spec/lib/immutable/sorted_set/empty_spec.rb +0 -34
  250. data/spec/lib/immutable/sorted_set/eql_spec.rb +0 -120
  251. data/spec/lib/immutable/sorted_set/exclusion_spec.rb +0 -22
  252. data/spec/lib/immutable/sorted_set/fetch_spec.rb +0 -64
  253. data/spec/lib/immutable/sorted_set/find_index_spec.rb +0 -40
  254. data/spec/lib/immutable/sorted_set/first_spec.rb +0 -18
  255. data/spec/lib/immutable/sorted_set/from_spec.rb +0 -51
  256. data/spec/lib/immutable/sorted_set/group_by_spec.rb +0 -57
  257. data/spec/lib/immutable/sorted_set/include_spec.rb +0 -23
  258. data/spec/lib/immutable/sorted_set/inspect_spec.rb +0 -37
  259. data/spec/lib/immutable/sorted_set/intersect_spec.rb +0 -25
  260. data/spec/lib/immutable/sorted_set/intersection_spec.rb +0 -28
  261. data/spec/lib/immutable/sorted_set/last_spec.rb +0 -36
  262. data/spec/lib/immutable/sorted_set/map_spec.rb +0 -51
  263. data/spec/lib/immutable/sorted_set/marshal_spec.rb +0 -36
  264. data/spec/lib/immutable/sorted_set/maximum_spec.rb +0 -36
  265. data/spec/lib/immutable/sorted_set/minimum_spec.rb +0 -19
  266. data/spec/lib/immutable/sorted_set/new_spec.rb +0 -137
  267. data/spec/lib/immutable/sorted_set/reverse_each_spec.rb +0 -28
  268. data/spec/lib/immutable/sorted_set/sample_spec.rb +0 -13
  269. data/spec/lib/immutable/sorted_set/select_spec.rb +0 -61
  270. data/spec/lib/immutable/sorted_set/size_spec.rb +0 -17
  271. data/spec/lib/immutable/sorted_set/slice_spec.rb +0 -256
  272. data/spec/lib/immutable/sorted_set/sorting_spec.rb +0 -56
  273. data/spec/lib/immutable/sorted_set/subset_spec.rb +0 -47
  274. data/spec/lib/immutable/sorted_set/superset_spec.rb +0 -47
  275. data/spec/lib/immutable/sorted_set/take_spec.rb +0 -54
  276. data/spec/lib/immutable/sorted_set/take_while_spec.rb +0 -33
  277. data/spec/lib/immutable/sorted_set/to_set_spec.rb +0 -17
  278. data/spec/lib/immutable/sorted_set/union_spec.rb +0 -58
  279. data/spec/lib/immutable/sorted_set/up_to_spec.rb +0 -52
  280. data/spec/lib/immutable/sorted_set/util_spec.rb +0 -48
  281. data/spec/lib/immutable/sorted_set/values_at_spec.rb +0 -33
  282. data/spec/lib/immutable/vector/add_spec.rb +0 -67
  283. data/spec/lib/immutable/vector/any_spec.rb +0 -69
  284. data/spec/lib/immutable/vector/assoc_spec.rb +0 -45
  285. data/spec/lib/immutable/vector/bsearch_spec.rb +0 -65
  286. data/spec/lib/immutable/vector/clear_spec.rb +0 -33
  287. data/spec/lib/immutable/vector/combination_spec.rb +0 -81
  288. data/spec/lib/immutable/vector/compact_spec.rb +0 -29
  289. data/spec/lib/immutable/vector/compare_spec.rb +0 -31
  290. data/spec/lib/immutable/vector/concat_spec.rb +0 -34
  291. data/spec/lib/immutable/vector/copying_spec.rb +0 -20
  292. data/spec/lib/immutable/vector/count_spec.rb +0 -17
  293. data/spec/lib/immutable/vector/delete_at_spec.rb +0 -53
  294. data/spec/lib/immutable/vector/delete_spec.rb +0 -30
  295. data/spec/lib/immutable/vector/dig_spec.rb +0 -30
  296. data/spec/lib/immutable/vector/drop_spec.rb +0 -41
  297. data/spec/lib/immutable/vector/drop_while_spec.rb +0 -54
  298. data/spec/lib/immutable/vector/each_index_spec.rb +0 -40
  299. data/spec/lib/immutable/vector/each_spec.rb +0 -44
  300. data/spec/lib/immutable/vector/each_with_index_spec.rb +0 -39
  301. data/spec/lib/immutable/vector/empty_spec.rb +0 -41
  302. data/spec/lib/immutable/vector/eql_spec.rb +0 -76
  303. data/spec/lib/immutable/vector/fetch_spec.rb +0 -64
  304. data/spec/lib/immutable/vector/fill_spec.rb +0 -88
  305. data/spec/lib/immutable/vector/first_spec.rb +0 -18
  306. data/spec/lib/immutable/vector/flat_map_spec.rb +0 -50
  307. data/spec/lib/immutable/vector/flatten_spec.rb +0 -58
  308. data/spec/lib/immutable/vector/get_spec.rb +0 -74
  309. data/spec/lib/immutable/vector/group_by_spec.rb +0 -57
  310. data/spec/lib/immutable/vector/include_spec.rb +0 -30
  311. data/spec/lib/immutable/vector/insert_spec.rb +0 -68
  312. data/spec/lib/immutable/vector/inspect_spec.rb +0 -49
  313. data/spec/lib/immutable/vector/join_spec.rb +0 -58
  314. data/spec/lib/immutable/vector/last_spec.rb +0 -45
  315. data/spec/lib/immutable/vector/length_spec.rb +0 -45
  316. data/spec/lib/immutable/vector/ltlt_spec.rb +0 -65
  317. data/spec/lib/immutable/vector/map_spec.rb +0 -51
  318. data/spec/lib/immutable/vector/marshal_spec.rb +0 -31
  319. data/spec/lib/immutable/vector/maximum_spec.rb +0 -33
  320. data/spec/lib/immutable/vector/minimum_spec.rb +0 -33
  321. data/spec/lib/immutable/vector/multiply_spec.rb +0 -47
  322. data/spec/lib/immutable/vector/new_spec.rb +0 -50
  323. data/spec/lib/immutable/vector/partition_spec.rb +0 -52
  324. data/spec/lib/immutable/vector/permutation_spec.rb +0 -91
  325. data/spec/lib/immutable/vector/pop_spec.rb +0 -26
  326. data/spec/lib/immutable/vector/product_spec.rb +0 -70
  327. data/spec/lib/immutable/vector/reduce_spec.rb +0 -55
  328. data/spec/lib/immutable/vector/reject_spec.rb +0 -43
  329. data/spec/lib/immutable/vector/repeated_combination_spec.rb +0 -77
  330. data/spec/lib/immutable/vector/repeated_permutation_spec.rb +0 -93
  331. data/spec/lib/immutable/vector/reverse_each_spec.rb +0 -31
  332. data/spec/lib/immutable/vector/reverse_spec.rb +0 -21
  333. data/spec/lib/immutable/vector/rindex_spec.rb +0 -36
  334. data/spec/lib/immutable/vector/rotate_spec.rb +0 -73
  335. data/spec/lib/immutable/vector/sample_spec.rb +0 -13
  336. data/spec/lib/immutable/vector/select_spec.rb +0 -63
  337. data/spec/lib/immutable/vector/set_spec.rb +0 -174
  338. data/spec/lib/immutable/vector/shift_spec.rb +0 -27
  339. data/spec/lib/immutable/vector/shuffle_spec.rb +0 -43
  340. data/spec/lib/immutable/vector/slice_spec.rb +0 -240
  341. data/spec/lib/immutable/vector/sorting_spec.rb +0 -56
  342. data/spec/lib/immutable/vector/sum_spec.rb +0 -17
  343. data/spec/lib/immutable/vector/take_spec.rb +0 -42
  344. data/spec/lib/immutable/vector/take_while_spec.rb +0 -34
  345. data/spec/lib/immutable/vector/to_a_spec.rb +0 -41
  346. data/spec/lib/immutable/vector/to_ary_spec.rb +0 -34
  347. data/spec/lib/immutable/vector/to_list_spec.rb +0 -30
  348. data/spec/lib/immutable/vector/to_set_spec.rb +0 -21
  349. data/spec/lib/immutable/vector/transpose_spec.rb +0 -48
  350. data/spec/lib/immutable/vector/uniq_spec.rb +0 -76
  351. data/spec/lib/immutable/vector/unshift_spec.rb +0 -28
  352. data/spec/lib/immutable/vector/update_in_spec.rb +0 -82
  353. data/spec/lib/immutable/vector/values_at_spec.rb +0 -33
  354. data/spec/lib/immutable/vector/zip_spec.rb +0 -57
  355. data/spec/lib/load_spec.rb +0 -42
  356. data/spec/spec_helper.rb +0 -96
data/lib/immutable/set.rb CHANGED
@@ -1,583 +1,3 @@
1
- require "immutable/undefined"
2
- require "immutable/enumerable"
3
- require "immutable/hash"
4
- require "immutable/trie"
5
- require "immutable/sorted_set"
6
- require "set"
7
-
8
- module Immutable
9
-
10
- # `Immutable::Set` is a collection of unordered values with no duplicates. Testing whether
11
- # an object is present in the `Set` can be done in constant time. `Set` is also `Enumerable`, so you can
12
- # iterate over the members of the set with {#each}, transform them with {#map}, filter
13
- # them with {#select}, and so on. Some of the `Enumerable` methods are overridden to
14
- # return `immutable-ruby` collections.
15
- #
16
- # Like the `Set` class in Ruby's standard library, which we will call RubySet,
17
- # `Immutable::Set` defines equivalency of objects using `#hash` and `#eql?`. No two
18
- # objects with the same `#hash` code, and which are also `#eql?`, can coexist in the
19
- # same `Set`. If one is already in the `Set`, attempts to add another one will have
20
- # no effect.
21
- #
22
- # `Set`s have no natural ordering and cannot be compared using `#<=>`. However, they
23
- # define {#<}, {#>}, {#<=}, and {#>=} as shorthand for {#proper_subset?},
24
- # {#proper_superset?}, {#subset?}, and {#superset?} respectively.
25
- #
26
- # The basic set-theoretic operations {#union}, {#intersection}, {#difference}, and
27
- # {#exclusion} work with any `Enumerable` object.
28
- #
29
- # A `Set` can be created in either of the following ways:
30
- #
31
- # Immutable::Set.new([1, 2, 3]) # any Enumerable can be used to initialize
32
- # Immutable::Set['A', 'B', 'C', 'D']
33
- #
34
- # The latter 2 forms of initialization can be used with your own, custom subclasses
35
- # of `Immutable::Set`.
36
- #
37
- # Unlike RubySet, all methods which you might expect to "modify" an `Immutable::Set`
38
- # actually return a new set and leave the existing one unchanged.
39
- #
40
- # @example
41
- # set1 = Immutable::Set[1, 2] # => Immutable::Set[1, 2]
42
- # set2 = Immutable::Set[1, 2] # => Immutable::Set[1, 2]
43
- # set1 == set2 # => true
44
- # set3 = set1.add("foo") # => Immutable::Set[1, 2, "foo"]
45
- # set3 - set2 # => Immutable::Set["foo"]
46
- # set3.subset?(set1) # => false
47
- # set1.subset?(set3) # => true
48
- #
49
- class Set
50
- include Immutable::Enumerable
51
-
52
- class << self
53
- # Create a new `Set` populated with the given items.
54
- # @return [Set]
55
- def [](*items)
56
- items.empty? ? empty : new(items)
57
- end
58
-
59
- # Return an empty `Set`. If used on a subclass, returns an empty instance
60
- # of that class.
61
- #
62
- # @return [Set]
63
- def empty
64
- @empty ||= self.new
65
- end
66
-
67
- # "Raw" allocation of a new `Set`. Used internally to create a new
68
- # instance quickly after obtaining a modified {Trie}.
69
- #
70
- # @return [Set]
71
- # @private
72
- def alloc(trie = EmptyTrie)
73
- allocate.tap { |s| s.instance_variable_set(:@trie, trie) }.freeze
74
- end
75
- end
76
-
77
- def initialize(items=[])
78
- @trie = Trie.new(0)
79
- items.each { |item| @trie.put!(item, nil) }
80
- freeze
81
- end
82
-
83
- # Return `true` if this `Set` contains no items.
84
- # @return [Boolean]
85
- def empty?
86
- @trie.empty?
87
- end
88
-
89
- # Return the number of items in this `Set`.
90
- # @return [Integer]
91
- def size
92
- @trie.size
93
- end
94
- alias :length :size
95
-
96
- # Return a new `Set` with `item` added. If `item` is already in the set,
97
- # return `self`.
98
- #
99
- # @example
100
- # Immutable::Set[1, 2, 3].add(4) # => Immutable::Set[1, 2, 4, 3]
101
- # Immutable::Set[1, 2, 3].add(2) # => Immutable::Set[1, 2, 3]
102
- #
103
- # @param item [Object] The object to add
104
- # @return [Set]
105
- def add(item)
106
- include?(item) ? self : self.class.alloc(@trie.put(item, nil))
107
- end
108
- alias :<< :add
109
-
110
- # If `item` is not a member of this `Set`, return a new `Set` with `item` added.
111
- # Otherwise, return `false`.
112
- #
113
- # @example
114
- # Immutable::Set[1, 2, 3].add?(4) # => Immutable::Set[1, 2, 4, 3]
115
- # Immutable::Set[1, 2, 3].add?(2) # => false
116
- #
117
- # @param item [Object] The object to add
118
- # @return [Set, false]
119
- def add?(item)
120
- !include?(item) && add(item)
121
- end
122
-
123
- # Return a new `Set` with `item` removed. If `item` is not a member of the set,
124
- # return `self`.
125
- #
126
- # @example
127
- # Immutable::Set[1, 2, 3].delete(1) # => Immutable::Set[2, 3]
128
- # Immutable::Set[1, 2, 3].delete(99) # => Immutable::Set[1, 2, 3]
129
- #
130
- # @param item [Object] The object to remove
131
- # @return [Set]
132
- def delete(item)
133
- trie = @trie.delete(item)
134
- new_trie(trie)
135
- end
136
-
137
- # If `item` is a member of this `Set`, return a new `Set` with `item` removed.
138
- # Otherwise, return `false`.
139
- #
140
- # @example
141
- # Immutable::Set[1, 2, 3].delete?(1) # => Immutable::Set[2, 3]
142
- # Immutable::Set[1, 2, 3].delete?(99) # => false
143
- #
144
- # @param item [Object] The object to remove
145
- # @return [Set, false]
146
- def delete?(item)
147
- include?(item) && delete(item)
148
- end
149
-
150
- # Call the block once for each item in this `Set`. No specific iteration order
151
- # is guaranteed, but the order will be stable for any particular `Set`. If
152
- # no block is given, an `Enumerator` is returned instead.
153
- #
154
- # @example
155
- # Immutable::Set["Dog", "Elephant", "Lion"].each { |e| puts e }
156
- # Elephant
157
- # Dog
158
- # Lion
159
- # # => Immutable::Set["Dog", "Elephant", "Lion"]
160
- #
161
- # @yield [item] Once for each item.
162
- # @return [self, Enumerator]
163
- def each
164
- return to_enum if not block_given?
165
- @trie.each { |key, _| yield(key) }
166
- self
167
- end
168
-
169
- # Call the block once for each item in this `Set`. Iteration order will be
170
- # the opposite of {#each}. If no block is given, an `Enumerator` is
171
- # returned instead.
172
- #
173
- # @example
174
- # Immutable::Set["Dog", "Elephant", "Lion"].reverse_each { |e| puts e }
175
- # Lion
176
- # Dog
177
- # Elephant
178
- # # => Immutable::Set["Dog", "Elephant", "Lion"]
179
- #
180
- # @yield [item] Once for each item.
181
- # @return [self]
182
- def reverse_each
183
- return enum_for(:reverse_each) if not block_given?
184
- @trie.reverse_each { |key, _| yield(key) }
185
- self
186
- end
187
-
188
- # Return a new `Set` with all the items for which the block returns true.
189
- #
190
- # @example
191
- # Immutable::Set["Elephant", "Dog", "Lion"].select { |e| e.size >= 4 }
192
- # # => Immutable::Set["Elephant", "Lion"]
193
- # @yield [item] Once for each item.
194
- # @return [Set]
195
- def select
196
- return enum_for(:select) unless block_given?
197
- trie = @trie.select { |key, _| yield(key) }
198
- new_trie(trie)
199
- end
200
- alias :find_all :select
201
- alias :keep_if :select
202
-
203
- # Call the block once for each item in this `Set`. All the values returned
204
- # from the block will be gathered into a new `Set`. If no block is given,
205
- # an `Enumerator` is returned instead.
206
- #
207
- # @example
208
- # Immutable::Set["Cat", "Elephant", "Dog", "Lion"].map { |e| e.size }
209
- # # => Immutable::Set[8, 4, 3]
210
- #
211
- # @yield [item] Once for each item.
212
- # @return [Set]
213
- def map
214
- return enum_for(:map) if not block_given?
215
- return self if empty?
216
- self.class.new(super)
217
- end
218
- alias :collect :map
219
-
220
- # Return `true` if the given item is present in this `Set`. More precisely,
221
- # return `true` if an object with the same `#hash` code, and which is also `#eql?`
222
- # to the given object is present.
223
- #
224
- # @example
225
- # Immutable::Set["A", "B", "C"].include?("B") # => true
226
- # Immutable::Set["A", "B", "C"].include?("Z") # => false
227
- #
228
- # @param object [Object] The object to check for
229
- # @return [Boolean]
230
- def include?(object)
231
- @trie.key?(object)
232
- end
233
- alias :member? :include?
234
-
235
- # Return a member of this `Set`. The member chosen will be the first one which
236
- # would be yielded by {#each}. If the set is empty, return `nil`.
237
- #
238
- # @example
239
- # Immutable::Set["A", "B", "C"].first # => "C"
240
- #
241
- # @return [Object]
242
- def first
243
- (entry = @trie.at(0)) && entry[0]
244
- end
245
-
246
- # Return a {SortedSet} which contains the same items as this `Set`, ordered by
247
- # the given comparator block.
248
- #
249
- # @example
250
- # Immutable::Set["Elephant", "Dog", "Lion"].sort
251
- # # => Immutable::SortedSet["Dog", "Elephant", "Lion"]
252
- # Immutable::Set["Elephant", "Dog", "Lion"].sort { |a,b| a.size <=> b.size }
253
- # # => Immutable::SortedSet["Dog", "Lion", "Elephant"]
254
- #
255
- # @yield [a, b] Any number of times with different pairs of elements.
256
- # @yieldreturn [Integer] Negative if the first element should be sorted
257
- # lower, positive if the latter element, or 0 if
258
- # equal.
259
- # @return [SortedSet]
260
- def sort(&comparator)
261
- SortedSet.new(self.to_a, &comparator)
262
- end
263
-
264
- # Return a {SortedSet} which contains the same items as this `Set`, ordered
265
- # by mapping each item through the provided block to obtain sort keys, and
266
- # then sorting the keys.
267
- #
268
- # @example
269
- # Immutable::Set["Elephant", "Dog", "Lion"].sort_by { |e| e.size }
270
- # # => Immutable::SortedSet["Dog", "Lion", "Elephant"]
271
- #
272
- # @yield [item] Once for each item to create the set, and then potentially
273
- # again depending on what operations are performed on the
274
- # returned {SortedSet}. As such, it is recommended that the
275
- # block be a pure function.
276
- # @yieldreturn [Object] sort key for the item
277
- # @return [SortedSet]
278
- def sort_by(&mapper)
279
- SortedSet.new(self.to_a, &mapper)
280
- end
281
-
282
- # Return a new `Set` which contains all the members of both this `Set` and `other`.
283
- # `other` can be any `Enumerable` object.
284
- #
285
- # @example
286
- # Immutable::Set[1, 2] | Immutable::Set[2, 3] # => Immutable::Set[1, 2, 3]
287
- #
288
- # @param other [Enumerable] The collection to merge with
289
- # @return [Set]
290
- def union(other)
291
- if other.is_a?(Immutable::Set)
292
- if other.size > size
293
- small_set_pairs = @trie
294
- large_set_trie = other.instance_variable_get(:@trie)
295
- else
296
- small_set_pairs = other.instance_variable_get(:@trie)
297
- large_set_trie = @trie
298
- end
299
- else
300
- if other.respond_to?(:lazy)
301
- small_set_pairs = other.lazy.map { |e| [e, nil] }
302
- else
303
- small_set_pairs = other.map { |e| [e, nil] }
304
- end
305
- large_set_trie = @trie
306
- end
307
-
308
- trie = large_set_trie.bulk_put(small_set_pairs)
309
- new_trie(trie)
310
- end
311
- alias :| :union
312
- alias :+ :union
313
- alias :merge :union
314
-
315
- # Return a new `Set` which contains all the items which are members of both
316
- # this `Set` and `other`. `other` can be any `Enumerable` object.
317
- #
318
- # @example
319
- # Immutable::Set[1, 2] & Immutable::Set[2, 3] # => Immutable::Set[2]
320
- #
321
- # @param other [Enumerable] The collection to intersect with
322
- # @return [Set]
323
- def intersection(other)
324
- if other.size < @trie.size
325
- if other.is_a?(Immutable::Set)
326
- trie = other.instance_variable_get(:@trie).select { |key, _| include?(key) }
327
- else
328
- trie = Trie.new(0)
329
- other.each { |obj| trie.put!(obj, nil) if include?(obj) }
330
- end
331
- else
332
- trie = @trie.select { |key, _| other.include?(key) }
333
- end
334
- new_trie(trie)
335
- end
336
- alias :& :intersection
337
-
338
- # Return a new `Set` with all the items in `other` removed. `other` can be
339
- # any `Enumerable` object.
340
- #
341
- # @example
342
- # Immutable::Set[1, 2] - Immutable::Set[2, 3] # => Immutable::Set[1]
343
- #
344
- # @param other [Enumerable] The collection to subtract from this set
345
- # @return [Set]
346
- def difference(other)
347
- trie = if (@trie.size <= other.size) && (other.is_a?(Immutable::Set) || (defined?(::Set) && other.is_a?(::Set)))
348
- @trie.select { |key, _| !other.include?(key) }
349
- else
350
- @trie.bulk_delete(other)
351
- end
352
- new_trie(trie)
353
- end
354
- alias :subtract :difference
355
- alias :- :difference
356
-
357
- # Return a new `Set` which contains all the items which are members of this
358
- # `Set` or of `other`, but not both. `other` can be any `Enumerable` object.
359
- #
360
- # @example
361
- # Immutable::Set[1, 2] ^ Immutable::Set[2, 3] # => Immutable::Set[1, 3]
362
- #
363
- # @param other [Enumerable] The collection to take the exclusive disjunction of
364
- # @return [Set]
365
- def exclusion(other)
366
- ((self | other) - (self & other))
367
- end
368
- alias :^ :exclusion
369
-
370
- # Return `true` if all items in this `Set` are also in `other`.
371
- #
372
- # @example
373
- # Immutable::Set[2, 3].subset?(Immutable::Set[1, 2, 3]) # => true
374
- #
375
- # @param other [Set]
376
- # @return [Boolean]
377
- def subset?(other)
378
- return false if other.size < size
379
-
380
- # This method has the potential to be very slow if 'other' is a large Array, so to avoid that,
381
- # we convert those Arrays to Sets before checking presence of items
382
- # Time to convert Array -> Set is linear in array.size
383
- # Time to check for presence of all items in an Array is proportional to set.size * array.size
384
- # Note that both sides of that equation have array.size -- hence those terms cancel out,
385
- # and the break-even point is solely dependent on the size of this collection
386
- # After doing some benchmarking to estimate the constants, it appears break-even is at ~190 items
387
- # We also check other.size, to avoid the more expensive #is_a? checks in cases where it doesn't matter
388
- #
389
- if other.size >= 150 && @trie.size >= 190 && !(other.is_a?(Immutable::Set) || other.is_a?(::Set))
390
- other = ::Set.new(other)
391
- end
392
- all? { |item| other.include?(item) }
393
- end
394
- alias :<= :subset?
395
-
396
- # Return `true` if all items in `other` are also in this `Set`.
397
- #
398
- # @example
399
- # Immutable::Set[1, 2, 3].superset?(Immutable::Set[2, 3]) # => true
400
- #
401
- # @param other [Set]
402
- # @return [Boolean]
403
- def superset?(other)
404
- other.subset?(self)
405
- end
406
- alias :>= :superset?
407
-
408
- # Returns `true` if `other` contains all the items in this `Set`, plus at least
409
- # one item which is not in this set.
410
- #
411
- # @example
412
- # Immutable::Set[2, 3].proper_subset?(Immutable::Set[1, 2, 3]) # => true
413
- # Immutable::Set[1, 2, 3].proper_subset?(Immutable::Set[1, 2, 3]) # => false
414
- #
415
- # @param other [Set]
416
- # @return [Boolean]
417
- def proper_subset?(other)
418
- return false if other.size <= size
419
- # See comments above
420
- if other.size >= 150 && @trie.size >= 190 && !(other.is_a?(Immutable::Set) || other.is_a?(::Set))
421
- other = ::Set.new(other)
422
- end
423
- all? { |item| other.include?(item) }
424
- end
425
- alias :< :proper_subset?
426
-
427
- # Returns `true` if this `Set` contains all the items in `other`, plus at least
428
- # one item which is not in `other`.
429
- #
430
- # @example
431
- # Immutable::Set[1, 2, 3].proper_superset?(Immutable::Set[2, 3]) # => true
432
- # Immutable::Set[1, 2, 3].proper_superset?(Immutable::Set[1, 2, 3]) # => false
433
- #
434
- # @param other [Set]
435
- # @return [Boolean]
436
- def proper_superset?(other)
437
- other.proper_subset?(self)
438
- end
439
- alias :> :proper_superset?
440
-
441
- # Return `true` if this `Set` and `other` do not share any items.
442
- #
443
- # @example
444
- # Immutable::Set[1, 2].disjoint?(Immutable::Set[8, 9]) # => true
445
- #
446
- # @param other [Set]
447
- # @return [Boolean]
448
- def disjoint?(other)
449
- if other.size <= size
450
- other.each { |item| return false if include?(item) }
451
- else
452
- # See comment on #subset?
453
- if other.size >= 150 && @trie.size >= 190 && !(other.is_a?(Immutable::Set) || other.is_a?(::Set))
454
- other = ::Set.new(other)
455
- end
456
- each { |item| return false if other.include?(item) }
457
- end
458
- true
459
- end
460
-
461
- # Return `true` if this `Set` and `other` have at least one item in common.
462
- #
463
- # @example
464
- # Immutable::Set[1, 2].intersect?(Immutable::Set[2, 3]) # => true
465
- #
466
- # @param other [Set]
467
- # @return [Boolean]
468
- def intersect?(other)
469
- !disjoint?(other)
470
- end
471
-
472
- # Recursively insert the contents of any nested `Set`s into this `Set`, and
473
- # remove them.
474
- #
475
- # @example
476
- # Immutable::Set[Immutable::Set[1, 2], Immutable::Set[3, 4]].flatten
477
- # # => Immutable::Set[1, 2, 3, 4]
478
- #
479
- # @return [Set]
480
- def flatten
481
- reduce(self.class.empty) do |set, item|
482
- next set.union(item.flatten) if item.is_a?(Set)
483
- set.add(item)
484
- end
485
- end
486
-
487
- alias :group :group_by
488
- alias :classify :group_by
489
-
490
- # Return a randomly chosen item from this `Set`. If the set is empty, return `nil`.
491
- #
492
- # @example
493
- # Immutable::Set[1, 2, 3, 4, 5].sample # => 3
494
- #
495
- # @return [Object]
496
- def sample
497
- empty? ? nil : @trie.at(rand(size))[0]
498
- end
499
-
500
- # Return an empty `Set` instance, of the same class as this one. Useful if you
501
- # have multiple subclasses of `Set` and want to treat them polymorphically.
502
- #
503
- # @return [Set]
504
- def clear
505
- self.class.empty
506
- end
507
-
508
- # Return true if `other` has the same type and contents as this `Set`.
509
- #
510
- # @param other [Object] The object to compare with
511
- # @return [Boolean]
512
- def eql?(other)
513
- return true if other.equal?(self)
514
- return false if not instance_of?(other.class)
515
- other_trie = other.instance_variable_get(:@trie)
516
- return false if @trie.size != other_trie.size
517
- @trie.each do |key, _|
518
- return false if !other_trie.key?(key)
519
- end
520
- true
521
- end
522
- alias :== :eql?
523
-
524
- # See `Object#hash`.
525
- # @return [Integer]
526
- def hash
527
- reduce(0) { |hash, item| (hash << 5) - hash + item.hash }
528
- end
529
-
530
- # Return `self`. Since this is an immutable object duplicates are
531
- # equivalent.
532
- # @return [Set]
533
- def dup
534
- self
535
- end
536
- alias :clone :dup
537
-
538
- undef :"<=>" # Sets are not ordered, so Enumerable#<=> will give a meaningless result
539
- undef :each_index # Set members cannot be accessed by 'index', so #each_index is not meaningful
540
-
541
- # Return `self`.
542
- #
543
- # @return [self]
544
- def to_set
545
- self
546
- end
547
-
548
- # @private
549
- def marshal_dump
550
- output = {}
551
- each do |key|
552
- output[key] = nil
553
- end
554
- output
555
- end
556
-
557
- # @private
558
- def marshal_load(dictionary)
559
- @trie = dictionary.reduce(EmptyTrie) do |trie, key_value|
560
- trie.put(key_value.first, nil)
561
- end
562
- end
563
-
564
- private
565
-
566
- def new_trie(trie)
567
- if trie.empty?
568
- self.class.empty
569
- elsif trie.equal?(@trie)
570
- self
571
- else
572
- self.class.alloc(trie)
573
- end
574
- end
575
- end
576
-
577
- # The canonical empty `Set`. Returned by `Set[]` when
578
- # invoked with no arguments; also returned by `Set.empty`. Prefer using this
579
- # one rather than creating many empty sets using `Set.new`.
580
- #
581
- # @private
582
- EmptySet = Immutable::Set.empty
583
- end
1
+ # Definition of Immutable::Vector is in a separate file to avoid
2
+ # circular dependency warnings
3
+ require 'immutable/_core'