Why function template 'among' is of complexity O(1) and not O(n)?

[Dicebot]

On Wednesday, 19 February 2014 at 19:45:39 UTC, Ali Çehreli wrote:
> ...

This is much better explanation - O(n) compile-time algorithm 
which results in O(1) run-time code generated :)