asdi 0.2.5

Another Simplistic Datalog Implementation (in Rust)
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

@startuml

!include ../model/options.plantuml

class asdi::edb::Predicate #white
hide "asdi::edb::Predicate" members

class asdi::Program #white
hide "asdi::Program" members

namespace asdi::idb::eval {
    class PrecedenceGraph {
        from(program: &Program) : Self
        == paths ==
        edges() : Iterator<PrecedenceNode>
        sources() : HashSet<Predicate>
        targets() : HashSet<Predicate>
        directly_reachable_from(source: &Predicate) : HashSet<Predicate>
        reachable_from(source: &Predicate) : HashSet<Predicate>
        == predicates ==
        is_level_zero(source: &Predicate) : bool
        is_recursive() : bool
        is_positive() : bool
        is_semi_positive() : bool
        is_stratifiable() : bool
    }

    class PrecedenceNode {
        source() : Predicate
        target() : Predicate
        == predicates ==
        is_negative_target() : bool
        is_extensional_target() : bool
    }

    PrecedenceGraph *-> "*" PrecedenceNode
    PrecedenceGraph ..> asdi::edb::Predicate
    PrecedenceGraph ..> asdi::Program

    PrecedenceNode ..> asdi::edb::Predicate
}

@enduml