ROBDD/Ordering.java at master · Giuan0/ROBDD · GitHub

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
128
129
130
131
132
133
134
135
136
137
138
139
140
import ITE.*;
import java.util.ArrayList;
import java.util.Arrays;
public class Ordering{

    ArrayList<String> orderings = new ArrayList<String>();// somente para o getMin
    Tree tree = new Tree();
    Operations op = new Operations();


    public String arrayToOrdering(String [] list){
        String ordering = "";
        for (String i :list ) {
            ordering += i+"<";
        }
        return ordering;
    }

    public Node getMin(String expression){
        tree = new Tree();
        Node root = tree.generateG(expression);
        root.bOrdering = tree.getOrdering();
        Node minN = root;
        int min = op.count(root)+10;
        perm(tree.ordering.toArray(new String[tree.ordering.size()]),tree.ordering.size());
        int count = 0;
        //System.out.println(root.bOrdering);
        //System.out.println(min);
        for (String i : orderings ) {
            tree.setOrdering(i);
            root = tree.generateG(expression);
            int n = op.count(root);
            //System.out.println("{ordering:\""+i+"\", size:"+n+"},");
            if(n<min){
                min = n;
                minN = root;
                root.bOrdering = i;
            }
        }
        orderings.clear();
        //System.out.println(minN.bOrdering);
        //System.out.println(op.count(minN));
        return minN;
    }

    public ArrayList<String> getAllResults(String expression){
        ArrayList<String> results = new ArrayList<String>();
        tree = new Tree();
        Node root = tree.generateG(expression);
        root.bOrdering = tree.getOrdering();
        Node minN = root;
        int min = op.count(root);
        perm(tree.ordering.toArray(new String[tree.ordering.size()]),tree.ordering.size());
        int count = 0;

        for (String i : orderings ) {
            tree.setOrdering(i);
            root = tree.generateG(expression);
            int n = op.count(root);
            results.add(i+" ("+n+")");
        }
        orderings.clear();
        return results;
    }

    public Node window(String expression, String ordering, int window, int level){
        tree.setOrdering(ordering);
        ArrayList<String> windowList = Window.getResult(ordering, window, tree.ordering.get(level));
        Node min = tree.generateG(expression);
        min.bOrdering = tree.getOrdering();
        int minSize = op.count(min);
        for (String i : windowList ) {
            tree.setOrdering(i);
            Node root = tree.generateG(expression);
            int count = op.count(root);
            // System.out.println(i+" - "+count);
            if(count < minSize){
                minSize = count;
                min = root;
                min.bOrdering = i;
            }
        }
        return min;
    }

    public Node window(String expression, int window, int level){
        tree.autoDeclareVariables(expression);
        ArrayList<String> windowList = Window.getResult(tree.getOrdering(), window, tree.ordering.get(level));

        Node min = tree.generateG(expression);
        int minSize = op.count(min);
        for (String i : windowList ) {
            tree.setOrdering(i);
            Node root = tree.generateG(expression);
            int count = op.count(root);
            if(count < minSize){
                minSize = count;
                min = root;
                min.bOrdering = i;
            }
        }
        return min;
    }

    public String arrayListToOrdering(ArrayList<String> list){
        String ordering = "";
        for (String e : list ) {
            ordering +=e+"<";
        }
        return ordering;

    }

    public String weighting(String expression){
        return arrayListToOrdering( Weighting.getResult(expression) );
    }

    //heaps algorith
    public void perm(String [] list, int n)
    {
        if(n == 1)
        {
            orderings.add(arrayToOrdering(list));
        }
        else
        {
            for(int i=0; i<n; i++)
            {
                perm(list,n-1);

                int j = ( n % 2 == 0 ) ? i : 0;

                String t = list[n-1];
                list[n-1] = list[j];
                list[j] = t;
            }
        }
    }

}