/openjdk7/jdk/src/share/classes/com/sun/jmx/snmp/tasks/ |
H A D | Task.java | 27 package com.sun.jmx.snmp.tasks; 31 * by a {@link com.sun.jmx.snmp.tasks.TaskServer}. 35 * <ul>This method is called by the {@link com.sun.jmx.snmp.tasks.TaskServer} 38 * <ul>This method is called by the {@link com.sun.jmx.snmp.tasks.TaskServer} 42 * An implementation of {@link com.sun.jmx.snmp.tasks.TaskServer} shall call 54 * @see com.sun.jmx.snmp.tasks.TaskServer
|
H A D | TaskServer.java | 30 package com.sun.jmx.snmp.tasks; 34 * tasks. Whether the task is executed in the client thread or in another 39 * @see com.sun.jmx.snmp.tasks.Task 47 * {@link com.sun.jmx.snmp.tasks.Task#run() task.run()} or 48 * {@link com.sun.jmx.snmp.tasks.Task#cancel() task.cancel()} will be called.
|
H A D | ThreadService.java | 26 package com.sun.jmx.snmp.tasks; 29 import com.sun.jmx.snmp.tasks.Task; 30 import com.sun.jmx.snmp.tasks.TaskServer; 33 * This class implements a {@link com.sun.jmx.snmp.tasks.TaskServer} over 59 * {@link com.sun.jmx.snmp.tasks.Task#run() task.run()} or 60 * {@link com.sun.jmx.snmp.tasks.Task#cancel() task.cancel()} will be called. 62 * the submitted tasks. 73 * the submitted tasks.
|
/openjdk7/jdk/src/share/classes/javax/swing/text/ |
H A D | LayoutQueue.java | 31 * A queue of text layout tasks. 41 private Vector<Runnable> tasks; field in class:LayoutQueue 48 tasks = new Vector<Runnable>(); 86 tasks.addElement(task); 94 while (tasks.size() == 0) { 101 Runnable work = tasks.firstElement(); 102 tasks.removeElementAt(0);
|
/openjdk7/jdk/src/share/classes/java/util/concurrent/ |
H A D | AbstractExecutorService.java | 139 private <T> T doInvokeAny(Collection<? extends Callable<T>> tasks, argument 142 if (tasks == null) 144 int ntasks = tasks.size(); 152 // parallelism, check to see if previously submitted tasks are 162 Iterator<? extends Callable<T>> it = tasks.iterator(); 212 public <T> T invokeAny(Collection<? extends Callable<T>> tasks) argument 215 return doInvokeAny(tasks, false, 0); 222 public <T> T invokeAny(Collection<? extends Callable<T>> tasks, argument 225 return doInvokeAny(tasks, true, unit.toNanos(timeout)); 228 public <T> List<Future<T>> invokeAll(Collection<? extends Callable<T>> tasks) argument 258 invokeAll(Collection<? extends Callable<T>> tasks, long timeout, TimeUnit unit) argument [all...] |
H A D | ExecutorService.java | 45 * one or more asynchronous tasks. 48 * it to reject new tasks. Two different methods are provided for 50 * method will allow previously submitted tasks to execute before 52 * tasks from starting and attempts to stop currently executing tasks. 53 * Upon termination, an executor has no tasks actively executing, no 54 * tasks awaiting execution, and no new tasks can be submitted. An 63 * tasks and then waiting for at least one, or all, to 108 * first by calling <tt>shutdown</tt> to reject incoming tasks, an 290 invokeAll(Collection<? extends Callable<T>> tasks) argument 320 invokeAll(Collection<? extends Callable<T>> tasks, long timeout, TimeUnit unit) argument 342 invokeAny(Collection<? extends Callable<T>> tasks) argument 367 invokeAny(Collection<? extends Callable<T>> tasks, long timeout, TimeUnit unit) argument [all...] |
H A D | Executors.java | 76 * <tt>nThreads</tt> threads will be active processing tasks. 77 * If additional tasks are submitted when all threads are active, 81 * execute subsequent tasks. The threads in the pool will exist 99 * tasks. If additional tasks are submitted when all threads are 103 * needed to execute subsequent tasks. The threads in the pool will 125 * subsequent tasks.) Tasks are guaranteed to execute 166 * of programs that execute many short-lived asynchronous tasks. 206 * subsequent tasks.) Tasks are guaranteed to execute 223 * place if needed to execute subsequent tasks 646 invokeAll(Collection<? extends Callable<T>> tasks) argument 650 invokeAll(Collection<? extends Callable<T>> tasks, long timeout, TimeUnit unit) argument 655 invokeAny(Collection<? extends Callable<T>> tasks) argument 659 invokeAny(Collection<? extends Callable<T>> tasks, long timeout, TimeUnit unit) argument [all...] |
H A D | ForkJoinTask.java | 60 * Abstract base class for tasks that run within a {@link ForkJoinPool}. 62 * lighter weight than a normal thread. Huge numbers of tasks and 79 * reflecting their intended use as computational tasks calculating 85 * other blocking synchronization apart from joining other tasks or 90 * tasks. Minor breaches of these restrictions, for example using 115 * may be useful when a set of tasks are being executed, and you need 119 * of tasks and joining them all. 121 * <p>The execution status of tasks may be queried at several levels 153 * tasks cyclically wait for each other. However, this framework 170 * computation. Large tasks shoul 710 invokeAll(ForkJoinTask<?>.... tasks) argument 760 invokeAll(Collection<T> tasks) argument [all...] |
H A D | ForkJoinPool.java | 66 * execute subtasks created by other active tasks (eventually blocking 68 * when most tasks spawn other subtasks (as do most {@code 71 * with event-style tasks that are never joined. 77 * internal worker threads, even if some tasks are stalled waiting to 97 * tasks that are already executing in a pool should normally 147 * <p>This implementation rejects submitted tasks (that is, by throwing 161 * into a submission queue. Workers take these tasks and typically 163 * Preference rules give first priority to processing tasks from 165 * randomized FIFO steals of tasks in other worker queues, and 169 * decentralized control -- workers mostly take tasks fro 1636 invokeAll(Collection<? extends Callable<T>> tasks) argument 1649 final ArrayList<ForkJoinTask<T>> tasks; field in class:ForkJoinPool.InvokeAll 1650 InvokeAll(ArrayList<ForkJoinTask<T>> tasks) argument [all...] |
/openjdk7/jdk/src/macosx/native/jobjc/src/tests/java/com/apple/jobjc/ |
H A D | BaseBench.java | 41 public void bench(final String title, final long warmup, final long runs, final long iterations, final Task... tasks){ argument 42 final long[] runtimes = new long[tasks.length]; 44 for(int t = 0; t < tasks.length; ++t){ 47 singleBench(iterations, tasks[t]); 49 runtime = runtime + singleBench(iterations, tasks[t]); 53 final float[] relatives = new float[tasks.length]; 55 for(int t = 0; t < tasks.length; ++t) 63 for(int t = 0; t < tasks.length; ++t) 67 for(int t = 0; t < tasks.length; ++t) 68 System.out.format("%1$60s : %2$.1f\n", tasks[ [all...] |
/openjdk7/jdk/test/sun/reflect/CallerSensitive/ |
H A D | CallerSensitiveFinder.java | 176 private final List<FutureTask<String>> tasks = new ArrayList<FutureTask<String>>(); field in class:CallerSensitiveFinder 183 tasks.add(task); 188 for (FutureTask<String> t : tasks) { 191 System.out.println("Parsed " + tasks.size() + " classfiles");
|