Searched refs:cost (Results 51 - 61 of 61) sorted by relevance

123

/macosx-10.9.5/zsh-60/zsh/Src/Zle/
H A Dzle_main.c1072 int to = cost * costmult / 1000; /* milliseconds */
1086 if ((tv.tv_usec = cost * costmult) > 500000)
/macosx-10.9.5/llvmCore-3425.0.33/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp665 /// Check if expanding this expression is likely to incur significant cost. This
733 // Fow now, consider any other type of expression (div/mul/min/max) high cost.
798 assert(isValid() && "invalid cost");
936 assert(isValid() && "invalid cost");
939 /// Loose - Set this cost to a losing value.
949 /// operator< - Choose the lower cost.
969 OS << ", with addrec cost " << AddRecCost;
976 OS << ", plus " << ImmCost << " imm cost";
978 OS << ", plus " << SetupCost << " setup cost";
2415 // The chain itself may require a register, so intialize cost t
2416 int cost = 1; local
[all...]
/macosx-10.9.5/vim-53/runtime/syntax/
H A Dmush.vim176 syntax keyword mushAttribute cost desc dfail drop ealias efail enter fail
H A Dmaple.vim238 syn keyword mvLibrary Expand Ratrecon cost identity pclose ssystem
/macosx-10.9.5/screen-22/screen/
H A Ddisplay.c1145 int cost; local
1191 cost = LayRewrite(y - vp->v_yoff, xs - vp->v_xoff, xe - vp->v_xoff, &D_rend, 0);
1194 cost += D_EIcost + D_IMcost;
1195 return cost;
1260 /* Calculate the cost to move the cursor to the right x position */
1310 /* Calculate the cost to move the cursor to the right y position */
/macosx-10.9.5/cups-372.4/cups/ppdc/
H A Dppdc-driver.cxx640 f->cost, f->program->value, lf);
/macosx-10.9.5/cups-372.4/cups/scheduler/
H A Dconf.c1563 filter->cost, filter->filter);
/macosx-10.9.5/Heimdal-323.92.1/lib/hcrypto/libtommath/
H A Dtommath.tex249 without the designer's explicit forethought. This leads to lower cost of ownership for the code as it only has to
350 single precision operations are considered to have the same cost\footnote{Except where explicitly noted.}.
544 mp\_exptmod() function itself and lowered the total cost of ownership (\textit{so to speak}) and of development
2321 complete. It is possible to optimize this algorithm down to a $O(n)$ algorithm at a cost of making the algorithm slightly harder to follow.
2468 & the cost of addition. \\
2796 cost in terms of time of a multiply and addition is $p$ and the cost of a carry propagation is $q$ then a baseline multiplication would require
2896 point $y$ such that when $m < y$ the polynomial basis algorithms are more costly than Comba, when $m = y$ they are roughly the same cost and
3124 algorithm has a lower asymptotic running time of approximately $O(n^{1.464})$ but at an obvious cost in overhead. In this
3486 Let $p$ represent the cost o
[all...]
/macosx-10.9.5/CPANInternal-140/Log-Log4perl-1.40/lib/Log/Log4perl/
H A DFAQ.pm2575 messages at all cost, but also another person who wants to suppress it
2577 desires, someone will always want to win at the cost of leaving
/macosx-10.9.5/emacs-92/emacs/lisp/progmodes/
H A Dsql.el1079 "continue" "controlfile" "corruption" "cost" "cpu_per_call"
/macosx-10.9.5/Heimdal-323.92.1/lib/sqlite/
H A Dsqlite3.c5405 ** ^The estimatedCost value is an estimate of the cost of doing the
5407 ** a cost of N. A binary search of a table of N entries should have a
5408 ** cost of approximately log(N).
5433 double estimatedCost; /* Estimated cost of using this index */
103279 double cost; /* Cost of using pProbe */ local
[all...]

Completed in 458 milliseconds

123