class Barista::Registry(T)

Overview

stores the list of tasks organized in a dependency graph

Defined in:

barista/registry.cr

Constructors

Instance Method Summary

Constructor Detail

def self.new(tasks : Array(T) = [] of T) #

[View source]

Instance Method Detail

def <<(task) #

add a task


[View source]
def [](name : String) : T #

get a single task


[View source]
def []?(name : String) : T | Nil #

[View source]
def dag #

get a directed acyclic graph from a task list


[View source]
def invert #

returns a clone of this object with the dependency graph inverted


[View source]
def reset #

[View source]
def tasks #

[View source]
def upstreams(task : String) : Array(T) #

[View source]
def upstreams(task : T) : Array(T) #

get a flat list of upstream dependencies


[View source]