View source for Intellisense - Tries Auto-Completion

<big>Intellisense - Trie Structure - Auto-Completion</big> for '''APL variable names, function names and labels'''.<br><br>

System Programming Task in C: <u>Introduce into NARS: Auto-Completion</u> of variable names, function names, and labels (with the TAB key, for instance).<br><br>

# 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.<br><br>
# It should probably be tied in to NARS System Function ⎕NC, APL's name classifications function, ref. '''[http://wiki.nars2000.org/index.php/System_Function_NC NARS Quad NC]'''.<br><br>
# It is also called '''Intellisense''' within 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. [https://en.wikipedia.org/wiki/Trie Wikipedia entry].  Google's search feature uses the concept, as does the Android OS.  Here is a link to implementing an algorithm, re [http://rmandvikar.blogspot.com/2008/10/trie-examples.html Google Trie example].<br><br>
# Interesting do it yourself Intellisense project or DIY Intellisense, ref. '''[http://www.codeproject.com/Articles/5839/DIY-Intellisense Intellisense DIY Code Project]'''. Another C Implementation: '''[http://simplestcodings.blogspot.com/2012/11/trie-implementation-in-c.html Trie implementation in C]'''. Still another C Implementation / C Code for Radix Tree or Trie: '''[http://programminggeeks.com/c-code-for-radix-tree-or-trie/ C code for Radix Tree (or Trie)]'''.<br><br>

<p>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.</p><br>