github-forks
/
redisson
mirror of https://github.com/redisson/redisson.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

RedissonQueueTest added

Browse Source
pull/10/merge
Nikita 11 years ago
parent e28c45df5c
commit 48b255327d
4 changed files with 100 additions and 19 deletions
Show Stats Download Patch File Download Diff File

6
src/test/java/org/redisson/BaseTest.java
Unescape Escape View File

@ -9,11 +9,7 @@ import org.junit.Before;
public abstract class BaseTest { public abstract class BaseTest {
private Redisson redisson; protected Redisson redisson;
public Redisson currentRedisson() {
return redisson;
}
@Before @Before
public void before() { public void before() {

6
src/test/java/org/redisson/RedissonAtomicLongTest.java
Unescape Escape View File

@ -10,16 +10,16 @@ public class RedissonAtomicLongTest extends BaseTest {
@Test @Test
public void test() { public void test() {
RAtomicLong al = currentRedisson().getAtomicLong("test"); RAtomicLong al = redisson.getAtomicLong("test");
Assert.assertEquals(0, al.get()); Assert.assertEquals(0, al.get());
Assert.assertEquals(0, al.getAndIncrement()); Assert.assertEquals(0, al.getAndIncrement());
Assert.assertEquals(1, al.get()); Assert.assertEquals(1, al.get());
long state = currentRedisson().getAtomicLong("test").get(); long state = redisson.getAtomicLong("test").get();
Assert.assertEquals(1, state); Assert.assertEquals(1, state);
al.set(Long.MAX_VALUE - 1000); al.set(Long.MAX_VALUE - 1000);
long newState = currentRedisson().getAtomicLong("test").get(); long newState = redisson.getAtomicLong("test").get();
Assert.assertEquals(Long.MAX_VALUE - 1000, newState); Assert.assertEquals(Long.MAX_VALUE - 1000, newState);
} }

85
src/test/java/org/redisson/RedissonQueueTest.java
Unescape Escape View File

@ -0,0 +1,85 @@
package org.redisson;
import java.util.LinkedList;
import java.util.NoSuchElementException;
import java.util.Queue;
import org.hamcrest.MatcherAssert;
import org.hamcrest.Matchers;
import org.junit.Assert;
import org.junit.Test;
import org.redisson.core.RQueue;
public class RedissonQueueTest extends BaseTest {
@Test
public void testAddOfferOrigin() {
Queue<Integer> queue = new LinkedList<Integer>();
queue.add(1);
queue.offer(2);
queue.add(3);
queue.offer(4);
MatcherAssert.assertThat(queue, Matchers.contains(1, 2, 3, 4));
Assert.assertEquals((Integer)1, queue.poll());
MatcherAssert.assertThat(queue, Matchers.contains(2, 3, 4));
Assert.assertEquals((Integer)2, queue.element());
}
@Test
public void testAddOffer() {
RQueue<Integer> queue = redisson.getQueue("queue");
queue.add(1);
queue.offer(2);
queue.add(3);
queue.offer(4);
MatcherAssert.assertThat(queue, Matchers.contains(1, 2, 3, 4));
Assert.assertEquals((Integer)1, queue.poll());
MatcherAssert.assertThat(queue, Matchers.contains(2, 3, 4));
Assert.assertEquals((Integer)2, queue.element());
}
@Test
public void testRemoveOrigin() {
Queue<Integer> queue = new LinkedList<Integer>();
queue.add(1);
queue.add(2);
queue.add(3);
queue.add(4);
queue.remove();
queue.remove();
MatcherAssert.assertThat(queue, Matchers.contains(3, 4));
queue.remove();
queue.remove();
Assert.assertTrue(queue.isEmpty());
}
@Test
public void testRemove() {
RQueue<Integer> queue = redisson.getQueue("queue");
queue.add(1);
queue.add(2);
queue.add(3);
queue.add(4);
queue.remove();
queue.remove();
MatcherAssert.assertThat(queue, Matchers.contains(3, 4));
queue.remove();
queue.remove();
Assert.assertTrue(queue.isEmpty());
}
@Test(expected = NoSuchElementException.class)
public void testRemoveEmpty() {
RQueue<Integer> queue = redisson.getQueue("queue");
queue.remove();
}
}

22
src/test/java/org/redisson/RedissonSortedSetTest.java
Unescape Escape View File

@ -16,7 +16,7 @@ public class RedissonSortedSetTest extends BaseTest {
@Test @Test
public void testTrySetComparator() { public void testTrySetComparator() {
RSortedSet<Integer> set = currentRedisson().getSortedSet("set"); RSortedSet<Integer> set = redisson.getSortedSet("set");
boolean setRes = set.trySetComparator(Collections.reverseOrder()); boolean setRes = set.trySetComparator(Collections.reverseOrder());
Assert.assertTrue(setRes); Assert.assertTrue(setRes);
@ -58,7 +58,7 @@ public class RedissonSortedSetTest extends BaseTest {
@Test(expected = IllegalArgumentException.class) @Test(expected = IllegalArgumentException.class)
public void testTailSet() { public void testTailSet() {
RSortedSet<Integer> set = currentRedisson().getSortedSet("set"); RSortedSet<Integer> set = redisson.getSortedSet("set");
set.add(1); set.add(1);
set.add(2); set.add(2);
@ -85,7 +85,7 @@ public class RedissonSortedSetTest extends BaseTest {
@Test(expected = IllegalArgumentException.class) @Test(expected = IllegalArgumentException.class)
public void testHeadSet() { public void testHeadSet() {
RSortedSet<Integer> set = currentRedisson().getSortedSet("set"); RSortedSet<Integer> set = redisson.getSortedSet("set");
set.add(1); set.add(1);
set.add(2); set.add(2);
@ -163,7 +163,7 @@ public class RedissonSortedSetTest extends BaseTest {
@Test @Test
public void testSort() { public void testSort() {
RSortedSet<Integer> set = currentRedisson().getSortedSet("set"); RSortedSet<Integer> set = redisson.getSortedSet("set");
Assert.assertTrue(set.add(2)); Assert.assertTrue(set.add(2));
Assert.assertTrue(set.add(3)); Assert.assertTrue(set.add(3));
Assert.assertTrue(set.add(1)); Assert.assertTrue(set.add(1));
@ -180,7 +180,7 @@ public class RedissonSortedSetTest extends BaseTest {
@Test @Test
public void testRemove() { public void testRemove() {
RSortedSet<Integer> set = currentRedisson().getSortedSet("set"); RSortedSet<Integer> set = redisson.getSortedSet("set");
set.add(5); set.add(5);
set.add(3); set.add(3);
set.add(1); set.add(1);
@ -195,7 +195,7 @@ public class RedissonSortedSetTest extends BaseTest {
@Test @Test
public void testRetainAll() { public void testRetainAll() {
Set<Integer> set = currentRedisson().getSortedSet("set"); Set<Integer> set = redisson.getSortedSet("set");
for (int i = 0; i < 200; i++) { for (int i = 0; i < 200; i++) {
set.add(i); set.add(i);
} }
@ -206,7 +206,7 @@ public class RedissonSortedSetTest extends BaseTest {
@Test @Test
public void testContainsAll() { public void testContainsAll() {
Set<Integer> set = currentRedisson().getSortedSet("set"); Set<Integer> set = redisson.getSortedSet("set");
for (int i = 0; i < 200; i++) { for (int i = 0; i < 200; i++) {
set.add(i); set.add(i);
} }
@ -217,7 +217,7 @@ public class RedissonSortedSetTest extends BaseTest {
@Test @Test
public void testToArray() { public void testToArray() {
Set<String> set = currentRedisson().getSortedSet("set"); Set<String> set = redisson.getSortedSet("set");
set.add("1"); set.add("1");
set.add("4"); set.add("4");
set.add("2"); set.add("2");
@ -232,7 +232,7 @@ public class RedissonSortedSetTest extends BaseTest {
@Test @Test
public void testContains() { public void testContains() {
Set<TestObject> set = currentRedisson().getSortedSet("set"); Set<TestObject> set = redisson.getSortedSet("set");
set.add(new TestObject("1", "2")); set.add(new TestObject("1", "2"));
set.add(new TestObject("1", "2")); set.add(new TestObject("1", "2"));
@ -247,7 +247,7 @@ public class RedissonSortedSetTest extends BaseTest {
@Test @Test
public void testDuplicates() { public void testDuplicates() {
Set<TestObject> set = currentRedisson().getSortedSet("set"); Set<TestObject> set = redisson.getSortedSet("set");
Assert.assertTrue(set.add(new TestObject("1", "2"))); Assert.assertTrue(set.add(new TestObject("1", "2")));
Assert.assertFalse(set.add(new TestObject("1", "2"))); Assert.assertFalse(set.add(new TestObject("1", "2")));
@ -260,7 +260,7 @@ public class RedissonSortedSetTest extends BaseTest {
@Test @Test
public void testSize() { public void testSize() {
Set<Integer> set = currentRedisson().getSortedSet("set"); Set<Integer> set = redisson.getSortedSet("set");
set.add(1); set.add(1);
set.add(2); set.add(2);
set.add(3); set.add(3);

Write Preview
Loading…
Cancel
Save