Clarify Set's enumeration order (#16274)

HertzDevil · web-flow · commit f5240c3137a9 · 2025-10-29T13:36:28.000+01:00
diff --git a/src/set.cr b/src/set.cr
@@ -1,10 +1,11 @@
-# `Set` implements a collection of unordered values with no duplicates.
+# `Set` implements a collection of values with no duplicates.
 #
 # An `Enumerable` object can be converted to `Set` using the `#to_set` method.
 #
 # `Set` uses `Hash` as storage, so you must note the following points:
 #
 # * Equality of elements is determined according to `Object#==` and `Object#hash`.
+# * Enumeration follows the order that the elements were inserted.
 # * `Set` assumes that the identity of each element does not change while it is stored. Modifying an element of a set will render the set to an unreliable state.
 #
 # ### Example

Original file line number	Diff line number	Diff line change
`@@ -1,10 +1,11 @@`
`1`		-# `Set` implements a collection of unordered values with no duplicates.
	`1`	+# `Set` implements a collection of values with no duplicates.
`2`	`2`	`#`
`3`	`3`	# An `Enumerable` object can be converted to `Set` using the `#to_set` method.
`4`	`4`	`#`
`5`	`5`	# `Set` uses `Hash` as storage, so you must note the following points:
`6`	`6`	`#`
`7`	`7`	# * Equality of elements is determined according to `Object#==` and `Object#hash`.
	`8`	`+# * Enumeration follows the order that the elements were inserted.`
`8`	`9`	# * `Set` assumes that the identity of each element does not change while it is stored. Modifying an element of a set will render the set to an unreliable state.
`9`	`10`	`#`
`10`	`11`	`# ### Example`