| /frameworks/base/tools/layoutlib/bridge/src/android/text/ |
| Primitive.java | 28 // Penalty has both width and penalty.
29 // Word_break has penalty only.
31 public final float penalty; field in class:Primitive
36 private Primitive(@NonNull PrimitiveType type, int location, float width, float penalty) {
40 this.penalty = penalty;
53 * Aesthetic cost indicating how desirable breaking at this point will be. A penalty of
54 * {@link #PENALTY_INFINITY} means a forced non-break, whereas a penalty of negative
57 * Currently, it only stores penalty with values 0 or -infinity
[all...] |
| OptimizingLineBreaker.java | 50 assert p.type == PrimitiveType.PENALTY;
65 if (p.type == PrimitiveType.PENALTY) {
82 finalBreak, p.penalty) + opt[pos].mDemerits;
99 if (p.penalty == -PENALTY_INFINITY) {
174 float penalty) {
176 return (deviation * deviation) + penalty;
207 (p.type == PrimitiveType.PENALTY || p.type == PrimitiveType.WORD_BREAK)) {
|
| GreedyLineBreaker.java | 106 if (p.type == PrimitiveType.PENALTY &&
107 p.penalty < PENALTY_INFINITY) {
111 if (p.penalty == -PENALTY_INFINITY) {
|
| /external/webrtc/webrtc/modules/rtp_rtcp/source/ |
| vp8_partition_aggregator.cc | 51 int PartitionTreeNode::Cost(size_t penalty) {
60 return cost + NumPackets() * penalty;
109 size_t penalty) {
118 return right->GetOptimalNode(max_size, penalty);
121 return left->GetOptimalNode(max_size, penalty);
125 if (left->Cost(penalty) <= right->Cost(penalty)) {
132 first = first->GetOptimalNode(max_size, penalty);
133 if (second->Cost(penalty) <= first->Cost(penalty)) {
[all...] |
| vp8_partition_aggregator.h | 41 int Cost(size_t penalty);
50 // penalty. The method will be recursively called while the solver is
52 PartitionTreeNode* GetOptimalNode(size_t max_size, size_t penalty);
108 ConfigVec FindOptimalConfiguration(size_t max_size, size_t penalty);
119 // of penalty bytes. If the size of the fragments fall outside the range
123 size_t penalty,
|
| /toolchain/binutils/binutils-2.25/config/ |
| mh-ppc-aix | 4 # penalty and is not required with section anchors enabled by default so we
|
| /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
|
| /external/pdfium/xfa/src/fxbarcode/qrcode/ |
| BC_QRCoderMaskUtil.cpp | 37 int32_t penalty = 0;
local
47 penalty++;
51 return 3 * penalty;
55 int32_t penalty = 0;
local
85 penalty += 40;
99 penalty += 40;
103 return penalty;
169 int32_t penalty = 0;
local
183 penalty += 3;
185 penalty += 1;
[all...] |
| /system/connectivity/shill/wifi/ |
| wifi_driver_hal.h | 40 // initialized. So there won't be any performance penalty for doing it.
47 // initialized. So there won't be any performance penalty for doing it.
|
| /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/clang/lib/Format/ |
| UnwrappedLineFormatter.cpp | 482 /// \brief Formats an \c AnnotatedLine and returns the penalty.
493 /// \p Penalty as well as \p State. If \p DryRun is false, also directly
510 unsigned &Penalty) {
523 Penalty +=
557 Penalty += formatLine(*Previous.Children[0], State.Column + 1, DryRun);
591 unsigned Penalty = 0;
592 formatChildren(State, Newline, /*DryRun=*/false, Penalty);
610 unsigned Penalty = 0;
613 formatChildren(State, /*Newline=*/false, DryRun, Penalty);
616 return Penalty;
[all...] |
| UnwrappedLineFormatter.h | 41 /// \brief Format the current block and return the penalty.
58 // Cache to store the penalty of formatting a vector of AnnotatedLines
|
| ContinuationIndenter.h | 93 /// \returns An extra penalty if a token was broken, otherwise 0.
95 /// The returned penalty will cover the cost of the additional line breaks and
96 /// column limit violation in all lines except for the last one. The penalty
126 /// \returns Extra penalty for the first line of the literal: last line is
127 /// handled in \c addNextStateToQueue, and the penalty for other lines doesn't
232 /// The first line break in a certain \c ParenState causes extra penalty so
340 /// penalty early would need to lead to different values in the \c
342 /// values would need to lead to a significant amount of avoided penalty
|
| FormatToken.cpp | 96 // bin-packed. Add a severe penalty to this so that column layouts are
102 unsigned Penalty = 0;
123 // Place token using the continuation indenter and store the penalty.
124 Penalty += Indenter->addTokenToState(State, NewLine, DryRun, ExtraSpaces);
126 return Penalty;
|
| ContinuationIndenter.cpp | 282 unsigned Penalty = 0;
284 Penalty = addTokenOnNewLine(State, DryRun);
288 return moveStateToNextToken(State, DryRun, Newline) + Penalty;
411 // Extra penalty that needs to be added because of the way certain line
413 unsigned Penalty = 0;
419 // The first line break on any NestingLevel causes an extra penalty in order
422 Penalty += 15;
425 Penalty += State.NextToken->SplitPenalty;
428 // short. Also always add the penalty if the LHS is split over mutliple lines
429 // to avoid unnecessary line breaks that just work around this penalty
[all...] |
| /frameworks/minikin/libs/minikin/ |
| LineBreaker.cpp | 39 // Multiplier for hyphen penalty on last line.
41 // Penalty assigned to each line break (to try to minimize number of lines)
211 float penalty = hyphenPenalty * mWordBreaker.breakBadness(); local
212 addWordBreak(current, mWidth, postBreak, penalty, 0);
226 float penalty, uint8_t hyph) {
241 cand.penalty = SCORE_DESPERATE;
256 cand.penalty = penalty;
282 if (cand.penalty <= mBestScore) {
284 mBestScore = cand.penalty;
[all...] |
| /system/netd/server/ |
| StrictController.cpp | 75 // Chain triggered when cleartext socket detected and penalty is log
79 // Chain triggered when cleartext socket detected and penalty is reject
159 int StrictController::setUidCleartextPenalty(uid_t uid, StrictPenalty penalty) {
164 if (penalty == ACCEPT) {
182 if (penalty == LOG) {
186 } else if (penalty == REJECT) {
|
| /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
|
| /frameworks/minikin/include/minikin/ |
| LineBreaker.h | 194 float penalty; // penalty of this break (for example, hyphen penalty) member in struct:android::LineBreaker::Candidate
202 void addWordBreak(size_t offset, ParaWidth preBreak, ParaWidth postBreak, float penalty,
|
| /external/curl/docs/libcurl/opts/ |
| CURLMOPT_CONTENT_LENGTH_PENALTY_SIZE.3 | 25 CURLMOPT_CONTENT_LENGTH_PENALTY_SIZE \- size threshold for pipelining penalty
|
| /external/mesa3d/docs/ |
| README.THREADS | 11 that is). There is no measurable penalty on single
|
| /packages/apps/TV/src/com/android/tv/util/ |
| SystemProperties.java | 39 * Allow Strict death penalty for eng builds.
|
| /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;
|
| /system/netd/server/binder/android/net/ |
| INetd.aidl | 46 * - When disabled, all packets to/from apps in the penalty box chain are rejected on costly
48 * - When enabled, only apps that are in the happy box chain and not in the penalty box chain
51 * traffic from system UIDs, place them in the penalty box chain.
|
