Cool measurement. Wonder if using the structure I suggested and doing
```C++
  const int kOffset =10;
  int j=0;
  for(int i = 0; i< 7; ++i) {
     if(s == axesNames[j]) return DDAxes(i);
     j+=kOffset;
  }
```
Would be faster since everything is in the cache and there is no pointer chasing. But again, given how this is used we probably are way over engineering (because it is a fun thought experiment).