HomeSort by relevance Sort by last modified time
    Searched full:possible (Results 401 - 425 of 3897) sorted by null

<<11121314151617181920>>

  /frameworks/base/telephony/java/com/android/internal/telephony/
ITelephony.aidl 26 * Please clean them up if possible and use TelephonyManager insteadl.
202 * Report whether data connectivity is possible.
  /packages/apps/Email/src/com/android/email/mail/
Transport.java 92 * @return true if the security mode indicates that SSL is possible
97 * @return true if the security mode indicates that TLS is possible
  /packages/apps/Mms/src/org/w3c/dom/smil/
ElementTime.java 113 * Possible reasons for failure include: The element doesn't support
129 * Possible reasons for failure include: The element doesn't support
  /prebuilt/darwin-x86/sdl/include/SDL/
SDL_cdrom.h 45 /* The types of CD-ROM track possible */
49 /* The possible states which a CD-ROM drive can be in. */
SDL_mutex.h 104 of 1 ms, and so should be avoided if possible.
152 of 1 ms, and so should be avoided if possible.
  /prebuilt/linux-x86/sdl/include/SDL/
SDL_cdrom.h 45 /* The types of CD-ROM track possible */
49 /* The possible states which a CD-ROM drive can be in. */
SDL_mutex.h 104 of 1 ms, and so should be avoided if possible.
152 of 1 ms, and so should be avoided if possible.
  /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/
hashtab.h 19 /* This package implements basic hash table functionality. It is possible
53 /* Compare a table entry with a possible entry. The entry already in
  /prebuilt/windows/sdl/host/include/SDL/
SDL_cdrom.h 49 /* The types of CD-ROM track possible */
53 /* The possible states which a CD-ROM drive can be in. */
SDL_mutex.h 109 of 1 ms, and so should be avoided if possible.
156 of 1 ms, and so should be avoided if possible.
  /prebuilt/windows/sdl/include/SDL/
SDL_cdrom.h 45 /* The types of CD-ROM track possible */
49 /* The possible states which a CD-ROM drive can be in. */
SDL_mutex.h 104 of 1 ms, and so should be avoided if possible.
152 of 1 ms, and so should be avoided if possible.
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/uimodel/
UiAttributeNode.java 113 * Used to get a list of all possible values for this UI attribute.
124 * @return A list of possible completion values, and empty array or null.
  /external/icu4c/i18n/unicode/
uspoof.h 71 * which (if any) of the selected tests have identified possible problems with the identifier.
78 * whether two identifiers are possible confusable, are thread safe.
273 * @param status an in/out ICU UErrorCode. Among the possible errors is
500 * Check the specified string for possible security issues.
505 * @param text The string to be checked for possible security issues,
535 * Check the specified string for possible security issues.
540 * @param text A UTF-8 string to be checked for possible security issues.
571 * Check the specified string for possible security issues.
576 * @param text A UnicodeString to be checked for possible security issues.
721 * Using skeletons directly makes it possible to quickly chec
    [all...]
  /dalvik/dx/src/com/android/dx/rop/code/
Rop.java 64 /** {@code non-null;} list of possible types thrown by this operation */
87 * @param exceptions {@code non-null;} list of possible types thrown by this
135 * @param exceptions {@code non-null;} list of possible types thrown by this
190 * @param exceptions {@code non-null;} list of possible types thrown by this
207 * @param exceptions {@code non-null;} list of possible types thrown by this
  /external/v8/src/ia32/
jump-target-ia32.cc 185 // possible backward jump.
199 // Fast case: no forward jumps and no possible backward jumps.
210 // Fast case: no forward jumps, possible backward ones. Remove
224 // possible backward jumps. Pick up the only reaching frame, take
355 // for possible reuse as a backward merge block.
  /external/v8/src/x64/
