| /development/build/ |
| Android.mk | 72 $(hide) if [ ! -f $(PRIVATE_FRAMEWORK_RES_PACKAGE) ]; then \
|
| /external/ceres-solver/docs/ |
| helloworld.tex | 11 Let us write this problem as a non-linear least squares problem by defining the scalar residual function $f_1(x) = 10 - x$. Then $F(x) = [f_1(x)]$ is a residual vector with exactly one component.
36 The \texttt{jacobians} array is optional, \texttt{Evaluate} is expected to check when it is non-null, and if it is the case then fill it with the values of the derivative of the residual function. In this case since the residual function is linear, the Jacobian is constant.
|
| /external/chromium/chrome/browser/resources/file_manager/js/ |
| mock_chrome.js | 81 // Copy all tasks, then remove the ones that don't match.
|
| /external/chromium/chrome/browser/resources/shared/js/ |
| util.js | 111 // Handle click on a link. If the link points to a chrome: or file: url, then
|
| /external/doclava/res/assets/templates/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 ",
|
| /external/icu4c/data/mappings/ |
| ucmfiles.mk | 10 # Then, you can have your local changes remain even if you upgrade or re
32 # If you are planning to exclude EBCDIC mappings in you data then please delete
|
| /external/icu4c/test/intltest/ |
| astrotst.cpp | 152 UDate then = cal->getTime(status); local
153 CalendarAstronomer *myastro = new CalendarAstronomer(then);
|
| /external/libffi/src/mips/ |
| o32.S | 129 # assume that the only other combination must be float then double
188 stack, then calls ffi_closure_mips_inner_O32, which
189 then decodes them.
251 # four arguments, then they are stored above where we put a3.
|
| /external/libvorbis/doc/ |
| 08-residue.tex | 16 residue vectors into the bitstream packet, and then reconstructs the
143 \emph{ch}*\emph{n}. Encoding then proceeds as in type 1. Decoding is
199 5) if ( [bitflag] is set ) then [high_bits] = read five bits as unsigned integer
424 decoded. We then request normal format 1 to decode a single vector
|
| 09-helper.tex | 60 4) if ( [sign] is nonzero ) then negate [mantissa]
|
| /external/llvm/examples/Kaleidoscope/Chapter5/ |
| toy.cpp | 58 if (IdentifierStr == "then") return tok_then;
142 /// IfExprAST - Expression class for if/then/else.
144 ExprAST *Cond, *Then, *Else;
146 IfExprAST(ExprAST *cond, ExprAST *then, ExprAST *_else)
147 : Cond(cond), Then(then), Else(_else) {}
273 /// ifexpr ::= 'if' expression 'then' expression 'else' expression
282 return Error("expected then");
283 getNextToken(); // eat the then
285 ExprAST *Then = ParseExpression()
[all...] |
| /external/llvm/examples/Kaleidoscope/Chapter6/ |
| toy.cpp | 61 if (IdentifierStr == "then") return tok_then;
157 /// IfExprAST - Expression class for if/then/else.
159 ExprAST *Cond, *Then, *Else;
161 IfExprAST(ExprAST *cond, ExprAST *then, ExprAST *_else)
162 : Cond(cond), Then(then), Else(_else) {}
301 /// ifexpr ::= 'if' expression 'then' expression 'else' expression
310 return Error("expected then");
311 getNextToken(); // eat the then
313 ExprAST *Then = ParseExpression()
[all...] |
| /external/llvm/test/MC/MBlaze/ |
| mblaze_imm.s | 6 # 16-bits are then combined with the lower 16-bits in the original
|
| /external/quake/ |
| NOTICE | 135 themselves, then this License, and its terms, do not apply to those
185 access to copy from a designated place, then offering equivalent
222 License and any other pertinent obligations, then as a consequence you
225 all those who receive copies directly or indirectly through you, then
480 themselves, then this License, and its terms, do not apply to those
530 access to copy from a designated place, then offering equivalent
567 License and any other pertinent obligations, then as a consequence you
570 all those who receive copies directly or indirectly through you, then
[all...] |
| /external/smack/src/org/xbill/DNS/ |
| TSIG.java | 377 long then = tsig.getTimeSigned().getTime(); local
379 if (Math.abs(now - then) > fudge * 1000) {
|
| /external/v8/test/mjsunit/ |
| elements-transition.js | 43 // the previously patched IC, is then converted using the conversion stub.
|
| sparse-array-reverse.js | 129 assertEquals(expected_reversed2 + expected_reversed, a.join(''), 'reverse then join' + size);
|
| /external/webkit/LayoutTests/dom/html/level1/core/ |
| hc_nodechildnodesappendchild.js | 83 and then add a newly created element that was created
|
| /external/webkit/LayoutTests/dom/xhtml/level1/core/ |
| hc_nodechildnodesappendchild.js | 83 and then add a newly created element that was created
|
| /external/webkit/LayoutTests/dom/xhtml/level3/core/ |
| elementsetidattributens12.js | 80 specified attribute is unique then this element node can later be retrieved using getElementById on Document.
|
| elementsetidattributens14.js | 80 specified attribute is unique then this element node can later be retrieved using getElementById on Document.
|
| nodeisequalnode11.js | 91 and then the imported node and the source should be equal.
|
| /ndk/build/core/ |
| default-build-commands.mk | 3 # of the toolchain's specific setup.mk file which can then override
|
| /dalvik/docs/ |
| prettify.js | 26 * If there's a language not mentioned here, then I don't know it, and don't
28 * then it should work passably.
139 "retry self super then true undef unless until when yield BEGIN END ";
141 "function in local set then until ";
443 // this will return a list of all chunks which we then classify and wrap as
508 // Then look for the attribute we want.
526 * is null or matches the last non-comment token parsed, then that match is
733 // and then contains any number of raw characters,
771 /** splits plain text tokens into more specific tokens, and then tries to
[all...] |
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
| BaseTreeAdaptor.as | 71 * and child isNil then you can decide it is ok to move children to t via
109 // If new Root is token, then create a Tree.
|
