Libraryless. Click here for Pure Java version (29L/1K).
static <A extends Comparable<? super A>> int binarySearch_insertionPoint(L<A> l, A a) { int i = Collections.binarySearch(l, a); ret i < 0 ? -i-1 : i; }
download show line numbers debug dex old transpilations
Travelled to 4 computer(s): bhatertpkbcr, mqqgnosmbjvj, pyentgdyhuwx, vouqrxazstgt
No comments. add comment
| Snippet ID: | #1030116 |
| Snippet name: | binarySearch_insertionPoint |
| Eternal ID of this version: | #1030116/2 |
| Text MD5: | cda12ecf4f0606f31cd8da1524814142 |
| Transpilation MD5: | d3a41ad275e145d3b5780beeff2b520d |
| Author: | stefan |
| Category: | javax |
| Type: | JavaX fragment (include) |
| Public (visible to everyone): | Yes |
| Archived (hidden from active list): | No |
| Created/modified: | 2020-11-09 13:57:45 |
| Source code size: | 158 bytes / 4 lines |
| Pitched / IR pitched: | No / No |
| Views / Downloads: | 283 / 382 |
| Version history: | 1 change(s) |
| Referenced in: | #1006654 - Standard functions list 2 (LIVE, continuation of #761) #1030118 - binarySearchResultToInsertionPoint #1036569 - binarySearch_tipToTheLeft - needed? |