That’s an interesting idea, I’m not sure how well it would work consider poal has thousands of registered users Though it would be a big list to load. Not sure what performance would be like.
We could split users list by alphabetical order 😉
Something I'm sure that's been pondered before those tree algorithms and shit
Somehow, the forum softwares Discourse and XenForo do it very quickly.
The former is open source.
(CC: , )
Be patient, my friend. 😉
Tab-complete, you'd type "@" and then say "A" you could then just tab tab tab tab to cycle through alphabetically the "A___" users. If you typed "" you'd start tab tab tab tab tab until you got to .
Short lookup works like it does on lots of platforms now, it starts making a mini-list of what it thinks the most likely usernames you're typing.
We could do that with some js magic.
I’ll take a look at it later. 😉
(post is archived)