| /dports/textproc/fop/fop-2.6/fop-core/src/main/java/org/apache/fop/layoutmgr/ |
| H A D | BreakingAlgorithm.java | 352 bestDemerits[fitness] = demerits; in addRecord()
1009 double demerits, in forceNode() argument
1089 double demerits, in activateNode() argument
1095 log.trace("\tDemerits=" + demerits); in activateNode()
1242 double demerits = 0; in computeDemerits() local
1250 demerits = f * f; in computeDemerits()
1254 demerits = f * f; in computeDemerits()
1257 demerits = f * f; in computeDemerits()
1264 demerits += repeatedFlaggedDemerit; in computeDemerits()
1295 demerits += activeNode.totalDemerits; in computeDemerits()
[all …]
|
| H A D | PageBreakingAlgorithm.java | 215 super.addRecord(demerits, node, adjust, in addRecord()
891 double demerits = 0; in computeDemerits() local
899 demerits = f * f; in computeDemerits()
901 demerits = f * f - penalty * penalty; in computeDemerits()
903 demerits = f * f; in computeDemerits()
906 demerits = f * f; in computeDemerits()
913 demerits += repeatedFlaggedDemerit; in computeDemerits()
918 demerits += incompatibleFitnessDemerit; in computeDemerits()
931 demerits += splitFootnoteDemerits; in computeDemerits()
937 demerits += activeNode.totalDemerits; in computeDemerits()
[all …]
|
| H A D | BalancingColumnBreakingAlgorithm.java | 55 double demerits = Double.MAX_VALUE; in computeDemerits() local
63 return demerits; in computeDemerits()
73 demerits = idealDemerit; in computeDemerits()
75 return demerits; in computeDemerits()
|
| /dports/converters/p5-LaTeXML/LaTeXML-0.8.6/lib/LaTeXML/Post/MathML/ |
| H A D | Linebreaker.pm | 508 my ($node, $target, $level, $demerits) = @_;
574 my ($node, $target, $level, $demerits) = @_;
607 if ($demerits < $NOBREAK) {
794 my ($node, $target, $level, $demerits) = @_;
800 my ($node, $target, $level, $demerits) = @_;
816 my ($node, $target, $level, $demerits) = @_;
846 my ($node, $target, $level, $demerits) = @_;
852 my ($node, $target, $level, $demerits) = @_;
869 my ($node, $target, $level, $demerits) = @_;
888 my ($node, $target, $level, $demerits) = @_;
[all …]
|
| /dports/www/hotcrp/hotcrp-2.102/lib/ |
| H A D | abbreviationmatcher.php | 53 $ppos = $spos = $demerits = 0;
69 $demerits += ($m[1] !== "" || $pword_star ? 1 : 0);
71 $demerits += 1;
77 $demerits += count($swords) - $spos;
78 return 1 - 0.015625 * max(min($demerits, 63), 1);
94 $ppos = $spos = $demerits = 0;
108 $demerits += ($sidx < strlen($sword) ? 1 : 0);
113 $demerits += count($swords) - $spos;
114 return 1 - 0.015625 * max(min($demerits, 63), 1);
|
| /dports/print/lilypond/lilypond-2.22.1/lily/ |
| H A D | page-spacing.cc | 353 Real demerits = space.force_ * space.force_; in calc_subproblem() local
358 demerits = std::min (demerits, BAD_SPACING_PENALTY); in calc_subproblem()
359 demerits += (prev ? prev->demerits_ : 0); in calc_subproblem()
378 demerits += penalty; in calc_subproblem()
379 if (demerits < cur.demerits_ || page_start == line) in calc_subproblem()
381 cur.demerits_ = demerits; in calc_subproblem()
|
| H A D | beam-quanting.cc | 117 demerits = 0.0; in Beam_configuration()
128 demerits += demerit; in add()
147 qs->demerits = start_score / 1000.0; in new_config()
1328 Real demerits = 0.0; in score_collisions() local
1352 demerits += collision_demerit; in score_collisions()
1356 config->add (demerits, "C"); in score_collisions()
|
| /dports/print/lilypond-devel/lilypond-2.23.5/lily/ |
| H A D | page-spacing.cc | 357 Real demerits = space.force_ * space.force_; in calc_subproblem() local
362 demerits = std::min (demerits, BAD_SPACING_PENALTY); in calc_subproblem()
363 demerits += (prev ? prev->demerits_ : 0); in calc_subproblem()
382 demerits += penalty; in calc_subproblem()
383 if (demerits < cur.demerits_ || page_start == line) in calc_subproblem()
385 cur.demerits_ = demerits; in calc_subproblem()
|
| H A D | beam-quanting.cc | 123 demerits = 0.0; in Beam_configuration()
134 demerits += demerit; in add()
151 qs->demerits = start_score / 1000.0; in new_config()
1322 Real demerits = 0.0; in score_collisions() local
1346 demerits += collision_demerit; in score_collisions()
1350 config->add (demerits, "C"); in score_collisions()
|
| /dports/print/texlive-base/texlive-20150521-source/texk/texlive/linked_scripts/findhyph/ |
| H A D | findhyph | 46 $demerits = 1e10;
76 if ($endgraf && $3 < $demerits) {
79 $demerits = $3;
|
| /dports/print/lilypond-devel/lilypond-2.23.5/lily/include/ |
| H A D | beam-scoring-problem.hh | 51 Real demerits; member in Beam_configuration
70 return l->demerits > r->demerits; in operator ()()
|
| /dports/print/lilypond/lilypond-2.22.1/lily/include/ |
| H A D | beam-scoring-problem.hh | 52 Real demerits; member in Beam_configuration
73 return l->demerits > r->demerits; in operator ()()
|
| /dports/textproc/fop/fop-2.6/fop-core/src/main/java/org/apache/fop/layoutmgr/inline/ |
| H A D | LineLayoutPossibilities.java | 37 private double demerits; field in LineLayoutPossibilities.Possibility
42 demerits = dem; in Possibility()
51 return demerits; in getDemerits()
|
| /dports/print/lilypond-devel/lilypond-2.23.5/input/regression/ |
| H A D | slur-scoring.ly | 5 slurs are generated. Each esthetic aspect gets demerits, the best
6 configuration (with least demerits) wins. This must be tested in
|
| H A D | slur-inspect-quants.ly | 4 demerit scores for the given configuration. Here, there are demerits
|
| /dports/print/lilypond/lilypond-2.22.1/input/regression/ |
| H A D | slur-scoring.ly | 5 slurs are generated. Each esthetic aspect gets demerits, the best
6 configuration (with least demerits) wins. This must be tested in
|
| H A D | slur-inspect-quants.ly | 4 demerit scores for the given configuration. Here, there are demerits
|
| /dports/textproc/fop/fop-2.6/fop-core/src/test/java/org/apache/fop/ |
| H A D | KnuthAlgorithmTestCase.java | 104 public void updateData1(int total, double demerits) { in updateData1() argument
|
| /dports/print/tex-luatex/texlive-20150521-source/texk/web2c/luatexdir/tex/ |
| H A D | linebreak.w | 498 |total_demerits| is the minimum possible sum of demerits over all
654 class, we keep track of the best total demerits known, in an array with
666 static int minimal_demerits[4]; /* best total demerits known for current
701 static int fewest_demerits; /*the demerits associated with |best_bet| */
1112 int d; /*demerits of test line */
1284 /* Consider the demerits for a line from |r| to |cur_p|;
1534 but we will compute the total demerits and record them in the
1542 /* Compute the demerits, |d|, from |r| to |cur_p|; */
1566 d += total_demerits(r); /*this is the minimum total demerits
2080 /* Find an active node with fewest demerits; */
[all …]
|
| /dports/devel/tex-synctex/texlive-20150521-source/texk/web2c/luatexdir/tex/ |
| H A D | linebreak.w | 498 |total_demerits| is the minimum possible sum of demerits over all
654 class, we keep track of the best total demerits known, in an array with
666 static int minimal_demerits[4]; /* best total demerits known for current
701 static int fewest_demerits; /*the demerits associated with |best_bet| */
1112 int d; /*demerits of test line */
1284 /* Consider the demerits for a line from |r| to |cur_p|;
1534 but we will compute the total demerits and record them in the
1542 /* Compute the demerits, |d|, from |r| to |cur_p|; */
1566 d += total_demerits(r); /*this is the minimum total demerits
2080 /* Find an active node with fewest demerits; */
[all …]
|
| /dports/devel/tex-web2c/texlive-20150521-source/texk/web2c/luatexdir/tex/ |
| H A D | linebreak.w | 498 |total_demerits| is the minimum possible sum of demerits over all
654 class, we keep track of the best total demerits known, in an array with
666 static int minimal_demerits[4]; /* best total demerits known for current
701 static int fewest_demerits; /*the demerits associated with |best_bet| */
1112 int d; /*demerits of test line */
1284 /* Consider the demerits for a line from |r| to |cur_p|;
1534 but we will compute the total demerits and record them in the
1542 /* Compute the demerits, |d|, from |r| to |cur_p|; */
1566 d += total_demerits(r); /*this is the minimum total demerits
2080 /* Find an active node with fewest demerits; */
[all …]
|
| /dports/japanese/tex-ptex/texlive-20150521-source/texk/web2c/luatexdir/tex/ |
| H A D | linebreak.w | 498 |total_demerits| is the minimum possible sum of demerits over all
654 class, we keep track of the best total demerits known, in an array with
666 static int minimal_demerits[4]; /* best total demerits known for current
701 static int fewest_demerits; /*the demerits associated with |best_bet| */
1112 int d; /*demerits of test line */
1284 /* Consider the demerits for a line from |r| to |cur_p|;
1534 but we will compute the total demerits and record them in the
1542 /* Compute the demerits, |d|, from |r| to |cur_p|; */
1566 d += total_demerits(r); /*this is the minimum total demerits
2080 /* Find an active node with fewest demerits; */
[all …]
|
| /dports/print/tex-basic-engines/texlive-20150521-source/texk/web2c/luatexdir/tex/ |
| H A D | linebreak.w | 498 |total_demerits| is the minimum possible sum of demerits over all
654 class, we keep track of the best total demerits known, in an array with
666 static int minimal_demerits[4]; /* best total demerits known for current
701 static int fewest_demerits; /*the demerits associated with |best_bet| */
1112 int d; /*demerits of test line */
1284 /* Consider the demerits for a line from |r| to |cur_p|;
1534 but we will compute the total demerits and record them in the
1542 /* Compute the demerits, |d|, from |r| to |cur_p|; */
1566 d += total_demerits(r); /*this is the minimum total demerits
2080 /* Find an active node with fewest demerits; */
[all …]
|
| /dports/print/tex-aleph/texlive-20150521-source/texk/web2c/luatexdir/tex/ |
| H A D | linebreak.w | 498 |total_demerits| is the minimum possible sum of demerits over all
654 class, we keep track of the best total demerits known, in an array with
666 static int minimal_demerits[4]; /* best total demerits known for current
701 static int fewest_demerits; /*the demerits associated with |best_bet| */
1112 int d; /*demerits of test line */
1284 /* Consider the demerits for a line from |r| to |cur_p|;
1534 but we will compute the total demerits and record them in the
1542 /* Compute the demerits, |d|, from |r| to |cur_p|; */
1566 d += total_demerits(r); /*this is the minimum total demerits
2080 /* Find an active node with fewest demerits; */
[all …]
|
| /dports/print/tex-xetex/texlive-20150521-source/texk/web2c/luatexdir/tex/ |
| H A D | linebreak.w | 498 |total_demerits| is the minimum possible sum of demerits over all
654 class, we keep track of the best total demerits known, in an array with
666 static int minimal_demerits[4]; /* best total demerits known for current
701 static int fewest_demerits; /*the demerits associated with |best_bet| */
1112 int d; /*demerits of test line */
1284 /* Consider the demerits for a line from |r| to |cur_p|;
1534 but we will compute the total demerits and record them in the
1542 /* Compute the demerits, |d|, from |r| to |cur_p|; */
1566 d += total_demerits(r); /*this is the minimum total demerits
2080 /* Find an active node with fewest demerits; */
[all …]
|