Intellisense - Tries Auto-Completion
Intellisense - Trie Structure - Auto-Completion for APL variable names, function names and labels.
System Programming Task in C: Introduce into NARS: Auto-Completion of variable names, function names, and labels (with the TAB key, for instance).
- Such a feature might best be an on/off option, such as setting up a keyboard layout, except with the ability to turn it on/off from within NARS.
- It should probably be tied in to NARS System Functions ⎕NC and ⎕NL, APL's name classifications and names list functions respectively, ref. NARS Quad NC and NARS Quad NL.
- It is also called Intellisense within Microsoft's Visual Studio 20xx and programmatically referred to as a Trie structure in Computer Science: a Trie, also called digital tree and sometimes radix tree or prefix tree (as they can be searched by prefixes), is an ordered tree data structure that is used to store a dynamic set or associative array where the keys are usually strings, ref. Wikipedia entry. Google's search feature (and Internet Explorer's search box and web pages address textbox) uses the concept, as does the Android OS - particularly for text messaging where word suggestions become invoked for the current [partial] word being typed in and or contextually/definitionally relevant suggestions. Here is a link to implementing an algorithm, re Google Trie example.
- Interesting do-it-yourself Intellisense project or DIY Intellisense, ref. Intellisense DIY Code Project. Another C Implementation: Trie implementation in C. Still another C Implementation / C Code for Radix Tree or Trie: C code for Radix Tree (or Trie).
Actually programming the interface into NARS is not impossible. It would be less easy than implementing a new system quad function into NARS, which can frequently be no easy task in and of itself, but again not impossible. The above hyperlinks were valid as of 9/26/2015.