Package java.util

Examples of java.util.Random.nextLong()

55
56
57
58
59
60
61
62
63
64
65
                }

                db.createTable("create table t1(a integer, b integer, primary key (a,b))");
                table1 = db.getTable("t1");
                for (int i = 10; i > 0; i--) {
                    table1.insert(i, r.nextLong());
                }

                return null;
            }
        });
View Full Code Here
62
63
64
65
66
67
68
69
70
71
72
      for(int i = 0; i < 100; i++) {
        TestVO test1 = new TestVO();
        test1.setId(new Long(1 + i));
        test1.setBooleanValue(Boolean.TRUE);
        test1.setStringValue("Strange");
        test1.setLongValue(new Long(rnd.nextLong() % 100));
        data.add(test1);
   
        TestVO test2 = new TestVO();
        test2.setId(new Long(2 + i));
        test2.setBooleanValue(Boolean.TRUE);
View Full Code Here
69
70
71
72
73
74
75
76
77
78
79
   
        TestVO test2 = new TestVO();
        test2.setId(new Long(2 + i));
        test2.setBooleanValue(Boolean.TRUE);
        test2.setStringValue("Peculiar");
        test2.setLongValue(new Long(rnd.nextLong() % 100));
        data.add(test2);
   
        TestVO test3 = new TestVO();
        test3.setId(new Long(3 + i));
        test3.setBooleanValue(Boolean.FALSE);
View Full Code Here
76
77
78
79
80
81
82
83
84
85
86
   
        TestVO test3 = new TestVO();
        test3.setId(new Long(3 + i));
        test3.setBooleanValue(Boolean.FALSE);
        test3.setStringValue("Queer");
        test3.setLongValue(new Long(rnd.nextLong() % 100));
        data.add(test3);
      }     
    }   

    public List loadData() {
View Full Code Here
14
15
16
17
18
19
20
21
22
23
24
   
    TimerTask[] tasks = new TimerTask[1000];
    Random random = new Random();
    for (int i = 0; i < tasks.length; i++)
    {
      tasks[i] = new TimerTask(null, Math.abs(random.nextLong()));
      list.addTimer(tasks[i]);
    }
   
    long time = -1;
   
View Full Code Here
26
27
28
29
30
31
32
33
34
35
36
    {
      assertTrue(task.getExecutionTime() >= time);
      time = task.getExecutionTime();
    }
   
    time = Math.abs(random.nextLong());
   
    TimerTask task = null;
    while ((task = list.getExpired(time)) != null)
    {
      assertTrue(task.getExecutionTime() <= time);
View Full Code Here
442
443
444
445
446
447
448
449
450
451
452
        tHandle.setTranslatedObjectDataMask((byte) primaryMask);
       
        //
        if(tHandle.generateUID()){
            Random random = new Random();
            transactionFile.writeLong(random.nextLong());
        }
        long time = System.currentTimeMillis();
        if(tHandle.generateCreationTS()){
            transactionFile.writeLong(time);
        }
View Full Code Here
51
52
53
54
55
56
57
58
59
60
61
    {
      PriorityQueue queue = new PriorityQueue();
      long previous = Long.MIN_VALUE;
      for (int j = 0; j < 1000; j++)
      {
        queue.offer(new Node(random.nextLong()));
      }
      while (queue.getSize() != 0)
      {
        long min = queue.poll().getValue();
        assertTrue(previous <= min);
View Full Code Here
71
72
73
74
75
76
77
78
79
80
81
    for (int i = 0; i < 1000; i++)
    {
      PriorityQueue queue = new PriorityQueue();
      for (int j = 0; j < 1000; j++)
      {
        queue.offer(new Node(random.nextLong()));
      }
      checkPosition(queue.asArray());
    }
  }
 
View Full Code Here
115
116
117
118
119
120
121
122
123
124
125
    {
      PriorityQueue queue = new PriorityQueue();
      long previous = Long.MIN_VALUE;
      for (int j = 0; j < 1000; j++)
      {
        queue.offer(new Node(random.nextLong()));
      }
      for (int j = 0; j < 10; j++)
      {
        queue.offer(queue.asArray()[random.nextInt(1000)], random.nextLong());
      }
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.