README.TXT
1 KNOWN ISSUES
2 ------------
3
4 - Unit tests for the beans package may fail in the Harmony self-hosting
5 environment due to the incomplete functionality of stub classes in awt
6 and applet packages. The failing tests are:
7 java.beans.EventHandlerTest
8 java.beans.SimpleBeanInfoTest
9
10 - The find() and findBack() methods in regex nodes may work incorrectly with back references.
11 The issue may show up for such patterns as below:
12 .*(.)\\1
13 (.)\\1
14
15 - The Node.match() method is not completely optimized in regex. It may call the CharSequence.toString() method
16 even if CharacterSequence is not a string, which leads to a String creation during each call to
17 this nodes match() method.
18
19 - Methods implementing bitwise operations (and, or, and xor) in the BigInteger class might seem complicated
20 although they work rather efficiently. These methods might be rewritten in a more comprehensive form.
21
22
23 TODO
24 ----
25
26 - Implement canonical equivalence support in regex.
27
28 - Simplify multistep operations in the BigInteger class, which create
29 multiple BigInteger objects on each step. The methods gcd (), isProbablePrime(),
30 modInverse(), and modPow()can be speeded up with implementing safe in-place computations.
31
32 - Enhance the multistep BigInteger.pow() method. To reduce the number of created
33 objects, the method can be implemented by using the square-and-multiply algorithm.
34 However, the proposed implementation works longer due to longer multiplication of large numbers.
35 The enhancement may consist of implementing safe in-place multiplication
36 and possible combination of the two algorithms.
37
38 - Implement special cases for more efficient exponentiation of BigInteger.TEN and
39 multiplication by using BigInteger.TEN. These mechanisms are widely used in the BigDecimal implementation.
40
41 - Optimize the BigInteger.toString() method.
42