Implement a cmp specialization for ranges

[LilithHafner]

• Implement a cmp specialization for ranges
• Add tests (gen AI helped populate const EXAMPLE_RANGES)

Fixes #60334

[Seelengrab]

Suggested change

	@test try cmp(a, b) catch e; e end == try cmp(collect(a), collect(b)) catch e; e end
	@test cmp(a, b) == cmp(collect(a), collect(b))

Isn't exception handling done by @test already?

[Seelengrab]

Or is this to compare that the errors are the same..? If so, IMO that should be done in a test explicit for that case, rather than mixing it into the general one. Alternatively we don't check this at all, since just comparing the thrown object doesn't mean that it's the same error - the location it was thrown from can be different too.

[adienes]

here is another good stressor

julia> r1 = LinRange(0.3376448676263234, 1.509664528429199, 3);

julia> r2 = range(0.3376448676263234, step=0.5860098304014378, length=3);

julia> isless(r1, r2) || isless(r2, r1) || isequal(r1, r2)
false

I think forcing the fast path to have the same concrete types will resolve this type of edge case

[mbauman]

last(zip(r1, r2)) is still the abstract iterator's O(n) isn't it? And if we're doing an O(n) thing, we might as well compare everything, no? The goal here should be to detect the "fast" outs that are definitively correct, falling back to O(n) iteration if we can't do that.

The worst case is where step is identical, but, yeah, it's tricky to rely on step(r). Perhaps this should just be done for OrdinalRanges.

[adienes]

last(::Zip) is actually O(1) in most cases but I agree it will be challenging for any generic implementation to work for all ranges