com.stripe

dagon

package dagon

Collection of graph algorithms

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. dagon
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. type BoolT[T] = Boolean

  2. abstract class DependantGraph[T] extends AnyRef

    Given Dag and a List of immutable nodes, and a function to get dependencies, compute the dependants (reverse the graph)

  3. sealed trait Expr[N[_], T] extends AnyRef

    Expr[N, T] is an expression of a graph of container nodes N[_] with result type N[T].

  4. sealed trait ExpressionDag[N[_]] extends AnyRef

  5. trait FunctionK[T[_], R[_]] extends AnyRef

    This is a Natural transformation.

  6. sealed class HCache[K[_], V[_]] extends AnyRef

    This is a useful cache for memoizing heterogenously types functions

  7. final class HMap[K[_], V[_]] extends AnyRef

    This is a weak heterogenous map.

  8. final case class Id[T](id: Int) extends Product with Serializable

    The Expressions are assigned Ids.

  9. sealed trait Literal[N[_], T] extends AnyRef

    This represents literal expressions (no variable redirection) of container nodes of type N[T]

  10. type NeighborFn[T] = (T) ⇒ Iterable[T]

  11. trait PartialRule[N[_]] extends Rule[N]

    Often a partial function is an easier way to express rules

  12. trait Rule[N[_]] extends AnyRef

    This implements a simplification rule on ExpressionDags

Value Members

  1. object Expr

  2. object ExpressionDag

  3. object Graphs

  4. object HCache

  5. object HMap

  6. object Literal

  7. object Memoize

Inherited from AnyRef

Inherited from Any

Ungrouped