Package java.security

Examples of java.security.SecureRandom.nextDouble()

16
17
18
19
20
21
22
23
24
25
26
  public static String createRandomString(int length){
    if(length<1) return "";
    SecureRandom sr = new SecureRandom();
    StringBuilder sb=new StringBuilder();
    for(int i=0;i<length;i++){
      int rnd=(int) (sr.nextDouble()*(CHARS.length-1));
      sb.append(CHARS[rnd]);
    }
    return sb.toString();
  }
 
View Full Code Here
27
28
29
30
31
32
33
34
35
36
37
  public static String createRandomStringLC(int length){
    if(length<1) return "";
    SecureRandom sr = new SecureRandom();
    StringBuilder sb=new StringBuilder();
    for(int i=0;i<length;i++){
      int rnd=(int) (sr.nextDouble()*(CHARS_LC.length-1));
      sb.append(CHARS_LC[rnd]);
    }
    return sb.toString();
  }
}
View Full Code Here
121
122
123
124
125
126
127
128
129
130
131
          throw new RuntimeException(e);
        }

        for (int i = 0; i < iterations; i++)
        {
          String key = "abc" + (rnd.nextDouble() * iterations);
          keys.add(key);
          map.put(key, new BufferedWebResponse(null));

          int randomMax = keys.size() - 1;
          int toRemove = randomMax == 0 ? 0 : rnd.nextInt(randomMax);
View Full Code Here
286
287
288
289
290
291
292
293
294
295
296
        if (lower >= upper) {
            throw new NumberIsTooLargeException(LocalizedFormats.LOWER_BOUND_NOT_BELOW_UPPER_BOUND,
                                                lower, upper, false);
        }
        SecureRandom sec = getSecRan();
        final double r = sec.nextDouble();
        final double scaled = r * upper + (1.0 - r) * lower + r;
        return (int)FastMath.floor(scaled);
    }

    /** {@inheritDoc} */
 
View Full Code Here
298
299
300
301
302
303
304
305
306
307
308
        if (lower >= upper) {
            throw new NumberIsTooLargeException(LocalizedFormats.LOWER_BOUND_NOT_BELOW_UPPER_BOUND,
                                                lower, upper, false);
        }
        SecureRandom sec = getSecRan();
        final double r = sec.nextDouble();
        final double scaled = r * upper + (1.0 - r) * lower + r;
        return (long)FastMath.floor(scaled);
    }

    /**
 
View Full Code Here
118
119
120
121
122
123
124
125
126
127
128
          throw new RuntimeException(e);
        }

        for (int i = 0; i < iterations; i++)
        {
          String key = "abc" + (rnd.nextDouble() * iterations);
          keys.add(key);
          map.put(key, new BufferedWebResponse(null));

          int randomMax = keys.size() - 1;
          int toRemove = randomMax == 0 ? 0 : rnd.nextInt(randomMax);
View Full Code Here
119
120
121
122
123
124
125
126
127
128
129
          throw new RuntimeException(e);
        }

        for (int i = 0; i < iterations; i++)
        {
          String key = "abc" + (rnd.nextDouble() * iterations);
          keys.add(key);
          map.put(key, new BufferedWebResponse(null));

          int randomMax = keys.size() - 1;
          int toRemove = randomMax == 0 ? 0 : rnd.nextInt(randomMax);
View Full Code Here
268
269
270
271
272
273
274
275
276
277
278
          if (lower >= upper) {
              throw new IllegalArgumentException
                ("lower bound must be < upper bound");
          }
          SecureRandom sec = getSecRan();
          return lower + (int) (sec.nextDouble() * (upper - lower + 1));
    }

    /**
     * Generate a random long value uniformly distributed between
     * <code>lower</code> and <code>upper</code>, inclusive.  This algorithm
View Full Code Here
286
287
288
289
290
291
292
293
294
295
296
        if (lower >= upper) {
            throw new IllegalArgumentException
            ("lower bound must be < upper bound");
        }
        SecureRandom sec = getSecRan();
        return lower + (long) (sec.nextDouble() * (upper - lower + 1));
    }

    /**
     * {@inheritDoc}
     * <p>
 
View Full Code Here
122
123
124
125
126
127
128
129
130
131
132
          throw new RuntimeException(e);
        }

        for (int i = 0; i < iterations; i++)
        {
          String key = "abc" + (rnd.nextDouble() * iterations);
          keys.add(key);
          map.put(key, new BufferedWebResponse(null));

          int randomMax = keys.size() - 1;
          int toRemove = randomMax == 0 ? 0 : rnd.nextInt(randomMax);
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
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.