mooncakes.io

README

moonbit-community/moon_dagre/graphlib does not have a README file

#
Attr

pub enum Attr {
  Bool(Bool)
  Int(Int)
  Float(Double)
  String(String)
  Val(Value)
  Point(Point)
  Points(Array[Point])
  Edge(EdgeObj)
  Edges(Array[EdgeObj])
  Strings(Array[String])
  Ints(Array[Int])
}

#
Attrs

source

pub struct Attrs {
  map : Map[String, Attr]
}

#
Attrs::contains

source

fn Attrs::contains(self : Attrs, key : String) -> Bool

#
Attrs::get

source

fn Attrs::get(self : Attrs, key : String) -> Attr?

#
Attrs::get_bool

source

fn Attrs::get_bool(self : Attrs, key : String) -> Bool?

#
Attrs::get_bool_or

source

fn Attrs::get_bool_or(self : Attrs, key : String, fallback : Bool) -> Bool

#
Attrs::get_edge

source

fn Attrs::get_edge(self : Attrs, key : String) -> EdgeObj?

#
Attrs::get_edges

source

fn Attrs::get_edges(self : Attrs, key : String) -> Array[EdgeObj]?

#
Attrs::get_float

source

fn Attrs::get_float(self : Attrs, key : String) -> Double?

#
Attrs::get_float_or

source

fn Attrs::get_float_or(self : Attrs, key : String, fallback : Double) -> Double

#
Attrs::get_int

source

fn Attrs::get_int(self : Attrs, key : String) -> Int?

#
Attrs::get_int_or

source

fn Attrs::get_int_or(self : Attrs, key : String, fallback : Int) -> Int

#
Attrs::get_ints

source

fn Attrs::get_ints(self : Attrs, key : String) -> Array[Int]?

#
Attrs::get_point

source

fn Attrs::get_point(self : Attrs, key : String) -> Point?

#
Attrs::get_points

source

fn Attrs::get_points(self : Attrs, key : String) -> Array[Point]?

#
Attrs::get_string

source

fn Attrs::get_string(self : Attrs, key : String) -> String?

#
Attrs::get_string_or

source

fn Attrs::get_string_or(self : Attrs, key : String, fallback : String) -> String

#
Attrs::get_strings

source

fn Attrs::get_strings(self : Attrs, key : String) -> Array[String]?

#
Attrs::get_value

source

fn Attrs::get_value(self : Attrs, key : String) -> Value?

#
Attrs::keys

source

fn Attrs::keys(self : Attrs) -> Array[String]

#
Attrs::length

source

fn Attrs::length(self : Attrs) -> Int

#
Attrs::remove

source

fn Attrs::remove(self : Attrs, key : String) -> Unit

#
Attrs::set

source

fn Attrs::set(self : Attrs, key : String, value : Attr) -> Unit

#
Attrs::set_bool

source

fn Attrs::set_bool(self : Attrs, key : String, value : Bool) -> Unit

#
Attrs::set_edge

source

fn Attrs::set_edge(self : Attrs, key : String, value : EdgeObj) -> Unit

#
Attrs::set_edges

source

fn Attrs::set_edges(self : Attrs, key : String, value : Array[EdgeObj]) -> Unit

#
Attrs::set_float

source

fn Attrs::set_float(self : Attrs, key : String, value : Double) -> Unit

#
Attrs::set_int

source

fn Attrs::set_int(self : Attrs, key : String, value : Int) -> Unit

#
Attrs::set_ints

source

fn Attrs::set_ints(self : Attrs, key : String, value : Array[Int]) -> Unit

#
Attrs::set_point

source

fn Attrs::set_point(self : Attrs, key : String, value : Point) -> Unit

#
Attrs::set_points

source

fn Attrs::set_points(self : Attrs, key : String, value : Array[Point]) -> Unit

#
Attrs::set_string

source

fn Attrs::set_string(self : Attrs, key : String, value : String) -> Unit

#
Attrs::set_strings

source

fn Attrs::set_strings(self : Attrs, key : String, value : Array[String]) -> Unit

#
Attrs::set_value

source

fn Attrs::set_value(self : Attrs, key : String, value : Value) -> Unit

#
EdgeObj

source

pub struct EdgeObj {
  v : String
  w : String
  name : String?
}

#
EdgeRecord

source

type EdgeRecord

#
Graph

source

pub struct Graph {
  directed : Bool
  multigraph : Bool
  compound : Bool
  graph_label : Attrs
  nodes : Map[String, Attrs]
  node_order : Array[String]
  node_index : Map[String, Int]
  node_seen : @moonbitlang/core/set.Set
Set[String]
  edges : Map[String, EdgeRecord]
  edge_order : Array[String]
  edge_seen : @moonbitlang/core/set.Set
Set[String]
  parent_by_node : Map[String, String]
  children_by_node : Map[String, @moonbitlang/core/set.Set
Set[String]]
  child_seq : Int
  child_add_index : Map[String, Int]
  default_edge_label_fn : () -> Value
}

