com.twitter.finagle.Stack

Node

case class Node[T](head: Head, mk: (Params, Stack[T]) ⇒ Stack[T], next: Stack[T]) extends Stack[T] with Product with Serializable

Nodes materialize by transforming the underlying stack in some way.

Linear Supertypes
Serializable, Serializable, Product, Equals, Stack[T], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Node
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. Stack
  7. AnyRef
  8. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Node(head: Head, mk: (Params, Stack[T]) ⇒ Stack[T], next: Stack[T])

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. def ++(right: Stack[T]): Stack[T]

    Produce a new stack representing the concatenation of this with right.

    Produce a new stack representing the concatenation of this with right. Note that this replaces the terminating element of this.

    Definition Classes
    Stack
  5. def +:(stk: Stackable[T]): Stack[T]

    A copy of this Stack with stk prepended.

    A copy of this Stack with stk prepended.

    Definition Classes
    Stack
  6. final def ==(arg0: AnyRef): Boolean

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

    Definition Classes
    Any
  8. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  9. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. def concat(right: Stack[T]): Stack[T]

    Produce a new stack representing the concatenation of this with right.

    Produce a new stack representing the concatenation of this with right. Note that this replaces the terminating element of this.

    Alias for Stack.++.

    Definition Classes
    Stack
  11. def contains(role: Role): Boolean

    Returns whether the stack contains a given role or not.

    Returns whether the stack contains a given role or not.

    Definition Classes
    Stack
  12. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  13. final def exists(pred: (Stack[T]) ⇒ Boolean): Boolean

    Traverse the stack, until you find that pred has been evaluated to true.

    Traverse the stack, until you find that pred has been evaluated to true. If pred finds an element, return true, otherwise, false.

    Definition Classes
    Stack
    Annotations
    @tailrec()
  14. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  15. final def foreach(fn: (Stack[T]) ⇒ Unit): Unit

    Traverse the stack, invoking fn on each element.

    Traverse the stack, invoking fn on each element.

    Definition Classes
    Stack
    Annotations
    @tailrec()
  16. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  17. val head: Head

    The head field of the Stack composes all associated metadata of the topmost element of the stack.

    The head field of the Stack composes all associated metadata of the topmost element of the stack.

    Definition Classes
    NodeStack
    Note

    head does not give access to the value T, use make instead.

    See also

    Stack.Head

  18. def insertAfter[U](target: Role, insertion: U)(implicit csf: CanStackFrom[U, T]): Stack[T]

    Insert the given Stackable after the stack elements matching the argument role.

    Insert the given Stackable after the stack elements matching the argument role. If no elements match the role, then an unmodified stack is returned. insertion must conform to typeclass CanStackFrom.

    Definition Classes
    Stack
  19. def insertAfter(target: Role, insertion: Stackable[T]): Stack[T]

    Insert the given Stackable after the stack elements matching the argument role.

    Insert the given Stackable after the stack elements matching the argument role. If no elements match the role, then an unmodified stack is returned.

    Definition Classes
    Stack
  20. def insertBefore[U](target: Role, insertion: U)(implicit csf: CanStackFrom[U, T]): Stack[T]

    Insert the given Stackable before the stack elements matching the argument role.

    Insert the given Stackable before the stack elements matching the argument role. If no elements match the role, then an unmodified stack is returned. insertion must conform to typeclass CanStackFrom.

    Definition Classes
    Stack
  21. def insertBefore(target: Role, insertion: Stackable[T]): Stack[T]

    Insert the given Stackable before the stack elements matching the argument role.

    Insert the given Stackable before the stack elements matching the argument role. If no elements match the role, then an unmodified stack is returned.

    Definition Classes
    Stack
  22. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  23. def make(params: Params): T

    Materialize the current stack with the given parameters, producing a T-typed value representing the current configuration.

    Materialize the current stack with the given parameters, producing a T-typed value representing the current configuration.

    Definition Classes
    NodeStack
  24. val mk: (Params, Stack[T]) ⇒ Stack[T]

  25. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  26. val next: Stack[T]

  27. final def notify(): Unit

    Definition Classes
    AnyRef
  28. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  29. def prepend(stk: Stackable[T]): Stack[T]

    A copy of this Stack with stk prepended.

    A copy of this Stack with stk prepended.

    An alias for Stack.+:.

    Definition Classes
    Stack
  30. def remove(target: Role): Stack[T]

    Remove all nodes in the stack that match the target role.

    Remove all nodes in the stack that match the target role. Leaf nodes are not removable.

    Definition Classes
    Stack
  31. def replace[U](target: Role, replacement: U)(implicit csf: CanStackFrom[U, T]): Stack[T]

    Replace any stack elements matching the argument role with a given Stackable.

    Replace any stack elements matching the argument role with a given Stackable. If no elements match the role, then an unmodified stack is returned. replacement must conform to typeclass CanStackFrom.

    Definition Classes
    Stack
  32. def replace(target: Role, replacement: Stackable[T]): Stack[T]

    Replace any stack elements matching the argument role with a given Stackable.

    Replace any stack elements matching the argument role with a given Stackable. If no elements match the role, then an unmodified stack is returned.

    Definition Classes
    Stack
  33. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  34. def tails: Iterator[Stack[T]]

    Enumerate each well-formed stack contained within this stack.

    Enumerate each well-formed stack contained within this stack.

    Definition Classes
    Stack
  35. def toString(): String

    Definition Classes
    Stack → AnyRef → Any
  36. def transform(fn: (Stack[T]) ⇒ Stack[T]): Stack[T]

    Transform one stack to another by applying fn on each element; the map traverses on the element produced by fn, not the original stack.

    Transform one stack to another by applying fn on each element; the map traverses on the element produced by fn, not the original stack.

    Definition Classes
    Stack
  37. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from Stack[T]

Inherited from AnyRef

Inherited from Any

Ungrouped