/libcore/ojluni/src/main/java/java/util/concurrent/ |
H A D | RecursiveAction.java | 55 * protected void compute() { 88 * protected void compute() { 138 * protected void compute() { 171 protected abstract void compute(); method in class:RecursiveAction 189 compute();
|
H A D | RecursiveTask.java | 47 * protected Integer compute() { 53 * return f2.compute() + f1.join(); 57 * However, besides being a dumb way to compute Fibonacci functions 80 protected abstract V compute(); method in class:RecursiveTask 94 result = compute();
|
H A D | CountedCompleter.java | 71 * #compute}, that should in most cases (as illustrated below), invoke 99 * exceptional completion of method {@code compute}. Upon any 150 * public void compute() { // version 1 173 * public void compute() { // version 2 178 * new ForEach(this, array, op, lo, mid).compute(); // direct invoke 197 * public void compute() { // version 3 237 * public void compute() { // similar to ForEach version 3 295 * public void compute() { 304 * left.compute(); // directly execute left 367 * public void compute() { 454 public abstract void compute(); method in class:CountedCompleter [all...] |
H A D | ConcurrentMap.java | 417 default V compute(K key, method in interface:ConcurrentMap
|
H A D | ConcurrentHashMap.java | 1678 * attempts to compute its value using the given mapping function 1687 * @param mappingFunction the function to compute a value 1785 * compute a new mapping given the key and its current mapped 1793 * @param remappingFunction the function to compute a value 1876 * Attempts to compute a mapping for the specified key and its 1885 * @param remappingFunction the function to compute a value 1895 public V compute(K key, method in class:ConcurrentHashMap 2266 * A place-holder node used in computeIfAbsent and compute. 3692 * faster to compute and more convenient to use as a guide to 4979 public final void compute() { method in class:ConcurrentHashMap.ForEachKeyTask 5006 public final void compute() { method in class:ConcurrentHashMap.ForEachValueTask 5033 public final void compute() { method in class:ConcurrentHashMap.ForEachEntryTask 5060 public final void compute() { method in class:ConcurrentHashMap.ForEachMappingTask 5088 public final void compute() { method in class:ConcurrentHashMap.ForEachTransformedKeyTask 5121 public final void compute() { method in class:ConcurrentHashMap.ForEachTransformedValueTask 5154 public final void compute() { method in class:ConcurrentHashMap.ForEachTransformedEntryTask 5188 public final void compute() { method in class:ConcurrentHashMap.ForEachTransformedMappingTask 5223 public final void compute() { method in class:ConcurrentHashMap.SearchKeysTask 5267 public final void compute() { method in class:ConcurrentHashMap.SearchValuesTask 5311 public final void compute() { method in class:ConcurrentHashMap.SearchEntriesTask 5355 public final void compute() { method in class:ConcurrentHashMap.SearchMappingsTask 5400 public final void compute() { method in class:ConcurrentHashMap.ReduceKeysTask 5448 public final void compute() { method in class:ConcurrentHashMap.ReduceValuesTask 5496 public final void compute() { method in class:ConcurrentHashMap.ReduceEntriesTask 5545 public final void compute() { method in class:ConcurrentHashMap.MapReduceKeysTask 5599 public final void compute() { method in class:ConcurrentHashMap.MapReduceValuesTask 5653 public final void compute() { method in class:ConcurrentHashMap.MapReduceEntriesTask 5707 public final void compute() { method in class:ConcurrentHashMap.MapReduceMappingsTask 5763 public final void compute() { method in class:ConcurrentHashMap.MapReduceKeysToDoubleTask 5813 public final void compute() { method in class:ConcurrentHashMap.MapReduceValuesToDoubleTask 5863 public final void compute() { method in class:ConcurrentHashMap.MapReduceEntriesToDoubleTask 5913 public final void compute() { method in class:ConcurrentHashMap.MapReduceMappingsToDoubleTask 5963 public final void compute() { method in class:ConcurrentHashMap.MapReduceKeysToLongTask 6013 public final void compute() { method in class:ConcurrentHashMap.MapReduceValuesToLongTask 6063 public final void compute() { method in class:ConcurrentHashMap.MapReduceEntriesToLongTask 6113 public final void compute() { method in class:ConcurrentHashMap.MapReduceMappingsToLongTask 6163 public final void compute() { method in class:ConcurrentHashMap.MapReduceKeysToIntTask 6213 public final void compute() { method in class:ConcurrentHashMap.MapReduceValuesToIntTask 6263 public final void compute() { method in class:ConcurrentHashMap.MapReduceEntriesToIntTask 6313 public final void compute() { method in class:ConcurrentHashMap.MapReduceMappingsToIntTask [all...] |
/libcore/ojluni/src/main/java/java/util/ |
H A D | ArraysParallelSortHelpers.java | 80 * 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 D | ArrayPrefixHelpers.java | 74 * main phase bit. When false, segments compute only their sum. 87 * To better exploit locality and reduce overhead, the compute 136 public final void compute() { method in class:ArrayPrefixHelpers.CumulateTask 288 public final void compute() { method in class:ArrayPrefixHelpers.LongCumulateTask 438 public final void compute() { method in class:ArrayPrefixHelpers.DoubleCumulateTask 588 public final void compute() { method in class:ArrayPrefixHelpers.IntCumulateTask
|
H A D | Map.java | 894 * to {@code null}), attempts to compute its value using the given mapping 949 * @param mappingFunction the mapping function to compute a value 983 * compute a new mapping given the key and its current mapped value. 1027 * @param remappingFunction the remapping function to compute a value 1062 * Attempts to compute a mapping for the specified key and its current 1068 * map.compute(key, (k, v) -> (v == null) ? msg : v.concat(msg))}</pre> 1119 * @param remappingFunction the remapping function to compute a value 1135 default V compute(K key, method in interface:Map
|
H A D | Collections.java | 1587 public V compute(K key, method in class:Collections.UnmodifiableMap 2724 public V compute(K key, method in class:Collections.SynchronizedMap 2726 synchronized (mutex) {return m.compute(key, remappingFunction);} 3750 public V compute(K key, method in class:Collections.CheckedMap 3752 return m.compute(key, typeCheck(remappingFunction)); 4687 public V compute(K key, method in class:Collections.EmptyMap 4999 public V compute(K key, method in class:Collections.SingletonMap
|
H A D | Hashtable.java | 1054 public synchronized V compute(K key, BiFunction<? super K, ? super V, ? extends V> remappingFunction) { method in class:Hashtable
|
/libcore/luni/src/test/java/libcore/java/util/ |
H A D | MapDefaultMethodTester.java | 375 assertEquals(5.0, m.compute(1, (k, v) -> 5.0)); 380 assertEquals(11.0, m.compute(1, (k, v) -> k + v)); 384 assertNull(m.compute(1, (k, v) -> null)); 389 m.compute(1, null); 394 assertEquals(10.0, m.compute(null, (k, v) -> 10.0)); 398 m.compute(null, (k, v) -> 5.0);
|
H A D | CollectionsTest.java | 600 Collections.unmodifiableMap(new HashMap<>()).compute(1, (k, v) -> 1.0); 609 Collections.unmodifiableMap(m).compute(1, (k, v) -> 1.0); 951 assertThrowsUoe(() -> { map.compute(absentKey, (k, v) -> absentValue); }); 963 assertThrowsUoe(() -> { map.compute(sampleKey, (k, v) -> absentValue); }); 1068 assertThrowsCce(() -> { map.compute(new Object(), (k, v) -> presentValue); }); 1069 assertThrowsCce(() -> { map.compute(presentKey, (k, v) -> new Object()); }); 1070 assertThrowsCce(() -> { map.compute(absentKey, (k, v) -> new Object()); }); 1291 Collections.emptyMap().compute(1, (k, v) -> 5.0); 1368 Collections.singletonMap(1, 11.0).compute(1, (k, v) -> 5.0); 1629 checkedMap2.compute( [all...] |
H A D | LinkedHashMapTest.java | 191 m.compute("key1", (k, v) -> "value3"); 199 m.compute("key4", (k, v) -> "value4");
|
/libcore/ojluni/src/main/java/java/util/stream/ |
H A D | AbstractShortCircuitTask.java | 101 public void compute() { method in class:AbstractShortCircuitTask 144 * {@code sharedResult}. The {@code compute()} method will check
|
H A D | AbstractTask.java | 48 * <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 D | ForEachOps.java | 279 public void compute() { method in class:ForEachOps.ForEachTask 399 public final void compute() { method in class:ForEachOps.ForEachOrderedTask
|
H A D | Nodes.java | 1863 public void compute() { method in class:Nodes.SizedCollectorTask 2047 public void compute() { method in class:Nodes.ToArrayTask
|
/libcore/jsr166-tests/src/test/java/jsr166/ |
H A D | ForkJoinPoolTest.java | 116 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 D | ConcurrentHashMap8Test.java | 109 * 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 D | RecursiveTaskTest.java | 204 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 D | ForkJoinPool8Test.java | 209 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 D | JSR166TestCase.java | 1717 @Override protected final void compute() { method in class:JSR166TestCase.CheckedRecursiveAction 1732 @Override protected final T compute() { method in class:JSR166TestCase.CheckedRecursiveTask
|
H A D | RecursiveActionTest.java | 198 public void compute() { method in class:RecursiveActionTest.FailingFibAction 1213 protected void compute() { method in class:RecursiveActionTest.SortTask
|
/libcore/ojluni/src/main/java/java/security/ |
H A D | Provider.java | 495 * Attempts to compute a mapping for the specified key and its 513 public synchronized Object compute(Object key, method in class:Provider 526 * is mapped to {@code null}), attempts to compute its value using 557 * compute a new mapping given the key and its current mapped value. 824 legacyStrings.compute((String) key, 829 return super.compute(key, remappingFunction);
|
/libcore/luni/src/test/java/libcore/java/security/ |
H A D | ProviderTest.java | 973 // Don't compute because is not present. 986 // Don't compute because if not absent. 1083 provAndParam -> provAndParam.provider.compute(
|