I would like to have support for ordering content of a constant array at compile time.

I would like to have optimized lookup function for such an ordered constant array (binary search, hash index, etc, – whatever fits the purpose) to check if a variable has a match in the ordered constant array. The code generator could inline the lookup function if so was desired.

I guess you can say that I am looking for something like the “in” keyword for sets, but extended to work with any constant array (string, array of enumerable, array of number, or array of other constants such as class type references).

A specification syntax could look something like:
   = {ordered {ascending | descending}} Vector

Implicit methods associated with the type:
  Vector.Contains(const element: T):Boolean;
  Vector.ContainsAny(const array of T):Boolean;
  Vector.ContainsAll(const array of T):Boolean;
  Vector.Include(const element: T);
  Vector.Exclude(const element: T);

Example declaration:
type
  TMyType = ordered ascending Vector;
const
  InvalidChars : TMyType = [‘\’, ‘:’, ‘.’, ‘(‘, ‘)’]; // I don’t want to worry about order here

Example of use:
  if InvalidChars.Contains(SomeCharacter) then …

Today, I can create singleton objects that are ordered as part of the initialization code, but it becomes a lot of micro management code which isn’t optimized for call performance, instead of easy to use code like “element in set” style code.