Summary: Associative array with enum array keys is slow
           Product: D
           Version: D2
          Platform: x86
        OS/Version: Windows
            Status: NEW
          Severity: enhancement
          Priority: P2
         Component: druntime

--- Comment #0 from 2011-11-19 11:27:14 PST ---
In this benchmark program an associative array of immutable(char)[] keys is
almost twice faster than an one with immutable(E)[] keys, where E is a char
enum. I think there is some space for performance improvements.

import core.stdc.stdio: printf;
import std.string: split;

immutable string[] corpus = "the of to and a in is it you
that he was for on are with as I his they be at one have
this from or had by hot but some what there we can
out other were all your when up use word how said an
each she which do their time if will way about many then
them would write like so these her long make thing see
him two has look more day could go come did my sound
no most number who over know water than call first people
may down side been now find any new work part take get
place made live where after back little only round man year
came show every good me give our under name very through
just form much great think say help low line before turn
cause same mean differ move right boy old too does tell
sentence set three want air well also play small end put
home read hand port large spell add even land here must
big high such follow act why ask men change went light
kind off need house picture try us again animal point
mother world near build self earth father head stand own
page should country found answer school grow study still learn
plant cover food sun four thought let keep eye never last
door between city tree cross since hard start might story
saw far sea draw left late run don't while press close
night real life few stop open seem together next white
children begin got walk example ease paper often always music
those both mark book letter until mile river car feet care
second group carry took rain eat room friend began idea
fish mountain north once base hear horse cut sure watch
color face wood main enough plain girl usual young ready
above ever red list though feel talk bird soon body dog
family direct pose leave song measure state product black
short numeral class wind question happen complete ship area
half rock order fire south problem piece told knew pass
farm top whole king size heard best hour better true during
hundred am remember step early hold west ground interest reach
fast five sing listen six table travel less morning ten
simple several vowel toward war lay against pattern slow
center love person money serve appear road map science rule
govern pull cold notice voice fall power town fine certain
fly unit lead cry dark machine note wait plan figure star
box noun field rest correct able pound done beauty drive
stood contain front teach week final gave green oh quick
develop sleep warm free minute strong special mind behind
clear tail produce fact street inch lot nothing course stay
wheel full force blue object decide surface deep moon island
foot yet busy test record boat common gold possible plane
age dry wonder laugh thousand ago ran check game shape yes
hot miss brought heat snow bed bring sit perhaps fill east
weight language among".split();

enum E : char { a='a', b='b', c='c', d='d', e='e', f='f',
                g='g', h='h', i='i', j='j', k='k', l='l',
                m='m', n='n', o='o', p='p', q='q', r='r',
                s='s', t='t', u='u', v='v', w='w', x='x',
                y='y', z='z' }

alias immutable(char)[] MyString; // runtime 4.41 seconds
//alias immutable(E)[] MyString;  // runtime 7.92 seconds

int main() {
    uint[MyString] aa;
    foreach (s; corpus)
        aa[cast(MyString)s] = 0;
    aa.rehash; // optional

    foreach (i; 0 .. 100_000)
        foreach (k; corpus)
            if (!(cast(MyString)k in aa)) {
                return 1;

    return 0;

The discussion thread:

Configure issuemail:
------- You are receiving this mail because: -------

Reply via email to