Commit aefe3d8

committed

Add sInterCard methods to JedisClusterSetCommands and LettuceClusterSetCommands

1 parent 7fb5cef commit aefe3d8Copy full SHA for aefe3d8

File tree

+36

-0

lines changed

src/main/java/org/springframework/data/redis/connection
- jedis
  - JedisClusterSetCommands.java
- lettuce
  - LettuceClusterSetCommands.java

+36

-0

lines changed

Lines changed: 20 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -40,6 +40,7 @@`
`40`	`40`	`/**`
`41`	`41`	`* @author Christoph Strobl`
`42`	`42`	`* @author Mark Paluch`
	`43`	`+ * @author Mingi Lee`
`43`	`44`	`* @since 2.0`
`44`	`45`	`*/`
`45`	`46`	`class JedisClusterSetCommands implements RedisSetCommands {`
`@@ -230,6 +231,25 @@ public Long sInterStore(byte[] destKey, byte[]... keys) {`
`230`	`231`	`return sAdd(destKey, result.toArray(new byte[result.size()][]));`
`231`	`232`	`}`
`232`	`233`
	`234`	`+ @Override`
	`235`	`+ public Long sInterCard(byte[]... keys) {`
	`236`	`+`
	`237`	`+ Assert.notNull(keys, "Keys must not be null");`
	`238`	`+ Assert.noNullElements(keys, "Keys must not contain null elements");`
	`239`	`+`
	`240`	`+ if (ClusterSlotHashUtil.isSameSlotForAllKeys(keys)) {`
	`241`	`+ try {`
	`242`	`+ return connection.getCluster().sintercard(keys);`
	`243`	`+ } catch (Exception ex) {`
	`244`	`+ throw convertJedisAccessException(ex);`
	`245`	`+ }`
	`246`	`+ }`
	`247`	`+`
	`248`	`+ // For multi-slot clusters, calculate intersection cardinality by performing intersection`
	`249`	`+ Set<byte[]> result = sInter(keys);`
	`250`	`+ return (long) result.size();`
	`251`	`+ }`
	`252`	`+`
`233`	`253`	`@Override`
`234`	`254`	`public Set<byte[]> sUnion(byte[]... keys) {`
`235`	`255`

Lines changed: 16 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -31,6 +31,7 @@`
`31`	`31`	`/**`
`32`	`32`	`* @author Christoph Strobl`
`33`	`33`	`* @author Mark Paluch`
	`34`	`+ * @author Mingi Lee`
`34`	`35`	`* @since 2.0`
`35`	`36`	`*/`
`36`	`37`	`class LettuceClusterSetCommands extends LettuceSetCommands {`
`@@ -118,6 +119,21 @@ public Long sInterStore(byte[] destKey, byte[]... keys) {`
`118`	`119`	`return sAdd(destKey, result.toArray(new byte[result.size()][]));`
`119`	`120`	`}`
`120`	`121`
	`122`	`+ @Override`
	`123`	`+ public Long sInterCard(byte[]... keys) {`
	`124`	`+`
	`125`	`+ Assert.notNull(keys, "Keys must not be null");`
	`126`	`+ Assert.noNullElements(keys, "Keys must not contain null elements");`
	`127`	`+`
	`128`	`+ if (ClusterSlotHashUtil.isSameSlotForAllKeys(keys)) {`
	`129`	`+ return super.sInterCard(keys);`
	`130`	`+ }`
	`131`	`+`
	`132`	`+ // For multi-slot clusters, calculate intersection cardinality by performing intersection`
	`133`	`+ Set<byte[]> result = sInter(keys);`
	`134`	`+ return (long) result.size();`
	`135`	`+ }`
	`136`	`+`
`121`	`137`	`@Override`
`122`	`138`	`public Set<byte[]> sUnion(byte[]... keys) {`
`123`	`139`

Comments

(0)