SortedSetsApi

Type Members

abstract type HashKey

The type of Redis hash keys or hash key patterns used in methods representing Redis commands that work on hashes (HashesApi).
The type of Redis hash keys or hash key patterns used in methods representing Redis commands that work on hashes (HashesApi).

Definition Classes
ApiSubset
abstract type Key

The type of Redis keys or key patterns used in methods representing Redis commands.
The type of Redis keys or key patterns used in methods representing Redis commands. For example, if Key = String then get returns Result[Opt[String]]. This type is used only for toplevel Redis keys, hash keys have their own type, HashKey.

Definition Classes
ApiSubset
abstract type Result[A]

The type constructor into which a result of each command is wrapped.
The type constructor into which a result of each command is wrapped. For example if Result is Future, then incr returns Future[Long].

Definition Classes
ApiSubset
abstract type Value

The type of Redis values used in methods representing Redis commands.
The type of Redis values used in methods representing Redis commands. "Value" is the data that might be stored directly under a Redis key (e.g. using set) but also a value of hash field, list element, set member, sorted set member, geo set member or element inserted into hyper-log-log structure. There are no separate types specified for every of those use cases because only one of them can be used in a single command (for example, there is no Redis command that works on both list elements and set members at the same time).

Definition Classes
ApiSubset

Abstract Value Members

abstract def execute[A](command: RedisCommand[A]): Result[A]

Definition Classes
ApiSubset
implicit abstract def hashKeyCodec: RedisDataCodec[HashKey]

Attributes
protected
Definition Classes
ApiSubset
implicit abstract def keyCodec: RedisDataCodec[Key]

Attributes
protected
Definition Classes
ApiSubset
implicit abstract def valueCodec: RedisDataCodec[Value]

Attributes
protected
Definition Classes
ApiSubset

Concrete Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
implicit def headOps[T](head: T): HeadOps[T]

Attributes
protected
Definition Classes
ApiSubset
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
implicit def iterableTailOps[T](tail: Iterable[T]): IterableTailOps[T]

Attributes
protected
Definition Classes
ApiSubset
implicit def iteratorTailOps[T](tail: Iterator[T]): IteratorTailOps[T]

Attributes
protected
Definition Classes
ApiSubset
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
def zadd(key: Key, memberScores: Iterable[(Value, Double)], existence: commons.OptArg[Boolean] = OptArg.Empty, changed: Boolean = false): Result[Int]

Executes ZADD or simply returns 0 when memberScores is empty
def zadd(key: Key, score: Double, members: Iterable[Value]): Result[Int]

Executes ZADD or simply returns 0 when members is empty
def zadd(key: Key, score: Double, member: Value, members: Value*): Result[Int]

Executes ZADD
def zadd(key: Key, member: Value, score: Double): Result[Boolean]

Executes ZADD
def zadd(key: Key, memberScore: (Value, Double), memberScores: (Value, Double)*): Result[Int]

Executes ZADD
def zaddIncr(key: Key, member: Value, score: Double, existence: commons.OptArg[Boolean] = OptArg.Empty): Result[commons.Opt[Double]]

Executes ZADD
def zcard(key: Key): Result[Long]

Executes ZCARD
def zcount(key: Key, min: ScoreLimit = ScoreLimit.MinusInf, max: ScoreLimit = ScoreLimit.PlusInf): Result[Long]

Executes ZCOUNT
def zincrby(key: Key, increment: Double, member: Value): Result[Double]

Executes ZINCRBY
def zinterstore(destination: Key, keys: Iterable[Key], aggregation: commons.OptArg[Aggregation] = OptArg.Empty): Result[Long]

Executes ZINTERSTORE NOTE: keys MUST NOT be empty
def zinterstore(destination: Key, key: Key, keys: Key*): Result[Long]

Executes ZINTERSTORE
def zinterstoreWeights(destination: Key, keysWeights: Iterable[(Key, Double)], aggregation: commons.OptArg[Aggregation] = OptArg.Empty): Result[Long]

Executes ZINTERSTORE NOTE: keysWeights MUST NOT be empty
def zinterstoreWeights(destination: Key, keyWeight: (Key, Double), keysWeights: (Key, Double)*): Result[Long]

Executes ZINTERSTORE
def zlexcount(key: Key, min: LexLimit[Value] = LexLimit.MinusInf, max: LexLimit[Value] = LexLimit.PlusInf): Result[Long]

Executes ZLEXCOUNT
def zrange(key: Key, start: Long = 0, stop: Long = 1): Result[Seq[Value]]

Executes ZRANGE
def zrangeWithscores(key: Key, start: Long = 0, stop: Long = 1): Result[Seq[(Value, Double)]]

Executes ZRANGE
def zrangebylex(key: Key, min: LexLimit[Value] = LexLimit.MinusInf, max: LexLimit[Value] = LexLimit.PlusInf, limit: commons.OptArg[Limit] = OptArg.Empty): Result[Seq[Value]]

