Home
last modified time | relevance | path

Searched refs:N (Results 1 – 25 of 27) sorted by relevance

12

/libcore/ojluni/src/test/java/util/Random/
DRandomTestChiSquared.java127 static boolean chiSquaredTest(String id, int N, IntSupplier theSupplier) { in chiSquaredTest() argument
128 int[] stats = new int[N]; in chiSquaredTest()
138 double x = ((double)N / (double)SEQUENCE_SIZE) * (double)z - (double)SEQUENCE_SIZE; in chiSquaredTest()
139 double lo = chiSquaredBounds[N][0]; in chiSquaredTest()
140 double hi = chiSquaredBounds[N][1]; in chiSquaredTest()
146 static boolean testRngChiSquared(String id, int N, IntSupplier theSupplier) { in testRngChiSquared() argument
147 if (chiSquaredTest(id, N, theSupplier)) return true; in testRngChiSquared()
149 return chiSquaredTest(id, N, theSupplier) && chiSquaredTest(id, N, theSupplier); in testRngChiSquared()
176 int N = testSizes[j]; in testOneRng() local
177 …tryIt(rng, "nextInt(" + N + ")", (String id) -> () -> testRngChiSquared(id, N, () -> rng.nextInt(N… in testOneRng()
[all …]
DRandomCanaryPi.java41 int N = 10000000; in pi() local
44 for (int i = 0; i < N; i++) { in pi()
53 return 4.0 * (double)k / (double)N; in pi()
DRandomTestBsi1999.java248 int N = s.length / 4; in autocorrelationTest() local
249 for (int tau = 1; tau <= N; tau++) { in autocorrelationTest()
251 for (int j = 0; j < N; j++) { in autocorrelationTest()
/libcore/ojluni/src/test/java/util/Collections/
DFindSubList.java41 int N = 500; in main() local
42 List source = new ArrayList(3 * N); in main()
43 List[] target = new List[N+1]; in main()
44 int[] index = new int[N+1]; in main()
45 for (int i=0; i<=N; i++) { in main()
51 if (i == N) { in main()
69 for (int i=0; i<=N; i++) { in main()
84 for (int i=0; i<=N; i++) { in main()
86 if (i != N) in main()
98 for (int i=0; i<=N; i++) { in main()
DDisjoint.java41 static final int N = 20; field in Disjoint
47 List[] lists = new List[N]; in main()
49 for (int i = 0; i < N; i++) { in main()
60 for (int i = 0; i < N; i++) { in main()
61 for (int j = 0; j < N; j++) { in main()
DReverseOrder2.java46 static final int N = 100; field in ReverseOrder2
74 for (int i = 0; i < N; i++) in test()
89 private static final List<String> golden = new ArrayList<>(N);
91 for (int i = N-1; i >= 0; i--)
96 for (int i = 0; i < N; i++) in test2()
103 private static final List<Integer> golden2 = new ArrayList<>(N);
105 for (int i = N-1; i >= 0; i--)
DFrequency.java39 static final int N = 100; field in Frequency
46 for (int i = 0; i < N; i++) in test()
51 for (int i = 0; i < N; i++) in test()
DAddAll.java45 static final int N = 100; field in AddAll
57 for (int i = 0; i < N; i++) { in test()
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
DSortedMapTestBase.java40 final int N = 1000; field in SortedMapTestBase
50 for (int i = 0; i < N; i++) { in setUp()
51 ref.put(rnd.nextInt(N) * 2, rnd.nextBoolean() ? null : rnd.nextInt(N) * 2); in setUp()
62 int key = rnd.nextInt(N); in testContainsKey()
70 int value = rnd.nextInt(N); in testContainsValue()
91 int key = rnd.nextInt(N); in testGet()
113 int key = rnd.nextInt(N); in testPut()
114 int value = rnd.nextInt(N); in testPut()
124 for (int i = 0; i < N; i++) { in testPut0()
125 int key = rnd.nextInt(N); in testPut0()
[all …]
/libcore/ojluni/src/main/java/sun/misc/
DLRUCache.java33 public abstract class LRUCache<N,V> {
42 abstract protected V create(N name); in create()
44 abstract protected boolean hasName(V ob, N name); in hasName()
53 public V forName(N name) { in forName()
/libcore/ojluni/src/main/java/jdk/random/
DL64X1024MixRandom.java119 private static final int N = 16; field in L64X1024MixRandom
150 private int p = N - 1;
186 this.x = new long[N]; in L64X1024MixRandom()
207 for (int j = 0; j < N; j++) { in L64X1024MixRandom()
276 this.x = new long[N]; in L64X1024MixRandom()
277 for (int j = 0; j < N; j++) { in L64X1024MixRandom()
302 final long s0 = x[p = (p + 1) & (N - 1)]; in nextLong()
DL128X1024MixRandom.java123 private static final int N = 16; field in L128X1024MixRandom
155 private int p = N - 1;
195 this.x = new long[N]; in L128X1024MixRandom()
216 for (int j = 0; j < N; j++) { in L128X1024MixRandom()
289 this.x = new long[N]; in L128X1024MixRandom()
290 for (int j = 0; j < N; j++) { in L128X1024MixRandom()
316 final long s0 = x[p = (p + 1) & (N - 1)]; in nextLong()
/libcore/ojluni/src/test/java/lang/Math/
DHypotTests.java55 long N = n; in pythagoreanTriple() local
58 result[0] = Math.abs(M * M - N * N); in pythagoreanTriple()
59 result[1] = Math.abs(2 * M * N); in pythagoreanTriple()
60 result[2] = Math.abs(M * M + N * N); in pythagoreanTriple()
/libcore/ojluni/src/test/java/text/Format/MessageFormat/
DBug7003643.java37 private static final int N = 5; field in Bug7003643
46 int max = (int) (Math.pow((double)elements.length, (double)N)/0.52); in main()
51 for (int i = 0; i < N; i++) { in main()
/libcore/tools/docs/crypto/
DREADME15 supported for. It should be a sequence of zero or more "N" values or "N-M"
16 ranges separated by commas followed by a "N+" value if the algorithm is
/libcore/ojluni/src/main/java/java/util/stream/
DNodes.java937 N extends Node<T>>
941 N curNode;
957 Deque<N> tryAdvanceStack;
959 InternalNodeSpliterator(N curNode) { in InternalNodeSpliterator()
968 protected final Deque<N> initStack() { in initStack()
971 Deque<N> stack = new ArrayDeque<>(8); in initStack()
973 stack.addFirst((N) curNode.getChild(i)); in initStack()
982 protected final N findNextLeafNode(Deque<N> stack) { in findNextLeafNode()
983 N n = null; in findNextLeafNode()
990 stack.addFirst((N) n.getChild(i)); in findNextLeafNode()
[all …]
/libcore/
Dnullability_annotated_classes.txt2 # which should be validated for correctness and completeness. (N.B. Classes
/libcore/ojluni/src/test/java/time/test/java/time/format/
DTestZoneTextPrinterParser.java74 int N = 1; in test_printText() local
80 while (N-- > 0) { in test_printText()
/libcore/luni/src/test/java/libcore/java/util/
DEnumSetTest.java102 H, HE, LI, BE, B, C, N, O, F, NE, NA, MG, AL, SI, P, S, CL, AR, K, CA, SC, TI, V, CR, MN, enumConstant
/libcore/ojluni/src/test/java/nio/file/attribute/
DFileTimeTest.java123 int N = 1000; in main() local
125 for (int i = 0; i < N; i++) { in main()
155 for (int i = 0; i < N; i++) { in main()
/libcore/ojluni/src/test/java/time/test/java/util/
DTestFormatter.java90 int N = 12; in test() local
109 while (N-- > 0) { in test()
/libcore/ojluni/src/main/java/java/util/zip/
DZipFile.java1477 int N = len; in readFullyAt() local
1478 while (N > 0) { in readFullyAt()
1479 int n = Math.min(BUF_SIZE, N); in readFullyAt()
1482 N -= n; in readFullyAt()
/libcore/ojluni/src/test/java/util/concurrent/tck/
DSubmissionPublisherTest.java1015 final int N = expensiveTests ? (1 << 20) : (1 << 10);
1021 s.request(N);
1024 if (++received == N)
/libcore/ojluni/src/test/java/util/Base64/
Dplain.txt180 13 N 30 e 47 v
/libcore/tools/openjdk-analyzer/src/libcore/tools/analyzer/openjdk/
Dunsupported_new_apis.txt79 # Please use android.icu.text.CompactDecimalFormat available since Android N. http://b/262705909

12