Instance Constructors
-
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
-
-
-
-
-
-
def
/:[B](z: B)(op: (B, Dentry) ⇒ B): B
-
-
def
:\[B](z: B)(op: (Dentry, B) ⇒ B): B
-
final
def
==(arg0: Any): Boolean
-
-
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
-
def
aggregate[B](z: ⇒ B)(seqop: (B, Dentry) ⇒ B, combop: (B, B) ⇒ B): B
-
-
def
append(dentry: Dentry): Dtab
-
-
def
applyOrElse[A1 <: Int, B1 >: Dentry](x: A1, default: (A1) ⇒ B1): B1
-
final
def
asInstanceOf[T0]: T0
-
def
canEqual(that: Any): Boolean
-
def
clone(): AnyRef
-
-
-
-
-
def
compose[A](g: (A) ⇒ Int): (A) ⇒ Dentry
-
def
concat(dtab: Dtab): Dtab
-
def
contains[A1 >: Dentry](elem: A1): Boolean
-
def
containsSlice[B](that: GenSeq[B]): Boolean
-
def
copyToArray[B >: Dentry](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: Dentry](xs: Array[B]): Unit
-
def
copyToArray[B >: Dentry](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: Dentry](dest: Buffer[B]): Unit
-
-
-
-
-
-
-
-
-
def
endsWith[B](that: GenSeq[B]): Boolean
-
-
-
-
-
-
def
finalize(): Unit
-
-
-
-
def
fold[A1 >: Dentry](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, Dentry) ⇒ B): B
-
def
foldRight[B](z: B)(op: (Dentry, B) ⇒ B): B
-
-
def
foreach[U](f: (Dentry) ⇒ U): Unit
-
-
final
def
getClass(): Class[_]
-
-
-
def
hasDefiniteSize: Boolean
-
def
hashCode(): Int
-
-
-
def
indexOf[B >: Dentry](elem: B, from: Int): Int
-
def
indexOf[B >: Dentry](elem: B): Int
-
def
indexOfSlice[B >: Dentry](that: GenSeq[B], from: Int): Int
-
def
indexOfSlice[B >: Dentry](that: GenSeq[B]): Int
-
-
-
def
indices: Range
-
-
-
-
def
isDefinedAt(idx: Int): Boolean
-
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
isTraversableAgain: Boolean
-
-
-
def
lastIndexOf[B >: Dentry](elem: B, end: Int): Int
-
def
lastIndexOf[B >: Dentry](elem: B): Int
-
def
lastIndexOfSlice[B >: Dentry](that: GenSeq[B], end: Int): Int
-
def
lastIndexOfSlice[B >: Dentry](that: GenSeq[B]): Int
-
-
-
-
def
length: Int
-
def
lengthCompare(len: Int): Int
-
-
-
-
-
def
maxBy[B](f: (Dentry) ⇒ B)(implicit cmp: Ordering[B]): Dentry
-
-
def
minBy[B](f: (Dentry) ⇒ B)(implicit cmp: Ordering[B]): Dentry
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
-
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
-
-
-
-
-
-
-
-
def
print(printer: PrintWriter): Unit
-
def
product[B >: Dentry](implicit num: Numeric[B]): B
-
def
reduce[A1 >: Dentry](op: (A1, A1) ⇒ A1): A1
-
def
reduceLeft[B >: Dentry](op: (B, Dentry) ⇒ B): B
-
def
reduceLeftOption[B >: Dentry](op: (B, Dentry) ⇒ B): Option[B]
-
def
reduceOption[A1 >: Dentry](op: (A1, A1) ⇒ A1): Option[A1]
-
def
reduceRight[B >: Dentry](op: (Dentry, B) ⇒ B): B
-
def
reduceRightOption[B >: Dentry](op: (Dentry, B) ⇒ B): Option[B]
-
-
-
-
-
-
def
runWith[U](action: (Dentry) ⇒ U): (Int) ⇒ Boolean
-
-
def
scan[B >: Dentry, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[IndexedSeq[Dentry], B, That]): That
-
def
scanLeft[B, That](z: B)(op: (B, Dentry) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[Dentry], B, That]): That
-
def
scanRight[B, That](z: B)(op: (Dentry, B) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[Dentry], B, That]): That
-
-
-
def
show: String
-
def
simplified: Dtab
-
def
size: Int
-
-
-
-
-
-
-
-
-
def
startsWith[B](that: GenSeq[B], offset: Int): Boolean
-
def
startsWith[B](that: GenSeq[B]): Boolean
-
def
stringPrefix: String
-
def
stripPrefix(prefix: Dtab): Dtab
-
def
sum[B >: Dentry](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
-
-
-
-
-
-
-
def
toArray[B >: Dentry](implicit arg0: ClassTag[B]): Array[B]
-
def
toBuffer[A1 >: Dentry]: Buffer[A1]
-
-
-
-
-
-
def
toMap[T, U](implicit ev: <:<[Dentry, (T, U)]): Map[T, U]
-
-
def
toSet[B >: Dentry]: Set[B]
-
-
def
toString(): String
-
-
-
-
-
def
unzip[A1, A2](implicit asPair: (Dentry) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])
-
def
unzip3[A1, A2, A3](implicit asTriple: (Dentry) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])
-
def
updated[B >: Dentry, That](index: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[Dentry], B, That]): That
-
-
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
-
-
def
zipAll[B, A1 >: Dentry, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[IndexedSeq[Dentry], (A1, B), That]): That
-
Inherited from Serializable
Inherited from DtabBase
Inherited from HasNewBuilder[Dentry, IndexedSeq[com.twitter.finagle.Dentry] @scala.annotation.unchecked.uncheckedVariance]
A Dtab--short for delegation table--comprises a sequence of delegation rules. Together, these describe how to bind a com.twitter.finagle.Path to a set of com.twitter.finagle.Addr. com.twitter.finagle.naming.DefaultInterpreter implements the default binding strategy.
The user guide for further details.