| /external/libppp/src/ |
| ipv6cp.c | 152 /* XXX need more cases? */
513 fp->more.reqs = fp->more.naks = fp->more.rejs = ipv6cp->cfg.fsm.maxreq * 3;
580 fp->more.reqs = fp->more.naks = fp->more.rejs = ipv6cp->cfg.fsm.maxreq * 3;
|
| fsm.c | 154 fp->more.reqs = fp->more.naks = fp->more.rejs = 3;
385 if (fp->more.reqs-- > 0 && fp->restart-- > 0) {
389 if (fp->more.reqs < 0)
593 if (dec.rejend != dec.rej && --fp->more.rejs <= 0) {
600 if (dec.nakend != dec.nak && --fp->more.naks <= 0) {
|
| /external/iproute2/doc/ |
| ip-tunnels.tex | 253 \verb|ipip| and \verb|sit| tunnels have no more options. \verb|gre|
254 tunnels are more complicated:
307 Now we can discuss more subtle differences between tunneling in 2.0
328 not acknowledged by more specific tunnels.
439 and queuing not more than 10K.
464 If you want to make more detailed classification of sub-flows
467 IPIP packets more deeply.
|
| /external/blktrace/btreplay/doc/ |
| btreplay.tex | 12 % GNU General Public License for more details.
147 for more information.
151 more than 8 individual IOs. With this option, one can increase or
153 on page~\pageref{sec:c-o-M} for more information.
177 section~\ref{sec:p-o-c} on page~\pageref{sec:p-o-c} for more details about the
201 into the kernel, where you \emph{may} receive more responsive timings.}
222 could be used to both allow for a single device to masquerade as more
234 -- see section~\ref{sec:p-o-M} on page~\pageref{sec:p-o-M} for more
307 IOs processed at one time -- perhaps yielding in more realistic replay.
319 yield more accurate replay times
[all...] |
| /external/wpa_supplicant_8/src/ap/ |
| gas_serv.c | 6 * See README for more details.
1029 int more = 0; local
1084 more = 1;
1098 more, 0, buf);
1103 "(frag_id %d more=%d frag_len=%d)",
1104 dialog->sd_frag_id, more, (int) frag_len);
1108 if (more) {
1109 wpa_msg(hapd->msg_ctx, MSG_DEBUG, "GAS: %d more bytes remain "
|
| /external/ceres-solver/docs/ |
| solving.tex | 108 trust-region. For more details on the exact reasoning and computations, please see Madsen et al~\cite{madsen2004methods}.
110 \texttt{SUBSPACE\_DOGLEG} is a more sophisticated method
194 Relaxing this requirement allows the algorithm to be more
259 While it is possible to use \texttt{SPARSE\_NORMAL\_CHOLESKY} to solve bundle adjustment problems, bundle adjustment problem have a special structure, and a more efficient scheme for solving~\eqref{eq:normal} can be constructed.
263 A key characteristic of the bundle adjustment problem is that there is no term $f_{i}$ that includes two or more point blocks. This in turn implies that the matrix $H$ is of the form
330 Another option for bundle adjustment problems is to apply PCG to the reduced camera matrix $S$ instead of $H$. One reason to do this is that $S$ is a much smaller matrix than $H$, but more importantly, it can be shown that $\kappa(S)\leq \kappa(H)$. Ceres implements PCG on $S$ as the \texttt{ITERATIVE\_SCHUR} solver. When the user chooses \texttt{ITERATIVE\_SCHUR} as the linear solver, Ceres automatically switches from the exact step algorithm to an inexact step algorithm.
340 Thus, we can run PCG on $S$ with the same computational effort per iteration as PCG on $H$, while reaping the benefits of a more powerful preconditioner. In fact, we do not even need to compute $H$, \eqref{eq:schurtrick1} can be implemented using just the columns of $J$.
349 The computational cost of using a preconditioner $M$ is the cost of computing $M$ and evaluating the product $M^{-1}y$ for arbitrary vectors $y$. Thus, there are two competing factors to consider: How much of $H$'s structure is captured by $M$ so that the condition number $\kappa(HM^{-1})$ is low, and the computational cost of constructing and using $M$. The ideal preconditioner would be one for which $\kappa(M^{-1}A) =1$. $M=A$ achieves this, but it is not a practical choice, as applying this preconditioner would require solving a linear system equivalent to the unpreconditioned problem. It is usually the case that the more information $M$ has about $H$, the more expensive it is use. For example, Incomplete Cholesky factorization based preconditioners have much better convergence behavior than the Jacobi preconditioner, but are also much more expensive
[all...] |
| /external/chromium/chrome/browser/history/ |
| expire_history_backend.cc | 52 // there are no more additional visits to expire by this reader.
77 bool more = static_cast<int>(visits->size()) == max_visits; local
78 if (!more)
81 return more;
116 // we think there might be more items to expire. This timeout is used when the
305 // For now, we explicitly add all known readers. If we come up with more
351 // Note: if we ever need to broadcast changes to more than just typed URLs,
503 // Not bookmarked and no more visits. Nuke the url.
597 // If there are more items to expire, add the reader back to the queue, thus
|
| /external/linux-tools-perf/util/ |
| annotate.c | 514 int more = 0; local
548 ++more;
566 return more;
|
| /external/skia/legacy/src/animator/ |
| SkAnimatorScript2.cpp | 506 bool more = true; local
511 more = false;
520 } while (more);
|
| /external/skia/src/animator/ |
| SkAnimatorScript2.cpp | 506 bool more = true; local
511 more = false;
520 } while (more);
|
| /external/libvorbis/doc/ |
| 05-comment.tex | 18 more than a short paragraph. The essentials, in other words, whatever
152 intro page} for more information on ISRC numbers.
176 common namespace. We will generally collect the more useful tags
|
| /external/tremolo/Tremolo/ |
| vorbisfile.c | 60 /* A 'chained bitstream' is a Vorbis bitstream that contains more than
90 /* read a little more data from the file/pipe into the ogg_sync framer */
103 /* save a tiny smidge of verbosity to make the code more readable */
118 if the function is allowed to fetch more data from the stream (and
134 long more; local
137 more=ogg_sync_pageseek(vf->oy,og);
139 if(more<0){
141 vf->offset-=more;
143 if(more==0){
144 /* send more paramedics *
[all...] |
| /external/antlr/antlr-3.4/runtime/ActionScript/project/test/org/antlr/runtime/test/ |
| TestANTLRStringStream.as | 51 // now consume() one byte and run some more tests.
|
| /external/doclava/res/assets/templates/ |
| macros.cs | 15 .superBounds.N.(more links) (... super ... & ...)
16 .extendsBounds.N.(more links) (... extends ... & ...)
17 .typeArguments.N.(more links) (< ... >)
72 elif:tag.kind == "@more" ?><p><?cs
|
| /external/v8/test/mjsunit/ |
| debug-evaluate-arguments.js | 60 // Frame 1 - called with more parameters than arguments.
|
| debug-liveedit-3.js | 32 // hasen't been changed. However actually function became one level more nested
|
| debug-multiple-breakpoints.js | 51 // and that when the last break point is removed no more debug break events
|
| debug-referenced-by.js | 44 // Add some more references from simple objects and arrays.
|
| /external/v8/test/mjsunit/regress/ |
| regress-1122.js | 29 // that function calls with more arguments throw an exception. Apply a
|
| /external/webkit/LayoutTests/dom/xhtml/level3/core/ |
| nodeisequalnode13.js | 80 Element Node are not equal. Now import it once more with deep=true and using isEqual
|
| /external/webkit/Tools/DumpRenderTree/qt/ |
| fonts.conf | 121 case, a more generic font with different metrics but better appearance
|
| /ndk/sources/cxx-stl/stlport/ |
| Android.mk | 57 #It is much more practical to include the sources of GAbi++ in our builds
|
| /ndk/sources/host-tools/make-3.81/w32/subproc/ |
| build.bat | 30 rem A PARTICULAR PURPOSE. See the GNU General Public License for more details.
|
| /packages/apps/Email/src/com/android/email/activity/ |
| MessageViewFragment.java | 84 * This class has more call backs than {@link MessageViewFragmentBase}.
220 mMoreButton = UiUtilities.getViewOrNull(view, R.id.more);
424 case R.id.more: {
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.ddms/src/com/android/ide/eclipse/ddms/i18n/ |
| messages.properties | 50 DeviceView_Unable_Create_HPROF_For_Application=Unable to create HPROF file for application '%1$s'.\n\n%2$s Check logcat for more information.
|
