On Wed, 2 Feb 2022, Elijah Stone wrote:
> Ordinary j arrays permit many keys. Rather than key -> value, they have
> key0 * key1 * key2 * ... -> value. I therefore think that, for
> consistency, maps should behave the same way.
Map's key can be non-scalar. Therefore, there will be a need to distinguish
between composite key, say (1,2,3) and three scalar keys (1), (2) and (3). Or
ban composite keys.
J arrays also permit:
1) indexes of any shape (e.g. (i. 2 2) { 'abcd'),
2) axes omitting and subarray selecting.
Should maps support this features too? If yes, then:
1) how to align shapes of different values, which may differ in shape and
even datatype?
2) what should be returned if a value is not defined yet for some key
requested?
IMHO, map as datatype is too far from J array. So, I doubt the need to make it
behave the same way.
--
Regards
Igor
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
