HomeSort by relevance Sort by last modified time
    Searched full:penalty (Results 1 - 25 of 329) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/chromium_org/third_party/webrtc/modules/rtp_rtcp/source/
vp8_partition_aggregator.cc 51 int PartitionTreeNode::Cost(int penalty) {
52 assert(penalty >= 0);
61 return cost + NumPackets() * penalty;
114 int penalty) {
123 return right->GetOptimalNode(max_size, penalty);
126 return left->GetOptimalNode(max_size, penalty);
130 if (left->Cost(penalty) <= right->Cost(penalty)) {
137 first = first->GetOptimalNode(max_size, penalty);
138 if (second->Cost(penalty) <= first->Cost(penalty))
    [all...]
vp8_partition_aggregator.h 41 int Cost(int penalty);
50 // penalty. The method will be recursively called while the solver is
52 PartitionTreeNode* GetOptimalNode(int max_size, int penalty);
106 ConfigVec FindOptimalConfiguration(int max_size, int penalty);
117 // of penalty bytes. If the size of the fragments fall outside the range
121 int penalty,
  /external/ipsec-tools/src/racoon/
throttle.c 85 te->penalty = time(NULL) + isakmp_cfg_config.auth_throttle;
111 if (te->penalty < now) {
125 * give no penalty even on error: this is the first time
140 * We had a match and auth failed, increase penalty.
146 remaining = te->penalty - now;
152 te->penalty = now + new;
156 return te->penalty;
throttle.h 38 int penalty; member in struct:throttle_entry
  /packages/experimental/StrictModeTest/res/layout/
main.xml 44 android:text="Penalty: Log?" />
50 android:text="Penalty: Flash?" />
56 android:text="Penalty: Dialog" />
62 android:text="Penalty: Dropbox" />
68 android:text="Penalty: Death" />
74 android:text="Penalty: Death-on-network" />
  /external/chromium_org/third_party/libxslt/libxslt/
xsltconfig.h 49 * Activate the compilation of the debug reporting. Speed penalty
103 * Activate the compilation of the debugger support. Speed penalty
xsltconfig.h.in 49 * Activate the compilation of the debug reporting. Speed penalty
103 * Activate the compilation of the debugger support. Speed penalty
xsltwin32config.h 52 * Activate the compilation of the debug reporting. Speed penalty
xsltwin32config.h.in 52 * Activate the compilation of the debug reporting. Speed penalty
  /external/chromium_org/third_party/libxslt/linux/libxslt/
xsltconfig.h 49 * Activate the compilation of the debug reporting. Speed penalty
103 * Activate the compilation of the debugger support. Speed penalty
xsltwin32config.h 52 * Activate the compilation of the debug reporting. Speed penalty
  /external/ceres-solver/internal/ceres/
canonical_views_clustering.h 73 // alpha is the size penalty that penalizes large number of canonical
76 // beta is the similarity penalty that penalizes canonical views that
118 // Penalty weight for the number of canonical views. A higher
122 // Penalty weight for the diversity (orthogonality) of the
canonical_views_clustering_test.cc 104 // Increases size penalty so the second canonical view won't be
133 // Increases similarity penalty so vertex 2 won't be chosen despite
  /external/clang/lib/Format/
ContinuationIndenter.h 91 /// \returns An extra penalty if a token was broken, otherwise 0.
93 /// The returned penalty will cover the cost of the additional line breaks and
94 /// column limit violation in all lines except for the last one. The penalty
124 /// \returns Extra penalty for the first line of the literal: last line is
125 /// handled in \c addNextStateToQueue, and the penalty for other lines doesn't
227 /// The first line break in a certain \c ParenState causes extra penalty so
333 /// penalty early would need to lead to different values in the \c
335 /// values would need to lead to a significant amount of avoided penalty
FormatToken.cpp 80 // bin-packed. Add a severe penalty to this so that column layouts are
86 unsigned Penalty = 0;
107 // Place token using the continuation indenter and store the penalty.
108 Penalty += Indenter->addTokenToState(State, NewLine, DryRun, ExtraSpaces);
110 return Penalty;
ContinuationIndenter.cpp 248 unsigned Penalty = 0;
250 Penalty = addTokenOnNewLine(State, DryRun);
254 return moveStateToNextToken(State, DryRun, Newline) + Penalty;
349 // Extra penalty that needs to be added because of the way certain line
351 unsigned Penalty = 0;
357 // The first line break on any NestingLevel causes an extra penalty in order
360 Penalty += 15;
363 Penalty += State.NextToken->SplitPenalty;
366 // short. Also always add the penalty if the LHS is split over mutliple lines
367 // to avoid unnecessary line breaks that just work around this penalty
    [all...]
Format.cpp 801 // Try to look up already computed penalty in DryRun-mode.
809 unsigned Penalty = 0;
    [all...]
  /external/chromium_org/third_party/mesa/src/docs/
README.THREADS 11 that is). There is no measurable penalty on single
  /external/mesa3d/docs/
README.THREADS 11 that is). There is no measurable penalty on single
  /frameworks/base/docs/html/tools/testing/
index.jd 24 declaring what you?re not allowed to do on that thread, and what the penalty is if you violate the
  /external/libvorbis/lib/
envelope.c 110 float penalty=gi->stretch_penalty-(ve->stretch/2-VE_MINSTRETCH); local
111 if(penalty<0.f)penalty=0.f;
112 if(penalty>gi->stretch_penalty)penalty=gi->stretch_penalty;
201 if(valmax>gi->preecho_thresh[j]+penalty){
205 if(valmin<gi->postecho_thresh[j]-penalty)ret|=2;
  /external/clang/docs/
ClangFormatStyleOptions.rst 302 The penalty for breaking a function call after "call(".
305 The penalty for each line break introduced inside a comment.
308 The penalty for breaking before the first ``<<``.
311 The penalty for each line break introduced inside a string literal.
314 The penalty for each character outside of the column limit.
317 Penalty for putting the return type of a function onto its own
  /bionic/libc/upstream-openbsd/lib/libc/stdlib/
exit.c 42 * thread-safe, but without a (significant) penalty to non-threaded
  /external/okhttp/okio/src/main/java/okio/
BufferedSink.java 23 * without a performance penalty.
  /libcore/luni/src/main/java/java/io/
FileReader.java 24 * Since this may induce some performance penalty, in particular if many small

Completed in 1155 milliseconds

1 2 3 4 5 6 7 8 91011>>