stack-graphs

Crates.iostack-graphs
lib.rsstack-graphs
version
sourcesrc
created_at2021-05-05 17:09:02.797607
updated_at2024-12-13 12:40:14.380885
descriptionName binding for arbitrary programming languages
homepagehttps://github.com/github/stack-graphs/tree/main/stack-graphs
repositoryhttps://github.com/github/stack-graphs/
max_upload_size
id393496
Cargo.toml error:TOML parse error at line 21, column 1 | 21 | autolib = false | ^^^^^^^ unknown field `autolib`, expected one of `name`, `version`, `edition`, `authors`, `description`, `readme`, `license`, `repository`, `homepage`, `documentation`, `build`, `resolver`, `links`, `default-run`, `default_dash_run`, `rust-version`, `rust_dash_version`, `rust_version`, `license-file`, `license_dash_file`, `license_file`, `licenseFile`, `license_capital_file`, `forced-target`, `forced_dash_target`, `autobins`, `autotests`, `autoexamples`, `autobenches`, `publish`, `metadata`, `keywords`, `categories`, `exclude`, `include`
size0
Rick Winfrey (rewinfrey)

documentation

README

stack-graphs

The stack-graphs crate provides a Rust implementation of stack graphs, which allow you to define the name resolution rules for an arbitrary programming language in a way that is efficient, incremental, and does not need to tap into existing build or program analysis tools.

To use this library, add the following to your Cargo.toml:

[dependencies]
stack-graphs = "0.14"

Check out our documentation for more details on how to use this library.

Notable changes for each version are documented in the release notes.

Credits

Stack graphs are heavily based on the scope graphs framework from Eelco Visser's group at TU Delft.

License

Licensed under either of

at your option.

Commit count: 1938

cargo fmt