Home
last modified time | relevance | path

Searched refs:appeal (Results 1 – 25 of 1152) sorted by relevance

12345678910>>...47

/dports/devel/p5-String-Approx/String-Approx-3.28/t/
H A Damatch.t17 appeal
35 appeal
52 appeal
85 appeal
115 appeal
160 appeal
H A Dasubst.t23 su(per)appeal
84 su(per)appeal
188 su(su:per:appeal)appeal
H A Dwords3 appeal
/dports/cad/sumo/sumo-1.2.0/tools/contributed/traas/src/de/tudresden/sumo/util/
H A DQuery.java34 import it.polito.appeal.traci.TraCIException;
35 import it.polito.appeal.traci.TraCIException.UnexpectedData;
36 import it.polito.appeal.traci.protocol.Command;
37 import it.polito.appeal.traci.protocol.RequestMessage;
38 import it.polito.appeal.traci.protocol.ResponseContainer;
39 import it.polito.appeal.traci.protocol.ResponseMessage;
40 import it.polito.appeal.traci.protocol.StatusResponse;
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/blink/renderer/core/layout/ng/
H A Dng_fragmentation_utils.cc144 NGBreakAppeal appeal; in CalculateBreakAppealInside() local
149 appeal = block_break_token->BreakAppeal(); in CalculateBreakAppealInside()
151 appeal = layout_result.EarlyBreakAppeal(); in CalculateBreakAppealInside()
160 if (appeal > kBreakAppealViolatingBreakAvoid && in CalculateBreakAppealInside()
162 appeal = kBreakAppealViolatingBreakAvoid; in CalculateBreakAppealInside()
163 return appeal; in CalculateBreakAppealInside()
288 base::Optional<NGBreakAppeal> appeal, in BreakBeforeChild() argument
315 builder->AddBreakBeforeChild(child, appeal, is_forced_break); in BreakBeforeChild()
H A Dng_box_fragment_builder.h103 base::Optional<NGBreakAppeal> appeal,
209 NGBreakAppeal appeal) { in SetEarlyBreak() argument
211 break_appeal_ = appeal; in SetEarlyBreak()
223 void SetBreakAppeal(NGBreakAppeal appeal) { break_appeal_ = appeal; } in SetBreakAppeal() argument
H A Dng_box_fragment_builder.cc148 base::Optional<NGBreakAppeal> appeal, in AddBreakBeforeChild() argument
150 if (appeal) in AddBreakBeforeChild()
151 break_appeal_ = *appeal; in AddBreakBeforeChild()
156 DCHECK(!appeal || *appeal == kBreakAppealPerfect); in AddBreakBeforeChild()
H A Dng_constraint_space_builder.h169 void SetEarlyBreakAppeal(NGBreakAppeal appeal) { in SetEarlyBreakAppeal() argument
170 if (appeal == kBreakAppealLastResort && !space_.rare_data_) in SetEarlyBreakAppeal()
172 space_.EnsureRareData()->early_break_appeal = appeal; in SetEarlyBreakAppeal()
/dports/math/R-cran-carData/carData/man/
H A DGreene.Rd11 Court of Appeal for leave to appeal the negative ruling of the Board.
36 \code{yes}, case has some merit (leave to appeal should be granted).
41 \code{no}, leave to appeal not granted;
42 \code{yes}, leave to appeal granted.
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/blink/renderer/core/layout/ng/
H A Dng_fragmentation_utils.cc145 NGBreakAppeal appeal; in CalculateBreakAppealInside() local
150 appeal = block_break_token->BreakAppeal(); in CalculateBreakAppealInside()
152 appeal = layout_result.EarlyBreakAppeal(); in CalculateBreakAppealInside()
161 if (appeal > kBreakAppealViolatingBreakAvoid && in CalculateBreakAppealInside()
163 appeal = kBreakAppealViolatingBreakAvoid; in CalculateBreakAppealInside()
164 return appeal; in CalculateBreakAppealInside()
493 base::Optional<NGBreakAppeal> appeal, in BreakBeforeChild() argument
520 builder->AddBreakBeforeChild(child, appeal, is_forced_break); in BreakBeforeChild()
H A Dng_box_fragment_builder.h196 base::Optional<NGBreakAppeal> appeal,
366 NGBreakAppeal appeal) { in SetEarlyBreak() argument
368 break_appeal_ = appeal; in SetEarlyBreak()
380 void SetBreakAppeal(NGBreakAppeal appeal) { break_appeal_ = appeal; } in SetBreakAppeal() argument
H A Dng_box_fragment_builder.cc151 base::Optional<NGBreakAppeal> appeal, in AddBreakBeforeChild() argument
153 if (appeal) in AddBreakBeforeChild()
154 break_appeal_ = *appeal; in AddBreakBeforeChild()
159 DCHECK(!appeal || *appeal == kBreakAppealPerfect); in AddBreakBeforeChild()
H A Dng_constraint_space_builder.h166 void SetEarlyBreakAppeal(NGBreakAppeal appeal) { in SetEarlyBreakAppeal() argument
167 if (appeal == kBreakAppealLastResort && !space_.rare_data_) in SetEarlyBreakAppeal()
169 space_.EnsureRareData()->early_break_appeal = appeal; in SetEarlyBreakAppeal()
/dports/cad/sumo/sumo-1.2.0/tools/contributed/traas/src/it/polito/appeal/traci/
H A DCloseQuery.java20 package it.polito.appeal.traci;
22 import it.polito.appeal.traci.protocol.Command;
H A DTraCIException.java20 package it.polito.appeal.traci;
/dports/math/R-cran-igraph/igraph/man/
H A Dsample_pa.Rd17 zero.appeal = 1,
46 \item{zero.appeal}{The \sQuote{attractiveness} of the vertices with no
53 algorithm can handle any \code{power} and \code{zero.appeal} values and
57 one, or \code{zero.appeal} was not one. \code{bag} is the algorithm that
59 \code{zero.appeal} was one as well. It works by putting the ids of the
63 edges. It only works if \code{power} and \code{zero.appeal} are equal one.}
91 \code{power} and \code{zero.appeal} arguments.
H A Dsample_pa_age.Rd21 zero.deg.appeal = 1,
22 zero.age.appeal = 0,
57 \item{zero.deg.appeal}{The degree-dependent part of the
61 \item{zero.age.appeal}{The age-dependent part of the \sQuote{attrativeness}
101 (\eqn{\beta}{beta}, mandatory argument), \code{zero.deg.appeal} (\eqn{a},
102 optional, the default value is 1), \code{zero.age.appeal} (\eqn{b},
/dports/www/twiki/twiki/data/TWiki/
H A DWikiCulture.txt,v98 …a wiki page. It's not rocket science, but it doesn't appeal to the TV-watchers. If it doesn't appe…
155 …a wiki page. It's not rocket science, but it doesn't appeal to the TV-watchers. If it doesn't appe…
202 …a wiki page. It's not rocket science, but it doesn't appeal to the TV-watchers. If it doesn't appe…
/dports/cad/sumo/sumo-1.2.0/tools/contributed/traas/examples/java_library/
H A DSubscription.java21 import it.polito.appeal.traci.SumoTraciConnection;
22 import it.polito.appeal.traci.TraCIException;
H A DMultiClient2.java19 import it.polito.appeal.traci.SumoTraciConnection;
/dports/cad/sumo/sumo-1.2.0/tools/contributed/traas/src/de/tudresden/sumo/subscription/
H A DSubscription.java22 import it.polito.appeal.traci.protocol.Command;
/dports/cad/sumo/sumo-1.2.0/tools/contributed/traas/src/it/polito/appeal/traci/protocol/
H A DResponseContainer.java20 package it.polito.appeal.traci.protocol;
/dports/graphics/openshadinglanguage/OpenShadingLanguage-Release-1.11.15.0/
H A DCODE_OF_CONDUCT.md7 To report incidents or to appeal reports of incidents, send email to
/dports/graphics/py-openshadinglanguage/OpenShadingLanguage-Release-1.11.15.0/
H A DCODE_OF_CONDUCT.md7 To report incidents or to appeal reports of incidents, send email to
/dports/math/igraph/igraph-0.9.5/tests/unit/
H A Digraph_recent_degree_aging_game.out43 Negative zero appeal.

12345678910>>...47