Searched
defs:in (Results
2676 -
2700 of
3847) sorted by null
<<101102103104105106107108109110>>
/prebuilts/tools/common/m2/repository/org/jacoco/org.jacoco.agent/0.7.8/ |
org.jacoco.agent-0.7.8-runtime.jar | |
/prebuilts/tools/common/m2/repository/org/jetbrains/kotlin/kotlin-compiler-runner/1.1.1/ |
kotlin-compiler-runner-1.1.1.jar | |
/prebuilts/tools/common/m2/repository/org/jetbrains/kotlin/kotlin-compiler-runner/1.1.3/ |
kotlin-compiler-runner-1.1.3.jar | |
/prebuilts/tools/common/m2/repository/org/json/json/20141113/ |
json-20141113.jar | |
/prebuilts/tools/common/m2/repository/org/shredzone/flattr4j/flattr4j-core/2.12/ |
flattr4j-core-2.12.jar | |
/tools/tradefederation/core/res/jacoco/ |
jacocoagent.jar | |
/development/samples/training/NavigationDrawer/libs/ |
android-support-v4.jar | |
/prebuilts/maven_repo/android/com/android/support/support-v4/13.0.0/ |
support-v4-13.0.0.jar | |
/prebuilts/maven_repo/android/com/android/support/support-v4/18.0.0/ |
support-v4-18.0.0.jar | |
/external/robolectric/v3/runtime/ |
android-all-4.4_r1-robolectric-1.jar | |
/prebuilts/misc/common/robolectric/lib/ |
android-all-4.4_r1-robolectric-1.jar | |
/prebuilts/tools/common/m2/repository/io/netty/netty-transport/4.1.0.CR3/ |
netty-transport-4.1.0.CR3.jar | |
/prebuilts/tools/common/m2/repository/io/netty/netty-transport/4.1.3.Final/ |
netty-transport-4.1.3.Final.jar | |
/prebuilts/tools/common/m2/repository/io/netty/netty-transport/4.1.6.Final/ |
netty-transport-4.1.6.Final.jar | |
/prebuilts/tools/common/m2/repository/org/apache/httpcomponents/httpclient/4.5.2/ |
httpclient-4.5.2.jar | |
/prebuilts/tools/common/m2/repository/net/sourceforge/htmlunit/htmlunit-core-js/2.14/ |
htmlunit-core-js-2.14.jar | |
/prebuilts/tools/common/m2/repository/net/sourceforge/saxon/saxon/9.1.0.8/ |
saxon-9.1.0.8.jar | |
/prebuilts/sdk/24/ |
android.jar | |
/external/curl/lib/ |
urldata.h | 12 * This software is licensed as described in the file COPYING, which 64 protocol handler should only ever have a single CURLPROTO_ in its protocol 77 /* Default FTP/IMAP etc response timeout in milliseconds. 153 #include <netinet/in.h> 205 /* Initial size of the buffer to store headers in, it'll be enlarged in case 228 PROT_NONE, /* first in list */ 234 PROT_LAST /* last in list */ 471 void *target_info; /* TargetInfo received in the ntlm type-2 message */ 512 that overrides the host in the URL * 1405 void *in; \/* CURLOPT_READDATA *\/ member in struct:UrlState [all...] |
/external/guice/extensions/persist/lib/ |
commons-logging-1.0.4.jar | |
/external/guice/extensions/struts2/lib/ |
commons-logging-1.0.4.jar | |
/external/guice/lib/build/ |
commons-logging-1.0.4.jar | |
/external/libvpx/libvpx/vpx_dsp/x86/ |
fwd_dct32x32_impl_avx2.h | 5 * that can be found in the LICENSE file in the root of the source 7 * in the file PATENTS. All contributing project authors may 8 * be found in the AUTHORS file in the root of the source tree. 51 // When we use them, in one case, they are all the same. In all others 97 // We process sixteen columns (transposed rows in second pass) at a time. 108 const int16_t *in = &input[column_start]; local 109 // step1[i] = (in[ 0 * stride] + in[(32 - 1) * stride]) << 2 257 int16_t *in = &intermediate[column_start]; local [all...] |
fwd_dct32x32_impl_sse2.h | 5 * that can be found in the LICENSE file in the root of the source 7 * in the file PATENTS. All contributing project authors may 8 * be found in the AUTHORS file in the root of the source tree. 19 // functions in the C implementation file. 63 // When we use them, in one case, they are all the same. In all others 110 // We process eight columns (transposed rows in second pass) at a time. 121 const int16_t *in = &input[column_start] local 246 int16_t *in = &intermediate[column_start]; local [all...] |
/external/libxml2/ |
xpath.c | 72 * Use the Timsort algorithm provided in timsort.h to sort 74 * used in xmlXPathNodeSetSort() 83 * xmlXPathOrderDocElems() was called in order to index the elements of 84 * a tree in document order; Libxslt does such an indexing, thus it will 92 * in a way, that it stop evaluation at the first node. 106 * number of step operation in the compiled expression. 1000000 is 126 * circumstances, one would first need to construct an in memory tree 147 * Returns -2 in case of error 1 if first point < second point, 0 if 165 * a couple of optimizations which will avoid computations in most cases 202 precedence1 = 3; /* element in prev-sibl axis * 9124 double le=0, in; local 9871 const xmlChar *in; local 9952 const xmlChar *in; local [all...] |
Completed in 364 milliseconds
<<101102103104105106107108109110>>