Searched refs:compute (Results 1 - 25 of 30) sorted by relevance

12

/libcore/luni/src/main/java/java/util/concurrent/
H A DRecursiveAction.java26 * protected void compute() {
59 * protected void compute() {
109 * protected void compute() {
142 protected abstract void compute(); method in class:RecursiveAction
160 compute();
H A DRecursiveTask.java18 * protected Integer compute() {
24 * return f2.compute() + f1.join();
28 * However, besides being a dumb way to compute Fibonacci functions
51 protected abstract V compute(); method in class:RecursiveTask
65 result = compute();
H A DCountedCompleter.java42 * #compute}, that should in most cases (as illustrated below), invoke
70 * exceptional completion of method {@code compute}. Upon any
121 * public void compute() { // version 1
144 * public void compute() { // version 2
149 * new ForEach(this, array, op, lo, mid).compute(); // direct invoke
168 * public void compute() { // version 3
208 * public void compute() { // similar to ForEach version 3
266 * public void compute() {
275 * left.compute(); // directly execute left
338 * public void compute() {
425 public abstract void compute(); method in class:CountedCompleter
[all...]
H A DConcurrentMap.java388 default V compute(K key, method in interface:ConcurrentMap
H A DConcurrentHashMap.java1649 * attempts to compute its value using the given mapping function
1658 * @param mappingFunction the function to compute a value
1756 * compute a new mapping given the key and its current mapped
1764 * @param remappingFunction the function to compute a value
1847 * Attempts to compute a mapping for the specified key and its
1856 * @param remappingFunction the function to compute a value
1866 public V compute(K key, method in class:ConcurrentHashMap
2237 * A place-holder node used in computeIfAbsent and compute.
3663 * faster to compute and more convenient to use as a guide to
4950 public final void compute() { method in class:ConcurrentHashMap.ForEachKeyTask
4977 public final void compute() { method in class:ConcurrentHashMap.ForEachValueTask
5004 public final void compute() { method in class:ConcurrentHashMap.ForEachEntryTask
5031 public final void compute() { method in class:ConcurrentHashMap.ForEachMappingTask
5059 public final void compute() { method in class:ConcurrentHashMap.ForEachTransformedKeyTask
5092 public final void compute() { method in class:ConcurrentHashMap.ForEachTransformedValueTask
5125 public final void compute() { method in class:ConcurrentHashMap.ForEachTransformedEntryTask
5159 public final void compute() { method in class:ConcurrentHashMap.ForEachTransformedMappingTask
5194 public final void compute() { method in class:ConcurrentHashMap.SearchKeysTask
5238 public final void compute() { method in class:ConcurrentHashMap.SearchValuesTask
5282 public final void compute() { method in class:ConcurrentHashMap.SearchEntriesTask
5326 public final void compute() { method in class:ConcurrentHashMap.SearchMappingsTask
5371 public final void compute() { method in class:ConcurrentHashMap.ReduceKeysTask
5419 public final void compute() { method in class:ConcurrentHashMap.ReduceValuesTask
5467 public final void compute() { method in class:ConcurrentHashMap.ReduceEntriesTask
5516 public final void compute() { method in class:ConcurrentHashMap.MapReduceKeysTask
5570 public final void compute() { method in class:ConcurrentHashMap.MapReduceValuesTask
5624 public final void compute() { method in class:ConcurrentHashMap.MapReduceEntriesTask
5678 public final void compute() { method in class:ConcurrentHashMap.MapReduceMappingsTask
5734 public final void compute() { method in class:ConcurrentHashMap.MapReduceKeysToDoubleTask
5784 public final void compute() { method in class:ConcurrentHashMap.MapReduceValuesToDoubleTask
5834 public final void compute() { method in class:ConcurrentHashMap.MapReduceEntriesToDoubleTask
5884 public final void compute() { method in class:ConcurrentHashMap.MapReduceMappingsToDoubleTask
5934 public final void compute() { method in class:ConcurrentHashMap.MapReduceKeysToLongTask
5984 public final void compute() { method in class:ConcurrentHashMap.MapReduceValuesToLongTask
6034 public final void compute() { method in class:ConcurrentHashMap.MapReduceEntriesToLongTask
6084 public final void compute() { method in class:ConcurrentHashMap.MapReduceMappingsToLongTask
6134 public final void compute() { method in class:ConcurrentHashMap.MapReduceKeysToIntTask
6184 public final void compute() { method in class:ConcurrentHashMap.MapReduceValuesToIntTask
6234 public final void compute() { method in class:ConcurrentHashMap.MapReduceEntriesToIntTask
6284 public final void compute() { method in class:ConcurrentHashMap.MapReduceMappingsToIntTask
[all...]
/libcore/ojluni/src/main/java/sun/security/ssl/
H A DMAC.java158 final byte[] compute(byte type, byte buf[], method in class:MAC
160 return compute(type, null, buf, offset, len, isSimulated);
175 final byte[] compute(byte type, ByteBuffer bb, boolean isSimulated) { method in class:MAC
176 return compute(type, bb, null, 0, bb.remaining(), isSimulated);
228 private byte[] compute(byte type, ByteBuffer bb, byte[] buf, method in class:MAC
H A DEngineOutputRecord.java123 byte[] hash = signer.compute(contentType(), bb, false);
126 * position was advanced to limit in compute above.
H A DEngineInputRecord.java304 byte[] hash = signer.compute(contentType, bb, isSimulated);
H A DOutputRecord.java206 byte[] hash = signer.compute(contentType, buf,
H A DInputRecord.java243 byte[] hash = signer.compute(
/libcore/luni/src/test/java/libcore/java/util/
H A DMapDefaultMethodTester.java292 assertEquals(5.0, m.compute(1, (k, v) -> 5.0));
297 assertEquals(11.0, m.compute(1, (k, v) -> k + v));
301 assertNull(m.compute(1, (k, v) -> null));
306 m.compute(1, null);
311 assertEquals(10.0, m.compute(null, (k, v) -> 10.0));
315 m.compute(null, (k, v) -> 5.0);
H A DCollectionsTest.java339 Collections.unmodifiableMap(new HashMap<>()).compute(1, (k, v) -> 1.0);
348 Collections.unmodifiableMap(m).compute(1, (k, v) -> 1.0);
435 Collections.emptyMap().compute(1, (k, v) -> 5.0);
512 Collections.singletonMap(1, 11.0).compute(1, (k, v) -> 5.0);
723 checkedMap2.compute(1, (k, v) -> NOT_A_STRING);
H A DLinkedHashMapTest.java178 m.compute("key1", (k, v) -> "value3");
186 m.compute("key4", (k, v) -> "value4");
/libcore/ojluni/src/main/java/java/util/
H A DArraysParallelSortHelpers.java80 * compute() methods, We pack these into as few lines as possible,
92 public final void compute() { } method in class:ArraysParallelSortHelpers.EmptyCompleter
105 public final void compute() { } method in class:ArraysParallelSortHelpers.Relay
107 task.compute();
126 public final void compute() { method in class:ArraysParallelSortHelpers.FJObject.Sorter
167 public final void compute() { method in class:ArraysParallelSortHelpers.FJObject.Merger
245 public final void compute() { method in class:ArraysParallelSortHelpers.FJByte.Sorter
282 public final void compute() { method in class:ArraysParallelSortHelpers.FJByte.Merger
356 public final void compute() { method in class:ArraysParallelSortHelpers.FJChar.Sorter
393 public final void compute() { method in class:ArraysParallelSortHelpers.FJChar.Merger
467 public final void compute() { method in class:ArraysParallelSortHelpers.FJShort.Sorter
504 public final void compute() { method in class:ArraysParallelSortHelpers.FJShort.Merger
578 public final void compute() { method in class:ArraysParallelSortHelpers.FJInt.Sorter
615 public final void compute() { method in class:ArraysParallelSortHelpers.FJInt.Merger
689 public final void compute() { method in class:ArraysParallelSortHelpers.FJLong.Sorter
726 public final void compute() { method in class:ArraysParallelSortHelpers.FJLong.Merger
800 public final void compute() { method in class:ArraysParallelSortHelpers.FJFloat.Sorter
837 public final void compute() { method in class:ArraysParallelSortHelpers.FJFloat.Merger
911 public final void compute() { method in class:ArraysParallelSortHelpers.FJDouble.Sorter
948 public final void compute() { method in class:ArraysParallelSortHelpers.FJDouble.Merger
[all...]
H A DArrayPrefixHelpers.java45 * main phase bit. When false, segments compute only their sum.
58 * To better exploit locality and reduce overhead, the compute
107 public final void compute() { method in class:ArrayPrefixHelpers.CumulateTask
259 public final void compute() { method in class:ArrayPrefixHelpers.LongCumulateTask
409 public final void compute() { method in class:ArrayPrefixHelpers.DoubleCumulateTask
559 public final void compute() { method in class:ArrayPrefixHelpers.IntCumulateTask
H A DMap.java896 * to {@code null}), attempts to compute its value using the given mapping
951 * @param mappingFunction the mapping function to compute a value
985 * compute a new mapping given the key and its current mapped value.
1029 * @param remappingFunction the remapping function to compute a value
1064 * Attempts to compute a mapping for the specified key and its current
1070 * map.compute(key, (k, v) -> (v == null) ? msg : v.concat(msg))}</pre>
1121 * @param remappingFunction the remapping function to compute a value
1137 default V compute(K key, method in interface:Map
/libcore/ojluni/src/main/java/java/util/stream/
H A DAbstractShortCircuitTask.java101 public void compute() { method in class:AbstractShortCircuitTask
144 * {@code sharedResult}. The {@code compute()} method will check
H A DAbstractTask.java48 * <p>Splitting and setting up the child task links is done by {@code compute()}
49 * for internal nodes. At {@code compute()} time for leaf nodes, it is
172 * {@code compute()} and the result passed to @{code setLocalResult()}
248 * {@link #compute} has been called on this node). If the node is not a
278 * Decides whether or not to split a task further or compute it
291 public void compute() { method in class:AbstractTask
H A DForEachOps.java279 public void compute() { method in class:ForEachOps.ForEachTask
399 public final void compute() { method in class:ForEachOps.ForEachOrderedTask
/libcore/jsr166-tests/src/test/java/jsr166/
H A DForkJoinPoolTest.java116 protected Integer compute() { method in class:ForkJoinPoolTest.FibTask
122 return (new FibTask(n - 2)).compute() + f1.join();
144 protected Integer compute() { method in class:ForkJoinPoolTest.LockingFibTask
159 return f2.compute() + f1.join();
H A DConcurrentHashMap8Test.java109 * compute does not replace if the function returns null
113 map.compute(six, (x, y) -> null);
118 * compute adds when the given key is not present
122 assertEquals("Z", map.compute(six, (x, y) -> "Z"));
126 * compute replaces when the given key is present
130 assertEquals("Z", map.compute(one, (x, y) -> "Z"));
134 * compute removes when the given key is present and function returns null
138 map.compute(one, (x, y) -> null);
H A DRecursiveTaskTest.java204 return (new FibTask(n - 2)).compute() + f1.join();
217 public Integer compute() { method in class:RecursiveTaskTest.FailingFibTask
223 return (new FibTask(n - 2)).compute() + f1.join();
H A DForkJoinPool8Test.java209 public void compute() { method in class:ForkJoinPool8Test.FailingFibAction
874 public final void compute() { method in class:ForkJoinPool8Test.CCF
928 public final void compute() { method in class:ForkJoinPool8Test.FailingCCF
H A DJSR166TestCase.java1677 @Override protected final void compute() { method in class:JSR166TestCase.CheckedRecursiveAction
1692 @Override protected final T compute() { method in class:JSR166TestCase.CheckedRecursiveTask
H A DRecursiveActionTest.java198 public void compute() { method in class:RecursiveActionTest.FailingFibAction
1213 protected void compute() { method in class:RecursiveActionTest.SortTask

Completed in 1452 milliseconds

12