Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched refs:then (Results 226 - 250 of 438) sorted by null

1 2 3 4 5 6 7 8 91011>>

/external/webkit/LayoutTests/dom/xhtml/level3/core/
elementsetidattributens11.js	80 specified attribute is unique then this element node can later be retrieved using getElementById on Document.
textreplacewholetext08.js	79 text node, then calls Text.replaceWholeText on the existing text node.
/external/webkit/LayoutTests/fast/url/script-tests/
host.js	27 // then converted or rejected.
/frameworks/native/libs/utils/
Android.mk	139 # If we're building with ONE_SHOT_MAKEFILE (mm, mmm), then what the framework
/ndk/build/core/
setup-app.mk	57 # If APP_ABI is 'all', then set it to all supported ABIs
definitions-utils.mk	77 # and it this returns a non-empty value, then <name> 101 # and it this returns an empty value, then <name>
setup-toolchain.mk	65 # So it TARGET_TOOLCHAIN is 'foo-bar-zoo-xxx', then 117 # to do that, we split at dashes, remove the last element, then merge the
build-binary.mk	16 # Check that LOCAL_MODULE is defined, then restore its LOCAL_XXXX values 257 # If we're using the 'system' STL and use rtti or exceptions, then 286 # If LOCAL_LDLIBS contains anything like -l<library> then 296 # command line to a file, then use the @<listfile> syntax to invoke it. 333 # then libA.a and libB.a can be built in parallel, only linking libfoo.so
/prebuilts/devtools/tools/lib/
sdkstats.jar
/sdk/emulator/opengl/
Android.mk	41 # module A, then it must be included after module A below.
/external/ceres-solver/docs/
solving.tex	166 and then use it as the starting point to further optimize just $a_1$ 223 Let $H(x)= J(x)^\top J(x)$ and $g(x) = -J(x)^\top f(x)$. For notational convenience let us also drop the dependence on $x$. Then it is easy to see that solving~\eqref{eq:simple2} is equivalent to solving the {\em normal equations} 231 For small problems (a couple of hundred parameters and a few thousand residuals) with relatively dense Jacobians, \texttt{DENSE\_QR} is the method of choice~\cite{bjorck1996numerical}. Let $J = QR$ be the QR-decomposition of $J$, where $Q$ is an orthonormal matrix and $R$ is an upper triangular matrix~\cite{trefethen1997numerical}. Then it can be shown that the solution to~\eqref{eq:normal} is given by 238 Large non-linear least square problems are usually sparse. In such cases, using a dense QR factorization is inefficient. Let $H = R^\top R$ be the Cholesky factorization of the normal equations, where $R$ is an upper triangular matrix, then the solution to ~\eqref{eq:normal} is given by 298 Now, \eqref{eq:linear2}~can be solved by first forming $S$, solving for $\Delta y$, and then back-substituting $\Delta y$ to obtain the value of $\Delta z$. 342 Equation~\eqref{eq:schurtrick1} is closely related to {\em Domain Decomposition methods} for solving large linear systems that arise in structural engineering and partial differential equations. In the language of Domain Decomposition, each point in a bundle adjustment problem is a domain, and the cameras form the interface between these domains. The iterative solution of the Schur complement then falls within the sub-category of techniques known as Iterative Sub-structuring~\cite{saad2003iterative,mathew2008domain}. 384 lowest numbered elimination group are eliminated first, and then the 395 from the two equations, solving for y and then back substituting 424 If the user leaves the choice to Ceres, then the solver uses an     [all...]
powell.tex	62 and \texttt{F4}. Then let us consider the construction and solution of the problem. For brevity we only describe the relevant bits of code~\footnote{The full source code for this example can be found in \texttt{examples/powell.cc}.} 103 If a templated implementation is not possible then a \texttt{NumericDiffCostFunction} object can be used. The user defines a \texttt{CostFunction} object whose \texttt{Evaluate} method is only computes the residuals. A wrapper object \texttt{NumericDiffCostFunction} then uses it to compute the residuals and the Jacobian using finite differencing. \texttt{examples/quadratic\_numeric\_diff.cc} shows a numerically differentiated implementation of \texttt{examples/quadratic.cc}.
/bionic/libc/arch-mips/string/
memset.S	187 # There will be at most 1 32-byte chunk then
/dalvik/vm/arch/arm/
CallEABI.S	200 sub sp, sp, ip, lsr #21 @ shift right 24, then left 3 246 * arg is 64-bit, then r3 "holds" a pad word and the load is unnecessary 294 * required to contain it. Then walk through it a second time, copying
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/
BaseRecognizer.as	59 * plain mismatch(), which does not recover. Then any error 107 // then we know we're missing a token; error recovery is free to 184 * would have to subclassing exception, but then somehow get ANTLR 496 * the viable next token set, then you know there is most likely 532 * however, then assume LA(1) is some extra spurious token. Delete it 539 * ttype then it is ok to "insert" the missing token, else throw 560 // if next token is what we are looking for then "delete" this token 714 * start index before, then return where the rule stopped parsing. 738 * this rule and successfully parsed before, then seek ahead to
/external/libvpx/libvpx/examples/includes/geshi/geshi/
ruby.php	52 'retry', 'super', 'then', 'undef', 'unless',
/external/libvpx/libvpx/vp8/encoder/ppc/
fdct_altivec.asm	56 ;# For fwd transform, indices are horizontal positions, then frequencies. 57 ;# For inverse transform, frequencies then positions.
/external/libvpx/libvpx/vpx_ports/
x86_abi_support.asm	16 ; In general, we make the source use 64 bit syntax, then twiddle with it using 307 ; Win64 ABI requires 16 byte stack alignment, but then pushes an 8 byte return
/external/linux-tools-perf/config/
utilities.mak	117 # If the text to be wordified contains a newline, then 123 # If the text does not contain a newline, then this function
/external/v8/test/mjsunit/
array-concat.js	56 // If we put a number in the prototype, then the spec says it should be 126 // If we put a number in the prototype, then the spec says it should be
/packages/apps/Mms/src/com/android/mms/ui/
MessageUtils.java	445 Time then = new Time(); local 446 then.set(when); 456 if (then.year != now.year) { 458 } else if (then.yearDay != now.yearDay) {     [all...]
/external/iproute2/doc/
ip-cref.tex	381 Then we see the interface {\em mtu\/} (``maximal transfer unit''). This determines 742 Then the list of IP and IPv6 addresses follows, accompanied by     [all...]
/external/tremolo/Tremolo/
mdctARM.s	69 TEQ r14,r14,ASR #31 @ if r14==0 || r14==-1 then in range 74 TEQ r14,r14,ASR #31 @ if r14==0 || r14==-1 then in range 79 TEQ r14,r14,ASR #31 @ if r14==0 || r14==-1 then in range 84 TEQ r14,r14,ASR #31 @ if r14==0 || r14==-1 then in range 100 TEQ r14,r14,ASR #31 @ if r14==0 || r14==-1 then in range 137 TEQ r14,r14,ASR #31 @ if r14==0 || r14==-1 then in range 142 TEQ r14,r14,ASR #31 @ if r14==0 || r14==-1 then in range 147 TEQ r14,r14,ASR #31 @ if r14==0 || r14==-1 then in range 152 TEQ r14,r14,ASR #31 @ if r14==0 || r14==-1 then in range 169 TEQ r14,r14,ASR #31 @ if r14==0 || r14==-1 then in rang     [all...]
/build/core/
config.mk	127 # be used, and if that doesn't work, then the default is an 181 # The build system then combines all the values specified by all the 183 # tree and then exports a TARGET_PRODUCT_KERNEL_HEADERS variable. 214 # then add product-inherited includes, to allow for
/build/tools/droiddoc/templates-pdk/assets/
prettify.js	5 dc="(?:",ec=")",fc="gi",gc="PRE",hc='<!DOCTYPE foo PUBLIC "foo bar">\n<foo />',ic="\t",jc="\n",kc="[^<]+|<!--[\\s\\S]*?--\>|<!\\[CDATA\\[[\\s\\S]*?\\]\\]>|</?[a-zA-Z][^>]*>|<",lc="nocode",mc=' $1="$2$3$4"',S="pln",nc="string",T="lang-",oc="src",U="str",pc="'\"",qc="'\"`",rc="\"'",V="com",sc="lang-regex",tc="(/(?=[^/*])(?:[^/\\x5B\\x5C]|\\x5C[\\s\\S]|\\x5B(?:[^\\x5C\\x5D]|\\x5C[\\s\\S])*(?:\\x5D|$))+/)",uc="kwd",vc="^(?:",wc=")\\b",xc=" \r\n\t\u00a0",yc="lit",zc="typ",Ac="0123456789",Y="pun",Bc="break continue do else for if return while auto case char const default double enum extern float goto int long register short signed sizeof static struct switch typedef union unsigned void volatile catch class delete false import new operator private protected public this throw true try alignof align_union asm axiom bool concept concept_map const_cast constexpr decltype dynamic_cast explicit export friend inline late_check mutable namespace nullptr reinterpret_cast static_assert static_cast template typeid typename typeof using virtual wchar_t where break continue do else for if return while auto case char const default double enum extern float goto int long register short signed sizeof static struct switch typedef union unsigned void volatile catch class delete false import new operator private protected public this throw true try boolean byte extends final finally implements import instanceof null native package strictfp super synchronized throws transient as base by checked decimal delegate descending event fixed foreach from group implicit in interface internal into is lock object out override orderby params partial readonly ref sbyte sealed stackalloc string select uint ulong unchecked unsafe ushort var break continue do else for if return while auto case char const default double enum extern float goto int long register short signed sizeof static struct switch typedef union unsigned void volatile catch class delete false import new operator private protected public this throw true try debugger eval export function get null set undefined var with Infinity NaN caller delete die do dump elsif eval exit foreach for goto if import last local my next no our print package redo require sub undef unless until use wantarray while BEGIN END break continue do else for if return while and as assert class def del elif except exec finally from global import in is lambda nonlocal not or pass print raise try with yield False True None break continue do else for if return while alias and begin case class def defined elsif end ensure false in module next nil not or redo rescue retry self super then true undef unless until when yield BEGIN END break continue do else for if return while case done elif esac eval fi function in local set then until ", 8 kd="cs",ld="break continue do else for if return while auto case char const default double enum extern float goto int long register short signed sizeof static struct switch typedef union unsigned void volatile catch class delete false import new operator private protected public this throw true try boolean byte extends final finally implements import instanceof null native package strictfp super synchronized throws transient ",md="java",nd="break continue do else for if return while case done elif esac eval fi function in local set then until ", 9 od="bsh",pd="csh",qd="sh",rd="break continue do else for if return while and as assert class def del elif except exec finally from global import in is lambda nonlocal not or pass print raise try with yield False True None ",sd="cv",td="py",ud="caller delete die do dump elsif eval exit foreach for goto if import last local my next no our print package redo require sub undef unless until use wantarray while BEGIN END ",vd="perl",wd="pl",xd="pm",yd="break continue do else for if return while alias and begin case class def defined elsif end ensure false in module next nil not or redo rescue retry self super then true undef unless until when yield BEGIN END ",

Completed in 968 milliseconds

1 2 3 4 5 6 7 8 91011>>