Implement a fast method to do table-based interface checks. This can be done in 
O(log N) time rather than the O(N) used at present.

The table lookups introduced in https://bugs.openjdk.org/browse/JDK-8180450 are 
very fast for classes that implement a small number of interfaces, which is 
normal for Java. However, some JVM languages have idioms that require a class 
to implement a larger number of interfaces. 

---------
- [x] I confirm that I make this contribution in accordance with the [OpenJDK 
Interim AI Policy](https://openjdk.org/legal/ai).

-------------

Commit messages:
 - 8397897: Better table-based interface checks
 - Merge branch 'master' into large-secondaries-experiment
 - Merge
 - inter
 - Merge branch 'large-secondaries-experiment' of 
https://github.com/theRealAph/jdk into large-secondaries-experiment
 - New files
 - Merge branch 'master' into large-secondaries-experiment
 - Foo
 - Merge branch 'master' into large-secondaries-experiment
 - More
 - ... and 7 more: https://git.openjdk.org/jdk/compare/7d35cf2b...030c68e0

Changes: https://git.openjdk.org/jdk/pull/34003/files
  Webrev: https://webrevs.openjdk.org/?repo=jdk&pr=34003&range=00
  Issue: https://bugs.openjdk.org/browse/JDK-8397897
  Stats: 599 lines in 13 files changed: 523 ins; 15 del; 61 mod
  Patch: https://git.openjdk.org/jdk/pull/34003.diff
  Fetch: git fetch https://git.openjdk.org/jdk.git pull/34003/head:pull/34003

PR: https://git.openjdk.org/jdk/pull/34003

Reply via email to