index int64 1 10.7k | class stringclasses 782 values | comment_sentence stringlengths 1 1.78k | partition int64 0 0 | combo stringlengths 17 1.81k | labels listlengths 7 7 |
|---|---|---|---|---|---|
1,311 | HostAndPort.java | p note that this is not an exhaustive list, because these methods are only concerned with | 0 | p note that this is not an exhaustive list, because these methods are only concerned with | HostAndPort.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,313 | HostAndPort.java | caller s responsibility. | 0 | caller s responsibility. | HostAndPort.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,317 | ImmutableSetHashFloodingDetectionBenchmark.java | benchmark of implementations of @link immutableset#hashfloodingdetected object . | 0 | benchmark of implementations of @link immutableset#hashfloodingdetected object . | ImmutableSetHashFloodingDetectionBenchmark.java | [
1,
0,
0,
0,
1,
0,
0
] |
1,318 | ImmutableTable_CustomFieldSerializerBase.java | this class contains static utility methods for writing @link immutabletable gwt field | 0 | this class contains static utility methods for writing @link immutabletable gwt field | ImmutableTable_CustomFieldSerializerBase.java | [
1,
0,
0,
0,
0,
0,
0
] |
1,319 | ImmutableTable_CustomFieldSerializerBase.java | serializers. | 0 | serializers. | ImmutableTable_CustomFieldSerializerBase.java | [
1,
0,
0,
0,
0,
0,
0
] |
1,322 | LazyStackTraceBenchmark.java | quick and dirty benchmark of @link throwables#lazystacktrace throwable . | 0 | quick and dirty benchmark of @link throwables#lazystacktrace throwable . | LazyStackTraceBenchmark.java | [
1,
0,
0,
0,
1,
0,
0
] |
1,324 | LazyStackTraceBenchmark.java | finder implementation that might be used in a logging framework. | 0 | finder implementation that might be used in a logging framework. | LazyStackTraceBenchmark.java | [
0,
0,
0,
0,
0,
0,
1
] |
1,328 | MapPutAllTester.java | please see @link com^google.common^collect.testing^maptestsuitebuilder . | 0 | please see @link com^google.common^collect.testing^maptestsuitebuilder . | MapPutAllTester.java | [
0,
0,
0,
0,
1,
0,
0
] |
1,329 | MapPutAllTester.java | @author chris povirk | 0 | @author chris povirk | MapPutAllTester.java | [
0,
1,
0,
0,
0,
0,
0
] |
1,331 | MapSerializationTester.java | basic serialization test for maps. | 0 | basic serialization test for maps. | MapSerializationTester.java | [
1,
0,
0,
0,
0,
0,
0
] |
1,337 | MultimapBuilder.java | explicitly in @code com^google.common^collect , for example | 0 | explicitly in @code com^google.common^collect , for example | MultimapBuilder.java | [
0,
0,
1,
1,
0,
0,
0
] |
1,345 | MultimapBuilder.java | invoking a configuration method has no effect | 0 | invoking a configuration method has no effect | MultimapBuilder.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,357 | MultimapBuilder.java | an intermediate stage in a @link multimapbuilder in which the key value collection map | 0 | an intermediate stage in a @link multimapbuilder in which the key value collection map | MultimapBuilder.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,359 | MultimapBuilder.java | @param k0 the upper bound on the key type of the generated multimap. | 0 | @param k0 the upper bound on the key type of the generated multimap. | MultimapBuilder.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,377 | NullsLastOrdering_CustomFieldSerializer.java | @author chris povirk | 0 | @author chris povirk | NullsLastOrdering_CustomFieldSerializer.java | [
0,
1,
0,
0,
0,
0,
0
] |
1,378 | ObjectCountHashMap.java | objectcounthashmap is an implementation of @code abstractobjectcountmap that uses arrays to | 0 | objectcounthashmap is an implementation of @code abstractobjectcountmap that uses arrays to | ObjectCountHashMap.java | [
1,
0,
0,
0,
0,
0,
0
] |
1,379 | ObjectCountHashMap.java | store key objects and count values. | 0 | store key objects and count values. | ObjectCountHashMap.java | [
1,
0,
0,
0,
0,
0,
0
] |
1,382 | ObjectCountHashMap.java | minimizes object allocation and reduces memory footprint. | 0 | minimizes object allocation and reduces memory footprint. | ObjectCountHashMap.java | [
0,
0,
0,
0,
0,
0,
1
] |
1,387 | PeekingIterator.java | peekingiterator a . | 0 | peekingiterator a . | PeekingIterator.java | [
0,
0,
0,
0,
1,
0,
0
] |
1,389 | PeekingIterator.java | @since 20 | 0 | @since 20 | PeekingIterator.java | [
0,
1,
0,
0,
0,
0,
0
] |
1,391 | Preconditions.java | correctly that is, whether its i preconditions i were met . | 0 | correctly that is, whether its i preconditions i were met . | Preconditions.java | [
1,
0,
1,
1,
0,
0,
0
] |
1,400 | Preconditions.java | throw new illegalargumentexception input is negative value | 0 | throw new illegalargumentexception input is negative value | Preconditions.java | [
0,
0,
1,
1,
0,
0,
0
] |
1,417 | Preconditions.java | p would be flagged as having called @code sqrt with an illegal argument. | 0 | p would be flagged as having called @code sqrt with an illegal argument. | Preconditions.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,419 | Preconditions.java | p avoid passing message arguments that are expensive to compute your code will always compute | 0 | p avoid passing message arguments that are expensive to compute your code will always compute | Preconditions.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,421 | Preconditions.java | if you have such arguments, use the conventional | 0 | if you have such arguments, use the conventional | Preconditions.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,423 | Preconditions.java | p depending on your message arguments, memory may be allocated for boxing and varargs array | 0 | p depending on your message arguments, memory may be allocated for boxing and varargs array | Preconditions.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,425 | Preconditions.java | however, the methods of this class have a large number of overloads that prevent such | 0 | however, the methods of this class have a large number of overloads that prevent such | Preconditions.java | [
0,
0,
1,
0,
0,
0,
0
] |
1,426 | Preconditions.java | allocations in many common cases. | 0 | allocations in many common cases. | Preconditions.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,430 | Preconditions.java | environment if possible before spending a lot of effort on tweaking a particular element. | 0 | environment if possible before spending a lot of effort on tweaking a particular element. | Preconditions.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,431 | Preconditions.java | h3 other types of preconditions h3 | 0 | h3 other types of preconditions h3 | Preconditions.java | [
0,
0,
1,
0,
0,
0,
0
] |
1,432 | Preconditions.java | p not every type of precondition failure is supported by these methods. | 0 | p not every type of precondition failure is supported by these methods. | Preconditions.java | [
0,
0,
1,
0,
0,
0,
0
] |
1,434 | Preconditions.java | standard jdk exceptions such as @link java^util.nosuchelementexception or @link | 0 | standard jdk exceptions such as @link java^util.nosuchelementexception or @link | Preconditions.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,436 | Preconditions.java | h3 non preconditions h3 | 0 | h3 non preconditions h3 | Preconditions.java | [
0,
0,
1,
0,
0,
0,
0
] |
1,437 | Preconditions.java | p it is of course possible to use the methods of this class to check for invalid conditions | 0 | p it is of course possible to use the methods of this class to check for invalid conditions | Preconditions.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,439 | Preconditions.java | doing so is b not recommended b because it is | 0 | doing so is b not recommended b because it is | Preconditions.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,451 | Preconditions.java | h3 @code java^util.objects^requirenonnull h3 | 0 | h3 @code java^util.objects^requirenonnull h3 | Preconditions.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,455 | Preconditions.java | #checknotnull object or @link verify#verifynotnull object is appropriate to the situation. | 0 | #checknotnull object or @link verify#verifynotnull object is appropriate to the situation. | Preconditions.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,457 | Preconditions.java | h3 only @code %s is supported h3 | 0 | h3 only @code %s is supported h3 | Preconditions.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,458 | Preconditions.java | p @code preconditions uses @link strings#lenientformat to format error message template | 0 | p @code preconditions uses @link strings#lenientformat to format error message template | Preconditions.java | [
0,
0,
1,
0,
0,
0,
0
] |
1,462 | Preconditions.java | however, note that if the number of arguments does not match the | 0 | however, note that if the number of arguments does not match the | Preconditions.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,463 | Preconditions.java | number of occurrences of @code %s in the format string, @code preconditions will still | 0 | number of occurrences of @code %s in the format string, @code preconditions will still | Preconditions.java | [
0,
0,
1,
0,
0,
0,
0
] |
1,466 | Preconditions.java | h3 more information h3 | 0 | h3 more information h3 | Preconditions.java | [
0,
0,
0,
0,
1,
0,
0
] |
1,467 | Preconditions.java | p see the guava user guide on a | 0 | p see the guava user guide on a | Preconditions.java | [
0,
0,
0,
0,
1,
0,
0
] |
1,470 | Preconditions.java | preconditions a . | 0 | preconditions a . | Preconditions.java | [
0,
0,
1,
1,
1,
0,
0
] |
1,471 | Preconditions.java | @author kevin bourrillion | 0 | @author kevin bourrillion | Preconditions.java | [
0,
1,
0,
0,
0,
0,
0
] |
1,472 | Preconditions.java | @since 20 | 0 | @since 20 | Preconditions.java | [
0,
0,
0,
0,
0,
1,
0
] |
1,473 | RegularImmutableList_CustomFieldSerializer.java | this class implements the gwt serialization of @link regularimmutablelist . | 0 | this class implements the gwt serialization of @link regularimmutablelist . | RegularImmutableList_CustomFieldSerializer.java | [
1,
0,
0,
0,
1,
0,
0
] |
1,477 | Resources.java | provides utility methods for working with resources in the classpath. | 0 | provides utility methods for working with resources in the classpath. | Resources.java | [
1,
0,
0,
0,
0,
0,
0
] |
1,484 | SmoothRateLimiter.java | how is the ratelimiter designed, and why? | 0 | how is the ratelimiter designed, and why? | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,491 | SmoothRateLimiter.java | wait as much. | 0 | wait as much. | SmoothRateLimiter.java | [
1,
0,
0,
0,
0,
0,
0
] |
1,496 | SmoothRateLimiter.java | qps 5 5 tokens per second , if we ensure that a request isn t granted earlier than 200ms after | 0 | qps 5 5 tokens per second , if we ensure that a request isn t granted earlier than 200ms after | SmoothRateLimiter.java | [
0,
0,
1,
0,
0,
0,
0
] |
1,498 | SmoothRateLimiter.java | if a request comes and the last request was | 0 | if a request comes and the last request was | SmoothRateLimiter.java | [
0,
0,
1,
1,
0,
0,
0
] |
1,502 | SmoothRateLimiter.java | it is important to realize that such a ratelimiter has a very superficial memory of the past | 0 | it is important to realize that such a ratelimiter has a very superficial memory of the past | SmoothRateLimiter.java | [
0,
0,
1,
1,
0,
0,
1
] |
1,505 | SmoothRateLimiter.java | what if the ratelimiter was unused for a long period of | 0 | what if the ratelimiter was unused for a long period of | SmoothRateLimiter.java | [
0,
0,
1,
1,
0,
0,
1
] |
1,508 | SmoothRateLimiter.java | this ratelimiter would immediately | 0 | this ratelimiter would immediately | SmoothRateLimiter.java | [
0,
0,
1,
0,
0,
0,
1
] |
1,513 | SmoothRateLimiter.java | overflow, depending on the real world consequences of not using the expected rate. | 0 | overflow, depending on the real world consequences of not using the expected rate. | SmoothRateLimiter.java | [
0,
0,
1,
1,
0,
0,
1
] |
1,525 | SmoothRateLimiter.java | the request has become less ready for future requests , ie its caches become stale, and | 0 | the request has become less ready for future requests , ie its caches become stale, and | SmoothRateLimiter.java | [
0,
0,
1,
1,
0,
0,
0
] |
1,527 | SmoothRateLimiter.java | example is when a server has just booted, and it is mostly busy with getting itself up to | 0 | example is when a server has just booted, and it is mostly busy with getting itself up to | SmoothRateLimiter.java | [
0,
0,
1,
0,
0,
0,
0
] |
1,529 | SmoothRateLimiter.java | to deal with such scenarios, we add an extra dimension, that of past underutilization , | 0 | to deal with such scenarios, we add an extra dimension, that of past underutilization , | SmoothRateLimiter.java | [
0,
0,
1,
0,
0,
0,
0
] |
1,531 | SmoothRateLimiter.java | this variable is zero when there is no underutilization, | 0 | this variable is zero when there is no underutilization, | SmoothRateLimiter.java | [
0,
0,
1,
1,
0,
0,
0
] |
1,538 | SmoothRateLimiter.java | how this works is best explained with an example | 0 | how this works is best explained with an example | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,542 | SmoothRateLimiter.java | for 10 seconds ie, we expected a request at time x, but we are at time x 10 seconds before | 0 | for 10 seconds ie, we expected a request at time x, but we are at time x 10 seconds before | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,545 | SmoothRateLimiter.java | at that point, a request of | 0 | at that point, a request of | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,547 | SmoothRateLimiter.java | we serve this request out of storedpermits, and reduce that to 70 how | 0 | we serve this request out of storedpermits, and reduce that to 70 how | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,548 | SmoothRateLimiter.java | this is translated to throttling time is discussed later . | 0 | this is translated to throttling time is discussed later . | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,549 | SmoothRateLimiter.java | immediately after, assume that an | 0 | immediately after, assume that an | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,551 | SmoothRateLimiter.java | we serve the request partly from storedpermits, using all the | 0 | we serve the request partly from storedpermits, using all the | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,552 | SmoothRateLimiter.java | remaining 70 permits, and the remaining 30, we serve them by fresh permits produced by the | 0 | remaining 70 permits, and the remaining 30, we serve them by fresh permits produced by the | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,553 | SmoothRateLimiter.java | rate limiter. | 0 | rate limiter. | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,555 | SmoothRateLimiter.java | 1 token per second , then this will take 3 seconds. | 0 | 1 token per second , then this will take 3 seconds. | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,556 | SmoothRateLimiter.java | but what does it mean to serve 7 stored | 0 | but what does it mean to serve 7 stored | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,557 | SmoothRateLimiter.java | permits? | 0 | permits? | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,558 | SmoothRateLimiter.java | as explained above, there is no unique answer. | 0 | as explained above, there is no unique answer. | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,559 | SmoothRateLimiter.java | if we are primarily interested to deal | 0 | if we are primarily interested to deal | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,560 | SmoothRateLimiter.java | with underutilization, then we want stored permits to be given out faster than fresh ones, | 0 | with underutilization, then we want stored permits to be given out faster than fresh ones, | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,561 | SmoothRateLimiter.java | because underutilization free resources for the taking. | 0 | because underutilization free resources for the taking. | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,562 | SmoothRateLimiter.java | if we are primarily interested to | 0 | if we are primarily interested to | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,563 | SmoothRateLimiter.java | deal with overflow, then stored permits could be given out slower than fresh ones. | 0 | deal with overflow, then stored permits could be given out slower than fresh ones. | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,564 | SmoothRateLimiter.java | thus, we | 0 | thus, we | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,565 | SmoothRateLimiter.java | require a different in each case function that translates storedpermits to throttling time. | 0 | require a different in each case function that translates storedpermits to throttling time. | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,567 | SmoothRateLimiter.java | the | 0 | the | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,569 | SmoothRateLimiter.java | storedpermits | 0 | storedpermits | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,570 | SmoothRateLimiter.java | essentially measure unused time we spend unused time buying storing permits. | 0 | essentially measure unused time we spend unused time buying storing permits. | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,572 | SmoothRateLimiter.java | permits time , thus 1 rate time permits . | 0 | permits time , thus 1 rate time permits . | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,574 | SmoothRateLimiter.java | of requested permits. | 0 | of requested permits. | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,576 | SmoothRateLimiter.java | integrals . | 0 | integrals . | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,577 | SmoothRateLimiter.java | cost as fresh ones 1 qps is the cost for each . | 0 | cost as fresh ones 1 qps is the cost for each . | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,578 | SmoothRateLimiter.java | underutilization. | 0 | underutilization. | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,579 | SmoothRateLimiter.java | last, but not least consider a ratelimiter with rate of 1 permit per second, currently | 0 | last, but not least consider a ratelimiter with rate of 1 permit per second, currently | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,580 | SmoothRateLimiter.java | completely unused, and an expensive acquire 100 request comes. | 0 | completely unused, and an expensive acquire 100 request comes. | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,583 | SmoothRateLimiter.java | a much | 0 | a much | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,584 | SmoothRateLimiter.java | instead , and postpone subsequent requests as needed. | 0 | instead , and postpone subsequent requests as needed. | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,585 | SmoothRateLimiter.java | task immediately, and postpone by 100 seconds future requests, thus we allow for work to get | 0 | task immediately, and postpone by 100 seconds future requests, thus we allow for work to get | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,586 | SmoothRateLimiter.java | this has important consequences it means that the ratelimiter doesn t remember the time of the | 0 | this has important consequences it means that the ratelimiter doesn t remember the time of the | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,588 | SmoothRateLimiter.java | this also enables | 0 | this also enables | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,589 | SmoothRateLimiter.java | us to tell immediately see tryacquire timeout whether a particular timeout is enough to get | 0 | us to tell immediately see tryacquire timeout whether a particular timeout is enough to get | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,590 | SmoothRateLimiter.java | us to the point of the next scheduling time, since we always maintain that. | 0 | us to the point of the next scheduling time, since we always maintain that. | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,591 | SmoothRateLimiter.java | and what we mean by | 0 | and what we mean by | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,593 | SmoothRateLimiter.java | expected arrival time of the next request is actually in the past, then the difference now | 0 | expected arrival time of the next request is actually in the past, then the difference now | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
1,594 | SmoothRateLimiter.java | past is the amount of time that the ratelimiter was formally unused, and it is that amount of | 0 | past is the amount of time that the ratelimiter was formally unused, and it is that amount of | SmoothRateLimiter.java | [
0,
0,
0,
1,
0,
0,
0
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.