Re: complexity in minibuffer

[Juri Linkov]

> I think it has to do with the way Juri (or someone else) implemented
> affixation function and annotation function, which was what I was trying
> to touch to experiment with resolution-function ideas. Sometimes as completion
> is represented by a cons (string annotation-prefix annotation-suffix)
> sometimes only a string.  It could be a string always, with properties.
> Or a struct.  But let's leave it at string and never cons.

I only added the third element to the list of '(candidate prefix suffix)'.
So either turning it into a struct, or adding text properties would be fine.
But there is no room to extend annotation-function since as can be seen
in your branch annotation-function with text properties would return such
self-referencing ugliness:

  (propertize annotation 'suffix annotation)

Or do you intend resolution-function to do the same but return
a candidate string with text properties?