OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:ntasks
(Results
1 - 6
of
6
) sorted by null
/external/guava/guava/src/com/google/common/util/concurrent/
AbstractListeningExecutorService.java
65
int
ntasks
= tasks.size();
local
66
checkArgument(
ntasks
> 0);
67
List<Future<T>> futures = new ArrayList<Future<T>>(
ntasks
);
85
--
ntasks
;
91
if (
ntasks
> 0) {
92
--
ntasks
;
/libcore/luni/src/main/java/java/util/concurrent/
AbstractExecutorService.java
115
int
ntasks
= tasks.size();
local
116
if (
ntasks
== 0)
118
List<Future<T>> futures= new ArrayList<Future<T>>(
ntasks
);
137
--
ntasks
;
143
if (
ntasks
> 0) {
144
--
ntasks
;
/external/guava/guava-tests/test/com/google/common/collect/
MapMakerTest.java
117
int
nTasks
= 1000;
119
Set<String> expectedKeys = Sets.newHashSetWithExpectedSize(
nTasks
+ nSeededEntries);
130
final CountDownLatch tasksFinished = new CountDownLatch(
nTasks
);
131
for (int i = 0; i <
nTasks
; i++) {
ConcurrentHashMultisetBasherTest.java
68
int
nTasks
= nThreads * tasksPerThread;
72
List<Future<int[]>> futures = Lists.newArrayListWithExpectedSize(
nTasks
);
73
for (int i = 0; i <
nTasks
; i++) {
/external/guava/guava-tests/test/com/google/common/cache/
CacheBuilderTest.java
470
int
nTasks
= 1000;
472
Set<String> expectedKeys = Sets.newHashSetWithExpectedSize(
nTasks
+ nSeededEntries);
484
final CountDownLatch tasksFinished = new CountDownLatch(
nTasks
);
485
for (int i = 0; i <
nTasks
; i++) {
534
int
nTasks
= 3000;
572
for (int i = 0; i <
nTasks
; i++) {
/external/guava/guava-tests/test/com/google/common/util/concurrent/
AtomicLongMapTest.java
540
int
nTasks
= 3000;
550
for (int i = 0; i <
nTasks
; i++) {
Completed in 260 milliseconds