#
Graph::Graph

source

fn Graph::Graph(directed? : Bool, multigraph? : Bool, compound? : Bool) -> Graph

#
Graph::children

source

fn Graph::children(self : Graph, v? : String) -> Array[String]

#
Graph::edge

source

fn Graph::edge(self : Graph, v : String, w : String, name? : String) -> Value?

#
Graph::edge_count

source

fn Graph::edge_count(self : Graph) -> Int

#
Graph::edge_obj

source

fn Graph::edge_obj(self : Graph, e : EdgeObj) -> Value?

#
Graph::edges

source

fn Graph::edges(self : Graph) -> Array[EdgeObj]

#
Graph::graph

source

fn Graph::graph(self : Graph) -> Attrs

#
Graph::has_edge

source

fn Graph::has_edge(self : Graph, v : String, w : String, name? : String) -> Bool

#
Graph::has_node

source

fn Graph::has_node(self : Graph, v : String) -> Bool

#
Graph::in_edges

source

fn Graph::in_edges(self : Graph, v : String, u? : String) -> Array[EdgeObj]

#
Graph::is_compound

source

fn Graph::is_compound(self : Graph) -> Bool

#
Graph::is_directed

source

fn Graph::is_directed(self : Graph) -> Bool

#
Graph::is_multigraph

source

fn Graph::is_multigraph(self : Graph) -> Bool

#
Graph::neighbors

source

fn Graph::neighbors(self : Graph, v : String) -> Array[String]

#
Graph::new

source

fn Graph::new(directed? : Bool, multigraph? : Bool, compound? : Bool) -> Graph

#
Graph::node

source

fn Graph::node(self : Graph, v : String) -> Attrs

#
Graph::node_count

source

fn Graph::node_count(self : Graph) -> Int

#
Graph::node_edges

source

fn Graph::node_edges(self : Graph, v : String, w? : String) -> Array[EdgeObj]

#
Graph::node_opt

source

fn Graph::node_opt(self : Graph, v : String) -> Attrs?

#
Graph::nodes

source

fn Graph::nodes(self : Graph) -> Array[String]

#
Graph::out_edges

source

fn Graph::out_edges(self : Graph, v : String, w? : String) -> Array[EdgeObj]

#
Graph::parent

source

fn Graph::parent(self : Graph, v : String) -> String?

#
Graph::predecessors

source

fn Graph::predecessors(self : Graph, v : String) -> Array[String]

#
Graph::remove_edge

source

fn Graph::remove_edge(self : Graph, v : String, w : String, name? : String) -> Unit

#
Graph::remove_edge_obj

source

fn Graph::remove_edge_obj(self : Graph, e : EdgeObj) -> Unit

#
Graph::remove_node

source

fn Graph::remove_node(self : Graph, v : String) -> Unit

#
Graph::set_default_edge_label

source

fn Graph::set_default_edge_label(self : Graph, f : () -> Value) -> Unit

Sets the template used for edges without an explicit label.

The function is evaluated immediately. Each edge receives a clone of the resulting value, so labels remain independent without retaining the closure.

#
Graph::set_edge

source

fn Graph::set_edge(self : Graph, v : String, w : String, label? : Value, name? : String) -> Unit

#
Graph::set_edge_obj

source

fn Graph::set_edge_obj(self : Graph, e : EdgeObj, label? : Value) -> Unit

#
Graph::set_graph

source

fn Graph::set_graph(self : Graph, label : Attrs) -> Unit

#
Graph::set_node

source

fn Graph::set_node(self : Graph, v : String, label? : Attrs) -> Unit

#
Graph::set_nodes

source

fn Graph::set_nodes(self : Graph, vs : Array[String], label? : Attrs) -> Unit

#
Graph::set_parent

source

fn Graph::set_parent(self : Graph, v : String, parent? : String) -> Unit

#
Graph::set_path

source

fn Graph::set_path(self : Graph, vs : Array[String], label? : Value) -> Unit

#
Graph::sinks

source

fn Graph::sinks(self : Graph) -> Array[String]

#
Graph::sources

source

fn Graph::sources(self : Graph) -> Array[String]

#
Graph::successors

source

fn Graph::successors(self : Graph, v : String) -> Array[String]

#
Point

source

pub struct Point {
  x : Double
  y : Double
}

#
Value

source

pub enum Value {
  VNull
  VBool(Bool)
  VInt(Int)
  VFloat(Double)
  VString(String)
  VAttrs(Attrs)
}

#
attrs_value

source

fn attrs_value(attrs : Attrs) -> Value

#
clone_attrs

source

fn clone_attrs(attrs : Attrs) -> Attrs

#
clone_value

source

fn clone_value(value : Value) -> Value

#
components

source

fn components(g : Graph) -> Array[Array[String]]

#
edge_obj

source

fn edge_obj(v : String, w : String, name? : String) -> EdgeObj

#
empty_attrs

source

fn empty_attrs() -> Attrs

#
find_cycles

source

fn find_cycles(g : Graph) -> Array[Array[String]]

