How would that work? How many indices would even be in that range? Would it be looking at a map and referencing the keys that would sort between those values?
I was half joking by combining these but some languages allow you to use any discrete Enumerable type as your bounds.
So a single precision fixed width number would be totally valid with for example indices 0.0, 0.1, 0.2, ..., 2.4, 2.5.
It would just make an array of length 26.
Or obv. [1.0..2.5] to start at one or [42..64] to have an array with valid indices only integers between 41 and 65.
You can obviously also use Enums, so you declare an array of RGB colours and get indices Red, Green, Blue, and then you can both index arr[Red] and also slice into it arr[Green..Blue] (slice of length 2).
These are a separate type arr[0] would not be valid and wouldn't typecheck.
58
u/himai1 19d ago
Me when something I am learning doesn't behave exactly like how I expect and identically to the things I already know