iSharkFly-Docs/java-tutorials
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

BAEL-1374 - search an array. Name changes.

Browse Source
This commit is contained in:
ericgoebelbecker 2017-12-01 18:02:13 -05:00
parent e4d301e81d
commit 89ab473651
1 changed files with 22 additions and 22 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

44
core-java/src/test/java/com/baeldung/array/SearchArrayTest.java
View File

@ -12,25 +12,25 @@ public class SearchArrayTest {
int count = 1000; int count = 1000;
String[] array = seedArray(count); String[] strings = seedArray(count);
long startTime = System.nanoTime(); long startTime = System.nanoTime();
for (int i = 0; i < count; i++) { for (int i = 0; i < count; i++) {
searchList(array, "A"); searchList(strings, "W");
} }
long duration = System.nanoTime() - startTime; long duration = System.nanoTime() - startTime;
System.out.println("SearchList: " + duration / 10000); System.out.println("SearchList: " + duration / 10000);
startTime = System.nanoTime(); startTime = System.nanoTime();
for (int i = 0; i < count; i++) { for (int i = 0; i < count; i++) {
searchSet(array,"A"); searchSet(strings,"S");
} }
duration = System.nanoTime() - startTime; duration = System.nanoTime() - startTime;
System.out.println("SearchSet: " + duration / 10000); System.out.println("SearchSet: " + duration / 10000);
startTime = System.nanoTime(); startTime = System.nanoTime();
for (int i = 0; i < count; i++) { for (int i = 0; i < count; i++) {
searchLoop(array, "A"); searchLoop(strings, "T");
} }
duration = System.nanoTime() - startTime; duration = System.nanoTime() - startTime;
System.out.println("SearchLoop: " + duration / 10000); System.out.println("SearchLoop: " + duration / 10000);
@ -40,28 +40,28 @@ public class SearchArrayTest {
public void searchArrayReuseCollections() { public void searchArrayReuseCollections() {
int count = 10000; int count = 10000;
String[] array = seedArray(count); String[] strings = seedArray(count);
List<String> asList = Arrays.asList(array); List<String> asList = Arrays.asList(strings);
Set<String> asSet = new HashSet<>(Arrays.asList(array)); Set<String> asSet = new HashSet<>(Arrays.asList(strings));
long startTime = System.nanoTime(); long startTime = System.nanoTime();
for (int i = 0; i < count; i++) { for (int i = 0; i < count; i++) {
asList.contains("A"); asList.contains("W");
} }
long duration = System.nanoTime() - startTime; long duration = System.nanoTime() - startTime;
System.out.println("List: " + duration / 10000); System.out.println("List: " + duration / 10000);
startTime = System.nanoTime(); startTime = System.nanoTime();
for (int i = 0; i < count; i++) { for (int i = 0; i < count; i++) {
asSet.contains("A"); asSet.contains("S");
} }
duration = System.nanoTime() - startTime; duration = System.nanoTime() - startTime;
System.out.println("Set: " + duration / 10000); System.out.println("Set: " + duration / 10000);
startTime = System.nanoTime(); startTime = System.nanoTime();
for (int i = 0; i < count; i++) { for (int i = 0; i < count; i++) {
searchLoop(array, "A"); searchLoop(strings, "T");
} }
duration = System.nanoTime() - startTime; duration = System.nanoTime() - startTime;
System.out.println("Loop: " + duration / 10000); System.out.println("Loop: " + duration / 10000);
@ -73,33 +73,33 @@ public class SearchArrayTest {
public void searchArrayBinarySearch() { public void searchArrayBinarySearch() {
int count = 10000; int count = 10000;
String[] array = seedArray(count); String[] strings = seedArray(count);
Arrays.sort(array); Arrays.sort(strings);
long startTime = System.nanoTime(); long startTime = System.nanoTime();
for (int i = 0; i < count; i++) { for (int i = 0; i < count; i++) {
Arrays.binarySearch(array, "A"); Arrays.binarySearch(strings, "A");
} }
long duration = System.nanoTime() - startTime; long duration = System.nanoTime() - startTime;
System.out.println("Binary search: " + duration / 10000); System.out.println("Binary search: " + duration / 10000);
} }
private boolean searchList(String[] arr, String targetValue) { private boolean searchList(String[] strings, String searchString) {
return Arrays.asList(arr).contains(targetValue); return Arrays.asList(strings).contains(searchString);
} }
private boolean searchSet(String[] arr, String targetValue) { private boolean searchSet(String[] strings, String searchString) {
Set<String> set = new HashSet<>(Arrays.asList(arr)); Set<String> set = new HashSet<>(Arrays.asList(strings));
return set.contains(targetValue); return set.contains(searchString);
} }
private boolean searchLoop(String[] arr, String targetValue) { private boolean searchLoop(String[] strings, String searchString) {
for (String s : arr) { for (String s : strings) {
if (s.equals(targetValue)) if (s.equals(searchString))
return true; return true;
} }
return true; return false;
} }
private String[] seedArray(int length) { private String[] seedArray(int length) {