jump-target-x64.cc 185 // possible backward jump.
199 // Fast case: no forward jumps and no possible backward jumps.
210 // Fast case: no forward jumps, possible backward ones. Remove
224 // possible backward jumps. Pick up the only reaching frame, take
355 // for possible reuse as a backward merge block.
  /frameworks/base/docs/html/guide/publishing/
preparing.jd 66 <p>It's important to test your application as extensively as possible, in as
67 many areas as possible. To help you do that, Android provides a variety of
89 device to the greatest extent possible. You can then test your application's UI
117 as possible the style used by the built-in Android applications.</p>
245 on the target mobile device (and target network, if possible). In particular,
  /hardware/ti/wlan/wl1271/stad/src/Connection_Managment/
apConnApi.h 68 * Lists the possible types of connection to AP requests
93 * Lists the possible types of roaming triggers
124 * Lists the possible types of connection status
328 * for roaming and connection with the current AP is not possible
448 * TI_NOK in case the allocation is not possible. In case of successful allocation,
  /system/wlan/ti/sta_dk_4_0_4_32/common/src/hal/FirmwareApi/
public_descriptors.h 60 2. goto 1, if not possible.
62 3. Copy the packet (preceded by TxDescriptor), if possible.
131 /* used. Possible values are: */ \
219 /* success or one of several possible reasons for */
244 interrupt sources, one for each buffer. It is possible that both interrupt
  /system/wlan/ti/wilink_6_1/stad/src/Connection_Managment/
apConnApi.h 68 * Lists the possible types of connection to AP requests
93 * Lists the possible types of roaming triggers
123 * Lists the possible types of connection status
327 * for roaming and connection with the current AP is not possible
447 * TI_NOK in case the allocation is not possible. In case of successful allocation,
  /external/proguard/docs/manual/
examples.html 22 <li><a href="#applications">All possible applications in the input jars</a>
23 <li><a href="#applets">All possible applets in the input jars</a>
24 <li><a href="#midlets">All possible midlets in the input jars</a>
25 <li><a href="#jcapplets">All possible Java Card applets in the input jars</a>
26 <li><a href="#xlets">All possible xlets in the input jars</a>
27 <li><a href="#androidapplications">All possible Android applications in the input jars</a>
28 <li><a href="#servlets">All possible servlets in the input jars</a>
320 <h3>All possible applications in the input jars</h3>
351 <h3>All possible applets in the input jars</h3>
376 <h3>All possible midlets in the input jars</h3
    [all...]
  /external/bzip2/
manual.xml 196 when possible, ownership as the corresponding original, so that
549 damaged, it may be possible to recover data from the undamaged
553 a 48-bit pattern, which makes it possible to find the block
    [all...]
  /external/dnsmasq/man/fr/
dnsmasq.8 27 Notes : Il est possible d'utiliser des options sans leur donner de paramètre.
126 possible d'en définir un autre par le biais de ce paramètre.
297 méthodes DBus. Il est possible par ce biais de mettre à jour l'adresse de
379 les serveurs ayant une adresse source spécifiée, mais il est possible de la donner
381 émises depuis une interface spécifique n'est pas possible sur toutes les plateformes
524 Il est toujours possible d'avoir plus d'une plage DHCP pour un même
555 également possible d'omettre l'adresse matérielle et d'inclure le nom d'hôte,
566 elles doivent être sur un réseau servi par le serveur DHCP. Il est possible
570 réfère à l'hôte d'identifiant 01:02:03:04. Il est également possible de
608 quel type de réseau (ARP), mais il est possible de les limiter à un seul typ
    [all...]
  /packages/apps/Contacts/src/com/android/contacts/model/
EntityModifier.java 64 // Insert possible when have valid types and under overall maximum
99 * list possible {@link EditType} options available based on
108 * list possible {@link EditType} options available based on
122 * list possible {@link EditType} options available based on
206 * the possible types.
216 * assuming the given {@link DataKind} dictates the possible types.
227 * assuming the given {@link DataKind} dictates the possible types.

Completed in 707 milliseconds

<<11121314151617181920>>