mirrors/nextcloud-notes-android
1
0
Fork 0
mirror of https://github.com/nextcloud/notes-android.git synced 2024-11-23 13:26:15 +03:00
Code Issues Projects Releases Packages Wiki Activity

Remove random

Browse source
This commit is contained in:
Isc 2020-05-11 14:40:17 +08:00
parent 916a5fef7b
commit 29d23f4d9d
1 changed files with 35 additions and 35 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

70
app/src/test/java/it/niedermann/owncloud/notes/android/fragment/SearchableBaseNoteFragmentTest.java
View file

@ -45,41 +45,41 @@ public class SearchableBaseNoteFragmentTest {
}
}
@Test
public void testCountOccurrencesRandom() {
try {
Method method = SearchableBaseNoteFragment.class.getDeclaredMethod("countOccurrences", String.class, String.class);
method.setAccessible(true);
for (int count = 10; count <= 15; ++count) {
StringBuilder sb = new StringBuilder("Mike Chester Wang");
Random rand = new Random();
for (int i = 0; i < count * 100; ++i) {
sb.append(rand.nextDouble());
if (i % 100 == 0) {
sb.append("flag");
}
}
long startTime = System.currentTimeMillis();
int num = (int) method.invoke(null, sb.toString(), String.valueOf(rand.nextInt(100)));
long endTime = System.currentTimeMillis();
System.out.println("Random Version");
System.out.println("Total Time: " + (endTime - startTime) + " ms");
System.out.println("Total Times: " + num);
System.out.println("String Size: " + (sb.length() / 1024) + " K");
System.out.println();
if (endTime - startTime > 10) {
fail("The algorithm spends too much time.");
}
}
} catch (Exception e) {
fail(Arrays.toString(e.getStackTrace()));
Log.e("Test Count Occurrences Random", Arrays.toString(e.getStackTrace()));
}
}
// @Test
// public void testCountOccurrencesRandom() {
// try {
// Method method = SearchableBaseNoteFragment.class.getDeclaredMethod("countOccurrences", String.class, String.class);
// method.setAccessible(true);
//
// for (int count = 10; count <= 15; ++count) {
// StringBuilder sb = new StringBuilder("Mike Chester Wang");
// Random rand = new Random();
// for (int i = 0; i < count * 100; ++i) {
// sb.append(rand.nextDouble());
// if (i % 100 == 0) {
// sb.append("flag");
// }
// }
//
// long startTime = System.currentTimeMillis();
// int num = (int) method.invoke(null, sb.toString(), String.valueOf(rand.nextInt(100)));
// long endTime = System.currentTimeMillis();
// System.out.println("Random Version");
// System.out.println("Total Time: " + (endTime - startTime) + " ms");
// System.out.println("Total Times: " + num);
// System.out.println("String Size: " + (sb.length() / 1024) + " K");
// System.out.println();
//
// if (endTime - startTime > 10) {
// fail("The algorithm spends too much time.");
// }
// }
//
// } catch (Exception e) {
// fail(Arrays.toString(e.getStackTrace()));
// Log.e("Test Count Occurrences Random", Arrays.toString(e.getStackTrace()));
// }
// }
@Test
public void testNullOrEmptyInput() {