Package java.util.concurrent.atomic

Examples of java.util.concurrent.atomic.AtomicInteger

45
46
47
48
49
50
51
    }
    this.name = name;
    this.handler = handler;
    this.connectionProperties = connectionProperties;
    this.context = context;
    this.counter = new AtomicInteger();
  }
View Full Code Here
60
61
62
63
64
65
66
    if (name == null) {
      throw new IllegalArgumentException("Name can not be null");
    }
    this.name = name;
    this.handler = handler;
    this.counter = new AtomicInteger();
  }
View Full Code Here
44
45
46
47
48
49
50
        if (name == null) {
            throw new IllegalArgumentException("Name can not be null");
        }
        this.name = name;
        this.handler = handler;
        counter = new AtomicInteger();
    }
View Full Code Here
60
61
62
63
64
65
66
67
68
69
70
        c3.setName("C");
        c3.connect(GROUP);
        r3=new MyReceiver("C");
        c3.setReceiver(r3);

        AtomicInteger num=new AtomicInteger(1);

        for(int i=0; i < senders.length; i++) {
            senders[i]=new Sender(NUM_MSGS, num, c1, c2, c3);
        }
    }
View Full Code Here
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
    if (primaryKeyLength == 0) {
      startIndex = 1;
            ElementSymbol id = new ElementSymbol("rowId"); //$NON-NLS-1$
        id.setType(DataTypeManager.DefaultDataClasses.INTEGER);
        columns.add(0, id);
        rowId = new AtomicInteger();
          tree = bm.createSTree(columns, sessionID, 1);
        } else {
          this.uniqueColIndex = primaryKeyLength;
          tree = bm.createSTree(columns, sessionID, primaryKeyLength);
        }
    this.columnMap = RelationalNode.createLookupMap(columns);
    this.columns = columns;
    if (!tid.getElements().isEmpty()) {
      //not relevant for indexes
      for (int i = startIndex; i < columns.size(); i++) {
        TempMetadataID col = tid.getElements().get(i - startIndex);
        if (col.isAutoIncrement()) {
          if (this.sequences == null) {
            this.sequences = new HashMap<Integer, AtomicInteger>();
          }
          sequences.put(i, new AtomicInteger(1));
        }
        if (col.isNotNull()) {
          notNull.add(i);
        }
      }
View Full Code Here
94
95
96
97
98
99
100
101
102
103
104
105
106
        if (addRowId) {
          newTuple.add(rowId.getAndIncrement());
        }
        for (int i = 0; i < indexes.length; i++) {
          if (indexes[i] == -1) {
            AtomicInteger sequence = sequences.get(i);
            if (sequence != null) {
              newTuple.add(sequence.getAndIncrement());
            } else {
              newTuple.add(null);
            }
          } else {
            newTuple.add(tuple.get(indexes[i]));
View Full Code Here
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
      assertTrue(result.size() < 3);
    }
   
    @Test public void testFailingWork() throws Exception {
      ThreadReuseExecutor pool = new ThreadReuseExecutor("test", 5); //$NON-NLS-1$
      final AtomicInteger count = new AtomicInteger();
      pool.execute(new Work() {
        @Override
        public void run() {
          count.getAndIncrement();
          throw new RuntimeException();
        }
       
        @Override
        public void release() {
         
        }
      });
      Thread.sleep(100);
      assertEquals(1, count.get());
    }
View Full Code Here
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
    @Test(invocationCount=10)
    public void testConcurrentInsertions() throws BrokenBarrierException, InterruptedException {
        Sender[] senders=new Sender[NUM_THREADS];
        ConcurrentMap<Long,AtomicInteger> successful_adds=new ConcurrentHashMap<Long,AtomicInteger>();
        for(int i=1; i <= NUM_MSGS; i++)
            successful_adds.put((long)i, new AtomicInteger(0));

        for(int i=0; i < senders.length; i++) {
            senders[i]=new Sender(NUM_MSGS, win, sender, barrier, successful_adds);
            senders[i].start();
        }

        Util.sleep(2000);
        System.out.println("Concurrently inserting " + NUM_MSGS + " messages with " + NUM_THREADS + " threads");
        barrier.await();

        for(int i=0; i < senders.length; i++)
            senders[i].join(20000);
        System.out.println("OK: " + NUM_MSGS + " were added to the NakReceiverWindow concurrently by " + NUM_THREADS + " threads");

        Set<Long> keys=successful_adds.keySet();

        System.out.println("checking for missing or duplicate seqnos in " + keys.size() + " seqnos:");
        for(int i=1; i <= NUM_MSGS; i++) {
            AtomicInteger val=successful_adds.get((long)i);
            if(val.get() != 1)
                System.err.println(i + " was not added exactly once (successful insertions=" + val.get() + ")");
        }
        for(int i=1; i <= NUM_MSGS; i++) {
            AtomicInteger val=successful_adds.get((long)i);
            assert val != null : i + " is missing in " + successful_adds.keySet();
            assert val.get() == 1 : i + " was not added exactly once (successful insertions=" + val.get() + ")";
        }

        System.out.println("OK: " + keys.size() + " seqnos were added exactly once");
    }
View Full Code Here
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
    @Test(invocationCount=5)
    public void testConcurrentRandomInsertions() throws BrokenBarrierException, InterruptedException {
        Sender[] senders=new RandomSender[NUM_THREADS];
        ConcurrentMap<Long,AtomicInteger> successful_adds=new ConcurrentHashMap<Long,AtomicInteger>();
        for(int i=1; i <= NUM_MSGS; i++)
            successful_adds.put((long)i, new AtomicInteger(0));

        for(int i=0; i < senders.length; i++) {
            senders[i]=new RandomSender(NUM_MSGS, win, sender, barrier, successful_adds);
            senders[i].start();
        }

        Util.sleep(2000);
        System.out.println("Concurrently inserting " + NUM_MSGS + " messages with " + NUM_THREADS + " threads");
        barrier.await();

        for(int i=0; i < senders.length; i++)
            senders[i].join(20000);
        System.out.println("OK: " + NUM_MSGS + " were added to the NakReceiverWindow concurrently by " + NUM_THREADS + " threads");

        Set<Long> keys=successful_adds.keySet();

        System.out.println("checking for missing or duplicate seqnos in " + keys.size() + " seqnos:");
        for(int i=1; i <= NUM_MSGS; i++) {
            AtomicInteger val=successful_adds.get((long)i);
            if(val.get() != 1)
                System.err.println(i + " was not added exactly once (successful insertions=" + val.get() + ")");
        }
        for(int i=1; i <= NUM_MSGS; i++) {
            AtomicInteger val=successful_adds.get((long)i);
            assert val != null : i + " is missing in " + successful_adds.keySet();
            assert val.get() == 1 : i + " was not added exactly once (successful insertions=" + val.get() + ")";
        }

        System.out.println("OK: " + keys.size() + " seqnos were added exactly once");
    }
View Full Code Here
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
    @Test(invocationCount=5)
    public void testConcurrentInsertionOfSameSeqno() throws BrokenBarrierException, InterruptedException {
        Sender[] senders=new SameSeqnoSender[NUM_THREADS];
        ConcurrentMap<Long,AtomicInteger> successful_adds=new ConcurrentHashMap<Long,AtomicInteger>();
        for(int i=1; i <= NUM_MSGS; i++)
            successful_adds.put((long)i, new AtomicInteger(0));

        for(int i=0; i < senders.length; i++) {
            senders[i]=new SameSeqnoSender(NUM_MSGS, win, sender, barrier, successful_adds);
            senders[i].start();
        }

        Util.sleep(2000);
        System.out.println("Concurrently inserting 1 message with " + NUM_THREADS + " threads");
        barrier.await();

        for(int i=0; i < senders.length; i++)
            senders[i].join(20000);
        System.out.println("OK: 1 message was added to the NakReceiverWindow concurrently by " + NUM_THREADS + " threads");

        Set<Long> keys=successful_adds.keySet();

        System.out.println("checking for missing or duplicate seqnos in " + keys.size() + " seqnos:");
        AtomicInteger val=successful_adds.get(1L);
        if(val.get() != 1)
            System.err.println("1 was not added exactly once (successful insertions=" + val.get() + ")");
        assert val.get() == 1 : "1 was not added exactly once (successful insertions=" + val.get() + ")";

        System.out.println("OK: 1 seqno was added exactly once");
    }
View Full Code Here
TOP

Related Classes of java.util.concurrent.atomic.AtomicInteger

  • com.alibaba.wasp.master.FMaster
  • com.asakusafw.runtime.flow.RuntimeResourceManagerTest
  • com.asakusafw.yaess.basic.BasicJobSchedulerTest
  • com.asakusafw.yaess.paralleljob.ParallelJobSchedulerTest
  • com.avaje.tests.query.TestQueryFindVisit
  • com.basho.riak.client.core.FutureOperationTest
  • com.bergerkiller.bukkit.tc.signactions.SignActionSwitcher
  • com.github.mustachejava.ConcurrencyTest
  • com.google.common.collect.AbstractMapBasedMultiset
  • com.google.common.collect.AbstractMapBasedMultiset$EntrySet
    • Copyright © 2018 www.massapicom. 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.