/external/eigen/doc/snippets/ |
Tridiagonalization_householderCoefficients.cpp | 5 Vector3d hc = triOfA.householderCoefficients(); variable 6 cout << "The vector of Householder coefficients is:" << endl << hc << endl;
|
HessenbergDecomposition_packedMatrix.cpp | 8 Vector3d hc = hessOfA.householderCoefficients(); variable 9 cout << "The vector of Householder coefficients is:" << endl << hc << endl;
|
/external/apache-harmony/security/src/test/api/java/org/apache/harmony/security/tests/java/security/spec/ |
ECFieldFpTest.java | 117 int hc = f.hashCode(); local 118 assertTrue(hc == f.hashCode() && 119 hc == f.hashCode() && 120 hc == f.hashCode() && 121 hc == f.hashCode() && 122 hc == f.hashCode() && 123 hc == f.hashCode() && 124 hc == f.hashCode() && 125 hc == f.hashCode());
|
ECFieldF2mTest.java | 291 int hc = f.hashCode(); local 292 assertTrue(hc == f.hashCode() && 293 hc == f.hashCode() && 294 hc == f.hashCode() && 295 hc == f.hashCode() && 296 hc == f.hashCode() && 297 hc == f.hashCode() && 298 hc == f.hashCode() && 299 hc == f.hashCode()); 310 int hc = f.hashCode() local [all...] |
ECPointTest.java | 208 int hc = f.hashCode(); local 209 assertTrue(hc == f.hashCode() && 210 hc == f.hashCode() && 211 hc == f.hashCode() && 212 hc == f.hashCode() && 213 hc == f.hashCode() && 214 hc == f.hashCode() && 215 hc == f.hashCode() && 216 hc == f.hashCode()); 220 hc = ECPoint.POINT_INFINITY.hashCode() [all...] |
EllipticCurveTest.java | 621 int hc = 0; local 625 hc = f.hashCode(); 626 assertTrue(hc == f.hashCode() && hc == f.hashCode() 627 && hc == f.hashCode() && hc == f.hashCode() 628 && hc == f.hashCode() && hc == f.hashCode() 629 && hc == f.hashCode() && hc == f.hashCode()) [all...] |
/external/chromium_org/mojo/public/c/system/tests/ |
core_unittest.cc | 153 MojoHandle hp, hc; local 161 hc = MOJO_HANDLE_INVALID; 162 EXPECT_EQ(MOJO_RESULT_OK, MojoCreateDataPipe(NULL, &hp, &hc)); 164 EXPECT_NE(hc, MOJO_HANDLE_INVALID); 166 // The consumer |hc| shouldn't be readable. 168 MojoWait(hc, MOJO_HANDLE_SIGNAL_READABLE, 0)); 173 // Try to read from |hc|. 176 MojoReadData(hc, buffer, &buffer_size, MOJO_READ_DATA_FLAG_NONE)); 178 // Try to begin a two-phase read from |hc|. 182 hc, &read_pointer, &buffer_size, MOJO_READ_DATA_FLAG_NONE)) [all...] |
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/util/ |
Arrays.java | 316 int hc = i + 1; local 320 hc *= 257; 321 hc ^= data[i]; 324 return hc; 335 int hc = i + 1; local 339 hc *= 257; 340 hc ^= data[i]; 343 return hc; 348 int hc = 0; local 352 hc = hc * 257 + hashCode(ints[i]) 366 int hc = i + 1; local 379 int hc = 0; local 391 int hc = 0; local 409 int hc = i + 1; local 428 int hc = i + 1; local [all...] |
/external/chromium_org/ui/accessibility/extensions/highcontrast/ |
highcontrast.css | 5 html[hc="a0"] { 18 html[hc="a1"] { 31 html[hc="a2"] { 44 html[hc="a3"] { 57 html[hc="a4"] { 70 html[hc="a5"] {
|
highcontrast.js | 40 if (html.getAttribute('hc') != mode + scheme) 41 html.setAttribute('hc', mode + scheme); 59 html.setAttribute('hc', mode + '0'); 62 html.removeAttribute('hc'); 109 html.removeAttribute('hc');
|
popup.js | 41 'hc', 44 document.documentElement.setAttribute('hc', 'a0');
|
/external/apache-http/src/org/apache/http/conn/routing/ |
RouteTracker.java | 378 int hc = this.targetHost.hashCode(); local 381 hc ^= localAddress.hashCode(); 383 hc ^= proxyChain.length; 385 hc ^= proxyChain[i].hashCode(); 389 hc ^= 0x11111111; 391 hc ^= 0x22222222; 393 hc ^= this.tunnelled.hashCode(); 394 hc ^= this.layered.hashCode(); 396 return hc;
|
HttpRoute.java | 387 int hc = this.targetHost.hashCode(); local 390 hc ^= localAddress.hashCode(); 392 hc ^= proxyChain.length; 393 for (HttpHost aProxyChain : proxyChain) hc ^= aProxyChain.hashCode(); 397 hc ^= 0x11111111; 399 hc ^= this.tunnelled.hashCode(); 400 hc ^= this.layered.hashCode(); 402 return hc;
|
/external/libcxx/src/ |
debug.cpp | 123 size_t hc = hash<const void*>()(__c) % static_cast<size_t>(__cend_ - __cbeg_); 124 __c_node* c = __cbeg_[hc]; 168 size_t hc = hash<void*>()(__c) % static_cast<size_t>(__cend_ - __cbeg_); local 169 __c_node* p = __cbeg_[hc]; 170 __c_node* r = __cbeg_[hc] = 172 if (__cbeg_[hc] == nullptr) 221 size_t hc = hash<void*>()(__c) % static_cast<size_t>(__cend_ - __cbeg_); local 222 __c_node* p = __cbeg_[hc]; 248 size_t hc = hash<void*>()(__c) % static_cast<size_t>(__cend_ - __cbeg_); local 249 __c_node* p = __cbeg_[hc]; 270 size_t hc = hash<void*>()(__c) % static_cast<size_t>(__cend_ - __cbeg_); local 293 size_t hc = hash<void*>()(__c) % static_cast<size_t>(__cend_ - __cbeg_); local 395 size_t hc = hash<void*>()(c1) % static_cast<size_t>(__cend_ - __cbeg_); local [all...] |
/external/eigen/test/ |
householder.cpp | 87 HCoeffsVectorType hc = qr.hCoeffs().conjugate(); local 88 HouseholderSequence<MatrixType, HCoeffsVectorType> hseq(m2, hc); 89 hseq.setLength(hc.size()).setShift(shift); 90 VERIFY(hseq.length() == hc.size()); 119 HouseholderSequence<TMatrixType, HCoeffsVectorType, OnTheRight> rhseq(tm2, hc); 120 rhseq.setLength(hc.size()).setShift(shift);
|
/external/mockito/cglib-and-asm/src/org/mockito/asm/ |
Type.java | 777 int hc = 13 * sort;
local 780 hc = 17 * (hc + buf[i]);
783 return hc;
|
/external/mockito/cglib-and-asm/src/org/mockito/cglib/core/ |
KeyFactory.java | 204 int hc = (constant != 0) ? constant : PRIMES[(int)(Math.abs(seed) % PRIMES.length)]; local 206 e.push(hc);
|
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
Antlr.Runtime.Tools.pas | 601 start, hc: Integer; 610 hc := FItems[Result].HashCode; 613 if hc = 0 then 617 if (hc = HashCode) and FComparer.Equals(FItems[Result].Key, Key) then 747 index, hc: Integer; 752 hc := Hash(Key); 753 index := GetBucketIndex(Key, hc); 757 DoAdd(hc, not index, Key, Value); 769 gap, index, hc, bucket: Integer; 772 hc := Hash(Key) [all...] |
/external/chromium_org/third_party/icu/source/i18n/ |
smpdtfmt.cpp | 1289 HebrewCalendar *hc = (HebrewCalendar*)&cal; local 2631 HebrewCalendar *hc = (HebrewCalendar*)&cal; local 2679 HebrewCalendar *hc = (HebrewCalendar*)&cal; local 3065 HebrewCalendar *hc = (HebrewCalendar*)&cal; local [all...] |
/external/icu/icu4c/source/i18n/ |
smpdtfmt.cpp | 1316 HebrewCalendar *hc = (HebrewCalendar*)&cal; local 2658 HebrewCalendar *hc = (HebrewCalendar*)&cal; local 2706 HebrewCalendar *hc = (HebrewCalendar*)&cal; local 3112 HebrewCalendar *hc = (HebrewCalendar*)&cal; local [all...] |
/external/chromium_org/net/third_party/nss/ssl/ |
sslcon.c | 1739 int hc; local [all...] |
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
ECPoint.java | 340 int hc = (null == c) ? 0 : ~c.hashCode(); local 348 hc ^= p.getXCoord().hashCode() * 17; 349 hc ^= p.getYCoord().hashCode() * 257; 352 return hc; [all...] |
/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 ", 6 Cc="</span>",Dc='<span class="',Ec='">',Fc="$1 ",Gc=" <br />",Hc="<br />",Ic="console",Jc="cannot override language handler %s",Kc="default-markup",Lc="default-code",Mc="dec",Z="lang-js",$="lang-css",Nc="lang-in.tag",Oc="htm",Pc="html",Qc="mxml",Rc="xhtml",Sc="xml",Tc="xsl",Uc=" \t\r\n",Vc="atv",Wc="tag",Xc="atn",Yc="lang-uq.val",Zc="in.tag",$c="uq.val",ad="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 ", 18 m);w.push(dc+v(m)+ec)}return new RegExp(w.join(O),d?fc:R)}var ha=r;function Td(a){if(r===ha){var b=document.createElement(gc);b.appendChild(document.createTextNode(hc));ha=!/</.test(b.innerHTML)}if(ha){var c=a.innerHTML;if(Ma(a))c=ga(c);return c}for(var d=[],g=a.firstChild;g;g=g.nextSibling)W(g,d);return d.join(P)}function Ud(a){var b=0;return function(c){for(var d=r,g=0,i=0,m=c.length;i<m;++i){var l=c.charAt(i);switch(l){case ic:d||(d=[]);d.push(c.substring(g,i));var n=a-b%a;for(b+=n;n>=0;n-=" ".length)d.push(" ".substring(0, 25 g=[],i=0,m=r,l=r,n=0,q=0,v=Ud(window.PR_TAB_WIDTH),w=/([\r\n ]) /g,j=/(^| ) /gm,f=/\r\n?|\n/g,s=/[ \r\n]$/,k=o;function h(p){if(p>i){if(m&&m!==l){g.push(Cc);m=r}if(!m&&l){m=l;g.push(Dc,m,Ec)}var t=ga(v(b.substring(i,p))).replace(k?j:w,Fc);k=s.test(t);var u=window._pr_isIE6()?Gc:Hc;g.push(t.replace(f,u));i=p}}for(;1;){var e;if(e=n<c.length?q<d.length?c[n]<=d[q]:o:z){h(c[n]);if(m){g.push(Cc);m=r}g.push(c[n+1]);n+=2}else if(q<d.length){h(d[q]);l=d[q+1];q+=2}else break}h(b.length);m&&g.push(Cc);a.a=g.join(P)}
|
/external/chromium_org/third_party/libvpx/source/libvpx/build/make/ |
Makefile | 102 rm -f vpx_config.[hc] vpx_config.asm; \
|
/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 ", 6 Cc="</span>",Dc='<span class="',Ec='">',Fc="$1 ",Gc=" <br />",Hc="<br />",Ic="console",Jc="cannot override language handler %s",Kc="default-markup",Lc="default-code",Mc="dec",Z="lang-js",$="lang-css",Nc="lang-in.tag",Oc="htm",Pc="html",Qc="mxml",Rc="xhtml",Sc="xml",Tc="xsl",Uc=" \t\r\n",Vc="atv",Wc="tag",Xc="atn",Yc="lang-uq.val",Zc="in.tag",$c="uq.val",ad="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 ", 18 m);w.push(dc+v(m)+ec)}return new RegExp(w.join(O),d?fc:R)}var ha=r;function Td(a){if(r===ha){var b=document.createElement(gc);b.appendChild(document.createTextNode(hc));ha=!/</.test(b.innerHTML)}if(ha){var c=a.innerHTML;if(Ma(a))c=ga(c);return c}for(var d=[],g=a.firstChild;g;g=g.nextSibling)W(g,d);return d.join(P)}function Ud(a){var b=0;return function(c){for(var d=r,g=0,i=0,m=c.length;i<m;++i){var l=c.charAt(i);switch(l){case ic:d||(d=[]);d.push(c.substring(g,i));var n=a-b%a;for(b+=n;n>=0;n-=" ".length)d.push(" ".substring(0, 25 g=[],i=0,m=r,l=r,n=0,q=0,v=Ud(window.PR_TAB_WIDTH),w=/([\r\n ]) /g,j=/(^| ) /gm,f=/\r\n?|\n/g,s=/[ \r\n]$/,k=o;function h(p){if(p>i){if(m&&m!==l){g.push(Cc);m=r}if(!m&&l){m=l;g.push(Dc,m,Ec)}var t=ga(v(b.substring(i,p))).replace(k?j:w,Fc);k=s.test(t);var u=window._pr_isIE6()?Gc:Hc;g.push(t.replace(f,u));i=p}}for(;1;){var e;if(e=n<c.length?q<d.length?c[n]<=d[q]:o:z){h(c[n]);if(m){g.push(Cc);m=r}g.push(c[n+1]);n+=2}else if(q<d.length){h(d[q]);l=d[q+1];q+=2}else break}h(b.length);m&&g.push(Cc);a.a=g.join(P)}
|