OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:oldCount
(Results
1 - 25
of
34
) sorted by null
1
2
/external/javassist/src/main/javassist/bytecode/
ByteStream.java
52
int
oldCount
= count;
53
buf[
oldCount
] = (byte)b;
54
count =
oldCount
+ 1;
59
int
oldCount
= count;
60
buf[
oldCount
] = (byte)(s >>> 8);
61
buf[
oldCount
+ 1] = (byte)s;
62
count =
oldCount
+ 2;
67
int
oldCount
= count;
68
buf[
oldCount
] = (byte)(i >>> 24);
69
buf[
oldCount
+ 1] = (byte)(i >>> 16)
[
all
...]
/external/guava/guava/src/com/google/common/collect/
AbstractMapBasedMultiset.java
234
int
oldCount
;
236
oldCount
= 0;
239
oldCount
= frequency.get();
240
long newCount = (long)
oldCount
+ (long) occurrences;
246
return
oldCount
;
260
int
oldCount
= frequency.get();
263
if (
oldCount
> occurrences) {
266
numberRemoved =
oldCount
;
272
return
oldCount
;
280
int
oldCount
;
[
all
...]
TreeMultiset.java
235
public boolean setCount(E element, int
oldCount
, int newCount) {
238
return mutate(element, new ConditionalSetCountModifier(
oldCount
, newCount))
239
==
oldCount
;
458
abstract int newCount(int
oldCount
);
463
int
oldCount
= countOrZero(originalEntry);
464
int newCount = newCount(
oldCount
);
465
if (
oldCount
== newCount) {
469
} else if (
oldCount
== 0) {
487
int newCount(int
oldCount
) {
488
checkArgument(countToAdd <= Integer.MAX_VALUE -
oldCount
, "Cannot add this many elements")
[
all
...]
ForwardingMultiset.java
99
public boolean setCount(E element, int
oldCount
, int newCount) {
100
return delegate().setCount(element,
oldCount
, newCount);
230
E element, int
oldCount
, int newCount) {
231
return Multisets.setCountImpl(this, element,
oldCount
, newCount);