Examples of Random

ca.eandb.jmist.framework.Random
A random number generator. @author Brad Kimmel
com.asakusafw.compiler.flow.testing.operator.ExOperatorFactory.Random
com.killruana.zcraft.random.Random
Tirer un nombre aléatoire @author killruana
com.rapidminer.utils.Random
Copyright (C) 2010 Steffen Rendle, Zeno Gantner Copyright (C) 2011 Zeno Gantner This file is originally part of MyMediaLite. Ported by Matej Mihelcic (Ru�er Bo�kovi� Institute) 25.07.2011
com.securityinnovation.jNeo.Random

This is the PRNG for jNeo. It is based on the X9.82 DRBG algorithm "Hash Function DRBG Using Any Approved Hash Function (Hash_DRBG)" using SHA-256 as the underlying hash.
This implementation uses the following value for t:
0xcf, 0x83, 0xe1, 0x35, 0x7e, 0xef, 0xb8, 0xbd, 0xf1, 0x54,
0x28, 0x50, 0xd6, 0x6d, 0x80, 0x07, 0xd6, 0x20, 0xe4, 0x05,
0x0b, 0x57, 0x15, 0xdc, 0x83, 0xf4, 0xa9, 0x21, 0xd3, 0x6c,
0xe9, 0xce, 0x47, 0xd0, 0xd1, 0x3c, 0x5d, 0x85, 0xf2, 0xb0,
0xff, 0x83, 0x18, 0xd2, 0x87, 0x7e, 0xec, 0x2f, 0x63, 0xb9,
0x31, 0xbd, 0x47, 0x41, 0x7a, 0x81, 0xa5, 0x38, 0x32, 0x7a,
0xf9, 0x27, 0xda, 0x3e
This implementation does not enforce the seed length requirements specified in the X9.82 documentation, but in all cases the seed must be non-null.
com.sun.faban.driver.util.Random
RandNum is a random number/value generator. This is a primitive facility for RandomValues. RandomValues and all subclasses generate application-specific random values. @author Shanti Subramanyam
com.twitter.common.util.Random
java.util.Random
An instance of this class is used to generate a stream of pseudorandom numbers. The class uses a 48-bit seed, which is modified using a linear congruential formula. (See Donald Knuth, The Art of Computer Programming, Volume 3, Section 3.2.1.)
If two instances of {@code Random} are created with the sameseed, and the same sequence of method calls is made for each, they will generate and return identical sequences of numbers. In order to guarantee this property, particular algorithms are specified for the class {@code Random}. Java implementations must use all the algorithms shown here for the class {@code Random}, for the sake of absolute portability of Java code. However, subclasses of class {@code Random}are permitted to use other algorithms, so long as they adhere to the general contracts for all the methods.
The algorithms implemented by class {@code Random} use a{@code protected} utility method that on each invocation can supplyup to 32 pseudorandomly generated bits.
Many applications will find the method {@link Math#random} simpler to use. @author Frank Yellin @version 1.47, 02/07/06 @since 1.0
mikera.util.Random
org.apache.sshd.common.Random
A pseudo random number generator. @author Apache MINA SSHD Project
org.hornetq.utils.Random
A Random @author Tim FoxCreated 28 Nov 2008 10:28:28
org.jboss.aerogear.crypto.Random
Provides a cryptographically strong RNG
org.jruby.util.Random
org.vngx.jsch.algorithm.Random
.ietf.org/html/rfc4251#section-9.1">RFC 4251 - The Secure Shell (SSH) Protocol Architecture: Pseudo-Random Number Generation
RFC 4086 - Randomness Requirements for Security
Note: Implementations may not be thread-safe and should be externally synchronized.

Note: Instances should be created using the {@code AlgorithmManager} factory.
@see org.vngx.jsch.algorithm.AlgorithmManager @author Michael Laudati
weka.core.Debug.Random

Examples of java.util.Random

        prep.execute();
    }


    private static String getString(int id) {
        StringBuilder buff = new StringBuilder();
        Random rnd = new Random(id);
        int len = rnd.nextInt(40);
        for (int i = 0; i < len; i++) {
            String s = "bcdfghklmnprstwz";
            char c = s.charAt(rnd.nextInt(s.length()));
            buff.append(i == 0 ? Character.toUpperCase(c) : c);
            s = "aeiou  ";


            buff.append(s.charAt(rnd.nextInt(s.length())));
        }
        return buff.toString();
    }

