Comment on A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.

p03locke@lemmy.dbzer0.com ⁨1⁩ ⁨week⁩ ago

• veroxii@aussie.zone ⁨1⁩ ⁨week⁩ ago

  What are you on about? The first paragraph says hash tables are “widely used” and the second says they are “common”.

  “Data structures called hash tables” seems to just be a factual statement of what we’re dealing with, especially for people who are not programmers.

  source

  • JackbyDev@programming.dev ⁨1⁩ ⁨week⁩ ago

    It just feels bizarre. You wouldn’t say something like “a car part called a catalytic converter”.

    source

    • oyo@lemm.ee ⁨1⁩ ⁨week⁩ ago

      A catalytic converter also might be part of a wood stove. A lay-person may have no idea what a hash table is, or if they are also used in fields other than computer science.

      Why would you specify that it’s a turbo encabulator, everyone knows they’re all turbo.

      source

      • JackbyDev@programming.dev ⁨1⁩ ⁨week⁩ ago

        It feels just as odd to say “a component of fuel consuming engines called a catalytic converter”. You’re missing the point.

        source
• AnotherDirtyAnglo@lemmy.ca ⁨1⁩ ⁨week⁩ ago

  Some of my best, most useful programs sort data from disparate sources into enormous Hash-Of-Hash structures to produce extremely insightful reports. And I wrote the first version 25 years ago.

  source