OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:expectedValuesPerKey
(Results
1 - 3
of
3
) sorted by null
/external/guava/src/com/google/common/collect/
ArrayListMultimap.java
66
@VisibleForTesting transient int
expectedValuesPerKey
;
81
* @param
expectedValuesPerKey
the expected average number of values per key
83
*
expectedValuesPerKey
} is negative
86
int expectedKeys, int
expectedValuesPerKey
) {
87
return new ArrayListMultimap<K, V>(expectedKeys,
expectedValuesPerKey
);
103
expectedValuesPerKey
= DEFAULT_VALUES_PER_KEY;
106
private ArrayListMultimap(int expectedKeys, int
expectedValuesPerKey
) {
108
checkArgument(
expectedValuesPerKey
>= 0);
109
this.
expectedValuesPerKey
=
expectedValuesPerKey
;
[
all
...]
HashMultimap.java
53
transient int
expectedValuesPerKey
= DEFAULT_VALUES_PER_KEY;
68
* @param
expectedValuesPerKey
the expected average number of values per key
70
*
expectedValuesPerKey
} is negative
73
int expectedKeys, int
expectedValuesPerKey
) {
74
return new HashMultimap<K, V>(expectedKeys,
expectedValuesPerKey
);
93
private HashMultimap(int expectedKeys, int
expectedValuesPerKey
) {
95
Preconditions.checkArgument(
expectedValuesPerKey
>= 0);
96
this.
expectedValuesPerKey
=
expectedValuesPerKey
;
113
return Sets.<V>newHashSetWithExpectedSize(
expectedValuesPerKey
);
[
all
...]
LinkedHashMultimap.java
74
transient int
expectedValuesPerKey
= DEFAULT_VALUES_PER_KEY;
96
* @param
expectedValuesPerKey
the expected average number of values per key
98
*
expectedValuesPerKey
} is negative
101
int expectedKeys, int
expectedValuesPerKey
) {
102
return new LinkedHashMultimap<K, V>(expectedKeys,
expectedValuesPerKey
);
124
private LinkedHashMultimap(int expectedKeys, int
expectedValuesPerKey
) {
126
Preconditions.checkArgument(
expectedValuesPerKey
>= 0);
127
this.
expectedValuesPerKey
=
expectedValuesPerKey
;
129
expectedKeys *
expectedValuesPerKey
);
[
all
...]
Completed in 41 milliseconds