Intellisense - Tries Auto-Completion

From NARS2000
Revision as of 14:46, 26 September 2015 by Robert Wallick (talk | contribs) (Trie Structure: Created page for task)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

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).

  1. 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.

  2. It should probably be tied in to NARS System Function ⎕NC, APL's name classifications function, ref. NARS Quad NC.

  3. 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. Wikipedia entry. Google's search feature uses the concept, as does the Android OS. Here is a link to implementing an algorithm, re Google Trie example.

  4. 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.