/libcore/luni/src/test/java/tests/api/java/lang/reflect/ |
BoundedGenericMethodsTests.java | 63 Type bound = bounds[0]; local 64 assertEquals(BoundedGenericMethods.class, bound); 100 Type bound = bounds[0]; local 102 assertEquals(BoundedGenericMethods.class, bound);
|
/packages/apps/Email/docs/ |
TODO | 23 specific to performance to be bound to the Store API. It needs to be flexible with plenty of helper
|
/external/svox/pico/lib/ |
picosa.h | 99 -> BOUND(BOUNDstrength,BOUNDtype) 105 4. PROCESS_ACC: then, after processing the WORDPHON and BOUND items 138 BOUND in item sequence equals PHR0 bound strength) 150 <output> = { BOUND(BOUND_SBEG,PHRASEtype) <sentence> BOUND(BOUND_SEND,..)} BOUND(BOUND_TERM,..) 153 <sentence> = <phrase> { BOUND(BOUND_PHR1|2|3,BOUNDtype) <phrase> }
|
picospho.c | 110 * - existing BOUND items 112 * - bound upgrades/downgrades from transduction 113 * - bound upgrades/downgrades/insertions from SIL command items (originating e.g. from <break> text commands) 114 * all relevant bounds are placed in the corresponding headx extention; original bound items become invalid. 116 * this is the second round of alignment, treating non-BOUND items 119 * - BOUND items are consumed with no effect 211 picoos_int16 lastPhraseBoundPos; /* position of the last bound encountered (<0 if inexistent or not reachable */ 542 Items considered in a transduction are a BOUND or a WORDPHON item. its starting offset within the 559 PICODBG_TRACE(("found bound of type %c\n",head->info1)); 560 /* BOUND(<bound strength><phrase type>) * [all...] |
/frameworks/base/media/libstagefright/rtsp/ |
ARTPConnection.h | 48 // Creates a pair of UDP datagram sockets bound to adjacent ports 49 // (the rtpSocket is bound to an even port, the rtcpSocket to the
|
/frameworks/base/services/java/com/android/server/am/ |
AppBindRecord.java | 28 final IntentBindRecord intent; // The intent we are bound to. 29 final ProcessRecord client; // Who has started/bound the service.
|
IntentBindRecord.java | 27 * A particular Intent that has been bound to a Service. 32 /** The intent that is bound.*/ 34 /** All apps that have bound to this Intent. */
|
/libcore/luni/src/main/java/javax/net/ssl/ |
SSLSessionBindingEvent.java | 24 * object is bound ({@link SSLSession#putValue(String, Object)}) or unbound 38 * the name of the object being (un)bound.
|
SSLSession.java | 164 * Returns the object bound to the specified name in this session's 168 * the name of the bound value. 169 * @return the value bound to the specified name, or {@code null} if the 178 * Returns the list of the object names bound to this session's application 184 * @return the list of the object names bound to this session's application
|
/libcore/luni/src/main/java/java/net/ |
ServerSocket.java | 43 * Constructs a new {@code ServerSocket} instance which is not bound to any 64 * Constructs a new {@code ServerSocket} instance bound to the nominated 78 * Constructs a new {@code ServerSocket} instance bound to the nominated 96 * Constructs a new {@code ServerSocket} instance bound to the nominated 145 throw new SocketException("Socket is not bound"); 341 * {@code null} the socket will be bound to an available local address on 349 * if the socket is already bound or a problem occurs during 358 * {@code localAddr} is set to {@code null} the socket will be bound to an 366 * @throws IOException if the socket is already bound or a problem occurs 372 throw new BindException("Socket is already bound"); [all...] |
/external/apache-http/src/org/apache/http/message/ |
ParserCursor.java | 54 throw new IndexOutOfBoundsException("Lower bound cannot be negative"); 57 throw new IndexOutOfBoundsException("Lower bound cannot be greater then upper bound");
|
/cts/tools/signature-tools/src/signature/model/util/ |
ITypeFactory.java | 88 * are equal if they have the same lower bound and have the same upper 95 * the lower bound
|
/dalvik/docs/opcodes/ |
opcode-1d-monitor-enter.html | 86 (implementation-dependent) upper bound for recursive monitor entries. Note 87 that it is unlikely this bound is ever hit, since for most implementations
|
/dalvik/vm/compiler/ |
Dataflow.h | 116 int maxC; // For DIV - will affect upper bound checking 117 int minC; // For DIV - will affect lower bound checking
|
/external/chromium/third_party/icu/source/test/cintltst/ |
citertst.h | 96 * Bound checkings. 101 * Bound checkings.
|
/external/guava/src/com/google/common/collect/ |
ClassToInstanceMap.java | 46 * bound to this specific class, not a value that may have been bound to a
|
/external/icu4c/test/cintltst/ |
citertst.h | 96 * Bound checkings. 101 * Bound checkings.
|
/external/tcpdump/ |
ah.h | 45 /* variable size, 32bit bound*/ /* Authentication data */ 54 /* variable size, 32bit bound*/ /* Authentication data */
|
/frameworks/base/core/java/android/net/ |
LocalServerSocket.java | 59 * been created and bound. listen() will be called immediately on it. 63 * @param fd bound file descriptor
|
/frameworks/base/media/libstagefright/codecs/aacenc/inc/ |
bitbuffer.h | 40 buffer. The two pointers are used as lower-bound respectively upper-bound address for the modulo addressing
|
/external/openssl/crypto/asn1/ |
asn_mime.c | 103 static int mime_bound_check(char *line, int linelen, char *bound, int blen); 104 static int multi_split(BIO *bio, char *bound, STACK_OF(BIO) **ret); 283 char bound[33], c; local 299 RAND_pseudo_bytes((unsigned char *)bound, 32); 301 c = bound[i] & 0xf; 304 bound[i] = c; 306 bound[32] = 0; 313 bound, mime_eol, mime_eol); 317 BIO_printf(bio, "------%s%s", bound, mime_eol); 320 BIO_printf(bio, "%s------%s%s", mime_eol, bound, mime_eol) [all...] |
/cts/tools/signature-tools/src/signature/model/ |
ITypeVariableDefinition.java | 29 * java.lang.Object is returned as upper bound.
|
/dalvik/tests/003-omnibus-opcodes/src/ |
Array.java | 79 i = ints[5]; // exact bound 85 ints[5] = i; // exact bound 134 l = longs[5]; // exact bound 140 longs[5] = l; // exact bound
|
/external/chromium/net/base/ |
load_log.cc | 30 // Enforce a bound of |max_num_entries_| -- once we reach it, keep overwriting
|
winsock_init.cc | 28 // call may be incorrect, so make sure the function is bound and future
|