🥮 mooncakes.io
    Sign in

    mooncakes-graph

    The mooncakes.io registry as a dependency graph: what depends on what, ranked by direct, transitive and other-owner dependents, with a tree(1)-like CLI.

    mooncakes
    dependency-graph
    dependents
    cli
    Download zip
    Author
    Version
    0.1.0
    License
    Apache-2.0
    Repository
    Last updated
    3 days ago
    Downloads
    20

    #gaato/mooncakes-graph

    The mooncakes.io registry as a dependency graph: what depends on what, and which modules the MoonBit ecosystem depends on the most. It reads the registry index that moon update keeps, so it works offline.

    Unofficial; not affiliated with mooncakes.io or the MoonBit team. The same data as an interactive map: https://gaato.github.io/mooncakes-graph/

    #Command line

    moon update
moonx gaato/mooncakes-graph/cmd/mooncakes-graph dependents gaato/http

    commandoutput
    dependents MODULE...What depends on MODULE, as a tree like tree(1)
    deps MODULE...What MODULE depends on, as a tree
    top [-n N] [--by direct\|transitive\|owners]The most depended-on modules, as TSV
    statsCounts of modules, versions and edges, as JSON
    versions, modulesEvery version, and each module's description, as JSONL

    The trees take tree's -L, --noreport and -J. --help lists the rest.

    #Library

    let index = @fs.read(@fs.index_dir().unwrap())
    let graph = @graph.Graph::new(index.modules)
    let metrics = graph.metrics()
    for node in metrics.ranking(Transitive)[:10] {
      println("\{graph.name(node)}: \{metrics.get(node, Transitive)}")
    }

    Graph follows each module's current version (its last version that is not yanked). metrics counts direct, transitive and other-owner dependents; forest builds the trees the CLI prints; requirement tells which version one module asks of another and whether that is from an older release line.

    #License

    Apache-2.0

    Direction

    source
    pub(all) enum Direction {
      Dependents
      Deps
    } derive(Eq, 
    Debug    )

    Which way to follow dependencies.

    Direction::equal

    source
    fn Direction::equal(Direction, Direction) -> Bool

    Direction::not_equal

    source
    fn Direction::not_equal(x : Direction, y : Direction) -> Bool

    Direction::to_repr

    source

    Forest

    source
    pub struct Forest {
      roots : ArrayView[TreeNode]
      modules : Int
    }

    Trees of what depends on (or what is depended on by) some modules, laid out the way tree(1) lays out directories.

    Graph

    source
    type Graph

    The mooncakes.io registry as a dependency graph, at the current version of every module (@mooncakes_index.Module::current).

    Nodes are numbered 0..<size() in module-name order (@mooncakes_index.compare_names); use find to get a module's node. An edge from a to b means the current version of a depends on b. Dependencies on modules missing from the index, and on the module itself, are not edges.

    test {
      let g = @graph.Graph::from_records([
        @mooncakes_index.VersionRecord::new("a/core", version="0.1.0"),
        @mooncakes_index.VersionRecord::new("b/app", version="0.1.0", deps=[
          @mooncakes_index.Dep::new("a/core", version="0.1.0"),
        ]),
      ])
      let core = g.find("a/core").unwrap()
      assert_eq(g.dependents(core).map(n => g.name(n)), ["b/app"])
    }

    Graph::all_yanked

    source
    fn Graph::all_yanked(self : Graph, node : Int) -> Bool

    Whether every version of the module is yanked.

    Graph::current

    source

    The version that stands for the module: its last version not yanked, or its last version when every one is.

    Graph::dependents

    source
    fn Graph::dependents(self : Graph, node : Int) -> ArrayView[Int]

    What depends on the module, in name order.

    Graph::deps

    source
    fn Graph::deps(self : Graph, node : Int) -> ArrayView[Int]

    What the module's current version depends on, in the order it lists them.

    Graph::find

    source
    fn Graph::find(self : Graph, name : StringView) -> Int?

    The node of the module named name, if the graph has it.

    Graph::forest

    source
    fn Graph::forest(self : Graph, roots : ArrayView[Int], direction : Direction, max_depth? : Int) -> Forest

    The trees from roots in direction, in pre-order. Each module is expanded once, at its first appearance; later appearances, and cycles back to an ancestor, are marked duplicate. Below max_depth levels a node with neighbours is marked truncated instead of expanded; a max_depth of zero or less truncates the roots themselves.

    test {
      let g = @graph.Graph::from_records([
        @mooncakes_index.VersionRecord::new("a/core", version="0.1.0"),
        @mooncakes_index.VersionRecord::new("b/app", version="0.1.0", deps=[
          @mooncakes_index.Dep::new("a/core", version="0.1.0"),
        ]),
      ])
      let f = g.forest([g.find("a/core").unwrap()], Dependents)
      assert_eq(f.modules, 1)
      assert_eq(g.name(f.roots[0].children[0].node), "b/app")
    }

    Graph::from_records

    source

    Builds the graph from version records in publication order per module, as the CLI's versions writes them.

    Graph::history

    source

    Every version of the module, in publication order.

    Graph::isolated

    source
    fn Graph::isolated(self : Graph, node : Int, excluded? : (Int) -> Bool) -> Bool

    Whether the module has no dependency, and no dependent, outside excluded.

    Graph::metrics

    source
    fn Graph::metrics(self : Graph, excluded? : (Int) -> Bool) -> Metrics

    The metrics of every module. An excluded module scores zero and does not count, or carry counts, as a dependent of anything else.

    Graph::name

    source
    fn Graph::name(self : Graph, node : Int) -> String

    Graph::new

    source

    Builds the graph from the modules of the index. Modules without versions and the registry's test modules are left out.

    Graph::owner

    source
    fn Graph::owner(self : Graph, node : Int) -> String

    The owner part of the module's name (moonbitlang in moonbitlang/x).

    Graph::reachable

    source
    fn Graph::reachable(self : Graph, node : Int, direction : Direction, excluded? : (Int) -> Bool) -> Array[Int]

    Every module reached from node in direction, directly or through others, nearest first; node itself is not included. Paths through an excluded module are cut.

    Graph::requirement

    source
    fn Graph::requirement(self : Graph, dependent~ : Int, dependency~ : Int) -> Requirement?

    How dependent's current version asks for dependency, if it does.

    test {
      let g = @graph.Graph::from_records([
        @mooncakes_index.VersionRecord::new("a/core", version="0.1.0"),
        @mooncakes_index.VersionRecord::new("a/core", version="0.2.0"),
        @mooncakes_index.VersionRecord::new("b/app", version="0.1.0", deps=[
          @mooncakes_index.Dep::new("a/core", version="0.1.0"),
        ]),
      ])
      let r = g
        .requirement(
          dependent=g.find("b/app").unwrap(),
          dependency=g.find("a/core").unwrap(),
        )
        .unwrap()
      assert_eq(r.asked, Some("0.1.0"))
      assert_true(r.behind)
    }

    Graph::requirements

    source
    fn Graph::requirements(self : Graph, node : Int) -> Array[Requirement]

    Every dependency of the module's current version, in the order it lists them, including ones the index does not have.

    Graph::size

    source
    fn Graph::size(self : Graph) -> Int

    The number of modules, so nodes are 0..<size().

    Graph::stats

    source
    fn Graph::stats(self : Graph) -> Stats

    Metric

    source
    pub(all) enum Metric {
      Direct
      Transitive
      Owners
    } derive(Eq, 
    Debug    )

    A way to count how much a module is depended on.

    Metric::equal

    source
    fn Metric::equal(Metric, Metric) -> Bool

    Metric::not_equal

    source
    fn Metric::not_equal(x : Metric, y : Metric) -> Bool

    Metric::to_repr

    source

    Metrics

    source
    type Metrics

    The three metrics for every module of one graph.

    Metrics::get

    source
    fn Metrics::get(self : Metrics, node : Int, metric : Metric) -> Int

    Metrics::ranking

    source
    fn Metrics::ranking(self : Metrics, metric : Metric, among? : ArrayView[Int]) -> Array[Int]

    Modules from most to least depended on by metric, ties in name order: every module, or only those among.

    test {
      let g = @graph.Graph::from_records([
        @mooncakes_index.VersionRecord::new("a/core", version="0.1.0"),
        @mooncakes_index.VersionRecord::new("b/app", version="0.1.0", deps=[
          @mooncakes_index.Dep::new("a/core", version="0.1.0"),
        ]),
      ])
      let top = g.metrics().ranking(Transitive)
      assert_eq(top.map(n => g.name(n)), ["a/core", "b/app"])
    }

    Requirement

    source
    pub struct Requirement {
      name : String
      node : Int?
      asked : String?
      behind : Bool
      yanked : Bool
    } derive(Eq, 
    Debug    )

    One dependency of a module's current version, as it asks for it.

    Requirement::equal

    source
    fn Requirement::equal(Requirement, Requirement) -> Bool

    Requirement::not_equal

    source
    fn Requirement::not_equal(x : Requirement, y : Requirement) -> Bool

    Requirement::to_repr

    source

    Stats

    source
    pub struct Stats {
      modules : Int
      versions : Int
      modules_with_deps : Int
      edges : Int
      dangling_edges : Int
      all_yanked : Int
    } derive(Eq, 
    Debug    )

    The registry at a glance.

    Stats::equal

    source
    fn Stats::equal(Stats, Stats) -> Bool

    Stats::not_equal

    source
    fn Stats::not_equal(x : Stats, y : Stats) -> Bool

    Stats::to_repr

    source

    TreeNode

    source
    pub struct TreeNode {
      node : Int
      children : ArrayView[TreeNode]
      duplicate : Bool
      truncated : Bool
    }

    One module in a Forest.

    Source Files

    Powered by MoonBit

    Site sourceReport issuePackagesBuild queueSkillsStatistics

    © 2026 mooncakes.io