Talk:Comparison of programming languages (associative array): Difference between revisions

Content deleted Content added
Notification of altered sources needing review #IABot (v1.5beta)
Line 44:
 
Cheers.—[[User:InternetArchiveBot|'''<span style="color:darkgrey;font-family:monospace">InternetArchiveBot</span>''']] <span style="color:green;font-family:Rockwell">([[User talk:InternetArchiveBot|Report bug]])</span> 17:37, 11 August 2017 (UTC)
 
== Section D - source does not support claim ==
 
In the section on [[Comparison of programming languages (associative array)#D|D]], it is claimed that the built-in associative arrays "are implemented as a chaining hash table with binary trees" and [https://digitalmars.com/d/2.0/hash-map.html] is given as source. However, that site does not give any implementation details - D language specification never does.
 
By the way, the up-to-date version of that site would be [https://dlang.org/spec/hash-map.html].
 
Best --[[Special:Contributions/2001:638:807:20D:811C:1DE9:F2A0:37BB|2001:638:807:20D:811C:1DE9:F2A0:37BB]] ([[User talk:2001:638:807:20D:811C:1DE9:F2A0:37BB|talk]]) 15:20, 10 April 2019 (UTC)