#
point

source

fn point(x : Double, y : Double) -> Point

#
postorder

source

fn postorder(g : Graph, roots : Array[String]) -> Array[String]

#
preorder

source

fn preorder(g : Graph, roots : Array[String]) -> Array[String]

#
value_as_attrs

source

fn value_as_attrs(value : Value?) -> Attrs?

#
value_as_bool

source

fn value_as_bool(value : Value?) -> Bool?

#
value_as_float

source

fn value_as_float(value : Value?) -> Double?

#
value_as_int

source

fn value_as_int(value : Value?) -> Int?

#
value_as_string

source

fn value_as_string(value : Value?) -> String?

#
value_bool

source

fn value_bool(v : Bool) -> Value

#
value_float

source

fn value_float(v : Double) -> Value

#
value_int

source

fn value_int(v : Int) -> Value

#
value_null

source

fn value_null() -> Value

#
value_string

source

fn value_string(v : String) -> Value

Source Files

Site source Report issue Packages Build queue Skills Statistics

#Attr

#Attrs

#Attrs::contains

#Attrs::get

#Attrs::get_bool

#Attrs::get_bool_or

#Attrs::get_edge

#Attrs::get_edges

#Attrs::get_float

#Attrs::get_float_or

#Attrs::get_int

#Attrs::get_int_or

#Attrs::get_ints

#Attrs::get_point

#Attrs::get_points

#Attrs::get_string

#Attrs::get_string_or

#Attrs::get_strings

#Attrs::get_value

#Attrs::keys

#Attrs::length

#Attrs::remove

#Attrs::set

#Attrs::set_bool

#Attrs::set_edge

#Attrs::set_edges

#Attrs::set_float

#Attrs::set_int

#Attrs::set_ints

#Attrs::set_point

#Attrs::set_points

#Attrs::set_string

#Attrs::set_strings

#Attrs::set_value

#EdgeObj

#EdgeRecord

#Graph

#Graph::Graph

#Graph::children

#Graph::edge

#Graph::edge_count

#Graph::edge_obj

#Graph::edges

#Graph::graph

#Graph::has_edge

#Graph::has_node

#Graph::in_edges

#Graph::is_compound

#Graph::is_directed

#Graph::is_multigraph

#Graph::neighbors

#Graph::new

#Graph::node

#Graph::node_count

#Graph::node_edges

#Graph::node_opt

#Graph::nodes

#Graph::out_edges

#Graph::parent

#Graph::predecessors

#Graph::remove_edge

#Graph::remove_edge_obj

#Graph::remove_node

#Graph::set_default_edge_label

#Graph::set_edge

#Graph::set_edge_obj

#Graph::set_graph

#Graph::set_node

#Graph::set_nodes

#Graph::set_parent

#Graph::set_path

#Graph::sinks

#Graph::sources

#Graph::successors

#Point

#Value

#attrs_value

#clone_attrs

#clone_value

#components

#
Attr

#
Attrs

#
Attrs::contains

#
Attrs::get

#
Attrs::get_bool

#
Attrs::get_bool_or

#
Attrs::get_edge

#
Attrs::get_edges

#
Attrs::get_float

#
Attrs::get_float_or

#
Attrs::get_int

#
Attrs::get_int_or

#
Attrs::get_ints

#
Attrs::get_point

#
Attrs::get_points

#
Attrs::get_string

#
Attrs::get_string_or

#
Attrs::get_strings

#
Attrs::get_value

#
Attrs::keys

#
Attrs::length

#
Attrs::remove

#
Attrs::set

#
Attrs::set_bool

#
Attrs::set_edge

#
Attrs::set_edges

#
Attrs::set_float

#
Attrs::set_int

#
Attrs::set_ints

#
Attrs::set_point

#
Attrs::set_points

#
Attrs::set_string

#
Attrs::set_strings

#
Attrs::set_value

#
EdgeObj

#
EdgeRecord

#
Graph

#
Graph::Graph

#
Graph::children

#
Graph::edge

#
Graph::edge_count

#
Graph::edge_obj

#
Graph::edges

#
Graph::graph

#
Graph::has_edge

#
Graph::has_node

#
Graph::in_edges

#
Graph::is_compound

#
Graph::is_directed

#
Graph::is_multigraph

#
Graph::neighbors

#
Graph::new

#
Graph::node

#
Graph::node_count

#
Graph::node_edges

#
Graph::node_opt

#
Graph::nodes

#
Graph::out_edges

#
Graph::parent

#
Graph::predecessors

#
Graph::remove_edge

#
Graph::remove_edge_obj

#
Graph::remove_node

#
Graph::set_default_edge_label

#
Graph::set_edge

#
Graph::set_edge_obj

#
Graph::set_graph

#
Graph::set_node

#
Graph::set_nodes

#
Graph::set_parent

#
Graph::set_path

#
Graph::sinks

#
Graph::sources

#
Graph::successors

#
Point

#
Value

#
attrs_value

#
clone_attrs

#
clone_value

#
components