Summary: | Rebuilding project fails with ContextStackOverflow (CompilationResult.quickPrioritize) | ||||||
---|---|---|---|---|---|---|---|
Product: | [Eclipse Project] JDT | Reporter: | Tom Krauss <tok> | ||||
Component: | Core | Assignee: | Kent Johnson <kent_johnson> | ||||
Status: | VERIFIED FIXED | QA Contact: | |||||
Severity: | normal | ||||||
Priority: | P3 | CC: | alicec | ||||
Version: | 2.0 | ||||||
Target Milestone: | 2.0.1 | ||||||
Hardware: | PC | ||||||
OS: | Windows 2000 | ||||||
Whiteboard: | |||||||
Attachments: |
|
Description
Tom Krauss
2002-07-04 07:52:58 EDT
Created attachment 1634 [details]
.log containing stacktrace of reported error
Tom: Which build/drop are you using? Does changing the number of problems per compilation unit change the behaviour? See Preferences->Java->Compiler->Errors and Warnings... If quicksort is looping, then we might have the same bug in another quick* method. Need to investigate. From Tom: I am using the final 2.0 build (200206271827). Yes! Setting the Compiler Preferences to not report any deprecations (and there are in fact many in one class I am compiling) did fix the problem. The quick sort algorithm was replaced with another (from the search indexing class Util) which is log 2 based... the previous one was order N when all the items were equal. It would divide 100 elements into 1-1 and 2-100, 2-2 and 3-100... instead of 1- 49 and 51-100, etc. *** Bug 22392 has been marked as a duplicate of this bug. *** Verified. Verified in 2.1 M1 |