| /ndk/sources/cxx-stl/llvm-libc++/test/numerics/rand/rand.eng/rand.eng.mers/ |
| seed_result_type.pass.cpp | 17 // void seed(result_type s = default_seed);
30 e2.seed(s);
43 e2.seed(s);
|
| seed_sseq.pass.cpp | 17 // template<class Sseq> void seed(Sseq& q);
30 e1.seed(sseq);
42 e1.seed(sseq);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/numerics/rand/rand.eng/rand.eng.sub/ |
| seed_result_type.pass.cpp | 15 // void seed(result_type s = default_seed);
28 e2.seed(s);
41 e2.seed(s);
|
| seed_sseq.pass.cpp | 15 // template<class Sseq> void seed(Sseq& q);
28 e1.seed(sseq);
40 e1.seed(sseq);
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/encodings/ |
| OAEPEncoding.java | 167 // generate the seed.
169 byte[] seed = new byte[defHash.length];
171 random.nextBytes(seed);
176 byte[] mask = maskGeneratorFunction1(seed, 0, seed.length, block.length - defHash.length);
184 // add in the seed
186 System.arraycopy(seed, 0, block, 0, defHash.length);
189 // mask the seed.
237 // unmask the seed.
|
| /external/guava/guava-tests/test/com/google/common/hash/ |
| Murmur3Hash128Test.java | 54 private static void assertHash(int seed, byte[] expectedHash, byte[] input) {
55 byte[] hash = murmur3_128(seed).newHasher().putBytes(input).hash().asBytes();
61 @Override public byte[] hash(byte[] input, int seed) {
62 Hasher hasher = murmur3_128(seed).newHasher();
|
| Murmur3Hash32Test.java | 32 @Override public byte[] hash(byte[] input, int seed) {
33 Hasher hasher = murmur3_32(seed).newHasher();
|
| /external/openssl/crypto/des/ |
| qud_cksm.c | 77 long length, int out_count, DES_cblock *seed)
96 z0=Q_B0((*seed)[0])|Q_B1((*seed)[1])|Q_B2((*seed)[2])|Q_B3((*seed)[3]);
97 z1=Q_B0((*seed)[4])|Q_B1((*seed)[5])|Q_B2((*seed)[6])|Q_B3((*seed)[7]);
|
| /frameworks/base/tools/layoutlib/bridge/src/com/android/layoutlib/bridge/util/ |
| DynamicIdMap.java | 33 public DynamicIdMap(int seed) {
34 mDynamicSeed = seed;
37 public void reset(int seed) {
40 mDynamicSeed = seed;
|
| /ndk/sources/host-tools/sed-4.2.1/testsuite/ |
| readin.good | 15 Freedom is a strong seed
|
| readin.inp | 10 Freedom is a strong seed
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/resources/manager/ |
| DynamicIdMap.java | 32 public DynamicIdMap(int seed) {
33 mDynamicSeed = seed;
36 public void reset(int seed) {
39 mDynamicSeed = seed;
|
| /system/extras/tests/bionic/libc/common/ |
| test_drand48.c | 77 // Try again, with same seed. Should get the same values
84 // Try again, but with a different seed
99 // Try again, with same seed. Should get the same values
106 // Try again, but with a different seed
|
| /external/webkit/Source/WebCore/platform/graphics/filters/ |
| FETurbulence.cpp | 41 m = randMaximum = 2**31 - 1 = 2147483647, r = seed.
44 as the 10,000th generated number if the original seed is 1.
52 FETurbulence::FETurbulence(Filter* filter, TurbulenceType type, float baseFrequencyX, float baseFrequencyY, int numOctaves, float seed, bool stitchTiles)
58 , m_seed(seed)
63 PassRefPtr<FETurbulence> FETurbulence::create(Filter* filter, TurbulenceType type, float baseFrequencyX, float baseFrequencyY, int numOctaves, float seed, bool stitchTiles)
65 return adoptRef(new FETurbulence(filter, type, baseFrequencyX, baseFrequencyY, numOctaves, seed, stitchTiles));
107 float FETurbulence::seed() const function in class:WebCore::FETurbulence
112 bool FETurbulence::setSeed(float seed)
114 if (m_seed == seed)
116 m_seed = seed;
[all...] |
| /external/guava/guava/src/com/google/common/hash/ |
| Murmur3_128HashFunction.java | 32 private final int seed; field in class:Murmur3_128HashFunction
34 Murmur3_128HashFunction(int seed) {
35 this.seed = seed;
43 return new Murmur3_128Hasher(seed);
53 Murmur3_128Hasher(int seed) {
55 h1 = seed;
56 h2 = seed;
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| MinMaxPriorityQueueTest.java | 547 long seed = new Random().nextLong(); local
548 Random random = new Random(seed);
558 assertTrue("Modification " + i + " of seed " + seed, mmHeap.isIntact());
560 assertTrue("Modification " + i + " of seed " + seed, mmHeap.isIntact());
584 long seed = insertRandomly(elements, q); local
588 assertEquals("Using seed " + seed, expected, elements);
599 long seed = insertRandomly(elements, q) local
614 long seed = insertRandomly(elements, q); local
627 long seed = 7522346378524621981L; local
646 long seed = insertRandomly(elements, q); local
655 long seed = new Random().nextLong(); local
718 long seed = new Random().nextLong(); local
[all...] |
| /external/icu4c/test/intltest/ |
| ssearch.h | 52 const char *name, const char *strength, uint32_t seed);
56 const char *name, const char *strength, uint32_t seed);
|
| /external/openfst/src/script/ |
| randgen.cc | 24 void RandGen(const FstClass &ifst, MutableFstClass *ofst, int32 seed,
28 RandGenArgs args(ifst, ofst, seed, opts);
|
| /external/webkit/Source/WebKit/chromium/tests/ |
| PODRedBlackTreeTest.cpp | 173 void InsertionAndDeletionTest(const int32_t seed, const int treeSize)
175 initRandom(seed);
183 ASSERT_TRUE(tree.checkInvariants()) << "Test failed for seed " << seed;
193 ASSERT_TRUE(tree.checkInvariants()) << "Test failed for seed " << seed;
198 ASSERT_TRUE(tree.checkInvariants()) << "Test failed for seed " << seed;
|
| /libcore/luni/src/main/java/org/apache/harmony/xnet/provider/jsse/ |
| OpenSSLRandom.java | 26 protected void engineSetSeed(byte[] seed) {
27 NativeCrypto.RAND_seed(seed);
|
| /libcore/luni/src/test/java/libcore/java/util/ |
| RandomTest.java | 32 @Override public synchronized void setSeed(long seed) { state = Long.toString(seed); }
|
| /ndk/sources/cxx-stl/llvm-libc++/test/numerics/rand/rand.adapt/rand.adapt.shuf/ |
| seed_result_type.pass.cpp | 15 // void seed(result_type s = default_seed);
28 e2.seed(s);
|
| seed_sseq.pass.cpp | 15 // template<class Sseq> void seed(Sseq& q);
28 e1.seed(sseq);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/numerics/rand/rand.eng/rand.eng.lcong/ |
| seed_result_type.pass.cpp | 15 // void seed(result_type s = default_seed);
29 e2.seed(s);
|
| seed_sseq.pass.cpp | 15 // template<class Sseq> void seed(Sseq& q);
28 e1.seed(sseq);
|