Executes ZRANGEBYLEX
def zrangebyscore(key: Key, min: ScoreLimit = ScoreLimit.MinusInf, max: ScoreLimit = ScoreLimit.PlusInf, limit: commons.OptArg[Limit] = OptArg.Empty): Result[Seq[Value]]

Executes ZRANGEBYSCORE
def zrangebyscoreWithscores(key: Key, min: ScoreLimit = ScoreLimit.MinusInf, max: ScoreLimit = ScoreLimit.PlusInf, limit: commons.OptArg[Limit] = OptArg.Empty): Result[Seq[(Value, Double)]]

Executes ZRANGEBYSCORE
def zrank(key: Key, member: Value): Result[commons.Opt[Long]]

Executes ZRANK
def zrem(key: Key, members: Iterable[Value]): Result[Int]

Executes ZREM or simply returns 0 when members is empty
def zrem(key: Key, member: Value, members: Value*): Result[Int]

Executes ZREM
def zrem(key: Key, member: Value): Result[Boolean]

Executes ZREM
def zremrangebylex(key: Key, min: LexLimit[Value] = LexLimit.MinusInf, max: LexLimit[Value] = LexLimit.PlusInf): Result[Long]

Executes ZREMRANGEBYLEX
def zremrangebyrank(key: Key, start: Long = 0, stop: Long = 1): Result[Long]

Executes ZREMRANGEBYRANK
def zremrangebyscore(key: Key, min: ScoreLimit = ScoreLimit.MinusInf, max: ScoreLimit = ScoreLimit.PlusInf): Result[Long]

Executes ZREMRANGEBYSCORE
def zrevrange(key: Key, start: Long = 0, stop: Long = 1): Result[Seq[Value]]

Executes ZREVRANGE
def zrevrangeWithscores(key: Key, start: Long = 0, stop: Long = 1): Result[Seq[(Value, Double)]]

Executes ZREVRANGE
def zrevrangebylex(key: Key, max: LexLimit[Value] = LexLimit.PlusInf, min: LexLimit[Value] = LexLimit.MinusInf, limit: commons.OptArg[Limit] = OptArg.Empty): Result[Seq[Value]]

Executes ZREVRANGEBYLEX
def zrevrangebyscore(key: Key, max: ScoreLimit = ScoreLimit.PlusInf, min: ScoreLimit = ScoreLimit.MinusInf, limit: commons.OptArg[Limit] = OptArg.Empty): Result[Seq[Value]]

Executes ZREVRANGEBYSCORE
def zrevrangebyscoreWithscores(key: Key, max: ScoreLimit = ScoreLimit.PlusInf, min: ScoreLimit = ScoreLimit.MinusInf, limit: commons.OptArg[Limit] = OptArg.Empty): Result[Seq[(Value, Double)]]

Executes ZREVRANGEBYSCORE
def zrevrank(key: Key, member: Value): Result[commons.Opt[Long]]

Executes ZREVRANK
def zscan(key: Key, cursor: Cursor, matchPattern: commons.OptArg[Value] = OptArg.Empty, count: commons.OptArg[Int] = OptArg.Empty): Result[(Cursor, Seq[(Value, Double)])]

Executes ZSCAN
def zscore(key: Key, member: Value): Result[commons.Opt[Double]]

Executes ZSCORE
def zunionstore(destination: Key, keys: Iterable[Key], aggregation: commons.OptArg[Aggregation] = OptArg.Empty): Result[Long]

Executes ZUNIONSTORE NOTE: keys MUST NOT be empty
def zunionstore(destination: Key, key: Key, keys: Key*): Result[Long]

Executes ZUNIONSTORE
def zunionstoreWeights(destination: Key, keysWeights: Iterable[(Key, Double)], aggregation: commons.OptArg[Aggregation] = OptArg.Empty): Result[Long]

Executes ZUNIONSTORE NOTE: keysWeights MUST NOT be empty
def zunionstoreWeights(destination: Key, keyWeight: (Key, Double), keysWeights: (Key, Double)*): Result[Long]

Executes ZUNIONSTORE

Related Doc: package commands

trait SortedSetsApi extends ApiSubset

Type Members

abstract type HashKey

abstract type Key

abstract type Result[A]

abstract type Value

Abstract Value Members

abstract def execute[A](command: RedisCommand[A]): Result[A]

implicit abstract def hashKeyCodec: RedisDataCodec[HashKey]

implicit abstract def keyCodec: RedisDataCodec[Key]

implicit abstract def valueCodec: RedisDataCodec[Value]

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

implicit def headOps[T](head: T): HeadOps[T]

final def isInstanceOf[T0]: Boolean

implicit def iterableTailOps[T](tail: Iterable[T]): IterableTailOps[T]

implicit def iteratorTailOps[T](tail: Iterator[T]): IteratorTailOps[T]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def zadd(key: Key, memberScores: Iterable[(Value, Double)], existence: commons.OptArg[Boolean] = OptArg.Empty, changed: Boolean = false): Result[Int]

def zadd(key: Key, score: Double, members: Iterable[Value]): Result[Int]

def zadd(key: Key, score: Double, member: Value, members: Value*): Result[Int]

