stack-graphs 0.14.1

Name binding for arbitrary programming languages
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127

// -*- coding: utf-8 -*-
// ------------------------------------------------------------------------------------------------
// Copyright © 2023, stack-graphs authors.
// Licensed under either of Apache License, Version 2.0, or MIT license, at your option.
// Please see the LICENSE-APACHE or LICENSE-MIT files in this distribution for license details.
// ------------------------------------------------------------------------------------------------

use itertools::Itertools;
use stack_graphs::graph::StackGraph;
use stack_graphs::partial::PartialPaths;
use stack_graphs::storage::SQLiteWriter;
use stack_graphs::NoCancellation;

use crate::util::create_partial_path_and_edges;
use crate::util::create_pop_symbol_node;
use crate::util::create_push_symbol_node;

fn test_foo_bar_root_candidate_paths(symbols: &[&str], variable: bool) -> usize {
    let mut reader = {
        let mut writer = SQLiteWriter::open_in_memory().unwrap();

        let mut graph = StackGraph::new();
        let file = graph.add_file("test1").unwrap();
        let mut partials = PartialPaths::new();

        let r = StackGraph::root_node();
        let foo = create_pop_symbol_node(&mut graph, file, "foo", true);
        let bar = create_pop_symbol_node(&mut graph, file, "bar", true);

        let path_with_variable =
            create_partial_path_and_edges(&mut graph, &mut partials, &[r, foo, bar]).unwrap();

        let mut path_without_variable = path_with_variable.clone();
        path_without_variable.eliminate_precondition_stack_variables(&mut partials);

        writer
            .store_result_for_file(
                &graph,
                file,
                "",
                &mut partials,
                vec![&path_with_variable, &path_without_variable],
            )
            .unwrap();

        writer.into_reader()
    };

    {
        let (graph, partials, _) = reader.get();
        let file = graph.add_file("test2").unwrap();

        let r = StackGraph::root_node();
        let refs = symbols
            .into_iter()
            .map(|r| create_push_symbol_node(graph, file, *r, true))
            .chain(std::iter::once(r))
            .collect_vec();
        let mut path = create_partial_path_and_edges(graph, partials, &refs).unwrap();
        if !variable {
            path.eliminate_precondition_stack_variables(partials);
        }

        reader
            .load_partial_path_extensions(&path, &NoCancellation)
            .unwrap();

        let (graph, partials, db) = reader.get();
        let mut results = Vec::new();
        db.find_candidate_partial_paths_from_root(
            graph,
            partials,
            Some(path.symbol_stack_postcondition),
            &mut results,
        );

        results.len()
    }
}

#[test]
fn find_candidates_for_exact_symbol_stack_with_variable() {
    // <"foo","bar",%2> ~ <"foo","bar",%1> | yes, %2 = %1
    // <"foo","bar",%2> ~ <"foo","bar">    | yes, %2 = <>
    let results = test_foo_bar_root_candidate_paths(&["bar", "foo"], true);
    assert_eq!(2, results);
}

#[test]
fn find_candidates_for_exact_symbol_stack_without_variable() {
    // <"foo","bar"> ~ <"foo","bar",%1> | yes, %1 = <>
    // <"foo","bar"> ~ <"foo","bar">    | yes
    let results = test_foo_bar_root_candidate_paths(&["bar", "foo"], false);
    assert_eq!(2, results);
}

#[test]
fn find_candidates_for_longer_symbol_stack_with_variable() {
    // <"foo","bar","quz",%2> ~ <"foo","bar",%1> | yes, %1 = <"quz",%2>
    // <"foo","bar","quz",%2> ~ <"foo","bar">    | no
    let results = test_foo_bar_root_candidate_paths(&["quz", "bar", "foo"], true);
    assert_eq!(1, results);
}

#[test]
fn find_candidates_for_longer_symbol_stack_without_variable() {
    // <"foo","bar","quz"> ~ <"foo","bar",%1> | yes, %1 = <"quz">
    // <"foo","bar","quz"> ~ <"foo","bar">    | no
    let results = test_foo_bar_root_candidate_paths(&["quz", "bar", "foo"], false);
    assert_eq!(1, results);
}

#[test]
fn find_candidates_for_shorter_symbol_stack_with_variable() {
    // <"foo",%2> ~ <"foo","bar",%1> | yes, %2 = <"bar",%1>
    // <"foo",%2> ~ <"foo","bar">    | yes, %2 = <"bar">
    let results = test_foo_bar_root_candidate_paths(&["foo"], true);
    assert_eq!(2, results);
}

#[test]
fn find_candidates_for_shorter_symbol_stack_without_variable() {
    // <"foo"> ~ <"foo","bar",%1> | no
    // <"foo"> ~ <"foo","bar">    | no
    let results = test_foo_bar_root_candidate_paths(&["foo"], false);
    assert_eq!(0, results);
}