Re^2: Extending Array

The person that concocted the term "associative array" should be ... excommunicated. This misguided attempt at creating an "easier to understand" term has caused so much confusion ...

Say NO to associative array!

Jenda
Enoch was right!
Enjoy the last years of Rome.

Comment on Re^2: Extending Array

Replies are listed 'Best First'.
Re^3: Extending Array by BrowserUk (Patriarch) on Mar 22, 2012 at 01:11 UTC
The person that concocted the term "associative array" should be ... excommunicated. The term 'associative array' way pre-dates the overloading of the term 'hash' as a name for 'content addressable storage'. SNOBOL: circa 1962 had associative arrays implemented using a form of hashing and called them 'tables'. MUMPS: circa 1966 had associative arrays implemented using sparse B-trees and just called them 'arrays'. REXX: circa 1979 had associative arrays implemented using binary trees and called them 'stems'. The term is a description of the abstract mechanism of addressing data by what it contains (the value is associated with its key); rather than by where it is (a standard C-type array); or how that abstraction is implemented (Perl's hashes). Silly to condemn a term (or its unknown coiner). With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday' Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error. "Science is about questioning the status quo. Questioning authority". In the absence of evidence, opinion is indistinguishable from prejudice. The start of some sanity?	[reply]

Replies are listed 'Best First'.

Re^3: Extending Array
by BrowserUk (Patriarch) on Mar 22, 2012 at 01:11 UTC

The person that concocted the term "associative array" should be ... excommunicated.

The term 'associative array' way pre-dates the overloading of the term 'hash' as a name for 'content addressable storage'.

SNOBOL: circa 1962 had associative arrays implemented using a form of hashing and called them 'tables'.
MUMPS: circa 1966 had associative arrays implemented using sparse B-trees and just called them 'arrays'.
REXX: circa 1979 had associative arrays implemented using binary trees and called them 'stems'.

The term is a description of the abstract mechanism of addressing data by what it contains (the value is associated with its key); rather than by where it is (a standard C-type array); or how that abstraction is implemented (Perl's hashes).

Silly to condemn a term (or its unknown coiner).

With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.

"Science is about questioning the status quo. Questioning authority".

In the absence of evidence, opinion is indistinguishable from prejudice.

The start of some sanity?

[reply]