eessppeelllloo/processing4
1
0
Fork 0
mirror of https://github.com/processing/processing4.git synced 2026-02-11 17:40:48 +01:00
Code Issues Packages Projects Releases Wiki Activity

updated todo, code completion lookin good now, types are also displayed now btw

Browse Source
This commit is contained in:
Manindra Moharana
2013-07-13 15:39:12 +05:30
parent 87750410e9
commit d083e2eee0
2 changed files with 4 additions and 31 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
pdex/Todo, GSoC 2013.txt
View File

@@ -19,7 +19,10 @@ x! Recursive lookup for compiled(library) code!
x! Library CC for nested would be tricky. Need to jump from local->compiled code while searching recursively. Recursive find's current implementation is based on ASTNode return type. Afaik, no way to instantiate orphaned ASTNode objects(or did I miss it?). ASTNode objects have to be created only from the main ast instance. But I need to find a way to switch to compiled instances from local class instance.
*! May be I should just implement recursive find for compiled code first, see how it goes and hopefully it would give me some ideas about how to integrating the two.
- Making very good progress here. The elegance of recurion - Hats off!
- Many of the cases seem to have been covered, and I'm achieving more and more code unification as I'm working through the problem step by step
- Many of the cases seem to have been covered, and I'm achieving more and more code unification as I'm working through the problem step by step
- Looks almost complete now, nearly all cases covered(July 13th)
* Scope handling? Static/non static scope?
x Display the type of Completion(method return type, variable type) in the popup.
x! Should I implement wrapper for ASTNode? - possibly needed for code completion with compiled and non-compiled code. Done.
* Trie implementation would be lower priority, "premature optimisation is pure evil". Get all features of CC working good enough and then plan this.
x Differentiating between multiple statements on the same line. How to? Done with offset handling.

30
pdex/src/processing/mode/experimental/ASTGenerator.java
View File

@@ -1284,36 +1284,6 @@ public class ASTGenerator {
return null;
}
// private ClassMember loadClass(String className){
// RegExpResourceFilter regExpResourceFilter;
// regExpResourceFilter = new RegExpResourceFilter(".*", className + ".class");
// String[] resources = classPath.findResources("", regExpResourceFilter);
// for (String cn : resources) {
// System.out.println("-> " + cn);
// }
// if (resources.length == 0) {
// System.out.println("In defIn3rdPar(), couldn't find class: " + className);
// return null;
// }
// //TODO: Multiple matched classes? What about 'em?
// String matchedClass = resources[0];
// matchedClass = matchedClass.substring(0, matchedClass.length() - 6);
// matchedClass = matchedClass.replace('/', '.');
// System.out.println("In defIn3rdPar(), Matched class: " + matchedClass);
//
// System.out.println("Trying to load class " + className);
// try {
// Class<?> probableClass = Class.forName(className, false,
// errorCheckerService.classLoader);
// return new ClassMember(probableClass);
// } catch (ClassNotFoundException e) {
//
// System.out.println("Couldn't load " + className);
// e.printStackTrace();
// }
// return null;
// }
public void updateJavaDoc(final CompletionCandidate candidate) {
//TODO: Work on this later.
return;