Example usage for java.util.concurrent.atomic AtomicIntegerArray get

Introduction

In this page you can find the example usage for java.util.concurrent.atomic AtomicIntegerArray get.

Prototype

public final int get(int i) 

Source Link

Document

Returns the current value of the element at index i , with memory effects as specified by VarHandle#getVolatile .

Usage

From source file:Main.java

public static void main(String[] argv) throws Exception {
    AtomicIntegerArray atomicIntegerArray = new AtomicIntegerArray(10);

    System.out.println(atomicIntegerArray.get(3));
}

---

From source file:com.netflix.iep.http.RxHttpTest.java

private AtomicIntegerArray copy(AtomicIntegerArray src) {
    AtomicIntegerArray dst = new AtomicIntegerArray(src.length());
    for (int i = 0; i < src.length(); ++i) {
        dst.set(i, src.get(i));
    }//from w w w.j a v a2s. c  o m
    return dst;
}

---

From source file:com.netflix.iep.http.RxHttpTest.java

private void assertEquals(AtomicIntegerArray expected, AtomicIntegerArray actual) {
    for (int i = 0; i < expected.length(); ++i) {
        final String prefix = "count(" + i + ")=";
        Assert.assertEquals(prefix + expected.get(i), prefix + actual.get(i));
    }//from  w  w w  .j ava 2  s. c om
}

---

From source file:org.hashtrees.test.HashTreesImplTest.java

@Test
public void testObservers() throws IOException {
    Store store = new SimpleMemStore();
    HashTreesStore htStore = generateInMemoryStore();
    HashTreesImpl hashTrees = new HashTreesImpl.Builder(store, TREE_ID_PROVIDER, htStore)
            .setEnabledNonBlockingCalls(false).build();
    final AtomicIntegerArray receivedCalls = new AtomicIntegerArray(10);
    hashTrees.addObserver(new HashTreesObserver() {

        @Override//from  ww w  . jav  a  2s  . com
        public void preSPut(List<KeyValue> keyValuePairs) {
            receivedCalls.set(0, 1);
        }

        @Override
        public void postSPut(List<KeyValue> keyValuePairs) {
            receivedCalls.set(1, 1);
        }

        @Override
        public void preSRemove(List<ByteBuffer> keys) {
            receivedCalls.set(2, 1);
        }

        @Override
        public void postSRemove(List<ByteBuffer> keys) {
            receivedCalls.set(3, 1);
        }

        @Override
        public void preHPut(ByteBuffer key, ByteBuffer value) {
            receivedCalls.set(4, 1);
        }

        @Override
        public void postHPut(ByteBuffer key, ByteBuffer value) {
            receivedCalls.set(5, 1);
        }

        @Override
        public void preHRemove(ByteBuffer key) {
            receivedCalls.set(6, 1);
        }

        @Override
        public void postHRemove(ByteBuffer key) {
            receivedCalls.set(7, 1);
        }

        @Override
        public void preRebuild(long treeId, boolean isFullRebuild) {
            Assert.assertTrue(isFullRebuild);
            receivedCalls.set(8, 1);
        }

        @Override
        public void postRebuild(long treeId, boolean isFullRebuild) {
            Assert.assertTrue(isFullRebuild);
            receivedCalls.set(9, 1);
        }
    });

    hashTrees.hPut(randomByteBuffer(), randomByteBuffer());
    hashTrees.rebuildHashTree(SimpleTreeIdProvider.TREE_ID, true);
    hashTrees.hRemove(randomByteBuffer());
    List<KeyValue> kvPairsList = new ArrayList<>();
    List<ByteBuffer> keys = new ArrayList<>();
    for (int i = 0; i < 1; i++) {
        kvPairsList.add(new KeyValue(randomByteBuffer(), randomByteBuffer()));
        keys.add(randomByteBuffer());
    }
    hashTrees.sPut(kvPairsList);
    hashTrees.sRemove(keys);
    for (int i = 0; i < 10; i++)
        Assert.assertEquals(1, receivedCalls.get(i));
}

---