Key

Instance Constructors

new Key(key: Path, client: Service[Request, Response])

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( ... )
def compareAndSwap(value: Buf, prevIndex: Option[Long] = None, prevValue: Option[Buf] = None, prevExist: Boolean = true): Future[NodeOp]

Set the node's data if the provided preconditions apply to the existing state of the node.
Set the node's data if the provided preconditions apply to the existing state of the node.
If prevIndex is specified, the current node must have the provided index value.
If prevValue is specified, the current node must have the provided value.
If prevExist is false, the node is not required to exist.
def create(value: Option[Buf], ttl: Option[Duration] = None): Future[NodeOp]

Create a new key.
Create a new key.
If the key exists, an error is returned.
If value is None, the key is treated as a directory. In order to create an empty data node, use Some(Buf.Empty).
Optionally, a ttl may be specified to inform etcd to remove the node after some time period (only second-granularity is supported by etcd).
def delete(dir: Boolean = false, recursive: Boolean = false): Future[NodeOp]

Delete a node.
Delete a node.
If dir is not true and the key is a directory, this will operation fail.
If dir and recursive are true, the entire tree is deleted.
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
def events(recursive: Boolean = false, backoff: Stream[Duration] = ...): Event[Try[NodeOp]]

An Event constructed by watching an etcd key.
An Event constructed by watching an etcd key.
If recursive is true, the key's subtree is observed for changes.
When an unexpected error is encountered communicating with the API, the failure is published on the Event and the backoff stream is used to compute the time to wait before retrying. If the backoff stream is exhausted or a fatal error is encountered, it is reported and polling stops.
The Event is not reference-counted, so each observer initiates its own polling loop. This ensures that the initial state of a tree is reported properly.
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def get(recursive: Boolean = false, wait: Boolean = false, waitIndex: Option[Long] = None, quorum: Boolean = false): Future[NodeOp]

Set the contents of a key.
Set the contents of a key.
If recursive is true and this key is a directory, the returned Node contains the entire tree of children.
If wait is true and waitIndex is specified, a response is not received until the node (or one of its children, if recursive is specified) is updated. If wait is true and waitIndex is not specified, a response is not received until the next update to this node (or its children, if recursive).
If quorum is specified, etcd will ensure that the etcd instance is at quorum with the cluster.
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def key(name: String): Key
def key(path: Path): Key
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def path: Path
def set(value: Option[Buf], ttl: Option[Duration] = None, prevExist: Boolean = false): Future[NodeOp]

Set the contents of a key.
Set the contents of a key.
If value is None, the key is treated as a directory. In order to unset the value of a data node, use Some(Buf.Empty).
Optionally, a ttl may be specified to inform etcd to remove the node after some time period (only second-granularity is supported by etcd).
If prevExist is true, the node operation will fail if the node does not already exist.
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( ... )

Related Docs: object Key | package etcd

class Key extends AnyRef

Instance Constructors

new Key(key: Path, client: Service[Request, Response])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def compareAndSwap(value: Buf, prevIndex: Option[Long] = None, prevValue: Option[Buf] = None, prevExist: Boolean = true): Future[NodeOp]

def create(value: Option[Buf], ttl: Option[Duration] = None): Future[NodeOp]

def delete(dir: Boolean = false, recursive: Boolean = false): Future[NodeOp]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def events(recursive: Boolean = false, backoff: Stream[Duration] = ...): Event[Try[NodeOp]]

def finalize(): Unit

def get(recursive: Boolean = false, wait: Boolean = false, waitIndex: Option[Long] = None, quorum: Boolean = false): Future[NodeOp]

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def key(name: String): Key

def key(path: Path): Key

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def path: Path

def set(value: Option[Buf], ttl: Option[Duration] = None, prevExist: Boolean = false): Future[NodeOp]

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

Inherited from AnyRef

Inherited from Any

Ungrouped