View Full Code Here

Examples of java.util.Random

        testRandom();
    }


    private void testRandom() {
        int len = getSize(1000, 10000);
        Random random = new Random(10);
        for (int i = 0; i < len; i++) {
            int l = random.nextInt(10);
            String[] sql = new String[l];
            StringBuilder buff = new StringBuilder();
            for (int j = 0; j < l; j++) {
                sql[j] = randomStatement(random);
                buff.append(sql[j]);

View Full Code Here

Examples of java.util.Random

        assertEquals(10, m.interleave(0, 3));
        assertEquals(10, m.interleave(new int[] { 0, 3 }));
        long v = Integer.MAX_VALUE | ((long) Integer.MAX_VALUE << 31L);
        assertEquals(v, m.interleave(Integer.MAX_VALUE, Integer.MAX_VALUE));
        assertEquals(v, m.interleave(new int[] { Integer.MAX_VALUE, Integer.MAX_VALUE }));
        Random random = new Random(1);
        for (int i = 0; i < 1000; i++) {
            int x = random.nextInt(Integer.MAX_VALUE), y = random.nextInt(Integer.MAX_VALUE);
            v = m.interleave(new int[] {x, y});
            long v2 = m.interleave(x, y);
            assertEquals(v, v2);
            int x1 = m.deinterleave(2, v, 0);
            int y1 = m.deinterleave(2, v, 1);
            assertEquals(x, x1);
            assertEquals(y, y1);
        }
        for (int i = 0; i < 1000; i++) {
            int x = random.nextInt(1000), y = random.nextInt(1000), z = random.nextInt(1000);
            MultiDimension tool = MultiDimension.getInstance();
            long xyz = tool.interleave(new int[] { x, y, z });
            assertEquals(x, tool.deinterleave(3, xyz, 0));
            assertEquals(y, tool.deinterleave(3, xyz, 1));
            assertEquals(z, tool.deinterleave(3, xyz, 2));

View Full Code Here

Examples of java.util.Random

        String sql = multi.generatePreparedQuery("TEST", "XY", new String[] { "X", "Y" });
        sql += " ORDER BY X, Y";
        PreparedStatement prepMulti = conn.prepareStatement(sql);
        long timeMulti = 0, timeRegular = 0;
        int timeMax = getSize(500, 2000);
        Random rand = new Random(1);
        for (int i = 0; timeMulti < timeMax; i++) {
            int size = rand.nextInt(max / 10);
            int minX = rand.nextInt(max - size);
            int minY = rand.nextInt(max - size);
            int maxX = minX + size, maxY = minY + size;
            time = System.currentTimeMillis();
            ResultSet rs1 = multi.getResult(prepMulti, new int[] { minX, minY }, new int[] { maxX, maxY });
            timeMulti += System.currentTimeMillis() - time;
            time = System.currentTimeMillis();

View Full Code Here

Examples of java.util.Random

        String sql = multi.generatePreparedQuery("TEST", "XYZ", new String[] { "X", "Y", "Z" });
        sql += " ORDER BY X, Y, Z";
        PreparedStatement prepMulti = conn.prepareStatement(sql);
        long timeMulti = 0, timeRegular = 0;
        int timeMax = getSize(500, 2000);
        Random rand = new Random(1);
        for (int i = 0; timeMulti < timeMax; i++) {
            int size = rand.nextInt(max / 10);
            int minX = rand.nextInt(max - size);
            int minY = rand.nextInt(max - size);
            int minZ = rand.nextInt(max - size);
            int maxX = minX + size, maxY = minY + size, maxZ = minZ + size;
            time = System.currentTimeMillis();
            ResultSet rs1 = multi.getResult(prepMulti, new int[] { minX, minY, minZ }, new int[] { maxX, maxY, maxZ });
            timeMulti += System.currentTimeMillis() - time;
            time = System.currentTimeMillis();

View Full Code Here

Examples of java.util.Random


    private static void runBenchmarkWithZipfDistributionLock(Status stat, ILock lock, FixedSegments pager, ConcurrentPluggableCache<Long, byte[]> cache, int capacity, int round, double percent, int scanLength, long[] dist) {
        boolean scanning = false;
        long scanCount = 0L;


        final Random rand = new Random();


        int scanned = 0, zipf = 0;
        long base = 0L;


        long mills1 = System.currentTimeMillis();
        long ops = 0L;
        long miss = 0L;


        long totalExecInterval = 0L, totalDurationHold = 0L;
        long prelock = System.currentTimeMillis();


        final int limit = round - 1;
        for(int nth = 0, i = 0; !_stop; nth = (nth >= limit) ? 0 : nth + 1, i++) {
            final long key;
            if(scanning || scanLength != 0 && (i == scanLength && rand.nextDouble() < percent)) {
                if(++scanCount <= scanLength) {
                    if(!scanning) {
                        base = dist[nth];
                    }
                    key = base + scanCount;

View Full Code Here

Examples of java.util.Random


    private static void runBenchmarkWithZipfDistributionReadWriteLock(ReadWriteLock rwlock, Status stat, FixedSegments pager, ConcurrentPluggableCache<Long, byte[]> cache, int capacity, int round, double percent, int scanLength, long[] dist) {
        boolean scanning = false;
        long scanCount = 0L;


        final Random rand = new Random();


        int scanned = 0, zipf = 0;
        long base = 0L;


        long mills1 = System.currentTimeMillis();
        long ops = 0L;
        long miss = 0L;


        final Lock readLock = rwlock.readLock();
        final Lock writeLock = rwlock.writeLock();


        final int limit = round - 1;
        for(int nth = 0, i = 0; !_stop; nth = (nth >= limit) ? 0 : nth + 1, i++) {
            final long key;
            if(scanning || scanLength != 0 && (i == scanLength && rand.nextDouble() < percent)) {
                if(++scanCount <= scanLength) {
                    if(!scanning) {
                        base = dist[nth];
                    }
                    key = base + scanCount;

View Full Code Here

Examples of java.util.Random


    private static void runBenchmarkWithZipfDistributionSync(Status stat, FixedSegments pager, ConcurrentPluggableCache<Long, byte[]> cache, int capacity, int round, double percent, int scanLength, long[] dist) {
        boolean scanning = false;
        long scanCount = 0L;


        final Random rand = new Random();


        int scanned = 0, zipf = 0;
        long base = 0L;


        long mills1 = System.currentTimeMillis();
        long ops = 0L;
        long miss = 0L;


        final int limit = round - 1;
        for(int nth = 0, i = 0; !_stop; nth = (nth >= limit) ? 0 : nth + 1, i++) {
            final long key;
            if(scanning || scanLength != 0 && (i == scanLength && rand.nextDouble() < percent)) {
                if(++scanCount <= scanLength) {
                    if(!scanning) {
                        base = dist[nth];
                    }
                    key = base + scanCount;

View Full Code Here

Examples of java.util.Random


    private static void runBenchmarkWithZipfDistributionLongHashLock(Status stat, ILock lock, FixedSegments pager, LongHash<byte[]> hash, int capacity, int round, double percent, int scanLength, long[] dist) {
        boolean scanning = false;
        long scanCount = 0L;


        final Random rand = new Random();


        int scanned = 0, zipf = 0;
        long base = 0L;


        long mills1 = System.currentTimeMillis();
        long ops = 0L;
        long miss = 0L;


        final int limit = round - 1;
        for(int nth = 0, i = 0; !_stop; nth = (nth >= limit) ? 0 : nth + 1, i++) {
            final long key;
            if(scanning || scanLength != 0 && (i == scanLength && rand.nextDouble() < percent)) {
                if(++scanCount <= scanLength) {
                    if(!scanning) {
                        base = dist[nth];
                    }
                    key = base + scanCount;

View Full Code Here

Examples of java.util.Random


    private static void runBenchmarkWithZipfDistributionLongHashSync(Status stat, FixedSegments pager, LongHash<byte[]> hash, int capacity, int round, double percent, int scanLength, long[] dist) {
        boolean scanning = false;
        long scanCount = 0L;


        final Random rand = new Random();


        int scanned = 0, zipf = 0;
        long base = 0L;


        long mills1 = System.currentTimeMillis();
        long ops = 0L;
        long miss = 0L;


        final int limit = round - 1;
        for(int nth = 0, i = 0; !_stop; nth = (nth >= limit) ? 0 : nth + 1, i++) {
            final long key;
            if(scanning || scanLength != 0 && (i == scanLength && rand.nextDouble() < percent)) {
                if(++scanCount <= scanLength) {
                    if(!scanning) {
                        base = dist[nth];
                    }
                    key = base + scanCount;

View Full Code Here

0 1 2 3 4 5 6

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.