It generates a hash table from the predetermined list of valid command-line options and a lookup function whose time complexity is o (1).

It was called the o (1) scheduler, because it operated in constant time, regardless of the number of tasks to schedule.

But the O (1) scheduler became unwieldy in the kernel.