/dalvik/libcore/security/src/main/java/java/security/spec/ |
DSAPublicKeySpec.java | 36 * Creates a new {@code DSAPublicKeySpec} with the specified public key, 40 * the public key value {@code y}. 42 * the prime {@code p}. 44 * the sub-prime {@code q}. 46 * the base {@code g}. 57 * Returns the base {@code g}. 59 * @return the base {@code g}. 66 * Returns the prime {@code p}. 68 * @return the prime {@code p}. 75 * Returns the sub-prime {@code q} [all...] |
/dalvik/libcore/security/src/test/java/tests/security/cert/ |
PKIXCertPathValidatorResultTest.java | 42 * Tests for <code>PKIXCertPathValidatorResult</code> 68 * Test #1 for <code>PKIXCertPathValidatorResult(TrustAnchor, 69 * PolicyNode, PublicKey)</code> constructor<br> 71 * <code>PKIXCertPathValidatorResult</code> 96 * Test #2 for <code>PKIXCertPathValidatorResult(TrustAnchor, 97 * PolicyNode, PublicKey)</code> constructor<br> 98 * Assertion: <code>NullPointerException</code> i [all...] |
/external/guava/src/com/google/common/base/ |
Predicate.java | 25 * {@code RegexPredicate} might implement {@code Predicate<String>}, and return 26 * {@code true} for any string that matches its given regular expression. 46 * @return the value of this predicate when applied to the input {@code t} 51 * Indicates whether some other object is equal to this {@code Predicate}. 52 * This method can return {@code true} <i>only</i> if the specified object is 53 * also a {@code Predicate} and, for every input object {@code input}, it 54 * returns exactly the same value. Thus, {@code predicate1.equals(predicate2)} 55 * implies that either {@code predicate1.apply(input)} an [all...] |
/external/opencore/doc/oscl_html/ |
oscl__socket__imp__base_8h.html | 9 <hr><h1>oscl_socket_imp_base.h File Reference</h1><code>#include "<a class="el" href="oscl__socket__types_8h-source.html">oscl_socket_types.h</a>"</code><br> 10 <code>#include "<a class="el" href="oscl__socket__request_8h-source.html">oscl_socket_request.h</a>"</code><br> 11 <code>#include "<a class="el" href="oscl__defalloc_8h-source.html">oscl_defalloc.h</a>"</code><br> 12 <code>#include "<a class="el" href="oscl__mutex_8h-source.html">oscl_mutex.h</a>"</code><br> 13 <code>#include "<a class="el" href="oscl__socket__stats_8h-source.html">oscl_socket_stats.h</a>"</code><br [all...] |
oscl__socket__stats_8h-source.html | 14 00009 <span class="preprocessor">#include "<a class="code" href="oscl__base_8h.html">oscl_base.h</a>"</span> 15 00010 <span class="preprocessor">#include "<a class="code" href="oscl__vector_8h.html">oscl_vector.h</a>"</span> 16 00011 <span class="preprocessor">#include "<a class="code" href="oscl__mem_8h.html">oscl_mem.h</a>"</span> 17 00012 <span class="preprocessor">#include "<a class="code" href="oscl__mutex_8h.html">oscl_mutex.h</a>"</span> 19 <a name="l00014"></a><a class="code" href="oscl__socket__stats_8h.html#a23">00014</a> <span class="keyword">enum</span> <a class="code" href="oscl__socket__stats_8h.html#a23">TOsclSocketStatEvent</a> 22 00017 <a class="code" href="oscl__socket__stats_8h.html#a23a2">EOsclSocket_RequestAO_Success</a> 23 00018 , <a class="code" href="oscl__socket__stats_8h.html#a23a3">EOsclSocket_RequestAO_Canceled</a> 24 00019 , <a class="code" href="oscl__socket__stats_8h.html#a23a4">EOsclSocket_RequestAO_Error</a> 25 00020 , <a class="code" href="oscl__socket__stats_8h.html#a23a5">EOsclSocket_RequestAO_Timeout</a [all...] |
oscl__tls_8h-source.html | 20 00026 <span class="preprocessor"></span><span class="preprocessor">#include "<a class="code" href="oscl__base_8h.html">oscl_base.h</a>"</span> 24 00030 <span class="preprocessor"></span><span class="preprocessor">#include "<a class="code" href="oscl__defalloc_8h.html">oscl_defalloc.h</a>"</span> 34 <a name="l00040"></a><a class="code" href="group__osclbase.html#a10">00040</a> <span class="keyword">typedef</span> <a class="code" href="group__osclbase.html#a25">OsclAny</a> <a class="code" href="group__osclbase.html#a10">TOsclTlsKey</a>; 40 <a name="l00046"></a><a class="code" href="group__osclbase.html#a11">00046</a> <span class="keyword">const</span> uint32 <a class="code" href="group__osclbase.html#a11">OSCL_TLS_ID_MAGICNUM</a> = 0; 41 <a name="l00047"></a><a class="code" href="group__osclbase.html#a12">00047</a> <span class="keyword">const</span> uint32 <a class="code" href="group__osclbase.html#a12">OSCL_TLS_ID_ERRORHOOK</a> = 1; 42 <a name="l00048"></a><a class="code" href="group__osclbase.html#a13">00048</a> <span class="keyword">const</span> uint32 <a class="cod (…) [all...] |
oscl__bin__stream_8h-source.html | 20 00025 <span class="comment">** This module defines a set of binary stream classes to provide portability of code accross</span> 44 00049 <span class="preprocessor"></span><span class="preprocessor">#include "<a class="code" href="oscl__base_8h.html">oscl_base.h</a>"</span> 53 <a name="l00058"></a><a class="code" href="classOsclBinStream.html">00058</a> <span class="keyword">class </span><a class="code" href="classOsclBinStream.html">OsclBinStream</a> 56 <a name="l00061"></a><a class="code" href="classOsclBinStream.html#a0">00061</a> <a class="code" href="classOsclBinStream.html#a0">OsclBinStream</a>() 57 00062 : <a class="code" href="classOsclBinStream.html#n0">state</a>(<a class="code" href="classOsclBinStream.html#t3t0">GOOD_STATE</a>), 58 00063 <a class="code" href="classOsclBinStream.html#n1">pBasePosition</a>(0), 59 00064 <a class="code" href="classOsclBinStream.html#n2">pPosition</a>(0 [all...] |
oscl__scheduler__ao_8h-source.html | 14 00016 <span class="preprocessor"></span><span class="preprocessor">#include "<a class="code" href="oscl__scheduler__types_8h.html">oscl_scheduler_types.h</a>"</span> 18 00020 <span class="preprocessor"></span><span class="preprocessor">#include "<a class="code" href="oscl__scheduler__aobase_8h.html">oscl_scheduler_aobase.h</a>"</span> 22 00024 <span class="preprocessor"></span><span class="preprocessor">#include "<a class="code" href="oscl__mem_8h.html">oscl_mem.h</a>"</span> 25 <a name="l00033"></a><a class="code" href="classOsclActiveObject.html">00033</a> <span class="keyword">class </span><a class="code" href="classOsclActiveObject.html">OsclActiveObject</a>: 26 00034 <span class="keyword">public</span> <a class="code" href="classHeapBase.html">HeapBase</a>, 27 00035 <span class="keyword">public</span> <a class="code" href="classPVActiveBase.html">PVActiveBase</a> 30 <a name="l00041"></a><a class="code" href="classOsclActiveObject.html#s5">00041</a> <span class="keyword">enum</span> <a class="code" href="classOsclActiveObject.html#s5">OsclActivePriority</a> 32 00047 <a class="code" href="classOsclActiveObject.html#s5s0">EPriorityIdle</a> = -100 [all...] |
/external/qemu/distrib/zlib-1.2.3/ |
inftrees.h | 12 information needed to do the operation requested by the code that 14 table that indexes more bits of the code. op indicates whether 16 distance, an end-of-block, or an invalid code. For a table 19 is the number of extra bits to get after the code. bits is 20 the number of bits in this code or part of the code to drop off 26 unsigned char bits; /* bits in this part of the code */ 27 unsigned short val; /* offset in table or code value */ 28 } code; typedef in typeref:struct:__anon4526 35 01000000 - invalid code [all...] |
/external/v8/test/mjsunit/ |
char-escape.js | 6 // * Redistributions of source code must retain the above copyright 36 function code(str) { function 41 assertEquals(0x08, code("\b")); 42 assertEquals(0x09, code("\t")); 43 assertEquals(0x0A, code("\n")); 44 assertEquals(0x0B, code("\v")); 45 assertEquals(0x0C, code("\f")); 46 assertEquals(0x0D, code("\r")); 47 assertEquals(0x22, code("\"")); 48 assertEquals(0x27, code("\'")); [all...] |
/external/zlib/contrib/infback9/ |
inftree9.h | 12 information needed to do the operation requested by the code that 14 table that indexes more bits of the code. op indicates whether 16 distance, an end-of-block, or an invalid code. For a table 19 is the number of extra bits to get after the code. bits is 20 the number of bits in this code or part of the code to drop off 26 unsigned char bits; /* bits in this part of the code */ 27 unsigned short val; /* offset in table or code value */ 28 } code; typedef in typeref:struct:__anon7047 35 01000000 - invalid code [all...] |
/external/zlib/ |
inftrees.h | 12 information needed to do the operation requested by the code that 14 table that indexes more bits of the code. op indicates whether 16 distance, an end-of-block, or an invalid code. For a table 19 is the number of extra bits to get after the code. bits is 20 the number of bits in this code or part of the code to drop off 26 unsigned char bits; /* bits in this part of the code */ 27 unsigned short val; /* offset in table or code value */ 28 } code; typedef in typeref:struct:__anon7063 35 01000000 - invalid code [all...] |
/frameworks/base/docs/html/sdk/api_diff/8/changes/ |
android.content.Intent.html | 74 Class android.content.<A HREF="../../../../reference/android/content/Intent.html" target="_top"><font size="+2"><code>Intent</code></font></A> 76 <p><font xsize="+1">Added interface <code>java.lang.Cloneable</code>.<br></font> 88 <nobr><code>CharSequence[]</code> <A HREF="../../../../reference/android/content/Intent.html#getCharSequenceArrayExtra(java.lang.String)" target="_top"><code>getCharSequenceArrayExtra</code></A>(<code>String</code>)</nobr [all...] |
/frameworks/base/obex/javax/obex/ |
BaseStream.java | 9 * - Redistributions of source code must retain the above copyright notice, 59 * @param sendEmpty <code>true</code> if the operation should send an empty 61 * @param inStream <code>true</code> if the stream is input stream or is 63 * @return <code>true</code> if the operation was completed; 64 * <code>false</code> if no operation took place 71 * @param inStream <code>true</code> if the input stream is closed [all...] |
/dalvik/libcore/math/src/main/java/java/math/ |
BigInteger.java | 19 // Since the original Harmony Code of the BigInteger class was strongly modified, 132 * The {@code BigInteger} constant 0. 137 * The {@code BigInteger} constant 1. 142 * The {@code BigInteger} constant 10. 146 /** The {@code BigInteger} constant -1. */ 149 /** The {@code BigInteger} constant 0 used for comparison. */ 152 /** The {@code BigInteger} constant 1 used for comparison. */ 155 /** The {@code BigInteger} constant -1 used for comparison. */ 158 /** All the {@code BigInteger} numbers in the range [0,10] are cached. */ 173 /** Cache for the hash code. * [all...] |
/dalvik/libcore/luni/src/main/java/java/util/ |
HashSet.java | 37 * Constructs a new empty instance of {@code HashSet}. 44 * Constructs a new instance of {@code HashSet} with the specified capacity. 47 * the initial capacity of this {@code HashSet}. 54 * Constructs a new instance of {@code HashSet} with the specified capacity 67 * Constructs a new instance of {@code HashSet} containing the unique 86 * Adds the specified object to this {@code HashSet} if not already present. 90 * @return {@code true} when this {@code HashSet} did not already contain 91 * the object, {@code false} otherwise 99 * Removes all elements from this {@code HashSet}, leaving it empty [all...] |
/dalvik/libcore/security/src/main/java/java/security/ |
Timestamp.java | 27 * {@code Timestamp} represents a signed time stamp. {@code Timestamp} is 42 * Constructs a new instance of {@code Timestamp} with the specified {@code 50 * if {@code timestamp} is {@code null} or if {@code 51 * signerCertPath} is {@code null}. 66 * Compares the specified object with this {@code Timestamp} for equality 67 * and returns {@code true} if the specified object is equal, {@code false [all...] |
/dalvik/libcore/sql/src/main/java/javax/sql/ |
ConnectionPoolDataSource.java | 24 * An interface for the creation of {@code ConnectionPoolDataSource} objects. 27 * A class which implements the {@code ConnectionPoolDataSource} interface is 34 * Gets the login timeout value for this {@code ConnectionPoolDataSource}. 35 * The login timeout is the maximum time in seconds that the {@code 39 * for the login timeout is {@code 0}. 48 * Gets the log writer for this {@code ConnectionPoolDataSource}. 51 * from this {@code ConnectionPoolDataSource}. The log writer can be {@code 53 * value for the log writer when an {@code ConnectionPoolDataSource} is 54 * created is {@code null}. Note that the log writer for an {@cod [all...] |
/development/pdk/docs/porting/ |
intro_source_code.jd | 1 page.title=Source Code Overview 13 <a href="#androidSourceGuidelines">Adding Source Code</a><br/></div> 17 <p>Android source code is maintained in two code bases: the Android Linux kernel (<code>kernel</code> directory) and Android platform and applications (<code>device</code> directory). This document provides a high-level introduction to the source code organization and an overview of the major components of each primary directory.</p> 36 <li><code>/drivers/android</code></li [all...] |
/frameworks/base/docs/html/sdk/api_diff/3/changes/ |
android.app.AlertDialog.html | 74 Class android.app.<A HREF="../../../../reference/android/app/AlertDialog.html" target="_top"><font size="+2"><code>AlertDialog</code></font></A> 87 <nobr><code>void</code> setButton(<code>CharSequence,</nobr> OnClickListener<nobr><nobr></code>)</nobr> 94 <nobr><code>void</code> setButton(<code>CharSequence,</nobr> Message<nobr><nobr></code>)</nobr [all...] |
android.view.ViewConfiguration.html | 74 Class android.view.<A HREF="../../../../reference/android/view/ViewConfiguration.html" target="_top"><font size="+2"><code>ViewConfiguration</code></font></A> 86 <nobr><A HREF="../../../../reference/android/view/ViewConfiguration.html#ViewConfiguration()" target="_top"><code>ViewConfiguration</code></A>() </nobr> 105 <nobr><code>ViewConfiguration</code> <A HREF="../../../../reference/android/view/ViewConfiguration.html#get(android.content.Context)" target="_top"><code>get</code></A>(<code>Context</code>)</nobr [all...] |
/external/icu4c/common/unicode/ |
chariter.h | 30 * <p>Characters can be accessed in two ways: as code units or as 31 * code points. 32 * Unicode code points are 21-bit integers and are the scalar values 34 * Unicode code units are the storage units of a given 36 * With UTF-16, all code points can be represented with either one 37 * or two code units ("surrogates"). 38 * String storage is typically based on code units, while properties 39 * of characters are typically determined using code point values. 40 * Some processes may be designed to work with sequences of code units, 42 * algorithm can be represented with single code units [all...] |
rep.h | 29 * <code>Replaceable</code> is an abstract base class representing a 37 * <p>An implicit aspect of the <code>Replaceable</code> API is that 43 * <p><code>Replaceable</code> specifies ranges using a start 48 * <p><code>Replaceable</code> also includes API to access characters 49 * in the string: <code>length()</code>, <code>charAt()</code> [all...] |
/external/proguard/docs/manual/ |
examples.html | 37 <li><a href="#rmi">Processing RMI code</a> 47 <li><a href="#deadcode">Finding dead code</a> 52 You can find some sample configuration files in the <code>examples</code> 58 typically create a configuration file <code>proguard.pro</code> and then type: 75 Note the use of the <code><java.home></code> system property; it is 79 <code>proguard.ProGuard</code> and <code>java.lang.String[]</code> [all...] |
/external/webkit/JavaScriptCore/icu/unicode/ |
utf.h | 19 * \brief C API: Code point macros 21 * This file defines macros for checking whether a code point is 24 * The UChar and UChar32 data types for Unicode code units and code points 28 * common definitions. Those files define macros for efficiently getting code points 36 * like regular code points where possible. 37 * (Pairs of surrogate code points are indistinguishable from supplementary 38 * code points encoded as pairs of supplementary code units.) 40 * In fact, almost all Unicode code points in normal text (>99% [all...] |