Home
last modified time | relevance | path

Searched refs:rangeSize (Results 1 – 4 of 4) sorted by relevance

/libcore/jsr166-tests/src/test/java/jsr166/
DTreeSetTest.java718 int rangeSize = max - min + 1; in mutateSet() local
721 for (int i = 0, n = rangeSize / 2; i < n; i++) { in mutateSet()
722 remove(set, min - 5 + rnd.nextInt(rangeSize + 10)); in mutateSet()
735 int element = min + rnd.nextInt(rangeSize); in mutateSet()
743 int rangeSize = max - min + 1; in mutateSubSet() local
746 for (int i = 0, n = rangeSize / 2; i < n; i++) { in mutateSubSet()
747 remove(set, min - 5 + rnd.nextInt(rangeSize + 10)); in mutateSubSet()
760 int element = min - 5 + rnd.nextInt(rangeSize + 10); in mutateSubSet()
832 int rangeSize = max - min + 1; in bashSubSet() local
834 endpoints[0] = min + rnd.nextInt(rangeSize); in bashSubSet()
[all …]
DConcurrentSkipListSetTest.java714 int rangeSize = max - min + 1; in mutateSet() local
717 for (int i = 0, n = rangeSize / 2; i < n; i++) { in mutateSet()
718 remove(set, min - 5 + rnd.nextInt(rangeSize + 10), bs); in mutateSet()
731 int element = min + rnd.nextInt(rangeSize); in mutateSet()
740 int rangeSize = max - min + 1; in mutateSubSet() local
743 for (int i = 0, n = rangeSize / 2; i < n; i++) { in mutateSubSet()
744 remove(set, min - 5 + rnd.nextInt(rangeSize + 10), bs); in mutateSubSet()
757 int element = min - 5 + rnd.nextInt(rangeSize + 10); in mutateSubSet()
830 int rangeSize = max - min + 1; in bashSubSet() local
832 endpoints[0] = min + rnd.nextInt(rangeSize); in bashSubSet()
[all …]
DTreeMapTest.java825 int rangeSize = max - min + 1;
828 for (int i = 0, n = rangeSize / 2; i < n; i++) {
829 remove(map, min - 5 + rnd.nextInt(rangeSize + 10));
842 int key = min + rnd.nextInt(rangeSize);
850 int rangeSize = max - min + 1;
853 for (int i = 0, n = rangeSize / 2; i < n; i++) {
854 remove(map, min - 5 + rnd.nextInt(rangeSize + 10));
867 int key = min - 5 + rnd.nextInt(rangeSize + 10);
939 int rangeSize = max - min + 1;
941 endpoints[0] = min + rnd.nextInt(rangeSize);
[all …]
DConcurrentSkipListMapTest.java1020 int rangeSize = max - min + 1;
1023 for (int i = 0, n = rangeSize / 2; i < n; i++) {
1024 remove(map, min - 5 + rnd.nextInt(rangeSize + 10));
1037 int key = min + rnd.nextInt(rangeSize);
1045 int rangeSize = max - min + 1;
1048 for (int i = 0, n = rangeSize / 2; i < n; i++) {
1049 remove(map, min - 5 + rnd.nextInt(rangeSize + 10));
1062 int key = min - 5 + rnd.nextInt(rangeSize + 10);
1134 int rangeSize = max - min + 1;
1136 endpoints[0] = min + rnd.nextInt(rangeSize);
[all …]