def zadd(key: Key, member: Value, score: Double): Result[Boolean]

def zadd(key: Key, memberScore: (Value, Double), memberScores: (Value, Double)*): Result[Int]

def zaddIncr(key: Key, member: Value, score: Double, existence: commons.OptArg[Boolean] = OptArg.Empty): Result[commons.Opt[Double]]

def zcard(key: Key): Result[Long]

def zcount(key: Key, min: ScoreLimit = ScoreLimit.MinusInf, max: ScoreLimit = ScoreLimit.PlusInf): Result[Long]

def zincrby(key: Key, increment: Double, member: Value): Result[Double]

def zinterstore(destination: Key, keys: Iterable[Key], aggregation: commons.OptArg[Aggregation] = OptArg.Empty): Result[Long]

def zinterstore(destination: Key, key: Key, keys: Key*): Result[Long]

def zinterstoreWeights(destination: Key, keysWeights: Iterable[(Key, Double)], aggregation: commons.OptArg[Aggregation] = OptArg.Empty): Result[Long]

def zinterstoreWeights(destination: Key, keyWeight: (Key, Double), keysWeights: (Key, Double)*): Result[Long]

def zlexcount(key: Key, min: LexLimit[Value] = LexLimit.MinusInf, max: LexLimit[Value] = LexLimit.PlusInf): Result[Long]

def zrange(key: Key, start: Long = 0, stop: Long = 1): Result[Seq[Value]]

def zrangeWithscores(key: Key, start: Long = 0, stop: Long = 1): Result[Seq[(Value, Double)]]

def zrangebylex(key: Key, min: LexLimit[Value] = LexLimit.MinusInf, max: LexLimit[Value] = LexLimit.PlusInf, limit: commons.OptArg[Limit] = OptArg.Empty): Result[Seq[Value]]

def zrangebyscore(key: Key, min: ScoreLimit = ScoreLimit.MinusInf, max: ScoreLimit = ScoreLimit.PlusInf, limit: commons.OptArg[Limit] = OptArg.Empty): Result[Seq[Value]]

def zrangebyscoreWithscores(key: Key, min: ScoreLimit = ScoreLimit.MinusInf, max: ScoreLimit = ScoreLimit.PlusInf, limit: commons.OptArg[Limit] = OptArg.Empty): Result[Seq[(Value, Double)]]

def zrank(key: Key, member: Value): Result[commons.Opt[Long]]

def zrem(key: Key, members: Iterable[Value]): Result[Int]

def zrem(key: Key, member: Value, members: Value*): Result[Int]

def zrem(key: Key, member: Value): Result[Boolean]

def zremrangebylex(key: Key, min: LexLimit[Value] = LexLimit.MinusInf, max: LexLimit[Value] = LexLimit.PlusInf): Result[Long]

def zremrangebyrank(key: Key, start: Long = 0, stop: Long = 1): Result[Long]

def zremrangebyscore(key: Key, min: ScoreLimit = ScoreLimit.MinusInf, max: ScoreLimit = ScoreLimit.PlusInf): Result[Long]

def zrevrange(key: Key, start: Long = 0, stop: Long = 1): Result[Seq[Value]]

def zrevrangeWithscores(key: Key, start: Long = 0, stop: Long = 1): Result[Seq[(Value, Double)]]

def zrevrangebylex(key: Key, max: LexLimit[Value] = LexLimit.PlusInf, min: LexLimit[Value] = LexLimit.MinusInf, limit: commons.OptArg[Limit] = OptArg.Empty): Result[Seq[Value]]

def zrevrangebyscore(key: Key, max: ScoreLimit = ScoreLimit.PlusInf, min: ScoreLimit = ScoreLimit.MinusInf, limit: commons.OptArg[Limit] = OptArg.Empty): Result[Seq[Value]]

def zrevrangebyscoreWithscores(key: Key, max: ScoreLimit = ScoreLimit.PlusInf, min: ScoreLimit = ScoreLimit.MinusInf, limit: commons.OptArg[Limit] = OptArg.Empty): Result[Seq[(Value, Double)]]

def zrevrank(key: Key, member: Value): Result[commons.Opt[Long]]

def zscan(key: Key, cursor: Cursor, matchPattern: commons.OptArg[Value] = OptArg.Empty, count: commons.OptArg[Int] = OptArg.Empty): Result[(Cursor, Seq[(Value, Double)])]

def zscore(key: Key, member: Value): Result[commons.Opt[Double]]

def zunionstore(destination: Key, keys: Iterable[Key], aggregation: commons.OptArg[Aggregation] = OptArg.Empty): Result[Long]

def zunionstore(destination: Key, key: Key, keys: Key*): Result[Long]

def zunionstoreWeights(destination: Key, keysWeights: Iterable[(Key, Double)], aggregation: commons.OptArg[Aggregation] = OptArg.Empty): Result[Long]

def zunionstoreWeights(destination: Key, keyWeight: (Key, Double), keysWeights: (Key, Double)*): Result[Long]

Inherited from ApiSubset

Inherited from AnyRef

Inherited from Any

Ungrouped