| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| token.rb | 225 general utility. Thus code generated for a standard combo lexer-parser grammar
396 the problem of referencing type values by name. Thus, a token type like
415 TokenScheme is a subclass of Module. Thus, it has the method
489 Token. Thus, when recognizers need to manufacture tokens, instead of using the
|
| streams.rb | 115 un-Ruby-like. Thus, I chose <tt>peek</tt> and <tt>look</tt> to represent a
152 wasteful to have a module like this hanging out. Thus, I may axe it.
160 Stream and assume that the object implements the proper stream interface. Thus,
227 methods specific to navigating character-based input data. Thus, it serves as an
241 up (not 0). Column numbers are indexed from 0 up. Thus, examining sample text:
273 specific to navigating token sequences. Thus, it serves as an imitation of the
348 The stream's symbols of interest, of course, are character values. Thus, the
357 does not have strong built-in support for multi-byte character encodings. Thus,
[all...] |
| error.rb | 393 symbols. Thus, NoViableAlternative errors indicate that the current input does
|
| /external/bison/ |
| cfg.mk | 30 # don't want to wait on a recompile because of an update to $(VERSION). Thus,
|
| /external/v8/test/mjsunit/harmony/ |
| block-let-declaration.js | 55 // Invalid declarations are early errors in harmony mode and thus should trigger
57 // the code. Thus the generated function is not called here.
|
| /external/webkit/LayoutTests/fast/dom/DOMImplementation/script-tests/ |
| createDocument-namespace-err.js | 6 // Thus we copied these test cases from:
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/ |
| antlr3.rb | 46 some are simply extra utilities for use by anyone working with ANTLR code. Thus,
55 contains the base classes for ANTLR-generated recognizers, and thus, is one of
130 # under normal usage conditions and thus an ANTLR3::Bug error will be
167 # Thus, they're not essential for everything ANTLR generates and
|
| /external/libvorbis/doc/ |
| 08-residue.tex | 62 VQ codebook. Thus, each residue value potentially accumulates values
64 a partition is the same in each pass, thus the classification codeword
245 format 1 decode process. Thus we describe first the decode
|
| 02-bitpacking.tex | 60 manipulation at the byte, not word, level, thus host word ordering is
219 the coding process. Thus, should this unused space be read, it will
|
| 05-comment.tex | 167 the field name so that the field name is bounded in a known way. Thus
|
| 01-introduction.tex | 17 maximum encoder flexibility, thus allowing it to scale competitively
64 Vorbis packets are thus intended to be used with a transport mechanism
101 Thus, Vorbis headers are both required for decode to begin and
107 required header is in mindshare; it is an unusual design and thus
193 and a bass-only representation to the bass channel, thus saving space.
225 component list. Entropy coding is thus provided as an abstraction,
468 represent $-140$dB to $+0$dB. Thus, in order to handle full range
470 spec. A 280dB range is approximately 48 bits with sign; thus the
|
| 04-codec.tex | 556 represent $-140$dB to $+0$dB. Thus, in order to handle full range
558 spec. A 280dB range is approximately 48 bits with sign; thus the
|
| /external/ceres-solver/docs/ |
| solving.tex | 288 Thus, calculating the inverse of $C$ by inverting each of these blocks is cheap. This allows us to eliminate $\Delta z$ by observing that $\Delta z = C^{-1}(w - E^\top \Delta y)$, giving us
299 Thus, the solution of what was an $n\times n$, $n=pc+qs$ linear system is reduced to the inversion of the block diagonal matrix $C$, a few matrix-matrix and matrix-vector multiplies, and the solution of block sparse $pc\times pc$ linear system~\eqref{eq:schur}. For almost all problems, the number of cameras is much smaller than the number of points, $p \ll q$, thus solving~\eqref{eq:schur} is significantly cheaper than solving~\eqref{eq:linear2}. This is the {\em Schur complement trick}~\cite{brown-58}.
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.
405 Thus, to have Ceres determine the ordering automatically using
[all...] |
| modeling.tex | 302 point is not useful. Thus a better way to parameterize a point on
315 definition of vector addition. Thus it satisfies the identity
|
| /external/chromium/chrome/common/extensions/docs/examples/extensions/benchmark/jst/ |
| jsevalcontext.js | 45 * the code and thus move them to constants.js.
122 * the current context. Thus we assign the original value to $this,
|
| jstemplate.js | 145 * suvives cloneNode() and thus cloned template nodes can share the
163 * attribute values is expensive and we thus want to cache it. The
613 // arrays, seen in Firefox. Thus we recognize an array as an object
[all...] |
| /external/chromium/chrome/common/extensions/docs/examples/extensions/irc/servlet/jstemplate/ |
| jsevalcontext.js | 45 * the code and thus move them to constants.js.
122 * the current context. Thus we assign the original value to $this,
|
| jstemplate.js | 145 * suvives cloneNode() and thus cloned template nodes can share the
163 * attribute values is expensive and we thus want to cache it. The
613 // arrays, seen in Firefox. Thus we recognize an array as an object
[all...] |
| /external/blktrace/btreplay/doc/ |
| btreplay.tex | 72 thus, to save system resources (including storage for traces), one could
79 utility (thus saving all traces over the complete workload).
117 maintains its own concept of time, and thus there may be slippage of the
138 code, and thus are submitted to the block IO layer with \emph{very small}
191 and thus ensure IO ordering across devices, with some reduction in
309 in additional real replay time, thus yielding less accurate replay times.
363 identifier. Thus: \texttt{sdab:0:} means the device \texttt{sdab} and
517 it. Thus, an input file of the name \texttt{sdab.replay.3} would generate a
|
| /external/v8/tools/ |
| profile.js | 372 // need an explicit root in it. Thus, replace the counters tree
|
| /external/zlib/src/contrib/masmx64/ |
| gvmat64.asm | 127 ;;; assumption that the compiler will dword-align the fields. (Thus,
|
| /external/zlib/src/contrib/masmx86/ |
| match686.asm | 142 ;;; assumption that the compiler will dword-align the fields. (Thus,
|
| /external/openssl/crypto/bn/asm/ |
| pa-risc2.s | 6 ; function calls. Thus the 64-bit return values are returned
160 ; PA-RISC 2.0 chips have two fully pipelined multipliers, thus
321 ; See if only 1 word to do, thus just do cleanup
329 ; PA-RISC 2.0 chips have two fully pipelined multipliers, thus
[all...] |
| /external/v8/benchmarks/ |
| deltablue.js | 687 * the given mark. Thus, encountering a marked node downstream of
|
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v4/ |
| v8-deltablue.js | 681 * the given mark. Thus, encountering a marked node downstream of
|
