Skip to content
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
Expand Up @@ -274,7 +274,7 @@ private static <T> T[] replaceInArray(T[] arr, int pos, T value) {

/**
* This does a linear scan which is simpler than a binary search. For a small collection size this
* still should be as fast a as binary search.
* still should be as fast as binary search.
*/
private int findKeyOrInsertPosition(K key) {
int newPos = 0;
Expand All @@ -286,7 +286,7 @@ private int findKeyOrInsertPosition(K key) {

/**
* This does a linear scan which is simpler than a binary search. For a small collection size this
* still should be as fast a as binary search.
* still should be as fast as binary search.
*/
private int findKey(K key) {
int i = 0;
Expand Down