Zhen Zhang 4bd260ae68 Create a method for top K targets by using min heap algorithm
This is a in-place sorting method. After sorting, top K targets will be at the first K indexes. Order for other elements will remain same. The method is meant for getting top K ranked targets for Share-sheet.

Bug: 142558305
Test: Passed all unit tests in ResolverActivityTest, ChooserActivityTest
and ResolverListControllerTest
Change-Id: I1b096bb0d7f7bbc102c2fb588c55ace6a20bfc5d
2019-10-16 20:42:36 +00:00
2019-10-10 18:13:06 +00:00
2019-08-26 14:23:52 -07:00
2019-08-09 09:24:40 -07:00
2019-10-09 19:38:32 +00:00
2019-07-24 15:54:24 +09:00
Description
No description provided
21 GiB
Languages
Java 73.7%
Kotlin 14%
PowerBuilder 5.8%
C++ 5.2%
AIDL 1%