OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:late
(Results
1 - 4
of
4
) sorted by null
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
CalendarTest.java
491
Calendar
late
= Calendar.getInstance();
local
494
late
.set(2008, 3, 20, 17, 28, 22);
496
assertTrue(early.before(
late
));
498
assertFalse(
late
.before(early));
500
assertTrue(
late
.after(early));
501
assertFalse(
late
.after(
late
));
502
assertFalse(early.after(
late
));
506
late
.set(2008, 3, 20, 17, 28, 12);
508
assertTrue(early.before(
late
));
[
all
...]
/external/clang/test/CXX/expr/expr.unary/expr.unary.noexcept/
sema.cpp
171
void
late
() {
function
194
late
<float, true>();
195
late
<S3, false>();
/external/speex/libspeex/
jitter.c
48
+
late
146
spx_uint32_t arrival[SPEEX_JITTER_MAX_BUFFER_SIZE]; /**< Packet arrival time (0 means it was
late
, even though it's a valid timestamp) */
154
int late_cutoff; /**< How
late
must a packet be for it not to be considered at all */
160
int window_size; /**< Total window over which the
late
frames are counted */
162
int max_late_rate; /**< Absolute maximum amount of
late
packets tolerable (in percent) */
171
cost = delay + late_factor*[number of frames that would be
late
if we used that delay]
173
@param late_factor Equivalent cost of a
late
frame (in timestamp units)
180
int
late
= 0;
local
209
/* Pick the TOP_DELAY "latest" packets (doesn't need to actually be
late
236
cost = -latest + late_factor*
late
;
371
int
late
;
local
[
all
...]
/external/v8/src/inspector/build/closure-compiler/
closure-compiler.jar
Completed in 371 milliseconds