Autocompletion for variable names ?

Autocompletion for variable names ?

PostPosted by FDA OSInet » Fri Sep 25, 2015 4:25 am

Slightly off subject, feel free to reclassify. It is a keyboard entry matter, though.

Would it be easy, or possible, to introduce autocompletion of variable names (with the TAB key, for instance) one day in NARS2000 ? The Bash and editors like SciTE, Geany, Code::Blocks and, perhaps, Eclipse and the like have more or less created that habit.

I understand that it is far easier to suggest than to do and will understand an answer like : "The source code is available. Feel free to implement your suggestion". I do not have the level to do that (yet?). I am just wondering whether is is technically feasible or would cause some unwanted effects.
Last edited by FDA OSInet on Sun Sep 27, 2015 12:30 pm, edited 1 time in total.
FDA OSInet
 
Posts: 29
Joined: Sun Aug 30, 2015 5:07 am

Re: Autocompletion for variable names ?

PostPosted by Robert Wallick » Sat Sep 26, 2015 10:13 am

Greetings FDA OSInet,

Re: >> Would it be easy, or possible, to introduce autocompletion of variable names (with the TAB key, for instance) one day in NARS2000, whether is is technically feasible or would cause some unwanted effects?

The auto-completion idea gets a vote for best suggestion of the month. Such a useful search-aid truly facilitates program development. This NARS user has subconsciously also been wishing for the same feature and not just for variables, but function names and even labels as well.

1. It seems that such a feature might best be an on/off user Option, indirectly - such as setting up NARS 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 and ⎕NL, APL's name classifications and names list system functions, ref. http://wiki.nars2000.org/index.php/System_Function_NC and http://wiki.nars2000.org/index.php/System_Function_NL.

3. It is also called Intellisense within Visual Studio 20xx and programmatically referred to as a Trie 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 https://en.wikipedia.org/wiki/Trie. Google's search feature uses the concept, as does the Android OS. Here is a link to implementing an algorithm, re Google, http://rmandvikar.blogspot.com/2008/10/trie-examples.html.

4. Here is an interesting do it yourself Intellisense project or DIY Intellisense, ref. http://www.codeproject.com/Articles/5839/DIY-Intellisense at the Code Project. If you visit NARS wiki page link, just below, I've found a few more C code programming examples.

Not easy, but less than impossible! Great idea :idea: :!:

Added to NARS System Programmer's Task List queue, for NARS C APL Interpreter, here http://wiki.nars2000.org/index.php/Intellisense_-_Tries_Auto-Completion. Full list of NARS System Programming Developer's Notes may be viewed here http://wiki.nars2000.org/index.php/Developer's_Notes.

THANK YOU - FDA OSInet: Have a wonderful day!

Best regards,
Robert Wallick
Robert Wallick
 
Posts: 22
Joined: Thu Feb 05, 2015 5:35 pm


Return to Entering APL Characters

Who is online

Users browsing this forum: No registered users and 0 guests

cron